A crescente aplicação da estatística às mais diversas áreas de pesquisa, tem definido delineamentos complexos, dificultando assim seu planejamento e análise. O diagrama de Hasse é uma ferramenta gráfica, que tem como objetivo facilitar a compreensão da estrutura presente entre os fatores experimentais. Além de uma melhor visualização do experimento o mesmo fornece, através de regras propostas na literatura, os números de graus de liberdade de cada fator. Sob a condição de ortogonalidade do delineamento, podem-se obter também as matrizes núcleo das formas quadráticas para as somas de quadrados e as esperanças dos quadrados médios, propiciando a razão adequada para a aplicação do teste F. O presente trabalho trata-se de uma revisão, fundamentada na álgebra linear, dos conceitos presentes na estrutura do diagrama. Com base nos mesmos, demonstrou-se o desdobramento do espaço vetorial do experimento em subespaços gerados por seus respectivos fatores, de tal modo que fossem ortogonais entre si. E, a fim de exemplificar as regras e o emprego desta ferramenta, utilizaram-se dois conjuntos de dados, o primeiro de um experimento realizados com cabras Saanen e segundo com capim Marandu, detalhando-se a estrutura experimental, demonstrando-se a ortogonalidade entre os fatores e indicando-se o esquema da análise da vari^ancia. Cabe salientar que o diagrama não substitui o uso de softwares, mas tem grande importância quando o interesse está em se comparar resultados e principalmente verificar o quociente adequado para o teste F. / The increase of statistics applications on the most diverse research areas has defined complex statistics designs turn its planning and analysis really hard. The Hasse diagram is a graphic tool that has as objective turn the comprehension of the present structure among the experimental factors easiest. More than a better experiment overview, by the rules proposed on the literature, this diagram gives the degrees of freedom for each factor. By the condition of design orthogonality, the nucleus matrix of quadratic form for the sum of squares and the expected values for the mean squares can also be obtained, given the proper ratio for F test application. The present work is a review, with its foundations on linear algebra, of the present\'s concepts on the diagram structure. With this basis were demonstrated the development of the vectorial space of the experiment in subspaces generated by its own factors, in a way that it was orthogonal within themselves. And, to give examples about the rules and the application of this tool, experimental data of Saanen goats and other set of data of Marandu grazing were used, with a detailed experiment structure, showing the orthogonality within the factors and with an indication of the analysis of variance model. Has to be emphasized that the diagram do not substitute the usage of software but has a great meaning when the interest is about results comparisons and most of all to check the proper quotient for the F test.

Fast algorithms for potential evaluation in N-body problems often tend to be extremely abstract and complex. This thesis presents a simple, hierarchical approach to solving the potential evaluation problem in O(n) time. The approach is developed in the field of electrostatics and can be extended to N-body problems in general. Herein, the potential vector is expressed as a product of the potential matrix and the charge vector. The potential matrix itself is a product of component matrices. The potential function satisfies the Laplace equation and is hence expressed as a linear combination of spherical harmonics, which form the general solutions of the Laplace equation. The orthogonality of the spherical harmonics is exploited to reduce execution time. The duality of the various lists in the algorithm is used to reduce storage and computational complexity. A smart tree-construction strategy leads to efficient parallelism at computation intensive stages of the algorithm. The computational complexity of the algorithm is better than that of the Fast Multipole Algorithm, which is one of the fastest contemporary algorithms to solve the potential evaluation problem. Experimental results show that accuracy of the algorithm is comparable to that of the Fast Multipole Algorithm. However, this approach uses some implementation principles from the Fast Multipole Algorithm. Parallel efficiency and scalability of the algorithms are studied by the experiments on IBM p690 multiprocessors.

Fast algorithms for potential evaluation in N-body problems often tend to be extremely abstract and complex. This thesis presents a simple, hierarchical approach to solving the potential evaluation problem in O(n) time. The approach is developed in the field of electrostatics and can be extended to N-body problems in general. Herein, the potential vector is expressed as a product of the potential matrix and the charge vector. The potential matrix itself is a product of component matrices. The potential function satisfies the Laplace equation and is hence expressed as a linear combination of spherical harmonics, which form the general solutions of the Laplace equation. The orthogonality of the spherical harmonics is exploited to reduce execution time. The duality of the various lists in the algorithm is used to reduce storage and computational complexity. A smart tree-construction strategy leads to efficient parallelism at computation intensive stages of the algorithm. The computational complexity of the algorithm is better than that of the Fast Multipole Algorithm, which is one of the fastest contemporary algorithms to solve the potential evaluation problem. Experimental results show that accuracy of the algorithm is comparable to that of the Fast Multipole Algorithm. However, this approach uses some implementation principles from the Fast Multipole Algorithm. Parallel efficiency and scalability of the algorithms are studied by the experiments on IBM p690 multiprocessors.

The present paper is a study of modied Hermitepolynomials Hn(x; a) which reduces to Hermite polynomialsHn(x) for a = e.

A crescente aplicação da estatística às mais diversas áreas de pesquisa, tem definido delineamentos complexos, dificultando assim seu planejamento e análise. O diagrama de Hasse é uma ferramenta gráfica, que tem como objetivo facilitar a compreensão da estrutura presente entre os fatores experimentais. Além de uma melhor visualização do experimento o mesmo fornece, através de regras propostas na literatura, os números de graus de liberdade de cada fator. Sob a condição de ortogonalidade do delineamento, podem-se obter também as matrizes núcleo das formas quadráticas para as somas de quadrados e as esperanças dos quadrados médios, propiciando a razão adequada para a aplicação do teste F. O presente trabalho trata-se de uma revisão, fundamentada na álgebra linear, dos conceitos presentes na estrutura do diagrama. Com base nos mesmos, demonstrou-se o desdobramento do espaço vetorial do experimento em subespaços gerados por seus respectivos fatores, de tal modo que fossem ortogonais entre si. E, a fim de exemplificar as regras e o emprego desta ferramenta, utilizaram-se dois conjuntos de dados, o primeiro de um experimento realizados com cabras Saanen e segundo com capim Marandu, detalhando-se a estrutura experimental, demonstrando-se a ortogonalidade entre os fatores e indicando-se o esquema da análise da vari^ancia. Cabe salientar que o diagrama não substitui o uso de softwares, mas tem grande importância quando o interesse está em se comparar resultados e principalmente verificar o quociente adequado para o teste F. / The increase of statistics applications on the most diverse research areas has defined complex statistics designs turn its planning and analysis really hard. The Hasse diagram is a graphic tool that has as objective turn the comprehension of the present structure among the experimental factors easiest. More than a better experiment overview, by the rules proposed on the literature, this diagram gives the degrees of freedom for each factor. By the condition of design orthogonality, the nucleus matrix of quadratic form for the sum of squares and the expected values for the mean squares can also be obtained, given the proper ratio for F test application. The present work is a review, with its foundations on linear algebra, of the present\'s concepts on the diagram structure. With this basis were demonstrated the development of the vectorial space of the experiment in subspaces generated by its own factors, in a way that it was orthogonal within themselves. And, to give examples about the rules and the application of this tool, experimental data of Saanen goats and other set of data of Marandu grazing were used, with a detailed experiment structure, showing the orthogonality within the factors and with an indication of the analysis of variance model. Has to be emphasized that the diagram do not substitute the usage of software but has a great meaning when the interest is about results comparisons and most of all to check the proper quotient for the F test.

The work is concerned with the band-limited signal extrapolation using truncated series of prolate spheroidal wave function. Our aim is to investigate the extent to which it is possible to extrapolate signal from its samples taken in a finite interval. It is often believed that this extrapolation method depends on computing definite integrals. We show an alternative approach by using the least squares method and we compare it with the methods of numerical integration. We also consider their performance in the presence of noise and the possibility of using these algorithms for real-time data processing. Finally all proposed algorithms are tested using real data from a microphone array, so that their performance can be compared.

Whether it is designing and controlling super-efficient high speed transport systems or understanding environmental fluid flows, a key question that arises is: what state does the fluid take and why? An answer to this question lies in understanding the hydrodynamic stability properties of the flow as a function of parameters. While much work has been done in this area in the past, there are many open questions that need to be addressed. Here we study the effect of spatial domain size, number of modes, non-hermitianness and non-normality on the finite time and infinite time stability properties of a standing, viscous shock flow problem. It has been shown that the above problems are not only non-normal but also non-hermitian, when the base flow has shear. The eigenvalue problems corresponding to infinite spatial domain, finite spatial domain, Forward and L2 adjoint problems are solved exactly by converting the linear partial differential equations into nonlinear Riccati equations. In the finite domain case, the full time dependent solutions are obtained analytically using bi-orthogonal basis functions. In the infinite domain case, the point spectrum of the forward operator is shown to be unbounded and that of the adjoint operator to be empty. In the unbounded case, the spectrum fills the entire area on one side of a parabola in the complex plane and is connected. As the fluid viscosity decreases the width of the parabola increases and in the limit of zero viscosity covers almost entire left half plane(LHP). On the other hand, as the fluid viscosity increases the width of parabola decreases and in the limit of infinite viscosity becomes negative real axis, which is the spectrum of heat equation. The spectrum of adjoint problem is empty for all values of the viscosity and prescribed velocity. In the finite spatial domain case, the point spectrum lies in the open left half plane for all Reynolds numbers and hence asymptotically stable. The results obtained showed that perturbations grow substantially large for finite time before they decay at large times. It is also found that retainig right number of modes is crucial for observing transient growth phenomena. Finally, the linear results are compared with the nonlinear finite amplitude simulation results. The relevance of current results to other fluid flows is presented.

<p> A multiple-input multiple-output (MIMO) communication system has the potential to provide reliable transmissions at high data rates. However, the computational cost of achieving this promising performance can be quite substantial. With an emphasis on practical implementations, the MIMO systems employing the low cost linear receivers are studied in this thesis. The optimum space-time block codes (STBC) that enable a linear receiver to achieve its best possible performance are proposed for various MIMO systems. These codes satisfy an intra and inter orthogonality property, and are called unitary trace-orthogonal codes. In addition, several novel transmission schemes are specially designed for linear receivers with the use of the proposed code structure. The applications of the unitary trace-orthogonal code are not restricted to systems employing linear receivers. The proposed code structure can be also applied to the systems employing other types of receivers where several originally intractable code design problems are successfully solved.</p> <p>The communication schemes presented in this thesis are outlined as follows: •For a MIMO system with N ≥ M, where M and N are the number of transmitter and receiver antennas, respectively, the optimal full rate linear STBC for linear receivers is proposed and named unitary trace-orthogonal code. The proposed code structure is proved to be necessary and sufficient to achieve the minimum detection error probability for the system. • When applied to a multiple input single output (MISO) communication system, a special linear unitary trace-orthogonal code, named the Toeplitz STBC, is proposed. The code enables a linear receiver to provide full diversity and to achieve the optimal tradeoff between the detection error and the data transmission rate. This is, thus far, the first code that possesses such properties for an arbitrary MISO system that employs a linear receiver. • In MIMO systems in which N ≥ M and the signals are transmitted at full symbol rate, the highest diversity gain achievable by linear receivers is analyzed and shown to be N - M + 1. To improve the performance of a linear receiver, a multi-block transmission scheme is proposed, in which signals are coded so that they span multiple independent channel realizations. An optimal full rate linear STBC for this system that minimizes the detection error probability is presented. The code is named multi-block unitary trace-orthogonal code. The resulting system has an improved diversity gain. Furthermore, by relaxing the code from the full symbol rate constraint, a special multi-block transmission scheme is proposed. This scheme achieves a much improved diversity gain than those with full symbol rate. • The unitary trace-orthogonal code can also be applied to a system that employs a maximum-likelihood (ML) receiver rather than the simple linear receiver. For such a system, a systematic design of full diversity unitary trace-orthogonal code is presented for an arbitrary data transmission rate. </p> <p>In summary, when a simple linear receiver is employed, unitary trace-orthogonal codes and their optimality properties are exploited for various multiple antenna communication systems. Some members from this code family can also enable an optimal performance of ML detection. </P> / Thesis / Doctor of Philosophy (PhD)

The results presented in this dissertation refer to the geometry of Minkowski spaces, i.e., of real finite-dimensional Banach spaces. First we study geometric properties of radial projections of bisectors in Minkowski spaces, especially the relation between the geometric structure of radial projections and Birkhoff orthogonality. As an application of our results it is shown that for any Minkowski space there exists a number, which plays somehow the role that $\sqrt2$ plays in Euclidean space. This number is referred to as the critical number of any Minkowski space. Lower and upper bounds on the critical number are given, and the cases when these bounds are attained are characterized. Moreover, with the help of the properties of bisectors we show that a linear map from a normed linear space $X$ to another normed linear space $Y$ preserves isosceles orthogonality if and only if it is a scalar multiple of a linear isometry. Further on, we examine the two tangent segments from any exterior point to the unit circle, the relation between the length of a chord of the unit circle and the length of the arc corresponding to it, the distances from the normalization of the sum of two unit vectors to those two vectors, and the extension of the notions of orthocentric systems and orthocenters in Euclidean plane into Minkowski spaces. Also we prove theorems referring to chords of Minkowski circles and balls which are either concurrent or parallel. All these discussions yield many interesting characterizations of the Euclidean spaces among all (strictly convex) Minkowski spaces. In the final chapter we investigate the relation between the length of a closed curve and the length of its midpoint curve as well as the length of its image under the so-called halving pair transformation. We show that the image curve under the halving pair transformation is convex provided the original curve is convex. Moreover, we obtain several inequalities to show the relation between the halving distance and other quantities well known in convex geometry. It is known that the lower bound for the geometric dilation of rectifiable simple closed curves in the Euclidean plane is $\pi/2$, which can be attained only by circles. We extend this result to Minkowski planes by proving that the lower bound for the geometric dilation of rectifiable simple closed curves in a Minkowski plane $X$ is analogously a quarter of the circumference of the unit circle $S_X$ of $X$, but can also be attained by curves that are not Minkowskian circles. In addition we show that the lower bound is attained only by Minkowskian circles if the respective norm is strictly convex. Also we give a sufficient condition for the geometric dilation of a closed convex curve to be larger than a quarter of the perimeter of the unit circle.

The present thesis contributes to the theory of generalized Minkowski spaces as a continuation of Minkowski geometry, i.e., the geometry of finite-dimensional normed spaces over the field of real numbers. In a generalized Minkowski space, distance and length measurement is provided by a gauge, whose definition mimics the definition of a norm but lacks the symmetry requirement. This seemingly minor change in the definition is deliberately chosen. On the one hand, many techniques from Minkowski spaces can be adapted to generalized Minkowski spaces because several phenomena in Minkowski geometry simply do not depend on the symmetry of distance measurement. On the other hand, the possible asymmetry of the distance measurement set up by gauges is nonetheless meaningful and interesting for applications, e.g., in location science. In this spirit, the presentation of this thesis is led mainly by minimization problems from convex optimization and location science which are appealing to convex geometers, too. In addition, we study metrically defined objects, which may receive a new interpretation when we measure distances asymmetrically. To this end, we use a combination of methods from convex analysis and convex geometry to relate the properties of these objects to the shape of the unit ball of the generalized Minkowski space under consideration.