Specification of error distances for graphs by precedence graph grammars and fast recognition of similarity

1987 ◽  
pp. 29-40 ◽  
Author(s):  
Manfred Kaul
Keyword(s):  
Graph Grammars ◽  
Fast Recognition ◽  
Precedence Graph

On the Expressiveness of Context-Sensitive Graph Grammars

2012 ◽  
Vol 23 (7) ◽  
pp. 1635-1655 ◽  
Author(s):  
Yang ZOU ◽  
Jian LÜ ◽  
Chun CAO ◽  
Hao HU ◽  
Wei SONG ◽  
...  
Keyword(s):  
Graph Grammars ◽  
Context Sensitive

scholarly journals Deep learning-based recognition of cell structures in fluorescence microscopy sequences with respect to their morphology on cells infected with Marburg virus

2020 ◽  
Vol 6 (3) ◽  
pp. 501-504
Author(s):  
Dennis Schmidt ◽  
Andreas Rausch ◽  
Thomas Schanze
Keyword(s):  
Neural Network ◽  
Deep Learning ◽  
Infected Cell ◽  
Network Architecture ◽  
Image Sequences ◽  
Marburg Virus ◽  
Microscopic Image ◽  
Cell Structures ◽  
Fast Recognition ◽  
Subviral Particles

AbstractThe Institute of Virology at the Philipps-Universität Marburg is currently researching possible drugs to combat the Marburg virus. This involves classifying cell structures based on fluoroscopic microscopic image sequences. Conventionally, membranes of cells must be marked for better analysis, which is time consuming. In this work, an approach is presented to identify cell structures in images that are marked for subviral particles. It could be shown that there is a correlation between the distribution of subviral particles in an infected cell and the position of the cell’s structures. The segmentation is performed with a "Mask-R-CNN" algorithm, presented in this work. The model (a region-based convolutional neural network) is applied to enable a robust and fast recognition of cell structures. Furthermore, the network architecture is described. The proposed method is tested on data evaluated by experts. The results show a high potential and demonstrate that the method is suitable.

Schema Compliant Consistency Management via Triple Graph Grammars and Integer Linear Programming

2021 ◽  
Author(s):  
Nils Weidmann ◽  
Anthony Anjorin
Keyword(s):  
Linear Programming ◽  
Integer Linear Programming ◽  
Experimental Evaluation ◽  
Graph Grammars ◽  
Model Driven Engineering ◽  
Rule Based ◽  
Consistency Management ◽  
Model Driven ◽  
Triple Graph Grammars ◽  
Domain Constraints

AbstractIn the field of Model-Driven Engineering, Triple Graph Grammars (TGGs) play an important role as a rule-based means of implementing consistency management. From a declarative specification of a consistency relation, several operations including forward and backward transformations, (concurrent) synchronisation, and consistency checks can be automatically derived. For TGGs to be applicable in realistic application scenarios, expressiveness in terms of supported language features is very important. A TGG tool is schema compliant if it can take domain constraints, such as multiplicity constraints in a meta-model, into account when performing consistency management tasks. To guarantee schema compliance, most TGG tools allow application conditions to be attached as necessary to relevant rules. This strategy is problematic for at least two reasons: First, ensuring compliance to a sufficiently expressive schema for all previously mentioned derived operations is still an open challenge; to the best of our knowledge, all existing TGG tools only support a very restricted subset of application conditions. Second, it is conceptually demanding for the user to indirectly specify domain constraints as application conditions, especially because this has to be completely revisited every time the TGG or domain constraint is changed. While domain constraints can in theory be automatically transformed to obtain the required set of application conditions, this has only been successfully transferred to TGGs for a very limited subset of domain constraints. To address these limitations, this paper proposes a search-based strategy for achieving schema compliance. We show that all correctness and completeness properties, previously proven in a setting without domain constraints, still hold when schema compliance is to be additionally guaranteed. An implementation and experimental evaluation are provided to support our claim of practical applicability.

Formal manipulation of Forrester diagrams by graph grammars

1988 ◽  
Vol 18 (6) ◽  
pp. 981-996 ◽  
Author(s):  
J.J. Dolado ◽  
F.J. Torrealdea
Keyword(s):  
Graph Grammars

A Church-Rosser theorem for graph grammars

1975 ◽  
Vol 7 (3) ◽  
pp. 26-31 ◽  
Author(s):  
Barry K. Rosen
Keyword(s):  
Graph Grammars

scholarly journals Inapproximability and Polynomial-Time Approximation Algorithm for UET Tasks on Structured Processor Networks

2011 ◽  
Vol 2011 ◽  
pp. 1-20 ◽  
Author(s):  
M. Bouznif ◽  
R. Giroudeau
Keyword(s):  
Approximation Algorithm ◽  
Large Class ◽  
Bipartite Graph ◽  
Polynomial Time ◽  
Performance Guarantee ◽  
Makespan Minimization ◽  
Time Approximation ◽  
Polynomial Time Approximation Algorithm ◽  
Precedence Graph ◽  
Polynomial Time Approximation

We investigate complexity and approximation results on a processor networks where the communication delay depends on the distance between the processors performing tasks. We then prove that there is no heuristic with a performance guarantee smaller than 4/3 for makespan minimization for precedence graph on a large class of processor networks like hypercube, grid, torus, and so forth, with a fixed diameter . We extend complexity results when the precedence graph is a bipartite graph. We also design an efficient polynomial-time -approximation algorithm for the makespan minimization on processor networks with diameter .

Sign in / Sign up

Export Citation Format

Share Document