Metering gun for dispensing precisely measured charges of fluid

A cyclically operable fluid dispenser for use in dispensing precisely measured charges of potable water aboard spacecraft is described. The dispenser is characterized by (1) a sealed housing adapted to be held within a crewman's palm and coupled with a pressurized source of potable water; (2) a dispensing jet projected from the housing and configured to be received within a crewman's lips; (3) an expansible measuring chamber for measuring charges of drinking water received from the source; (4) and a dispenser actuator including a lever extended from the housing to be digitated for initiating operational cycles, whereby precisely measured charges of potable water selectively are delivered for drinking purposes in a weightless environment

International Ultraviolet Explorer (IUE) satellite mission analysis

The results are presented of the mission analysis performed by Computer Sciences Corporation (CSC) in support of the International Ultraviolet Explorer (IUE) satellite. The launch window is open for three separate periods (for a total time of 7 months) during the year extending from July 20, 1977, to July 20, 1978. The synchronous orbit shadow constraint limits the launch window to approximately 88 minutes per day. Apogee boost motor fuel was computed to be 455 pounds (206 kilograms) and on-station weight was 931 pounds (422 kilograms). The target orbit is elliptical synchronous, with eccentricity 0.272 and 24 hour period

Nondeterministic Instance Complexity and Proof Systems with Advice

Motivated by strong Karp-Lipton collapse results in bounded arithmetic, Cook and Krajíček [1] have recently introduced the notion of propositional proof systems with advice. In this paper we investigate the following question: Given a language L , do there exist polynomially bounded proof systems with advice for L ? Depending on the complexity of the underlying language L and the amount and type of the advice used by the proof system, we obtain different characterizations for this problem. In particular, we show that the above question is tightly linked with the question whether L has small nondeterministic instance complexity