A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2003; you can also visit the original URL.
The file type is application/pdf.
Filters
Using graph rewriting to specify software architectural transformations
2000
Proceedings ASE 2000. Fifteenth IEEE International Conference on Automated Software Engineering
Preserved Fulltext
Specifically, we use the PROGRES tool to formulate executable graph-rewriting specifications for various architectural transformations in order to demonstrate the strengths of using graph rewriting. ...
In this paper, we use graph rewriting to specify these transformations so that we can work towards automating them. ...
The transformations, which are commonly applied to the graph models of the software architectures, can be classified into three classes [6] : Contain Use (1) Transformations for understanding. ...
doi:10.1109/ase.2000.873663
dblp:conf/kbse/FahmyH00
fatcat:x6alqo4tfvfgxcn4afiuzvitny
Data Shapes and Data Transformations
[article]
2012
arXiv
pre-print
Preserved Fulltext
The Internet Archive has a preservation copy of this work in our general collections.
The file type is application/pdf.
With this report we provide a principled overview on the fundamental data shapes tabular, tree, and graph as well as transformations between them, in order to gain a better understanding for performing ...
said transformations more efficiently and effectively. ...
Let us suppose we have a relational database containing transaction data of a company, and we need to submit these transactions that requires, for integration purposes, the data in XML, so we need to transform ...
arXiv:1211.1565v1
fatcat:k2f3phkomvf3xlmzg7ciqbnyem
Towards a Notion of Transaction in Graph Rewriting
2008
Electronical Notes in Theoretical Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
We define transactional graph transformation systems (t-gtss), a mild extension of the ordinary framework for the double-pushout approach to graph transformation, which allows to model transactional activities ...
A transaction is then a suitably defined minimal computation which starts and ends in stable states. ...
In this paper we face, from a foundational perspective, the problem of equipping graph transformation with mechanisms for modelling transactions. ...
doi:10.1016/j.entcs.2008.04.028
fatcat:uvap737wa5fczeurw676klcy3m
Semantic Technology for Capturing Communication Inside an Organization
2009
IEEE Internet Computing
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2012; you can also visit the original URL.
The file type is application/pdf.
We conclude that the proposed approach is useful and applicable in real life situations where the goal is to model social structures based on communication records. ...
We propose an approach consisting of five major steps that enable transformation of the data from a given e-mail transactions recordings to a light-weight ontology estimating structure of the organization ...
The first transformation transforms a collection of e-mail transactions into an e-mail graph. ...
doi:10.1109/mic.2009.88
fatcat:qb25drqosjfkvjwgn7x4y5lptu
Directed Graph based Distributed Sequential Pattern Mining Using Hadoop MapReduce
2015
International Journal on Recent and Innovation Trends in Computing and Communication
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
We use transformed database to reduce scanning time and directed graph to optimize the memory storage. ...
In DSPM single directed graph is used to generate projected database and finding patterns. ...
Transformed database is generated from length-1 frequent items. Directed graph is constructed to store transformed database which is used as input for next map reduce model in phase 2. ...
doi:10.17762/ijritcc2321-8169.150202
fatcat:bnvvpmieyvbyfbcy4rgyjtnimq
A Parallel Execution Model for Database Transactions
1997
Database Systems for Advanced Applications '97
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
An execution plan is then used for generating new transaction code where compatible methods are scheduled for parallel execution. ...
This paper explains our approach for optimizing the execution of object-oriented database transactions. We provide for parallel execution of methods inside atomic transactions. ...
Graph transformation algorithm creates blocs of vertices inside transaction graphs. It follows a transaction graph and performs two main steps: 1. ...
doi:10.1142/9789812819536_0053
fatcat:olblummexfconfnpujjldeimxi
Defining visual notations and their manipulation through meta-modelling and graph transformation
2004
Journal of Visual Languages and Computing
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
As models, meta-models and meta-meta-models can be represented as attributed, typed graphs, these operations can be expressed using graph grammars [2] . ...
This paper presents a framework for the definition of visual notations (both syntax and semantics) based on meta-modelling and graph transformation. ...
Acknowledgements The authors would like to thank the anonymous referees for their accurate and very useful comments. ...
doi:10.1016/j.jvlc.2004.01.005
fatcat:rkqcpt4ilvcndl4uosixpf3djm
Constraint graphs as security filters for privacy assurance in medical transactions
2011
Proceedings of the 2nd ACM Conference on Bioinformatics, Computational Biology and Biomedicine - BCB '11
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2012; you can also visit the original URL.
The file type is application/pdf.
We model transactions as exchange of graphs and propose constraint graphs as transaction filters for attribute-based transformations in clinical settings. ...
Results of our experiments using constraint graphs are consistent with published benchmark results. ...
We model graphs as the currency for transactions. Pattern graphs in GraphQL are extended to prototype graphs and forms the basis for constraint graphs. ...
doi:10.1145/2147805.2147883
dblp:conf/bcb/MathewO11
fatcat:mewlvqzv4jccvm66eylhrdlud4
Metamodel-Based Model Transformation with Aspect-Oriented Constraints
2006
Electronical Notes in Theoretical Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
A widely used approach to model transformation uses graph rewriting as the underlying transformation technique. ...
The use of OCL as a constraint and query language in modeling is essential. We have shown that it can be applied to model transformations as well. ...
This mathematical background makes it possible to treat models as labeled graphs and to apply graph transformation algorithms to models using graph rewriting [15] . ...
doi:10.1016/j.entcs.2005.10.020
fatcat:zvhxjknzzzeh7bknb2vlbe2fkm
Model-Driven Software Development with Graph Transformations: A Comparative Case Study
[chapter]
2008
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Significant achievements have been made in the design and implementation of languages and tools for graph transformation systems. ...
We compare these approaches with respect to the respective levels of abstraction on which models are defined, the language concepts offered, and the resulting modeling effort. ...
Transactions are primarily used for wrapping graph transformations with consistency checks. Expressiveness. ...
doi:10.1007/978-3-540-89020-1_24
fatcat:qid656pu3zdy3n55ptxfx4qlc4
Checking Business Process Models for Compliance – Comparing Graph Matching and Temporal Logic
[chapter]
2019
Lecture Notes in Business Information Processing
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Two dominant concepts in this area are graph-based pattern matching and pattern matching based on temporal logic. ...
A key objective of BPCM is to ensure and maintain compliance of business processes models with certain regulations, e.g. governmental laws. ...
As graph matching is able to directly operate on the process model, the pattern is directly mapped to elements of the process model using algorithms of graph matching. ...
doi:10.1007/978-3-030-11641-5_32
fatcat:5k4vwf6oojg7doeeigq2ufs2du
E3value to BPMN Model Transformation
[chapter]
2011
IFIP Advances in Information and Communication Technology
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
This case study addresses the model transformation between e3value and BPMN, commonly used for modeling business collaborations from value and coordination perspectives respectively. ...
A business value model shows what is offered by whom to whom while a coordination process model shows how these offerings are fulfilled operationally. ...
This paper discusses the automation of this transformation process by modeling the value model in a graph and applying transformation rules on it using a graph transformation tool (Groove) [13] . ...
doi:10.1007/978-3-642-23330-2_37
fatcat:jufwtxssfvhrrms5qopvafszyq
Pattern Control of Injection Molding Machine with Polygon Graph
多角形表示による射出成形機のパターン制御
1988
Transactions of the Society of Instrument and Control Engineers
多角形表示による射出成形機のパターン制御
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
The characteristics of resin and the dynamical model of the control system is also obtained for the transformation from the desired value to the polygon graph. ...
The purpose of the study is to design a manmachine system in the injection molding process using a polygon graph, which is transformed from the desired value and the control value. ...
The characteristics of resin and the dynamical model of the control system is also obtained for the transformation from the desired value to the polygon graph. ...
doi:10.9746/sicetr1965.24.276
fatcat:uofq7vp2izbsdetvgx4pxmsvn4
Transaction Routing and its Verification by Correct Model Transformations
2006
High Level Design Validation and Test Workshop (HLDVT), IEEE International
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
The transformations are proven correct using our notion of equivalence. We also present methods for deriving the proof of equivalence between the abstract model and the refined model . ...
This paper presents model transformations that are encountered in refining an abstract point-to-point transaction between two processes into a complex transaction, routed over the communication architecture ...
The transformation rules in Section III were then used to derive the graph for high TLM from graph for low TLM. ...
doi:10.1109/hldvt.2006.319975
dblp:conf/hldvt/AbdiG06
fatcat:jiqo55zfwzfrfbis4i2xj52xr4
Modelling graph dynamics in fraud detection with "Attention"
[article]
2022
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is application/pdf.
We first construct dynamic heterogeneous graphs from registration and transaction data from eBay. Then, we build models with diachronic entity embedding and heterogeneous graph transformer. ...
We also use model explainability techniques to understand the behaviors of DyHGN-* models. ...
Therefore, using larger diachronic embedding size could be beneficial. (3) The power of heterogeneous graph transformer. ...
arXiv:2204.10614v1
fatcat:qzdwnp2ju5h4xo2dqynkhd56l4
« Previous
Showing results 1 — 15 out of 85,346 results