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     

The effect of microreflections on decision feedback equalization

In coaxial cable modems and terrestrial broadcasting, the appearance and disappearance of microreflections cause a temporary drop in SNR at the equalizer output. We describe mathematically the effect of the appearance/disappearance of a microreflection on the performance of a previously trained fractionally spaced equalizer     

Tensile and flexural creep rupture tests on partially-damaged concrete specimens

Three series of novel tensile and flexural creep tests on partially-damaged concrete specimens were carried out in order to gain some insight into creep crack growth and failure of strain-softening materials. In the tests, each specimen was initially loaded to a given point in the descending branch and thus had a lower load-carrying capacity than that at the peak-point. Then, the specimen was unloaded and reloaded to sustain a load which was from 70% to 95% of its current load-carrying capacity. Experimental creep curves display a three-stage process, consisting of primary, secondary and tertiary stages, with a decreasing, constant and increasing creep rate, respectively. The secondary stage dominates the whole failure lifetime, whereas both the secondary and tertiary stages are important in terms of creep deformation. Failure life-time seems to be more sensitive to the change of load level in flexural tests rather than in tensile tests. The decrease in load-carrying capacity due to damage tends to result in a shorter failure lifetime and a lower critical load level for creep rupture. The descending branch of the static load-deflection or load-CMOD curve may be used as an envelope criterion for creep fracture.     

Bat-deafness in day-flying moths (Lepidoptera, Notodontidae, Dioptinae)

Assuming that bat-detection is the primary function of moth ears, the ears of moths that are no longer exposed to bats should be deaf to echolocation call frequencies. To test this, we compared the auditory threshold curves of 7 species of Venezuelan day-flying moths (Notodontidae: Dioptinae) to those of 12 sympatric species of nocturnal moths (Notodontidae: Dudusinae, Noctuidae and Arctiidae). Whereas 2 dioptines (Josia turgida, Zunacetha annulata) revealed normal ears, 2 (J. radians, J. gopala) had reduced hearing at bat-specific frequencies (20-80 kHz) and the remaining 3 (Thirmida discinota, Polypoetes circumfumata and Xenorma cytheris) revealed pronounced to complete levels of high-frequency deafness. Although the bat-deaf ears of dioptines could function in other purposes (e.g., social communication), the poor sensitivities of these species even at their best frequencies suggest that these moths represent a state of advanced auditory degeneration brought about by their diurnal life history. The phylogeny of the Notodontidae further suggests that this deafness is a derived (apomorphic) condition and not a retention of a primitive (pleisiomorphic), insensitive state.