Gotowe bibliografie tematyczne / Graph-based application / Rozprawy doktorskie
Kliknij ten link, aby zobaczyć inne rodzaje publikacji na ten temat: Graph-based application.

Rozprawy doktorskie na temat „Graph-based application”

Autor: Grafiati
Data publikacji: 6 września 2023

Utwórz poprawne odniesienie w stylach APA, MLA, Chicago, Harvard i wielu innych

Wybierz rodzaj źródła:

Sprawdź 50 najlepszych rozpraw doktorskich naukowych na temat „Graph-based application”.

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.

1

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.

Pełny tekst źródła
Streszczenie:
Donat un conjunt d'objectes, el concepte genèric de mediana està de&#64257;nit com l'objecte amb la suma de distàncies a tot el conjunt, més petita. Sovint, aquest concepte és usat per a obtenir el representant del conjunt. <br/>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. <br/>Tot i la seva simple de&#64257;nició i
Style APA, Harvard, Vancouver, ISO itp.
2

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.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
3

Zhu, Ruifeng. "Contribution to graph-based manifold learning with application to image categorization." Thesis, Bourgogne Franche-Comté, 2020. http://www.theses.fr/2020UBFCA015.

Pełny tekst źródła
Streszczenie:
Les algorithmes d'apprentissage de représentation de données à base de graphes sont considérés comme une technique puissante pour l'extraction de caractéristiques et la réduction de dimensionnalité dans les domaines de la reconnaissance de formes, la vision par ordinateur et l'apprentissage automatique. Ces algorithmes utilisent les informations contenues dans les similitudes d’échantillons (par paire) et la matrice du graphe pondéré pour révéler la structure géométrique intrinsèque de données. Ces algorithmes sont capables de récupérer une structure de faible dimension à partir de données de
Style APA, Harvard, Vancouver, ISO itp.
4

Martineau, Maxime. "Deep learning onto graph space : application to image-based insect recognition." Thesis, Tours, 2019. http://www.theses.fr/2019TOUR4024.

Pełny tekst źródła
Streszczenie:
Le but de cette thèse est d'étudier la reconnaissance d'insectes comme un problème de reconnaissance des formes basé images. Bien que ce problème ait été étudié en profondeur au long des trois dernières décennies, un aspect reste selon nous toujours à expérimenter à ce jour : les approches profondes (deep learning). À cet effet, la première contribution de cette thèse consiste à déterminer la faisabilité de l'application des réseaux de neurones convolutifs profonds (CNN) au problème de reconnaissance d'images d'insectes. Les limitations majeures ont les suivantes: les images sont très rares et
Style APA, Harvard, Vancouver, ISO itp.
5

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.

Pełny tekst źródła
Streszczenie:
Thesis (Ph.D)--Electrical and Computer Engineering, Georgia Institute of Technology, 2010.<br>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.
Style APA, Harvard, Vancouver, ISO itp.
6

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.

Pełny tekst źródła
Streszczenie:
The goal of cardiac electrophysiology is to obtain information about the mechanism, function, and performance of the electrical activities of the heart, the identification of deviation from normal pattern and the design of treatments. Offering a better insight into cardiac arrhythmias comprehension and management, signal processing can help the physician to enhance the treatment strategies, in particular in case of atrial fibrillation (AF), a very common atrial arrhythmia which is associated to significant morbidities, such as increased risk of mortality, heart failure, and thromboembolic even
Style APA, Harvard, Vancouver, ISO itp.
7

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.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
8

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.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
9

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.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
10

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.

Pełny tekst źródła
Streszczenie:
La présente thèse concerne l’étude structurelle pour le recouvrement du défaut par l’approche du bond graph. L'objectif est d'exploiter les propriétés structurelles et causales de l'outil bond graph, afin d’effectuer à la fois le diagnostic et l’analyse de la commande du système physique en présence du défaut. En effet, l’outil bond graph permet de vérifier les conditions structurelles de recouvrement de défauts pas seulement du point de vue de l’analyse de commande, mais aussi en considérant les informations issues de l’étape de diagnostic. Par conséquent, l’ensemble des défauts tolérés est o
Style APA, Harvard, Vancouver, ISO itp.
11

Nguyen, Vu ngoc tung. "Analysis of biochemical reaction graph : application to heterotrophic plant cell metabolism." Thesis, Bordeaux, 2015. http://www.theses.fr/2015BORD0023/document.

Pełny tekst źródła
Streszczenie:
Aujourd’hui, la biologie des systèmes est confrontée aux défis de l’analyse de l’énorme quantité de données biologiques et à la taille des réseaux métaboliques pour des analyses à grande échelle. Bien que plusieurs méthodes aient été développées au cours des dernières années pour résoudre ce problème, ce sujet reste un domaine de recherche en plein essor. Cette thèse se concentre sur l’analyse des propriétés structurales, le calcul des modes élémentaires de flux et la détermination d’ensembles de coupe minimales du graphe formé par ces réseaux. Dans notre recherche, nous avons collaboré avec d
Style APA, Harvard, Vancouver, ISO itp.
12

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.

Pełny tekst źródła
Streszczenie:
Le domaine général de la thèse est l’analyse de sensibilité de fonctions boîte noire. L’analyse de sensibilité étudie comment la variation d’une sortie peut être reliée à la variation des entrées. C’est un outil important dans la construction, l’analyse et l’optimisation des expériences numériques (computer experiments).Nous présentons tout d’abord l’indice d’interaction total, qui est utile pour le criblage d’interactions. Plusieurs méthodes d’estimation sont proposées. Leurs propriétés sont étudiées au plan théorique et par des simulations.Le chapitre suivant concerne l’analyse de sensibilit
Style APA, Harvard, Vancouver, ISO itp.
13

Madi, Kamel. "Inexact graph matching : application to 2D and 3D Pattern Recognition." Thesis, Lyon, 2016. http://www.theses.fr/2016LYSE1315/document.

Pełny tekst źródła
Streszczenie:
Les Graphes sont des structures mathématiques puissantes constituant un outil de modélisation universel utilisé dans différents domaines de l'informatique, notamment dans le domaine de la reconnaissance de formes. L'appariement de graphes est l'opération principale dans le processus de la reconnaissance de formes à base de graphes. Dans ce contexte, trouver des solutions d'appariement de graphes, garantissant l'optimalité en termes de précision et de temps de calcul est un problème de recherche difficile et d'actualité. Dans cette thèse, nous nous intéressons à la résolution de ce problème dan
Style APA, Harvard, Vancouver, ISO itp.
14

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/.

Pełny tekst źródła
Streszczenie:
In view of the future diffusion of quantum computers, many of the cryptographic systems currently in use must be rethought. This drastic but concrete preview has led us to reflect on a possible solution based on error correction code theory. In fact, many lines of thought are in agreement with the possibility of using error correctly codes not only for channel encoding, but also for encryption. In 1978 McEliece was the first to propose this idea, at those time not very much considered because with worse performance in the area of cryptography compared to other techniques, but today re-evaluate
Style APA, Harvard, Vancouver, ISO itp.
15

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/.

Pełny tekst źródła
Streszczenie:
In this thesis we propose a novel approach for tracking multiple objects using structural information. The objects are tracked by combining particle filter and frame description with Attributed Relational Graphs (ARGs). We start by learning a structural probabilistic model graph from annotated images. The graphs are then used to evaluate the current tracking state and to correct it, if necessary. By doing so, the proposed method is able to deal with challenging situations such as abrupt motion and tracking loss due to occlusion. The main contribution of this thesis is the exploration of the le
Style APA, Harvard, Vancouver, ISO itp.
16

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.

Pełny tekst źródła
Streszczenie:
<p>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. </p><p>This thesis describes what secret sharing is, the development of a new lab system designed for secret sharing and how it can be used.</p>
Style APA, Harvard, Vancouver, ISO itp.
17

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.

Pełny tekst źródła
Streszczenie:
Pattern discovery in large binary relations has been extensively studied. An emblematic success in this area concerns frequent itemset mining and its post-processing that derives association rules. In this case, we mine binary relations that encode whether some properties are satisfied or not by some objects. It is however clear that many datasets correspond to n-ary relations where n > 2. For example, adding spatial and/or temporal dimensions (location and/or time when the properties are satisfied by the objects) leads to the 4-ary relation Objects x Properties x Places x Times. Therefore, we
Style APA, Harvard, Vancouver, ISO itp.
18

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.

Pełny tekst źródła
Streszczenie:
The thesis presents a new approach to the decomposition of incompletely specified functions and its application to FPGA (Field Programmable Gate Array) mapping. Five methods: Variable Partitioning, Graph Coloring, Bond Set Encoding, CLB Reusing and Local Transformation are developed in order to efficiently perform decomposition and FPGA (Lookup-Table based FPGA) mapping. 1) Variable Partitioning is a high quality hemistic method used to find the "best" partitions, avoiding the very time consuming testing of all possible decomposition charts, which is impractical when there are many input varia
Style APA, Harvard, Vancouver, ISO itp.
19

Wang, Peng. "Historical handwriting representation model dedicated to word spotting application." Thesis, Saint-Etienne, 2014. http://www.theses.fr/2014STET4019/document.

Pełny tekst źródła
Streszczenie:
L’objectif du travail de thèse est de proposer un modèle de représentation des écritures dans les images de documents du patrimoine sans recourir à une transcription des textes. Ce modèle, issu d’une étude très complète des méthodes actuelles de caractérisation des écritures, est à la base d’une proposition de scénario de recherche par similarité de mots, indépendante du scripteur et ne nécessitant pas d’apprentissage. La recherche par similarité proposée repose sur une structure de graphes intégrant des informations sur la topologie, la morphologie locale des mots et sur le contexte extrait d
Style APA, Harvard, Vancouver, ISO itp.
20

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.

Pełny tekst źródła
Streszczenie:
Les travaux présentés dans ce mémoire de thèse abordent sous différents angles très intéressants, un sujet vaste et ambitieux : l’interprétation de plans cadastraux couleurs.Dans ce contexte, notre approche se trouve à la confluence de différentes thématiques de recherche telles que le traitement du signal et des images, la reconnaissance de formes, l’intelligence artificielle et l’ingénierie des connaissances. En effet, si ces domaines scientifiques diffèrent dans leurs fondements, ils sont complémentaires et leurs apports respectifs sont indispensables pour la conception d’un système d’inter
Style APA, Harvard, Vancouver, ISO itp.
21

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.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
22

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.

Pełny tekst źródła
Streszczenie:
Avec le développement récent des technologies 3D, les formes 3D sont devenues un type de données multimédia interactives de première importance. Leur représentation la plus courante, le maillage de polygones, souffre cependant de grande variabilité face à des transformations canoniques préservant la forme. Il est donc nécessaire de concevoir des techniques de modélisation intrinsèque de forme. Dans cette thèse, nous explorons la modélisation topologique par l'étude de structures basées sur les graphes de Reeb. En particulier, nous introduisons une nouvelle abstraction de forme,
Style APA, Harvard, Vancouver, ISO itp.
23

Couprie, Camille. "Graph-based variational optimization and applications in computer vision." Phd thesis, Université Paris-Est, 2011. http://tel.archives-ouvertes.fr/tel-00666878.

Pełny tekst źródła
Streszczenie:
Many computer vision applications such as image filtering, segmentation and stereovision can be formulated as optimization problems. Recently discrete, convex, globally optimal methods have received a lot of attention. Many graph-based methods suffer from metrication artefacts, segmented contours are blocky in areas where contour information is lacking. In the first part of this work, we develop a discrete yet isotropic energy minimization formulation for the continuous maximum flow problem that prevents metrication errors. This new convex formulation leads us to a provably globally optimal so
Style APA, Harvard, Vancouver, ISO itp.
24

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.

Pełny tekst źródła
Streszczenie:
In Shannon’s seminal paper, “A Mathematical Theory of Communication”, he de&#64257;ned ”Channel Capacity” which predicted the ultimate performance that transmission systems can achieve and suggested that capacity is achievable by error-correcting (channel) coding. The main idea of error-correcting codes is to add redundancy to the information to be transmitted so that the receiver can explore the correlation between transmitted information and redundancy and correct or detect errors caused by channels afterward. The discovery of turbo codes and rediscovery of Low Density Parity Check code
Style APA, Harvard, Vancouver, ISO itp.
25

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.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
26

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.

Pełny tekst źródła
Streszczenie:
Finding correspondences between images is a crucial activity in many overlapping fields of research, such as Image Retrieval and Pattern Recognition. Many existing techniques address this problem using local invariant image features, instead of color, shape and texture, that to some degree loose the large scale structure of the image. In this thesis, in order to account for spatial relations among the local invariant features and to improve the image representation, first a graph data structure is introduced, where local features are represented by nodes and spatial relations by edges
Style APA, Harvard, Vancouver, ISO itp.
27

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.

Pełny tekst źródła
Streszczenie:
Les méthodes d’assimilation de données et plus particulièrement les méthodes variationnelles sont mises à profit dans le domaine industriel pour deux grands types d’applications que sont la reconstruction de champ physique et le recalage de paramètres. Une des difficultés de mise en œuvre des algorithmes d’assimilation est que la structure de matrices de covariance d’erreurs, surtout celle d’ébauche, n’est souvent pas ou mal connue. Dans cette thèse, on s’intéresse à la spécification et la localisation de matrices de covariance dans des systèmes multivariés et multidimensionels, et dans un cad
Style APA, Harvard, Vancouver, ISO itp.
28

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.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
29

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.

Pełny tekst źródła
Streszczenie:
Context-aware computing is based on using knowledge about the current context. Interpretation of current context to an understandable knowledge is carried out by reasoning over context and in some cases by matching the current context with the desired context. In this thesis we concentrated on context matching issue in context-aware computing domain. Context matching can be done in various ways like it is done in other matching processes. Our matching approach is best matching in order to generate granular similarity results and not to be limited to Boolean values. We decided to use Ontology a
Style APA, Harvard, Vancouver, ISO itp.
30

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.

Pełny tekst źródła
Streszczenie:
This thesis investigates a fuzzy syntactic approach to the interpretation of noisy two-dimensional images. This approach is based on a modification of the attributed graph grammar formalism to utilise fuzzy membership functions in the applicability predicates. As far as we are aware, this represents the first such modification of graph grammars. Furthermore, we develop a method for programming the resultant fuzzy attributed graph grammars through the use of non-deterministic control diagrams. To do this, we modify the standard programming mechanism to allow it to cope with the fuzzy certainty
Style APA, Harvard, Vancouver, ISO itp.
31

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.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
32

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.

Pełny tekst źródła
Streszczenie:
The conception of turbo codes by Berrou et al. has created a renewed interest in modern graph-based codes. Several encouraging results that have come to light since then have fortified the role these codes shall play as potential solutions for present and future communication problems. This work focuses on both practical and theoretical aspects of graph-based codes. The thesis can be broadly categorized into three parts. The first part of the thesis focuses on the design of practical graph-based codes of short lengths. While both low-density parity-check codes and rateless codes have been sho
Style APA, Harvard, Vancouver, ISO itp.
33

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.

Pełny tekst źródła
Streszczenie:
With the technological advancement in computer science, Geographic Information Science (GIScience), and transportation, more and more complex path finding queries including category based queries are proposed and studied across diverse disciplines. A category based query, such as Optimal Sequenced Routing (OSR) queries and Trip Planning Queries (TPQ), asks for a minimum-cost path that traverses a set of categories with or without a predefined order in a graph. Due to the extensive computing time required to process these complex queries in a large scale environment, efficient algorithms are hi
Style APA, Harvard, Vancouver, ISO itp.
34

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.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
35

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.

Pełny tekst źródła
Streszczenie:
This thesis developed new search engine models that elicit the meaning behind the words found in documents and queries, rather than simply matching keywords. These new models were applied to searching medical records: an area where search is particularly challenging yet can have significant benefits to our society.
Style APA, Harvard, Vancouver, ISO itp.
36

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.

Pełny tekst źródła
Streszczenie:
In this thesis, an Inertia-Capacitance (IC) beam substructure formulation based on bond graph terminology is developed. The IC beam is formulated in the centre of mass body fixed coordinate system which allows for easy interfacing of the IC beam in a multibody system setting. This multibody floating frame approach is also computationally cheaper than nonlinear finite element methods. Elastic deformations in the IC beam are assumed to be small and described by modal superposition. The formulation couples rigid body motions and elastic deformations in a nonlinear fashion. Detailed derivations fo
Style APA, Harvard, Vancouver, ISO itp.
37

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.

Pełny tekst źródła
Streszczenie:
In data intensive applications deployed in enterprise networks, especially applications utilizing peer-to-peer technology, locality is of high importance. Peers should aim to maximize data exchange with other peers where the connectivity is the best. In order to achieve this, locality information must be present which peers can base their decisions on. This information is not trivial to find as there is no readily available global knowledge of which nodes have good connectivity. Having each peer try other peers randomly until it finds good enough partners is costly and lowers the locality of t
Style APA, Harvard, Vancouver, ISO itp.
38

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.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
39

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.

Pełny tekst źródła
Streszczenie:
S tím, jak se neustále vyvíjejí nové technologie pro energeticky náročná průmyslová odvětví, stávající zařízení postupně zaostávají v efektivitě a produktivitě. Tvrdá konkurence na trhu a legislativa v oblasti životního prostředí nutí tato tradiční zařízení k ukončení provozu a k odstavení. Zlepšování procesu a projekty modernizace jsou zásadní v udržování provozních výkonů těchto zařízení. Současné přístupy pro zlepšování procesů jsou hlavně: integrace procesů, optimalizace procesů a intenzifikace procesů. Obecně se v těchto oblastech využívá matematické optimalizace, zkušeností řešitele a pr
Style APA, Harvard, Vancouver, ISO itp.
40

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.

Pełny tekst źródła
Streszczenie:
碩士<br>國立臺灣科技大學<br>資訊工程系<br>95<br>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 t
Style APA, Harvard, Vancouver, ISO itp.
41

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.

Pełny tekst źródła
Streszczenie:
碩士<br>國立臺灣大學<br>電信工程學研究所<br>104<br>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 an
Style APA, Harvard, Vancouver, ISO itp.
42

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.

Pełny tekst źródła
Streszczenie:
碩士<br>國立臺灣大學<br>電子工程學研究所<br>100<br>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
Style APA, Harvard, Vancouver, ISO itp.
43

"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.

Pełny tekst źródła
Streszczenie:
Very large graphs are difficult for a person to browse and edit on a computer screen. This thesis introduces a visual formalism, structured graphs, which supports the scalable browsing and editing of very large graphs. This approach is relevant to a given application when it incorporates a large graph which is composed of named nodes and links, and abstraction hierarchies which can be defined on these nodes and links. A typical browsing operation is the selection of an arbitrary group of nodes and the display of the network of nodes and links for these nodes. Typical editing operations is: add
Style APA, Harvard, Vancouver, ISO itp.
44

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.

Pełny tekst źródła
Streszczenie:
碩士<br>國立暨南國際大學<br>資訊管理學系<br>99<br>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 learni
Style APA, Harvard, Vancouver, ISO itp.
45

Chen, Ｗei-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.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
46

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.

Pełny tekst źródła
Streszczenie:
碩士<br>國立交通大學<br>工業工程與管理系所<br>103<br>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
Style APA, Harvard, Vancouver, ISO itp.
47

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.

Pełny tekst źródła
Streszczenie:
GPGPUs have emerged as high-performance computing platforms and are used for boosting the performance of general non-graphics applications from various scientifi c domains. These applications span varied areas like social networks, defense, bioinformatics, data science, med- ical imaging, uid dynamics, etc [3]. In order to efficiently exploit the computing potential of these accelerators, the application should be well mapped to the underlying architecture. As a result, different characteristics of behaviors can be seen in applications running on GPG- PUs. Applications are characterize
Style APA, Harvard, Vancouver, ISO itp.
48

Lin, Ko-Jui, and 林克叡. "Graph-based Asymmetric Opportunistic Networks with Applications." Thesis, 2014. http://ndltd.ncl.edu.tw/handle/74697114481332384267.

Pełny tekst źródła
Streszczenie:
碩士<br>中華大學<br>資訊工程學系碩士班<br>102<br>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 opportunisti
Style APA, Harvard, Vancouver, ISO itp.
49

"Graph-Based Sparse Learning: Models, Algorithms, and Applications." Doctoral diss., 2014. http://hdl.handle.net/2286/R.I.27437.

Pełny tekst źródła
Streszczenie:
abstract: Sparse learning is a powerful tool to generate models of high-dimensional data with high interpretability, and it has many important applications in areas such as bioinformatics, medical image processing, and computer vision. Recently, the a priori structural information has been shown to be powerful for improving the performance of sparse learning models. A graph is a fundamental way to represent structural information of features. This dissertation focuses on graph-based sparse learning. The first part of this dissertation aims to integrate a graph into sparse learning to improve
Style APA, Harvard, Vancouver, ISO itp.
50

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.

Pełny tekst źródła
Streszczenie:
碩士<br>國立臺灣大學<br>電信工程學研究所<br>101<br>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 s
Style APA, Harvard, Vancouver, ISO itp.
Oferujemy zniżki na wszystkie plany premium dla autorów, których prace zostały uwzględnione w tematycznych zestawieniach literatury. Skontaktuj się z nami, aby uzyskać unikalny kod promocyjny!

Do bibliografii