Дисертації з теми "Graph-based application"
Оформте джерело за APA, MLA, Chicago, Harvard та іншими стилями
Ознайомтеся з топ-50 дисертацій для дослідження на тему "Graph-based application".
Біля кожної праці в переліку літератури доступна кнопка «Додати до бібліографії». Скористайтеся нею – і ми автоматично оформимо бібліографічне посилання на обрану працю в потрібному вам стилі цитування: APA, MLA, «Гарвард», «Чикаго», «Ванкувер» тощо.
Також ви можете завантажити повний текст наукової публікації у форматі «.pdf» та прочитати онлайн анотацію до роботи, якщо відповідні параметри наявні в метаданих.
Переглядайте дисертації для різних дисциплін та оформлюйте правильно вашу бібліографію.
Ferrer, Sumsi Miquel. "Theory and Algorithms on the Median Graph. Application to Graph-based Classification and Clustering." Doctoral thesis, Universitat Autònoma de Barcelona, 2008. http://hdl.handle.net/10803/5788.
Повний текст джерелаEn el reconeixement estructural de patrons, els grafs han estat usats normalment per a representar objectes complexos. En el domini dels grafs, el concepte de mediana és conegut com median graph. Potencialment, té les mateixes aplicacions que el concepte de mediana per poder ser usat com a representant d'un conjunt de grafs.
Tot i la seva simple definició i les potencials aplicacions, s'ha demostrat que el seu càlcul és una tasca extremadament complexa. Tots els algorismes existents només han estat capaços de treballar amb conjunts petits de grafs, i per tant, la seva aplicació ha estat limitada en molts casos a usar dades sintètiques sense significat real. Així, tot i el seu potencial, ha restat com un concepte eminentment teòric.
L'objectiu principal d'aquesta tesi doctoral és el d'investigar a fons la teoria i l'algorísmica relacionada amb el concepte de medinan graph, amb l'objectiu final d'extendre la seva aplicabilitat i lliurar tot el seu potencial al món de les aplicacions reals. Per això, presentem nous resultats teòrics i també nous algorismes per al seu càlcul. Des d'un punt de vista teòric aquesta tesi fa dues aportacions fonamentals. Per una banda, s'introdueix el nou concepte d'spectral median graph. Per altra banda es mostra que certes de les propietats teòriques del median graph poden ser millorades sota determinades condicions. Més enllà de les aportacioncs teòriques, proposem cinc noves alternatives per al seu càlcul. La primera d'elles és una conseqüència directa del concepte d'spectral median graph. Després, basats en les millores de les propietats teòriques, presentem dues alternatives més per a la seva obtenció. Finalment, s'introdueix una nova tècnica per al càlcul del median basat en el mapeig de grafs en espais de vectors, i es proposen dos nous algorismes més.
L'avaluació experimental dels mètodes proposats utilitzant una base de dades semi-artificial (símbols gràfics) i dues amb dades reals (mollècules i pàgines web), mostra que aquests mètodes són molt més eficients que els existents. A més, per primera vegada, hem demostrat que el median graph pot ser un bon representant d'un conjunt d'objectes utilitzant grans quantitats de dades. Hem dut a terme experiments de classificació i clustering que validen aquesta hipòtesi i permeten preveure una pròspera aplicació del median graph a un bon nombre d'algorismes d'aprenentatge.
Given a set of objects, the generic concept of median is defined as the object with the smallest sum of distances to all the objects in the set. It has been often used as a good alternative to obtain a representative of the set.
In structural pattern recognition, graphs are normally used to represent structured objects. In the graph domain, the concept analogous to the median is known as the median graph. By extension, it has the same potential applications as the generic median in order to be used as the representative of a set of graphs.
Despite its simple definition and potential applications, its computation has been shown as an extremely complex task. All the existing algorithms can only deal with small sets of graphs, and its application has been constrained in most cases to the use of synthetic data with no real meaning. Thus, it has mainly remained in the box of the theoretical concepts.
The main objective of this work is to further investigate both the theory and the algorithmic underlying the concept of the median graph with the final objective to extend its applicability and bring all its potential to the world of real applications. To this end, new theory and new algorithms for its computation are reported. From a theoretical point of view, this thesis makes two main contributions. On one hand, the new concept of spectral median graph. On the other hand, we show that some of the existing theoretical properties of the median graph can be improved under some specific conditions. In addition to these theoretical contributions, we propose five new ways to compute the median graph. One of them is a direct consequence of the spectral median graph concept. In addition, we provide two new algorithms based on the new theoretical properties. Finally, we present a novel technique for the median graph computation based on graph embedding into vector spaces. With this technique two more new algorithms are presented.
The experimental evaluation of the proposed methods on one semi-artificial and two real-world datasets, representing graphical symbols, molecules and webpages, shows that these methods are much more ecient than the existing ones. In addition, we have been able to proof for the first time that the median graph can be a good representative of a class in large datasets. We have performed some classification and clustering experiments that validate this hypothesis and permit to foresee a successful application of the median graph to a variety of machine learning algorithms.
Huang, Zan. "GRAPH-BASED ANALYSIS FOR E-COMMERCE RECOMMENDATION." Diss., Tucson, Arizona : University of Arizona, 2005. http://etd.library.arizona.edu/etd/GetFileServlet?file=file:///data1/pdf/etd/azu%5Fetd%5F1167%5F1%5Fm.pdf&type=application/pdf.
Повний текст джерелаZhu, Ruifeng. "Contribution to graph-based manifold learning with application to image categorization." Thesis, Bourgogne Franche-Comté, 2020. http://www.theses.fr/2020UBFCA015.
Повний текст джерелаGraph-based Manifold Learning algorithms are regarded as a powerful technique for feature extraction and dimensionality reduction in Pattern Recogniton, Computer Vision and Machine Learning fields. These algorithms utilize sample information contained in the item-item similarity and weighted matrix to reveal the intrinstic geometric structure of manifold. It exhibits the low dimensional structure in the high dimensional data. This motivates me to develop Graph-based Manifold Learning techniques on Pattern Recognition, specially, application to image categorization. The experimental datasets of thesis correspond to several categories of public image datasets such as face datasets, indoor and outdoor scene datasets, objects datasets and so on. Several approaches are proposed in this thesis: 1) A novel nonlinear method called Flexible Discriminant graph-based Embedding with feature selection (FDEFS) is proposed. We seek a non-linear and a linear representation of the data that can be suitable for generic learning tasks such as classification and clustering. Besides, a byproduct of the proposed embedding framework is the feature selection of the original features, where the estimated linear transformation matrix can be used for feature ranking and selection. 2) We investigate strategies and related algorithms to develop a joint graph-based embedding and an explicit feature weighting for getting a flexible and inductive nonlinear data representation on manifolds. The proposed criterion explicitly estimates the feature weights together with the projected data and the linear transformation such that data smoothness and large margins are achieved in the projection space. Moreover, this chapter introduces a kernel variant of the model in order to get an inductive nonlinear embedding that is close to a real nonlinear subspace for a good approximation of the embedded data. 3) We propose the graph convolution based semi-supervised Embedding (GCSE). It provides a new perspective to non-linear data embedding research, and makes a link to signal processing on graph methods. The proposed method utilizes and exploits graphs in two ways. First, it deploys data smoothness over graphs. Second, its regression model is built on the joint use of the data and their graph in the sense that the regression model works with convolved data. The convolved data are obtained by feature propagation. 4) A flexible deep learning that can overcome the limitations and weaknesses of single-layer learning models is introduced. We call this strategy an Elastic graph-based embedding with deep architecture which deeply explores the structural information of the data. The resulting framework can be used for semi-supervised and supervised settings. Besides, the resulting optimization problems can be solved efficiently
Martineau, Maxime. "Deep learning onto graph space : application to image-based insect recognition." Thesis, Tours, 2019. http://www.theses.fr/2019TOUR4024.
Повний текст джерелаThe goal of this thesis is to investigate insect recognition as an image-based pattern recognition problem. Although this problem has been extensively studied along the previous three decades, an element is to the best of our knowledge still to be experimented as of 2017: deep approaches. Therefore, a contribution is about determining to what extent deep convolutional neural networks (CNNs) can be applied to image-based insect recognition. Graph-based representations and methods have also been tested. Two attempts are presented: The former consists in designing a graph-perceptron classifier and the latter graph-based work in this thesis is on defining convolution on graphs to build graph convolutional neural networks. The last chapter of the thesis deals with applying most of the aforementioned methods to insect image recognition problems. Two datasets are proposed. The first one consists of lab-based images with constant background. The second one is generated by taking a ImageNet subset. This set is composed of field-based images. CNNs with transfer learning are the most successful method applied on these datasets
Kim, Pilho. "E-model event-based graph data model theory and implementation /." Diss., Atlanta, Ga. : Georgia Institute of Technology, 2009. http://hdl.handle.net/1853/29608.
Повний текст джерелаCommittee Chair: Madisetti, Vijay; Committee Member: Jayant, Nikil; Committee Member: Lee, Chin-Hui; Committee Member: Ramachandran, Umakishore; Committee Member: Yalamanchili, Sudhakar. Part of the SMARTech Electronic Thesis and Dissertation Collection.
GRASSI, FRANCESCO. "Statistical and Graph-Based Signal Processing: Fundamental Results and Application to Cardiac Electrophysiology." Doctoral thesis, Politecnico di Torino, 2018. http://hdl.handle.net/11583/2710580.
Повний текст джерелаBush, Stephen J. Baker Erich J. "Automated sequence homology using empirical correlations to create graph-based networks for the elucidation of protein relationships /." Waco, Tex. : Baylor University, 2008. http://hdl.handle.net/2104/5221.
Повний текст джерелаZhu, Xiaoting. "Systematic Assessment of Structural Features-Based Graph Embedding Methods with Application to Biomedical Networks." University of Cincinnati / OhioLINK, 2020. http://rave.ohiolink.edu/etdc/view?acc_num=ucin1592394966493963.
Повний текст джерелаZhang, Yan. "Improving the efficiency of graph-based data mining with application to public health data." Online access for everyone, 2007. http://www.dissertations.wsu.edu/Thesis/Fall2007/y_zhang_112907.pdf.
Повний текст джерелаLoureiro, Rui. "Bond graph model based on structural diagnosability and recoverability analysis : application to intelligent autonomous vehicles." Thesis, Lille 1, 2012. http://www.theses.fr/2012LIL10079/document.
Повний текст джерелаThis work deals with structural fault recoverability analysis using the bond graph model. The objective is to exploit the structural and causal properties of the bond graph tool in order to perform both diagnosis and control analysis in the presence of faults. Indeed, the bond graph tool enables to verify the structural conditions of fault recoverability not only from a control perspective but also from a diagnosis one. In this way, the set of faults that can be recovered is obtained previous to industrial implementation. In addition, a novel way to estimate the fault by a disturbing power furnished to the system, enabled to extend the results of structural fault recoverability by performing a local adaptive compensation directly from the bond graph model. Finally, the obtained structural results are validated on a redundant intelligent autonomous vehicle
Nguyen, Vu ngoc tung. "Analysis of biochemical reaction graph : application to heterotrophic plant cell metabolism." Thesis, Bordeaux, 2015. http://www.theses.fr/2015BORD0023/document.
Повний текст джерелаNowadays, systems biology are facing the challenges of analysing the huge amount of biological data and large-scale metabolic networks. Although several methods have been developed in recent years to solve this problem, it is existing hardness in studying these data and interpreting the obtained results comprehensively. This thesis focuses on analysis of structural properties, computation of elementary flux modes and determination of minimal cut sets of the heterotrophic plant cellmetabolic network. In our research, we have collaborated with biologists to reconstructa mid-size metabolic network of this heterotrophic plant cell. This network contains about 90 nodes and 150 edges. First step, we have done the analysis of structural properties by using graph theory measures, with the aim of finding its owned organisation. The central points orhub reactions found in this step do not explain clearly the network structure. The small-world or scale-free attributes have been investigated, but they do not give more useful information. In the second step, one of the promising analysis methods, named elementary flux modes, givesa large number of solutions, around hundreds of thousands of feasible metabolic pathways that is difficult to handle them manually. In the third step, minimal cut sets computation, a dual approach of elementary flux modes, has been used to enumerate all minimal and unique sets of reactions stopping the feasible pathways found in the previous step. The number of minimal cut sets has a decreasing trend in large-scale networks in the case of growing the network size. We have also combined elementary flux modes analysis and minimal cut sets computation to find the relationship among the two sets of results. The findings reveal the importance of minimal cut sets in use of seeking the hierarchical structure of this network through elementary flux modes. We have set up the circumstance that what will be happened if glucose entry is absent. Bi analysis of small minimal cut sets we have been able to found set of reactions which has to be present to produce the different sugars or metabolites of interest in absence of glucose entry. Minimal cut sets of size 2 have been used to identify 8 reactions which play the role of the skeleton/core of our network. In addition to these first results, by using minimal cut sets of size 3, we have pointed out five reactions as the starting point of creating a new branch in creationof feasible pathways. These 13 reactions create a hierarchical classification of elementary flux modes set. It helps us understanding more clearly the production of metabolites of interest inside the plant cell metabolism
Fruth, Jana. "Sensitivy analysis and graph-based methods for black-box functions with on application to sheet metal forming." Thesis, Saint-Etienne, EMSE, 2015. http://www.theses.fr/2015EMSE0779/document.
Повний текст джерелаThe general field of the thesis is the sensitivity analysis of black-box functions. Sensitivity analysis studies how the variation of the output can be apportioned to the variation of input sources. It is an important tool in the construction, analysis, and optimization of computer experiments.The total interaction index is presented, which can be used for the screening of interactions. Several variance-based estimation methods are suggested. Their properties are analyzed theoretically as well as on simulations.A further chapter concerns the sensitivity analysis for models that can take functions as input variables and return a scalar value as output. A very economical sequential approach is presented, which not only discovers the sensitivity of those functional variables as a whole but identifies relevant regions in the functional domain.As a third concept, support index functions, functions of sensitivity indices over the input distribution support, are suggested.Finally, all three methods are successfully applied in the sensitivity analysis of sheet metal forming models
Madi, Kamel. "Inexact graph matching : application to 2D and 3D Pattern Recognition." Thesis, Lyon, 2016. http://www.theses.fr/2016LYSE1315/document.
Повний текст джерелаGraphs are powerful mathematical modeling tools used in various fields of computer science, in particular, in Pattern Recognition. Graph matching is the main operation in Pattern Recognition using graph-based approach. Finding solutions to the problem of graph matching that ensure optimality in terms of accuracy and time complexity is a difficult research challenge and a topical issue. In this thesis, we investigate the resolution of this problem in two fields: 2D and 3D Pattern Recognition. Firstly, we address the problem of geometric graphs matching and its applications on 2D Pattern Recognition. Kite (archaeological structures) recognition in satellite images is the main application considered in this first part. We present a complete graph based framework for Kite recognition on satellite images. We propose mainly two contributions. The first one is an automatic process transforming Kites from real images into graphs and a process of generating randomly synthetic Kite graphs. This allowing to construct a benchmark of Kite graphs (real and synthetic) structured in different level of deformations. The second contribution in this part, is the proposition of a new graph similarity measure adapted to geometric graphs and consequently for Kite graphs. The proposed approach combines graph invariants with a geometric graph edit distance computation. Secondly, we address the problem of deformable 3D objects recognition, represented by graphs, i.e., triangular tessellations. We propose a new decomposition of triangular tessellations into a set of substructures that we call triangle-stars. Based on this new decomposition, we propose a new algorithm of graph matching to measure the distance between triangular tessellations. The proposed algorithm offers a better measure by assuring a minimum number of triangle-stars covering a larger neighbourhood, and uses a set of descriptors which are invariant or at least oblivious under most common deformations. Finally, we propose a more general graph matching approach founded on a new formalization based on the stable marriage problem. The proposed approach is optimal in term of execution time, i.e. the time complexity is quadratic O(n2) and flexible in term of applicability (2D and 3D). The analyze of the time complexity of the proposed algorithms and the extensive experiments conducted on Kite graph data sets (real and synthetic) and standard data sets (2D and 3D) attest the effectiveness, the high performance and accuracy of the proposed approaches and show that the proposed approaches are extensible and quite general
Bertarelli, Lorenza. "Analysis and simulation of cryptographic techniques based on sparse graph with application to satellite and airborne communication systems." Master's thesis, Alma Mater Studiorum - Università di Bologna, 2018. http://amslaurea.unibo.it/15537/.
Повний текст джерелаMorimitsu, Henrique. "A graph-based approach for online multi-object tracking in structured videos with an application to action recognition." Universidade de São Paulo, 2015. http://www.teses.usp.br/teses/disponiveis/45/45134/tde-13012016-101607/.
Повний текст джерелаNesta tese, uma nova abordagem para o rastreamento de múltiplos objetos com o uso de informação estrutural é proposta. Os objetos são rastreados usando uma combinação de filtro de partículas com descrição das imagens por meio de Grafos Relacionais com Atributos (ARGs). O processo é iniciado a partir do aprendizado de um modelo de grafo estrutural probabilístico utilizando imagens anotadas. Os grafos são usados para avaliar o estado atual do rastreamento e corrigi-lo, se necessário. Desta forma, o método proposto é capaz de lidar com situações desafiadoras como movimento abrupto e perda de rastreamento devido à oclusão. A principal contribuição desta tese é a exploração do modelo estrutural aprendido. Por meio dele, a própria informação estrutural da cena é usada para guiar o processo de detecção em caso de perda do objeto. Tal abordagem difere de trabalhos anteriores, que utilizam informação estrutural apenas para avaliar o estado da cena, mas não a consideram para gerar novas hipóteses de rastreamento. A abordagem proposta é bastante flexível e pode ser aplicada em qualquer situação em que seja possível encontrar padrões de relações estruturais entre os objetos. O rastreamento de objetos pode ser utilizado para diversas aplicações práticas, tais como vigilância, análise de atividades ou navegação autônoma. Nesta tese, ele é explorado para rastrear diversos objetos em vídeos de esporte, na qual as regras do jogo criam alguns padrões estruturais entre os objetos. Além de detectar os objetos, os resultados de rastreamento também são usados como entrada para reconhecer a ação que cada jogador está realizando. Esta etapa é executada classificando um segmento da sequência de rastreamento por meio de Modelos Ocultos de Markov (HMMs). A abordagem de rastreamento proposta é testada em diversos vídeos de jogos de tênis de mesa e na base de dados ACASVA, demonstrando a capacidade do método de lidar com situações de oclusão ou cortes de câmera.
Olsson, Fredrik. "A Lab System for Secret Sharing." Thesis, Linköping University, Department of Electrical Engineering, 2004. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-2385.
Повний текст джерелаFinnegan Lab System is a graphical computer program for learning how secret sharing works. With its focus on the algorithms and the data streams, the user does not have to consider machine-specific low-level details. It is highly modularised and is not restricted to secret sharing, but can easily be extended with new functions, such as building blocks for Feistel networks or signal processing.
This thesis describes what secret sharing is, the development of a new lab system designed for secret sharing and how it can be used.
Nguyen, Thi Kim Ngan. "Generalizing association rules in n-ary relations : application to dynamic graph analysis." Phd thesis, INSA de Lyon, 2012. http://tel.archives-ouvertes.fr/tel-00995132.
Повний текст джерелаWan, Wei. "A New Approach to the Decomposition of Incompletely Specified Functions Based on Graph Coloring and Local Transformation and Its Application to FPGA Mapping." PDXScholar, 1992. https://pdxscholar.library.pdx.edu/open_access_etds/4698.
Повний текст джерелаWang, Peng. "Historical handwriting representation model dedicated to word spotting application." Thesis, Saint-Etienne, 2014. http://www.theses.fr/2014STET4019/document.
Повний текст джерелаAs more and more documents, especially historical handwritten documents, are converted into digitized version for long-term preservation, the demands for efficient information retrieval techniques in such document images are increasing. The objective of this research is to establish an effective representation model for handwriting, especially historical manuscripts. The proposed model is supposed to help the navigation in historical document collections. Specifically speaking, we developed our handwriting representation model with regards to word spotting application. As a specific pattern recognition task, handwritten word spotting faces many challenges such as the high intra-writer and inter-writer variability. Nowadays, it has been admitted that OCR techniques are unsuccessful in handwritten offline documents, especially historical ones. Therefore, the particular characterization and comparison methods dedicated to handwritten word spotting are strongly required. In this work, we explore several techniques that allow the retrieval of singlestyle handwritten document images with query image. The proposed representation model contains two facets of handwriting, morphology and topology. Based on the skeleton of handwriting, graphs are constructed with the structural points as the vertexes and the strokes as the edges. By signing the Shape Context descriptor as the label of vertex, the contextual information of handwriting is also integrated. Moreover, we develop a coarse-to-fine system for the large-scale handwritten word spotting using our representation model. In the coarse selection, graph embedding is adapted with consideration of simple and fast computation. With selected regions of interest, in the fine selection, a specific similarity measure based on graph edit distance is designed. Regarding the importance of the order of handwriting, dynamic time warping assignment with block merging is added. The experimental results using benchmark handwriting datasets demonstrate the power of the proposed representation model and the efficiency of the developed word spotting approach. The main contribution of this work is the proposed graph-based representation model, which realizes a comprehensive description of handwriting, especially historical script. Our structure-based model captures the essential characteristics of handwriting without redundancy, and meanwhile is robust to the intra-variation of handwriting and specific noises. With additional experiments, we have also proved the potential of the proposed representation model in other symbol recognition applications, such as handwritten musical and architectural classification
Raveaux, Romain. "Fouille de graphes et classification de graphes : application à l’analyse de plans cadastraux." Thesis, La Rochelle, 2010. http://www.theses.fr/2010LAROS311/document.
Повний текст джерелаThis thesis tackles the problem of technical document interpretationapplied to ancient and colored cadastral maps. This subject is on the crossroadof different fields like signal or image processing, pattern recognition, artificial intelligence,man-machine interaction and knowledge engineering. Indeed, each of thesedifferent fields can contribute to build a reliable and efficient document interpretationdevice. This thesis points out the necessities and importance of dedicatedservices oriented to historical documents and a related project named ALPAGE.Subsequently, the main focus of this work: Content-Based Map Retrieval within anancient collection of color cadastral maps is introduced
Raymond, John W. "Applications of graph-based similarity in cheminformatics." Thesis, University of Sheffield, 2002. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.251413.
Повний текст джерелаTierny, Julien. "Reeb graph based 3D shape modeling and applications." Phd thesis, Université des Sciences et Technologie de Lille - Lille I, 2008. http://tel.archives-ouvertes.fr/tel-00838246.
Повний текст джерелаCouprie, Camille. "Graph-based variational optimization and applications in computer vision." Phd thesis, Université Paris-Est, 2011. http://tel.archives-ouvertes.fr/tel-00666878.
Повний текст джерелаLan, Ching Fu. "Design techniques for graph-based error-correcting codes and their applications." Texas A&M University, 2004. http://hdl.handle.net/1969.1/3329.
Повний текст джерелаPoudel, Prabesh. "Security Vetting Of Android Applications Using Graph Based Deep Learning Approaches." Bowling Green State University / OhioLINK, 2021. http://rave.ohiolink.edu/etdc/view?acc_num=bgsu1617199500076786.
Повний текст джерелаMANZO, MARIO. "ATTRIBUTED RELATIONAL SIFT-BASED REGIONS GRAPH (ARSRG):DESCRIPTION, MATCHING AND APPLICATIONS." Doctoral thesis, Università degli Studi di Milano, 2014. http://hdl.handle.net/2434/233320.
Повний текст джерелаCheng, Sibo. "Error covariance specification and localization in data assimilation with industrial application Background error covariance iterative updating with invariant observation measures for data assimilation A graph clustering approach to localization for adaptive covariance tuning in data assimilation based on state-observation mapping Error covariance tuning in variational data assimilation: application to an operating hydrological model." Thesis, université Paris-Saclay, 2020. http://www.theses.fr/2020UPAST067.
Повний текст джерелаData assimilation techniques are widely applied in industrial problems of field reconstruction or parameter identification. The error covariance matrices, especially the background matrix in data assimilation are often difficult to specify. In this thesis, we are interested in the specification and localization of covariance matrices in multivariate and multidimensional systems in an industrial context. We propose to improve the covariance specification by iterative processes. Hence, we developed two new iterative methods for background matrix recognition. The power of these methods is demonstrated numerically in twin experiments with independent errors or relative to true states. We then propose a new concept of localization and applied it for error covariance tuning. Instead of relying on spatial distance, this localization is established purely on links between state variables and observations. Finally, we apply these new approaches, together with other classical methods for comparison, to a multivariate hydrological model. Variational assimilation is implemented to correct the observed precipitation in order to obtain a better river flow forecast
Streib, Kevin. "IMPROVED GRAPH-BASED CLUSTERING WITH APPLICATIONS IN COMPUTER VISION AND BEHAVIOR ANALYSIS." The Ohio State University, 2012. http://rave.ohiolink.edu/etdc/view?acc_num=osu1331063343.
Повний текст джерелаKoushaeian, Reza. "An Ontology And Conceptual Graph Based Best Matching Algorithm For Context-aware Applications." Master's thesis, METU, 2011. http://etd.lib.metu.edu.tr/upload/12613216/index.pdf.
Повний текст джерелаWatkins, Gregory Shroll. "A framework for interpreting noisy, two-dimensional images, based on a fuzzification of programmed, attributed graph grammars." Thesis, Rhodes University, 1998. http://hdl.handle.net/10962/d1004862.
Повний текст джерелаTESFAYE, YONATAN TARIKU. "Applications of a graph theoretic based clustering framework in computer vision and pattern recognition." Doctoral thesis, Università IUAV di Venezia, 2018. http://hdl.handle.net/11578/282321.
Повний текст джерелаVellambi, Badri Narayanan. "Applications of graph-based codes in networks: analysis of capacity and design of improved algorithms." Diss., Georgia Institute of Technology, 2008. http://hdl.handle.net/1853/37091.
Повний текст джерелаLu, Qifeng. "Bivariate Best First Searches to Process Category Based Queries in a Graph for Trip Planning Applications in Transportation." Diss., Virginia Tech, 2009. http://hdl.handle.net/10919/26444.
Повний текст джерелаPh. D.
Ali, Ismael Ali. "Using and Improving Computational Cognitive Models for Graph-Based Semantic Learning and Representation from Unstructured Text with Applications." Kent State University / OhioLINK, 2018. http://rave.ohiolink.edu/etdc/view?acc_num=kent1524217759138453.
Повний текст джерелаKoopman, Bevan Raymond. "Semantic search as inference : applications in health informatics." Thesis, Queensland University of Technology, 2014. https://eprints.qut.edu.au/71385/1/Bevan_Koopman_Thesis.pdf.
Повний текст джерелаXing, Yihan. "An inertia-capacitance beam substructure formulation based on bond graph terminology with applications to rotating beam and wind turbine rotor blades." Thesis, Norges teknisk-naturvitenskapelige universitet, Institutt for marin teknikk, 2010. http://urn.kb.se/resolve?urn=urn:nbn:no:ntnu:diva-11637.
Повний текст джерелаBodvill, Jonatan. "Enterprise network topology discovery based on end-to-end metrics : Logical site discovery in enterprise networks based on application level measurements in peer- to-peer systems." Thesis, KTH, Skolan för informations- och kommunikationsteknik (ICT), 2017. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-227803.
Повний текст джерелаI dataintensiva applikationer i företagsnätverk, speciellt applikationer som använder sig av peer-to-peer teknologi, är lokalitet viktigt. Klienter bör försöka maximera datautbyte med andra klienter där nätverkskopplingen är som bäst. För att klienterna ska kunna göra sådana val måste information om vilka klienter som befinner sig vara vara tillgänglig som klienterna kan basera sina val på. Denna information är inte trivial att framställa då det inte finns någon färdig global information om vilka klienter som har bra uppkoppling med andra klienter och att låta varje klient prova sig fram blint tills de hittar de bästa partnerna är kostsamt och sänker applikationens lokalitet innan den konvergerar. I denna rapport presenteras en lösning som skapar en logisk vy över ett peer-to-peer nätverk, vilken grupperar klienter i kluster baserat på deras uppkopplingskvalitet. Denna vy kan sedan användas för att förbättra lokaliteten i peerto-peer applikationen. En grafmodell av systemet skapas, där klienter modelleras som hörn och kopplingar mellan klienter modelleras som kanter med en vikt i relation till uppkopplingskvaliteten. Problemet formuleras sedan som ett riktat grafklusterproblem vilket är ett väldokumenterat forskningsområde med mycket arbete publicerat kring. De mest framstående grafklusteralgoritmerna är sedan studerade, utvalda baserat på kravspecifikationer, optimerade för det aktuella problemet och implementerade. Resultaten som produceras av att algoritmerna körs på strömdata är evaluerade mot känd information. Resultaten visar att oövervakade grafklusteralgoritmer skapar användbar information kring nätverkens uppkopplingsstruktur och kan användas i peer-to-peerapplikationssammanhang för att hitta de bästa partnerna att utbyta data med.
Singh, Saurabh. "Characterizing applications by integrating andimproving tools for data locality analysis and programperformance." The Ohio State University, 2017. http://rave.ohiolink.edu/etdc/view?acc_num=osu1492741656429829.
Повний текст джерелаTeng, Sin Yong. "Intelligent Energy-Savings and Process Improvement Strategies in Energy-Intensive Industries." Doctoral thesis, Vysoké učení technické v Brně. Fakulta strojního inženýrství, 2020. http://www.nusl.cz/ntk/nusl-433427.
Повний текст джерелаHon, Tze-lap, and 韓子立. "Dynamic Graph-Based Software Watermarking – CT Algorithm: Analysis, Improvement and Application in Java." Thesis, 2006. http://ndltd.ncl.edu.tw/handle/35083753207335613295.
Повний текст джерела國立臺灣科技大學
資訊工程系
95
Software watermarking is an important technique that enables the protection of programs and intellectual property rights. In this thesis, we discuss the development of software watermarks and the problems involved in dynamic graph-based software watermarking when applying CT algorithm is applied to Java technology. Because Java differs from traditional programming languages, we use the object-oriented analysis and design approach to solve these problems. By embedding watermarks into the input sequences on objects with strong relation, we can prevent watermark tempering. Our experimental results demonstrate that our approach not only effectively increases the difficulty and time required to tamper watermarks but also reduces memory usage and the resources required for loading these watermarks.
Hung, Pei-Hsuan, and 洪培軒. "Downsampling of Graph Signals and Object Detection Application Using Fast Region-based Convolutional Networks." Thesis, 2016. http://ndltd.ncl.edu.tw/handle/54802948944695108964.
Повний текст джерела國立臺灣大學
電信工程學研究所
104
This thesis consists of two sections. In the first section, we study the downsampling methods for graph signals. Graph Signal Processing is an emerging field of signal processing for us to analysis irregular structure signals and becomes more and more significant in these days. The operations on these datasets as graph signals have been subjects to many recent studies, especially for basic signal operations such as shifting, modulating, and down-sampling. However, the sizes of the graphs in the applications can be very large and lead a lot of computational and technical challenges for the purpose of storage or analysis. To compress these datasets on graphs more effectively, we propose a pre-filtering classifier can selectively downsample signals and also consider the distribution of the signals on graphs. As compared to the other methods, such as color-based methods and topology-based methods, our proposed method can achieve better performance in terms of higher SNR. Moreover, our method can be processed efficiently and efficacy in terms of shorter computing-time and fewer vertices in use during compression. The second section of this thesis talks about how to use Fast Regions with Convolutional Neural Network (Fast R-CNN) to develop some object detection applications from the building of the environment including the setup of GPU and the platform of parallel computing to the process of training and testing in fast R-CNN algorithm. By using region-based convolutional neural networks, the correctness of object detection has a large progress in recent years, and fast R-CNN algorithm helps us to achieve near real-time rates when using very deep networks. To realize this efficient and powerful method more, some applications based on it are also proposed. Further, a machine learning technique is also applied to graph signal processing.
Chuang, Yu-Hsuan, and 莊育瑄. "Design and Implementation of Social Application for Elderly Care Based on Open Graph Protocol." Thesis, 2012. http://ndltd.ncl.edu.tw/handle/40106388707820215009.
Повний текст джерела國立臺灣大學
電子工程學研究所
100
Social Network Service (SNS) characterized by Facebook and Twitter has become the next generation paradigm of obtaining data, information and knowledge on the web. With the growth of the aged population, more and more elderly people also hope to share their feelings, videos, and photos and get more opportunities to interact with their families and friends through the community network. However, it is quite hard for the elderly people who have little knowledge about the network to learn to use the community network with complex operating functions. The aim of this paper is to develop a set of social network software exclusively for the elderly people, customize Graphic User Interface (GUI), support voice input and output and simplify it as an application service mainly for the major functions. Furthermore, our key observation is that propose innovative mechanism of elderly social network based on Open Graph Protocol (OGP) and provide more related information favored by more elderly users, including the third-party services and various applications and websites to make the community network services focus on the user’s association with people and things. The future network application services will be full of individualized experiences, which will also be applied to community network for elderly people, to make the user benefit from the social network at any place.
"Structured graphs: a visual formalism for scalable graph based tools and its application to software structured analysis." University of Technology, Sydney. School of Computing Sciences, 1996. http://hdl.handle.net/2100/296.
Повний текст джерелаChung, Wei-Shih, and 鍾維時. "Application of Two Phases Model Based on Directed Acyclic Graph Relevance Vector Machine for Multi-Class Credit Rating Problems." Thesis, 2011. http://ndltd.ncl.edu.tw/handle/20427235240370726030.
Повний текст джерела國立暨南國際大學
資訊管理學系
99
Over the past decades, the corporate credit rating status has been extensively studied by researchers in turbulent economic environment; the ratings performances have the potential impact on bank decision-making. Traditional corporate credit rating models are employed statistical methods to estimate rating status, but the model established by statistical methods in dealing with increasingly complex data is not perform a satisfactory job. Nowadays, some researchers began to use machine learning techniques to cope with the related problem, and the machine learning approach would not satisfy strict statistical limitation. In this paper, we applied Relevance Vector Machine (RVM) and Directed Acyclic Graph (DAG) methods to deal with multi-class classification (namely DAGRVM) and the subsequent experimental results could give a reference for banker to make suitable financial granting. To overcome the opaque nature of RVM, the investigation utilized Rough Set Theory (RST) to derive intuitive decision rule from RVM. The comprehensive decision rule would enhance the practical application. Therefore, the experimental results show that the DAGRVM method is an effective technique for the classification of credit rating, and it can obtain better classification accuracy (88%) than the Directed Acyclic Graph Support Vector Machine (DAGSVM). Moreover, the rules extracted by RVs model can be effectively used as a reference for enterprises.
Chen, Wei-An, and 陳韋安. "Harmony Graph, a Social-Network Based Model for Symbolic Music Content, and its Application to Music Visualization and Genre Classification." Thesis, 2011. http://ndltd.ncl.edu.tw/handle/01915270528749095540.
Повний текст джерелаWu, Sheng-Feng, and 吳聲鋒. "Incorporating Centrality-based Plane Graph Drawing and Force-directed Method to Visualize Small-World Graphs and its Application to Semiconductor Wafer Fabrication." Thesis, 2015. http://ndltd.ncl.edu.tw/handle/24v6m5.
Повний текст джерела國立交通大學
工業工程與管理系所
103
Analysis of large and complex network graphs has been an important issue. Small-world network is a special type of those complex network graphs. The structure of this type of graphs cannot be effectively recognized by conventional graph drawing algorithms, such that it is difficult to identify and analyze the network. To solve this problem, this paper proposes a visualization approach, which utilizes centrality to remove some links between nodes, then uses a plane graph drawing method to lay out the reduced subgraph without any edge crossing, then applies a force-directed graph drawing method based on node-edge repulsion to improve the layout, finally adds back the remaining links. On experimental analysis, our results can not only analyze the same information with previous methods, but successfully gain more useful information. It lets us have a better understanding for the relationship between nodes and search out some messages that were never found before. Application of this approach to semiconductor wafer fabrication example is demonstrated.
Morkhande, Rahul Raj Kumar. "Characterization of Divergence resulting from Workload, Memory and Control-Flow behavior in GPGPU Applications." Thesis, 2018. https://etd.iisc.ac.in/handle/2005/5453.
Повний текст джерелаLin, Ko-Jui, and 林克叡. "Graph-based Asymmetric Opportunistic Networks with Applications." Thesis, 2014. http://ndltd.ncl.edu.tw/handle/74697114481332384267.
Повний текст джерела中華大學
資訊工程學系碩士班
102
Opportunistic network is an unreliable network architecture, and each mobile device can only directly communicate within the mobile devices which are within the communication range. Previous results usually assume that mobile devices in opportunistic network can move in an area without obstacle, but this condition seems unrealistic because many space may exist obstacles such as sky area, ocean area etc. In this thesis, we proposed a graph-based asymmetric opportunistic network, which is more appropriate to real applications. Graph based asymmetric opportunistic network also emphasized that the popular place in a deployed area has higher road usage rate than other. This thesis also discusses how to deploy a fixed number of information exchange stations to enhance the packet delivery ratio and delay time of a given graph based asymmetric opportunistic network. We define a mobility model by using the graph technique, and use this model to find out where to locate an information exchange station. Finally, we also demonstrate the contribution of the proposed ideas by conducting simulations in a bicycle asymmetric opportunistic network.
"Graph-Based Sparse Learning: Models, Algorithms, and Applications." Doctoral diss., 2014. http://hdl.handle.net/2286/R.I.27437.
Повний текст джерелаDissertation/Thesis
Doctoral Dissertation Computer Science 2014
Hsu, Chi-Yu, and 胥吉友. "Improved Image Segmentation Techniques Based on Superpixels and Graph Theory with Applications of Saliency Detection." Thesis, 2013. http://ndltd.ncl.edu.tw/handle/40870211370266280310.
Повний текст джерела國立臺灣大學
電信工程學研究所
101
Image segmentation is a fundamental problem in computer vision and image processing. Though this topic has been researched for many years, it is still a challenging task. Recently, the researches of superpixels have great improvement. This new technique makes the traditional segmentation algorithms more efficient and has better performances. On the other hand, the saliency detection is another new topic of image processing and its performance usually closely related to the segmentation techniques we used. In this thesis, we propose two algorithms for image segmentation and saliency detection, respectively. For image segmentation, an effective graph-based image segmentation algorithm using the superpixel-based graph representation is introduced. The techniques of SLIC superpixels, 5-D spectral clustering, and boundary-focused region merging are adopted in the proposed algorithm. With SLIC superpixels, the original image segmentation problem is transformed into the superpixel labeling problem. It makes the proposed algorithm more efficient than pixel-based segmentation algorithms. With the proposed methods of 5-D spectral clustering and boundary-focused region merging, the position information is considered for clustering and the threshold for region merging can be adaptive. These techniques make the segmentation result more consistent with human perception. The simulations on the Berkeley segmentation database show that our proposed method outperforms state-of-the-art methods. For saliency detection, a very effective saliency detection algorithm is proposed. Our algorithm is mainly based on two new techniques. First, the discrete cosine transform (DCT) is used for constructing the block-wise saliency map. Then, the superpixel-based segmentation is applied. Since DCT coefficients can reflect the color features of each block in the frequency domain and superpixels can well preserve object boundaries, with these two techniques, the performance of saliency detection can be significantly improved. The simulations performed on a database of 1000 images with human-marked ground truths show that our proposed method can extract the salient region very accurately and outperforms all of the existing saliency detection methods.