Submitted by Divisão de Documentação/BC Biblioteca Central (ddbc@ufam.edu.br) on 2017-02-13T14:54:34Z No. of bitstreams: 2 Dissertação - Jhones C. Coelho.pdf: 3503211 bytes, checksum: 4de205e9176e97055216984a347c55ef (MD5) license_rdf: 0 bytes, checksum: d41d8cd98f00b204e9800998ecf8427e (MD5) / Approved for entry into archive by Divisão de Documentação/BC Biblioteca Central (ddbc@ufam.edu.br) on 2017-02-13T14:55:02Z (GMT) No. of bitstreams: 2 Dissertação - Jhones C. Coelho.pdf: 3503211 bytes, checksum: 4de205e9176e97055216984a347c55ef (MD5) license_rdf: 0 bytes, checksum: d41d8cd98f00b204e9800998ecf8427e (MD5) / Approved for entry into archive by Divisão de Documentação/BC Biblioteca Central (ddbc@ufam.edu.br) on 2017-09-21T18:18:45Z (GMT) No. of bitstreams: 2 Dissertação - Jhones C. Coelho.pdf: 3503211 bytes, checksum: 4de205e9176e97055216984a347c55ef (MD5) license_rdf: 0 bytes, checksum: d41d8cd98f00b204e9800998ecf8427e (MD5) / Made available in DSpace on 2017-09-21T18:18:45Z (GMT). No. of bitstreams: 2 Dissertação - Jhones C. Coelho.pdf: 3503211 bytes, checksum: 4de205e9176e97055216984a347c55ef (MD5) license_rdf: 0 bytes, checksum: d41d8cd98f00b204e9800998ecf8427e (MD5) Previous issue date: 2016-12-15 / Given a set of points on the plane, we call terminals or regular points, it proves that there is always a minimum tree that connects called "Steiner tree". The terminals may represent hubs to routes, circuit elements, or different networks. That is, the problem in question is to optimize to communication between terminals, if this is represented by a tree of shortest length possible. Not always the "shorter"is optimization. Steiner problem has variations, for example, the tree can only follow the edges of the horizontal and vertical directions, as in the case of electrical circuits. Another variation is when each Steiner point is very expensive, and it is intended to obtain such a tree with the lowest number of such points. It will be "local minimum"for length, but not necessarily globally. A physical and quite simple model for "Steiner tree"is that it can also be performed by soap films, and therefore share minimum surface properties. As an example, consider a soap solution. Getting closer and withdraw two parallel plates connected by pins, a film will connect them. This represents a minimum length graph that interconnects the pins. As is known, the soap films perform the Minimal Surfaces. To view a "Steiner tree"refers to Numerical Algorithms and Graphical Programming, methods are mainly based on the implementation of the algorithms. This present work is divided into three parts: a brief history of optimization problems, highlighted the Steiner problem; theory of the Minimum Tre or Steiner tree and algorithm Melzak; some examples of real cases. / Dado um conjunto de pontos no plano, que denominamos terminais ou pontos regulares, provase que sempre existe uma árvore mínima que os conecta, chamado "árvore de Steiner". Os terminais podem representar centros de conexão para rotas, elementos de circuito elétrico, ou de redes diversas. Ou seja, o problema em questão é otimizar a comunicação entre os terminais, caso isto seja representado por uma árvore de menor comprimento possível. Nem sempre o "menor comprimento"representa a otimização. O Problema de Steiner possui variações, por exemplo, em que as arestas da árvore só podem seguir direções horizontal e vertical, como no caso de circuitos elétricos. Outra variação é quando cada ponto Steiner tem custo muito alto, e pretende-se obter uma tal árvore com o menor número de tais pontos. Ela será "mínimo local"para comprimento, mas não necessariamente global. Um modelo físico e bastante simples para "árvore de Steiner"é que ela pode ser também realizada por películas de sabão, e por isso compartilham propriedades de Superfícies Mínimas. Como exemplo, considere uma solução de sabão. Ao mergulharmos e retirarmos duas placas paralelas ligadas por pinos, uma película irá conectá-los. Esta representa um grafo de comprimento mínimo que interliga os pinos. Como é sabido, as películas de sabão realizam as Superfícies Mínimas. Para visualizar uma "Árvore de Steiner", recorre-se a Algoritmos Numéricos e Programação Gráfica, os métodos baseiam-se principalmente na implementação dos algoritmos. Este presente trabalho está dividido em três partes: breve história dos problemas de otimização, em destaque o problema de Steiner; teoria sobre a Árvore Mínima ou Árvore de Steiner e o Algoritmo de Melzak; alguns exemplos de casos reais.

>Magister Scientiae - MSc / A Steiner triple system of order v is a collection of subsets of size three from a set of v-elements such that every pair of the elements of the set is contained in exactly one 3-subset. In this study, we discuss some known Steiner triple systems and their automorphism groups. We also construct block intersection graphs of the Steiner triple systems of our consideration and compare their automorphism groups to the automorphism groups of the Steiner triple systems.

This study provides an introduction to Rudolf Steiner's ideas on music and music education and describes how these ideas have been adapted and applied in Grades One through Three in North American Waldorf Schools. Included in the study are: Steiner's basic philosophical concepts relating to music and music education; Steiner's rationale for aesthetic and music education; a description of the Waldorf approach to music teaching; results of a questionnaire sent to twenty-three Waldorf Schools in North America; a comparison of Steiner's key ideas on music education with those of Orff, Kodaly, and Dalcroze. / Education, Faculty of / Curriculum and Pedagogy (EDCP), Department of / Graduate

The thesis is based on the translation of a seminal work by George Steiner After Babel (1975), published in Triáda Publishing in 2010. The study presented in this volume is divided into three parts: the first one sketches a general portrait of George Steiner as a literary and cultural critic, language philosopher and a Jewish thinker much of his thought is dedicated to the Shoah. The second part traces Steiners intellectual profile with regards to his life story. The third part introduces Steiner's poetics and ethics of translation, paying attention especially to the phenomenon of translation in the colonial and postcolonial world. It maps the succession of metaphorical images Steiner uses to pinpoint translation and interpretation in general, especially the metafor of war and of hospitality. It concludes that a metaphorical use of the term "translation" for the whole field of understanding, interpretation and cultural tradition is not of much help in our apprehension of what translation proper is.

The Steiner-Lehmus Theorem has garnered much attention since its conception in the 1840s. A variety of proofs resulting from the posing of the theorem are still appearing today, well over 100 years later. There are some amazing similarities among these proofs, as different as they seem to be. These characteristics allow for some interesting groupings and observations.

The n-point Steiner problem in the Euclidean plane is to find a least length path network connecting n points. In this thesis we will demonstrate how to find a least length path network T connecting n points on a closed 2-dimensional Riemannian surface of constant curvature by determining a region in the covering space that is guaranteed to contain T. We will then provide an algorithm for solving the n-point Steiner problem on such a surface.

Mémoire numérisé par la Direction des bibliothèques de l'Université de Montréal.

No description available.

No description available.

S(5,8,24) is one of the largest known Steiner systems and connects combinatorial designs, error-correcting codes, finite simple groups, and sphere packings in a truly remarkable way. This thesis discusses the underlying structure of S(5,8,24), its construction via the (24,12) Golay code, as well its automorphism group, which is the Mathieu group M24, a member of the sporadic simple groups. Particular attention is paid to the calculation of the size of automorphism groups of Steiner systems using the Orbit-Stabilizer Theorem. We conclude with a section on the sphere packing problem and elaborate on how the 8-sets of S(5,8,24) can be used to form Leech's Lattice, which Leech used to create the densest known sphere packing in 24-dimensions. The appendix contains code written for Matlab which has the ability to construct the octads of S(5,8,24), permute the elements to obtain isomorphic S(5,8,24) systems, and search for certain subsets of elements within the octads. / Master of Science