Shedding Light on the Graph Schema: Perceptual Features vs. Invariant Structure

2008 ◽  
Author(s):  
Raj M. Ratwani ◽  
J. G. Trafton
2021 ◽  
Vol 12 ◽  
Author(s):  
Fang Zhao ◽  
Robert Gaschler

Different graph types might differ in group comparison due to differences in underlying graph schemas. Thus, this study examined whether graph schemas are based on perceptual features (i.e., each graph has a specific schema) or common invariant structures (i.e., graphs share several common schemas), and which graphic type (bar vs. dot vs. tally) is the best to compare discrete groups. Three experiments were conducted using the mixing-costs paradigm. Participants received graphs with quantities for three groups in randomized positions and were given the task of comparing two groups. The results suggested that graph schemas are based on a common invariant structure. Tally charts mixed either with bar graphs or with dot graphs showed mixing costs. Yet, bar and dot graphs showed no mixing costs when paired together. Tally charts were the more efficient format for group comparison compared to bar graphs. Moreover, processing time increased when the position difference of compared groups was increased.


Author(s):  
A.H. Advani ◽  
L.E. Murr ◽  
D.J. Matlock ◽  
W.W. Fisher ◽  
P.M. Tarin ◽  
...  

Coherent annealing-twin boundaries are constant structure and energy interfaces with an average interfacial free energy of ∼19mJ/m2 versus ∼210 and ∼835mJ/m2 for incoherent twins and “regular” grain boundaries respectively in 304 stainless steels (SS). Due to their low energy, coherent twins form carbides about a factor of 100 slower than grain boundaries, and limited work has also shown differences in Cr-depletion (sensitization) between twin versus grain boundaries. Plastic deformation, may, however, alter the kinetics and thermodynamics of twin-sensitization which is not well understood. The objective of this work was to understand the mechanisms of carbide precipitation and Cr-depletion on coherent twin boundaries in deformed SS. The research is directed toward using this invariant structure and energy interface to understand and model the role of interfacial characteristics on deformation-induced sensitization in SS. Carbides and Cr-depletion were examined on a 20%-strain, 0.051%C-304SS, heat treated to 625°C-4.5h, as described elsewhere.


Author(s):  
A. S. Grigorev ◽  
V. A. Gorodnyi ◽  
O. V. Frolova ◽  
A. M. Kondratenko ◽  
V. D. Dolgaya ◽  
...  

Author(s):  
Seungmin Seo ◽  
Byungkook Oh ◽  
Eunju Jo ◽  
Sanghak Lee ◽  
Dongho Lee ◽  
...  

Author(s):  
VAHID RAFE ◽  
ADEL T. RAHMANI

Graph Grammars have recently become more and more popular as a general formal modeling language. Behavioral modeling of dynamic systems and model to model transformations are a few well-known examples in which graphs have proven their usefulness in software engineering. A special type of graph transformation systems is layered graphs. Layered graphs are a suitable formalism for modeling hierarchical systems. However, most of the research so far concentrated on graph transformation systems as a modeling means, without considering the need for suitable analysis tools. In this paper we concentrate on how to analyze these models. We will describe our approach to show how one can verify the designed graph transformation systems. To verify graph transformation systems we use a novel approach: using Bogor model checker to verify graph transformation systems. The AGG-like graph transformation systems are translated to BIR — the input language of Bogor — and Bogor verifies that model against some properties defined by combining LTL and special purpose graph rules. Supporting schema-based and layered graphs characterize our approach among existing solutions for verification of graph transformation systems.


Sign in / Sign up

Export Citation Format

Share Document