Influence of the matrix properties on the performances of Er-doped Si nanoclusters light emitting devices

We investigated the properties of light emitting devices whose active layer consists of Er-doped Si nanoclusters (nc) generated by thermal annealing of Er-doped SiOx layers prepared by magnetron cosputtering. Differently from a widely used technique such as plasma enhanced chemical vapor deposition, sputtering allows to synthesize Er-doped Si nc embedded in an almost stoichiometric oxide matrix, so as to deeply influence the electroluminescence properties of the devices. Relevant results include the need for an unexpected low Si excess for optimizing the device efficiency and, above all, the strong reduction of the influence of Auger de-excitation, which represents the main nonradiative path which limits the performances of such devices and their application in silicon nanophotonics. © 2010 American Institute of Physics.

Low-rank optimization for distance matrix completion

This paper addresses the problem of low-rank distance matrix completion. This problem amounts to recover the missing entries of a distance matrix when the dimension of the data embedding space is possibly unknown but small compared to the number of considered data points. The focus is on high-dimensional problems. We recast the considered problem into an optimization problem over the set of low-rank positive semidefinite matrices and propose two efficient algorithms for low-rank distance matrix completion. In addition, we propose a strategy to determine the dimension of the embedding space. The resulting algorithms scale to high-dimensional problems and monotonically converge to a global solution of the problem. Finally, numerical experiments illustrate the good performance of the proposed algorithms on benchmarks. © 2011 IEEE.

Regression on fixed-rank positive semidefinite matrices: A Riemannian approach

The paper addresses the problem of learning a regression model parameterized by a fixed-rank positive semidefinite matrix. The focus is on the nonlinear nature of the search space and on scalability to high-dimensional problems. The mathematical developments rely on the theory of gradient descent algorithms adapted to the Riemannian geometry that underlies the set of fixedrank positive semidefinite matrices. In contrast with previous contributions in the literature, no restrictions are imposed on the range space of the learned matrix. The resulting algorithms maintain a linear complexity in the problem size and enjoy important invariance properties. We apply the proposed algorithms to the problem of learning a distance function parameterized by a positive semidefinite matrix. Good performance is observed on classical benchmarks. © 2011 Gilles Meyer, Silvere Bonnabel and Rodolphe Sepulchre.

Analysis of interconnected oscillators by dissipativity theory

This paper employs dissipativity theory for the global analysis of limit cycles in particular dynamical systems of possibly high dimension. Oscillators are regarded as open systems that satisfy a particular dissipation inequality. It is shown that this characterization has implications for the global stability analysis of limit cycle oscillations: i) in isolated oscillators, ii) in interconnections of oscillators, and iii) for the global synchrony analysis in interconnections of identical oscillators. © 2007 IEEE.

Stabilization and disturbance attenuation of nonlinear systems using dissipativity theory

In this paper, we survey some recent results on stabilization and disturbance attenuation for nonlinear systems using a dissipativity approach. After reviewing the basic dissipativity concept, we stress the connections between Lyapunov designs and the problem of achieving passivity by feedback. Focusing on physical models, we then illustrate how the design of stabilizing feedback can take advantage of the natural energy balance equation of the system. Here stabilization is viewed as the task of shaping the energy of the system to enforce a minimum at the desired equilibrium. Finally, we show the implications of dissipativity theory as an appropriate framework to study the nonlinear H∞ control problem. © 2002 EUCA.

Optimization Algorithms on Matrix Manifolds

This book shows how to exploit the special structure of such problems to develop efficient numerical algorithms.

Stable dynamic walking over rough terrain: Theory and experiment

We propose a constructive control design for stabilization of non-periodic trajectories of underactuated mechanical systems. An important example of such a system is an underactuated "dynamic walking" biped robot walking over rough terrain. The proposed technique is to compute a transverse linearization about the desired motion: a linear impulsive system which locally represents dynamics about a target trajectory. This system is then exponentially stabilized using a modified receding-horizon control design. The proposed method is experimentally verified using a compass-gait walker: a two-degree-of-freedom biped with hip actuation but pointed stilt-like feet. The technique is, however, very general and can be applied to higher degree-of-freedom robots over arbitrary terrain and other impulsive mechanical systems. © 2011 Springer-Verlag.

Fixed-rank matrix factorizations and Riemannian low-rank optimization

Motivated by the problem of learning a linear regression model whose parameter is a large fixed-rank non-symmetric matrix, we consider the optimization of a smooth cost function defined on the set of fixed-rank matrices. We adopt the geometric framework of optimization on Riemannian quotient manifolds. We study the underlying geometries of several well-known fixed-rank matrix factorizations and then exploit the Riemannian quotient geometry of the search space in the design of a class of gradient descent and trust-region algorithms. The proposed algorithms generalize our previous results on fixed-rank symmetric positive semidefinite matrices, apply to a broad range of applications, scale to high-dimensional problems, and confer a geometric basis to recent contributions on the learning of fixed-rank non-symmetric matrices. We make connections with existing algorithms in the context of low-rank matrix completion and discuss the usefulness of the proposed framework. Numerical experiments suggest that the proposed algorithms compete with state-of-the-art algorithms and that manifold optimization offers an effective and versatile framework for the design of machine learning algorithms that learn a fixed-rank matrix. © 2013 Springer-Verlag Berlin Heidelberg.