Application of continuous form of dynamic programming and inaccessible state variable theory to the K-8 accelerometer

Dynamic programming and inaccessible state variable theory applied to accelerometer desig

Weight Control System

Weight Control System, a set of linked computer programs which provides weight and balance reports from magnetic tape files, provides weight control and reporting on launch vehicle programs. With minor format modifications the program is applicable to aerospace, marine, automotive and other land transportation industries

Deployable truss structure advanced technology

The 5-meter technology antenna program demonstrated the overall feasibility of integrating a mesh reflector surface with a deployable truss structure to achieve a precision surface contour compatible with future, high-performance antenna requirements. Specifically, the program demonstrated: the feasibility of fabricating a precision, edge-mounted, deployable, tetrahedral truss structure; the feasibility of adjusting a truss-supported mesh reflector contour to a surface error less than 10 mils rms; and good RF test performance, which correlated well with analytical predictions. Further analysis and testing (including flight testing) programs are needed to fully verify all the technology issues, including structural dynamics, thermodynamics, control, and on-orbit RF performance, which are associated with large, deployable, truss antenna structures

Efficiently Learning from Revealed Preference

In this paper, we consider the revealed preferences problem from a learning perspective. Every day, a price vector and a budget is drawn from an unknown distribution, and a rational agent buys his most preferred bundle according to some unknown utility function, subject to the given prices and budget constraint. We wish not only to find a utility function which rationalizes a finite set of observations, but to produce a hypothesis valuation function which accurately predicts the behavior of the agent in the future. We give efficient algorithms with polynomial sample-complexity for agents with linear valuation functions, as well as for agents with linearly separable, concave valuation functions with bounded second derivative.Comment: Extended abstract appears in WINE 201

Language Modeling with Power Low Rank Ensembles

We present power low rank ensembles (PLRE), a flexible framework for n-gram language modeling where ensembles of low rank matrices and tensors are used to obtain smoothed probability estimates of words in context. Our method can be understood as a generalization of n-gram modeling to non-integer n, and includes standard techniques such as absolute discounting and Kneser-Ney smoothing as special cases. PLRE training is efficient and our approach outperforms state-of-the-art modified Kneser Ney baselines in terms of perplexity on large corpora as well as on BLEU score in a downstream machine translation task

New Models for X-Ray Synchrotron Radiation from the Remnant of Supernova 1006 AD

Galactic cosmic rays up to energies of around 10^15 eV are assumed to originate in supernova remnants (SNRs). The shock wave of a young SNR like SN 1006 AD can accelerate electrons to energies greater than 1 TeV, where they can produce synchrotron radiation in the X-ray band. A new model (SRESC) designed to model synchrotron X-rays from Type Ia supernovae can constrain values for the magnetic-field strength and electron scattering properties, with implications for the acceleration of the unseen ions which dominate the cosmic-ray energetics. New observations by ASCA, ROSAT, and RXTE have provided enormously improved data, which now extend to higher X-ray energies. These data allow much firmer constraints. We will describe model fits to these new data on SN 1006 AD, emphasizing the physical constraints that can be placed on SNRs and on the cosmic-ray acceleration process.Comment: 10 pages, 2 figures. to appear in "Cosmic Explosions", proceeding of the 10th Annual October Astrophysics Conference (ed. S.S. Holt and W. W. Zhang) LaTex aipproc.st

Spatial Mixing of Coloring Random Graphs

We study the strong spatial mixing (decay of correlation) property of proper $q$-colorings of random graph $G(n, d/n)$ with a fixed $d$. The strong spatial mixing of coloring and related models have been extensively studied on graphs with bounded maximum degree. However, for typical classes of graphs with bounded average degree, such as $G(n, d/n)$, an easy counterexample shows that colorings do not exhibit strong spatial mixing with high probability. Nevertheless, we show that for $q\ge\alpha d+\beta$ with $\alpha>2$ and sufficiently large $\beta=O(1)$, with high probability proper $q$-colorings of random graph $G(n, d/n)$ exhibit strong spatial mixing with respect to an arbitrarily fixed vertex. This is the first strong spatial mixing result for colorings of graphs with unbounded maximum degree. Our analysis of strong spatial mixing establishes a block-wise correlation decay instead of the standard point-wise decay, which may be of interest by itself, especially for graphs with unbounded degree