Abstract

Abstract
In this work, a Brillouin fibre laser sensor for strain and temperature discrimination is presented. The fibre laser sensor consists in a Fabry-Pérot cavity with 20 meters of optical fibre between two Bragg gratings. © 2006 OSA/OFS 2006.

Abstract
The problem of estimating the motion and orientation parameters of a rigid object from two m - D point set patterns is of significant importance in medical imaging, electrocardiogram (ECG) alignment, and fingerprint matching. The rigid parameters can be defined by an m x m rotation matrix, a diagonal m x m scale matrix, and an m x 1 translation vector. All together, the total number of parameters to be found is m(m + 2). Several least squares based algorithms have recently appeared in the literature. These algorithms are all based on a singular value decomposition (SVD) of the m x m cross-covariance matrix between the two data sets. However, there are cases where the SVD based algorithms return a reflection matrix rather than a rotation matrix. Some authors have introduced a simple correction for guarding against such cases. Other types of algorithm are based on unit quaternions which guarantee obtaining a true rotation matrix. In this paper we introduce a principal component based registration algorithm which is solved in closed-form. By using matrix vectorization properties the problem can be cast as one of finding a rank-1 symmetric projection matrix. This is equivalent to solving a Sylvester equation with equality constraints. Once the solution is obtained, we apply the inverse vectorization operation to estimate the rotation and scale matrices, along with the translation vector. We apply the proposed algorithm to the alignment of ECG signals and compare the results to those obtained by the SVD and quaternion based algorithms.

Abstract
In the paper, we discuss two questions about degree d smooth expanding circle maps, with d >= 2. (i) We characterize the sequences of asymptotic length ratios which occur for systems with Holder continuous derivative. The sequences of asymptotic length ratios are precisely those given by a positive Holder continuous function s (solenoid function) on the Cantor set C of d-adic integers satisfying a functional equation called the matching condition. In the case of the 2-adic integer Cantor set, the functional equation is s(2x + 1) = s(x)/s(2x) 1 + 1s(2x-1) -1. We also present a one-to-one correspondence between solenoid functions and affine classes of exponentially fast d-adic tilings of the real line that are fixed points of the d-amalgamation operator. (ii) We calculate the precise maximum possible level of smoothness for a representative of the system, up to diffeomorphic conjugacy, in terms of the functions s and cr(x) = (1 + s(x))/(1 + (s(x + 1))(-1)). For example, in the Lipschitz structure on C determined by s, the maximum smoothness is C1+alpha for 0 < alpha <= 1 if and only if s is alpha-Holder continuous. The maximum smoothness is C2+alpha for 0 < alpha <= 1 if and only if cr is (1 + alpha)-Holder. A curious connection with Mostow type rigidity is provided by the fact that s must be constant if it is alpha-Holder for alpha > 1.

Abstract
A temperature-independent strain sensor using a fibre Bragg grating written in an array fused taper is presented. This structure shows a spectrum with several peaks where their relative amplitudes are independent of temperature variations but change with applied strain. © 2006 OSA/OFS 2006.

Abstract
A study was made on the problem of short-term operational planning for hydroelectric power systems. Consideration was given to multiple reservoirs in a cascade and the effect that the variation of the head has in the operating efficiency. This non-linear effect coupled with the cascaded hydro configuration tends to produce a complex problem of large dimension. For its resolution an optimization method based on nonlinear programming is considered. The results are compared with the method currently used based on linear programming. The results of the computational simulation show that the non-linear programming is the most suitable optimization method. " 2006 Centro de Informatión Tecnológica.