Rozprawy doktorskie na temat „Représentation des graphes”
Utwórz poprawne odniesienie w stylach APA, MLA, Chicago, Harvard i wielu innych
Sprawdź 50 najlepszych rozpraw doktorskich naukowych na temat „Représentation des graphes”.
Przycisk „Dodaj do bibliografii” jest dostępny obok każdej pracy w bibliografii. Użyj go – a my automatycznie utworzymy odniesienie bibliograficzne do wybranej pracy w stylu cytowania, którego potrzebujesz: APA, MLA, Harvard, Chicago, Vancouver itp.
Możesz również pobrać pełny tekst publikacji naukowej w formacie „.pdf” i przeczytać adnotację do pracy online, jeśli odpowiednie parametry są dostępne w metadanych.
Przeglądaj rozprawy doktorskie z różnych dziedzin i twórz odpowiednie bibliografie.
Picard, Celia. "Représentation coinductive des graphes". Phd thesis, Université Paul Sabatier - Toulouse III, 2012. http://tel.archives-ouvertes.fr/tel-00862507.
Pełny tekst źródłaLabourel, Arnaud. "Partition d'arêts et représentation implicite de graphes". Bordeaux 1, 2007. http://www.theses.fr/2007BOR13490.
Pełny tekst źródłaKerdiles, Gwenael Nang. "Logiques de graphes conceptuels". Montpellier 2, 2001. http://www.theses.fr/2001MON20185.
Pełny tekst źródłaBoschin, Armand. "Machine learning techniques for automatic knowledge graph completion". Electronic Thesis or Diss., Institut polytechnique de Paris, 2023. http://www.theses.fr/2023IPPAT016.
Pełny tekst źródłaA knowledge graph is a directed graph in which nodes are entities and edges, typed by a relation, represent known facts linking two entities. These graphs can encode a wide variety of information, but their construction and exploitation can be complex. Historically, symbolic methods have been used to extract rules about entities and relations, to correct anomalies or to predict missing facts. More recently, techniques of representation learning, or embeddings, have attempted to solve these same tasks. Initially purely algebraic or geometric, these methods have become more complex with deep neural networks and have sometimes been combined with pre-existing symbolic techniques.In this thesis, we first focus on the problem of implementation. Indeed, the diversity of libraries used makes the comparison of results obtained by different models a complex task. In this context, the Python library TorchKGE was developed to provide a unique setup for the implementation of embedding models and a highly efficient inference evaluation module. This library relies on graphic acceleration of tensor computation provided by PyTorch, is compatible with widespread optimization libraries and is available as open source.We then consider the automatic enrichment of Wikidata by typing the hyperlinks linking Wikipedia pages. A preliminary study showed that the graph of Wikipedia articles is much denser than the corresponding knowledge graph in Wikidata. A new training method involving relations and an inference method using entity types were proposed and experiments showed the relevance of the combined approach, including on a new dataset.Finally, we explore automatic entity typing as a hierarchical classification task. That led to the design of a new hierarchical loss used to train tensor-based models along with a new type of encoder. Experiments on two datasets have allowed a good understanding of the impact a prior knowledge of class taxonomy can have on a classifier but also reinforced the intuition that the hierarchy can be learned from the features if the dataset is large enough
Faci, Adam. "Représentation, simulation et exploitation de connaissances dans le formalisme des graphes conceptuels". Electronic Thesis or Diss., Sorbonne université, 2022. http://www.theses.fr/2022SORUS419.
Pełny tekst źródłaThis thesis addresses the field of knowledge representation in conceptual graphs, a structured knowledge representation formalism that provides efficient manipulation tools. There are many challenges in symbolic artificial intelligence concerning the representation of knowledge in general, and in particular the concise representation of a large amount of information. Conceptual graphs, by their ability to visually represent different kinds of knowledge, mainly ontological and factual, and by offering efficient manipulation tools, provide a perfect framework for the answer to these problems. We conduct a comparative study of fuzzy extensions of conceptual graphs, then we propose an algorithm for conceptual graphs simulation as well as an efficient algorithm for extracting frequent patterns that are not redundant with ontological knowledge
Ghilardi, Jean-Pierre. "Optimisation de la représentation de graphes par approche hybride déterministe et stochastique". Aix-Marseille 3, 2002. http://www.theses.fr/2002AIX30032.
Pełny tekst źródłaIn bibliometrie scope, we frequently have to compute database which constitute a quantitive information corpus, difficult to interpret by direct reading. That's the reason why some tools with complex mathematic treatments have been created, this is how structured data bank can be processing to obtain relevant information available for decision makers. The Centre de Recherche Rétrospective de Marseille is specialized in information processing for a long time. Automatic tools based on geometrical representation of relationship between entities have been developed. During this research, an innovant data processing implemented to automatically produce an organized representation of graph easily understandable have been defined. The treatment chain is based on two different approach, a determinist approach issuing from graph theory and a stochastic approach composed of simulated annealing algorithm and genetic algorithm, which allow to make easier graph reading
Hafidi, Hakim. "Robust machine learning for Graphs/Networks". Electronic Thesis or Diss., Institut polytechnique de Paris, 2023. http://www.theses.fr/2023IPPAT004.
Pełny tekst źródłaThis thesis addresses advancements in graph representation learning, focusing on the challengesand opportunities presented by Graph Neural Networks (GNNs). It highlights the significanceof graphs in representing complex systems and the necessity of learning node embeddings that capture both node features and graph structure. The study identifies key issues in GNNs, such as their dependence on high-quality labeled data, inconsistent performanceacross various datasets, and susceptibility to adversarial attacks.To tackle these challenges, the thesis introduces several innovative approaches. Firstly, it employs contrastive learning for node representation, enabling self-supervised learning that reduces reliance on labeled data. Secondly, a Bayesian-based classifier isproposed for node classification, which considers the graph’s structure to enhance accuracy. Lastly, the thesis addresses the vulnerability of GNNs to adversarialattacks by assessing the robustness of the proposed classifier and introducing effective defense mechanisms.These contributions aim to improve both the performance and resilience of GNNs in graph representation learning
Melki, Michaël. "Etude d'un modèle de représentation symbolique multi-résolution d'une image à base de graphes". Lyon, INSA, 2006. http://theses.insa-lyon.fr/publication/2006ISAL0074/these.pdf.
Pełny tekst źródłaIn this PhD, we present a symbolic, multi-resolution model for representing an image. To do that, we consider both the structure of the image, that is the blocs from which it is constituted, and its content. We first focus on the structural part of the image. Under some constraints, a few properties can be enough to fully characterize the topology of the structure. This leads us to a graph-based representation for the structure of an image, which can be completed by adding symbolic information to the nodes to represent the content part of the image. We then propose a process to build an lower resolution image from an input image. This process uses reduction rules that take into account both the structure and the content of the image, and could be used either to segment an image at different resolution levels or to extract some information from it. Then we study this process to define methods that can be used for learning some of the parameters of the rules, for speeding up the building process, or for making the whole process more reliable
Guinaldo, Olivier. "Etude d'un gestionnaire d'ensembles de graphes conceptuels". Montpellier 2, 1996. http://www.theses.fr/1996MON20189.
Pełny tekst źródłaCarbonneill, Boris. "Vers un système de représentation de connaissances et de raisonnement fondé sur les graphes conceptuels". Montpellier 2, 1996. http://www.theses.fr/1996MON20015.
Pełny tekst źródłaBui-Xuan, Binh-Minh. "Représentation arborescente de familles d'ensembles avec application dans les décompositions de graphes et algorithmes efficaces". Montpellier 2, 2008. http://www.theses.fr/2008MON20084.
Pełny tekst źródłaAhn, Yun-Kang. "L'analyse musicale computationnelle : rapport avec la composition, la segmentation et la représentation à l'aide des graphes". Paris 6, 2009. https://tel.archives-ouvertes.fr/tel-00447778.
Pełny tekst źródłaVenant, Fabienne. "Représentation et calcul dynamique du sens : exploration du lexique adjectival du français". Phd thesis, Ecole des Hautes Etudes en Sciences Sociales (EHESS), 2006. http://tel.archives-ouvertes.fr/tel-00067902.
Pełny tekst źródłaMoreau, Jean-Michel. "Hiérarchisation et facétisation de la représentation par segments d'un graphe planaire dans le cadre d'une arithmetique mixte". Saint-Etienne, EMSE, 1990. http://tel.archives-ouvertes.fr/docs/00/83/15/81/PDF/1990_Moreau_Jean_Michel.pdf.
Pełny tekst źródłaThomopoulos, Rallou. "Représentation et interrogation élargie de données imprécises et faiblement structurées". Paris, Institut national d'agronomie de Paris Grignon, 2003. http://www.theses.fr/2003INAP0018.
Pełny tekst źródłaThis work is part of a project applied to predictive microbiology, which is built on a database and on its querying system. The data used in the project are weakly structured, they may be imprecise, and cannot provide exact answers to every query, so that a flexible querying system is necessary for the querying of the database. We use the conceptual graph model in order to take into account weakly structured data, and fuzzy set theory, in order to represent imprecise data and fuzzy queries. The purpose of this work is to provide a combination of these two formalisms
Simonet, Geneviève. "Héritage non monotone à base de chemins et de graphes partiels". Montpellier 2, 1994. http://www.theses.fr/1994MON20151.
Pełny tekst źródłaMegier, Jacques. "La conscience comme auto-représentation". Thesis, Paris, EHESS, 2017. http://www.theses.fr/2017EHES0103/document.
Pełny tekst źródłaThis work illustrates a version of the self-representational theory of consciousness. If one accepts on the one hand the notion of mental states that have a given content - conscious or unconscious - and on the other hand the plausible hypothesis that the content of all mental states consists in a representation, then the problem of the manifestation of consciousness for (the content of) SOME states becomes intelligible within this frame. This problem can be understood as the research of the representational structure which gives rise to this manifestation. For some authors ( Fred Dretske, Michael Tye, and others) certain particular conditions in the direct representation of the object are sufficient, for others (particularly David Rosenthal) a meta-representation is necessary, under given conditions. However neither of those structures results sufficient to justify the demarcation between conscious and unconscious states and to characterize the phenomenality of consciousness. If one then takes seriously into account the strong intuition of self-referentiality of consciousness (already present in Aristotle - following some interpretations -, taken up again by Brentano, Sartre, and lately by Uriah Kriegel and several others) one is conducted to propose a self-representational structure for conscious mental states which involves a dual conscious intentionality targeting the object and itself at the same time. The problems of the meta-representational theory are thus resolved, but it remains to be shown that this scheme is intelligible, that the risk of infinite regress of the representing capacity of consciousness does not exist, and that strong intuitions are thus acknowledged : such as the distinction in the conscious field between foreground and background, and the link between background, or marginal consciousness, and self consciousness. Within the self-representational view, this link originates from the fact that marginal consciousness is the consciousness of the consciousness of the object, and qualifies itself as subjective consciousness, that is to say, consciousness "for me" of the object. Self consciousness is then constructed from the episodes of subjective consciousness. The relationship between conscious mental representational structures and the spatio-temporal neuronal configurations which produce them in the brain, is outside the domain of the present work, but it is necessarily present in the background, and it is considered when useful for the argument
Ahn, Yun-Kang. "L'analyse musicale computationnelle : rapport avec la composition, la segmentation et la représentation à l'aide de graphes". Phd thesis, Université Pierre et Marie Curie - Paris VI, 2009. http://tel.archives-ouvertes.fr/tel-00447778.
Pełny tekst źródłaBresch, Didier. "Etude et réalisation d'un outil logiciel de modélisation et de simulation de systèmes automatiques utilisant la représentation des graphes à liens". Mulhouse, 1986. http://www.theses.fr/1986MULH0011.
Pełny tekst źródłaLabbé, Cyril. "Flots stochastiques et représentation lookdown". Phd thesis, Université Pierre et Marie Curie - Paris VI, 2013. http://tel.archives-ouvertes.fr/tel-00874551.
Pełny tekst źródłaAmilhastre, Jerome. "Représentation par automate d'ensemble de solutions de problèmes de satisfaction de contraintes". Montpellier 2, 1999. http://www.theses.fr/1999MON20027.
Pełny tekst źródłaSamuel, Emilie. "Recherche de motifs dans des images : apport des graphes plans". Phd thesis, Université Jean Monnet - Saint-Etienne, 2011. http://tel.archives-ouvertes.fr/tel-00719187.
Pełny tekst źródłaSallaberry, Arnaud. "Visualisation d'information : de la théorie sémiotique à des exemples pratiques basés sur la représentation de graphes et d'hypergraphes". Phd thesis, Université Sciences et Technologies - Bordeaux I, 2011. http://tel.archives-ouvertes.fr/tel-00646397.
Pełny tekst źródłaJacquelinet, Christian. "Modélisation du langage naturel et représentation des connaissances par graphes conceptuels : applications au domaine de l'information médicale". Rennes 1, 2002. http://www.theses.fr/2002REN1B060.
Pełny tekst źródłaAuillans, Pascal. "Modélisation de réseaux sémantiques par des hypergraphes et applications". Bordeaux 1, 2005. http://www.theses.fr/2005BOR12966.
Pełny tekst źródłaThe goal of the Web evolutions planned by the W3C is to enable the improvement of web services quality. To this end, W3C has added to the Web architecture a knowledge management system named Semantic Web, which implements a theoretical model relying on descriptive logic. This thesis, of which researches are more specifically applied to another knowledge representation system named Topic Maps, aims to rovide an alternative to the use of descriptive logic. We will show how graph theory can be used to structure the knowledge, hence benefit to the field of knowledge representation. This thesis initialy stands within the european project KePT, which aimed to implement a visualization interface for knowledge, structured according to the norm ISO 13250 Topic Maps, in Mondeca's ITM application. Research on graph clustering made for this project raised the need of both a better understanding of the topic maps structure, and tools that enable implementation of efficient processing. Therefore, we propose a formal model relying on graph theory that enables to express structural properties, beyond the expressive power of first order logic. Our model is not only suited for theoretical studies, but also for the adaptation of fast graph theory algorithms to knowledge processing. These processing were previously hardly implementable in industrial applications
Leclère, Michel. "Les connaissances du niveau terminologique du modèle des graphes conceptuels : construction et exploitation". Montpellier 2, 1995. http://www.theses.fr/1995MON20257.
Pełny tekst źródłaAttali, Dominique. "Squelettes et graphes de Voronoï 2D et 3D". Phd thesis, Université Joseph Fourier (Grenoble), 1995. http://tel.archives-ouvertes.fr/tel-00346066.
Pełny tekst źródłaDoumbouya, Mamadou Bilo. "Système d'argumentation pour la collaboration en télémédecine". Thesis, Toulouse 1, 2016. http://www.theses.fr/2016TOU10030/document.
Pełny tekst źródłaTelemedicine involves the practice of medical procedures remotely through the use of new information and communications technology. Among these medical procedures, we looked at the tele-expertise which is a kind of collaborative activity consisting of collecting the opinions of medical experts facing a particular health problem. In our work, we have chosen to model these collaborative activities by Dung argumentation system based on mathematical foundations and illustrates the interactions between the different stakeholders and at the same time provides mathematical tools decisions. We opted for a semantic modeling with conceptual graphs as one of our objectives is to ensure semantic interoperability. This modeling can often include inconsistencies (poor relations of attacks in argumentation system) which will be verified by the use of constraints in conceptual graphs. To solve these inconsistency problems, two major solutions have been proposed : (i) the weight of the arguments of different health professionals, (ii) modeling some aspects of medical law as constraints. This work demonstrates a computer application of logical reasoning in a judicial medical setting where it sheds light on the verification of information, argumentation and interaction. It aims to ensure good cooperation in order to guard against possible financial and legal consequences
Tognetti, Yannick. "Contribution à la modélisation des systèmes d'information chimique par la théorie et l'algorithmique de graphes". Montpellier 2, 2002. http://www.theses.fr/2002MON20182.
Pełny tekst źródłaDaniel-Vatonne, Marie-Christine. "Les termes : un modèle de représentation et structuration de données symboliques". Montpellier 2, 1993. http://www.theses.fr/1993MON20031.
Pełny tekst źródłaRaimbault, Thomas. "Transition de modèles de connaissances : un système de connaissance fondé sur OWL, graphes conceptuels et UML". Phd thesis, Nantes, 2008. https://archive.bu.univ-nantes.fr/pollux/show/show?id=4ef8d797-9884-4506-8973-e5bc095e2459.
Pełny tekst źródłaThe purpose of this thesis is using multiple knowledge models for representating knowledge and reasoning on this represented knowledge. This thesis proposes transitions between several knowledge models\string: OWL, Conceptual Graphs and UML. The originality of this thesis lies both in the centralized modeling knowledge within a knowledge system and in action to pass this knowledge from one model to another of system as needs required by modeling and reasoning. The main goal of these transitions knowledge models is twofold. On the one hand, it is to benefit from relatively easy using expressiveness of models to obtain as result a strong expressive power. On the other hand, it helps in the design and operation of a modeling, using best knowed models or best suited models. The tools of each model can then be used on represented knowledge, providing complementary use of these models
Espinasse, Thibault. "Champs et processus gaussiens indexés par des graphes, estimation et prédiction". Toulouse 3, 2011. http://thesesups.ups-tlse.fr/1578/.
Pełny tekst źródłaIn this work, westudy Gaussian processes indexed by graphs. Weaim at providing tools for modelisation, estimation, and prediction, that uses the structure of the underlying graphs. In the first Chapter,we deal with the blind prediction problem, and compute, in the case of short range dependancy, the rate of convergence of the bias in the prediction error. This rate depends on the regularity of the spectral density of the process. Then, we use the eigenstructure of the adjacency operatorofa graphto propose some models for covariance operators of Gaussian fields indexedby this graph. It leads to aspectral representation for this operator, that can be used to extend Whittle approximation, and quasi-maximum likelihoo destimation. Finally, this construction may be extended to the spatio-temporal case, where the Szegö lemma still holds
Oshurko, Ievgeniia. "Knowledge representation and curation in hierarchies of graphs". Thesis, Lyon, 2020. http://www.theses.fr/2020LYSEN024.
Pełny tekst źródłaThe task of automatically extracting insights or building computational models fromknowledge on complex systems greatly relies on the choice of appropriate representation.This work makes an effort towards building a framework suitable for representation offragmented knowledge on complex systems and its semi-automated curation---continuouscollation, integration, annotation and revision.We propose a knowledge representation system based on hierarchies of graphs relatedwith graph homomorphisms. Individual graphs situated in such hierarchies representdistinct fragments of knowledge and the homomorphisms allow relating these fragments.Their graphical structure can be used efficiently to express entities and their relations. Wefocus on the design of mathematical mechanisms, based on algebraic approaches to graphrewriting, for transformation of individual graphs in hierarchies that maintain consistentrelations between them. Such mechanisms provide a transparent audit trail, as well as aninfrastructure for maintaining multiple versions of knowledge.We describe how the developed theory can be used for building schema-aware graphdatabases that provide schema-data co-evolution capabilities. The proposed knowledgerepresentation framework is used to build the KAMI (Knowledge Aggregation and ModelInstantiation) framework for curation of cellular signalling knowledge. The frameworkallows for semi-automated aggregation of individual facts on protein-protein interactionsinto knowledge corpora, reuse of this knowledge for instantiation of signalling models indifferent cellular contexts and generation of executable rule-based models
Rolland, Franck. "Représentation tridimensionnelle et reconstruction 3D à partir de coupes 2D". Phd thesis, Grenoble 1, 1991. http://tel.archives-ouvertes.fr/tel-00339648.
Pełny tekst źródłaGandon, Fabien. "Graphes RDF et leur Manipulation pour la Gestion de Connaissances". Habilitation à diriger des recherches, Université de Nice Sophia-Antipolis, 2008. http://tel.archives-ouvertes.fr/tel-00351772.
Pełny tekst źródłaDans le deuxième chapitre, nous rappelons comment les formalismes à base de graphes peuvent être utilisés pour représenter des connaissances avec un degré variable de formalisation en fonction des besoins identifiés dans les scénarios d'application et des traitements à effectuer notamment pour la mise en place de webs sémantiques. Nous identifierons brièvement les caractéristiques de certains de ces formalismes qui sont utilisés dans nos travaux et les opportunités d'extensions qu'ils offrent. Nous synthétiserons aussi une initiative en cours pour factoriser la définition des structures mathématiques partagées par ces formalismes et réutiliser l'algorithmique des traitements communs à ces structures.
Dans le troisième chapitre nous expliquons que l'ontologie offre un support à d'autres types de raisonnement que la dérivation logique. Par exemple, la hiérarchie de notions contenue dans une ontologie peut être vue comme un espace métrique permettant de définir des distances pour comparer la proximité sémantique de deux notions. Nous avons mis en œuvre cette idée dans plusieurs scénarios comme l'allocation distribuée d'annotations, la recherche approchée ou le clustering. Nous résumons dans ce troisième chapitre diverses utilisations que nous avons faites des distances sémantiques et discutons notre position sur ce domaine. Nous donnons les scénarios d'utilisation et les distances utilisées dans un échantillon représentatif de projets que nous avons menés. Pour nous, cette première série d'expériences a permis de démontrer l'intérêt et le potentiel des distances, et aussi de souligner l'importance du travail restant à faire pour identifier et caractériser les familles de distances existantes et leur adéquation respective aux tâches pour lesquelles nos utilisateurs souhaitent être assistés.
Dans le quatrième chapitre, nous rappelons qu'un web sémantique, tel que nous en utilisons dans nos scénarios, qu'il soit public ou sur l'intranet d'une entreprise, repose généralement sur plusieurs serveurs web qui proposent chacun différentes ontologies et différentes bases d'annotations utilisant ces ontologies pour décrire des ressources. Les scénarios d'usage amènent souvent un utilisateur à formuler des requêtes dont les réponses combinent des éléments d'annotation distribués entre plusieurs de ces serveurs.
Ceci demande alors d'être capable :
(1) d'identifier les serveurs susceptibles d'avoir des éléments de réponse ;
(2) d'interroger des serveurs distants sur les éléments qu'ils connaissent sans surcharger le réseau;
(3) de décomposer la requête et router les sous-requêtes vers les serveurs idoines ;
(4) de recomposer les résultats à partir des réponses partielles.
Nous avons, avec le web sémantique, les briques de base d'une architecture distribuée. Le quatrième chapitre résume un certain nombre d'approches que nous avons proposées pour tenir compte de la distribution et gérer des ressources distribuées dans les webs sémantiques que nous concevons.
Les ontologies et les représentations de connaissances sont souvent dans le cœur technique de nos architectures, notamment lorsqu'elles utilisent des représentations formelles. Pour interagir avec le web sémantique et ses applications, le cinquième chapitre rappelle que nous avons besoin d'interfaces qui les rendent intelligibles pour les utilisateurs finaux. Dans nos systèmes d'inférences des éléments de connaissances sont manipulés et combinés, et même si les éléments de départ étaient intelligibles, l'intelligibilité des résultats, elle, n'est pas préservée par ces transformations.
Actuellement, et dans le meilleur des cas, les concepteurs d'interfaces mettent en œuvre des transformations ad hoc des structures de données internes en représentations d'interface en oubliant souvent les capacités de raisonnement que pourraient fournir ces représentations pour construire de telles interfaces. Dans le pire des cas, et encore trop souvent, les structures de représentation normalement internes sont directement mises à nu dans des widgets sans que cela soit justifié et, au lieu d'assister l'interaction, ces représentations alourdissent les interfaces.
Puisqu'elles reçoivent les contributions d'un monde ouvert, les interfaces du web sémantique devront être, au moins en partie, générées dynamiquement et rendues pour chaque structure devant rentrer en contact avec les utilisateurs. Le cinquième et dernier chapitre souligne cette opportunité croissante d'utiliser des systèmes à base d'ontologies dans l'assistance aux interactions avec nos utilisateurs.
Lhomme, Walter. "Gestion d'énergie de véhicules électriques hybrides basée sur la représentation énergétique macroscopique". Lille 1, 2007. https://pepite-depot.univ-lille.fr/LIBRE/Th_Num/2007/50376-2007-Lhomme.pdf.
Pełny tekst źródłaLienhardt, Denis. "Exploitation de la représentation d'état linéaire : modélisation et simulation des systèmes non-linéaires décrits par le langage des graphes à liens". Mulhouse, 1989. http://www.theses.fr/1989MULH0112.
Pełny tekst źródłaSamuel, Émilie. "Recherche de motifs dans des images : apport des graphes plans". Phd thesis, Université Jean Monnet - Saint-Etienne, 2011. http://tel.archives-ouvertes.fr/tel-00630439.
Pełny tekst źródłaRaimbault, Thomas. "Transition de modèles de connaissances - Un système de connaissance fondé sur OWL, Graphes conceptuels et UML". Phd thesis, Université de Nantes, 2008. http://tel.archives-ouvertes.fr/tel-00482664.
Pełny tekst źródłaMokhtarian, 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.
Pełny tekst źródłaAdditive 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
Raad, Joe. "Gestion d'identité dans des graphes de connaissances". Thesis, Université Paris-Saclay (ComUE), 2018. http://www.theses.fr/2018SACLA028/document.
Pełny tekst źródłaIn the absence of a central naming authority on the Web of data, it is common for different knowledge graphs to refer to the same thing by different names (IRIs). Whenever multiple names are used to denote the same thing, owl:sameAs statements are needed in order to link the data and foster reuse. Such identity statements have strict logical semantics, indicating that every property asserted to one name, will also be inferred to the other, and vice versa. While such inferences can be extremely useful in enabling and enhancing knowledge-based systems such as search engines and recommendation systems, incorrect use of identity can have wide-ranging effects in a global knowledge space like the Web of data. With several studies showing that owl:sameAs is indeed misused for different reasons, a proper approach towards the handling of identity links is required in order to make the Web of data succeed as an integrated knowledge space. This thesis investigates the identity problem at hand, and provides different, yet complementary solutions. Firstly, it presents the largest dataset of identity statements that has been gathered from the LOD Cloud to date, and a web service from which the data and its equivalence closure can be queried. Such resource has both practical impacts (it helps data users and providers to find different names for the same entity), as well as analytical value (it reveals important aspects of the connectivity of the LOD Cloud). In addition, by relying on this collection of 558 million identity statements, we show how network metrics such as the community structure of the owl:sameAs graph can be used in order to detect possibly erroneous identity assertions. For this, we assign an error degree for each owl:sameAs based on the density of the community(ies) in which they occur, and their symmetrical characteristics. One benefit of this approach is that it does not rely on any additional knowledge. Finally, as a way to limit the excessive and incorrect use of owl:sameAs, we define a new relation for asserting the identity of two ontology instances in a specific context (a sub-ontology). This identity relation is accompanied with an approach for automatically detecting these links, with the ability of using certain expert constraints for filtering irrelevant contexts. As a first experiment, the detection and exploitation of the detected contextual identity links are conducted on two knowledge graphs for life sciences, constructed in a mutual effort with domain experts from the French National Institute of Agricultural Research (INRA)
Allain, Pierre. "Analyse et synthèse de mouvements de foules par contrôle optimal". Lorient, 2012. http://www.theses.fr/2012LORIS257.
Pełny tekst źródłaIn the communities of computer graphics and vision the study of human crowds phenomena has raised an increasing interest over the past years. The main reasons stem from a continuous increase in the world population and the associated problems, but also from a search of a good visual realism in computer games or computer-generated images for the movie industry. Yet, most of the navigation mechanisms or collision avoidance strategies among pedestrians are not fully understood, resulting in empirical models inspired by qualitative observations. On the contrary, data- driven methods oppose to this qualitative methods by giving ways to describe quantitatively those phenomena. From crowd videos, it should be possible to enrich the behavioral simulation models through parameterization or calibration. In this thesis, an original approach is proposed to analyze and simulate crowd motions from videos, which exploits the optimal control formalism, and more specifically the variational data assimilation principles. By exploiting some existing physical models describing the dynamics of a crowd flow, and combining this information to the perceived motion in the image, it is shown in this thesis how to extract a high level information on the flow related to a disturbance potential. The information conveyed in this process is by essence Eulerian, and opposes to the Lagrangian nature of pedestrians. To overcome this plurality of representation, a new powerful graph-based representation is introduced. The control of individuals driven by a dynamical method and under external constraints (designed by an animator or acquired from videos) is then studied and discussed
Vismara, Philippe. "Reconnaissance et représentation d'éléments structuraux pour la description d'objets complexes : application à l'élaboration de stratégies de synthèse en chimie organique". Montpellier 2, 1995. http://www.theses.fr/1995MON20253.
Pełny tekst źródłaMartin, Philippe. "Exploitation de graphes conceptuels et de documents structurés et hypertextes pour l'acquisition de connaissances et la recherche d'informations". Nice, 1996. http://www.theses.fr/1996NICE4992.
Pełny tekst źródłaLauf, Aurélien. "Propagation du buzz sur Internet -- Identification, analyse, modélisation et représentation dans un contexte de veille". Thesis, Paris, INALCO, 2014. http://www.theses.fr/2014INAL0019/document.
Pełny tekst źródłaThis thesis is in the context of strategic and competitive intelligence. Its goal is to develop tools and methods to identify, analyze, model and represent how buzz spread on the Internet. Any buzz has one or more starting point(s), i.e. primary source(s). The information is then passed on by secondary sources which may speed or slow down its spreading depending on their influence. Throughout the buzz lifecycle, the semantic content can evolve. To understand a buzz on the Internet, one needs to analyze what is said and qualify who speaks. This thesis will focus on two main points : a topological analysis of the sources (graph theory and networks), and an analysis of the textual content (corpus linguistics)
Chera, Catalin-Marian. "Contribution à l'extension de l'approche énergétique à la représentation des systèmes à paramètres distribués". Phd thesis, Ecole Centrale de Lille, 2009. http://tel.archives-ouvertes.fr/tel-00578842.
Pełny tekst źródłaThierry, Eric. "Sur quelques interactions entre structures de données et algorithmes efficaces". Montpellier 2, 2001. http://www.theses.fr/2001MON20079.
Pełny tekst źródłaBugeaud, Florie. "ISamsara : pour une ingénierie des systèmes de services à base de méréologie et d'hypergraphes". Troyes, 2011. http://www.theses.fr/2011TROY0005.
Pełny tekst źródłaThe « service orientation » and its challenges are now well known within companies. How-ever, the analysis of the activities of services designers at a telecommunications operator, as well as the state of the art about the service theories and models show the still ill-specified nature of that term. Our work is anchored in the discipline of computer science, but it pursues the discussion of the SSME multidisciplinary approach (Service Science Management and Engineering). It first redefines the concept of service according to a systemic perspective. It also adopts a theory of the service relationship as a « traffic relationship », and various philosophical inspirations that help us to ontologically conceive reality as nested and interconnected processes. Therefore, we formalize the service as a dynamic phenomenon emerging from the coordination of heterogeneous entities, for which the « agencements theory » seems useful. Then, we propose to represent and simulate these « servicial agencements » with a hypergraph and a mereo-relational ontology revealing the structure but also to the calculated experience’s scenarios. The proposed method and tool’s proof of concept for the modeling and simulation of servicial agencements (iSamsara) are part of the problem of constructing a real Services Systems Engineering. Moreover, this work takes place in a con-text of knowledge engineering related to the process of opportunities study of a telecom operator
Mayet, Clément. "Simulation énergétique flexible d’un carrousel de métros basée sur la représentation énergétique macroscopique". Thesis, Lille 1, 2016. http://www.theses.fr/2016LIL10013/document.
Pełny tekst źródłaTransportation systems have to be efficient in terms of energy in order to limit their environmental impact. Electric public transportation, such as subways or tramways, is thus strongly requested in urban areas. Various innovative solutions have emerged recently to increase their energy efficiency (energy storage systems, reversible traction power substations, etc.). However, due to the complexity of the development and optimization of such systems, numerical simulation tools are essential. Nevertheless, simulators of railway systems are particularly delicate to develop due to non-linearity (non-reversibility of traction power substations), non-stationary (displacement of trains), and multiple energetic interactions which exists within these kind of systems. This PhD thesis then proposes a new simulation tool of subway system based on EMR formalism (Energetic Macroscopic Representation). This formalism structures the models according to the energetic properties of the system. It leads to a forward simulation approach with exclusive use of the integral causality. In that way, the proposed simulation tool is stemming from an innovative approach and allows a new vision of subway systems. These approaches allow especially the increasing of the simulator flexibility and the obtaining of physical simulation results. Moreover, this PhD thesis has the particularity to experimentally validate all the developed models
Metzger, Jean-Luc. "Contribution à l'élaboration d'un modèle de Raisonnement à Partir de Cas pour l'aide à l'interprétation d'organisations spatiales agricoles". Phd thesis, Université Henri Poincaré - Nancy I, 2005. http://tel.archives-ouvertes.fr/tel-00465730.
Pełny tekst źródła