NASA control research overview

An overview of NASA research activities related to the control of aeronautical vehicles is presented. A groundwork is laid by showing the organization at NASA Headquarters for supporting programs and providing funding. Then a synopsis of many of the ongoing activities is presented, some of which will be presented in greater detail elsewhere. A major goal of the workshop is to provide a showcase of ongoing NASA sponsored research. Then, through the panel sessions and conversations with workshop participants, it is hoped to glean a focus for future directions in aircraft controls research

Compositional closure for Bayes Risk in probabilistic noninterference

We give a sequential model for noninterference security including probability (but not demonic choice), thus supporting reasoning about the likelihood that high-security values might be revealed by observations of low-security activity. Our novel methodological contribution is the definition of a refinement order and its use to compare security measures between specifications and (their supposed) implementations. This contrasts with the more common practice of evaluating the security of individual programs in isolation. The appropriateness of our model and order is supported by our showing that our refinement order is the greatest compositional relation --the compositional closure-- with respect to our semantics and an "elementary" order based on Bayes Risk --- a security measure already in widespread use. We also relate refinement to other measures such as Shannon Entropy. By applying the approach to a non-trivial example, the anonymous-majority Three-Judges protocol, we demonstrate by example that correctness arguments can be simplified by the sort of layered developments --through levels of increasing detail-- that are allowed and encouraged by compositional semantics

Infinite-Dimensional Estabrook-Wahlquist Prolongations for the sine-Gordon Equation

We are looking for the universal covering algebra for all symmetries of a given pde, using the sine-Gordon equation as a typical example for a non-evolution equation. For non-evolution equations, Estabrook-Wahlquist prolongation structures for non-local symmetries depend on the choice of a specific sub-ideal, of the contact module, to define the pde. For each inequivalent such choice we determine the most general solution of the prolongation equations, as sub-algebras of the (infinite-dimensional) algebra of all vector fields over the space of non-local variables associated with the pde, in the style of Vinogradov covering spaces. We show explicitly how previously-known prolongation structures, known to lie within the Kac-Moody algebra, $A_1^{(1)}$, are special cases of these general solutions, although we are unable to identify the most general solutions with previously-studied algebras. We show the existence of gauge transformations between prolongation structures, viewed as determining connections over the solution space, and use these to relate (otherwise) distinct algebras. Faithful realizations of the universal algebra allow integral representations of the prolongation structure, opening up interesting connections with algebras of Toeplitz operators over Banach spaces, an area that has only begun to be explored.Comment: 46 pages, plain TeX, no figures, to be published in J. Math. Phys

Avionics and controls research and technology

The workshop provided a forum for industry and universities to discuss the state-of-the-art, identify the technology needs and opportunities, and describe the role of NASA in avionics and controls research

Wrinkling of a bilayer membrane

The buckling of elastic bodies is a common phenomenon in the mechanics of solids. Wrinkling of membranes can often be interpreted as buckling under constraints that prohibit large amplitude deformation. We present a combination of analytic calculations, experiments, and simulations to understand wrinkling patterns generated in a bilayer membrane. The model membrane is composed of a flexible spherical shell that is under tension and that is circumscribed by a stiff, essentially incompressible strip with bending modulus B. When the tension is reduced sufficiently to a value \sigma, the strip forms wrinkles with a uniform wavelength found theoretically and experimentally to be \lambda = 2\pi(B/\sigma)^{1/3}. Defects in this pattern appear for rapid changes in tension. Comparison between experiment and simulation further shows that, with larger reduction of tension, a second generation of wrinkles with longer wavelength appears only when B is sufficiently small.Comment: 9 pages, 5 color figure

Predicting the Use of Campus Counseling Services for Asian/Pacific Islander, Latino/Hispanic, and White Students: Problem Severity, Gender, and Generational Status

The purpose of the current study was to identify predictors of counseling center use among Asian, Latino/a, and White college students. Findings indicated that females and second generation students report the most severe difficulties. Problem severity and gender predicted counseling center use for White and Asian students, whereas only problem severity predicted use for Latino students. Generational status was not a significant predictor of use for any group

Nonlinear optical probe of tunable surface electrons on a topological insulator

We use ultrafast laser pulses to experimentally demonstrate that the second-order optical response of bulk single crystals of the topological insulator Bi$_2$Se$_3$ is sensitive to its surface electrons. By performing surface doping dependence measurements as a function of photon polarization and sample orientation we show that second harmonic generation can simultaneously probe both the surface crystalline structure and the surface charge of Bi$_2$Se$_3$. Furthermore, we find that second harmonic generation using circularly polarized photons reveals the time-reversal symmetry properties of the system and is surprisingly robust against surface charging, which makes it a promising tool for spectroscopic studies of topological surfaces and buried interfaces

Algorithmic Analysis of Qualitative and Quantitative Termination Problems for Affine Probabilistic Programs

In this paper, we consider termination of probabilistic programs with real-valued variables. The questions concerned are: 1. qualitative ones that ask (i) whether the program terminates with probability 1 (almost-sure termination) and (ii) whether the expected termination time is finite (finite termination); 2. quantitative ones that ask (i) to approximate the expected termination time (expectation problem) and (ii) to compute a bound B such that the probability to terminate after B steps decreases exponentially (concentration problem). To solve these questions, we utilize the notion of ranking supermartingales which is a powerful approach for proving termination of probabilistic programs. In detail, we focus on algorithmic synthesis of linear ranking-supermartingales over affine probabilistic programs (APP's) with both angelic and demonic non-determinism. An important subclass of APP's is LRAPP which is defined as the class of all APP's over which a linear ranking-supermartingale exists. Our main contributions are as follows. Firstly, we show that the membership problem of LRAPP (i) can be decided in polynomial time for APP's with at most demonic non-determinism, and (ii) is NP-hard and in PSPACE for APP's with angelic non-determinism; moreover, the NP-hardness result holds already for APP's without probability and demonic non-determinism. Secondly, we show that the concentration problem over LRAPP can be solved in the same complexity as for the membership problem of LRAPP. Finally, we show that the expectation problem over LRAPP can be solved in 2EXPTIME and is PSPACE-hard even for APP's without probability and non-determinism (i.e., deterministic programs). Our experimental results demonstrate the effectiveness of our approach to answer the qualitative and quantitative questions over APP's with at most demonic non-determinism.Comment: 24 pages, full version to the conference paper on POPL 201

Stochastic Invariants for Probabilistic Termination

Termination is one of the basic liveness properties, and we study the termination problem for probabilistic programs with real-valued variables. Previous works focused on the qualitative problem that asks whether an input program terminates with probability~1 (almost-sure termination). A powerful approach for this qualitative problem is the notion of ranking supermartingales with respect to a given set of invariants. The quantitative problem (probabilistic termination) asks for bounds on the termination probability. A fundamental and conceptual drawback of the existing approaches to address probabilistic termination is that even though the supermartingales consider the probabilistic behavior of the programs, the invariants are obtained completely ignoring the probabilistic aspect. In this work we address the probabilistic termination problem for linear-arithmetic probabilistic programs with nondeterminism. We define the notion of {\em stochastic invariants}, which are constraints along with a probability bound that the constraints hold. We introduce a concept of {\em repulsing supermartingales}. First, we show that repulsing supermartingales can be used to obtain bounds on the probability of the stochastic invariants. Second, we show the effectiveness of repulsing supermartingales in the following three ways: (1)~With a combination of ranking and repulsing supermartingales we can compute lower bounds on the probability of termination; (2)~repulsing supermartingales provide witnesses for refutation of almost-sure termination; and (3)~with a combination of ranking and repulsing supermartingales we can establish persistence properties of probabilistic programs. We also present results on related computational problems and an experimental evaluation of our approach on academic examples.Comment: Full version of a paper published at POPL 2017. 20 page

Completely positive maps with memory

The prevailing description for dissipative quantum dynamics is given by the Lindblad form of a Markovian master equation, used under the assumption that memory effects are negligible. However, in certain physical situations, the master equation is essentially of a non-Markovian nature. This paper examines master equations that possess a memory kernel, leading to a replacement of white noise by colored noise. The conditions under which this leads to a completely positive, trace-preserving map are discussed for an exponential memory kernel. A physical model that possesses such an exponential memory kernel is presented. This model contains a classical, fluctuating environment based on random telegraph signal stochastic variables.Comment: 4 page