Consensus under general convexity

A method is proposed to characterize contraction of a set through orthogonal projections. For discrete-time multi-agent systems, quantitative estimates of convergence (to a consensus) rate are provided by means of contracting convex sets. Required convexity for the sets that should include the values that the transition maps of agents take is considered in a more general sense than that of Euclidean geometry. © 2007 IEEE.

Delayed control of a Moore-Greitzer axial compressor model

Several feedback control laws have appeared in the literature concerning the stabilization of the nonlinear Moore-Greitzer axial compression model. Motivated by magnitude and rate limitations imposed by the physical implementation of the control law, Larsen et al. studied a dynamic implementation of the S-controller suggested by Sepulchre and Kokotović. They showed the potential benefit of implementing the S-controller through a first-order lag: while the location of the closed-loop equilibrium achieved with the static control law was sensitive to poorly known parameters, the dynamic implementation resulted in a small limit cycle at a very desirable location, insensitive to parameter variations. In this paper, we investigate the more general case when the control is applied with a time delay. This can be seen as an extension of the model with a first-order lag. The delay can either be a result of system constraints or be deliberately implemented to achieve better system behavior. The resulting closed-loop system is a set of parameter-dependent delay differential equations. Numerical bifurcation analysis is used to study this model and investigate whether the positive results obtained for the first-order model persist, even for larger values of the delay.

Local equilibrium of the Gibbs interface in two-phase systems

We analyze the local equilibrium assumption for interfaces from the perspective of gauge transformations, which are the small displacements of Gibbs' dividing surface. The gauge invariance of thermodynamic properties turns out to be equivalent to conditions for jumps of bulk densities across the interface. This insight strengthens the foundations of the local equilibrium assumption for interfaces and can be used to characterize nonequilibrium interfaces in a compact and consistent way, with a clear focus on gauge-invariant properties. Using the principle of gauge invariance, we show that the validity of Clapeyron equations can be extended to nonequilibrium interfaces, and an additional jump condition for the momentum density is recognized to be of the Clapeyron type. © 2012 Europhysics Letters Association.

A general mass law for broadband energy harvesting

It is well known that the power absorbed by a linear oscillator when excited by white noise base acceleration depends only on the mass of the oscillator and the spectral density of the base motion. This places an upper bound on the energy that can be harvested from a linear oscillator under broadband excitation, regardless of the stiffness of the system or the damping factor. It is shown here that the same result applies to any multi-degree-of-freedom nonlinear system that is subjected to white noise base acceleration: for a given spectral density of base motion the total power absorbed is proportional to the total mass of the system. The only restriction to this result is that the internal forces are assumed to be a function of the instantaneous value of the state vector. The result is derived analytically by several different approaches, and numerical results are presented for an example two-degree-of-freedom-system with various combinations of linear and nonlinear damping and stiffness. © 2013 The Author.

The mismatched multiple-access channel: General alphabets

This paper considers channel coding for the memoryless multiple-access channel with a given (possibly suboptimal) decoding rule. Non-asymptotic bounds on the error probability are given, and a cost-constrained random-coding ensemble is used to obtain an achievable error exponent. The achievable rate region recovered by the error exponent coincides with that of Lapidoth in the discrete memoryless case, and remains valid for more general alphabets. © 2013 IEEE.