English Centering Diphthong Production By Polish Learners of English

The paper shows how British English centering diphthongs are adapted to the vowel space of Polish learners of English. The goal is to focus on complex vowels and the interaction of qualitative and quantitative features. Acoustic analysis revealed various processes used to overcome pronunciation difficulties: /j/ and /w/ breaking, /r/ insertion, substitutions of other vocalic qualities, changes in diphthong duration and diphthong phases duration, and changes in the rate of frequency change

Controls for space structures

Assembly and operation of large space structures (LSS) in orbit will require robot-assisted docking and berthing of partially-assembled structures. These operations require new solutions to the problems of controls. This is true because of large transient and persistent disturbances, controller-structure interaction with unmodeled modes, poorly known structure parameters, slow actuator/sensor dynamical behavior, and excitation of nonlinear structure vibrations during control and assembly. For on-orbit assembly, controllers must start with finite element models of LSS and adapt on line to the best operating points, without compromising stability. This is not easy to do, since there are often unmodeled dynamic interactions between the controller and the structure. The indirect adaptive controllers are based on parameter estimation. Due to the large number of modes in LSS, this approach leads to very high-order control schemes with consequent poor stability and performance. In contrast, direct model reference adaptive controllers operate to force the LSS to track the desirable behavior of a chosen model. These schemes produce simple control algorithms which are easy to implement on line. One problem with their use for LSS has been that the model must be the same dimension as the LSS - i.e., quite large. A control theory based on the command generator tracker (CGT) ideas of Sobel, Mabins, Kaufman and Wen, Balas to obtain very low-order models based on adaptive algorithms was developed. Closed-loop stability for both finite element models and distributed parameter models of LSS was proved. In addition, successful numerical simulations on several LSS databases were obtained. An adaptive controller based on our theory was also implemented on a flexible robotic manipulator at Martin Marietta Astronautics. Computation schemes for controller-structure interaction with unmodeled modes, the residual mode filters or RMF, were developed. The RMF theory was modified to compensate slow actuator/sensor dynamics. These new ideas are being applied to LSS simulations to demonstrate the ease with which one can incorporate slow actuator/sensor effects into our design. It was also shown that residual mode filter compensation can be modified for small nonlinearities to produce exponentially stable closed-loop control. A theory for disturbance accommodating controllers based on reduced order models of structures was developed, and stability results for these controllers in closed-loop with large-scale finite element models of structures were obtained

Lift-and-project inequalities

The lift-and-project technique is a systematic way to generate valid inequalities for a mixed binary program. The technique is interesting both on the theoretical and on the practical point of view. On the theoretical side it allows one to construct the inequality description of the convex hull of all mixed-{0,1} solutions of a binary MIP in n repeated applications of the technique, where n is the number of binary variables. On the practical side, a variant of the method allows one to derive some cutting planes from the simplex tableau rather efficiently

When Lift-and-Project Cuts are Different

In this paper, we present a method to determine if a lift-and-project cut for a mixed-integer linear program is irregular, in which case the cut is not equivalent to any intersection cut from the bases of the linear relaxation. This is an important question due to the intense research activity for the past decade on cuts from multiple rows of simplex tableau as well as on lift-and-project cuts from non-split disjunctions. While it is known since Balas and Perregaard (2003) that lift-and-project cuts from split disjunctions are always equivalent to intersection cuts and consequently to such multi-row cuts, Balas and Kis (2016) have recently shown that there is a necessary and sufficient condition in the case of arbitrary disjunctions: a lift-and-project cut is regular if, and only if, it corresponds to a regular basic solution of the Cut Generating Linear Program (CGLP). This paper has four contributions. First, we state a result that simplifies the verification of regularity for basic CGLP solutions from Balas and Kis (2016). Second, we provide a mixed-integer formulation that checks whether there is a regular CGLP solution for a given cut that is regular in a broader sense, which also encompasses irregular cuts that are implied by the regular cut closure. Third, we describe a numerical procedure based on such formulation that identifies irregular lift-and-project cuts. Finally, we use this method to evaluate how often lift-and-project cuts from simple $t$-branch split disjunctions are irregular, and thus not equivalent to multi-row cuts, on 74 instances of the MIPLIB benchmarks.Comment: INFORMS Journal on Computing (to appear

Experimental experience with flexible structures

The focus is on a flexible structure experiment developed at the California Institute of Technology. The main thrust of the experiment is to address the identification and robust control issues associated with large space structures by capturing their characteristics in the laboratory. The design, modeling, identification and control objectives will be discussed. Also, the subject of uncertainty in structural plant models and the frequency shaping of performance objectives will be expounded upon. Theoretical and experimental results of control laws designed using the identified model and uncertainty descriptions will be presented

Metal-air batteries symposium compendium of papers presented for publication

Papers presented at symposium on metal-air batterie

Parameter estimation of large flexible aerospace structures with application to the control of the Maypole Deployable Reflector

Systems such as the Maypole deployable reflector have a distributed parameter nature. The flexible column and hoop structure and the circular antenna of 30-100 meter diameter which it supports are described by partial, rather than ordinary, differential equations. Progress completed in reduced order modelling andd controller design and digital parameter estimation and control is summarized. Topics covered include depolyment and on-orbit operation; quasi-static (steady state) operation; dynamic distributed parameter system; autoregressive moving average identification; frequency domain procedures; direct or implicit active control; adaptive observers; parameter estimation using a linear reinforcement learning factor; feedback control; and reduced order modeling for nonlinear systems

Percolation-like Scaling Exponents for Minimal Paths and Trees in the Stochastic Mean Field Model

In the mean field (or random link) model there are $n$ points and inter-point distances are independent random variables. For $0 < \ell < \infty$ and in the $n \to \infty$ limit, let $\delta(\ell) = 1/n \times$ (maximum number of steps in a path whose average step-length is $\leq \ell$). The function $\delta(\ell)$ is analogous to the percolation function in percolation theory: there is a critical value $\ell_* = e^{-1}$ at which $\delta(\cdot)$ becomes non-zero, and (presumably) a scaling exponent $\beta$ in the sense $\delta(\ell) \asymp (\ell - \ell_*)^\beta$. Recently developed probabilistic methodology (in some sense a rephrasing of the cavity method of Mezard-Parisi) provides a simple albeit non-rigorous way of writing down such functions in terms of solutions of fixed-point equations for probability distributions. Solving numerically gives convincing evidence that $\beta = 3$. A parallel study with trees instead of paths gives scaling exponent $\beta = 2$. The new exponents coincide with those found in a different context (comparing optimal and near-optimal solutions of mean-field TSP and MST) and reinforce the suggestion that these scaling exponents determine universality classes for optimization problems on random points.Comment: 19 page

Intermediate integer programming representations using value disjunctions

We introduce a general technique to create an extended formulation of a mixed-integer program. We classify the integer variables into blocks, each of which generates a finite set of vector values. The extended formulation is constructed by creating a new binary variable for each generated value. Initial experiments show that the extended formulation can have a more compact complete description than the original formulation. We prove that, using this reformulation technique, the facet description decomposes into one ``linking polyhedron'' per block and the ``aggregated polyhedron''. Each of these polyhedra can be analyzed separately. For the case of identical coefficients in a block, we provide a complete description of the linking polyhedron and a polynomial-time separation algorithm. Applied to the knapsack with a fixed number of distinct coefficients, this theorem provides a complete description in an extended space with a polynomial number of variables.Comment: 26 pages, 5 figure