This paper proposes a clustered model reduction method for semistable positive linear systems evolving over directed networks. In this method, we construct a set of clusters, i.e., disjoint sets of state variables, based on a notion of cluster reducibility, defined as the uncontrollability of local states. By aggregating the reducible clusters with aggregation coefficients associated with the F...

This paper concerns the recently proposed quasi-balanced truncation model reduction method for linear quantum stochastic systems. It has previously been shown that the quasi-balanceable class of systems (i.e. systems that can be truncated via the quasi-balanced method) includes the class of completely passive systems. In this work, we refine the previously established characterization of quasi-...

This paper discusses the selection process for piezoelectric transducers (PZT) used as actuator elements for suppressing vibrations in a flexible beam system. The effects of changing physical parameters such as the relative thickness of the piezoelectric ceramic with respect to the beam, the optimum location of the PZT actuator, and the length of the PZT are studied based on the singular value ...

In this paper the integration of reliability evaluation in reconfigurability analysis of a fault-tolerant control system is considered. The aim of this work is to contribute to reliable fault-tolerant control design. The admissibility of control reconfigurability is analyzed with respect to reliability requirements. This analysis shows the relationship between reliability and control reconfigur...

A geometric perspective is used to derive the entire family of Welch bounds. This perspective unifies a number of observations that have been made regarding tightness of the bounds and their connections to symmetric k-tensors, tight frames, homogeneous polynomials, and tdesigns. Index Terms – Frames, Grammian, Homogeneous polynomials, Symmetric tensors, t-designs, Welch bounds

The recovery of a set of points in an N -dimensional vector space from their set of mutual distances has a long history. In 1938 Young and Householder gave necessary and sufficient conditions for a set of numbers to be the set of mutual distances between a collection of real points in Euclidean space and gave methods for determining the configuration of these points up to translation and rotati...

Combining classifiers is to join the strengths of different classifiers to improve the classification performance. Using rules to combine the outputs of different classifiers is the basic structure of classifier combination. Fusing models from different kernel machine classifiers is another strategy for combining models called kernel combination. Although classifier combination and kernel combi...

Style transfer methods produce a transferred image which is a rendering of a content image in the manner of a style image. There is a rich literature of variant methods. However, evaluation procedures are qualitative, mostly involving user studies. We describe a novel quantitative evaluation procedure. One plots effectiveness (a measure of the extent to which the style was transferred) against ...

The Hadamard maximal determinant (maxdet) problem is to find the maximum determinant H(n) of a square {+1,−1}-matrix of given order n. Such a matrix with maximum determinant is called a Doptimal design of order n. We consider some cases where n 6= 0 mod 4, so the Hadamard bound is not attainable, but bounds due to Barba or Ehlich and Wojtas may be attainable. If R is a matrix with maximal (or c...