Nos livros de L. Frank Baum cuja ação se desenvolve na Terra de Oz, as personagens femininas aparecem nas mais diversas funções, de protagonista a vilã, de fada a bruxa, de princesa a general, entre outras, sejam elas humanas, feéricas ou animais, desdobrando-se em diversos papéis e, desse modo, reproduzindo alguns estereótipos e quebrando outros. Diante desse campo fértil, o presente trabalho investiga as formas de representação do feminino empregadas na série, cuja primeira e mais conhecida obra é O Maravilhoso Mágico de Oz. Para tanto, a principal teoria a ser utilizada será a semiótica de linha francesa, com o suporte dos estudos comparatistas e dos estudos de gênero. Averiguamos se os livros da série de Oz trazem inovação na forma de representar o feminino. Como na própria introdução do primeiro livro o autor declarava escrever um conto de fadas moderno, investigou-se ainda a aparente diversidade na forma de manifestar o feminino em relação a outros contos de fada, como os de Charles Perrault e os dos irmãos Grimm. / In L. Frank Baums Oz books, a wide range of roles are performed by female figures: leading character and villain, fairy and witch, princess and general, among others, be they human, fairy or animal, thus reproducing some stereotypes while subverting others. In the face of such a profitable field of study, this dissertation researches female representation throughout the series, whose most renowned book is The Wonderful Wizard of Oz. French semiotics is the main theory underlying our study, aided by gender studies and comparative literature studies. We also sought to ascertain whether the first four books in Baums Oz series innovate in terms of female representation. As the first Oz book introduction asserted it was the authors intention to write a modern fairytale, it was also explored in which ways Oz books represent female characters differently from other fairytales, such as those by Perrault and the Grimm brothers.

We give a strongly polynomial time combinatorial algorithm to minimise the largest eigenvalue of the weighted Laplacian of a bipartite graph. This is accomplished by solving the dual graph embedding problem which arises from a semidefinite programming formulation. In particular, the problem for trees can be solved in time cubic in the number of vertices.

Im Folgenden wird ein Promotionsprojekt zur Implementierung und Optimierung von hybriden Indexstrukturen beschrieben. Die erhöhte Suchperformance wird bei hybriden Indexstrukturen durch einen höheren Aufwand an Vorberechnungen bei Einfügeoperationen erreicht. Dadurch ergibt sich, im Gegensatz zu Ansätzen, welche mehrere Indexstrukturen miteinander verbinden oder getrennte Suchanfragen ausführen eine Effizienz der Reorganisation hybrider Indexstrukturen, die prohibitiv für den Einsatz in den meisten Anwendungen ist. Diese sollen innerhalb des Promotionsprojekts optimiert werden, um eine Einsatzfähigkeit in realistischen Szenarien gewährleisten zu können.

Made available in DSpace on 2015-03-26T13:45:34Z (GMT). No. of bitstreams: 1 texto completo.pdf: 773931 bytes, checksum: b0a68b67919eb9c2b9b8534b4a2a7818 (MD5) Previous issue date: 2012-02-16 / Coordenação de Aperfeiçoamento de Pessoal de Nível Superior / In this word, we did a detailed study of the Baum-Bott s theorem in two situations. To do this, we examine this theorem in [2] and its proof given by S. S. Chern using methods of differential geometry, in which case the non-degenerated singularities for one-dimensional holomorphic foliation.Then use the article [31] of M. Soares, where he retraces the Chern s proof with a slight change, thus eliminating the possibility of non-degenerated. The result of great importance because it is applied to meromorphic vector fields, which are abundant and generate one-dimensional singular holomorphic foliations in compact manifolds. As a way to apply this result, we deal with the problem of Poincare in [28] to limit the degree of an invariant curve depending on the degree of the foliation. This problem was motivated by the work of Darboux with respect to algebraic integrability foliations in [13]. We gathered the results of Cerveau and Lins Neto in [12] and also M.Carnicer in [9] about the problem of Poincare, that were introduced about 100 years later the work of Poincaré. Finally we also explored the contribution of M. Soares to this problem in [32]. / Fizemos, neste trabalho, um estudo detalhado do teorema de Baum-Bott em duas situações. Para tal feito, analisamos esse teorema em [2] e a sua prova dada por S. S. Chern através de métodos de geometria diferencial, no caso em que as singularidades da folheação holomorfa de dimensão 1 são do tipo não-degeneradas. Depois usamos o artigo [31] de M. Soares, onde ele refaz essa prova de Chern com uma ligeira mudança, retirando assim a hipótese de não-degeneregência. Resultado esse de grande importância pelo fato de ser aplicado a campos de vetores meromorfos, que são abundantes e que geram folheações holomorfas singulares de dimensão 1 em variedade compactas. Como maneira de aplicar tal resultado, lidamos com o problema de Poincaré em [28], que trata de limitar o grau de uma curva invariante em função do grau da folheação. Esse problema foi motivado pelo trabalho de Darboux com respeito á integrabilidade algébrica de folheações em [13]. Reunimos os resultados de Cerveau e Lins neto em [12] e também de M. Carnicer em [9] a respeito do problema de Poincaré, que foram apresentados cerca de 100 anos depois do trabalho de Poincaré. E por fim exploramos a contribuição de M. Soares para esse problema em [32].

In Natural Language Processing (NLP), speech and text are parsed and generated with language models and parser models, and translated with translation models. Each model contains a set of numerical parameters which are found by applying a suitable training algorithm to a set of training data. Many such training algorithms are instances of the Expectation-Maximization (EM) algorithm. In [BSV15], a generic EM algorithm for NLP is described. This work presents a particular speech model, the Hidden Markov model, and its standard training algorithm, the Baum-Welch algorithm. It is then shown that the Baum-Welch algorithm is an instance of the generic EM algorithm introduced by [BSV15], from which follows that all statements about the generic EM algorithm also apply to the Baum-Welch algorithm, especially its correctness and convergence properties.

Im Folgenden wird ein Promotionsprojekt zur Implementierung und Optimierung von hybriden Indexstrukturen beschrieben. Die erhöhte Suchperformance wird bei hybriden Indexstrukturen durch einen höheren Aufwand an Vorberechnungen bei Einfügeoperationen erreicht. Dadurch ergibt sich, im Gegensatz zu Ansätzen, welche mehrere Indexstrukturen miteinander verbinden oder getrennte Suchanfragen ausführen eine Effizienz der Reorganisation hybrider Indexstrukturen, die prohibitiv für den Einsatz in den meisten Anwendungen ist. Diese sollen innerhalb des Promotionsprojekts optimiert werden, um eine Einsatzfähigkeit in realistischen Szenarien gewährleisten zu können.

We give a strongly polynomial time combinatorial algorithm to minimise the largest eigenvalue of the weighted Laplacian of a bipartite graph. This is accomplished by solving the dual graph embedding problem which arises from a semidefinite programming formulation. In particular, the problem for trees can be solved in time cubic in the number of vertices.

No description available.

Diese Broschüre dient zur Information für Kommunen, Planer, Baumfreunde und Interessierte. Sie gibt Anregungen, wie wieder mehr Bäume an Straßen im ländlichen Raum gepflanzt werden können und was es dabei zu berücksichtigen gilt. Im Rahmen der gesetzlichen Anforderungen werden hierzu die aktuell gültigen Regelwerke sowie die unterschiedlichen fachlichen Sichtweisen und Herausforderungen dargestellt und beispielhafte Lösungsmöglichkeiten aufgezeigt. Redaktionsschluss: 31.08.2020

Mit der Förderrichtlinie Natürliches Erbe (FRL NE/2023) kann eine Förderung für die Pflanzung von Bäumen an Kreis- und Gemeindestraßen sowie sonstigen öffentlichen Straßen, z. B. Feld- und Radwegen beantragt werden. Im Flyer finden Sie aktuelle Hinweise zu Pflanzabständen und Förderprogrammen von Bäumen an Straßen. Redaktionsschluss: 06.11.2023