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.

Linear regression under fixed-rank constraints: A Riemannian approach

In this paper, we tackle the problem of learning a linear regression model whose parameter is a fixed-rank matrix. We study the Riemannian manifold geometry of the set of fixed-rank matrices and develop efficient line-search algorithms. The proposed algorithms have many applications, scale to high-dimensional problems, enjoy local convergence properties and confer a geometric basis to recent contributions on learning fixed-rank matrices. Numerical experiments on benchmarks suggest that the proposed algorithms compete with the state-of-the-art, and that manifold optimization offers a versatile framework for the design of rank-constrained machine learning algorithms. Copyright 2011 by the author(s)/owner(s).

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.

Delayed decision-making in bistable models

Switching between two modes of operation is a common property of biological systems. In continuous-time differential equation models, this is often realised by bistability, i.e. the existence of two asymptotically stable steadystates. Several biological models are shown to exhibit delayed switching, with a pronounced transient phase, in particular for near-threshold perturbations. This study shows that this delay in switching from one mode to the other in response to a transient input is reflected in local properties of an unstable saddle point, which has a one dimensional unstable manifold with a significantly slower eigenvalue than the stable ones. Thus, the trajectories first approximatively converge to the saddle point, then linger along the saddle's unstable manifold before quickly approaching one of the stable equilibria. ©2010 IEEE.

Low-rank optimization on the cone of positive semidefinite matrices

We propose an algorithm for solving optimization problems defined on a subset of the cone of symmetric positive semidefinite matrices. This algorithm relies on the factorization X = Y Y T , where the number of columns of Y fixes an upper bound on the rank of the positive semidefinite matrix X. It is thus very effective for solving problems that have a low-rank solution. The factorization X = Y Y T leads to a reformulation of the original problem as an optimization on a particular quotient manifold. The present paper discusses the geometry of that manifold and derives a second-order optimization method with guaranteed quadratic convergence. It furthermore provides some conditions on the rank of the factorization to ensure equivalence with the original problem. In contrast to existing methods, the proposed algorithm converges monotonically to the sought solution. Its numerical efficiency is evaluated on two applications: the maximal cut of a graph and the problem of sparse principal component analysis. © 2010 Society for Industrial and Applied Mathematics.

Riemannian metric and geometric mean for positive semidefinite matrices of fixed rank

This paper introduces a new metric and mean on the set of positive semidefinite matrices of fixed-rank. The proposed metric is derived from a well-chosen Riemannian quotient geometry that generalizes the reductive geometry of the positive cone and the associated natural metric. The resulting Riemannian space has strong geometrical properties: it is geodesically complete, and the metric is invariant with respect to all transformations that preserve angles (orthogonal transformations, scalings, and pseudoinversion). A meaningful approximation of the associated Riemannian distance is proposed, that can be efficiently numerically computed via a simple algorithm based on SVD. The induced mean preserves the rank, possesses the most desirable characteristics of a geometric mean, and is easy to compute. © 2009 Society for Industrial and Applied Mathematics.

HTGR fuel element depletion benchmark: Stage one results

In this paper, we reported the results of the first stage of HTGR fuel element depletion benchmark obtained with BGCore and HELIOS depletion codes. The results of the k-inf are generally in good agreement. However, significant deviation in concentrations of several nuclides between MCNP based and HELIOS codes was observed.

Efficient generation of one-group cross sections for coupled Monte Carlo depletion calculations

Coupled Monte Carlo depletion systems provide a versatile and an accurate tool for analyzing advanced thermal and fast reactor designs for a variety of fuel compositions and geometries. The main drawback of Monte Carlo-based systems is a long calculation time imposing significant restrictions on the complexity and amount of design-oriented calculations. This paper presents an alternative approach to interfacing the Monte Carlo and depletion modules aimed at addressing this problem. The main idea is to calculate the one-group cross sections for all relevant isotopes required by the depletion module in a separate module external to Monte Carlo calculations. Thus, the Monte Carlo module will produce the criticality and neutron spectrum only, without tallying of the individual isotope reaction rates. The onegroup cross section for all isotopes will be generated in a separate module by collapsing a universal multigroup (MG) cross-section library using the Monte Carlo calculated flux. Here, the term "universal" means that a single MG cross-section set will be applicable for all reactor systems and is independent of reactor characteristics such as a neutron spectrum; fuel composition; and fuel cell, assembly, and core geometries. This approach was originally proposed by Haeck et al. and implemented in the ALEPH code. Implementation of the proposed approach to Monte Carlo burnup interfacing was carried out through the BGCORE system. One-group cross sections generated by the BGCORE system were compared with those tallied directly by the MCNP code. Analysis of this comparison was carried out and led to the conclusion that in order to achieve the accuracy required for a reliable core and fuel cycle analysis, accounting for the background cross section (σ0) in the unresolved resonance energy region is essential. An extension of the one-group cross-section generation model was implemented and tested by tabulating and interpolating by a simplified σ0 model. A significant improvement of the one-group cross-section accuracy was demonstrated.

Nonlinear thermoacoustics of ducted premixed flames: The influence of perturbation convection speed

When a premixed flame is placed within a duct, acoustic waves induce velocity perturbations at the flame's base. These travel down the flame, distorting its surface and modulating its heat release. This can induce self-sustained thermoacoustic oscillations. Although the phase speed of these perturbations is often assumed to equal the mean flow speed, experiments conducted in other studies and Direct Numerical Simulation (DNS) conducted in this study show that it varies with the acoustic frequency. In this paper, we examine how these variations affect the nonlinear thermoacoustic behaviour. We model the heat release with a nonlinear kinematic G-equation, in which the velocity perturbation is modelled on DNS results. The acoustics are governed by linearised momentum and energy equations. We calculate the flame describing function (FDF) using harmonic forcing at several frequencies and amplitudes. Then we calculate thermoacoustic limit cycles and explain their existence and stability by examining the amplitude-dependence of the gain and phase of the FDF. We find that, when the phase speed equals the mean flow speed, the system has only one stable state. When the phase speed does not equal the mean flow speed, however, the system supports multiple limit cycles because the phase of the FDF changes significantly with oscillation amplitude. This shows that the phase speed of velocity perturbations has a strong influence on the nonlinear thermoacoustic behaviour of ducted premixed flames. © 2013 The Combustion Institute.

Cabaret finite-difference schemes for the one-dimensional Euler equations

In the present paper we consider second order compact upwind schemes with a space split time derivative (CABARET) applied to one-dimensional compressible gas flows. As opposed to the conventional approach associated with incorporating adjacent space cells we use information from adjacent time layer to improve the solution accuracy. Taking the first order Roe scheme as the basis we develop a few higher (i.e. second within regions of smooth solutions) order accurate difference schemes. One of them (CABARET3) is formulated in a two-time-layer form, which makes it most simple and robust. Supersonic and subsonic shock-tube tests are used to compare the new schemes with several well-known second-order TVD schemes. In particular, it is shown that CABARET3 is notably more accurate than the standard second-order Roe scheme with MUSCL flux splitting.

A one-year investigation of the relationship between serum GH levels and the growth of F-4 transgenic and non-transgenic common carp Cyprinus carpio

It has been demonstrated that growth hormone (GH) transgenic fish often posses a trait for fast growth. Here, we investigated the growth of F-4 'all-fish' GH transgenic carp Cyprinus carpio and their serum GH levels for a year. The results showed that F-4 all-fish GH transgenic carp were significantly larger in body mass (c. two-fold, P < 0 center dot 001) and body length (c. 1 center dot 3 fold, P < 0 center dot 001), compared with the non-transgenic group. The discrepancy of serum GH levels between the transgenic carp group and control group is 54 fold, when the water temperature was 12-34 degrees C. When the water temperature decreased to 3 center dot 5 degrees C in January, the discrepancy was 256 fold. The serum GH level of the transgenic group was relatively constant, while that of control varied greatly based on month and water temperature. The changes of growth rates between the transgenic group and the control group were similar for a year. Taken together, the results indicated that F-4 all-fish GH transgenic carp had not only higher and constant serum GH levels but also a significant fast-growing effect, compared with the control. To our knowledge, this is the first report on a one-year investigation of growth trait and serum growth hormone level in F-4 all-fish GH transgenic carp.

Frequency locked micro disk resonator for improved sensing resolution and overcoming perturbations in NSOM measurements

We experimentally demonstrate locking of a laser frequency to a resonance line of a micro disk resonator. Achieving 1±0.1 pm shifting detection, the approach can be applied for sensing enhancement and perturbation immune NSOM measurements. © 2012 OSA.

Frequency locked micro disk resonator for improved sensing resolution and overcoming perturbations in NSOM measurements

We experimentally demonstrate locking of a laser frequency to a resonance line of a micro disk resonator. Achieving 1±0.1 pm shifting detection, the approach can be applied for sensing enhancement and perturbation immune NSOM measurements. © OSA 2012.