Search results for "Topologie"
showing 10 items of 21 documents
Locally tame plane polynomial automorphisms
2010
Abstract For automorphisms of a polynomial ring in two variables over a domain R , we show that local tameness implies global tameness provided that every 2-generated locally free R -module of rank 1 is free. We give examples illustrating this property.
Farsi comune. Topographien prekärer Theaterorte im Europa der Gegenwart
2021
Equivalence relations among homology 3-spheres and the Johnson filtration
2021
The Torelli group of a surface consists of isotopy classes of homeomorphisms of this surface acting trivially at the homological level. The structure of the Torelli group can be approached by the study and the comparison of two filtrations of this group: its lower central series, and the "Johnson" filtration, given by the kernels of the natural actions on the successive nilpotent quotients of the fundamental group of the surface. It is now known that there are, via the notion of "Heegaard splittings", rich interactions between this 2-dimensional study and the study of some 3-manifolds topological invariants: we refer here precisely to the so-called "finite-type" invariants. In this PhD, we …
Approche adaptative de simplification géométrique temps réel de modèles 3D distribués pour la visualisation et l'interaction à distance
2010
National audience; Deux moyens permettent aujourd'hui d'accéder visuellement à des données 3D volumineuses à distance : le premier consiste à transférer les données entre le serveur et le poste client/utilisateur, le second consiste à générer et à transférer des " photographies" de ces données 3D qui restent alors localisées sur le serveur. Le goulot d'étranglement principal dans les deux cas est la bande passante du réseau qui ne permet pas de transférer des volumes de données importants. Bien plus, la visualisation de plusieurs centaines de giga-octets d'informations nécessite de grandes capacités de stockage (disque dur ou mémoire) et des équipements de visualisation très performants (ca…
Topologies réseau pour la réduction des coûts et l'amélioration de la qualité du service dans les centres de données massives
2017
Data centers (DC) are being built around the world to provide various cloud computing services. One of the fundamental challenges of existing DC is to design a network that interconnects massive number of nodes (servers)1 while reducing DC' cost and energy consumption. Several solutions have been proposed (e.g. FatTree, DCell and BCube), but they either scale too fast (i.e., double exponentially) or too slow. Effcient DC topologies should incorporate high scalability, low latency, low Average Path Length (APL), high Aggregated Bottleneck Throughput (ABT) and low cost and energy consumption. Therefore, in this dissertation, different solutions have been proposed to overcome these problems. F…
Topology of beginning : Heidegger’s interpretation of Anaximander
2022
In this thesis, the main work is to initiate a series of discussions based on Heidegger’s interpretation of Anaximander. Our work is articulated around two main axes: first, we situate his interpretation of Anaximander in the progression of Heideggerian thought, and by comparing his interpretations of Anaximander at three different periods, we attempt to clarify the thread of Heidegger’s interpretation of Anaximander. In this axis devoted to his specific and detailed interpretation of Anaximander, we try to place the interpretation of Anaximander in the theoretical framework of the “topology of presence” in order to examine the evolution and development of Heidegger’s thought. Secondly, we …
A. Bavelas, 1950, Communication Patterns in Task-Oriented Groups. Version bilingue et commentée
2021
Ce document du groupe fmr présente une version bilingue et commentée de l'article d'Alex Bavelas, Communication Patterns in Task-Oriented Groups, paru en 1950 dans la revue Journal of the Acoustical Society of America. S'appuyant sur les seuls travaux de Kurt Lewin et de ses élèves, et donc ne mobilisant ni la sociométrie ni la théorie des graphes au sens strict, l'auteur propose un ensemble de mesures permettant de mesurer l'efficacité de la communication au sein d'une structure donnée. Cet article a eu une influence importante dans différents champs de recherche (analyse de réseaux sociaux, management, psychologie, etc.).
Breedbot: An Edutainment Robotics System to Link Digital and Real World
2007
The paper describes Breedbot an edutainment software and hardware system that could be used to evolve autonomous agents in digital (software) world and to transfer the evolved minds in physical agents (robots). The system is based on a wide variety of Artificial Life techniques (Artificial Neural Networks, Genetic Algorithms, User Guided Evolutionary Design and Evolutionary Robotics). An user without any computer programming skill can determine the robot behaviour. Breedbot was used as a didactic tool in teaching Evolutionary Biology and as a futuristic toy by several Science Centers. The digital side of Breedbot is downloadable from www.isl.unina.it/breedbot.
Data from: Empirical and theoretical study of Atelostomate (Echinoidea, Echinodermata) plate architecture: using graph analysis to reveal structural …
2015
Describing patterns of connectivity among organs is essential for identifying anatomical homologies among taxa. It is also critical for revealing morphogenetic processes and the associated constraints that control the morphological diversification of clades. This is particularly relevant for studies of organisms with skeletons made of discrete elements such as arthropods, vertebrates, and echinoderms. Nonetheless, relatively few studies devoted to morphological disparity have considered connectivity patterns as a level of morphological organization or developed comparative frameworks with proper tools. Here, we analyze connectivity patterns among apical plates in Atelostomata, the most dive…
The Abelian Kernel of an Inverse Semigroup
2020
The problem of computing the abelian kernel of a finite semigroup was first solved by Delgado describing an algorithm that decides whether a given element of a finite semigroup S belongs to the abelian kernel. Steinberg extended the result for any variety of abelian groups with decidable membership. In this paper, we used a completely different approach to complete these results by giving an exact description of the abelian kernel of an inverse semigroup. An abelian group that gives this abelian kernel was also constructed.