A Package of LISP Functions for Making Movies and Demos

Work reported herein was conducted at the Artificial Intelligence Laboratory, a Massachusetts Institute of Technology research program supported in part by the Advanced Research Projects Agency of the Department of Defense and monitored by the Office of Naval Research under Contract Number N00014-70-A-0362-0005. Vision Flashes are informal papers intended for internal use.A collection of functions have been written to allow LISP users to record display calls in a disk file. This file can be UREAD into a small LISP to reproduce the display effects of the program without doing the required computations. Such a file can be regarded as a 'movie' or 'demo' file and can easily be used with the KODAK movie camera to produce a hard copy.MIT Artificial Intelligence Laboratory Robotics Sectio

The TRACK Program Package

Work reported herein was conducted at the Artificial Intelligence Laboratory, a Massachusetts Institute of Technology research program supported in part by the Advanced Research Projects Agency of the Department of Defense and monitored by the Office of Naval Research under Contract Number N00014-70-A-0362-0005. Vision Flashes are informal papers intended for internal use.A collection of LISP functions has been written to provide vidisector users with the following three line-oriented vision primitives: (i) given an initial point and an estimated initial direction, track a line in that direction until the line terminates. (ii) given two points, verify the existence of a line joining those two points. (iii) given the location of a vertex, find suspect directions for possible lines emanating from that vertex.MIT Artificial Intelligence Laboratory Robotics Section Department of Defense Advanced Research Projects Agenc

The symplectic Deligne-Mumford stack associated to a stacky polytope

We discuss a symplectic counterpart of the theory of stacky fans. First, we define a stacky polytope and construct the symplectic Deligne-Mumford stack associated to the stacky polytope. Then we establish a relation between stacky polytopes and stacky fans: the stack associated to a stacky polytope is equivalent to the stack associated to a stacky fan if the stacky fan corresponds to the stacky polytope.Comment: 20 pages; v2: To appear in Results in Mathematic

On Non-Abelian Symplectic Cutting

We discuss symplectic cutting for Hamiltonian actions of non-Abelian compact groups. By using a degeneration based on the Vinberg monoid we give, in good cases, a global quotient description of a surgery construction introduced by Woodward and Meinrenken, and show it can be interpreted in algebro-geometric terms. A key ingredient is the `universal cut' of the cotangent bundle of the group itself, which is identified with a moduli space of framed bundles on chains of projective lines recently introduced by the authors.Comment: Various edits made, to appear in Transformation Groups. 28 pages, 8 figure

Intelligent Self-Repairable Web Wrappers

The amount of information available on the Web grows at an incredible high rate. Systems and procedures devised to extract these data from Web sources already exist, and different approaches and techniques have been investigated during the last years. On the one hand, reliable solutions should provide robust algorithms of Web data mining which could automatically face possible malfunctioning or failures. On the other, in literature there is a lack of solutions about the maintenance of these systems. Procedures that extract Web data may be strictly interconnected with the structure of the data source itself; thus, malfunctioning or acquisition of corrupted data could be caused, for example, by structural modifications of data sources brought by their owners. Nowadays, verification of data integrity and maintenance are mostly manually managed, in order to ensure that these systems work correctly and reliably. In this paper we propose a novel approach to create procedures able to extract data from Web sources -- the so called Web wrappers -- which can face possible malfunctioning caused by modifications of the structure of the data source, and can automatically repair themselves.\u

The Lie-Poisson structure of the reduced n-body problem

The classical n-body problem in d-dimensional space is invariant under the Galilean symmetry group. We reduce by this symmetry group using the method of polynomial invariants. As a result we obtain a reduced system with a Lie-Poisson structure which is isomorphic to sp(2n-2), independently of d. The reduction preserves the natural form of the Hamiltonian as a sum of kinetic energy that depends on velocities only and a potential that depends on positions only. Hence we proceed to construct a Poisson integrator for the reduced n-body problem using a splitting method.Comment: 26 pages, 2 figure

Adaptive Boolean Networks and Minority Games with Time--Dependent Capacities

In this paper we consider a network of boolean agents that compete for a limited resource. The agents play the so called Generalized Minority Game where the capacity level is allowed to vary externally. We study the properties of such a system for different values of the mean connectivity $K$ of the network, and show that the system with K=2 shows a high degree of coordination for relatively large variations of the capacity level.Comment: 4 pages, 4 figure

Lateral Separation of Macromolecules and Polyelectrolytes in Microlithographic Arrays

A new approach to separation of a variety of microscopic and mesoscopic objects in dilute solution is presented. The approach takes advantage of unique properties of a specially designed separation device (sieve), which can be readily built using already developed microlithographic techniques. Due to the broken reflection symmetry in its design, the direction of motion of an object in the sieve varies as a function of its self-diffusion constant, causing separation transverse to its direction of motion. This gives the device some significant and unique advantages over existing fractionation methods based on centrifugation and electrophoresis.Comment: 4 pages with 3 eps figures, needs RevTeX 3.0 and epsf, also available in postscript form http://cmtw.harvard.edu/~deniz

Contact complete integrability

Complete integrability in a symplectic setting means the existence of a Lagrangian foliation leaf-wise preserved by the dynamics. In the paper we describe complete integrability in a contact set-up as a more subtle structure: a flag of two foliations, Legendrian and co-Legendrian, and a holonomy-invariant transverse measure of the former in the latter. This turns out to be equivalent to the existence of a canonical $\R\ltimes \R^{n-1}$ structure on the leaves of the co-Legendrian foliation. Further, the above structure implies the existence of $n$ contact fields preserving a special contact 1-form, thus providing the geometric framework and establishing equivalence with previously known definitions of contact integrability. We also show that contact completely integrable systems are solvable in quadratures. We present an example of contact complete integrability: the billiard system inside an ellipsoid in pseudo-Euclidean space, restricted to the space of oriented null geodesics. We describe a surprising acceleration mechanism for closed light-like billiard trajectories

Regulating the automobile

Division of Policy Research and Analysis. National Science Foundatio