Abstract
In this paper the Wiener-Hammerstein Benchmark is identified as a bilinear discrete system. The bilinear approximation relies on both facts that the Wiener-Hammerstein system can be described by a Volterra series which can be approximated by bilinear systems. The identification is performed with an iterative bilinear subspace identification algorithm previously proposed by the authors. In order to increase accuracy, polynomial static nonlinearities were added to the bilinear model input. These Hammerstein type bilinear models are then identified using the same iterative subspace identification algorithm.

Abstract
A new approach to gas leakage detection in high pressure distribution networks is proposed, where two leakage detectors are modelled as a linear parameter varying (LPV) system whose scheduling signals are, respectively, intake and offtake pressures. Running the two detectors simultaneously allows for leakage location. First, the pipeline is identified from operational data, supplied by REN-Gasodutos and using an LPV systems identification algorithm proposed in [1]. Each leakage detector uses two Kalman filters where the fault is viewed as an augmented state. The first filter estimates the flow using a calculated scheduling signal, assuming that there is no leakage. Therefore it works as a reference. The second one uses a measured scheduling signal and the augmented state is compared with the reference value. Whenever there is a significant difference, a leakage is detected. The effectiveness of this method is illustrated with an example where a mixture of real and simulated data is used.

Abstract
In this paper the Wiener-Hammerstein system proposed as a benchmark for the SYSID 2009 benchmark session is identified as a bilinear discrete system. The bilinear approximation relies on both facts that the Wiener-Hammerstein system can be described by a Volterra series which can be approximated by bilinear systems. The identification is performed with an iterative bilinear subspace identification algorithm previously proposed by the authors. In order to increase accuracy, polynomial static nonlinearities are added to the bilinear model input. These Hammerstein type bilinear models are then identified using the same iterative subspace identification algorithm. © 2009 IFAC.

Abstract
In this paper we find some linear dependencies on the matrices used for B and D estimation by the Van Overschee and De Moore non-biased versions of the Combined Deterministic-Stochastic Subspace Identification algorithms (CDSSI). These dependencies allow us to formulate algorithms that significantly improve the numerical efficiency on estimating these parameters without loss of accuracy. Experiences performed on practical data sets showed that the robust versions of these algorithms are twice as fast as the robust version proposed by Van Overschee and De Moore.

Abstract
In this paper we analyse the estimates of the matrices produced by the non-biased deterministic-stochastic subspace identification algorithms (NBDSSI) proposed by Van Overschee and De Moor ( 1996). First, an alternate expression is derived for the A and C estimates. It is shown that the Chiuso and Picci result ( Chiuso and Picci 2004) stating that the A and C estimates delivered by this algorithm robust version and by the Verhaegen's MOESP (Verhaegen and Dewilde 1992a, Verhaegen and Dewilde 1992b, Verhaegen 1993, Verhaegen 1994) are equal, can be obtained from this expression. An alternative approach for the estimation of matrices B and D in subspace identification is also described. It is shown that the least squares approach for the estimation of these matrices estimation can be just expressed as an orthogonal projection of the future outputs on a lower dimension subspace in the orthogonal complement of the column space of the extended observability matrix. Since this subspace has a dimension equal to the number of outputs, a simpler and numerically more efficient ( but equally accurate) new subspace algorithm is provided.

Abstract
In this paper we provide a different way to estimate matrices B and D, in subspace identification algorithms. The starting point was the method proposed by Van Overschee and De Moor [10] - the only one applying subspace ideas to the estimation of those matrices. We have derived new (and simpler) expressions and we found that the method proposed by Van Overschee and De Moor [10] can be rewritten as a weighted least squares problem, involving the future outputs and inputs.