Strong practical stability based robust stabilization of uncertain discrete linear repetitive processes

Repetitive processes are a distinct class of 2D systems of both theoretical and practical interest whose dynamics evolve over a subset of the positive quadrant in the 2D plane. The stability theory for these processes originally consisted of two distinct concepts termed asymptotic stability and stability along the pass respectively where the former is a necessary condition for the latter. Stability along the pass demands a bounded-input bounded-output property over the complete positive quadrant of the 2D plane and this is a very strong requirement, especially in terms of control law design. A more feasible alternative for some cases is strong practical stability, where previous work has formulated this property and obtained necessary and sufficient conditions for its existence together with Linear Matrix Inequality (LMI) based tests, which then extend to allow control law design. This paper develops considerably simpler, and hence computationally more efficient, stability tests that extend to allow control law design in the presence of uncertainty in process model

An Inter-molecular Adaptive Collision Scheme for Chemical Reaction Optimization

Optimization techniques are frequently applied in science and engineering research and development. Evolutionary algorithms, as a kind of general-purpose metaheuristic, have been shown to be very effective in solving a wide range of optimization problems. A recently proposed chemical-reaction-inspired metaheuristic, Chemical Reaction Optimization (CRO), has been applied to solve many global optimization problems. However, the functionality of the inter-molecular ineffective collision operator in the canonical CRO design overlaps that of the on-wall ineffective collision operator, which can potential impair the overall performance. In this paper we propose a new inter-molecular ineffective collision operator for CRO for global optimization. To fully utilize our newly proposed operator, we also design a scheme to adapt the algorithm to optimization problems with different search space characteristics. We analyze the performance of our proposed algorithm with a number of widely used benchmark functions. The simulation results indicate that the new algorithm has superior performance over the canonical CRO

Quantum study of information delay in electromagetically induced transparency

Using electromagnetically induced transparency (EIT), it is possible to delay and store light in atomic ensembles. Theoretical modelling and recent experiments have suggested that the EIT storage mechanism can be used as a memory for quantum information. We present experiments that quantify the noise performance of an EIT system for conjugate amplitude and phase quadratures. It is shown that our EIT system adds excess noise to the delayed light that has not hitherto been predicted by published theoretical modelling. In analogy with other continuous-variable quantum information systems, the performance of our EIT system is characterised in terms of conditional variance and signal transfer.Comment: 4 pages, 4 figure

Topology design and performance analysis of an integrated communication network

A research study on the topology design and performance analysis for the Space Station Information System (SSIS) network is conducted. It is begun with a survey of existing research efforts in network topology design. Then a new approach for topology design is presented. It uses an efficient algorithm to generate candidate network designs (consisting of subsets of the set of all network components) in increasing order of their total costs, and checks each design to see if it forms an acceptable network. This technique gives the true cost-optimal network, and is particularly useful when the network has many constraints and not too many components. The algorithm for generating subsets is described in detail, and various aspects of the overall design procedure are discussed. Two more efficient versions of this algorithm (applicable in specific situations) are also given. Next, two important aspects of network performance analysis: network reliability and message delays are discussed. A new model is introduced to study the reliability of a network with dependent failures. For message delays, a collection of formulas from existing research results is given to compute or estimate the delays of messages in a communication network without making the independence assumption. The design algorithm coded in PASCAL is included as an appendix