Linear output feedback compensation of rank-one systems

A new method is presented for arbitrarily assigning the closed-loop poles of a linear multi-input/multi-output system using linear output feedback. The method employs a new notion of rank-one system representations and involves the use of state transformation matrices which preserve such representations while reducing the degree of the feedforward matrix     

Polynomial-complexity deadlock avoidance policies for sequentialresource allocation systems

The development of efficient deadlock avoidance policies (DAPs) for sequential resource allocation systems (RASs) is a problem of increasing interest in the scientific community, largely because of its relevance to the design of large-scale flexibly automated manufacturing systems. Much of the work on this problem existing in the literature is focused on the so-called single-unit RAS model, which is the simplest model in the considered class of RASs. Furthermore, due to a well-established result stating that, even for single-unit RASs, the computation of the maximally permissive DAP is intractable (NP-hard), many researchers (including our group) have focused on obtaining good suboptimal policies which are computationally tractable (scalable) and provably correct. In the first part of the paper, it is shown, however, that for a large subset (in fact, a majority) of single-unit RASs, the optimal DAP can be obtained in real-time with a computational cost which is a polynomial function of the system size (i.e., the number of resource types and the distinct route stages of the processes running through the system). The implications of this result for the entire class of single-unit RASs are also explored. With a result on the design of optimal DAPs for single-unit RASs, the second part of the paper concentrates on the development of scalable and provably correct DAPs for the more general case of conjunctive RASs     

Infinite-dimensional convex optimization in optimal and robustcontrol theory

Many engineering problems can be shown to be equivalent to solving semidefinite programs (SPs), i.e., convex optimization problems involving linear matrix inequalities (LMIs). Powerful computation tools are available for such problems in the finite-dimensional case. However, the problems arising in optimal and robust control theory are often infinite dimensional, and so adequate computation tools are not available. The key to tackling such problems with finite computation tools is to have a primal-dual formulation of the problem without duality gap. In this paper we study infinite-dimensional SPs and present a lifting technique to recast SPs as parameterized linear programs (LPs). This enables the wealth of theoretical tools available for infinite-dimensional LPs to be extended to infinite-dimensional SPs. In particular, we develop some new sufficient conditions for the lack of a duality gap for infinite-dimensional SPs and give an exact characterization of the primal and dual problems for these cases. Both primal and dual problems are formed as infinite-dimensional SP problems, with finite truncations to each giving upper and lower bounds, respectively, on the exact solution to the infinite-dimensional problem. Thus, these results can form the basis of practical computation schemes for infinite-dimensional problems, which require only finite-dimensional computation tools. To illustrate the power of these tools we apply the results to two previously unsolved optimization problems, namely minimizing the l₁ norm of a closed-loop system subject to bounds on the frequency response magnitude at a finite number of points and/or bounds on the H₂ norm     

Structuring communication software for quality-of-serviceguarantees

We propose architectural mechanisms for structuring host communication software to provide QoS guarantees. We present and evaluate a QoS sensitive communication subsystem architecture for end hosts that provides real time communication support for generic network hardware. This architecture provides services for managing communication resources for guaranteed QoS (real time) connections, such as admission control, traffic enforcement, buffer management, and CPU and link scheduling. The architecture design is based on three key goals: maintenance of QoS guarantees on a per connection basis, overload protection between established connections, and fairness in delivered performance to best effort traffic. Using this architecture we implement real time channels, a paradigm for real time communication services in packet switched networks. The proposed architecture features a process per channel model that associates a channel handler with each established channel. The model employed for handler execution is one of “cooperative” preemption, where an executing handler yields the CPU to a waiting higher priority handler at well defined preemption points. The architecture provides several configurable policies for protocol processing and overload protection. We present extensions to the admission control procedure for real time channels to account for cooperative preemption and overlap between protocol processing and link transmission at a sending host. We evaluate the implementation to demonstrate the efficacy with which the architecture maintains QoS guarantees on outgoing traffic while adhering to the stated design goals     

A process model for active brazing of ceramics: Part II Optimization of brazing conditions and joint properties

In the present investigation, the process model developed in Part I has been applied to evaluate the microstructure and strength evolution during active brazing of ceramics. As a starting point, reaction-layer growth is assumed to occur isothermally with no restrictions in the supply of reactive element. Different kinds of diagrams are then constructed to show how specific process variables (e.g. the heating and cooling period, the limiting layer thickness, and the diffusion mechanism) affect the growth kinetics. It is concluded that the key to improved joint properties lies in control of the reaction-layer thickness through optimization of the brazing conditions, and an illustration of this is given. This revised version was published online in November 2006 with corrections to the Cover Date.     

Effect of dynamic strain ageing on the tensile properties of a modified 9Cr–1Mo steel

Tensile testing of a modified 9Cr–1Mo steel in two microstructural conditions (710T– normalized at 1100°C, tempered at 710°C, and 550T – normalized at 1100°C tempered at 550°C) in the temperature range 25–450°C, under strain rates of 2.3×10-5–2.3×10-3s-1, exhibited serrated flow curves, with serrations appearing almost at the onset of deformation and disappearing before ultimate strengths were attained. The serrated flow curves (characteristics of dynamic strain ageing) were accompanied by increased ultimate strengths, loss of ductility and negative strain-rate sensitivity, relative to the ambient temperature properties. However, the increase in ultimate strength and the reduction in ductility were much larger for 710T specimens, as compared to 550T ones. In the dynamic strain ageing regime, the work-hardenability of 710T specimens increased rapidly while that of 550T specimens remained practically unaffected. Based on the microstructural consideration and the observed activation energy of 45 kJ mol-1, it is proposed that serrations are initiated by a nitrogen atmosphere formation on the waiting dislocations by a pipe diffusion mechanism, and they disappear by diffusion to the precipitate sinks during deformation. Because the fine alloy carbide precipitates in 550T specimens are more effective sinks than those of 710T ones, they can cause much faster depletion of the atmosphere, resulting in a much smaller effect of dynamic strain ageing on the tensile properties of 550T specimens.     

A construction of codes with exponential error bounds on arbitrarydiscrete memoryless channels

This correspondence proposes an explicit construction of codes achieving capacity for arbitrary discrete memoryless channels. The proposed code is obtained by concatenating variable inner codes and an algebraic geometry code. Further, we clarify that the proposed code achieves the error exponent obtained by Forney for concatenated codes