Rozprawy doktorskie na temat „Hierarchical graphs”
Utwórz poprawne odniesienie w stylach APA, MLA, Chicago, Harvard i wielu innych
Sprawdź 50 najlepszych rozpraw doktorskich naukowych na temat „Hierarchical graphs”.
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.
Busatto, Giorgio. "An abstract model of hierarchical graphs and hierarchical graph transformation". Oldenburg : Univ., Fachbereich Informatik, 2002. http://deposit.ddb.de/cgi-bin/dokserv?idn=967851955.
Pełny tekst źródłaBusatto, Giorgio [Verfasser]. "An abstract model of hierarchical graphs and hierarchical graph transformation / von Giorgio Busatto". Oldenburg : Univ., Fachbereich Informatik, 2002. http://d-nb.info/967851955/34.
Pełny tekst źródłaDorrian, Henry Joseph. "Hierarchical graphs and oscillator dynamics". Thesis, Manchester Metropolitan University, 2015. http://e-space.mmu.ac.uk/580120/.
Pełny tekst źródłaSlade, Michael L. "A layout algorithm for hierarchical graphs with constraints /". Online version of thesis, 1994. http://hdl.handle.net/1850/11724.
Pełny tekst źródłaPuch-Solis, Roberto O. "Hierarchical junction trees". Thesis, University of Warwick, 2000. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.365243.
Pełny tekst źródłaReynolds, Jason. "A hierarchical layout algorithm for drawing directed graphs". Thesis, National Library of Canada = Bibliothèque nationale du Canada, 1997. http://www.collectionscanada.ca/obj/s4/f2/dsk2/ftp04/mq20694.pdf.
Pełny tekst źródłaWallgrün, Jan Oliver. "Hierarchical Voronoi graphs spatial representation and reasoning for mobile robots". Berlin Heidelberg Springer, 2008. http://d-nb.info/99728210X/04.
Pełny tekst źródłaSpisla, Christiane [Verfasser]. "Compaction of Orthogonal and Hierarchical Graph Drawings Using Constraint Graphs and Minimum Cost Flows / Christiane Spisla". München : Verlag Dr. Hut, 2019. http://d-nb.info/119641467X/34.
Pełny tekst źródłaSantana, Maia Deise. "A study of hierarchical watersheds on graphs with applications to image segmentation". Thesis, Paris Est, 2019. http://www.theses.fr/2019PESC2069.
Pełny tekst źródłaThe wide literature on graph theory invites numerous problems to be modeled in the framework of graphs. In particular, clustering and segmentation algorithms designed this framework can be applied to solve problems in various domains, including image processing, which is the main field of application investigated in this thesis. In this work, we focus on a semi-supervised segmentation tool widely studied in mathematical morphology and used in image analysis applications, namely the watershed transform. We explore the notion of a hierarchical watershed, which is a multiscale extension of the notion of watershed allowing to describe an image or, more generally, a dataset with partitions at several detail levels. The main contributions of this study are the following : - Recognition of hierarchical watersheds : we propose a characterization of hierarchical watersheds which leads to an efficient algorithm to determine if a hierarchy is a hierarchical watershed of a given edge-weighted graph. - Watersheding operator : we introduce the watersheding operator, which, given an edge-weighted graph, maps any hierarchy of partitions into a hierarchical watershed of this edge-weighted graph. We show that this operator is idempotent and its fixed points are the hierarchical watersheds. We also propose an efficient algorithm to compute the result of this operator. - Probability of hierarchical watersheds : we propose and study a notion of probability of hierarchical watersheds, and we design an algorithm to compute the probability of a hierarchical watershed. Furthermore, we present algorithms to compute the hierarchical watersheds of maximal and minimal probabilities of a given weighted graph. - Combination of hierarchies : we investigate a family of operators to combine hierarchies of partitions and study the properties of these operators when applied to hierarchical watersheds. In particular, we prove that, under certain conditions, the family of hierarchical watersheds is closed for the combination operator. - Evaluation of hierarchies : we propose an evaluation framework of hierarchies, which is further used to assess hierarchical watersheds and combinations of hierarchies. In conclusion, this thesis reviews existing and introduces new properties and algorithms related to hierarchical watersheds, showing the theoretical richness of this framework and providing insightful view for its applications in image analysis and computer vision and, more generally, for data processing and machine learning
Charpentier, Bertrand. "Multi-scale clustering in graphs using modularity". Thesis, KTH, Skolan för elektroteknik och datavetenskap (EECS), 2019. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-244847.
Pełny tekst źródłaDenna avhandling ger en ny hierarkisk klusteralgoritm för grafer, som heter Paris, vilket kan tolkas av modularitetsresultatet och dess upplösningsparameter. Algoritmen är agglomerativ och är baserad på ett enda avstånd mellan kluster som induceras av sannolikheten för sampling av nodpar. Det försöker att approximera de optimala partitionerna vid vilken upplösning som helst i en körning. Förutom en hierarkisk algoritm föreslår denna avhandling fyra algoritmer som beräknar rankningar av de bästa grupperna, kluster och resolutioner genom att bearbeta hierarkiproduktionen i Paris. Dessa algoritmer bygger på ett nytt koncept av klusterstabilitet, kallad sharpscore. Viktiga resultat av dessa fyra algoritmer är förmågan att rangordna kluster, upptäcka bästa klusterskala, gå utöver upplösningsgränsen och upptäcka de mest relevanta resolutionerna. Alla dessa algoritmer har testats på både syntetiska och verkliga datamängder för att illustrera effektiviteten i deras metoder.
Stoffel, Edgar-Philipp. "Hierarchical graphs as organisational principle and spatial model applied to pedestrian indoor navigation". Diss., kostenfrei, 2009. http://edoc.ub.uni-muenchen.de/10620/.
Pełny tekst źródłaOlifer, Maksim. "Architectural model synthesis from source code using Simulink and Hierarchical Function Call-Graphs". Thesis, Uppsala universitet, Institutionen för informationsteknologi, 2016. http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-296883.
Pełny tekst źródłaDecelle, Aurélien. "Statistical physics of disordered networks - Spin Glasses on hierarchical lattices and community inference on random graphs". Phd thesis, Université Paris Sud - Paris XI, 2011. http://tel.archives-ouvertes.fr/tel-00653375.
Pełny tekst źródłaCuenca, Pauta Erick. "Visualisation de données dynamiques et complexes : des séries temporelles hiérarchiques aux graphes multicouches". Thesis, Montpellier, 2018. http://www.theses.fr/2018MONTS054/document.
Pełny tekst źródłaThe analysis of data that is increasingly complex, large and from different sources (e.g. internet, social medias, etc.) is a dificult task. However, it remains crucial for many fields of application. It implies, in order to extract knowledge, to better understand the nature of the data, its evolution or the many complex relationships it may contain. Information visualization is about visual and interactive representation methods to help a user to extract knowledge. The work presented in this document takes place in this context. At first, we are interested in the visualization of large hierarchical time series. After analyzing the different existing approaches, we present the MultiStream system for visualizing, exploring and comparing the evolution of the series organized into a hierarchical structure. We illustrate its use by two examples: emotions expressed in social media and the evolution of musical genres. In a second time, we tackle the problem of complex data modeled in the form of multilayer graphs (different types of edges can connect the nodes). More specifically, we are interested in the visual querying of large graphs and we present VERTIGo, a system which makes it possible to build queries, to launch them on a specific engine, to visualize/explore the results at different levels of details and to suggest new query extensions. We illustrate its use with a graph of co-authors from different communities
Reda, Fatima Al. "Modélisation de mouvement de foules avec contraintes variées". Thesis, Université Paris-Saclay (ComUE), 2017. http://www.theses.fr/2017SACLS235/document.
Pełny tekst źródłaWe are interested in the modeling of crowd motion. We propose a microscopic model based on game theoretic principles. Each individual is supposed to have a desired velocity, it is the one he would like to have in the absence of others. We consider that each individual is influenced by some of his neighbors, practically the ones that he sees. A possible actual velocity is an instantaneous Nash equilibrium: each individual does its best with respect to a personal objective (desired velocity), considering the behavior of the neighbors that influence him. We address theoretical and modeling issues in various situations, in particular when each individual is influenced by all the others, and in the case where the influence relations between individuals are hierarchical. We develop a numerical strategy to solve the problem in the second case (hierarchical model) and propose numerical simulations to illustrate the behavior of the model. We confront our numerical results with real experiments and prove the ability of the hierarchical model to reproduce some phenomena.We also propose to write a macroscopic counterpart of the hierarchical model by translating the same modeling principles to the macroscopic level and make the first steps towards writing such model.The last problem tackled in this thesis is related to gradient flow frameworks in the continuous and discrete Wasserstein spaces. It is known that the Fokker-Planck equation can be interpreted as a gradient flow for the continuous Wasserstein distance. We establish a link between some space discretization strategies of the Finite Volume type for the Fokker- Planck equation in general meshes (Voronoï tesselations) and gradient flows on the underlying networks of cells, in the framework of discrete Wasserstein-like distance on graphs recently introduced
Sansen, Joris. "La visualisation d’information pour les données massives : une approche par l’abstraction de données". Thesis, Bordeaux, 2017. http://www.theses.fr/2017BORD0636/document.
Pełny tekst źródłaThe evolution and spread of technologies have led to a real explosion of information and our capacity to generate data and our need to analyze them have never been this strong. Still, the problems raised by such accumulation (storage, computation delays, diversity, speed of gathering/generation, etc. ) is as strong as the data are big, complex and varied. Information visualization,by its ability to summarize and abridge data was naturally established as appropriate approach. However, it does not solve the problem raised by Big Data. Actually, classical visualization techniques are rarely designed to handle such mass of information. Moreover, the problems raised by data storage and computation time have repercussions on the analysis system. For example,the increasing distance between the data and the analyst : the place where the data is stored and the place where the user will perform the analyses arerarely close. In this thesis, we focused on these issues and more particularly on adapting the information visualization techniques for Big Data. First of all focus on relational data : how does the existence of a relation between entity istransmitted and how to improve this transmission for hierarchical data. Then,we focus on multi-variate data and how to handle their complexity for the required computations. Finally, we present the methods we designed to make our techniques compatible with Big Data
Kakraba, Samuel. "A Hierarchical Graph for Nucleotide Binding Domain 2". Digital Commons @ East Tennessee State University, 2015. https://dc.etsu.edu/etd/2517.
Pełny tekst źródłaFehri, Amin. "Image Characterization by Morphological Hierarchical Representations". Thesis, Paris Sciences et Lettres (ComUE), 2018. http://www.theses.fr/2018PSLEM063/document.
Pełny tekst źródłaThis thesis deals with the extraction of hierarchical and multiscale descriptors on images, in order to interpret, characterize and segment them. It breaks down into two parts.The first part outlines a theoretical and methodological approach for obtaining hierarchical clusterings of the nodes of an edge-weighted graph. In addition, we introduce different approaches to combine hierarchical segmentations. These methods are then applied to graphs representing images and derive different hierarchical segmentation techniques. Finally, we propose a methodology for structuring and studying the space of hierarchies by using the Gromov-Hausdorff distance as a metric.The second part explores several applications of these hierarchical descriptions for images. We expose a method to learn how to automatically extract a segmentation of an image, given a type of images and a score of evaluation for a segmentation. We also propose image descriptors obtained by measuring inter-hierarchical distances, and expose their efficiency on real and simulated data. Finally, we extend the potential applications of these hierarchies by introducing a technique to take into account any spatial prior information during their construction
Choset, Howie M. Burdick Joel Wakeman Burdick Joel Wakeman. "Sensor based motion planning : the hierarchical generalized Voronoi graph /". Diss., Pasadena, Calif. : California Institute of Technology, 1996. http://resolver.caltech.edu/CaltechETD:etd-12182007-090504.
Pełny tekst źródłaHolzer, Martin. "Hierarchical speed-up techniques for shortest-path algorithms". [S.l. : s.n.], 2003. http://www.bsz-bw.de/cgi-bin/xvms.cgi?SWB10605142.
Pełny tekst źródłaWengle, Emil. "Modelling Hierarchical Structures in Networks Using Graph Theory : With Application to Knowledge Networks in Graph Curricula". Thesis, Uppsala universitet, Signaler och system, 2020. http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-415044.
Pełny tekst źródłaIsmaeel, Alaa Aly Khalaf [Verfasser], i H. [Akademischer Betreuer] Schmeck. "Dynamic Hierarchical Graph Drawing / Alaa Aly Khalaf Ismaeel. Betreuer: H. Schmeck". Karlsruhe : KIT-Bibliothek, 2012. http://d-nb.info/1023081776/34.
Pełny tekst źródłaCybis, Gabriela Bettella. "Phenotypic Bayesian phylodynamics : hierarchical graph models, antigenic clustering and latent liabilities". reponame:Biblioteca Digital de Teses e Dissertações da UFRGS, 2014. http://hdl.handle.net/10183/132858.
Pełny tekst źródłaYang, Fang. "Construction and application of hierarchical matrix preconditioners". Diss., University of Iowa, 2008. https://ir.uiowa.edu/etd/196.
Pełny tekst źródłaRaitner, Marcus. "Efficient visual navigation a study by the example of hierarchically structured graphs". [S.l.] : [s.n.], 2006. http://deposit.ddb.de/cgi-bin/dokserv?idn=978647084.
Pełny tekst źródłaSong, Yi-Zhe. "Hierarchical image descriptions for classification and painting". Thesis, University of Bath, 2009. https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.501634.
Pełny tekst źródłaMcKenzie, Chapter Harrison Lee. "Textured Hierarchical Precomputed Radiance Transfer". DigitalCommons@CalPoly, 2010. https://digitalcommons.calpoly.edu/theses/333.
Pełny tekst źródłaDepardon, Benjamin. "Contribution to the Deployment of a Distributed and Hierarchical Middleware Applied to Cosmological Simulations". Lyon, Ecole normale supérieure, 2010. http://www.theses.fr/2010ENSL0585.
Pełny tekst źródłaThe results presented in this thesis deal with the execution of applications on heterogeneous and distributed environments: computing grids. We study, from end-to-end, the process allowing users to execute complex scientific applications. The contributions of this work are thus manifold. 1) Hierarchical middleware deployment: we first present an execution model for hierarchical middleware. Then, based on this model, we present several heuristics to automatically determine the shape of the hierarchy that would best fit the users’ needs, depending on the platform it is executed on. We evaluate the quality of the approach on a real platform using the DIET middleware. 2) Graph clustering: we propose a distributed and self-stabilizing algorithm for clustering weighted graphs. Clustering is done based on a distance metric between nodes: within each created cluster the nodes are no farther than a distance k from an elected leader in the cluster. 3) Scheduling: we study the scheduling of independent tasks under resources usage limitations. We define linear programs to solve this problem in two cases: when tasks arrive all at the same time, and when release dates are considered. 4) Cosmological simulations: we have studied the behavior of applications required to run cosmological simulations workflows. Then, based on the DIET grid middleware, we implemented a complete infrastructure allowing non-expert users to easily submit cosmological simulations on a computing grid
Brown, Steven W. "Interactive Part Selection for Mesh and Point Models Using Hierarchical Graph-cut Partitioning". Diss., CLICK HERE for online access, 2008. http://contentdm.lib.byu.edu/ETD/image/etd2420.pdf.
Pełny tekst źródłaLima, Daniel Mário de. "Análise visual de dados relacionais: uma abordagem interativa suportada por teoria dos grafos". Universidade de São Paulo, 2013. http://www.teses.usp.br/teses/disponiveis/55/55134/tde-05052014-155415/.
Pełny tekst źródłaRelational databases are rigid-structured data sources characterized by complex relationships among a set of relations (tables). Making sense of such relationships is a challenging problem because users must consider multiple relations, understand their ensemble of integrity constraints, interpret dozens of attributes, and draw complex SQL queries for each desired data exploration. In this scenario, we introduce a twofold methodology; we use a hierarchical graph representation to efficiently model the database relationships and, on top of it, we designed a visualization technique for rapidly relational exploration. Our results demonstrate that the exploration of databases is deeply simplified as the user is able to visually browse the data with little or no knowledge about its structure, dismissing the need of complex SQL queries. We believe our findings will bring a novel paradigm in what concerns relational data comprehension.
Aleksakhin, Vladyslav. "Visualization of gene ontology and cluster analysis results". Thesis, Linnéuniversitetet, Institutionen för datavetenskap, fysik och matematik, DFM, 2012. http://urn.kb.se/resolve?urn=urn:nbn:se:lnu:diva-21248.
Pełny tekst źródłaTesta, Henrique Gregianin. "Um modelo hierárquico para sistemas de tipos de arquivos implementado como um middleware". reponame:Biblioteca Digital de Teses e Dissertações da UFRGS, 2007. http://hdl.handle.net/10183/25504.
Pełny tekst źródłaSeveral strategies to classify and organize documents by users and applications has being developed in order to facilitate its manipulation, including creation of different mechanisms related to file formats, known as file type systems. It is possible to notice in these works an increasing concern about file identification correctness and obtaining further information regarding its contents as well. This knowledge allow application and graphical environments of operating systems adding new functionalities on manipulation of documents and files. The present work proposes a new model and architecture to file type systems. The model is based on a file type graph representing hierarchical relationships and an index of file metadata. Both are used by functionalities provided through an API. To build the graph of file types, central piece on the proposed model, it was necessary to study file types registered on the most imporant operating systems, types defined by IANA and other types commonly used. The goal is to collect file types and interlink them in a hierarchy. The proposed architecture for the file type system is a middleware which provides services hiding native operating systems low level operations. The model and architecture presented in this work is specially useful to softwares that handle files intensely, like IDEs (Integrated Development Environment) and graphical environments.
Imaev, Aleksey A. "Hierarchical Modeling of Manufacturing Systems Using Max-Plus Algebra". Ohio University / OhioLINK, 2009. http://rave.ohiolink.edu/etdc/view?acc_num=ohiou1257871858.
Pełny tekst źródłaConsoli, Sergio. "The development and application of metaheuristics for problems in graph theory : a computational study". Thesis, Brunel University, 2008. http://bura.brunel.ac.uk/handle/2438/3061.
Pełny tekst źródłaAnguelov, Bobby. "Video game pathfinding and improvements to discrete search on grid-based maps". Diss., University of Pretoria, 2011. http://hdl.handle.net/2263/22940.
Pełny tekst źródłaDissertation (MSc)--University of Pretoria, 2011.
Computer Science
unrestricted
Cowlagi, Raghvendra V. "Hierarchical motion planning for autonomous aerial and terrestrial vehicles". Diss., Georgia Institute of Technology, 2011. http://hdl.handle.net/1853/41066.
Pełny tekst źródłaKwok, Wing-hong, i 郭永康. "Streamlined and prioritized hierarchical relations: a technique for improving the effectiveness of theclassification-tree methodology". Thesis, The University of Hong Kong (Pokfulam, Hong Kong), 2001. http://hub.hku.hk/bib/B2975107X.
Pełny tekst źródłaAlessi, Nicola. "Hierarchical Inter-Regional Routing Algorithm for Interplanetary Networks". Master's thesis, Alma Mater Studiorum - Università di Bologna, 2019. http://amslaurea.unibo.it/17468/.
Pełny tekst źródłaTran, The Truyen. "On conditional random fields: applications, feature selection, parameter estimation and hierarchical modelling". Curtin University of Technology, Dept. of Computing, 2008. http://espace.library.curtin.edu.au:80/R/?func=dbin-jump-full&object_id=18614.
Pełny tekst źródłaOn the theory side, the thesis addresses three important theoretical issues of CRFs: feature selection, parameter estimation and modelling recursive sequential data. These issues are all addressed under a general setting of partial supervision in that training labels are not fully available. For feature selection, we introduce a novel learning algorithm called AdaBoost.CRF that incrementally selects features out of a large feature pool as learning proceeds. AdaBoost.CRF is an extension of the standard boosting methodology to structured and partially observed data. We demonstrate that the AdaBoost.CRF is able to eliminate irrelevant features and as a result, returns a very compact feature set without significant loss of accuracy. Parameter estimation of CRFs is generally intractable in arbitrary network structures. This thesis contributes to this area by proposing a learning method called AdaBoost.MRF (which stands for AdaBoosted Markov Random Forests). As learning proceeds AdaBoost.MRF incrementally builds a tree ensemble (a forest) that cover the original network by selecting the best spanning tree at a time. As a result, we can approximately learn many rich classes of CRFs in linear time. The third theoretical work is on modelling recursive, sequential data in that each level of resolution is a Markov sequence, where each state in the sequence is also a Markov sequence at the finer grain. One of the key contributions of this thesis is Hierarchical Conditional Random Fields (HCRF), which is an extension to the currently popular sequential CRF and the recent semi-Markov CRF (Sarawagi and Cohen, 2004). Unlike previous CRF work, the HCRF does not assume any fixed graphical structures.
Rather, it treats structure as an uncertain aspect and it can estimate the structure automatically from the data. The HCRF is motivated by Hierarchical Hidden Markov Model (HHMM) (Fine et al., 1998). Importantly, the thesis shows that the HHMM is a special case of HCRF with slight modification, and the semi-Markov CRF is essentially a flat version of the HCRF. Central to our contribution in HCRF is a polynomial-time algorithm based on the Asymmetric Inside Outside (AIO) family developed in (Bui et al., 2004) for learning and inference. Another important contribution is to extend the AIO family to address learning with missing data and inference under partially observed labels. We also derive methods to deal with practical concerns associated with the AIO family, including numerical overflow and cubic-time complexity. Finally, we demonstrate good performance of HCRF against rivals on two applications: indoor video surveillance and noun-phrase chunking.
Jezný, Lukáš. "Automatické rozvržení diagramů". Master's thesis, Vysoké učení technické v Brně. Fakulta informačních technologií, 2008. http://www.nusl.cz/ntk/nusl-412807.
Pełny tekst źródłaHan, Sheng, Jianzhong Jiang, Yanshan Huang, Yanping Tang, Jing Cao, Dongqing Wu i Xinliang Feng. "Hierarchical TiO₂–SnO₂–graphene aerogels for enhanced lithium storage". Royal Society of Chemistry, 2015. https://tud.qucosa.de/id/qucosa%3A36375.
Pełny tekst źródłaPock, Michael. "A Hierarchical Modelling and Evaluation Technique for Safety Critical Systems". Thesis, Université de Lorraine, 2012. http://www.theses.fr/2012LORR0103/document.
Pełny tekst źródłaThis thesis presents a novel approach for modelling safety critical systems which takes into account several failure modes both for components and the global system. The so called Information Flow Diagrams (IFDs) were originally developed in a previous PhD-thesis. In this work, the evaluation if the IFD-approach should be made more efficient by using Binary Decision Diagrams (BDDs).This thesis will explain why such a model is necessary and practical, followed by a detailed explanation of the IFD-model. This includes its hierarchical structure and how this model can be applied. The next step is to formalise the original IFD-model in order to enable more efficient evaluation techniques. It will be explained why these formalisation steps were taken and what was gained by using them. Afterwards a detailed explanation of the developed algorithms is presented. These algorithms are based on a combination of different BDD-techniques. Zero Suppressed BDDs (ZBDDs) are combined with Boolean Expression Diagrams (BEDs). Furthermore, the structure of the IFDs is used in order to construct a large BDD out of several smaller BDDs. This increases the efficiency of the evaluation process.The presented techniques are evaluated by analysing several use cases which are explained in this work
MITSUMATSU, Sawako, Takeshi FURUHASHI, Tomohiro YOSHIKAWA, Akira ITO, 佐和子 光松, 武. 古橋, 大弘 吉川 i 晃. 伊藤. "階層的可視化手法を用いたアソシエーション分析によるプロファイリング". 日本感性工学会, 2011. http://hdl.handle.net/2237/20697.
Pełny tekst źródłaZini, Roger. "Placement, routage conjoints et hierarchiques de reseaux prediffuses". Paris 6, 1987. http://www.theses.fr/1987PA066116.
Pełny tekst źródłaJang, Justin. "Subset selection in hierarchical recursive pattern assemblies and relief feature instancing for modeling geometric patterns". Diss., Georgia Institute of Technology, 2010. http://hdl.handle.net/1853/33821.
Pełny tekst źródłaChang, Ran. "Effective Graph-Based Content--Based Image Retrieval Systems for Large-Scale and Small-Scale Image Databases". DigitalCommons@USU, 2013. https://digitalcommons.usu.edu/etd/2123.
Pełny tekst źródłaCunningham, James. "Efficient, Parameter-Free Online Clustering". The Ohio State University, 2020. http://rave.ohiolink.edu/etdc/view?acc_num=osu1606762403895603.
Pełny tekst źródłaRodríguez, Sánchez Fernando. "Impact of technology readiness in the development of automotive systems when incorporating new styling : a graph theory approach to OPM hierarchical decomposition of the system's architecture". Thesis, Massachusetts Institute of Technology, 2014. http://hdl.handle.net/1721.1/107345.
Pełny tekst źródłaCataloged from PDF version of thesis.
Includes bibliographical references (page 55).
This thesis addresses to find whether technology readiness, while developing a system of new derivative vehicles, has an influence on the time required to design a part that involves styling and engineering activities. For doing so Styling Level and Technology Readiness were identified as independent variables, whereas Styling Iterations and Styling Iterations Time were designated as the dependent variables. In this case, the tools used to confirm correlation among variables were simple and multiple linear regressions. As it will be further detailed, Styling Iterations Time had the highest response to Technology Readiness while the rest of variables had no significant correlation on time duration for Studio and Engineering design activities. Based on hypothesis results and using OPM hierarchical decomposition, relations between processes and objects were analyzed at a given design state in order to evaluate complete matching relying on bipartite graphs and Hall's Marriage theorem. In addition, it was outlined how to identify delayed processes that fail to coexist due to a low technology readiness at a given design state using the Four-Colour theorem and elaborating about the application of chromatic number and polynomials to the OPM system's architecture. The system of interest was the headlamps system developed under Ford Global Product Development System (GPDS) using the Global Exterior Lighting Plan (PDP).
by Fernando Rodríguez Sánchez.
S.M. in Engineering and Management
Randrianasoa, Tianatahina Jimmy Francky. "Représentation d'images hiérarchique multi-critère". Thesis, Reims, 2017. http://www.theses.fr/2017REIMS040/document.
Pełny tekst źródłaSegmentation is a crucial task in image analysis. Novel acquisition devices bring new images with higher resolutions, containing more heterogeneous objects. It becomes also easier to get many images of an area from different sources. This phenomenon is encountered in many domains (e.g. remote sensing, medical imaging) making difficult the use of classical image segmentation methods. Hierarchical segmentation approaches provide solutions to such issues. Particularly, the Binary Partition Tree (BPT) is a hierarchical data-structure modeling an image content at different scales. It is built in a mono-feature way (i.e. one image, one metric) by merging progressively similar connected regions. However, the metric has to be carefully thought by the user and the handling of several images is generally dealt with by gathering multiple information provided by various spectral bands into a single metric. Our first contribution is a generalized framework for the BPT construction in a multi-feature way. It relies on a strategy setting up a consensus between many metrics, allowing us to obtain a unified hierarchical segmentation space. Surprisingly, few works were devoted to the evaluation of hierarchical structures. Our second contribution is a framework for evaluating the quality of BPTs relying both on intrinsic and extrinsic quality analysis based on ground-truth examples. We also discuss about the use of this evaluation framework both for evaluating the quality of a given BPT and for determining which BPT should be built for a given application. Experiments using satellite images emphasize the relevance of the proposed frameworks in the context of image segmentation
Triestino, Michele. "La dynamique des difféomorphismes du cercle selon le point de vue de la mesure". Phd thesis, Ecole normale supérieure de lyon - ENS LYON, 2014. http://tel.archives-ouvertes.fr/tel-01065468.
Pełny tekst źródła