66,852 Hits in 2.5 sec

Abstract hierarchical graph transformation

2005 Mathematical Structures in Computer Science  
Moreover, our model is equipped with a rule-based transformation concept such that hierarchical graphs cannot only be used for static representation of complex system states, but also for the description  ...  Received In this paper, we introduce a new hierarchical graph model to structure large graphs into small components by distributing the nodes (and edges likewise) into a hierarchy of packages.  ...  Following our main goal of developing an abstract model of hierarchical graph transformation, we adopt the second approach.  ... 
doi:10.1017/s0960129505004846 fatcat:ogdvbiujojdohm7rkj7hj6vtza

An enhanced graph-oriented approach for change management in distributed biomedical ontologies and linked data

A. Shaban-Nejad, V. Haarslev
2011 2011 IEEE International Conference on Bioinformatics and Biomedicine Workshops (BIBMW)  
In this approach Category theory along with rule-based hierarchical distributed (HD) graph transformation have been employed to propose a more specific semantics for analyzing ontological changes and transformations  ...  between different versions of an ontology, as well as tracking the effects of a change in different levels of abstractions.  ...  As we will demonstrate throughout this manuscript categories and graph transformation -more specifically hierarchically distributed (HD) graph transformationprovide abstract yet expressive enough formalism  ... 
doi:10.1109/bibmw.2011.6112439 dblp:conf/bibm/Shaban-NejadH11 fatcat:gqbf54slizagxhblqzczfvdule

Self-Supervised and Interpretable Anomaly Detection using Network Transformers [article]

Daniel L. Marino, Chathurika S. Wickramasinghe, Craig Rieger, Milos Manic
2022 arXiv   pre-print
In this paper, we introduce the Network Transformer (NeT), a DNN model for anomaly detection that incorporates the graph structure of the communication network in order to improve interpretability.  ...  The presented approach has the following advantages: 1) enhanced interpretability by incorporating the graph structure of computer networks; 2) provides a hierarchical set of features that enables analysis  ...  Fig. 5 : Hierarchical graph features: Global, Node, and Edge features. C. Hierarchical Graph Features Figure 5 shows the hierarchical graph features used to represent the monitored network.  ... 
arXiv:2202.12997v1 fatcat:sfc2fril45hv5lemcnoyltc7ly

Semantic Anchoring with Model Transformations [chapter]

Kai Chen, Janos Sztipanovits, Sherif Abdelwalhed, Ethan Jackson
2005 Lecture Notes in Computer Science  
Using a mathematical model, Abstract State Machine (ASM), as a common semantic framework, we have developed formal operational semantics for a set of basic models of computations, called semantic units  ...  MIC places strong emphasis on the use of domain-specific modeling languages (DSML-s) and model transformations.  ...  "any match") to specify non-deterministic graph transformation algorithms.  ... 
doi:10.1007/11581741_10 fatcat:j2z53d5y65funelqqwtwoxljpi

Ten virtues of structured graphs

Roberto Bruni, Alberto Lluch Lafuente
2009 Electronic Communications of the EASST  
We have tried to write an ADR agnostic paper where we raise some drawbacks of flat, unstructured graphs for the design and analysis of software systems and we argue that hierarchical, structured graphs  ...  ADR is based on hierarchical graphs with interfaces and it has been conceived in the attempt of reconciling software architectures and process calculi by means of graphical methods.  ...  This is naturally accomplished by hierarchical graph transformation systems.  ... 
doi:10.14279/tuj.eceasst.18.261 dblp:journals/eceasst/BruniL09 fatcat:df6gs3nud5bqxbcg2x37ukuyai

Hierarchical Transformers for Multi-Document Summarization

Yang Liu, Mirella Lapata
2019 Proceedings of the 57th Annual Meeting of the Association for Computational Linguistics  
Our model augments a previously proposed Transformer architecture with the ability to encode documents in a hierarchical manner.  ...  In this paper, we develop a neural summarization model which can effectively process multiple input documents and distill abstractive summaries.  ...  We can then inject this graph into our hierarchical transformer by simply substituting one of its (learned) heads z with G.  ... 
doi:10.18653/v1/p19-1500 dblp:conf/acl/LiuL19 fatcat:iixriue27zeolazk2e554stqim

Towards Common Exchange Formats for Graphs and Graph Transformation Systems

Gabriele Taentzer
2001 Electronical Notes in Theoretical Computer Science  
The development of common exchange formats for graphs and graph transformation systems is an ongoing initiative within the EU Working Group APPLIGRAPH (Applications of Graph Transformation).  ...  Moreover, within the graph transformation community tool builders can even gain from a common exchange format for graph transformation systems.  ...  Considering graphs as they are used for graph layout, graph transformation and reengineering, the exchange format should be able to deal with directed and undirected graphs, hypergraphs, hierarchical graphs  ... 
doi:10.1016/s1571-0661(04)80941-1 fatcat:tbkvgm72jzeeri5nvvnxs4bg2a

Stochastic Graph Transformation with Regions

Paolo Torrini, Reiko Heckel, Istvan Rath, Gabor Bergmann
2010 Electronic Communications of the EASST  
Graph transformation can be used to implement stochastic simulation of dynamic systems based on semi-Markov processes, extending the standard approach based on Markov chains.  ...  We present an extension of this model, by introducing a hierarchical notion of event location, allowing for stochastic dependence of higher-level events on lower-level ones.  ...  A hierarchical graph transformation system (HGTS) G = R, G 0 consists of a set R ⊆ R of rules and an initial graph G 0 ∈ G x .  ... 
doi:10.14279/tuj.eceasst.29.413 dblp:journals/eceasst/TorriniHRB10 fatcat:tnzr2m4ouzat7flo7sa6xqg6mm

Functorial String Diagrams for Reverse-Mode Automatic Differentiation [article]

Mario Alvarez-Picallo, Dan R. Ghica, David Sprunger, Fabio Zanasi
2021 arXiv   pre-print
To give an efficient yet principled implementation of the AD algorithm we define a sound and complete representation of hierarchical string diagrams as a class of hierarchical hypergraphs we call hypernets  ...  We enhance the calculus of string diagrams for monoidal categories with hierarchical features in order to capture closed monoidal (and cartesian closed) structure.  ...  Rewriting of hierarchical graphs The notion of hierarchical hypergraph used in this paper is closely inspired by, and a formalisation of the graphs used in ].  ... 
arXiv:2107.13433v1 fatcat:2bnsqea5nvgxhhsakuwlhwq6oi

Optimal inference for hierarchical skeleton abstraction

A. Telea, C. Sminchisescu, S. Dickinson
2004 Proceedings of the 17th International Conference on Pattern Recognition, 2004. ICPR 2004.  
Skeletons are well-known representations that accommodate shape abstraction and qualitative shape matching.  ...  However, skeletons are sometimes unstable to compute and sensitive to shape detail, thus making shape abstraction and matching difficult.  ...  Inference for Optimal Skeleton Abstraction We formulate the hierarchical skeleton abstraction as inference over a two parameter family ¢ ¤ £ ¦ ¥ § © representing boundary £ and internal structure § .  ... 
doi:10.1109/icpr.2004.1333695 dblp:conf/icpr/TeleaSD04 fatcat:kapozlxhgfg7xlaesfprya5epq

Hierarchical Graph Transformation

Frank Drewes, Berthold Hoffmann, Detlef Plump
2002 Journal of computer and system sciences (Print)  
When graph transformation is used for programming purposes, large graphs should be structured in order to be comprehensible.  ...  In this paper, we present an approach for the rule-based transformation of hierarchically structured hypergraphs.  ...  If some complicated abstract data type shall be implemented by graphs and graph transformation, no mechanism HIERARCHICAL GRAPH TRANSFORMATION supports the structuring of these graphs, except for the means  ... 
doi:10.1006/jcss.2001.1790 fatcat:mzouszdrxveyjelcrzzi2cnirm

Hierarchical Graph Transformation [chapter]

Frank Drewes, Berthold Hoffmann, Detlef Plump
2000 Lecture Notes in Computer Science  
When graph transformation is used for programming purposes, large graphs should be structured in order to be comprehensible.  ...  In this paper, we present an approach for the rule-based transformation of hierarchically structured hypergraphs.  ...  If some complicated abstract data type shall be implemented by graphs and graph transformation, no mechanism HIERARCHICAL GRAPH TRANSFORMATION supports the structuring of these graphs, except for the means  ... 
doi:10.1007/3-540-46432-8_7 fatcat:vssgl27rezevpif5ffj7v6erxm

Graph Representation of the Nested Software Structure [chapter]

Leszek Kotulski
2005 Lecture Notes in Computer Science  
This paper discusses how the UML package's nested structure can be maintained and visualized with the help of a graph transformation mechanism based on the edNLC class of grammar.  ...  Complex components are constructed by composing in parallel some elementary components and as a result the overall architecture of the system is described as a hierarchical composition of primitive components  ...  The correctness of graph transformation is forced by a graph transformation rules called productions described how the left hand production graph be replaced by the right hand one with the embedding transformation  ... 
doi:10.1007/11428862_159 fatcat:g2esgxtx4fhh3dpyl7mu5ekqpm

Autonomously constructing hierarchical task networks for planning and human-robot collaboration

Bradley Hayes, Brian Scassellati
2016 2016 IEEE International Conference on Robotics and Automation (ICRA)  
In this work we detail a novel type of Hierarchical Task Network we call a Clique/Chain HTN (CC-HTN), alongside an algorithm for autonomously constructing them from topological properties derived from  ...  Algorithm 1: Conjugate Task Graph Transform Input: Markovian Graph G = {V, E} Output: Conjugate Task Graph C 1 C ← empty Conjugate Task Graph {W,F}; 2 origin vertex ← new empty vertex; 3 terminal vertex  ...  Hierarchical Ambiguity Three conditions exist in which a task does not cleanly abstract into a hierarchical structure with a single root node. 1) Redundancy or Equivalence: A maximally abstracted hierarchy  ... 
doi:10.1109/icra.2016.7487760 dblp:conf/icra/HayesS16 fatcat:4hvpcix6o5daxpur4jgkgbl2ky

MARTE to ΠSDF transformation for data-intensive applications analysis

Manel Ammar, Mouna Baklouti, Maxime Pelcat, Karol Desnos, Mohamed Abid
2014 Proceedings of the 2014 Conference on Design and Architectures for Signal and Image Processing  
It is based on an intermediate level of abstraction implementing the Parameterized and Interfaced Synchronous Dataflow (ΠSDF) semantics.  ...  High-level models are then refined towards intermediate level models by following the Model-Driven Engineering (MDE) transformation paradigm.  ...  While each sub-ΠSDF graph has input and output data interfaces facilitating data-exchange between the hierarchical actor and its sub-graph, the upperlevel ΠSDF graph contains a net of actors communicating  ... 
doi:10.1109/dasip.2014.7115622 dblp:conf/dasip/AmmarBPDA14 fatcat:xq4z5jznqfeklbaiicut2wtgp4
« Previous Showing results 1 — 15 out of 66,852 results