131 |
Die Geburt des modernen Mysteriendramas aus dem Geiste Weimars : zur Aktualität Goethes und Schillers in der Dramaturgie Rudolf SteinersClement, Christian January 2007 (has links)
Zugl.: Logan (Utah), Utah State Univ., Diss., 2005
|
132 |
Projetivo de curvatura em pontos de uma 3-variedade / Projective Locus Plane at points of a 3-ManifoldsRodrigues, Débora Santos 30 July 2013 (has links)
Made available in DSpace on 2015-03-26T13:45:36Z (GMT). No. of bitstreams: 1
texto completo.pdf: 2162893 bytes, checksum: 4b666208fbc222c17155380c6989fbf1 (MD5)
Previous issue date: 2013-07-30 / Coordenação de Aperfeiçoamento de Pessoal de Nível Superior / In this work we study of the curvature projective plane at a point of a 3-manifold immersed in Rn n ≥ 4, based one the thesis of R. R. Binotto [1]. We analyzed the different types of surfaces that describe the projective. We show that it can to be described as an isomorphism of the Veronese s surface of order 2 followed by a linear transformation and a translation. We also relate the types of a point on a 3-manifold with the degenericity of projective in the normal space. We conclude this study by analyzing the curvature locus of points in a n-manifold immersed in codimension 2, according to [14]. We present some examples, analyzing a few geometric properties of the curvature locus and comment on some results related to the geometry of a 3-manifold in codimension 2. / Neste trabalho fazemos um estudo do projetivo de curvatura em um ponto de uma 3-variedade imersa em Rn , n ≥ 4, tendo como base a tese de de R. R. Binotto [1]. Analisamos os diferentes tipos de superfícies que descrevem o projetivo, mostramos que este pode ser descrito como um isomorfismo da superfície de Veronese de ordem 2 seguido de uma transformação linear e de uma translação. Também relacionamos os tipos de pontos da 3-variedade com a degenericidade do projetivo no espaço normal. Finalizamos o estudo analisando o locus de curvatura em pontos de uma n-variedade imersa em codimenso 2, de acordo com [14], apresentamos alguns exemplos, analisando algumas propriedades geométricas do locus de curvatura e comentamos alguns resultados relacionados à geometria de uma 3-variedade em codimensão 2.
|
133 |
Métodos heurísticos aplicados ao problema da árvore de Steiner rectilinearSilva, Thiago Gouveia da 28 August 2009 (has links)
Made available in DSpace on 2015-05-14T12:36:55Z (GMT). No. of bitstreams: 1
parte1.pdf: 1169586 bytes, checksum: 685986454ee5e2cc58d709e7d646732f (MD5)
Previous issue date: 2009-08-28 / Coordenação de Aperfeiçoamento de Pessoal de Nível Superior / This work presents a new heuristic, called Heurística 1, and the implementations of
the GRASP, Simulated Annealing and Genetic Algorithms metaheuristics for the
rectilinear Steiner minimum tree problem (RSMTP), talking about its theoretical
aspects, like computational complexity, and practical ones, like pseudo-codes and
implementation strategies. The new techniques for RSMTP presented, especially
the Genetic Algorithms, have computational results of superior quality in
comparison to the best heuristics in present litera / Este trabalho apresenta uma nova heurística, denominada Heurística 1, e a
implementação das metaheurísticas GRASP, Simulated Annealing e Algoritmos
Genéticos para o problema da árvore retilínea mínima de Steiner (RSMTP),
discorrendo sobre seus aspectos teóricos, como a complexidade computacional; e
práticos, como pseudocódigos e estratégias de implementação. As novas
abordagens para o RSMTP apresentadas, em especial os Algoritmos Genéticos,
ostentam resultados computacionais de qualidade superior às apresentadas pelas
melhores heurísticas da literatura atual.
|
134 |
Steinerovská barvení kubických grafů / Steiner coloring of cubic graphsTlustá, Stanislava January 2017 (has links)
This thesis is dedicated to the coloring of cubic graphs. It summarizes the knowledge we have about so called Steiner coloring, which is an edge-coloring such that the colors incident with one vertex form a triple of some partial Steiner system. The main objects of interest are the projective and affine systems. Afterwards the sufficient condition for universality of the system is stated and it is observed, that all other transitive Steiner triple systems satisfy it. This thesis also contains methods of construction of the coloring for the Fano plane, for the affine system Z3 3 and for the universal system created as a product of the Fano plane and the trivial system (F7 S⊠ 3). Finally an algorithm usable for the rest of the systems and graphs with bounded treewidth is presented.
|
135 |
Complexity and Approximation of the Rectilinear Steiner Tree ProblemMussafi, Noor Saif Muhammad 21 July 2009 (has links)
Given a finite set K of terminals in the plane. A
rectilinear Steiner minimum tree for K (RST) is
a tree which interconnects among these terminals
using only horizontal and vertical lines of shortest
possible length containing Steiner point. We show the
complexity of RST i.e. belongs to NP-complete.
Moreover we present an approximative method of
determining the solution of RST problem proposed by Sanjeev Arora
in 1996, Arora's Approximation Scheme. This algorithm
has time complexity polynomial in the number of
terminals for a fixed performance ratio 1 + Epsilon.
|
136 |
Novomediální vzdělávání na středních waldorfských školách / New media education at secondary waldorf schoolsSladkovská, Alena January 2012 (has links)
The thesis deals with the history and the present of waldorf schools founded by Rudolf Steiner. Also describes media literacy with an emphasis on new media. It covers the way how the new media education is embedded in the Czech educational system. As a particular example served curriculum of the school subject Information and communication technology of the waldorf secondary school in Prague. The thesis also describes the way of media education in Germany. In the second part of this thesis can be found an evaluation of the questionnaire made in secondary waldorf schools in Prague and Semily which had to learn the status quo of (new) media literacy of the students and their relationship with modern technologies. The end of the thesis deals with the suggestion of improvement of the tuition based on the German model.
|
137 |
Optimization of information flows in telecommunication networks / Optimisation de flots d'information dans les réseaux de télécommunicationsLefebvre, Thibaut 27 June 2016 (has links)
Dans les réseaux de télécommunications, la demande croissante pour de nouveaux services, comme la diffusion de vidéos en continu ou les conférences en ligne, engendre un besoin pour des dispositifs de télécommunication où le même contenu est acheminé depuis un émetteur unique vers un groupe de récepteurs. Cette évolution ouvre la voie au développement de nouvelles techniques d'acheminement des données, comme le multicast qui laisse un nœud du réseau copier ses données d'entrée puis retransmettre ces copies, ou le codage réseau, qui est une technique permettant à un nœud d'effectuer des opérations de codage à partir de ses données d'entrée. Cette thèse traite de la mise en place de techniques de codage au sein d'un réseau multicast filaire. Nous formalisons certains problèmes qui apparaissent naturellement dans ce contexte grâce à la recherche opérationnelle et à des outils d'optimisation mathématique. Notre objectif est de développer des modèles et des algorithmes afin de calculer, au moins de manière approchée, certaines grandeurs qui ont vocation à être pertinentes dans le cadre de la comparaison de techniques d'acheminement de données dans un réseau de télécommunications. Nous évaluons ainsi, d'un point de vue à la fois théorique et expérimental, l'impact induit par l'introduction de techniques de codage au sein d'un réseau multicast. Nous nous concentrons en particulier sur des critères importants pour un opérateur de télécommunication, comme la maximisation du débit d'information entre une source et un ensemble de destinataires dans le réseau, la minimisation de la congestion sous contrainte de demande, ou la minimisation de la perte de débit ou du coût induit par l'acheminement des données dans un réseau soumis à des pannes. / In telecommunication networks, the increasing demand for new services, like video-streaming or teleconferencing, along with the now common situation where the same content is simultaneously requested by a huge number of users, stress the need for point to many data transmission protocols where one sender wishes to transmit the same data to a set of receivers. This evolution leads to the development of new routing techniques like multicast, where any node of the network can copy its received data and then send these copies, or network coding, which is a technique allowing any node to perform coding operations on its data. This thesis deals with the implementation of coding techniques in a wired multicast network. We formalize some problems naturally arising in this setting by using operations research and mathematical optimization tools. Our objective is to develop models and algorithms which could compute, at least approximately, some quantities whose purpose is to be relevant as far as forwarding data using either multicast and network coding in telecommunications networks is concerned. We hence evaluate, both in theory and numerically, the impact of introducing coding techniques in a multicast network. We specifically investigate relevant criteria, with respect to the field of telecommunications, like the maximum amount of information one can expect to convey from a source to a set of receivers through the network, the minimum congestion one can guarantee while satisfying a given demand, or the minimum loss in throughput or cost induced by a survivable routing in a network prone to failures.
|
138 |
[en] A KEYWORD-BASED QUERY PROCESSING METHOD FOR DATASETS WITH SCHEMAS / [pt] MÉTODO PARA O PROCESSAMENTO DE CONSULTAS POR PALAVRAS-CHAVES PARA BASES DE DADOS COM ESQUEMASGRETTEL MONTEAGUDO GARCÍA 23 June 2020 (has links)
[pt] Usuários atualmente esperam consultar dados de maneira semelhante ao Google, digitando alguns termos, chamados palavras-chave, e deixando para o sistema recuperar os dados que melhor correspondem ao conjunto de palavras-chave. O cenário é bem diferente em sistemas de gerenciamento de banco de dados em que os usuários precisam conhecer linguagens de consulta sofisticadas para recuperar dados, ou em aplicações de banco de dados em que as interfaces de usuário são projetadas como inúmeras caixas que o usuário deve preencher com seus parâmetros de pesquisa. Esta tese descreve um algoritmo e um framework projetados para processar consultas baseadas em palavras-chave para bases de dados com esquema, especificamente bancos relacionais e bases de dados em RDF. O algoritmo primeiro converte uma consulta baseada em palavras-chave em uma consulta abstrata e, em seguida, compila a consulta abstrata em uma consulta SPARQL ou SQL, de modo que cada resultado da consulta SPARQL (resp. SQL)
seja uma resposta para a consulta baseada em palavras-chave. O algoritmo explora o esquema para evitar a intervenção do usuário durante o processo de busca e oferece um mecanismo de feedback para gerar novas respostas. A tese termina com experimentos nas bases de dados Mondial, IMDb e Musicbrainz. O algoritmo proposto obtém resultados satisfatórios para os benchmarks. Como parte dos experimentos, a tese também compara os resultados e o desempenho obtidos com bases de dados em RDF e bancos de dados relacionais. / [en] Users currently expect to query data in a Google-like style, by simply typing some terms, called keywords, and leaving it to the system to retrieve the data that best match the set of keywords. The scenario is quite different in database management systems, where users need to know sophisticated query languages to retrieve data, and in database applications, where the user interfaces are designed as a stack of pages with numerous boxes that the user must fill with his search parameters. This thesis describes an algorithm and a framework designed to support keywordbased queries for datasets with schema, specifically RDF datasets and relational databases. The algorithm first translates a keyword-based query into an abstract
query, and then compiles the abstract query into a SPARQL or a SQL query such that each result of the SPARQL (resp. SQL) query is an answer for the keywordbased query. It explores the schema to avoid user intervention during the translation process and offers a feedback mechanism to generate new answers. The thesis concludes with experiments over the Mondial, IMDb, and Musicbrainz databases. The proposed translation algorithm achieves satisfactory results and good performance for the benchmarks. The experiments also compare the RDF and the relational alternatives.
|
139 |
[pt] O PROBLEMA MULTI-PERÍODO DA ÁRVORE DE STEINER COM COLETAS DE PRÊMIOS E RESTRIÇÕES DE ORÇAMENTO / [en] THE MULTI-PERIOD PRIZE-COLLECTING STEINER TREE PROBLEM WITH BUDGET CONSTRAINTSLARISSA FIGUEIREDO TERRA DE FARIA 26 January 2021 (has links)
[pt] Esta tese generaliza a variante multi-período do clássico problema da
Árvore de Steiner com coleta de prêmios (PCST), que visa encontrar um
subgrafo conexo que maximize os prêmios recuperados de nós conectados
menos o custo de utilização das arestas conectadas. Este trabalho
adicionalmente: (a) permite que vértices sejam conectados à árvore em
diferentes períodos de tempo; (b) impõe um orçamento pré-definido em
arestas selecionadas em um horizonte específico de períodos de tempo; e (c)
limita o comprimento total de arestas que podem ser adicionadas em um
período de tempo. Um algoritmo branch-and-cut é fornecido para este
problema, avaliando satisfatoriamente instâncias benchmark da literatura,
adaptadas para uma configuração multi-período, de até aproximadamente
2000 vértices e 200 terminais em tempo razoável. / [en] This thesis generalizes the multi-period variant of the classical Prizecollecting
Steiner Tree Problem, which aims at finding a connected subgraph
that maximizes the revenues collected from connected nodes minus the costs
to utilize the connecting edges. This work additionally: (a) allows vertices
to be added to the tree at different time periods; (b) imposes a predefined
budget on edges selected over a specific horizon of time periods; and (c)
limits the total length of edges that can be added over a time period. A
branch-and-cut algorithm is provided for this problem, satisfactorily evaluating
benchmark instances from the literature, adapted to a multi-period setting, up
to approximately 2000 vertices and 200 terminals in reasonable time.
|
140 |
A monograph of the genus Helicotylenchus Steiner,1945 (Nemata: Hoplolaimidae)Marais, Mariette 12 1900 (has links)
Thesis (PhD(Agric))--Stellenbosch University, 2001. / ENGLISH ABSTRACT: The genus Helicotylenchus Steiner of the family Holplolaimidae is reviewed. The
different morphometric and morphological characters used in species description are
discussed. Thirty-five species occurring in South Africa, French Guiana and the
French Caribbean Islands are redescribed, based on type and other material. A new
species, viz. H. marethae n.sp. is described from South Africa. Apart from line
drawings SEM micrographs are included for most species. / AFRIKAANSE OPSOMMING: In hierdie monograaf van die genus Helicotylenchus van die familie
Hoplolaimidae, word die verskillende morfologiese en morfometriese eienskappe
gebruik in spesie beskrywings, bespreek. Vyf-en-dertig van die spesies wat in Suid-
Afrika, Frans Guiana en die Franse Karibiese Eilande voorkom word op grond van tipe
of ander materiaal herbeskryf. 'n Nuwe spesie H. marethae afkomstig vanaf Suid-
Afrika word beskryf. Behalwe vir lyntekeninge word SEM mikrograwe van meeste van
die spesies ook gegee.
|
Page generated in 0.0861 seconds