Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 20 of 27 for “"Graph transformations"”.
-
On the zeta Kirchhoff index of several graph transformations
… zeta Kirchhoff index of the k-th semitotal point graph (of regular graphs), a construction by Cui and Hou [5], where we create triangles for every edge in the original graph. Then, we extend the construction to the creation of equilaterals and polygons. We also derived the zeta Kirchhoff indices …
-
A practically efficient graph-theoretic approach to protein identification in mass spectrometry
… tandem mass spectrometry process, and employs graph transformations to perform inference efficiently. These graph transformations are then combined with formal graph-theoretic inference procedures to increase the efficiency of inference and facilitate inference on more complex graphs resulting …
-
Scaling quantum compilation with graph rewriting
… techniques.<br><br>This thesis argues that graph transformation systems (GTS) offer a principled foundation for compiler platforms that can express arbitrary hardware primitives and support computations over both quantum and classical data. To this end, it introduces a graph-based …
-
Modeliais paremtas testavimas taikant kategorijų teoriją /
… a literature review, the possibility of using graph transformations to generate test cases or to model the system is investigated and an MBT approach using set-valued functor transformations is proposed. A test case generator based on category theory is presented, which allows the generation …
-
Improving the performance of graph transformation execution in the BSP model - By improving a code generator for EMF Henshin
… of software projects. Combining the notion of Graph Transformations with the Bulk Synchronous Parallel (BSP); big-data problems can be solved using a model-driven approach. However, such solutions are still in their early phases and do not provide the required performance. This presents the …
-
Computation of evolutionary change
… of semantic evolutionary change. It is based on graphs for representing software semantics, graph transformations for modeling evolution, and effects of graph transformations for capturing evolutionary change.</p> <p>We formulate the notions of evolution sets and the evolution distance to measure …
-
Beyond node-centric graph learning: advancing edge-aware GNNs for enhanced representation learning
Graph Neural Networks (GNNs) have achieved state-of-the-art performance in representation learning, yet they predominantly treat edges as auxiliary structures for message passing, systematically overlooking their potential as primary informational entities. This thesis investigates the hypothesis …
-
Masinio eismo simuliavimas /
… for finding shortest path in untouched graph, Algorithms for finding shorted path which need modified graph, Algorithms specific for traffic simulation. Algorithms up to graph transformations have been analyzed in previous works. These optimizations proved to be very perspective in …
-
Integrating models and simulations of continuous dynamic system behavior into SysML
… increasingly complex as they are handled by geographically distributed design teams, constrained by the objectives of multiple stakeholders, and inundated by large quantities of design information. According to the principles of model-based systems engineering (MBSE), engineers can effectively …
-
Strategic Modelling with Graph Rewriting Tools
To model complex systems, graphical formalisms have clear advantages: they are more intuitive and make it easier to visualise a system and convey intuitions or ideas about it. Graph rewriting rules can be used to model their dynamic evolution and from a practical point of view, graph …
-
A graph theory approach to the synthesis and optimization of a modified transportation network
… proposed a novel optimization technique based on graph transformations which enables both the synthesis as well as the optimization of such modified transportation networks. The most important contribution of this work is in the form a brand new method which enables topology optimization. Previous …
-
Field programmable analog array synthesis
… subroutine, we proposed a modified signal flow graph to represent FPAA circuits. Graph transformations are introduced for exploring alternative circuit structures in FPAA synthesis. Finally, in the work of FPAA placement and routing, an efficient method for estimating FPAA parasitic effects was …
-
Statistical Parsing by Machine Learning from a Classical Arabic Treebank
… a pure dependency parser is adapted using graph transformations, resulting in an 87.47% F1-score. This is compared to an integrated parsing model with an F1-score of 89.03%, demonstrating that joint dependency-constituency parsing is better suited to Classical Arabic. The Quran was chosen …
-
Isospectral graph reductions, estimates of matrices' spectra, and eventually negative Schwarzian systems
… of Chapters I, II, and III, studies the graph theoretic nature of complex systems. This includes the spectral properties of such systems and in particular their influence on the systems dynamics. In the second part of this dissertation, or Chapter IV, we consider a new class of …
-
Design methodology for embedded computer vision systems
… and synthesis of such systems are explored: (1) Graph Transformations: Dataflow modeling is widely used in digital signal processing (DSP) systems. However, support for dynamic behavior in such systems exists mainly at the modeling level and there is a lack of optimized synthesis tech¬niques for …
-
DYNAMIC EVOLUTION AND RECONFIGURATION OF SOFTWARE ARCHITECTURES THROUGH ASPECTS
… semantics is precisely described by means of graph transformations. This formalism has been chosen because it naturally models both the system architecture and its asynchronous evolution. The work presented in this thesis is illustrated through a case study from the robotics domain; an area …
-
Algorithms for the Maximum Independent Set Problem
… Independent Set (MIS) problem. Some related graph theoretical combinatorial problems are also considered. As these problems are generally NP-hard, we study their complexity in hereditary graph classes, i.e. graph classes defined by a set F of forbidden induced subgraphs. We revise the …
Page 1 of 2