Dissertations / Theses on the topic 'Théorie topologique des graphes'
Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles
Consult the top 50 dissertations / theses for your research on the topic 'Théorie topologique des graphes.'
Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.
You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.
Browse dissertations / theses on a wide variety of disciplines and organise your bibliography correctly.
Delanoue, Nicolas. "Algorithmes numériques pour l'analyse topologique : Analyse par intervalles et théorie des graphes." Phd thesis, Université d'Angers, 2006. http://tel.archives-ouvertes.fr/tel-00340999.
Full textDe nombreux problèmes, comme l'étude de l'espace des configurations d'un robot, se ramènent à une étude qualitative d'ensembles. Ici, la ``taille'' de l'ensemble importe peu, ce qui compte, c'est sa ``topologie''. Les méthodes proposées calculent des invariants topologiques d'ensembles. Les ensembles considérés sont décrits à l'aide d'inégalités $\mathcal{C}^{\infty}$. L'idée maîtresse est de décomposer un ensemble donné en parties contractiles et d'utiliser l'homologie de \v Cech.
La seconde partie de la thèse concerne l'étude de point
asymptotiquement stables des systèmes dynamiques (linéaires ou non). Plus largement, on propose une méthode pour approcher le bassin d'attraction d'un point asymptotiquement stable. Dans un premier temps, on utilise la théorie de Lyapunov et le calcul par intervalle
pour trouver effectivement un voisinage inclus dans le bassin d'attraction d'un point prouvé asymptotiquement stable. Puis, on combine, une fois de plus, la théorie des graphes et les méthodes d'intégration d'équations différentielles ordinaires pour améliorer ce voisinage et ainsi construire un ensemble inclus dans le bassin
d'attraction de ce point.
Bellet, Thomas. "Transformations de graphes pour la modélisation géométrique à base topologique." Thesis, Poitiers, 2012. http://www.theses.fr/2012POIT2261/document.
Full textGeometric modeling is now involved in many fields such as: video games, architecture, engineering and archaeology. The represented objects are very different from one field to another, and so are their modeling operations. Furthermore, many specific types of modeling software are designed for high programing costs, but with a relatively low rate of effectiveness.The following is an alternative approach:– we have conceived a dedicated language for geometric modeling that will allow us to define any operation of any field; objects in this language are defined with the topological model of generalized maps, this definition has been extended to the embedding informations; here the operations are defined as graph transformation rules which originate from the category theory;– we have ensured operation definitions with consistency conditions; these operations that satisfy those conditions do not generate anomalies; – we have designed generic modeling software to serve as an interpreter of this language; the operation definitions are directly applied without the need for more programing; the software also automatically checks the language conditions and warns the user if he designs a non-consistent operation.The provided language and software prove to be efficient, and all for a low programing cost. Designing a new operation takes only minutes thanks to the language conditions, as opposed to hours of programming and debugging with the past approach
Colin, Fabrice. "Applications de la topologie algébrique en théorie des graphes." Thesis, National Library of Canada = Bibliothèque nationale du Canada, 1996. http://www.collectionscanada.ca/obj/s4/f2/dsk3/ftp04/mq21733.pdf.
Full textDussaux, Valere. "Spécifications partielles de dessin de graphe : Étude logique et combinatoire." Bordeaux 1, 2002. http://www.theses.fr/2002BOR12527.
Full textSoto, Gomez Mauricio Abel. "Quelques propriétés topologiques des graphes et applications à internet et aux réseaux." Paris 7, 2011. http://www.theses.fr/2011PA077228.
Full textThis thesis focuses on topological properties of graphs and their application on communication networks, specifically on graphs reflecting Internet structure. We first look how far from a tree a graph may be by the study of two parameters: hyperbolicity and treewidth. For hyperbolicity, we analyse the relation with others graph parameters, we also show that some graph decompositions allow its efficient computation. We compute both parameters o Internet snapshots at different levels of granularity and time periods. We propose some structural and algorithmic consequences of obtained values. Then, we study the graph clustering problem from the perspective of modularity, which measures a clustering quality and is largely studied in the literature. We analyse modularity from a theoretical point of view and [describe] its asymptotic behaviour for some graph families. Finally, we deal with adversarial queueing theory, a combinatorial framework derived from classic queueing theory where injection process is und the control of an adversary. We propose a new model generalisation by considering request of distinct types
Beaudou, Laurent. "Autour de problèmes de plongements de graphes." Phd thesis, Université Joseph Fourier (Grenoble), 2009. http://tel.archives-ouvertes.fr/tel-00401226.
Full textBenchettara, Nasserine. "Prévision de nouveaux liens dans les réseaux d'interactions bipartis : Application au calcul de recommandation." Paris 13, 2011. http://scbd-sto.univ-paris13.fr/secure/edgalilee_th_2011_benchettara.pdf.
Full textIn this work, we handle the problem of new link prediction in dynamic complex networks. We mainly focus on studying networks having a bipartite underlaying structure. We propose to apply a propositionnalization approach where each couple of nodes in the network is described by a set of topological measures. One first contribution in this thesis is to consider measures computed in the bipartite graph and also in the associated projected graphs. A supervised machine learning approach is applied. This approach though it gives some good results, suffers from the obvious problem of class skewness. We hence focus on handling this problem. Informed sub-sampling approaches are first proposed. A semi-supervised machine learning approach is also applied. All proposed approaches are applied and evaluated on real datasets used in real application of academic collaboration recommendation and product recommendation in an e-commerce site
Vlitas, Dimitrios. "Contribution à la théorie de Ramsey en dimension infinie." Paris 7, 2012. http://www.theses.fr/2012PA077240.
Full textIn a recent paper S. Solecki proves a finite self dual Ramsey theorem that in a natural way gives simultaneously the classical finite Ramsey theorem and the Graham-Rothschild theorem. In the first chapter of this thesis we prove the corresponding infinite dimensional self dual theorem, giving similarly as a consequence the infinite classical Ramsey theorem and the Carlson-Simpson theorem. This is done by a different approach than that of Solecki. In the second chapter of the present thesis we extend a result of K. Milliken. Given a fixed tree U that has some finite uniform branching but is of infinite length, a notion of uniform family of finite strong subtrees is introduced. Then we prove a Ramsey classification result for equivalence relations defined on these uniform families. In the third and final chapter of the thesis, we complete the attempt of H. Lefmann to show that Borel equivalence relations on the n-element subsets of 2A{\omega}, that respect an order type, have a finite Ramsey basis
Bonis, Thomas. "Algorithmes d'apprentissage statistique pour l'analyse géométrique et topologique de données." Thesis, Université Paris-Saclay (ComUE), 2016. http://www.theses.fr/2016SACLS459/document.
Full textIn this thesis, we study data analysis algorithms using random walks on neighborhood graphs, or random geometric graphs. It is known random walks on such graphs approximate continuous objects called diffusion processes. In the first part of this thesis, we use this approximation result to propose a new soft clustering algorithm based on the mode seeking framework. For our algorithm, we want to define clusters using the properties of a diffusion process. Since we do not have access to this continuous process, our algorithm uses a random walk on a random geometric graph instead. After proving the consistency of our algorithm, we evaluate its efficiency on both real and synthetic data. We then deal tackle the issue of the convergence of invariant measures of random walks on random geometric graphs. As these random walks converge to a diffusion process, we can expect their invariant measures to converge to the invariant measure of this diffusion process. Using an approach based on Stein's method, we manage to obtain quantitfy this convergence. Moreover, the method we use is more general and can be used to obtain other results such as convergence rates for the Central Limit Theorem. In the last part of this thesis, we use the concept of persistent homology, a concept of algebraic topology, to improve the pooling step of the bag-of-words approach for 3D shapes
Abouelaoualim, Abdelfattah. "EXPLORATION DES GRAPHES ARETES-COLOREES : TOPOLOGIE, ALGORITHMES, COMPLEXITE ET (NON)-APPROXIMABILITE." Phd thesis, Université Paris Sud - Paris XI, 2007. http://tel.archives-ouvertes.fr/tel-00281533.
Full textAngelier, Pierre. "Algorithmique des graphes de visibilité." Paris 7, 2002. http://www.theses.fr/2002PA077007.
Full textSandouk, Mohamed Zouheir. "Méthodes et algorithmes pour l'infographie : exploitation des propriétés topologiques et géométriques de la scène." Toulouse 3, 1990. http://www.theses.fr/1990TOU30156.
Full textPoudret, Mathieu. "Transformations de graphes pour les opérations topologiques en modélisation géométrique - Application à l'étude de la dynamique de l'appareil de Golgi." Phd thesis, Université d'Evry-Val d'Essonne, 2009. http://tel.archives-ouvertes.fr/tel-00503818.
Full textAbouelaoualim, Abdelfattah. "Exploration des graphes arêtes-colorées : topologie, algorithmes, complexité et (non)-approximabilité." Paris 11, 2007. https://tel.archives-ouvertes.fr/tel-00281533.
Full textThe graphs which edges are colored with c>1 colors, with c is a given integer, in other words c-edge-colored graphs, have a growing number of fields of applications particularly in molecular biology and VLSI. Their theoretical motivation is obvious sine they are a generalization of digraphs. In the present work, we explore these graphs to extract and study structures (i. E. Subgraphs) called properly-edge-colored which every pair of adjacent edges differ in color. We start this work by a part introducing the most notable results in the literature and cover the majority of questions treated in this topic since the sixties. In the second part, first we give characterizations of certain properly-edge-colored structures such as paths and cycles. After that, we were interested by the construction of polynomial algorithms, the study of complexity and approximability aspect of a variety of structures
Wagner, Emmanuel. "On Khovanov-Rozansky homology of graphs and links." Université Louis Pasteur (Strasbourg) (1971-2008), 2007. https://publication-theses.unistra.fr/restreint/theses_doctorat/2007/WAGNER_Emmanuel_2007.pdf.
Full textThis thesis is devoted to the categorification of polynomial invariants of graphs and links. For any positive integer n, Khovanov and Rozansky introduced in 2004 a bigraded link homology, and an homology of planar graphs. Given n, their link homology categorifies the n-th specialization of the HOMFLY-PT polynomial and their homology of planar graphs categorifies an associated graph polynomial. In this thesis, we study these homology and generalize their constructions by introducing an additional grading. First, we generalize a formula of Jaeger for link polynomials to polynomials of planar graphs and associated homology of planar graphs; we extend also the link homology of Khovanov and Rozansky to embedded graphs. Then we construct a triply graded link homology. This homology recovers the bigraded link homology of Khovanov and Rozansky. Finally, we give examples, applications and generalizations of the triply graded link homology. We develop homological tools that permit to compute explicitly the triply graded link homology for some knots and we consider deformations of the triply graded link homology
Oujamaa, Lydia. "Evolution topologique des hubs dans l'état de conscience altérée post-traumatique : un marqueur de récupération fonctionnelle." Thesis, Université Grenoble Alpes, 2020. http://www.theses.fr/2020GRALS013.
Full textThis work takes part in the field of translational research. Our aim was to explore thepost-lesional brain plasticity necessary to recover consciousness after a traumatic coma.The study of resting state functional connectivity, meaning the temporal correlation ofBOLD signal (blood oxygenation level dependent) between remote cerebral areas, wasapplied to severe traumatic brain injured (sTBI) patients.Using graph method, we explored the diagnosis and prognosis value of resting statefunctional connectivity during recovery of consciousness after a traumatic coma.Thirty six sTBI patients were studied in a cross sectional and a longitudinal design.We recorded a resting state functional MRI sequence while sTBI patients were eitherconscious or in altered state of consciousness when discharged from intensive care unit(ICU). A second fMRI was recorded after one month spent in a post-ICU rehabilitationunit.Our analysis focused on a hub disruption index (HDI) which expresses the reallocationof functional connections inside the graph. In the brain network, the hubs, which are definedas highly connected to the brain network in healthy subjects, have been characterizedwith integration, segregation and centrality metrics for information transfer.Our results suggest that the topological disruption of functional hubs is an objectivemapping of the brain network changes that correlates with post-TBI neurological recovery.Indeed, in our group analysis, the hub disruption index of the post TBI brainnetwork was sensitive to the state of consciousness and to its recovery during a onemonth follow-up. This index was also relevant to predict the level of disability 6 monthsafter injury.The computation of connectivity data in a metadata, the hub disruption index ofthe brain network, enhances the classical approach describing the post-traumatic brainplasticity as a loss and recovery of connectivity in one or several cortical networks. Therecovery of the brain network ability to compute local information in the functionalhubs could be necessary to recover consciousness after a traumatic coma. This resultis original as the recent litterature, based on the information integration theory andthe global workspace theory of consciousness, is considering severe TBI as a long rangeconnectivity disruption inducing a functional integration impairment.This pilot study was necessary prior to the assessment of the HDI on a single-subjectlevel and to quantifie the response of brain injured patients with disorder of consciousnessto several therapeutic options (psychostimulant drugs, electrical stimulation..)
Giorgetti, Alain. "Combinatoire bijective et énumérative des cartes pointées sur une surface." Phd thesis, Université de Marne la Vallée, 1998. http://tel.archives-ouvertes.fr/tel-00724977.
Full textEhounou, Joseph. "Algorithmes de graphes pour la découverte de la topologie d'un réseau énergétique par la connaissance de ses flots." Thesis, Université Paris-Saclay (ComUE), 2018. http://www.theses.fr/2018SACLV056/document.
Full textIn energy network, the knowledge of equipments, their locations and their functions are theimportant information for the distributor service operator. In fact, each operator has a networkplan often named synoptic schema. That schema shows the interconnexion between equipments inthe network. From this schema, some management decisions have taken for ensuring an optimalperformance of a network.Sometimes, a synoptic schema has some mistakes because the maintenance operations, such aschanged the connexion between equipments or replaced equipments, have not been updated orhave been written with errors. And these mistakes increase exploitation cost in the energy network.We consider an electric network of a datacenter. This network consists of physical topologymodelised by a DAG without circuit and measurements are on the edges of a DAG. The mainpoint of the network is that measurements are some mistakes and the topology is unknown i.ewe know edges but the nodes of edges are unknown. When measurements are correct then thecorrelations between pairwise edges provide the adjacency matrix of the linegraph of undirectedgraph of the DAG. A linegraph is a graph in which each node and the neighbor are partitionnedby one or deux cliques. However, with the mistakes in measurements, the obtained graph is nota linegraph because it contains more or less edges. If the obtained graph is a linegraph then it isa linegraph of the other DAG. Our problem is to discovery the topology of the DAG with somemistakes in measurements.We start by the state of art in the measurement correlations in order to choose the good methodfor our problem. Then, we propose two algorithms to resolve our problem. The first algorithmis the cover algorithm and it returns the set of cliques in the graph. The second algorithm is acorrection algorithm which adds or deletes edges in the graph for getting a nearest linegraph ofthe DAG. In the last, we evaluate the performances of the algorithms by checking the number ofedges corrected and the ability to return a nearest linegraph of the DAG
Tabourier, Lionel. "Méthode de comparaison des topologies de graphes complexes : applications aux réseaux sociaux." Paris 6, 2010. http://www.theses.fr/2010PA066335.
Full textGoddet, Étienne. "Analyse spectrale et surveillance des réseaux maillés de retour de courant pour l'aéronautique." Thesis, Université Grenoble Alpes (ComUE), 2017. http://www.theses.fr/2017GREAT099/document.
Full textThe principles of the electrical system design in future aircrafts have to be reconsidered due to the emergence of new composite materials. The use of these materials for the aircraft structure has indeed implied a complete revision of on-board current return path networks. To facilitate this revision, it is proposed to link through the spectral graph analysis the performances of electrical networks with their topology. The aim of this thesis is to give topological drivers that could help the aeronautical engineers during the design process and then to propose a monitoring methodology
Gauthier, Valentin. "Développement d'un langage de programmation dédié à la modélisation géométrique à base topologique, application à la reconstruction de modèles géologiques 3D." Thesis, Poitiers, 2019. http://www.theses.fr/2019POIT2252/document.
Full textGeometric modeling is used in various scopes for 3D object construction, animation or simulations. Each domain must cope with its constraints and should have its dedicated tool. In fact, several common characteristics of different domains are factored in a single tool. These modelers contain sets of basic operations that the user composes to build his objects. For more specific operations, current common tools offer API.Jerboa’s platform allows to generate personalized geometrical operations. These are defined by graph transformation rules. During their design, many automated verifications are done for the preserving of object consistency. They also be enriched with additional properties. Our contribution consists in extending the Jerboa language with scripts to compose rules and define complex operations. We also extended automated verifications, in particular to ensure geometric consistaency. Finally, we modified operations application process, in order to increase user control possibilities.To validate this approach, we have implemented a geological dedicated modeler for subsoil modeling, in collaboration with Geosiris Company. We defined a workflow with Geosiris that follows specific geological reconstruction constraints. Thanks to the Jerboa rapid prototyping mecanism, we developped and quickly tested several subsoil reconstruction algorithms, and apply them to real data provided by the company
Wagner, Emmanuel. "Sur l'homologie de Khovanov-Rozansky des graphes et des entrelacs." Phd thesis, Université Louis Pasteur - Strasbourg I, 2007. http://tel.archives-ouvertes.fr/tel-00192447.
Full textDans cette thèse, on étudie ces homologies et on généralise leur construction en introduisant une graduation supplémentaire. Tout d'abord, on généralise une formule de Jaeger pour les polynômes d'entrelacs aux polynômes de graphes planaires, ainsi qu'à l'homologie de graphes planaires; on étend ensuite l'homologie d'entrelacs de Khovanov-Rozansky aux graphes plongés. Puis on construit une homologie trigraduée d'entrelacs. Cette homologie recouvre l'homologie bigraduée d'entrelacs de Khovanov et Rozansky. Enfin, on donne des exemples, des applications et des généralisations de l'homologie trigraduée d'entrelacs. On développe des outils d'algèbre homologique qui permettent de calculer explicitement l'homologie trigraduée d'entrelacs pour des exemples et on considère des déformations de l'homologie trigraduée d'entrelacs.
de, Felipe Paramio Ana Belén. "Topologie des espaces de valuations et géométrie des singularités." Sorbonne Paris Cité, 2015. http://www.theses.fr/2015USPCC136.
Full textWe study the fiber of the Riemann-Zariski space above a closed point x of an algebraic variety X defined over an algebraically closed field. We characterize its homeomorphism type for regular points and normal surface singularities. This is done by studying the relation between this space and the normalized non-Archimedean link of x in X. We prove that their behavior is the same
Memari, Pooran. "Geometric tomography with topological guarantees." Nice, 2010. http://www.theses.fr/2010NICE4053.
Full textThe purpose of this doctoral thesis is to provide a method to reconstruct three dimensional shapes from cross-sections. The principal motivation is 3D reconstruction of organs that is widely considered to be an important diagnostic aid in the medical world. However, the actual simulation results, namely in 3D ultrasonic simulation, are not reliable to be used in diagnosis. This thesis is the first geometric analysis of the reliability and the validity of reconstruction methods from cross-sectional data. Even in the case of parallel sections, no formal analysis and guarantees had been obtained before this thesis. More formally, we consider the problem of reconstructing a compact 3-manifold (with boundary) embedded in R3 from its cross-sections with a given set of cutting planes having arbitrary orientations. The first Chapter of this manuscript is devoted to analyzing a method presented by Liu et al. In 2008. We prove that under appropriate sampling conditions, the resulting reconstructed object is homeomorphic (and isotopic) to the original object. In the second chapter, we present a second reconstruction method that makes use of the Voronoi diagram of the sections. This method performs more connections between the sections comparing to the first method. Increasing the connectivity between the sections is motivated by reconstructing tree-like structures from sparse sectional data. The provided sampling conditions, leading to topological guarantees, are adapted to tree-like structures: Indeed, we show that if the cutting planes are sufficiently transversal to the surface we want to reconstruct, then the method can handle complex branching structures. Finally, in the third chapter, we show how the Voronoi-Delaunay duality allows us to perform still more connections between the sections comparing to the two first methods. The preliminary experimental results are quite promising, e. G. , regarding the practicality of the approach to reconstruct complex cross-sectional branching situations such as the coronary arterial tree. The hope is that the theoretical studies provided in this thesis will be a first step to provide solid foundations and theoretical guarantees for medical diagnostic software
Sadi, Ahcène. "Processus de certification de documents utilisant un authentifiant chaotique mesurable comme le Code à BullesTM par analyse d’images." Caen, 2013. http://www.theses.fr/2013CAEN2090.
Full textThis thesis focuses on the documents certification using the Bubble TagTM. The modalities presented by the Bubble TagTM are similar to those of biometrics. Based on that similarity, we present a new architecture of documents system authentication. In the first part, we were interested in the digital images preprocessing, which is a very delicate phase in the authentication systems. Mathematical morphology provides a wide range of operators to understand various problems of image processing. Morphological processes operators can be defined in terms of algebraic (discrete) sets or as partial differential equations (PDEs). In this context, we decided to work on a new approach using mathematical morphology based on partial differences equations (PdEs) on weighted graphs. This methodology allows us to generalize these two approaches to a non-local image processing. We have proposed a new class of shock filter based on PdEs. We demonstrated their effectiveness in industrial images, and we proposed a new approach to segment this kind of image using the shocks filters. In the second part, we were interested in authentication and identification algorithms for Bubble TagTM. We presented an overview of techniques for indexing data used in the multimedia database. We have presented an approach that exploits the M-TREE trees to generate an indexing for a Bubble TagTM identification system
Barbot, Thierry. "Géométrie transverse des flots d'Anosov." Lyon 1, 1992. http://www.theses.fr/1992LYO10274.
Full textFiorio, Christophe. "Approche interpixel en analyse d'images, une topologie et des algorithmes de segmentation." Montpellier 2, 1995. http://www.theses.fr/1995MON20179.
Full textBen, Salah Fatma. "Modélisation et simulation à base de règles pour la simulation physique." Thesis, Poitiers, 2018. http://www.theses.fr/2018POIT2293.
Full textThe physical simulation of deformable objects is at the core of several computer graphics applications. In this context, we are interested in the creation of a framework, that combines a topological model, namely Generalized Maps, with one or several mechanical models, for the physical animation of deformable meshed objects that can undergo topological modifications such as tearing or fractures.To obtain a general framework, we chose to rely on graph manipulation and transformation rules, proposed by the JERBOA software. This environment provided us with fast prototyping facilities for different mechanical models. It allowed us to precisely define how to store mechanical properties in the topological description of a mesh and simulate its deformation in a topologically-based manner for interaction computation and force distribution. All mechanical properties are stored in the topological model without any external structure.This framework is general. It allows for the simulation of 2D or 3D objects, with different types of meshes, including non homogeneous ones. It also allowed for the simulation of several, continuous or discrete, mechanical models with various properties of homogeneity and isotropy. Furthermore, different methods to simulate topological modifications have been implemented in the framework. They include both the selection of a criterion to trigger topological modifications and a transformation type. Our approach also managed to reduce the number of updates of the mechanical model after tearing / fracture
Sidère, Nicolas. "Contribution aux méthodes de reconnaissance structurelle de formes : approche à base de projections de graphes." Thesis, Tours, 2012. http://www.theses.fr/2012TOUR4009/document.
Full textThe work exposed in this thesis focuses on a contribution to techniques of graph embedding, applied to pattern recognition, aiming to take advantages of the richness of structural methods and the efficiency of statistical tools. We present a new embedding, joining the category of graph probing. The first contribution of this thesis deals with the embedding of the graph topology in a vectorial representation, based on the counting of patterns (subgraphs) stemming of a lexicon generated independently of the context. These patterns permit the minimization of losses of the topological information during the embedding. The second contribution focuses on the integration of the information related to labels inside our embedding by adding their counting. To deal with problems linked to the nature and the variability of the attributes, we suggest two solutions to reduce the number of label classes. The first one consists of discretizing numeral attributes and combining them The second one aims to build these classes by a global clustering on the set of labels. Then, these proposals are evaluated on different datasets of graphs and in different contexts
Delhommé, Christian. "Propriétés de projection." Lyon 1, 1995. http://www.theses.fr/1995LYO10159.
Full textYang, Huanqing. "Automatisation de l'analyse mécanique des mécanismes." Lyon, INSA, 1989. http://www.theses.fr/1989ISAL0016.
Full textBera, Roderic. "L'Adjacence relative. Une Etude contextuelle de l'influence de l'environnement spatial dans l'appréhension de la notion de proximité." Rennes 1, 2004. https://hal.archives-ouvertes.fr/tel-01276691.
Full textRazafindramanana, Octavio. "Low-dimensional data analysis and clustering by means of Delaunay triangulation." Thesis, Tours, 2014. http://www.theses.fr/2014TOUR4033/document.
Full textThis thesis aims at proposing and discussing several solutions to the problem of low-dimensional point cloudanalysis and clustering. These solutions are based on the analysis of the Delaunay triangulation.Two types of approaches are presented and discussed. The first one follows a classical three steps approach:1) the construction of a proximity graph that embeds topological information, 2) the construction of statisticalinformation out of this graph and 3) the removal of pointless elements regarding this information. The impactof different simplicial complex-based measures, i.e. not only based on a graph, is discussed. Evaluation is madeas regards point cloud clustering quality along with handwritten character recognition rates. The second type ofapproaches consists of one-step approaches that derive clustering along with the construction of the triangulation
Daniel, Frédéric. "Sur les communications globales dans les réseaux à topologie de de Bruijn et de Kautz." Toulouse 3, 1996. http://www.theses.fr/1996TOU30248.
Full textMesmay, Arnaud de. "Topics in low-dimensional computational topology." Paris, École normale supérieure, 2014. https://theses.hal.science/tel-04462650v1.
Full textTopology is the area of mathematics investigating the qualitative properties of shapes and spaces. Although it has been a classical field of study for more than a century, it only appeared recently that being able to compute the topological features of various spaces might be of great value for many applications. This idea forms the core of the blossoming field of computational topology, to which this work belongs. The three contributions of this thesis deal with the development and the study of topological algorithms to compute deformations and decompositions of low-dimensional objects, such as graphs, surfaces or 3-manifolds. The first question we tackle concerns deformations: how can one test whether two graphs embedded on the same surface are isotopic, i. E. , whether one can be deformed continuously into the other? This kind of problems is relevant to practical problems arising with morphings or geographic information systems, for example. Relying on hyperbolic geometry and ideas from the theory of mapping class groups, we first establish a combinatorial criterion to characterize isotopy, reproving and strengthening a result of Ladegaillerie (1984). Combined with earlier algorithms on the homotopy of curves, this allows us in turn to provide efficient algorithms to solve this graph isotopy problem. We then shift our focus to decompositions, by investigating how to cut surfaces along curves or graphs with prescribed topological properties, which is an important routine in graph algorithms or computer graphics, amongst others domains. By establishing a strong connection with the continuous setting, as well as studying a discrete model for random surfaces, we improve the best known bounds for several instances of this problem. In particular, this proves a conjecture of Przytycka and Przytycki from 1993, and one of our new bounds readily translates into an algorithm to compute short pants decompositions. Finally, we move up one dimension, where the best known algorithms for many topological problems, like for example unknot recognition, are exponential. Most of these algorithms rely on normal surfaces, a ubiquitous tool to study the surfaces embedded in a 3-manifold. We investigate a relaxation of this notion called immersed normal surfaces, whose more convenient algebraic structure makes them good candidates to solve topological problems in polynomial time. We show that when working with immersed normal surfaces, a natural problem on the detection of singularities arises, and we prove it to be NP-hard – this is noteworthy as hardness results are very scarce in 3-dimensional topology. Our reduction works by establishing a connection with a restricted class of constraint satisfaction problems which has been partially classified by Feder
Cardot, Anaïs. "Rejeu basé sur des règles de transformation de graphes." Thesis, Poitiers, 2019. http://www.theses.fr/2019POIT2254.
Full textIn many modelling fields, such as architecture, archaeology or CAD, performing many variations of the same model is an expanding need. But building all those variations manually takes time. It is therefore needed to use automatic technics to revaluate some parts of a model, or even an entire model, after the user specifies the modifications. Most of the existing approaches dedicated to revaluating models are based on a system called parametric modelling. It is made of two parts, a geometric model and a parametric specification, which allows to record the series of operation that created the model, and the different parameters of those operations. This way, the user can change some parameters, or edit the list of operations to modify the model. To do so, we use a system called persistent naming, introduced during the 90ies, that allows us to identify and match the entities of an initial specification and the ones of a revaluated specification. In this thesis, our goal is to propose a persistent naming system that would be general, homogeneous and that would allow the user to edit a parametric specification (which means move, add, or delete some operations). We base our system on the Jerboa library, which uses graph transformation rules. This way, we will be able to use those rules to create our naming system, while also linking the notions of graph transformation rules and parametric specification. We will then describe how to use our naming method to revaluate or edit parametric specifications. Finally, we will compare our method with the other ones from the literature
Bongiovanni, Francesco. "Design, formalization and implementation of overlay networks : application to RDF data storage." Nice, 2012. http://www.theses.fr/2012NICE4021.
Full textStructured Overlay Networks (SONs) are a new class of Peer-to-Peer (P2P) systems which are widely used for large scale applications such as file sharing , information dissemination, storage and retrieval of different resources… Many different SONs co-exist on the Web yet they do not cooperate with each other. In order to promote cooperation, we propose two protocols, Babelchord and Synapse, whose goals are to enable the inter-connection of structured and heterogeneous overlays networks through meta-protocols. Babelchord aims to aggregate small structured overlay networks in an unstructured fashion while Synapse generalizes this concept and provides flexible mechanisms relying on co-located nodes, i. E. Nodes which belong to multiple overlays at the same time. We provides the algorithms behind both protocols, as well as simulations results showing their behaviours in the context of information retrieval. We have also implemented and experimented a prototype of JSynapse on the Grid’5000 platform, confirming the obtained simulation results and giving a proof of concept of our protocol. A novel generation of SONs was created in order to store and retrieve semantic data in large scale settings. The Semantic Web community is in need for scalable solutions which are able to store and retrieve RDF data, the core data model of the Semantic Web. The first generation of these systems is too monolithic and provided limited support for expressive queries. We propose the design and implementation of a new modular P2P-based system for these purposes. We build the system with RDF in mind and used a three-dimensional CAN overlay network, mimicking the nature of an RDF triple. We made specific design choices which preserve data locality but raises interesting technical challenges. Our modular design reduces the coupling between its underlying components, allowing them to be inter-changed with others. We also ran some micro-benchmarks on Grid’50000 which will be discussed. SONs have a specific geometrical topology which could be leveraged in order to increase the overall performance of the system. In this regard we propose a new broadcast efficient algorithm for CAN, developed in response to the results found from running the experiments in the RDF data store we have built, which used too many messages. Along this algorithm, we also propose a reasoning framework, developed with the Isabelle/HOL proof assistant, for proving correctness properties of dissemination algorithms for CAN-like P2P-systems. We focus on providing the minimal set of abstractions needed to devise efficient correct-by-construction dissemination algorithms on top of such overlay
Mayrand, Elsa. "Chirurgies de Dehn sur un entrelacs de S3 à deux composantes." Aix-Marseille 1, 2001. http://www.theses.fr/2001AIX11028.
Full textBelhoul, Yacine. "Graph-based Ad Hoc Networks Topologies and Business Process Matching." Thesis, Lyon 1, 2013. http://www.theses.fr/2013LYO10202.
Full textWe are interested in this thesis to graph-based approaches to deal with some challenges in networking, namely, graph topologies of mobile ad hoc networks (MANETs) and process model matchmaking in large scale web service. We propose in the first part: (1) a generic mechanism using mobility information of nodes to maintain a graph topology of the network. We show particularly, how to use the prediction of future emplacements of nodes to maintain a connected dominating set of a given MANET. (2) distributed algorithms to construct minimal global offensive alliance and global defensive alliance sets in MANETs. We also introduce several heuristics to get a better approximation of the cardinality of the alliance sets which is a desirable property for practical considerations. (3) a framework to facilitate the design and evaluation of topology control protocols in MANETs. We propose in the framework, a common schema for topology control based on NS-2 simulator and inspired from the commonalities between the components of the topology control algorithms in MANETs. In the second part, we focus on process model matchmaking. We propose two graph-based solutions for process model inexact matching to deal with high computational time of existing work in the literature. In the first solution, we decompose the process models into their possible execution sequences. After, we propose generic graph techniques using string comparator metrics for process model matchmaking based on this decomposition. In order to get better optimization of the execution time and to deal with process model matching in large scale web services, the second solution combines a spectral graph matching with structural and semantic proposed approaches. This solution uses an eigen-decomposition projection technique that makes the runtime faster
Palesi, Frédéric. "Dynamique sur les espaces de représentations de surfaces non-orientables." Phd thesis, Université Joseph Fourier (Grenoble), 2009. http://tel.archives-ouvertes.fr/tel-00443930.
Full textDalud-Vincent, Monique. "Modèle prétopologique pour une méthodologie d'analyse de réseaux : concepts et algorithmes." Lyon 1, 1994. http://www.theses.fr/1994LYO10040.
Full textBourgeau, Thomas. "Capture de la dynamique de la topologie de l'internet au niveau IP." Paris 6, 2013. http://www.theses.fr/2013PA066677.
Full textLarge-scale distributed network route tracing systems obtain the IP-level internet topology by orchestrating Traceroute-like tool on distributed sources that capture the paths to several destinations in the network. This information is important to network operators to better monitor the state of their network, react to failures and detect anomalies while researchers use it to model and understand the behavior of the underlying network topology. However, existing approaches to measuring the public IPv4 network space often require one or more days to obtain a full graph, which is too slow to capture much of the network's dynamics. Thus, new network route tracing system algorithms are highly expected to reach the requirements of scalability, measurement speed, and dynamics capture accuracy. This thesis proposes a fundamental improvement to distributed IP-level Internet topology measurement systems. Such systems have focused on conducting full end-to-end route traces and as a result take a considerable time to obtain a graph of the network. Here, we propose an approach focused directly on obtaining the graph, which is, as a result, much faster (presuming the principal goal is to obtain this graph, rather than full routes). The main benefit of our approach is that we can get a much better view of the dynamics of the network at the IP-level. In addition to IP-level measurement, this thesis develops a novel approach to network topology services by designing a federated monitoring infrastructure that exposes a wide range of measurement metrics for testbed users
Garcia, Cantu Ros Anselmo. "Thermodynamic and kinetic aspects of interaction networks." Doctoral thesis, Universite Libre de Bruxelles, 2007. http://hdl.handle.net/2013/ULB-DIPOT:oai:dipot.ulb.ac.be:2013/210420.
Full text
Doctorat en Sciences
info:eu-repo/semantics/nonPublished
Cuneo, Rémi. "Généralisation d'une méthode de petites simplifications due à Mikhaïl Gromov et Yann Ollivier en géométrie des groupes." Thesis, Aix-Marseille 1, 2011. http://www.theses.fr/2011AIX10026/document.
Full textIn a paper published in 2003, M.Gromov proposes a rewording of the small cancellation theory in geometric group theory. In this version, a finite graph defines a finitely presented group; generators of the group are the labels of the graph; relators are the words associated with cycles; pieces, "short" words which allow small cancellations in a group, are words which label two distinct paths in the graph.Our thesis relies on a brief description of this theory published in2006 by Y.Ollivier. The concept of finitely presented "small cancellation" group, developed by R.Lyndon, M.Greendlinger and others in the 60's and 70's, is a precursor of Gromovword-hyperbolic groups in the late of the 80's, for which combinatorial properties of the presentation imply algebraic properties of the group. In our work, we build a rigorous small cancellation theory in terms of graphs, and develop the basic concept of "megatiles", implicitly used by Y. Ollivier in his article. We extend his results to non-hyperbolic and non-metric cases (eg. $C(4)-T(4)$). This point of view allows a new proof, more natural, of thesolvability of word and conjugacy problems for presentations of prime alternating link groups. We also extend the results of a M.Greendlinger theorem to thenon-metric case, in response to a question of I. Kapovich
Mokhtarian, Hossein. "Modélisation intégrée produit-process à l'aide d'une approche de métamodélisation reposant sur une représentation sous forme de graphes : Application à la fabrication additive." Thesis, Université Grenoble Alpes (ComUE), 2019. http://www.theses.fr/2019GREAI013/document.
Full textAdditive manufacturing (AM) has created a paradigm shift in product design and manufacturing sector due to its unique capabilities. However, the integration of AM technologies in the mainstream production faces the challenge of ensuring reliable production and repeatable quality of parts. Toward this end, Modeling and simulation play a significant role to enhance the understanding of the complex multi-physics nature of AM processes. In addition, a central issue in modeling AM technologies is the integration of different models and concurrent consideration of the AM process and the part to be manufactured. Hence, the ultimate goal of this research is to present and apply a modeling approach to develop integrated modeling in additive manufacturing. Accordingly, the thesis oversees the product development process and presents the Dimensional Analysis Conceptual Modeling (DACM) Framework to model the product and manufacturing processes at the design stages of product development process. The Framework aims at providing simulation capabilities and systematic search for weaknesses and contradictions to the models for the early evaluation of solution variants. The developed methodology is applied in multiple case studies to present models integrating AM processes and the parts to be manufactured. This thesis results show that the proposed modeling framework is not only able to model the product and manufacturing process but also provide the capability to concurrently model product and manufacturing process, and also integrate existing theoretical and experimental models. The DACM framework contributes to the design for additive manufacturing and helps the designer to anticipate limitations of the AM process and part design earlier in the design stage. In particular, it enables the designer to make informed decisions on potential design alterations and AM machine redesign, and optimized part design or process parameter settings. DACM Framework shows potentials to be used as a metamodeling approach for additive manufacturing
Caudron, Alain. "Classification des noeuds et des entrelacs." Grenoble 2 : ANRT, 1987. http://catalogue.bnf.fr/ark:/12148/cb37603922w.
Full textPrévost, Stéphanie. "Modélisation implicite et visualisation multi-échelle par squelette à union de boules et graphe de recouvrement." Reims, 2001. http://www.theses.fr/2001REIMS014.
Full textMorvan, Michel. "Algorithmes linéaires et invariants d'ordres." Montpellier 2, 1991. http://www.theses.fr/1991MON20022.
Full textMartin, Alexandre. "Topologie et géométrie des complexes de groupes à courbure négative ou nulle." Phd thesis, Université de Strasbourg, 2013. http://tel.archives-ouvertes.fr/tel-00821442.
Full textTetley, Romain. "Analyse mixte de protéines basée sur la séquence et la structure - applications à l'annotation fonctionnelle." Thesis, Université Côte d'Azur (ComUE), 2018. http://www.theses.fr/2018AZUR4111/document.
Full textIn this thesis, the focus is set on reconciling the realms of structure and sequence for protein analysis. Sequence analysis tools shine when faced with proteins presenting high sequence identity (≤ 30\%), but are lack - luster when it comes to remote homolog detection. Structural analysis tools present an interesting alternative, but solving structures - when at all possible- is a tedious and expensive process. These observations make the need for hybrid methods - which inject information obtained from available structures in a sequence model - quite clear. This thesis makes four main contributions toward this goal. First we present a novel structural measure, the RMSDcomb, based on local structural conservation patterns - the so called structural motifs. Second, we developed a method to identify structural motifs between two structures using a bootstrap method which relies on filtrations. Our approach is not a direct competitor to flexible aligners but can provide useful to perform a multiscale analysis of structural similarities. Third, we build upon the previous methods to design hybrid Hidden Markov Models which are biased towards regions of increased structural conservation between sets of proteins. We test this tool on the class II fusion viral proteins - particularly challenging because of their low sequence identity and mild structural homology. We find that we are able to recover known remote homologs of the viral proteins in the Drosophila and other organisms. Finally, formalizing a sub - problem encountered when comparing filtrations, we present a new theoretical problem - the D-family matching - on which we present various algorithmic results. We show - in a manner that is analogous to comparing parts of two protein conformations - how it is possible to compare two clusterings of the same data set using such a theoretical model