How is the balance of a forecast ensemble affected by adaptive and non-adaptive localization schemes?

This paper investigates the effect on balance of a number of Schur product-type localization schemes which have been designed with the primary function of reducing spurious far-field correlations in forecast error statistics. The localization schemes studied comprise a non-adaptive scheme (where the moderation matrix is decomposed in a spectral basis), and two adaptive schemes, namely a simplified version of SENCORP (Smoothed ENsemble COrrelations Raised to a Power) and ECO-RAP (Ensemble COrrelations Raised to A Power). The paper shows, we believe for the first time, how the degree of balance (geostrophic and hydrostatic) implied by the error covariance matrices localized by these schemes can be diagnosed. Here it is considered that an effective localization scheme is one that reduces spurious correlations adequately but also minimizes disruption of balance (where the 'correct' degree of balance or imbalance is assumed to be possessed by the unlocalized ensemble). By varying free parameters that describe each scheme (e.g. the degree of truncation in the schemes that use the spectral basis, the 'order' of each scheme, and the degree of ensemble smoothing), it is found that a particular configuration of the ECO-RAP scheme is best suited to the convective-scale system studied. According to our diagnostics this ECO-RAP configuration still weakens geostrophic and hydrostatic balance, but overall this is less so than for other schemes.

A fast adaptive tunable RBF network for nonstationary systems

This paper describes a novel on-line learning approach for radial basis function (RBF) neural network. Based on an RBF network with individually tunable nodes and a fixed small model size, the weight vector is adjusted using the multi-innovation recursive least square algorithm on-line. When the residual error of the RBF network becomes large despite of the weight adaptation, an insignificant node with little contribution to the overall system is replaced by a new node. Structural parameters of the new node are optimized by proposed fast algorithms in order to significantly improve the modeling performance. The proposed scheme describes a novel, flexible, and fast way for on-line system identification problems. Simulation results show that the proposed approach can significantly outperform existing ones for nonstationary systems in particular.

A new adaptive multiple modelling approach for non-linear and non-stationary systems

This paper proposes a novel adaptive multiple modelling algorithm for non-linear and non-stationary systems. This simple modelling paradigm comprises K candidate sub-models which are all linear. With data available in an online fashion, the performance of all candidate sub-models are monitored based on the most recent data window, and M best sub-models are selected from the K candidates. The weight coefficients of the selected sub-model are adapted via the recursive least square (RLS) algorithm, while the coefficients of the remaining sub-models are unchanged. These M model predictions are then optimally combined to produce the multi-model output. We propose to minimise the mean square error based on a recent data window, and apply the sum to one constraint to the combination parameters, leading to a closed-form solution, so that maximal computational efficiency can be achieved. In addition, at each time step, the model prediction is chosen from either the resultant multiple model or the best sub-model, whichever is the best. Simulation results are given in comparison with some typical alternatives, including the linear RLS algorithm and a number of online non-linear approaches, in terms of modelling performance and time consumption.

A constrained recursive least squares algorithm for adaptive combination of multiple models

In this paper, we develop a novel constrained recursive least squares algorithm for adaptively combining a set of given multiple models. With data available in an online fashion, the linear combination coefficients of submodels are adapted via the proposed algorithm.We propose to minimize the mean square error with a forgetting factor, and apply the sum to one constraint to the combination parameters. Moreover an l1-norm constraint to the combination parameters is also applied with the aim to achieve sparsity of multiple models so that only a subset of models may be selected into the final model. Then a weighted l2-norm is applied as an approximation to the l1-norm term. As such at each time step, a closed solution of the model combination parameters is available. The contribution of this paper is to derive the proposed constrained recursive least squares algorithm that is computational efficient by exploiting matrix theory. The effectiveness of the approach has been demonstrated using both simulated and real time series examples.

Multi-Conjugate Adaptive Optics VLT imaging of the distant old open cluster FSR 1415

We employ the recently installed near-infrared Multi-Conjugate Adaptive Optics demonstrator (MAD) to determine the basic properties of a newly identified, old and distant, Galactic open cluster (FSR 1415). The MAD facility remarkably approaches the diffraction limit, reaching a resolution of 0.07 arcsec (in K), that is also uniform in a field of similar to 1.8 arcmin in diameter. The MAD facility provides photometry that is 50 per cent complete at K similar to 19. This corresponds to about 2.5 mag below the cluster main-sequence turn-off. This high-quality data set allows us to derive an accurate heliocentric distance of 8.6 kpc, a metallicity close to solar and an age of similar to 2.5 Gyr. On the other hand, the deepness of the data allows us to reconstruct (completeness-corrected) mass functions (MFs) indicating a relatively massive cluster, with a flat core MF. The Very Large Telescope/MAD capabilities will therefore provide fundamental data for identifying/analysing other faint and distant open clusters in the Galaxy III and IV quadrants.

ENO adaptive method for solving one-dimensional conservation laws

In this work an efficient third order non-linear finite difference scheme for solving adaptively hyperbolic systems of one-dimensional conservation laws is developed. The method is based oil applying to the solution of the differential equation an interpolating wavelet transform at each time step, generating a multilevel representation for the solution, which is thresholded and a sparse point representation is generated. The numerical fluxes obtained by a Lax-Friedrichs flux splitting are evaluated oil the sparse grid by an essentially non-oscillatory (ENO) approximation, which chooses the locally smoothest stencil among all the possibilities for each point of the sparse grid. The time evolution of the differential operator is done on this sparse representation by a total variation diminishing (TVD) Runge-Kutta method. Four classical examples of initial value problems for the Euler equations of gas dynamics are accurately solved and their sparse solutions are analyzed with respect to the threshold parameters, confirming the efficiency of the wavelet transform as an adaptive grid generation technique. (C) 2008 IMACS. Published by Elsevier B.V. All rights reserved.

Adaptive Locomotion for Crossing a Moving Obstacle

Crossing moving obstacles requires different space-time adjustments compared with stationary obstacles. Our aim was to investigate gait spatial and temporal parameters in the approach and crossing phases of a moving obstacle. We hypothesized that obstacle speed affects gait parameters, which allow us to distinguish locomotor strategies. Ten young adults walked and stepped over an obstacle that crossed their way perpendicularly, under three obstacle conditions: control-stationary obstacle, slow (1.07 m/s) and fast speed (1.71 m/s) moving obstacles. Gait parameters were different between obstacle conditions, especially on the slow speed. In the fast condition, the participants adopted predictive strategies during the approach and crossing phases. In the slow condition, they used an anticipatory strategy in both phases. We conclude that obstacle speed affects the locomotor behavior and strategies were distinct in the obstacle avoidance phases.

An adaptive view of caste differentiation in the neotropical wasp Polybia (Trichothorax) sericea Olivier (Hymenoptera: Vespidae)

Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq)

AATS for the (X)over-bar chart with variable parameters

A Fortran computer program is given for the computation of the adjusted average time to signal, or AATS, for adaptive (X) over bar charts with one, two, or all three design parameters variable: the sample size, n, the sampling interval, h, and the factor k used in determining the width of the action limits. The program calculates the threshold limit to switch the adaptive design parameters and also provides the in-control average time to signal, or ATS.

Constrained optimization model for the design of an adaptive (X)over-bar chart

An economic-statistical model is developed for variable parameters (VP) (X) over bar charts in which all design parameters vary adaptively, that is, each of the design parameters (sample size, sampling interval and control-limit width) vary as a function of the most recent process information. The cost function due to controlling the process quality through a VP (X) over bar chart is derived. During the optimization of the cost function, constraints are imposed on the expected times to signal when the process is in and out of control. In this way, required statistical properties can be assured. Through a numerical example, the proposed economic-statistical design approach for VP (X) over bar charts is compared to the economic design for VP (X) over bar charts and to the economic-statistical and economic designs for fixed parameters (FP) (X) over bar charts in terms of the operating cost and the expected times to signal. From this example, it is possible to assess the benefits provided by the proposed model. Varying some input parameters, their effect on the optimal cost and on the optimal values of the design parameters was analysed.

Adaptive control charts: A Markovian approach for processes subject to independent disturbances

Recent studies have shown that adaptive X control charts are quicker than traditional X charts in detecting small to moderate shifts in a process. In this article, we propose a joint statistical design of adaptive X and R charts having all design parameters varying adaptively. The process is subjected to two independent assignable causes. One cause changes the process mean and the other changes the process variance. However, the occurrence of one kind of assignable cause does not preclude the occurrence of the other. It is assumed that the quality characteristic is normally distributed and the time that the process remains in control has exponential distribution. Performance measures of these adaptive control charts are obtained through a Markov chain approach. (c) 2005 Elsevier B.V. All rights reserved.

AATS for the X̄ Chart with Variable Parameters

A Fortran computer program is given for the computation of the adjusted average time to signal, or AATS, for adaptive X̄ charts with one, two, or all three design parameters variable: the sample size, n, the sampling interval, h, and the factor k used in determining the width of the action limits. The program calculates the threshold limit to switch the adaptive design parameters and also provides the in-control average time to signal, or ATS.

Adaptive control charts for attributes

We develop a general model for adaptive c, np, u and p control charts in which one, two or three design parameters (sample size, sampling interval and control limit width) switch between two values, according to the most recent process information. For a given in-control average sampling rate and a given false alarm rate, the adaptive chart detects changes in the process much faster than a chart with fixed parameters. Moreover, this study also offers general guidance on how to choose an effective design.

Applying a genetic neuro-model reference adaptive controller in drilling optimization

Motivated by rising drilling operation costs, the oil industry has shown a trend toward real-time measurements and control. In this scenario, drilling control becomes a challenging problem for the industry, especially due to the difficulty associated with parameters modeling. One of the drillbit performance evaluators, the Rate Of Penetration (ROP), has been used as a drilling control parameter. However, relationships between operational variables affecting the ROP are complex and not easily modeled. This work presents a neuro-genetic adaptive controller to treat this problem. It is based on an auto-regressive with extra input signals, or ARX model and on a Genetic Algorithm (GA) to control the ROP. © [2006] IEEE.

A genetic neuro-model reference adaptive controller for petroleum wells drilling operations

Motivated by rising drilling operation costs, the oil industry has shown a trend towards real-time measurements and control. In this scenario, drilling control becomes a challenging problem for the industry, especially due to the difficulty associated to parameters modeling. One of the drill-bit performance evaluators, the Rate of Penetration (ROP), has been used in the literature as a drilling control parameter. However, the relationships between the operational variables affecting the ROP are complex and not easily modeled. This work presents a neuro-genetic adaptive controller to treat this problem. It is based on the Auto-Regressive with Extra Input Signals model, or ARX model, to accomplish the system identification and on a Genetic Algorithm (GA) to provide a robust control for the ROP. Results of simulations run over a real offshore oil field data, consisted of seven wells drilled with equal diameter bits, are provided. © 2006 IEEE.