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.

In 1942, Paul C. Rosenbloom put out a definition of a Post algebra after Emil L. Post published a collection of systems of many–valued logic. Post algebras became easier to handle following George Epstein’s alternative definition. As conceived by Rosenbloom, Post algebras were meant to capture the algebraic properties of Post’s systems; this fact was not verified by Rosenbloom nor Epstein and has been assumed by others in the field. In this thesis, the long–awaited demonstration of this oft–asserted assertion is given. After an elemental history of many–valued logic and a review of basic Classical Propositional Logic, the systems given by Post are introduced. The definition of a Post algebra according to Rosenbloom together with an examination of the meaning of its notation in the context of Post’s systems are given. Epstein’s definition of a Post algebra follows the necessary concepts from lattice theory, making it possible to prove that Post’s systems of many–valued logic do in fact form a Post algebra.

No description available.

No description available.

This thesis takes a historical approach to its subject and focuses on Swedish cinema of the 1940s and 1950s. The thesis argues that Swedish cinema experienced a renaissance in the 1940s, lasting approximately from 1940 to 1953. It further suggests that one of the most important filmmakers in this renaissance was Hasse Ekman. By focussing upon Ekman and this renaissance, a much-needed contextualisation of Ingmar Bergman will be achieved. Ingmar Bergman is one of the most well-known and well-researched filmmakers of all time, but there are still gaps in the material surrounding him, and one such gap concerns his cinematic origins. Bergman was a part of the 1940s renaissance, during which Bergman worked with, and was influenced by, other filmmakers and in particular Ekman. The thesis is divided into three parts. The first part introduces the relevant literature and discusses ideas of authorship and national cinema. It also provides a historic overview of Swedish society and cinema during the 1940s and 1950s, providing the context needed to better understand the films of Ekman, and Bergman too. This part also looks at the 1930s to illustrate what came before this renaissance, and how the films of the 1940s differed from what had gone before. The second part is a chronological overview of Ekman's career from the late-1930s to his move to Spain in 1964. The last part is a discussion of Ekman's relation to Swedish society and his view of the world, based on close textual readings of his films. The aim of the thesis is to present, for the first time, a coherent and extensive overview of Ekman's career and body of work, while also situating it in the specific context in which it emerged, thereby shedding new light on an important, though neglected, episode in cinema history.

L'objet de cette thèse est l'étude des corps munis d'une dérivation de Hasse, sous l'angle de la théorie des modèles. Les deux premières parties sont dédiées à des rappels sur les propriétés algébriques des dérivations de Hasse et modèle-théoriques sur les corps munis d'une dérivation de Hasse qui sont existentiellement clos (axiomatisation, stabilité,...). On introduit dans la troisième partie un analogue de la géométrie algébrique prenant en compte la dérivation de Hasse ; et on l'utilise pour décrire les objets définissables dans les structures étudiées (via les prolongations, les D-structures,...). On s'intéreese dans la quatrième partie au cas particulier des sous-groupes infiniment définissables dans les groupes algébriques. La cinquième partie est dédié au cas de la caractéristique nulle, en particulier sur les différentes notions de rang.

.

Cette thèse en théorie algorithmique des nombres présente un nouvel algorithme probabiliste pour résoudre des équations quadratiques sur Z ou Q en dimension 5 sans utiliser de factorisation. Il est d'une complexité nettement meilleure que les algorithmes existants pour résoudre ce genre d'équations et repose sur deux algorithmes : celui de Simon et celui de Pollard et Schnorr. Après quelques rappels sur la théorie des formes quadratiques, on explique comment fonctionne cet algorithme. La suite consiste en l'analyse détaillée de cet algorithme pour laquelle on utilisera une version effective du théorème de densité de Tchebotarev.

<p>This thesis surveys the issue of finding rational points on algebraic curves over finite fields. Since Goppa's construction of algebraic geometric codes, there has been great interest in finding curves with many rational points. Here we explain the main tools for finding rational points on a curve over a nite eld and provide the necessary background on ring and field theory. Four different articles are analyzed, the first of these articles gives a complete set of table showing the numbers of rational points for curves with genus up to 50. The other articles provide interesting constructions of covering curves: covers by the Hemitian curve, Kummer extensions and Artin-Schreier extensions. With these articles the great difficulty of finding explicit equations for curves with many rational points is overcome. With the method given by Arnaldo García in [6] we have been able to nd examples that can be used to define the lower bounds for the corresponding entries in the tables given in http: //wins.uva.nl/~geer, which to the time of writing this Thesis appear as "no information available". In fact, as the curves found are maximal, these entries no longer need a bound, they can be given by a unique entry, since the exact value of N_q(g) is now known.</p><p>At the end of the thesis an outline of the construction of Goppa codes is given and the NXL and XNL codes are presented.</p><p> </p>

This thesis surveys the issue of finding rational points on algebraic curves over finite fields. Since Goppa's construction of algebraic geometric codes, there has been great interest in finding curves with many rational points. Here we explain the main tools for finding rational points on a curve over a nite eld and provide the necessary background on ring and field theory. Four different articles are analyzed, the first of these articles gives a complete set of table showing the numbers of rational points for curves with genus up to 50. The other articles provide interesting constructions of covering curves: covers by the Hemitian curve, Kummer extensions and Artin-Schreier extensions. With these articles the great difficulty of finding explicit equations for curves with many rational points is overcome. With the method given by Arnaldo García in [6] we have been able to nd examples that can be used to define the lower bounds for the corresponding entries in the tables given in http: //wins.uva.nl/~geer, which to the time of writing this Thesis appear as "no information available". In fact, as the curves found are maximal, these entries no longer need a bound, they can be given by a unique entry, since the exact value of Nq(g) is now known. At the end of the thesis an outline of the construction of Goppa codes is given and the NXL and XNL codes are presented.