Using an information point of view, we discuss deterministic versus stochastic tools for residual generation and evaluation for fault detection and isolation (FDI) in linear time invariant (LTI) state-space systems. In both types of approaches to oo-line FDI, residual generation can be viewed as the design of a linear transformation of a Gaussian vector (the nite-window input-adjusted observati...

The science of streamgauging has evolved through the years, mainly from the experiences and innovations of its practitioners. Streamgauging procedures are standardized on the international level. However, the selection of a suitable method for flow measurement is still a fairly complex process. The advisory system for flow measurement method selection has been designed to aid the user in the se...

A new technique is developed for identifying groups for regional flood frequency analysis. The technique uses a clustering algorithm as a starting point for partitioning the collection of catchments. The groups formed using the clustering algorithm are subsequently revised to improve the regional characteristics based on three requirements that are defined for effective groups. The result is ov...

Simulation is a key point for designing applications for large scale systems like grids or peer-to-peer networks. To be relevant, a simulation must be computed with adequate models: communication models, fault models or network models (bandwidth, latency). In previous works, we proposed a five layers model to map grid applications and the subjacent network. Particularly, it shows how subjacent ...

Fixed-point conversion requires fast analytical methods to evaluate the accuracy degradation due to quantization noises. Usually, analytical methods do not consider the correlation between quantization noises. Correlation between quantization noises occurs when a data is quantized several times. This report explained, through an example, the methodology used in the ID.Fix tool to support correl...

We pursue in this paper our study of approximations of values and-saddle-point policies in dynamic zero-sum games. After extending the general theorem for approximation, we study zero-sum stochastic games with countable state space, and non-bounded immediate reward. We focus on the expected average payoo criterion. We use some tools developed in the rst paper, to obtain the convergence of the v...

in this paper, we prove that the wrapped Butterfly digraph ~ WBF(d; n) of degree d and dimension n contains at least d?1 arc-disjoint Hamilton circuits, answering a conjecture of D. Barth. We also conjecture that ~ WBF(d; n) can be decomposed into d Hamilton circuits, except for {d = 2 and n = 2}, {d = 2 and n = 3} and {d = 3 and n = 2}. We show that it suffices to prove the conjecture for d pr...