Method and Composition of Matter for Detecting Large Quantities of Paper Currency, US5057268, 10/15/1991

Paper notes used a monetary currency are deuterated.  The level of deuteration while not complete, is high.  For U.S. currency the level of deuteration is at least 0.1 mg of deuterium for each one dollar in value of the currency note, and preferably at least 0.3 mg.  Use of X-ray or gamma ray interrogation with a beam energy above 2 MeV produces a nuclear reaction releasing a neutron from the deuterium nucleus.  If the currency is in large concentrations. e.g., $100,000 or more, the neutrons emitted by this reaction are reliably detectable.  The deuteration occurs in the cellulose fibers forming the currency.  To resist an exchange of hydrogen atoms for deterium atoms, the deuterium atmos can be used in the formation of synthetic cellulose where the deuterium is more deeply buried within the cellulose molecule than in naturally occurring cellulose.  The deuterated synthetic fibers are blended with natural, non-deuterated fibers to form the paper.  The currency can also include a mechanism, such as dye, to signal attempts to use solvents or otherwise facilitate any such hydrogen substitution.

Algebraic Transform Machine, US5056053, 10/08/1991

The computing machine includes an array of programmable elements programmably interconnected to implement networks of algebraic functions.  Each element provides a sufficient set of logic primitives in the algebra that may be a Boolean algebra.  The elements and the interelement wiring support the communications requirements of large classes of problems and preferably of all problems.  The algebraic transform machine offers highly concurrent operations but avoids many of the programming difficulties of existing concurrent systems. The machine is regular in structure, it extends to large size and capability, and operates at high speed.  In one embodiment, the machine consists of a grid of segments and each segment holds the value (true or false) of a Boolean variable.  Crossing segments do not connect directly but the value on one wire segment can effect the value on another.  The effect of one segment on another is programmable.  An individual element or cell of the algebraic transform machine consists of one crossing and the circuitry associated with that crossing.

Despeckling screen utilizing optical fibers and method of reducing interference using same, US5029975, 07/09/1991

The invention comprises a method and apparatus for decohering coherent light projected onto a screen by transmitting the coherent light through a series of light conducting optical fibers, preferably of varying length.

Datalink controller interface, US5025382, 06/18/1991

A digital data link is provided between an air traffic controller at a ground station and the pilot of an aircraft through digital communication between a computer on that aircraft and a ground-based computer located at the ground station and including an associated display screen containing a spatial representation of the airspace around the aircraft as well as a representation of the location of the aircraft in that airspace. A pointing device is moved to cause movement of a cursor on the display screen, beginning at the representation of the aircraft, corresponding to the movement of the aircraft that the controller intends. In response to this cursor movement, there is generated on the screen a cursorline representative of the movement of the cursor and thus of the intended path of aircraft. The ground-based computer calculates, from the beginning and the end points of the cursorline, and the length of the cursorline, the intended heading of the aircraft and the distance to be flown. Digital data related to calculated intended heading and distance is transmitted to the aircraft computer.

Dynamic address binding in communication networks, US5025491, 06/18/1991

A communications network comprising a plurality of destination stations and associated server stations, each destination station having a unique destination address, and a unique destination name containing no semantic information relating to an associated server station, each server station having a unique server address, and being capable of storing the destination address of each destination station with which it is associated, the server address being found by an algorithmic manipulation of the destination name of any destination station that is associated with the server station.