We show that the neighbor-joining algorithm is a robust quartet method for constructing trees from distances. This leads to a new performance guarantee that contains Atteson’s optimal radius bound as a special case and explains many cases where neighbor-joining is successful even when Atteson’s criterion is not satisfied. We also provide a proof for Atteson’s conjecture on the optimal edge radi...

Recent advances in nanowire research emphasize on its promising applications in nanoelectronics, nanophotonics, nanomedicine, and nanoelectromechanical systems (NEMS). Even with many advances, the joining of nanowires has become a critical issue for future device miniaturization and integration. With the help of in situ manipulation, directed assembly and self-assembly, much progress has been m...

The neighbour joining method is a distance based method for constructing evolutionary trees [2]. Conceptually, it starts out with a star-formed graph where each leaf corresponds to a species, and iteratively picks two nodes adjacent to the root and joins them, by inserting a new node between the root and the two selected nodes. When joining nodes, the method selects the node pair i; j that mini...

structural sandwich beams are widely used because of their high specific stiffness and strength, noise reduction, thermal insulation and impact energy absorption characteristics. conventional manufacturing method of composite sandwich structures is completed by a separate adhesive joining stage by which the composite faces are joined to the core. in this investigation, liquid phase sintering in...

The impulsive riveting method is described as the punching and joining of sheet metal carried out using the impulsive energy of a weight accelerated by an air compressor. Parts are held together between the rivet and rivet-holder. A hole is made in the sheets by the high speed collision of rivet and a weight (approximately 100 m/s or more). Another method, punch riveting, joins the sheets by pr...

The "neighbor-joining algorithm" is a recursive procedure for reconstructing trees that is based on a transformation of pairwise distances between leaves. We present a generalization of the neighbor-joining transformation, which uses estimates of phylogenetic diversity rather than pairwise distances in the tree. This leads to an improved neighbor-joining algorithm whose total running time is st...