Log in

Relevant bibliographies by topics / Graph dynamics / Dissertations / Theses

To see the other types of publications on this topic, follow the link: Graph dynamics.

Dissertations / Theses on the topic 'Graph dynamics'

Author: Grafiati

Published: 25 May 2024

Last updated: 25 July 2025

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the top 50 dissertations / theses for your research on the topic 'Graph dynamics.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Browse dissertations / theses on a wide variety of disciplines and organise your bibliography correctly.

1

Ribeiro, Andre Figueiredo. "Graph dynamics : learning and representation." Thesis, Massachusetts Institute of Technology, 2006. http://hdl.handle.net/1721.1/34184.

Full text

Abstract:

Thesis (S.M.)--Massachusetts Institute of Technology, School of Architecture and Planning, Program in Media Arts and Sciences, 2006.<br>Includes bibliographical references (p. 58-60).<br>Graphs are often used in artificial intelligence as means for symbolic knowledge representation. A graph is nothing more than a collection of symbols connected to each other in some fashion. For example, in computer vision a graph with five nodes and some edges can represent a table - where nodes correspond to particular shape descriptors for legs and a top, and edges to particular spatial relations. As a fram

APA, Harvard, Vancouver, ISO, and other styles

2

Kuhlman, Christopher James. "Generalizations of Threshold Graph Dynamical Systems." Thesis, Virginia Tech, 2013. http://hdl.handle.net/10919/76765.

Full text

Abstract:

Dynamics of social processes in populations, such as the spread of emotions, influence, language, mass movements, and warfare (often referred to individually and collectively as contagions), are increasingly studied because of their social, political, and economic impacts. Discrete dynamical systems (discrete in time and discrete in agent states) are often used to quantify contagion propagation in populations that are cast as graphs, where vertices represent agents and edges represent agent interactions. We refer to such formulations as graph dynamical systems. For social applications, thresho

APA, Harvard, Vancouver, ISO, and other styles

3

Arnlind, Joakim. "Graph Techniques for Matrix Equations and Eigenvalue Dynamics." Doctoral thesis, KTH, Matematik (Inst.), 2008. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-4608.

Full text

Abstract:

One way to construct noncommutative analogues of a Riemannian manifold Σ is to make use of the Toeplitz quantization procedure. In Paper III and IV, we construct C-algebras for a continuously deformable class of spheres and tori, and by introducing the directed graph of a representation, we can completely characterize the representation theory of these algebras in terms of the corresponding graphs. It turns out that the irreducible representations are indexed by the periodic orbits and N-strings of an iterated map s:(reals) 2→(reals)2 associated to the algebra. As our construction allows for t

APA, Harvard, Vancouver, ISO, and other styles

4

Ayazifar, Babak 1967. "Graph spectra and modal dynamics of oscillatory networks." Thesis, Massachusetts Institute of Technology, 2002. http://hdl.handle.net/1721.1/16913.

Full text

Abstract:

Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, February 2003.<br>Includes bibliographical references (leaves 186-191).<br>This electronic version was submitted by the student author. The certified thesis is available in the Institute Archives and Special Collections.<br>Our research focuses on developing design-oriented analytical tools that enable us to better understand how a network comprising dynamic and static elements behaves when it is set in oscillatory motion, and how the interconnection topology relates to the spectral p

APA, Harvard, Vancouver, ISO, and other styles

5

Homer, Martin Edward. "Bifurcations and dynamics of piecewise smooth dynamical systems of arbitrary dimension." Thesis, University of Bristol, 1999. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.299271.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

Lee, Daryl Hsu Ann. "Toward large-graph comparison measures to understand Internet topology dynamics." Thesis, Monterey, California: Naval Postgraduate School, 2013. http://hdl.handle.net/10945/37658.

Full text

Abstract:

Approved for public release; distribution is unlimited<br>By measuring network changes, we can get a better understanding of a network. Extending this to the Internet, we are able to understand the constantly occuring changes on an international scale. In this research, we propose a measure that conveys the relative magnitude of the change between two networks (i.e., Internet topology). The measure is normalised and intuitively gives an indication of whether the change is small or large. We start off by applying this measure to standard common graphs, as well as random graphs. These graphs we

APA, Harvard, Vancouver, ISO, and other styles

7

Giscard, Pierre-Louis. "A graph theoretic approach to matrix functions and quantum dynamics." Thesis, University of Oxford, 2014. http://ora.ox.ac.uk/objects/uuid:ceef15b0-eed2-4615-a9f2-f9efbef470c9.

Full text

Abstract:

Many problems in applied mathematics and physics are formulated most naturally in terms of matrices, and can be solved by computing functions of these matrices. For example, in quantum mechanics, the coherent dynamics of physical systems is described by the matrix exponential of their Hamiltonian. In state of the art experiments, one can now observe such unitary evolution of many-body systems, which is of fundamental interest in the study of many-body quantum phenomena. On the other hand the theoretical simulation of such non-equilibrium many-body dynamics is very challenging. In this thesis,

APA, Harvard, Vancouver, ISO, and other styles

8

Ayala-Hoffmann, Jose. "Global behavior of graph dynamics with applications to Markov chains." [Ames, Iowa : Iowa State University], 2008.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

9

Magkakis, Andreas Gkompel. "Counting, modular counting and graph homomorphisms." Thesis, University of Oxford, 2016. https://ora.ox.ac.uk/objects/uuid:42be90cd-75b5-43ec-ad2e-5d513420bdc0.

Full text

Abstract:

A homomorphism from a graph G to a graph H is a function from V (G) to V (H) that preserves edges. Many combinatorial structures that arise in mathematics and in computer science can be represented naturally as graph homomorphisms and as weighted sums of graph homomorphisms. In this thesis we study the complexity of various problems related to graph homomorphisms.

APA, Harvard, Vancouver, ISO, and other styles

10

Budai, Daniel, and David Jallo. "The Market Graph : A study of its characteristics, structure & dynamics." Thesis, KTH, Matematisk statistik, 2011. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-103094.

Full text

Abstract:

In this thesis we have considered three different market graphs; one solely based on stock returns, another one based on stock returns with vertices weighted with a liquidity measure and lastly one based on correlations of volume fluctuations. Research is conducted on two different markets; the Swedish and the American stock market. We want to introduce graph theory as a method for representing the stock market in order to show that one can more fully understand the structural properties and dynamics of the stock market by studying the market graph. We found many signs of increased globalizati

APA, Harvard, Vancouver, ISO, and other styles

11

Christofides, Alexander. "Graph theory for financial dynamics and option pricing in imperfect markets." Thesis, Imperial College London, 1998. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.299250.

Full text

APA, Harvard, Vancouver, ISO, and other styles

12

Shi, Pengfei. "Flexible multibody dynamics, a new approach using virtual work and graph theory." Thesis, National Library of Canada = Bibliothèque nationale du Canada, 1998. http://www.collectionscanada.ca/obj/s4/f2/dsk2/tape17/PQDD_0008/NQ32856.pdf.

Full text

APA, Harvard, Vancouver, ISO, and other styles

13

Alsahafy, Maram Saad M. "Efficient Algorithms for Speeding Up Graph Data Analytics." Thesis, The University of Sydney, 2021. https://hdl.handle.net/2123/26166.

Full text

Abstract:

Graph model has been playing an important role in analyzing the data from real applications such as social networks, communication networks, and information networks. It models entities of the applications as vertices/nodes in the graph, and models relationships among the entities as edges between vertices in the graph. In recent years there has been an increasing number of studies of complex graph analysis coinciding with the rapid development of information technologies, such as online social networks and (mobile/email) communication networks. Due to the growing sizes of these graph data,

APA, Harvard, Vancouver, ISO, and other styles

14

Juher, Barrot David. "Set of periods, topological entropy and combinatorial dynamics for tree and graph maps." Doctoral thesis, Universitat Autònoma de Barcelona, 2003. http://hdl.handle.net/10803/3078.

Full text

Abstract:

La tesi versa sobre sistemes dinàmics discrets 1-dimensionals, des d'un punt de vista combinatori i topològic. Estem interessats en les òrbites periòdiques i l'entropia topològica de les aplicacions contínues definides en arbres i grafs.<br/>El problema central és la caracterització del conjunt de períodes de totes les òrbites periòdiques d'una aplicació contínua d'un arbre en ell mateix. El teorema de Sharkovskii (1964) fou el primer resultat remarcable en aquest sentit. Aquest bonic teorema estableix que el conjunt de períodes d'una aplicació de l'interval és un segment inicial d'un ordre li

APA, Harvard, Vancouver, ISO, and other styles

15

Nath, Madhurima. "Application of Network Reliability to Analyze Diffusive Processes on Graph Dynamical Systems." Diss., Virginia Tech, 2019. http://hdl.handle.net/10919/86841.

Full text

Abstract:

Moore and Shannon's reliability polynomial can be used as a global statistic to explore the behavior of diffusive processes on a graph dynamical system representing a finite sized interacting system. It depends on both the network topology and the dynamics of the process and gives the probability that the system has a particular desired property. Due to the complexity involved in evaluating the exact network reliability, the problem has been classified as a NP-hard problem. The estimation of the reliability polynomials for large graphs is feasible using Monte Carlo simulations. However, the nu

APA, Harvard, Vancouver, ISO, and other styles

16

Johnson, Tina V. "The Influence of Social Network Graph Structure on Disease Dynamics in a Simulated Environment." Thesis, University of North Texas, 2010. https://digital.library.unt.edu/ark:/67531/metadc33173/.

Full text

Abstract:

The fight against epidemics/pandemics is one of man versus nature. Technological advances have not only improved existing methods for monitoring and controlling disease outbreaks, but have also provided new means for investigation, such as through modeling and simulation. This dissertation explores the relationship between social structure and disease dynamics. Social structures are modeled as graphs, and outbreaks are simulated based on a well-recognized standard, the susceptible-infectious-removed (SIR) paradigm. Two independent, but related, studies are presented. The first involves me

APA, Harvard, Vancouver, ISO, and other styles

17

Hindersin, Laura [Verfasser]. "The effect of graph structure on the dynamics of a stochastic evolutionary process / Laura Hindersin." Lübeck : Zentrale Hochschulbibliothek Lübeck, 2018. http://d-nb.info/1162227826/34.

Full text

APA, Harvard, Vancouver, ISO, and other styles

18

Lan, Bradley Weichi. "Control of rigid formations for agents with passive nonlinear dynamics." Thesis, University of Iowa, 2016. https://ir.uiowa.edu/etd/2106.

Full text

Abstract:

This thesis concerns the decentralized formation shape control of a set of homogeneous agents in the plane whose actuation dynamics are nonlinear and passive. The formation shape is specified by a subset of interagent distances. The formation is modeled as an undirected graph, with vertices representing the agents. An edge exists between two vertices if the specification provides the distance between them. Enough distances are assumed to have been specified to make the underlying graph rigid. Each agent executes its contro

APA, Harvard, Vancouver, ISO, and other styles

19

Noharet, Léo, and Anton Fu. "Using simulated dynamics and graph metrics to compare brain networks of MCI patients and healthy control subjects." Thesis, KTH, Skolan för elektroteknik och datavetenskap (EECS), 2021. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-301839.

Full text

Abstract:

In recent years, several different methods have been proposed to compare brain networks with the joint use of graph theory and graph metrics. Another relatively unexplored comparison method is comparing the brain’s response to various input signals by simulating the brain’s dynamics. The brain activity signals are dependent on the physical connectivity patterns of the brain, therefore brain activity signals can be studied in addition to the study of connectivity patterns of brain graphs. Thus, in this study we use both static graph metrics and the dynamics of the brain to compare the brain net

APA, Harvard, Vancouver, ISO, and other styles

20

Ramírez, Mahaluf Juan Pablo. "The dynamics of emotional and cognitive networks: Graph-based analysis of brain networks using fMRI and theoretical model for cingulo-frontal network dynamics in major depression." Doctoral thesis, Universitat de Barcelona, 2015. http://hdl.handle.net/10803/311623.

Full text

Abstract:

This thesis is composed of two complementary projects. One focuses on the study of the dynamics between emotional and cognitive networks in healthy subjects using functional magnetic resonance imaging (fMRI). The second project builds on the results obtained in healthy subjects to formulate a computational model of the physiopathology and treatment mechanisms in major depression disorder (MDD). 1. Graph-based analysis on the emotional-cognitive demands The regulation of cognitive and emotional processes is critical for diverse functions such as attention, problem solving, error detection

APA, Harvard, Vancouver, ISO, and other styles

21

Leger, Mathieu Serge. "Automated Selection of Modelling Coordinates for Forward Dynamic Analysis of Multibody Systems." Thesis, University of Waterloo, 2006. http://hdl.handle.net/10012/2871.

Full text

Abstract:

Modelling mechanical systems using symbolic equations can provide many advantages over the more widely-used numerical methods of modelling these systems. The use of symbolic equations produces more efficient models, which can be used for many purposes such as real-time simulation and control. However, the number, complexity, and computational efficiency of these equations is highly dependent on which coordinate set was used to model the system. One method of modelling a mechanism's topology and formulating its symbolic equations is to model the system using a graph-theoretical approach

APA, Harvard, Vancouver, ISO, and other styles

22

Larsson, Sofia. "A Study of the Loss Landscape and Metastability in Graph Convolutional Neural Networks." Thesis, KTH, Matematisk statistik, 2020. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-273622.

Full text

Abstract:

Many novel graph neural network models have reported an impressive performance on benchmark dataset, but the theory behind these networks is still being developed. In this thesis, we study the trajectory of Gradient descent (GD) and Stochastic gradient descent (SGD) in the loss landscape of Graph neural networks by replicating Xing et al. [1] study for feed-forward networks. Furthermore, we empirically examine if the training process could be accelerated by an optimization algorithm inspired from Stochastic gradient Langevin dynamics and what effect the topology of the graph has on the converg

APA, Harvard, Vancouver, ISO, and other styles

23

Egidi, Michela. "Geometry, dynamics and spectral analysis on manifolds : the Pestov Identity on frame bundles and eigenvalue asymptotics on graph-like manifolds." Thesis, Durham University, 2015. http://etheses.dur.ac.uk/11306/.

Full text

Abstract:

This dissertation is made up of two independent parts. In Part I we consider the Pestov Identity, an identity stated for smooth functions on the tangent bundle of a manifold and linking the Riemannian curvature tensor to the generators of the geodesic flow, and we lift it to the bundle of k-tuples of tangent vectors over a compact manifold M of dimension n. We also derive an integrated version over the bundle of orthonormal k-frames of M as well as a restriction to smooth functions on such a bundle. Finally, we present a dynamical application for the parallel transport of the Grassmannian of o

APA, Harvard, Vancouver, ISO, and other styles

24

Quattromini, Michele. "Graph Neural Networks for fluid mechanics : data-assimilation and optimization." Electronic Thesis or Diss., université Paris-Saclay, 2024. http://www.theses.fr/2024UPAST161.

Full text

Abstract:

Cette thèse de doctorat explore l'application des réseaux de neurones en graphes (GNN) dans le domaine de la dynamique des fluides numérique (CFD), avec un accent particulier sur l'assimilation de données et l'optimisation. Le travail est structuré en trois parties principales: assimilation de données pour les équations de Navier-Stokes moyennées à la Reynolds (RANS) basée sur des modèles GNN; assimilation de données augmentée par les GNN avec des contraintes physiques imposées par la méthode adjointe; optimisation des systèmes fluides par des techniques d'apprentissage automatique (ML).Dans l

APA, Harvard, Vancouver, ISO, and other styles

25

Ojha, Hem Raj. "Link Dynamics in Student Collaboration Networks using Schema Based Structured Network Models on Canvas LMS." Miami University / OhioLINK, 2020. http://rave.ohiolink.edu/etdc/view?acc_num=miami1596154905454069.

Full text

APA, Harvard, Vancouver, ISO, and other styles

26

Brouard, Vianney. "Cell dynamics of multitype populations in oncology and Invasion probability of cooperative parasites in structured host populations." Electronic Thesis or Diss., Lyon, École normale supérieure, 2024. http://www.theses.fr/2024ENSL0037.

Full text

Abstract:

Cette thèse porte sur l'étude de deux modèles stochastiques liés à des problèmes médicaux. Le premier vise à comprendre le processus épidémique généré par des bactériophages coopératifs dans une population de bactéries résistantes aux antibiotiques. Pour cela, nous introduisons un modèle épidémiologique où les infections sont générées par la coopération de parasites dans une population d'hôtes structurée selon un modèle de configuration. Une transition de phase est observée pour la probabilité d'invasion dépendant du degré de connectivité des sommets et du nombre de parasites générés lors d'un

APA, Harvard, Vancouver, ISO, and other styles

27

Kamal, Tariq. "Computational Cost Analysis of Large-Scale Agent-Based Epidemic Simulations." Diss., Virginia Tech, 2016. http://hdl.handle.net/10919/82507.

Full text

Abstract:

Agent-based epidemic simulation (ABES) is a powerful and realistic approach for studying the impacts of disease dynamics and complex interventions on the spread of an infection in the population. Among many ABES systems, EpiSimdemics comes closest to the popular agent-based epidemic simulation systems developed by Eubank, Longini, Ferguson, and Parker. EpiSimdemics is a general framework that can model many reaction-diffusion processes besides the Susceptible-Exposed-Infectious-Recovered (SEIR) models. This model allows the study of complex systems as they interact, thus enabling researchers t

APA, Harvard, Vancouver, ISO, and other styles

28

Aji, Sudarshan Mandayam. "Estimating Reachability Set Sizes in Dynamic Graphs." Thesis, Virginia Tech, 2014. http://hdl.handle.net/10919/49262.

Full text

Abstract:

Graphs are a commonly used abstraction for diverse kinds of interactions, e.g., on Twitter and Facebook. Different kinds of topological properties of such graphs are computed for gaining insights into their structure. Computing properties of large real networks is computationally very challenging. Further, most real world networks are dynamic, i.e., they change over time. Therefore there is a need for efficient dynamic algorithms that offer good space-time trade-offs. In this thesis we study the problem of computing the reachability set size of a vertex, which is a fundamental problem, with

APA, Harvard, Vancouver, ISO, and other styles

29

Garcia, Cantu Ros Anselmo. "Thermodynamic and kinetic aspects of interaction networks." Doctoral thesis, Universite Libre de Bruxelles, 2007. http://hdl.handle.net/2013/ULB-DIPOT:oai:dipot.ulb.ac.be:2013/210420.

Full text

Abstract:

In view of the fact that a same complex phenomenon can be approached by different conceptual frameworks, it is natural to inquire on the possibility to find connections between different types of quantities, such as topological, dynamical, statistical or thermodynamical, characterizing the same system. The present work is built on the idea that this line of approach can provide interesting insights on possible universal principles governing complex phenomena. In Chapter I we introduce concepts and tools of dynamical systems and thermodynamics as applied in macroscopic scale description as well

APA, Harvard, Vancouver, ISO, and other styles

30

Bieniecka, Ewa. "Commutativity and free products in Thompson's Group V." Thesis, University of St Andrews, 2018. http://hdl.handle.net/10023/14652.

Full text

Abstract:

We broaden the theory of dynamical interpretation, investigate the property of commutativity and explore the subject of subgroups forming free products in Thompson's group V. We expand Brin's terminology for a revealing pair to an any tree pair. We use it to analyse the dynamical behaviour of an arbitrary tree pair which cannot occur in a revealing pair. Hence, we design a series of algorithms generating Brin's revealing pair from any tree pair, by successively eliminating the undesirable structures. To detect patterns and transitioning between tree pairs, we introduce a new combinatorial obje

APA, Harvard, Vancouver, ISO, and other styles

31

Tsalouchidou, Ioanna. "Temporal analysis of large dynamic graphs." Doctoral thesis, Universitat Pompeu Fabra, 2018. http://hdl.handle.net/10803/663755.

Full text

Abstract:

The objective of this thesis is to provide a temporal analysis of the structural and interaction dynamics of large evolving graphs. In this thesis we propose new definitions of important graph metrics in order to include the temporal dimension of the dynamic graphs. We further extend the three important problems of data mining, in the temporal setting. The three problems that we propose are temporal graph summarization, temporal community search and temporal betweenness centrality. Additionally, we propose a distributed version of all our algorithms, that help our techniques to scale u

APA, Harvard, Vancouver, ISO, and other styles

32

Stefanidis, Achilleas. "Dynamic Graph Representation Learning on Enterprise Live Video Streaming Events." Thesis, KTH, Skolan för elektroteknik och datavetenskap (EECS), 2020. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-278817.

Full text

Abstract:

Enterprises use live video streaming as a mean of communication. Streaming high-quality video to thousands of devices in a corporate network is not an easy task; the bandwidth requirements often exceed the network capacity. For that matter, Peer-To-Peer (P2P) networks have been proven beneficial, as peers can exchange content efficiently by utilizing the topology of the corporate network. However, such networks are dynamic and their topology might not always be known. In this project we propose ABD, a new dynamic graph representation learning approach, which aims to estimate the bandwidth capa

APA, Harvard, Vancouver, ISO, and other styles

33

Leal, Thiago Franco. "Simulação numérica do escoamento de água em áreas alagáveis da floresta amazônica com a utilização da estrutura de dados Autonomous Leaves Graph." Universidade do Estado do Rio de Janeiro, 2013. http://www.bdtd.uerj.br/tde_busca/arquivo.php?codArquivo=6565.

Full text

Abstract:

Fundação de Amparo à Pesquisa do Estado do Rio de Janeiro<br>A Amazônia exibe uma variedade de cenários que se complementam. Parte desse ecossistema sofre anualmente severas alterações em seu ciclo hidrológico, fazendo com que vastos trechos de floresta sejam inundados. Esse fenômeno, entretanto, é extremamente importante para a manutenção de ciclos naturais. Neste contexto, compreender a dinâmica das áreas alagáveis amazônicas é importante para antecipar o efeito de ações não sustentáveis. Sob esta motivação, este trabalho estuda um modelo de escoamento em áreas alagáveis amazônicas, baseado

APA, Harvard, Vancouver, ISO, and other styles

34

Rajaei, Hoda. "Brain Connectivity Networks for the Study of Nonlinear Dynamics and Phase Synchrony in Epilepsy." FIU Digital Commons, 2018. https://digitalcommons.fiu.edu/etd/3882.

Full text

Abstract:

Assessing complex brain activity as a function of the type of epilepsy and in the context of the 3D source of seizure onset remains a critical and challenging endeavor. In this dissertation, we tried to extract the attributes of the epileptic brain by looking at the modular interactions from scalp electroencephalography (EEG). A classification algorithm is proposed for the connectivity-based separation of interictal epileptic EEG from normal. Connectivity patterns of interictal epileptic discharges were investigated in different types of epilepsy, and the relation between patterns and the epil

APA, Harvard, Vancouver, ISO, and other styles

35

Jin, Wei. "GRAPH PATTERN MATCHING, APPROXIMATE MATCHING AND DYNAMIC GRAPH INDEXING." Case Western Reserve University School of Graduate Studies / OhioLINK, 2011. http://rave.ohiolink.edu/etdc/view?acc_num=case1307547974.

Full text

APA, Harvard, Vancouver, ISO, and other styles

36

Algar, Espejo Antonio. "Amortiguación de final de carrera de actuadores hidráulicos." Doctoral thesis, Universitat Politècnica de Catalunya, 2021. http://hdl.handle.net/10803/671524.

Full text

Abstract:

The internal cushioning systems of hydraulic linear actuators, of special interest in mobile machinery, pursue to avoid mechanical shocks at their end of stroke. The design where the piston, with perimeter grooves, regulates the flow by standing in front of the outlet port has not been studied in depth until now. Consequently, the operating fundamentals, influencing factors and optimization of these cushioning designs have been investigated. First, a dynamic model has been developed using the bond graph technique that integrates the mechanical equations of the actuator, the hydraulic circuit

APA, Harvard, Vancouver, ISO, and other styles

37

Jiang, Shan. "Statistical Modeling of Multi-Dimensional Knowledge Diffusion Networks: An ERGM-Based Framework." Diss., The University of Arizona, 2015. http://hdl.handle.net/10150/555946.

Full text

Abstract:

Knowledge diffusion networks consist of individuals who exchange knowledge and knowledge flows connecting the individuals. By studying knowledge diffusion in a network perspective, it helps us understand how the connections between individuals affect the knowledge diffusion processes. Existing research on knowledge diffusion networks mostly adopts a uni-dimensional perspective, where all the individuals in the networks are assumed to be of the same type. It also assumes that there is only one type of knowledge flow in the network. This dissertation proposes a multi-dimensional perspective of k

APA, Harvard, Vancouver, ISO, and other styles

38

Lagnier, Julien. "Contribution à l'analyse structurelle des systèmes singuliers pour la conception mécatronique." Thesis, Lyon, 2017. http://www.theses.fr/2017LYSEI045/document.

Full text

Abstract:

Cette thèse s'inscrit dans le cadre de la conception des systèmes mécatroniques. Les travaux se positionnent dans les premières phases du cycle de conception, là où les principaux efforts méthodologiques sont à mener pour améliorer la qualité et la fonctionnalité des produits, et reposent sur le prototypage virtuel (modélisation et simulation). Une approche méthodologique envisageable est de reformuler le problème de conception sous une forme inverse, pour directement utiliser les spécifications du cahier des charges, usuellement exprimées sur les sorties, pour calculer les inconnues du problè

APA, Harvard, Vancouver, ISO, and other styles

39

Harvey, William John. "Understanding High-Dimensional Data Using Reeb Graphs." The Ohio State University, 2012. http://rave.ohiolink.edu/etdc/view?acc_num=osu1342614959.

Full text

APA, Harvard, Vancouver, ISO, and other styles

40

Collazo, Rodrigo A. "The dynamic chain event graph." Thesis, University of Warwick, 2017. http://wrap.warwick.ac.uk/91075/.

Full text

Abstract:

The Chain Event Graph (CEG) is a type of tree-based graphical model that accommodates all discrete Bayesian Networks as a particular subclass. It has already been successfully used to capture context-specific conditional independence structures of highly asymmetric processes in a way easily appreciated by domain experts. Being built from a tree, a CEG has a huge number of free parameters that makes the class extremely expressive but also very large. Exploring the enormous CEG model space then makes it necessary to design bespoke algorithms for this purpose. All Bayesian algorithms for CEG mode

APA, Harvard, Vancouver, ISO, and other styles

41

Cowlagi, Raghvendra V. "Hierarchical motion planning for autonomous aerial and terrestrial vehicles." Diss., Georgia Institute of Technology, 2011. http://hdl.handle.net/1853/41066.

Full text

Abstract:

Autonomous mobile robots - both aerial and terrestrial vehicles - have gained immense importance due to the broad spectrum of their potential military and civilian applications. One of the indispensable requirements for the autonomy of a mobile vehicle is the vehicle's capability of planning and executing its motion, that is, finding appropriate control inputs for the vehicle such that the resulting vehicle motion satisfies the requirements of the vehicular task. The motion planning and control problem is inherently complex because it involves two disparate sub-problems: (1) satisfaction of th

APA, Harvard, Vancouver, ISO, and other styles

42

Hellmann, Jennifer K. "Neighbor Effects: The Influence of Colony-level Social Structure on Within-group Dynamics in a Social Fish." The Ohio State University, 2016. http://rave.ohiolink.edu/etdc/view?acc_num=osu1464129648.

Full text

APA, Harvard, Vancouver, ISO, and other styles

43

Schiller, Benjamin. "Graph-based Analysis of Dynamic Systems." Doctoral thesis, Saechsische Landesbibliothek- Staats- und Universitaetsbibliothek Dresden, 2017. http://nbn-resolving.de/urn:nbn:de:bsz:14-qucosa-230611.

Full text

Abstract:

The analysis of dynamic systems provides insights into their time-dependent characteristics. This enables us to monitor, evaluate, and improve systems from various areas. They are often represented as graphs that model the system's components and their relations. The analysis of the resulting dynamic graphs yields great insights into the system's underlying structure, its characteristics, as well as properties of single components. The interpretation of these results can help us understand how a system works and how parameters influence its performance. This knowledge supports the design of ne

APA, Harvard, Vancouver, ISO, and other styles

44

Crawford, Carl Jonathan. "Dynamic multilevel graph layout and visualisation." Thesis, University of Greenwich, 2016. http://gala.gre.ac.uk/18104/.

Full text

Abstract:

This thesis addresses the issue of efficient dynamic graph drawing for large scale connected graphs with around 10,000 vertices. It contains three main contributions. Firstly, an efficient method for approximating the n-body calculations used in Force Directed Placement (FDP) is described, exploiting use of a multilevel scheme to approximate distance between groups of vertices much like the Barnes Hut Octree. The method suggests better representation of the graphs underlying relationships. In experiments this algorithm, referred to as Multilevel Global Force (MGF), reduces running time by an a

APA, Harvard, Vancouver, ISO, and other styles

45

Mcnitt, Joseph Andrew. "Stability in Graph Dynamical Systems." Thesis, Virginia Tech, 2018. http://hdl.handle.net/10919/83604.

Full text

Abstract:

The underlying mathematical model of many simulation models is graph dynamical systems (GDS). This dynamical system, its implementation, and analyses on each will be the focus of this paper. When using a simulation model to answer a research question, it is important to describe this underlying mathematical model in which we are operating for verification and validation. In this paper we discuss analyses commonly used in simulation models. These include sensitivity analyses and uncertainty quantification, which provide motivation for stability and structure-to-function research in GDS. We revi

APA, Harvard, Vancouver, ISO, and other styles

46

Dorrian, Henry Joseph. "Hierarchical graphs and oscillator dynamics." Thesis, Manchester Metropolitan University, 2015. http://e-space.mmu.ac.uk/580120/.

Full text

Abstract:

In many types of network, the relationship between structure and function is of great significance. This work is particularly concerned with community structures, which arise in a wide variety of domains. A simple oscillator model is applied to networks with community structures and shows that waves of regular oscillation are caused by synchronised clusters of nodes. Moreover, we demonstrate that such global oscillations may arise as a direct result of network topology. We also observe that additional modes of oscillation (as detected through frequency analysis) occur in networks with addition

APA, Harvard, Vancouver, ISO, and other styles

47

BORRELLO, DAVIDE. "Interacting particle systems: stochastic order, attractiveness and random walks on small world graphs." Doctoral thesis, Università degli Studi di Milano-Bicocca, 2009. http://hdl.handle.net/10281/7467.

Full text

Abstract:

The main subject of the thesis is concerned with interacting particle systems, which are classes of spatio-temporal stochastic processes describing the evolution of particles in interaction with each other. The particles move on a finite or infinite discrete space and on each element of this space the state of the configuration is integer valued. Configurations of particles evolve in continuous time according to a Markov process. Here the space is either the infinite deterministic d-dimensional lattice or a random graph given by the finite d-dimensional torus with random matchings. In Part

APA, Harvard, Vancouver, ISO, and other styles

48

Kaler, Tim (Tim F. S. ). "Chromatic scheduling of dynamic data-graph computations." Thesis, Massachusetts Institute of Technology, 2013. http://hdl.handle.net/1721.1/85430.

Full text

Abstract:

Thesis: M. Eng., Massachusetts Institute of Technology, Department of Electrical Engineering and Computer Science, 2013.<br>Cataloged from PDF version of thesis.<br>Includes bibliographical references (pages 67-73).<br>Data-graph computations are a parallel-programming model popularized by programming systems such as Pregel, GraphLab, PowerGraph, and GraphChi. A fundamental issue in parallelizing data-graph computations is the avoidance of races between computation occurring on overlapping regions of the graph. Common solutions such as locking protocols and bulk-synchronous execution often sac

APA, Harvard, Vancouver, ISO, and other styles

49

Montgomery, Bruce Lee. "Dynamic coloring of graphs." Morgantown, W. Va. : [West Virginia University Libraries], 2001. http://etd.wvu.edu/templates/showETD.cfm?recnum=2109.

Full text

Abstract:

Thesis (Ph. D.)--West Virginia University, 2001.<br>Title from document title page. Document formatted into pages; contains viii, 52 p. : ill. Vita. Includes abstract. Includes bibliographical references (p. 51).

APA, Harvard, Vancouver, ISO, and other styles

50

Hannoush, Khodor. "Dynamic Pan-genome graphs." Electronic Thesis or Diss., Université de Rennes (2023-....), 2024. https://ged.univ-rennes1.fr/nuxeo/site/esupversions/046f12e6-165c-4827-8722-1639b95ea781.

Full text

Abstract:

Les progrès rapides des technologies de séquençage ont révolutionné la génomique, conduisant à des bases de données génomiques massives et à des milliers de génomes assemblés. Cette croissance exponentielle des données a mis en évidence les limites des modèles traditionnels basés sur des références et a motivé le développement de représentations pan-génomiques qui reflètent la diversité des espèces. Parmi ces représentations, les graphes de de Bruijn compactés (cDBG) constituent une approche de pointe pour le stockage et les requêtes sur les grands ensembles de données génomiques. En regroupan

APA, Harvard, Vancouver, ISO, and other styles

We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!