Made available in DSpace on 2014-06-11T19:26:54Z (GMT). No. of bitstreams: 0 Previous issue date: 2008-02-25Bitstream added on 2014-06-13T19:14:19Z : No. of bitstreams: 1 vitagliaro_km_me_sjrp.pdf: 979972 bytes, checksum: ef5faebb618c01cbd4b32df5c0b5655d (MD5) / Este trabalho objetiva estudar alguns conceitos desenvolvidos por Maria Gabriela Llansol ao longo de seus textos, como a “cena fulgor” e o “dom poético”, que provocam o deslocamento da narratividade para a textualidade. Foram selecionados seis contos de sua primeira obra, Os pregos na erva (1962), observando-se dois núcleos estruturais da “cena fulgor”: a imagem poética e o diálogo. Consciente de que a imagem é um traço constitutivo do universo lírico, responsável pela transformação das palavras, num movimento de expansão que liberta os signos de seus significados usuais, a narrativa de Llansol recorre a esse traço como uma maneira de iluminar a mínima cena que conta, pois a ação é reduzida, o espaço é precário e a comunicação entre as personagens é falha. Essas características são típicas do teatro contemporâneo de Samuel Beckett e provocam, em alguns casos, o efeito de distanciamento sugerido por Brecht. Por essa razão, o conceito de diálogo será utilizado em dois sentidos: como interação verbal que estrutura o drama, e, de forma mais ampla, como um sistema de correlação que permite observar a intersecção entre os gêneros épico, lírico e dramático. Para isso, fundamenta-se em Bakhtin (2000) e Rosenfeld (2005), na discussão dos gêneros; em Octavio Paz (1982) e Friedrich (1978), na concepção de imagem; em Beckett (1952) e Brecht (2005), com suas teorias sobre o teatro moderno (2005) e em críticos que analisam a obra da escritora portuguesa. Por fim, conclui-se que a narrativa de Llansol é uma rede destecida enquanto enredo, mas que se tece enquanto texto que extrapola as barreiras dos gêneros literários, fazendo coexistir numa relação harmônica, e ao mesmo tempo conflitante, prosa, poesia e drama. Como “pregos na erva”, as palavras não se fixam, flutuam, se desprendem, se deslocam, num movimento ininterrupto que tece o corpo da escrita. / This work aims to study a few concepts developed by Maria Gabriela Llansol along some of her texts, like “cena fulgor” and “dom poético”, that cause the replacement from narrativity to textuality. Six short stories from her first work, Os pregos na erva (1962), were selected, considering two structural cores of “cena fulgor”: poetic imagery and dialogue. Being aware that imagery is a constitutive trace of the lyrical universe, responsible for transformation of words, in a motion of expiation that frees the signs from their usual meanings, Llansol’s narrative follows this trace as a way of lighten up the smallest scene that it refers to, because action is reduced, setting is precarious and communication between people is flawed. These characteristics are typical of Samuel Beckett’s contemporary theater and provoke, in certain cases, the distancing effect suggested by Brecht. For this reason, the concept of dialogue will be taken in two senses: as verbal interaction that structures the drama and, in a more broaden way, as a system of correlations that allows us to observe the intersection between epic, lyric and dramatic genres. Aiming that, the theories that fundament this research regard Bakhtin (2000) and Rosenfeld (2005), discussing genres; Octavio Paz (1982) and Friedrich (1978), for the conception of imagery; Beckett (1952) e Brecht (2005), about modern theater (2005); and critics that have analyzed the Portuguese author’s work. At last, we come to the conclusion that Llansol’s narrative is an unweaved web regarding the plot, but that weaves itself as a text that goes beyond literary genres’ borders, in such a way that narrative, poetry and drama coexist in a harmonic, but yet confronting relationship. As “pregos na erva” (nails in a herb) words are not fixed, they float, they are released, they move in an non-interrupt way that weaves the body of the text.

Made available in DSpace on 2014-06-11T19:26:56Z (GMT). No. of bitstreams: 0 Previous issue date: 2006-03-03Bitstream added on 2014-06-13T20:27:28Z : No. of bitstreams: 1 bronzi_ma_me_sjrp.pdf: 904425 bytes, checksum: 2344eb35a112034c2f1741b2e229f1ec (MD5) / Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP) / Estudamos intersecções homoclínicas de variedades estável e instável de pontos peródicos. Toda intersecção homoclínica produz um comportamento curioso na dinâmiôa. Nosso modelo de tal fenômeno é a famosa ferradura de Smale, a qual é um conjunto hiperbólico para um difeomorfismo. Além disso, estudamos dinâmica não hiperbólica cuja perda de hiperbolicidade é divido à tangências homoclínicas. Elas tem um papel central na teoria de sistemas dinâmicos. O desdobramento de uma tangência homoclínica produz dinâmicas muito interessantes. Neste trabalho estudamos a criação de cascatas de bifurcações de duplicação de período e um esquema de renormalização para uma tangência homoclínica. / We study homoclinic intersection of stable and unstable manifolds of periodic points. Every homoclinic intersection produce a intricate behavior of the dynamics. Our model of such phenomena is the so called Smalesþs horseshoe, which is a hyperbolic set for a di eomorphism. We also study non hyperbolic dynamics whose lack of hyperbolicity is due to homoclinic tangencies. They play a central role in the theory of dynamical systems. The unfolding of a homoclinic tangency produce many interesting dynamics. In this work we study creation of cascade of period doubling bifurcations and a renormalization scheme for a homoclinic tangency.

[pt] Este trabalho apresenta um ambiente computacional para modelagem geométrica aplicada à análise por elementos finitos usando multi-regiões e superfícies paramétricas representadas por NURBS. O principal objetivo é gerar modelos 3D para serem usados em simulações numéricas baseadas no Método de Elementos Finitos (MEF). Nessa proposta, a metodologia adotada consiste na combinação de alguns aspectos da modelagem geométrica tais como a detecção automática de regiões e a interseção de superfícies com geração de malhas de elementos finitos. No contexto da programação orientada a objetos, uma nova organização de classes para o modelador geométrico usado neste trabalho, denominado MG, é apresentada. Essa organização de classes permite a implementação do ambiente proposto, mantendo a interface com o usuário tão simples e eficiente quanto à versão original. A organização de classes também provê suporte para a geração de modelos usados em análise por elementos finitos. Enquanto as malhas de elementos finitos requeridas para simulações numéricas são geradas por algoritmos específicos implementados no modelador MG, os atributos são gerenciados por um sistema, denominado ESAM (Extensible System Attributes Management), que também é incorporado ao MG. Esse sistema permite que os atributos do modelador MG sejam configurados para o uso em diversos tipos de problemas de engenharia. A estrutura de dados usada neste ambiente é representada por um enfoque híbrido baseado na combinação de uma representação CGC (Complete Geometric Complex) do modelo e na estrutura de dados estendida do modelador MG. Além disso, a determinação da interseção de superfícies é realizada usando um algoritmo implementado no MG, enquanto que a representação CGC é responsável pelo reconhecimento de multi-regiões. O algoritmo de interseção de superfícies é modificado para tratar casos especiais não considerados na sua versão original. / [en] This work presents a computational environment for geometric modeling applied to finite-element analysis using multi-regions and parametric surfaces represented as NURBS. The main goal is to generate 3D models to be used in numerical simulations based on the Finite-Element Method (FEM). For this purpose, the adopted methodology consists of combining some aspects of geometric modeling, such as automatic region detection and surface intersection, with finite-element mesh generation. In the context of Object-Oriented Programming, a new class organization for the geometric modeler used in this work, called MG (Mesh Generation), is presented. This class organization allows the implementation of the proposed environment, keeping the user interface as simple and efficient as in the original version of the MG modeler. The proposed class organization also provides support for the generation of models used in finite-element analysis. While the finite-element meshes required for the numerical simulations are generated by specific algorithms implemented in MG, the attributes are managed by a system called ESAM (Extensible System Attributes Management), which also is incorporated into MG. This system allows the customization of simulation attributes in the MG modeler for use in different types of Engineering problems. The data structure used in this environment is represented by a hybrid approach based on the combination of a CGC (Complete Geometric Complex) representation and the MG`s data structure, which has been extended for this purpose. Moreover, the computation of surface intersections is accomplished by using an algorithm implemented in the MG, while the CGC representation is responsible for multi-region recognition. The surface-intersection algorithm has been modified in order to handle special cases that have not been treated in the original version.

[pt] Apresenta-se uma metodologia para modelagem de cascas para elementos finitos definidas em superfícies paramétricas. A metodologia consiste na criação de curvas e geração de malhas sobre os retalhos paramétricos constru´ıdos com base nestas curvas, que também são usadas para a conexão de malhas adjacentes. O modelo final é uma representação de todas as malhas combinadas em uma única estrutura de dados. As ferramentas básicas para geração de tais malhas são uma interface para modelagem de curvas espaciais e os algoritmos geom´etricos para construcão de mapeamentos nos domínios elementares. O problema central em modelagens compostas é o tratamento dado às malhas em superfícies que se interceptam. Um algoritmo capaz de modelar com precisão as curvas de interseção e de ajustar as duas malhas para as novas restrições geradas é apresentado neste trabalho. O algoritmo é parte de um programa completo para modelagem interativa de cascas, que tem sido usado no projeto de grandes sistemas flutuantes para explotação de petróleo em águas profundas. O uso de uma variante da estrutura de dados DCEL, que usa árvores de ordenação espacial para armazenar as entidades topol´ogicas ao invés de listas ou vetores, permite que malhas bastante refinadas sejam reconstru´ıdas em tempo compatível com o trabalho interativo. Estas árvores aceleram os cálculos de interseção necessários à determinação dos pontos de interpolação das curvas de trimming, permitindo tamb´em a reconstrução das malhas usando-se apenas consultas locais. / [en] We present a methodology for modeling finite-element meshes defined on parametric surface patches. The idea is to build curves and generate meshes over the parametric patches built with these curves, which also connect adjacent meshes. The final model is a representation of all meshes combined into a single data structure. The basic tools to generate such meshes are the user interface to model space curves and the geometric algorithms to construct the elementary domain mappings. The main problem in composite modeling is how to handle mesh surfaces that intersect each other. We present an algorithm that models the intersection curves precisely and adjusts both meshes to the newly formed borders. The algorithm is part of an interactive shell modeling program, which has been used in the design of large offshore oil structures. We avoid unacceptable interaction delays by using a variant of the DCEL data structure that stores topological entities in spatial indexing trees instead of linked lists. These trees speed up the intersection computations required to determine points of the trimming curves, and also allows mesh reconstruction using only local queries.

Les CPGs (Central Pattern Generators) sont des circuits neuronaux capables de générer de façon autonome des comportements rythmiques essentiels à la vie tels que la respiration ou la locomotion. Chez la larve de Drosophile, le CPG locomoteur est composé de motoneurones (MNs) et d’une grande diversité d’interneurones (INs). Combien d’entre eux sont nécessaires pour former une CPG fonctionnel et comment ils interagissent reste un mystère. Au cours de mon doctorat, j’ai étudié une population neuronale restreinte caractérisée par son expression du facteur de transcription (FT) de la famille des Maf, Traffic Jam (TJ). En utilisant une technique d’intersection génétique et grâce à une lignée TJ-Flp générée au cours de mon doctorat, j’ai démontré pour la première fois que différentes sous-populations de neurones TJ+ ont des fonctions distinctes dans le comportement locomoteur de la larve de Drosophile. Au travers de cette sous-division fonctionnelle, j’ai finalement identifié 3 neurones TJ+ per+ GABAergic par segment qui régulent la vitesse de locomotion des larves. Une caractérisation moléculaire poussée de ces cellules a permis de confirmer qu’elles appartiennent au groupe connu des « midline cells », et plus particulièrement des mnb progeny, dont la fonction était jusqu’à maintenant inconnue. Par ailleurs, le code combinatoire de FTs trouvé chez ces mnb progeny rappelle celui exprimé par les V2b, une population d’interneurones qui régulerait également la vitesse de locomotion chez les vertébrés. Ces similarités entre mnb progeny et V2b laissent à penser que cette population de neurones pourrait être conservée au cours de l’évolution. En outre, des résultats préliminaires suggèrent que les interneurones TJ+ ont également un rôle chez la mouche adulte. / CPGs (Central Pattern Generators) are neural networks able to autonomously generate essential rhythmic behaviours such as walking or breathing. In Drosophila larvae, the locomotor CPG is made up of motoneurons (MNs) and a huge variety of interneurons (INs). How many are actually necessary to constitute a functional CPG and how they interact is not known. During the course of this PhD, I studied a discrete neuronal population singled out by its expression of the Maf transcription factor (TF) Traffic Jam (TJ). Thanks to an intersectional genetics approach and a TJ-Flp line generated during my PhD, I showed for the first time that TJ+ neurons subpopulations have distinct functions in Drosophila larva locomotion. Functional subdivision of TJ+ population eventually led to the identification of 3 TJ+ per+ GABAergic neurons that regulate the speed of locomotion. Thorough molecular characterization of this population permitted to identify them as mnb progeny neurons, a well studied subgroup of midline cells whose function had never been described before. The TF combinatorial code expressed by these cells is highly reminiscent of the one found in V2b INs, a population in vertebrates thought to regulate the speed of locomotion as well in vertebrates; this opens the possibility of a functional conservation across evolution. Preliminary results furthermore suggest that TJ+ INs would have functional roles in the adult fly.

Dans cette thèse nous étudions deux problèmes dans le domaine de la géométrie arithmétique, concernant respectivement les points de torsion des variétés abéliennes et le polylogarithme motivique sur les schémas abéliens. La conjecture de Manin-Mumford (démontrée par Raynaud en 1983) affirme que si A est une variété abélienne et X est une sous-variété de A ne contenant aucune translatée d'une sous-variété abélienne de A, alors X ne contient qu'un nombre fini de points de torsion de A. En 1996, Buium présenta une forme effective de la conjecture dans le cas des courbes. Dans cette thèse, nous montrons que l'argument de Buium peut être utilisé aussi en dimension supérieure pour prouver une version quantitative de la conjecture pour une classe de sous-variétés avec fibré cotangent ample étudiée par Debarre. Nous généralisons aussi à toute dimension un résultat sur la dispersion des relèvements p-divisibles non ramifiés obtenu par Raynaud dans le cas des courbes. En 2014, Kings and Roessler ont montré que la réalisation en cohomologie de Deligne analytique de la part de degré zéro du polylogarithme motivique sur les schémas abéliens peut être reliée aux formes de torsion analytique de Bismut-Koehler du fibré de Poincaré. Dans cette thèse, nous utilisons la théorie de l'intersection arithmétique dans la version de Burgos pour raffiner ce résultat dans le cas où la base du schéma abélien est propre. / In this thesis we approach two independent problems in the field of arithmetic geometry, one regarding the torsion points of abelian varieties and the other the motivic polylogarithm on abelian schemes. The Manin-Mumford conjecture (proved by Raynaud in 1983) states that if A is an abelian variety and X is a subvariety of A not containing any translate of an abelian subvariety of A, then X can only have a finite number of points that are of finite order in A. In 1996, Buium presented an effective form of the conjecture in the case of curves. In this thesis, we show that Buium's argument can be made applicable in higher dimensions to prove a quantitative version of the conjecture for a class of subvarieties with ample cotangent studied by Debarre. Our proof also generalizes to any dimension a result on the sparsity of p-divisible unramified liftings obtained by Raynaud in the case of curves. In 2014, Kings and Roessler showed that the realisation in analytic Deligne cohomology of the degree zero part of the motivic polylogarithm on abelian schemes can be described in terms of the Bismut-Koehler higher analytic torsion form of the Poincaré bundle. In this thesis, using the arithmetic intersection theory in the sense of Burgos, we give a refinement of Kings and Roessler's result in the case in which the base of the abelian scheme is proper.

L’objectif principal de ce travail de thèse était d’étudier les mécanismes perceptivomoteurs qui sous-tendent la réalisation d’une tâche d’approche et de traversée d’intersection en conduite automobile. Dans la première partie de ce manuscrit les enjeux humains, économiques et sociétaux liés à la réussite d’une telle tâche sont évoqués. Les principaux résultats obtenus dans les études ayant porté sur l’identification des risques associés à la réalisation de ce type de manœuvre sont présentés. La plupart des travaux réalisés s’étant focalisés sur les processus de haut niveau (e.g., jugement d’un temps d’arrivée), nous avons souhaité durant cette thèse centrer notre attention sur les processus de bas-niveau mis en œuvre. Ce travail de thèse est adossé à l’approche Ecologique de la Perception et de l’Action qui nous a semblé proposer un cadre théorique pertinent pour étudier cette tâche complexe. La deuxième partie est consacrée aux expériences réalisées au cours de ce travail de thèse. Pour réaliser nos trois expériences, un simulateur de conduite à base fixe a été utilisé. Ce travail a permis (i) d’acquérir une meilleure compréhension du support perceptif impliqué dans la réalisation d’une tâche de traversée d’intersection et (ii) d’identifier différents marqueurs du couplage information-mouvement. Les résultats ont révélé que le support perceptif utilisé pour réaliser une tâche perceptive n’était pas le même que celui utilisé pour réaliser une tâche perceptivo-motrice. Les résultats ont également permis d’étayer la thèse selon laquelle le contrôle de la tâche d’approche et de traversée d’intersection reposerait sur un couplage information-mouvement. / This Ph.D. project aims at studying the perceptual-motor mechanisms implicated in intersection crossing task. The first part of this manuscript explains the human, economic and societal challenges associated with the successfully complete the intersection crossing task. The main results of the former studies that have examined the identification of risks associated with this type of maneuver at an intersection are developed. These former studies mainly focused on high-level processes (e.g., discrete judgment or decision tasks), we have decided to focus our attention on low-level processes (e.g., visual guidance) during this Ph.D. project. For this to happen, the Ecological Approach to Perception and Action seems to be a relevant theoretical framework for studying this complex task. Indeed, it preserves the natural link between information and movement. The second part of this manuscript is devoted to the experiments completed during this research. In order to carry out our three experiments, virtual reality fixed-base driving simulator was used. This work contributes to better understand the perceptual substrate involved in intersection crossing task. Also, this work identifies different markers of control based on information-movement coupling. Firstly, our results revealed that the perceptual substrate underlying judgments of arrival time of a vehicle moving towards an intersection is distinct from the perceptual substrate underlying the active control of one’s own approach to the same intersection. Secondly, the results have also strengthened the assumption that the control of approach and intersection crossing task is based on information-movement coupling.

O problema do isomorfismo de grafos possui aplicações em diversas áreas da ciência. Tal problema não possui uma solução eficiente para o seu caso geral. No presente trabalho, apresentamos os conceitos básicos em teoria de grupos, teoria dos grafos e mecânica quântica. Apresentamos o problema do subgrupo oculto e uma conhecida redução polinomial do problema do isomorfismo de grafos no seu caso geral para o problema do subgrupo oculto sobre o grupo simétrico. Utilizamos um método que reduz o problema do isomorfismo de grafos para o problema de interseção de grupos. Este método utiliza resultados da computação quântica e da teoria dos grupos solúveis, nos permitindo obter uma solução eficiente através de um algoritmo quântico para o problema do isomorfismo de grafos para uma classe particular de grafos. / The graph isomorphism problem has applications in several areas of science. This problem has not an efficient solution to its general case. In this work, we present the basic concepts of group theory, graph theory and quantum mechanics. We introduce the hidden subgroup problem and a known polynomial reduction of the graph isomorphism problem in its general case to the hidden subgroup problem on the symmetric group. We use a method that reduces the graph isomorphism problem to the group intersection problem. This method combines results from quantum computing and solvable group theory providing a efficient solution through a quantum algorithm to the graph isomorphism problem for the particular class of graphs.

The Road Administration wants to improve safety at a hazardous, rural road intersection near Åkersberga, Stockholm by changing the design of the intersection. The intersection today is a three-way connection with a small road connecting to a four-lane main road, much similar to a motorway with high speeds although with a speed limit of 90km/h. Drivers’ attention and velocity in different designs of the intersection are analysed in this thesis with data from two experiments, ordered by the Road Administration and conducted by the Swedish National Road and Research Institute (VTI). Four alternative designs of the intersection were tested using the VTI-simulator; a narrowing from two to one lane through the intersection, rumble strips, a wooden fence and trees at the road side, and a portal framing the intersection. In addition, the original intersection design, both with and without speed limit signs of 70km/h, were tested for comparisons. In the first of the two experiments, the four alternative intersection designs all had speed limit signs of 70km/h, and in the second experiment the alternative intersection designs were tested without the influence of the speed limit signs of 70km/h. Data used in the analyses are velocity data, lateral position, eye movements, brake data and subjective estimations. Subjects were found to look at the critical areas of the intersection in time, independent of intersection design. Only small differences between the intersection designs were found, probably due to width of the main road being a larger design-influence than the measures tested. The results are in favour of the narrowing from two to one lane through the intersection, but traffic density and rhythm make a narrowing difficult to realise at the real intersection. Instead, rumble strips in addition to a speed limit of 70km/h can be recommended, although rumble strips are most likely to increase inattentive drivers’ readiness.

James W. Alexander, no artigo[1],mostra que se tivermos um mergulho PL f : \'S POT. 1\' × \'S POT. 1\' \'S POT. 3\', então o fecho de uma das componentes conexas de \'S POT. 3\' f(\'S POT. 1\' × \'S POT. 1\') é homeomorfo a um toro sólido, isto é, homeomorfo a \'S POT. 1\' × \'D POT. 2\'. Este teorema ficou conhecido por Teorema do toro de Alexander. Nesta dissertação, estamos detalhando a demonstração deste teorema feita em[25] que é diferente da demonstração apresentada em [1]. Mais geralmente, para um mergulho diferenciável f : \'S POT. p\' × \'S POT. q\' \'S POT. p + q+1\' , demonstra-se que o fecho de uma das componentes conexasde \'S POT. p +q + 1\' f(\'S POT. p\' × \'S POT. q\') é difeomorfo a \'S POT. p\' × \'D POT. q + 1\' se p q 1 e p + q \'DIFERENTE DE\' 3 ou se p = 2 e q = 1 um dos fechos será homeomorfo a \'S POT. 2\' × \'D POT. 2\' , nesta dissertação estaremos também detalhando estas demonstrações feita em [20] / James W. Alexander shows in[1] that the closure of one of the two connected components of \'S POT. 3\'f( \'S POT. 1 × \'S POT. 1\') is homeomorphic to a solid torus \'S POT. 1\' × \'D POT. 2\' , where f : \'S POT. 1\' ×\' SPOT. 1\' \'S POT. 3\' is a PL embedding. This result became known as Alexanders torus theorem. In this dissertation we are detailing the proof of this theorem made in[25] which is different from the demonstration presented in[1]. More generally, when considering a smooth embeding f : \'S POT. p\' × \'S POT. q\' \' SPOT. p+q+1\' , it is demonstrated that the closure of one of the two connected components \'S POT. p+q+1\' f (\'S POT. p\' × \'S POT. q\' ) is diffeomorphic to \'S POT. p\' × \'D POT. q+1\' if p q 1 and p+q \'DIFFERENT OF\' 3 or if p = 2 and q = 1 one of the closures will be homeomorphic to \'S POT. 2\' × \'D POT. 2\'. In this work we are also detailing the proves made in[20]