Representations and algorithms for finite-state bisimulations of linear discrete-time control systems

While a large amount of research over the past two decades has focused on discrete abstractions of infinite-state dynamical systems, many structural and algorithmic details of these abstractions remain unknown. To clarify the computational resources needed to perform discrete abstractions, this paper examines the algorithmic properties of an existing method for deriving finite-state systems that are bisimilar to linear discrete-time control systems. We explicitly find the structure of the finite-state system, show that it can be enormous compared to the original linear system, and give conditions to guarantee that the finite-state system is reasonably sized and efficiently computable. Though constructing the finite-state system is generally impractical, we see that special cases could be amenable to satisfiability based verification techniques. ©2009 IEEE.

Thermal modelling of a tubular linear machine for marine renewable generation

A lumped parameter thermal model has been constructed for a tubular linear machine that has been designed for use in a marine environment. It shows good correlation to both steady state and transient experimental tests on the machine. The model has been developed for a stationary machine in a laboratory environment - the modelling techniques used and enhancements to enable the application of the model directly to marine scenarios are discussed.

Predictive techniques for turbulent oscillatory flows

The prediction of turbulent oscillatory flow at around transitional Reynolds numbers is considered for an idealized electronics system. To assess the accuracy of turbulence models, comparison is made with measurements. A stochastic procedure is used to recover instantaneous velocity time traces from predictions. This procedure enables more direct comparison with turbulence intensity measurements which have not been filtered to remove the oscillatory flow component. Normal wall distances, required in some turbulence models, are evaluated using a modified Poisson equation based technique. A range of zero, one and two equation turbulence models are tested, including zonal and a non-linear eddy viscosity models. The non-linear and zonal models showed potential for accuracy improvements.

A Hierarchical Model for Ordinal Matrix Factorization

This paper proposes a hierarchical probabilistic model for ordinal matrix factorization. Unlike previous approaches, we model the ordinal nature of the data and take a principled approach to incorporating priors for the hidden variables. Two algorithms are presented for inference, one based on Gibbs sampling and one based on variational Bayes. Importantly, these algorithms may be implemented in the factorization of very large matrices with missing entries. The model is evaluated on a collaborative filtering task, where users have rated a collection of movies and the system is asked to predict their ratings for other movies. The Netflix data set is used for evaluation, which consists of around 100 million ratings. Using root mean-squared error (RMSE) as an evaluation metric, results show that the suggested model outperforms alternative factorization techniques. Results also show how Gibbs sampling outperforms variational Bayes on this task, despite the large number of ratings and model parameters. Matlab implementations of the proposed algorithms are available from cogsys.imm.dtu.dk/ordinalmatrixfactorization.

Detailed thermal modelling of a tubular linear machine for marine renewable generation

A detailed lumped-parameter thermal model is presented for a tubular linear machine that has been designed for use in a marine environment. The model has been developed for a static machine, the worst-case thermal scenario, and is used to establish a rating for the machine. The model has been validated against a large range of experimental tests and shows good correlation to both steady-state and transient experimental results. The model was constructed from a mostly theoretical basis with very little calibration, suggesting that the techniques used are applicable in a more general sense. © 2013 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).

Multilinear function factorisation for time series feature extraction

This work applies a variety of multilinear function factorisation techniques to extract appropriate features or attributes from high dimensional multivariate time series for classification. Recently, a great deal of work has centred around designing time series classifiers using more and more complex feature extraction and machine learning schemes. This paper argues that complex learners and domain specific feature extraction schemes of this type are not necessarily needed for time series classification, as excellent classification results can be obtained by simply applying a number of existing matrix factorisation or linear projection techniques, which are simple and computationally inexpensive. We highlight this using a geometric separability measure and classification accuracies obtained though experiments on four different high dimensional multivariate time series datasets. © 2013 IEEE.

Generation of 140 fs pulse train with widely tunable repetition rate through cascaded fibre compression techniques

The authors present numerical simulations of ultrashort pulse generation by a technique of linear spectral broadening in phase modulators and compression in dispersion compensating fibre, followed by a further stage of soliton compression in dispersion shifted fibre. This laser system is predicted to generate pulses of 140 fs duration with a peak power of 1.5 kW over a wide, user selectable repetition rate range while maintaining consistent characteristics of stability and pulse quality. The use of fibre compressors and commercially available modulators is expected to make the system setup compact and cost-effective. © The Institution of Engineering and Technology 2014.

Parametric resonance for vibration energy harvesting with design techniques to passively reduce the initiation threshold amplitude

A vibration energy harvester designed to access parametric resonance can potentially outperform the conventional direct resonant approach in terms of power output achievable given the same drive acceleration. Although linear damping does not limit the resonant growth of parametric resonance, a damping dependent initiation threshold amplitude exists and limits its onset. Design approaches have been explored in this paper to passively overcome this limitation in order to practically realize and exploit the potential advantages. Two distinct design routes have been explored, namely an intrinsically lower threshold through a pendulum-lever configuration and amplification of base excitation fed into the parametric resonator through a cantilever-initial-spring configuration. Experimental results of the parametric resonant harvesters with these additional enabling designs demonstrated an initiation threshold up to an order of magnitude lower than otherwise, while attaining a much higher power peak than direct resonance. © 2014 IOP Publishing Ltd.

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.