Model selection approaches for non-linear system identification: a review

The identification of non-linear systems using only observed finite datasets has become a mature research area over the last two decades. A class of linear-in-the-parameter models with universal approximation capabilities have been intensively studied and widely used due to the availability of many linear-learning algorithms and their inherent convergence conditions. This article presents a systematic overview of basic research on model selection approaches for linear-in-the-parameter models. One of the fundamental problems in non-linear system identification is to find the minimal model with the best model generalisation performance from observational data only. The important concepts in achieving good model generalisation used in various non-linear system-identification algorithms are first reviewed, including Bayesian parameter regularisation and models selective criteria based on the cross validation and experimental design. A significant advance in machine learning has been the development of the support vector machine as a means for identifying kernel models based on the structural risk minimisation principle. The developments on the convex optimisation-based model construction algorithms including the support vector regression algorithms are outlined. Input selection algorithms and on-line system identification algorithms are also included in this review. Finally, some industrial applications of non-linear models are discussed.

Fault reconstruction in linear dynamic systems using multivariate statistics

Treasure et al. (2004) recently proposed a new sub space-monitoring technique, based on the N4SID algorithm, within the multivariate statistical process control framework. This dynamic-monitoring method requires considerably fewer variables to be analysed when compared with dynamic principal component analysis (PCA). The contribution charts and variable reconstruction, traditionally employed for static PCA, are analysed in a dynamic context. The contribution charts and variable reconstruction may be affected by the ratio of the number of retained components to the total number of analysed variables. Particular problems arise if this ratio is large and a new reconstruction chart is introduced to overcome these. The utility of such a dynamic contribution chart and variable reconstruction is shown in a simulation and by application to industrial data from a distillation unit.

Semi-formal Models to Support Program Development: Autonomic Management within Component Based Parallel and Distributed Programming

Functional and non-functional concerns require different programming effort, different techniques and different methodologies when attempting to program efficient parallel/distributed applications. In this work we present a "programmer oriented" methodology based on formal tools that permits reasoning about parallel/distributed program development and refinement. The proposed methodology is semi-formal in that it does not require the exploitation of highly formal tools and techniques, while providing a palatable and effective support to programmers developing parallel/distributed applications, in particular when handling non-functional concerns.

Plant-wide predictive control for a thermal power plant based on a physical plant model

A constrained non-linear, physical model-based, predictive control (NPMPC) strategy is developed for improved plant-wide control of a thermal power plant. The strategy makes use of successive linearisation and recursive state estimation using extended Kalman filtering to obtain a linear state-space model. The linear model and a quadratic programming routine are used to design a constrained long-range predictive controller One special feature is the careful selection of a specific set of plant model parameters for online estimation, to account for time-varying system characteristics resulting from major system disturbances and ageing. These parameters act as nonstationary stochastic states and help to provide sufficient degrees-of-freedom to obtain unbiased estimates of controlled outputs. A 14th order non-linear plant model, simulating the dominant characteristics of a 200 MW oil-fired pou er plant has been used to test the NPMPC algorithm. The control strategy gives impressive simulation results, during large system disturbances and extremely high rate of load changes, right across the operating range. These results compare favourably to those obtained with the state-space GPC method designed under similar conditions.

Disturbance attenuation in linear systems via dynamical compensators: A parametric eigenstructure assignment approach

A simple approach is proposed for disturbance attenuation in multivariable linear systems via dynamical output compensators based on complete parametric eigenstructure assignment. The basic idea is to minimise the H-2 norm of the disturbance-output transfer function using the design freedom provided by eigenstructure assignment. For robustness, the closed-loop system is restricted to be nondefective. Besides the design parameters, the closed-loop eigenvalues are also optimised within desired regions on the left-half complex plane to ensure both closed-loop stability and dynamical performance. With the proposed approach, additional closed-loop specifications can be easily achieved. As a demonstration, robust pole assignment, in the sense that the closed-loop eigenvalues are as insensitive as possible to open-loop system parameter perturbations, is treated. Application of the proposed approach to robust control of a magnetic bearing with a pair of opposing electromagnets and a rigid rotor is discussed.

Dynamic Linear Precoding for the Exploitation of Known Interference in MIMO Broadcast Systems

This paper introduces a novel channel inversion (CI) precoding scheme for the downlink of phase shift keying (PSK)-based multiple input multiple output (MIMO) systems. In contrast to common practice where knowledge of the interference is used to eliminate it, the main idea proposed here is to use this knowledge to glean benefit from the interference. It will be shown that the system performance can be enhanced by exploiting some of the existent inter-channel interference (ICI). This is achieved by applying partial channel inversion such that the constructive part of ICI is preserved and exploited while the destructive part is eliminated by means of CI precoding. By doing so, the effective signal to interference-plus-noise ratio (SINR) delivered to the mobile unit (MU) receivers is enhanced without the need to invest additional transmitted signal power at the MIMO base station (BS). It is shown that the trade-off to this benefit is a minor increase in the complexity of the BS processing. The presented theoretical analysis and simulations demonstrate that due to the SINR enhancement, significant performance and throughput gains are offered by the proposed MIMO precoding technique compared to its conventional counterparts.

Dense pixel matching between unrectified and distorted images using dynamic programming

In this paper, a novel framework for dense pixel matching based on dynamic programming is introduced. Unlike most techniques proposed in the literature, our approach assumes neither known camera geometry nor the availability of rectified images. Under such conditions, the matching task cannot be reduced to finding correspondences between a pair of scanlines. We propose to extend existing dynamic programming methodologies to a larger dimensional space by using a 3D scoring matrix so that correspondences between a line and a whole image can be calculated. After assessing our framework on a standard evaluation dataset of rectified stereo images, experiments are conducted on unrectified and non-linearly distorted images. Results validate our new approach and reveal the versatility of our algorithm.

Parallel Programming of General-Purpose Programs Using Task-Based Programming Models

The prevalence of multicore processors is bound to drive most kinds of software development towards parallel programming. To limit the difficulty and overhead of parallel software design and maintenance, it is crucial that parallel programming models allow an easy-to-understand, concise and dense representation of parallelism. Parallel programming models such as Cilk++ and Intel TBBs attempt to offer a better, higher-level abstraction for parallel programming than threads and locking synchronization. It is not straightforward, however, to express all patterns of parallelism in these models. Pipelines are an important parallel construct, although difficult to express in Cilk and TBBs in a straightfor- ward way, not without a verbose restructuring of the code. In this paper we demonstrate that pipeline parallelism can be easily and concisely expressed in a Cilk-like language, which we extend with input, output and input/output dependency types on procedure arguments, enforced at runtime by the scheduler. We evaluate our implementation on real applications and show that our Cilk-like scheduler, extended to track and enforce these dependencies has performance comparable to Cilk++.

Numerical analysis of intralaminar failure mechanisms in composite structures, Part II: Applications

A three-dimensional continuum damage mechanics-based material model was implemented in an implicit Finite Element code to simulate the progressive intralaminar degradation of fibre reinforced laminates based on ply failure mechanisms. This paper presents some structural applications of the progressive failure model implemented. The focus is on the non-linear response of the shear failure mode and its interaction with other failure modes. Structural applications of the damage model show that the proposed model is able to reproduce failure loads and patterns observed experimentally.

Strategies for Energy-Efficient Resource Management of Hybrid Programming Models

Many scientific applications are programmed using hybrid programming models that use both message passing and shared memory, due to the increasing prevalence of large-scale systems with multicore, multisocket nodes. Previous work has shown that energy efficiency can be improved using software-controlled execution schemes that consider both the programming model and the power-aware execution capabilities of the system. However, such approaches have focused on identifying optimal resource utilization for one programming model, either shared memory or message passing, in isolation. The potential solution space, thus the challenge, increases substantially when optimizing hybrid models since the possible resource configurations increase exponentially. Nonetheless, with the accelerating adoption of hybrid programming models, we increasingly need improved energy efficiency in hybrid parallel applications on large-scale systems. In this work, we present new software-controlled execution schemes that consider the effects of dynamic concurrency throttling (DCT) and dynamic voltage and frequency scaling (DVFS) in the context of hybrid programming models. Specifically, we present predictive models and novel algorithms based on statistical analysis that anticipate application power and time requirements under different concurrency and frequency configurations. We apply our models and methods to the NPB MZ benchmarks and selected applications from the ASC Sequoia codes. Overall, we achieve substantial energy savings (8.74 percent on average and up to 13.8 percent) with some performance gain (up to 7.5 percent) or negligible performance loss.

The partially reversible formation of Li-metal particles on a solid Li electrolyte:applications toward nanobatteries

The feasibility of large-scale implementation of Li-air batteries (LABs) hinges on understanding the thermodynamic and kinetic factors that control charge-discharge rates, efficiency and life times. Here, the kinetics of bias-induced reactions is explored locally on the surface of Li-ion conductive glass ceramics, a preferred electrolyte for LABs, using direct current-voltage and strain spectroscopies. Above a critical bias, particle growth kinetics were found to be linear in both the bias and time domains. Partial reversibility was observed for Li particles as evidenced by the presence of anodic peaks following the Li(+) reduction, as well an associated reduction in particle height. The degree of reversibility was highest for the smallest particles formed. These observations thus suggest the possibility of producing nanobatteries with an active anode volume of the order of 0.1 al.

A Comparison of Programming Models for Multiprocessors with Explicitly Managed Memory Hierarchies

On multiprocessors with explicitly managed memory hierarchies (EMM), software has the responsibility of moving data in and out of fast local memories. This task can be complex and error-prone even for expert programmers. Before we can allow compilers to handle the complexity for us, we must identify the abstractions that are general enough to allow us to write applications with reasonable effort, yet speci?c enough to exploit the vast on-chip memory bandwidth of EMM multi-processors. To this end, we compare two programming models against hand-tuned codes on the STI Cell, paying attention to programmability and performance. The ?rst programming model, Sequoia, abstracts the memory hierarchy as private address spaces, each corresponding to a parallel task. The second, Cellgen, is a new framework which provides OpenMP-like semantics and the abstraction of a shared address spaces divided into private and shared data. We compare three applications programmed using these models against their hand-optimized counterparts in terms of abstractions, programming complexity, and performance.