Tensile and Bending Strength of Birch and Beech Lamellas Finger Jointed with Conventional and Newly Developed Finger-Joint Profiles.

In this study, the tensile and bending strength of birch and beech lamellas finger jointed with conventional () and newly developed finger-joint profiles () are presented. Polyurethane (PUR), Melamine-Urea-Formaldehyde (MUF) and Phenol-Resorcinol-Formaldehyde (PRF) adhesive systems were used to bond the finger joints. The objective of the profiles was to reduce the stress concentrations within the finger joint by cutting the cross-grooved fingers perpendicular to the main orientation of the finger-joint profile.

Non-Destructive Evaluation of the Cutting Surface of Hardwood Finger Joints.

In this study, the surface parameters wettability, roughness, and adhesive penetration, which are important for wood bonding, were investigated and evaluated utilizing non-destructive methods after different mechanical processing. For this purpose, beech and birch finger joints were prepared with different cutting combinations (three cutters with different sharpness levels and two feed rates) in an industrial process. Effects and interactions on the surface parameters resulting from the different cutting combinations were evaluated using three Full Factorial Designs.

Delirium on stroke units: a prospective, multicentric quality-improvement project.

Background: Post-stroke delirium (POD) in patients on stroke units (SU) is associated with an increased risk for complications and poorer clinical outcome. The objective was to reduce the severity of POD by implementing an interprofessional delirium-management.

Methods: Multicentric quality-improvement project on five SU implementing a delirium-management with pre/post-comparison.

A simulated annealing heuristic for maximum correlation core/periphery partitioning of binary networks.

A popular objective criterion for partitioning a set of actors into core and periphery subsets is the maximization of the correlation between an ideal and observed structure associated with intra-core and intra-periphery ties. The resulting optimization problem has commonly been tackled using heuristic procedures such as relocation algorithms, genetic algorithms, and simulated annealing. In this paper, we present a computationally efficient simulated annealing algorithm for maximum correlation core/periphery partitioning of binary networks.