Quantum systems with finite Hilbert space are considered. Position and mo- mentum states and their relation through a Fourier transform, displacement in the position-momentum phase-space, and symplectic transformations are introduced and their properties are studied. Symplectic Sp(2l;Zp) trans- formations in l-partite finite system are explicit constructed. The general method is applied to bi-partite and tri-partite systems. The effect of these transformations on the correlations is discussed. Entanglement calculations between the subsystems in a bi-partite system and a tri-partite system are presented. The effect of measurements is also studied.

No description available.

No description available.

No description available.

No description available.

No description available.

This paper illustrates Winograd's approach to computing the Discrete Fourier Transform (DFT). This new approach changes the DFT into a cyclic convolution of 2 sequences, and illustrates shortcuts for computing this cyclic convolution. This method is known to reduce the number of multiplies required to about 20% less than the number of multiplies used by the techniques of the Fast Fourier Transform. Three approaches are discussed, one for prime numbers, one for products of primes, and lastly one for powers of odd primes. For powers of 2 Winograd's algorithm is, in general, inefficient and best if it is not used. A computer simulation is illustrated for the 35 point transform and its execution time is compared with that of the Fast Fourier Transform algorithm for 32 points.

No description available.

No description available.

This paper is a review of the major literature dealing with transformations of random variates which achieve variance stabilization and approximate normalization. The subject can be said to have been initiated by a genetical paper of R. A. Fisher (1922) which uses the angular transformation Φ = 2 arcsin√p to deal with the analysis of proportions p with E(p) = P. Here it turns out that Var Φ is almost independent of P and so stabilizes the variance. Some fourteen years later Bartlett introduced the so-called square-root transformation which achieves variance stabilization for variates following a Poisson distribution. These two transformations and their ramifications in theory and application are fully discussed. along with refinements introduced by later writers, notably Curtiss (1943) and Anscombe (1948). Another important transformation discussed is one which refers to an analysis of observations on to a logarithmic scale, and here there are uses in analysis of variance situations and theoretical problems in the field of estimation: in the case of the latter, the work of D. J. Finney (1941) is considered in some detail. The asymptotic normality of the transformation is also considered. Transformations primarily designed to bring about ultimate normality in distribution are also included. In particular, there is reference to work on the chi-square probability integral (Fisher), (Wilson and Hilferty (1931)) and the logarithmic transformation of a correlation coefficient (Fisher (1921)). Other miscellaneous topics referred include i. the probability integral transformation (Probits), with applications in bioassay: ii. applications of transformation theory to set up approximate confidence intervals for distribution parameters (BIom (1954)): iii. transformations in connection with the interpretation of so-called 'ranked' data. / M.S.