Filters








45,917 Hits in 4.2 sec

Abstract hierarchical graph transformation

GIORGIO BUSATTO, HANS-JÖRG KREOWSKI, SABINE KUSKE
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.  ...  The notion of a loose hierarchical graph transformation approach can be considered an intermediate step for the definition of coordinated hierarchical graph transformation.  ... 
doi:10.1017/s0960129505004846 fatcat:ogdvbiujojdohm7rkj7hj6vtza

Stochastic Graph Transformation with Regions

Paolo Torrini, Reiko Heckel, Istvan Rath, Gabor Bergmann
2010 Electronic Communications of the EASST  
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.  ...  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 can now introduce a notion of hierarchical transformation system, consistently with the generic approach, along the lines of the definitions 1, 2, by adapting them to classes of hierarchical graphs.  ... 
doi:10.14279/tuj.eceasst.29.413 dblp:journals/eceasst/TorriniHRB10 fatcat:tnzr2m4ouzat7flo7sa6xqg6mm

Parallel Independence in Hierarchical Graph Transformation [chapter]

Annegret Habel, Berthold Hoffmann
2004 Lecture Notes in Computer Science  
Hierarchical graph transformation as defined in [1, 2] extends double-pushout graph transformation in the spirit of term rewriting: Graphs are provided with hierarchical structure, and transformation rules  ...  Moreover, the more general structure of hierarchical graphs and of transformation rules leads to a refined condition, termed fragmented parallel independence, which subsumes both parallel independence  ...  In Sect. 3, we recall the basic notions of hierarchical graphs and hierarchical graph transformation, and show the relationship to substitutionbased graph transformation.  ... 
doi:10.1007/978-3-540-30203-2_14 fatcat:7wlpfobcrbdbdgi6e2ruelxlxe

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  ...  This paper reports the summary and results of our research on providing a graph oriented formalism to represent, analyze and validate the evolution of bio-ontologies, with emphasis on the FungalWeb Ontology  ...  In applications dealing with compound graphs in layered organizations, the notion of graph can be extended to hierarchical graph.  ... 
doi:10.1109/bibmw.2011.6112439 dblp:conf/bibm/Shaban-NejadH11 fatcat:gqbf54slizagxhblqzczfvdule

Attributed Hierarchical Port Graphs and Applications

Nneka Chinelo Ene, Maribel Fernández, Bruno Pinaud
2018 Electronic Proceedings in Theoretical Computer Science  
We also generalise the notion of strategic port graph rewriting (a particular kind of graph transformation system, where port graph rewriting rules are controlled by user-defined strategies) to deal with  ...  We present attributed hierarchical port graphs (AHP) as an extension of port graphs that aims at facilitating the design of modular port graph models for complex systems.  ...  Where a double push-out graph transformation approach applies naturally to the transformation of hierarchical hyper-graphs, the dynamic theory of bigraphs relies on a notion of relative push-out.  ... 
doi:10.4204/eptcs.265.2 fatcat:r5ygcdmsibdivprz4pawb4jpf4

Watershed, Hierarchical Segmentation and Waterfall Algorithm [chapter]

Serge Beucher
1994 Computational Imaging and Vision  
This technique is based on mosaic images and on the computation of a watershed transform on a valued graph derived from the mosaic images.  ...  This algorithm allows the selection of minima and of catchment basins of higher significance compared to their neighborhood.  ...  Hierarchical algorithms The preceding graph is not easy to handle because it is not a planar graph.  ... 
doi:10.1007/978-94-011-1040-2_10 dblp:conf/ismm/Beucher94 fatcat:m3n7pljwanattgg7npcpja3dh4

Hierarchical Graph Transformation

Frank Drewes, Berthold Hoffmann, Detlef Plump
2002 Journal of computer and system sciences (Print)  
In this paper, we present an approach for the rule-based transformation of hierarchically structured hypergraphs.  ...  In particular, we show how pushouts and pushout complements of hierarchical graphs and graph morphisms can be constructed recursively.  ...  Finally, we relate our notion of hierarchical graph transformation to the conventional transformation of flat graphs by introducing a flattening operation.  ... 
doi:10.1006/jcss.2001.1790 fatcat:mzouszdrxveyjelcrzzi2cnirm

Hierarchical Graph Transformation [chapter]

Frank Drewes, Berthold Hoffmann, Detlef Plump
2000 Lecture Notes in Computer Science  
In this paper, we present an approach for the rule-based transformation of hierarchically structured hypergraphs.  ...  In particular, we show how pushouts and pushout complements of hierarchical graphs and graph morphisms can be constructed recursively.  ...  Finally, we relate our notion of hierarchical graph transformation to the conventional transformation of flat graphs by introducing a flattening operation.  ... 
doi:10.1007/3-540-46432-8_7 fatcat:vssgl27rezevpif5ffj7v6erxm

Preface

Roswitha Bardohl, Hartmut Ehrig
2003 Electronical Notes in Theoretical Computer Science  
This volume contains selected papers of the proceedings of the workshop on Uniform  ...  Acknowledgement This workshop is supported by the European research training network SegraVis, and by the steering committee of the International Conference on Graph Transformation (ICGT).  ...  The authors propose a hierarchical graph representation for programs to facilitate the study of refactoring operation effects at class level.  ... 
doi:10.1016/s1571-0661(05)80754-6 fatcat:thc2bgwym5fjffgdbuvsawruva

Streaming Graph-Based Hierarchical Video Segmentation by a Simple Label Propagation

Kleber J.F. de Souza, Arnaldo de A. Araujo, Silvio J.F. Guimaraes, Zenilton K.G. do Patrocinio, Matthieu Cord
2015 2015 28th SIBGRAPI Conference on Graphics, Patterns and Images  
An example of streaming graph-based hierarchical video segmentation obtained by our proposed method.  ...  Here, we transform the streaming video segmentation into a graph partitioning problem in which each part corresponds to one region of the video; furthermore, we apply a simple method for merging the segmentations  ...  ACKNOWLEDGMENT The authors are grateful to PUC Minas, UFMG, CNPq, CAPES, COFECUB and FAPEMIG for the financial support of this work.  ... 
doi:10.1109/sibgrapi.2015.23 dblp:conf/sibgrapi/SouzaAGPC15 fatcat:wz4b634givg4ncvrjbh5e5a3my

Equivalence of OLAP Dimension Schemas [chapter]

Carlos A. Hurtado, Claudio Gutiérrez
2004 Lecture Notes in Computer Science  
In this paper we propose a notion of equivalence that allows to compare dimension schemas with respect to their information capacity.  ...  Our results also permit to compare the expressiveness of different known classes of dimension schemas.  ...  Acknowledgments We thank Alberto Mendelzon for fruitful suggestions on early versions of this work.  ... 
doi:10.1007/978-3-540-24627-5_12 fatcat:ewxkiudzbbd5dpyysbn63fl52q

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.  ...  and whose contribution has been fundamental for the topics of the talk of the first author and the paper: Ugo Montanari, Emilio Tuosto, Fabio Gadducci, Antonio Bucchiarone, Stefania Gnesi and Dan Hirsch  ... 
doi:10.14279/tuj.eceasst.18.261 dblp:journals/eceasst/BruniL09 fatcat:df6gs3nud5bqxbcg2x37ukuyai

A Hierarchical Graph Signal Processing Approach to Inference from Spatiotemporal Signals [article]

Nafiseh Ghoroghchian, Stark C. Draper, Roman Genov
2020 arXiv   pre-print
The latter include the energies of the signal's graph Fourier transform in different frequency bands.  ...  In this paper we leverage novel techniques of GSP to develop a hierarchical feature extraction approach by mapping the data onto a series of spatiotemporal graphs.  ...  The identification of a cognitive control event based on EEG data, is used as an example in [10] , where the notion of windowed dynamic graph Fourier transform is introduced.  ... 
arXiv:2010.13164v1 fatcat:x77eet42qnfutna332u4wf47u4

A Framework for Adding Packages to Graph Transformation Approaches [chapter]

Giorgio Busatto, Gregor Engels, Katharina Mehner, Annika Wagner
2000 Lecture Notes in Computer Science  
Because of the dynamic nature of graphs, hierarchical graph transformation is also an important issue to be dealt with when using hierarchical graphs.  ...  Motivated by the successful application of graph grammars to the specification of graph transformations, we also introduce a framework that allows to specify hierarchical graph transformations by combining  ...  These do not offer a general approach to hierarchical graph transformation, since they use a very special notion of hierarchical graphs.  ... 
doi:10.1007/978-3-540-46464-8_25 fatcat:4ch4k37oq5e7bitchfn7nnfvfa

Mental-model-based Similarity in Interactive Layout

Cornelius Hagen
2008 Künstliche Intelligenz  
A notion of similarity that is based on the idea of transforming spatial mental models serves to measure the user's cognitive effort needed for orientation in the changed layout.  ...  The usual computationally expensive approach to determine the minimal transformation costs is replaced by a concept that is motivated by this idea but compares two graphs directly with respect to structural  ...  Class diagrams lack a natural hierarchical structure with respect to groups of layout objects.  ... 
dblp:journals/ki/Hagen08 fatcat:bb37cahez5bgxo6wmjoam6vlae
« Previous Showing results 1 — 15 out of 45,917 results