Reduced-order output feedback controllers for discrete-time systems

This article considers the stabilization by output feedback controllers for discrete-time systems. The controller can place all of the closed-loop poles within a specified disk D(-α, 1/β), centred at (-α,0) with radius 1/β, where | - α|  + 1/β < 1. The design method involves the decomposition of the system into two portions. The first portion comprises of all of the poles that are lying outside of the specified disk. A reduced-order model is constructed for this portion. The second portion comprises of all of the remaining poles of the system and is characterized by an H_∞-norm bound. The controller design is then accomplished by using H_∞-control theory. It is shown that, subject to the solvability of an algebraic Riccati equation, output feedback controllers can be systematically derived. The order of the controller is low, and can be as low as the number of the open-loop poles that are lying outside of the specified disk. A step-by-step design algorithm is provided. Numerical examples are given to illustrate the attractiveness of the design method.

Constrained pole placement for linear systems using low-order output feedback controllers

The paper presents a simple approach to the problem of designing low-order output feedback controllers for linear continuous systems. The controller can place all of the closed-loop poles within a circle, C(- , 1/ β) , with centre at - and radius of 1/ β in the left half s-plane. The design method is based on transformation of the original system and then applying the bounded-real-lemma to the transformed system. It is shown that subjected to the solvability of an algebraic Riccati equation (ARE), output feedback controllers can then be systematically derived. Furthermore, the order of the controller is low and equals only the number of the open-loop poles lying outside the circle. A step-by-step design algorithm is given. Numerical examples are given to illustrate the design method.

MMSE precoder for unitary space–time codes in correlated time-varying channels

This letter addresses the problem of the design of a precoder for multiple transmit antenna communication systems with spatially and temporally correlated fading channels. By using the asymptotic (high signal-to-noise ratio) mean-square error of the channel estimates, the letter derives a precoder for unitary space-time codes that can exploit the spatiotemporal correlation in the time-varying fading channels. Simulation results illustrate that significant performance gains can be achieved by using the new precoder.

An algebraic approach for delay-independent and delay-dependent stability of linear time-delay systems

This paper addresses the problem of asymptotic stability of a linear system with many delay units. A novel algebraic test is proposed for the delay-independent stability of the system, based on the root distribution of the system's characteristic equation. If the system is only stable dependent of delay, the whole stable regions of the system can be perfectly obtained. Two algorithms are derived to examine the delay-independent stability, and to compute the whole stable regions if the system is of delay-dependent stability. These algorithms are computationally efficient and applicable to both certain and uncertain systems. Some illustrative examples demonstrate the validity of the approach.

On the problem of algebraic completeness for the invariants of the Riemann Tensor: I

We present a new determining set, CZ, of Riemann invariants which possesses the minimum degree property. From an analysis on the possible independence of CZ, we are led to the division of all space-times into two distinct, invariantly characterized, classes: a general class M_G+, and a special, singular class M_S For each class, we provide an independent set of invariants (I_G+) ⊂ CZ and I_S ⊂ CZ, respectively) which, with the results of a sequel paper, will be shown to be algebraically complete.

On the problem of algebraic completeness for the invariants of the Riemann tensor. III.

We study the set CZ of invariants [Zakhary and Carminati, J. Math. Phys. 42, 1474 (2001)] for the class of space-times whose Ricci tensors possess a null eigenvector. We show that all cases are maximally backsolvable, in terms of sets of invariants from CZ, but that some cases are not completely backsolvable and these all possess an alignment between an eigenvector of the Ricci tensor with a repeated principal null vector of the Weyl tensor. We provide algebraically complete sets for each canonically different space-time and hence conclude with these results and those of a previous article [Carminati, Zakhary, and McLenaghan, J. Math. Phys. 43, 492 (2002)] that the CZ set is determining or maximal.

Customer repurchase intention: a general structural equation model

This paper develops a general service sector model of repurchase intention from the consumer theory literature. A key contribution of the structural equation model is the incorporation of customer perceptions of equity and value and customer brand preference into an integrated repurchase intention analysis. The model describes the extent to which customer repurchase intention is influenced by seven important factors – service quality, equity and value, customer satisfaction, past loyalty, expected switching cost and brand preference. The general model is applied to customers of comprehensive car insurance and personal superannuation services. The analysis finds that although perceived quality does not directly affect customer satisfaction, it does so indirectly via customer equity and value perceptions. The study also finds that past purchase loyalty is not directly related to customer satisfaction or current brand preference and that brand preference is an intervening factor between customer satisfaction and repurchase intention. The main factor influencing brand preference was perceived value with customer satisfaction and expected switching cost having less influence.

The GHP II package with applications

We present an advanced version of the Maple package GHP called GHPII. In it we provide a number of additional sophisticated tools to assist with problems formulated in the Geroch-Held-Penrose (ghp) formalism. The first part of this article discusses these new tools while in the second part we shall apply the ghp formalism, using the GHPII routines, to vacuum Petrov type D spacetimes and shear-free perfect fluids. We prove that for all shear-free perfect fluids with a barotropic equation of state, where two of the principal null directions are coplanar with the fluid four-velocity and vorticity then either the expansion or vorticity of the fluid must be zero.

Algebraic attacks over GF(q)

Recent algebraic attacks on LFSR-based stream ciphers and S-boxes have generated much interest as they appear to be extremely powerful. Theoretical work has been developed focusing around the Boo- lean function case. In this paper, we generalize this theory to arbitrary finite fields and extend the theory of annihilators and ideals introduced at Eurocrypt 2004 by Meier, Pasalic and Carlet. In particular, we prove that for any function f in the multivariate polynomial ring over GF(q), f has a low degree multiple precisely when two low degree functions appear in the same coset of the annihilator of f ^{q – 1} – 1. In this case, many such low degree multiples exist.

Shear- free perfect fluids with solenoidal magnetic curvature and a γ-law equation of state

We show that shear-free perfect fluids obeying an equation of state p = (γ − 1)μ are non-rotating or non-expanding under the assumption that the spatial divergence of the magnetic part of the Weyl tensor is zero.

Interpreting Fanger's comfort equation within the adaptive paradigm

This paper reviews the evolution of Fanger's heat balance equation in regard of adaptive opportunities. Heat balance and adaptive response are integrated into one model as two fundamental aspects of human-environment interaction that define thermal comfort perception, rather than being seen as two concepts of alternative comfort paradigms. The paper suggests to extent Fanger's model with a heat storage term in order to account for comfort perception under transient thermal conditions, and to review Fanger's modelling assumptions in order to allow for a greater variety of adaptive response options. In the presented model heat exchange is modulated through adaptation of physiological, environmental and behavioural parameters in the human-environment system defined through Fanger's heat exchange equations. A computational prototype is implemented to determine 'comfortable' values and ranges of the six comfort dimensions alternatively to Fanger's comfort indices. Thereby values of for example 'comfortable' clothing and metabolic rate are results rather than necessary input parameters, which are difficult to determine. This approach allows generating design advice for physical, organisational and social environments based on heat balance calculation in the six-dimensional opportunity space defined through Fanger's comfort equation. A starting point for the development of a dynamic adaptive comfort model is set.

Optimal H∞ insulin injection control for blood glucose regulation in diabetic patients

The theory of H/sup /spl infin// optimal control has the feature of minimizing the worst-case gain of an unknown disturbance input. When appropriately modified, the theory can be used to design a "switching" controller that can be applied to insulin injection for blood glucose (BG) regulation. The "switching" controller is defined by a collection of basic insulin rates and a rule that switches the insulin rates from one value to another. The rule employed an estimation of BG from noisy measurements, and the subsequent optimization of a performance index that involves the solution of a "jump" Riccati differential equation and a discrete-time dynamic programming equation. With an appropriate patient model, simulation studies have shown that the controller could correct BG deviation using clinically acceptable insulin delivery rates.

Algebraic attacks on clock-controlled stream ciphers

We present an algebraic attack approach to a family of irregularly clock-controlled bit-based linear feedback shift register systems. In the general set-up, we assume that the output bit of one shift register controls the clocking of other registers in the system and produces a family of equations relating the output bits to the internal state bits. We then apply this general theory to four specific stream ciphers: the (strengthened) stop-and-go generator, the alternating step generator, the self-decimated generator and the step1/step2 generator. In the case of the strengthened stop-and-go generator and of the self-decimated generator, we obtain the initial state of the registers in a significantly faster time than any other known attack. In the other two situations, we do better than or as well as all attacks but the correlation attack. In all cases, we demonstrate that the degree of a functional relationship between the registers can be bounded by two. Finally, we determine the effective key length of all four systems.

Algebraic attacks on clock-controlled cascade ciphers

In this paper, we mount the first algebraic attacks against clock controlled cascade stream ciphers. We first show how to obtain relations between the internal state bits and the output bits of the Gollmann clock controlled cascade stream ciphers. We demonstrate that the initial states of the last two shift registers can be determined by the initial states of the others. An alternative attack on the Gollmann cascade is also described, which requires solving quadratic equations. We then present an algebraic analysis of Pomaranch, one of the phase two proposals to eSTREAM. A system of equations of maximum degree four that describes the full cipher is derived. We also present weaknesses in the filter functions of Pomaranch by successfully computing annihilators and low degree multiples of the functions.

Mutually clock-controlled feedback shift registers provide resistance to algebraic attacks

Algebraic attacks have been applied to several types of clock-controlled stream ciphers. However, to date there are no such attacks in the literature on mutually clock-controlled ciphers. In this paper, we present a preliminary step in this direction by giving the first algebraic analysis of mutually clock-controlled feedback shift register stream ciphers: the bilateral stop-and-go generator, A5/1, Alpha 1 and the MICKEY cipher. We show that, if there are no regularly clocked shift registers included in the system, mutually clock-controlled feedback shift register ciphers appear to be highly resistant to algebraic attacks. As a demonstration of the weakness inherent in the presence of a regularly clocked shift register, we present a simple algebraic attack on Alpha 1 based on only 29 keystream bits.