Invariance entropy for continuous-time control systems measures how often openloop controls have to be updated in order to render a compact and controlled invariant subset of the state space invariant. A special type of a controlled invariant set for a control-affine system is the closure of a control set, i.e., a maximal set of approximate controllability. In this paper, we investigate the pro...

We consider a continuous dynamical system f : X → X on a compact metric space X equipped with an m-dimensional continuous potential Φ = (φ1, · · · , φm) : X → R . We study the set of ground states GS(α) of the potential α · Φ as a function of the direction vector α ∈ S. We show that the structure of the ground state sets is naturally related to the geometry of the generalized rotation set of Φ....

In this paper, a new way of using phonetic DNN in textindependent speaker recognition is examined. Inspired by the Subspace GMM approach to speech recognition, we try to extract i-vectors that are invariant to the phonetic content of the utterance. We overcome the assumption of Gaussian distributed senones by combining DNN with UBM posteriors and we form a complete EM algorithm for training and...

Consider a closed, smooth manifold M of non-positive curvature. Write p:UM→M for the unit tangent bundle over M and let � > denote the subset consisting of all vectors of higher rank. This subset is closed and invariant under the geodesic flow � on UM. We define the structured dimension s-dim � > which, essentially, is the dimension of the set p(� > ) of base points of � > . The main result of ...

This newly proposed solution to the minimal test generation problem of combinational circuits is based on (1) identifying independent faults, (2) generating tests for them, and (3) minimizing the tests. The third part, test minimization, is accomplished by an already known solution using integer linear programming (ILP). Using the theory of primal-dual linear programs, we model the independent ...

The modified Gram–Schmidt algorithm is a well-known and widely used procedure to orthogonalize the column vectors of a given matrix. When applied to ill-conditioned matrices in floating point arithmetic, the orthogonality among the computed vectors may be lost. In this work, we propose an a posteriori reorthogonalization technique based on a rank-k update of the computed vectors. The level of o...

The modified Gram–Schmidt algorithm is a well–known and widely used procedure to orthogonalize the column vectors of a given matrix. When applied to ill–conditioned matrices in floating point arithmetic, the orthogonality among the computed vectors may be lost. In this work, we propose an a posteriori reorthogonalization technique based on a rank–k update of the computed vectors. The level of o...