Abstract
Port Wine ageing process is very important to produce the most appreciated and expensive wines from the class. The process takes decades to accomplish and involves particular techniques which are taken inside refrigerated cellars. Different wines pass through such process to produce 10 year, 20 year, 30 year and 40 year Ports. There are no documented data about color or turbidity evolution during the ageing process. We decided to verify the states of color and spectral turbidity of different aged Gold white port wine. The acquired results show a spectral evolution on transmition and scattered radiation along with color modification which are a close and direct consequence of adopted corrective measures. In measuring the four samples, we have used our spectronephelometer with optical fiber tips to illuminate sample and to acquire transmitted or scattered radiation. Transmition results were calibrated with a standard spectrophotometer at our laboratory, and scattered spectra were measured considering a system calibration with ISO12103 standard dust. We are aware that the four samples were harvested in different years, but the wine type is the same and the ageing process does not differ from one sample to another.

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.

Abstract
In this paper, two approaches, for the estimation of matrices A and C in CV A-type subspace identification algorithms are compared and the differences between the two obtained estimates are analysed. One of the methods, "least squares" based, was proposed in the original CVA algorithm. The other method, inspired in the techniques of the classical Realization Theory and proposed by Verhaegen, is far more efficient. Therefore, although the two methods produce two different estimates, a replacement is proposed and an expression for correction of the estimates is obtained, in order to reduce the loss of accuracy.

Abstract
In this paper, a recursive algorithm is presented, based on the CVA subspace identification algorithm. The main idea was to explore the relations between the orthogonal and oblique projections involved and to provide simpler expressions that allowed a recursive version of the algorithm - guaranteeing most of the advantages of this kind of methods, and still improving the numerical efficiency.

Abstract
In this paper, a new approach to estimate matrices B and D, in subspace methods, is provided. The starting point was one method proposed by Van Overschee and De Moor (1996). We have derived new (and simpler) expressions and we found that the original method can be rewritten as a weighted least squares problem, involving the future outputs and inputs and the observability matrix.

Abstract
In this paper we present two subspace identification methods implemented through sequences of modified Householder algorithm. The main idea was to show that subspace identification methods can be represented as sequences of least squares problems and implemented wing QR factorizations. Therefore, it is possible to develop iterative algorithms with most of the advantages of this kind of methods, and still improve the numerical efficiency, in order to deal with real-tme applications and minimize the computational burden.