The Nelder–Mead simplex algorithm, first published in 1965, is an enormously popular direct search method for multidimensional unconstrained minimization. Despite its widespread use, essentially no… (More)

The path taken by a car with a given minimum turning radius has a lower bound on its radius of curvature at each point, but the path has cusps if the car shifts into or out of reverse gear. What is… (More)

The original UNIX system was designed to be small and intelligible, achieving power by generality rather than by a profusion of features. In this spirit we have designed and implemented IX, a… (More)

Fishburn, P.C., J.C. Lagarias, J.A. Reeds and L.A. Shepp, Sets uniquely determined by projections on axes II Discrete case, Discrete Mathematics 91 (1991) 149-159. A subset S of N” = { 1,2, . , N}”… (More)

A random loop, or polygon, is a simple random walk whose trajectory is a simple closed Jordan curve. The study of random loops is extended in two ways. First, the probability P, (x , y ) that a… (More)

Ahstracf-A general cryptanalysis method is presented based on statistical estimation theory. It is applied to two systems of practical interest: rotor machines and substitution-permutation networks.… (More)