Arbitrarily shaped multiple spatial cluster detection for case event data

An original method is proposed for spatial cluster detection of case event data. A selection order and the distance from the nearest neighbour are attributed to each point, once pre-selected points have been taken into account. This distance is weighted by the expected distance under the uniform distribution hypothesis. Potential clusters are located by modelling the multiple structural change of the distances on the selection order and the best model (containing one or several potential clusters) is selected using the double maximum test. Finally a p-value is obtained for each potential cluster. With this method multiple clusters of any shape can be detected.     

Predictive neuro-control of uncertain systems: design and use of a neuro-optimizer

We consider the problem of predictive control of uncertain stochastic discrete I/O systems. Given a model identification procedure able to give accurate output system estimates, e.g. a neural network approximation, we use another feedforward neural network to generate at each time step a constrained optimal control. Dynamic backpropagation is used to improve when necessary the controller network parameters. Both system and controller neural structures are first selected off-line by a statistical Bayesian procedure in order to make the predictive control minimizing process more efficient. The issue of stochastic stability of the closed-loop is considered. We developed this approach for the tracking control of such uncertain systems as biotechnological processes. Actual and simulated predictive neuro-control case studies in this field of application are proposed as illustrations. A comparison with a more classic quasi-Newton-based approach is also proposed, showing the interest of this neuro-control approach.     

A state dependent sampling for linear state feedback

In this work, a new state-dependent sampling control enlarges the sampling intervals of state feedback control. We consider the case of linear time invariant systems and guarantee the exponential stability of the system origin for a chosen decay rate. The approach is based on LMIs obtained thanks to sufficient Lyapunov–Razumikhin stability conditions and follows two steps. In the first step, we compute a Lyapunov–Razumikhin function that guarantees exponential stability for all time-varying sampling intervals up to some given bound. This value can be used as a lower-bound of the state-dependent sampling function. In a second step, an off-line computation provides a mapping from the state-space into the set of sampling intervals: the state is divided into a finite number of regions, and to each of these regions is associated an allowable upper-bound of the sampling intervals that will guarantee the global (exponential or asymptotic) stability of the system. The results are based on sufficient conditions obtained using convex polytopes. Therefore, they involve some conservatism with respect to necessary and sufficient conditions. However, at each of the two steps, an optimization on the sampling upper-bounds is proposed. The approach is illustrated with numerical examples from the literature for which the number of actuations is shown to be reduced with respect to the periodic sampling case.     

Region-Based Memory Management

This paper describes a memory management discipline for programs that perform dynamic memory allocation and de-allocation. At runtime, all values are put intoregions. The store consists of a stack of regions. All points of region allocation and de-allocation are inferred automatically, using a type and effect based program analysis. The scheme does not assume the presence of a garbage collector. The scheme was first presented in 1994 (M. Tofte and J.-P. Talpin,in“Proceedings of the 21st ACM SIGPLAN–SIGACT Symposium on Principles of Programming Languages,” pp. 188–201); subsequently, it has been tested in The ML Kit with Regions, a region-based, garbage-collection free implementation of the Standard ML Core language, which includes recursive datatypes, higher-order functions and updatable references L. Birkedal, M. Tofte, and M. Vejlstrup, (1996),in“Proceedings of the 23 rd ACM SIGPLAN–SIGACT Symposium on Principles of Programming Languages,” pp. 171–183. This paper defines a region-based dynamic semantics for a skeletal programming language extracted from Standard ML. We present the inference system which specifies where regions can be allocated and de-allocated and a detailed proof that the system is sound with respect to a standard semantics. We conclude by giving some advice on how to write programs that run well on a stack of regions, based on practical experience with the ML Kit.     

Testing usability and trainability of indirect touch interaction: perspective for the next generation of air traffic control systems

This study aims to determine whether indirect touch device can be used to interact with graphical objects displayed on another screen in an air traffic control (ATC) context. The introduction of such a device likely requires an adaptation of the sensory-motor system. The operator has to simultaneously perform movements on the horizontal plane while assessing them on the vertical plane. Thirty-six right-handed participants performed movement training with either constant or variable practice and with or without visual feedback of the displacement of their actions. Participants then performed a test phase without visual feedback. Performance improved in both practice conditions, but accuracy was higher with visual feedback. During the test phase, movement time was longer for those who had practiced with feedback, suggesting an element of dependency. However, this ‘cost’ of feedback did not extend to movement accuracy. Finally, participants who had received variable training performed better in the test phase, but accuracy was still unsatisfactory. We conclude that continuous visual feedback on the stylus position is necessary if tablets are to be introduced in ATC.     

Sensorless fault tolerant control for induction motors

In this paper, a sensorless fault tolerant controller for induction motors is developed. In the proposed approach, a robust controller based on backstepping strategy is designed in order to compensate for both the load torque disturbance and the rotor resistance variation caused by the broken rotor bars faults. The proposed approach needs neither fault detection and isolation schemes nor controller re-design. Moreover, to avoid the use of speed and flux sensors, a second order sliding mode observer is introduced to estimate the flux and the speed. The observer converges in a finite time and leads to good estimates of the flux and the speed even in the presence of the rotor resistance variation and the load torque disturbance. Since the observer converges in the finite time, the stability of the closed-loop system (controller with observer) is shown in two steps. First, the boundedness of the closed-loop system trajectories before the convergence of the observer is proved. Second, the convergence of the closed-loop system trajectories is proved after the convergence of the observer. To highlight the efficiency and applicability of the proposed control scheme, simulation and experimental results are conducted for a 1.5 kW induction motor.     

Asymptotic performances of a constructive algorithm

We present a numerical study of a neural tree learning algorithm, the “triolearning≓ strategy. We study the behaviour of the algorithm as a function of the size of the training set. The results show that a limited number of examples can be used to estimate both the network performance and the network complexity that would result from running the algorithm on a large data set.     

Numerical simulation of the MHD equations by a kinetic-type method

We introduce a flux-splitting formula for the approximation of the ideal MHD equations in conservative form. The Faraday equation is considered as the average of an abstract kinetic equation, giving a flux-splitting formula. For the other part of the equations, we generalize formally the classical half-Maxwellian flux-splitting of the Euler equations. Numerical results on MHD shock tube problems are displayed.