Multiple, discrete arcs on sunward convecting field lines in the 14-15 MLT region

Ionospheric plasma flow measurements and simultaneous observations of thin (∼0.2° invariant latitude (ILAT)), multiple, longitudinally extended auroral arcs of transient nature within 74°-76° ILAT and 1030-1130 UT (∼14-15 MLT) on January 12, 1989, are reported. The auroral structures appeared within the luminous belt of strong 630.0-nm emissions located predominantly on sunward convecting field lines equatorward of the convection reversal boundary as identified by the European Incoherent Scatter UHF radar. The events occurred during a period of several hours quasi-steady solar wind speed (∼ 700 km s−1) and a radially orientated interplanetary magnetic field (IMF) with a weak northward tilt (IMF Bz>0). These typical dayside auroral features are related to previous studies of auroral activity related to the upward region 1 current in the postnoon sector. The discrete auroral events presented here may result from magnetosheath plasma injections into the low-latitude boundary layer (LLBL) and an associated dynamo mechanism. An alternative explanation invokes kinetic Alfvén waves, triggered either by Kelvin-Helmholtz instability at the inner (or outer) edge of the LLBL or by pressure pulse induced magnetopause surface waves.

H ∞ state feedback control of discrete-time Markov jump linear systems through linear matrix inequalities

This paper addresses the H ∞ state-feedback control design problem of discretetime Markov jump linear systems. First, under the assumption that the Markov parameter is measured, the main contribution is on the LMI characterization of all linear feedback controllers such that the closed loop output remains bounded by a given norm level. This results allows the robust controller design to deal with convex bounded parameter uncertainty, probability uncertainty and cluster availability of the Markov mode. For partly unknown transition probabilities, the proposed design problem is proved to be less conservative than one available in the current literature. An example is solved for illustration and comparisons. © 2011 IFAC.

Information Filtering and Array Algorithms for Discrete-Time Markovian Jump Linear Systems

This technical note develops information filter and array algorithms for a linear minimum mean square error estimator of discrete-time Markovian jump linear systems. A numerical example for a two-mode Markovian jump linear system, to show the advantage of using array algorithms to filter this class of systems, is provided.

A new adaptive multiple modelling approach for non-linear and non-stationary systems

This paper proposes a novel adaptive multiple modelling algorithm for non-linear and non-stationary systems. This simple modelling paradigm comprises K candidate sub-models which are all linear. With data available in an online fashion, the performance of all candidate sub-models are monitored based on the most recent data window, and M best sub-models are selected from the K candidates. The weight coefficients of the selected sub-model are adapted via the recursive least square (RLS) algorithm, while the coefficients of the remaining sub-models are unchanged. These M model predictions are then optimally combined to produce the multi-model output. We propose to minimise the mean square error based on a recent data window, and apply the sum to one constraint to the combination parameters, leading to a closed-form solution, so that maximal computational efficiency can be achieved. In addition, at each time step, the model prediction is chosen from either the resultant multiple model or the best sub-model, whichever is the best. Simulation results are given in comparison with some typical alternatives, including the linear RLS algorithm and a number of online non-linear approaches, in terms of modelling performance and time consumption.

On the solution of the extended linear complementarity problem

The extended linear complementarity problem (XLCP) has been introduced in a recent paper by Mangasarian and Pang. In the present research, minimization problems with simple bounds associated to this problem are defined. When the XLCP is solvable, their solutions are global minimizers of the associated problems. Sufficient conditions that guarantee that stationary points of the associated problems are solutions of the XLCP will be proved. These theoretical results support the conjecture that local methods for box constrained optimization applied to the associated problems could be efficient tools for solving the XLCP. (C) 1998 Elsevier B.V. All rights reserved.

Linear quadratic Gaussian control of discrete-time Markov jump linear systems with horizon defined by stopping times

The linear quadratic Gaussian control of discrete-time Markov jump linear systems is addressed in this paper, first for state feedback, and also for dynamic output feedback using state estimation. in the model studied, the problem horizon is defined by a stopping time τ which represents either, the occurrence of a fix number N of failures or repairs (T N), or the occurrence of a crucial failure event (τ δ), after which the system paralyzed. From the constructive method used here a separation principle holds, and the solutions are given in terms of a Kalman filter and a state feedback sequence of controls. The control gains are obtained by recursions from a set of algebraic Riccati equations for the former case or by a coupled set of algebraic Riccati equation for the latter case. Copyright © 2005 IFAC.

From discrete anions to extended solids: new uranium thiophosphates

Die wichtigste Klasse zeotyper Verbindungen sind die Thio- und Selenophosphate der Übergangsmetalle. Ziel dieser Dissertation war die Darstellung und Charakterisierung neuer Uranthiophosphate. Die dargestellten Verbindungen enthalten vierwertige Urankationen, die von acht Schwefelatomen koordiniert sind. Da die enthaltenen Thiophosphatanionen in den meisten Fällen als zweizähnige Liganden fungieren, entstehen dreidimensionale Netzwerke mit pseudotetraedrisch koordinierten Metallzentren. In der Verbindung U(P2S6)2 durchdringen sich drei identische diamantartige Netzwerke, wodurch optimale Raumerfüllung erreicht wird. Die Einführung von Alkalimetallkationen in das System führt zu einer Vielzahl neuer Verbindungen, deren Eigenschaften durch die Stöchiometrie der Edukte und durch die Kationenradien bestimmt werden. Beispielsweise enthält die Kristallstruktur von Na2U(PS4)2 zweidimensionale anionische [U(PS4)2]n-Schichten, während die analoge Verbindung CsLiU(PS4)2 eine poröse dreidimensionale Netzwerkstruktur besitzt. Der Vergleich der untersuchten quaternären und quinären Verbindungen zeigt, dass eine Korrelation zwischen dem Kationenradius und dem Durchmesser der Poren besteht. Dies lässt auf eine Templatfunktion der Alkalimetallkationen beim Aufbau der anionischen Teilstruktur schließen. Die neuen Verbindungen wurden aus reaktiven Polysulfidschmelzflüssen oder durch Auflösen amorpher Vorläufer in Alkalimetallchloridschmelzen synthetisiert. Die Kristallstrukturen wurden durch Einkristall-Röntgenmethoden bestimmt. Ein Vergleich der magnetischen Eigenschaften der Verbindungen beweist, dass in allen untersuchten Fällen U(IV) vorliegt. Die Substanzen zeigen paramagnetisches Verhalten, in UP2S7 und CsLiU(PS4)2 sind außerdem antiferromagnetische Wechselwirkungen zwischen benachbarten Uranatomen nachweisbar.

Linear algebra: selected problems

Linear Algebra—Selected Problems is a unique book for senior undergraduate and graduate students to fast review basic materials in Linear Algebra. Vector spaces are presented first, and linear transformations are reviewed secondly. Matrices and Linear systems are presented. Determinants and Basic geometry are presented in the last two chapters. The solutions for proposed excises are listed for readers to references.

A linear algebra approach to OLAP

Inspired by the relational algebra of data processing, this paper addresses the foundations of data analytical processing from a linear algebra perspective. The paper investigates, in particular, how aggregation operations such as cross tabulations and data cubes essential to quantitative analysis of data can be expressed solely in terms of matrix multiplication, transposition and the Khatri–Rao variant of the Kronecker product. The approach offers a basis for deriving an algebraic theory of data consolidation, handling the quantitative as well as qualitative sides of data science in a natural, elegant and typed way. It also shows potential for parallel analytical processing, as the parallelization theory of such matrix operations is well acknowledged.

Linear algebra with applications

Lecture slides and notes for a PhD level course on linear algebra for electrical engineers and computer scientists. This course is given in in the framework of the School of Electronics and Computer Science Mathematics Training Courses https://secure.ecs.soton.ac.uk/notes/pg_maths/ (ECS password required)

Monte Carlo numerical treatment of large linear algebra problems

In this paper we deal with performance analysis of Monte Carlo algorithm for large linear algebra problems. We consider applicability and efficiency of the Markov chain Monte Carlo for large problems, i.e., problems involving matrices with a number of non-zero elements ranging between one million and one billion. We are concentrating on analysis of the almost Optimal Monte Carlo (MAO) algorithm for evaluating bilinear forms of matrix powers since they form the so-called Krylov subspaces. Results are presented comparing the performance of the Robust and Non-robust Monte Carlo algorithms. The algorithms are tested on large dense matrices as well as on large unstructured sparse matrices.