Development of deployable structures for large space platform systems. Volume 1: Executive summary

Candidate deployable linear platform system concepts suitable for development to technology readiness by 1986 are reviewed. The systems concepts were based on trades of alternate deployable/retractable structure concepts, integration of utilities, and interface approaches for docking and assembly of payloads and subsystems. The deployable volume studies involved generation of concepts for deployable volumes which could be used as unpressurized or pressurized hangars, habitats and interconnecting tunnels. Concept generation emphasized using flexible materials and deployable truss structure technology

Development of deployable structures for large space platform systems, part 1

Eight deployable platform design objectives were established: autodeploy/retract; fully integrated utilities; configuration variability; versatile payload and subsystem interfaces; structural and packing efficiency; 1986 technology readiness; minimum EVA/RMS; and Shuttle operational compatibility

Development of deployable structures for large space platform systems, volume 2

Ground test article design, deployable volumes concept development, habitat and hangar conceptual designs, and deployable volumes analyses are addressed

Central Exclusive Di-jet Production at the Tevatron

We perform a phenomenological analysis of dijet production in double pomeron exchange at the Tevatron. We find that the CDF Run I results do not rule out the presence of an exclusive dijet component, as predicted by Khoze, Martin and Ryskin (KMR). With the high statistics CDF Run II data, we predict that an exclusive component at the level predicted by KMR may be visible, although the observation will depend on accurate modelling of the inclusive double pomeron exchange process. We also compare to the predictions of the DPEMC Monte Carlo, which contains a non-perturbative model for the central exclusive process. We show that the perturbative model of KMR gives different predictions for the di-jet ET dependence in the high di-jet mass fraction region than non-perturbative models.Comment: 17 pages, 15 figure

Stability and photochemistry of ClO dimers formed at low temperature in the gas phase

The recent observations of elevated concentrations of the ClO radical in the austral spring over Antarctica have implicated catalytic destruction by chlorine in the large depletions seen in the total ozone column. One of the chemical theories consistent with an elevated concentration of the ClO is a cycle involving the formation of the ClO dimer through the association reaction: ClO + ClO = Cl2O2 and the photolysis of the dimer to give the active Cl species necessary for O3 depletion. Here, researchers report experimental studies designed to characterize the dimer of ClO formed by the association reaction at low temperatures. ClO was produced by static photolysis of several different precursor systems: Cl sub 2 + O sub 3; Cl sub 2 O sub 2; OClO + Cl sub 2 O spectroscopy in the U.V. region, which allowed the time dependence of Cl sub 2, Cl sub 2 O, ClO, OClO, O sub 3 and other absorbing molecules to be determined

A PSPACE Construction of a Hitting Set for the Closure of Small Algebraic Circuits

In this paper we study the complexity of constructing a hitting set for the closure of VP, the class of polynomials that can be infinitesimally approximated by polynomials that are computed by polynomial sized algebraic circuits, over the real or complex numbers. Specifically, we show that there is a PSPACE algorithm that given n,s,r in unary outputs a set of n-tuples over the rationals of size poly(n,s,r), with poly(n,s,r) bit complexity, that hits all n-variate polynomials of degree-r that are the limit of size-s algebraic circuits. Previously it was known that a random set of this size is a hitting set, but a construction that is certified to work was only known in EXPSPACE (or EXPH assuming the generalized Riemann hypothesis). As a corollary we get that a host of other algebraic problems such as Noether Normalization Lemma, can also be solved in PSPACE deterministically, where earlier only randomized algorithms and EXPSPACE algorithms (or EXPH assuming the generalized Riemann hypothesis) were known. The proof relies on the new notion of a robust hitting set which is a set of inputs such that any nonzero polynomial that can be computed by a polynomial size algebraic circuit, evaluates to a not too small value on at least one element of the set. Proving the existence of such a robust hitting set is the main technical difficulty in the proof. Our proof uses anti-concentration results for polynomials, basic tools from algebraic geometry and the existential theory of the reals