Synthetic DNA and Biology (Nobel Lecture)

Most of the significant work has been summarized in a number of reviews and articles. In these there was, of necessity, a good deal of simplification and omission of detail…. With the passage of time, even I find myself accepting such simplified accounts. F Sanger^[1]     

Multiplicities of interpoint distances in finite planar sets

What is the maximum number of unit distances between the vertices of a convex n-gon in the plane? We review known partial results for this and other open questions on multiple occurrences of the same interpoint distance in finite planar subsets. Some new results are proved for small n. Challenging conjectures, both old and new, are highlighted.     

Particle Breakup in Shock Waves Studies by single Particle Light Scattering

The breakup of suspended, agglomerated submicron particles was studied by exposing the aerosol to weak shock waves of varying strength under conditions 400 ms^?1?v?880 ms^?1. A newly developed laser light-scattering diagnostic employing a top hat laser profile was used to size the particles passing through a very small scattering volume. By Comparing the optically measured particle size in front of and behind shock waves, the breakup of agglomerated particles could be clearly identified. The experiments indicate that the aerodynamic forces behind an incident shock overcome the particle binding force resulting in disintegration of the submicron agglomerates. The results are presented in form of a modified Weber number.     

Pure adaptive search in global optimization

Pure adaptive seach iteratively constructs a sequence of interior points uniformly distributed within the corresponding sequence of nested improving regions of the feasible space. That is, at any iteration, the next point in the sequence is uniformly distributed over the region of feasible space containing all points that are strictly superior in value to the previous points in the sequence. The complexity of this algorithm is measured by the expected number of iterations required to achieve a given accuracy of solution. We show that for global mathematical programs satisfying the Lipschitz condition, its complexity increases at mostlinearly in the dimension of the problem.This work was supported in part by NATO grant 0119/89.