For many educational applications such as learning tools for argumentation, structured diagrams are a suitable form of external representation. However, student-created graphs pose some problems to ITS designers, especially in defined domains. This paper demonstrates a graph-grammar-based approach for ITS construction in domains that benefit from diagram representations. For these, graph gramma...

Scalable Graph-Based Learning Applied to Human Language Technology Andrei Alexandrescu Chair of the Supervisory Committee: Associate Research Professor Katrin Kirchhoff Electrical Engineering Graph-based semi-supervised learning techniques have recently attracted increasing attention as a means to utilize unlabeled data in machine learning by placing data points in a similarity graph. However, ...

Reverse engineering tools are mostly based on analyzing code repositories. Various technological spaces for realizing these repositories including appropriate analysis techniques exist. Graph technology and semantic web based technologies provide elaborated and sufficient means to analyze software structures. This paper elaborates differences and similarities of both technological spaces by com...

This paper describes basic programming technology to support irregular applications on scalable concurrent hardware and shows how the technology has been applied to a variety of large-scale industrial application problems. The technology is based on the concept of a concurrent graph library that provides an adaptive collection of lightweight threads that may relocate between computers dynamical...

A taxonomy of model transformations was introduced in [18]. Among others, such a taxonomy can help developers in deciding which language, forma lism, tool or mechanism is best suited to carry out a particular model transformation activity. In this paper we apply the taxonomy to the technique of graph transformation, and we exemplify it by referring to four representative graph transformation to...

This is a report on our experiences of applying graph technology in the application area of creating and maintaining structured digital documents during the last four years. Our aim is to contribute to the development of tools for authors of documents with an inherent content structure, such as scientific articles or textbooks, that help building and maintaining that structure. One goal of stru...

The periphery graph of a median graph is the intersection graph of its peripheral subgraphs. We show that every graph without a universal vertex can be realized as the periphery graph of a median graph. We characterize those median graphs whose periphery graph is the join ∗Work supported by the Ministry of Science of Slovenia and by the Ministry of Science and Technology of India under the bila...

5 Many systems undergo significant architecture-level change throughout their lifecycles in order to adapt to new operating and funding contexts, to react to failed technology development, or to incorporate new technologies. In all cases early architecture selection and technology investment decisions will constrain the system to certain regions of the tradespace, which can limit the evolvabili...

TGraphs are directed graphs with typed, attributed, and ordered nodes and edges. These properties leverage the use of graphs as models for all kinds of artifacts in the context of software reengineering. TGraphs are accompanied by metamodel based technologies to define, manipulate, analyze, query, visualize, and transform graphs. This paper summarizes the work accomplished around TGraphs and gr...

let $g$ be a non-abelian finite group. in this paper, we prove that $gamma(g)$ is $k_4$-free if and only if $g cong a times p$, where $a$ is an abelian group, $p$ is a $2$-group and $g/z(g) cong mathbb{ z}_2 times mathbb{z}_2$. also, we show that $gamma(g)$ is $k_{1,3}$-free if and only if $g cong {mathbb{s}}_3,~d_8$ or $q_8$.