Design Patterns are proven solution to common recurring design problems. Design Pattern Detection is most important activity that may support a lot to re-engineering process and thus gives significant information to the designer. Knowledge of design pattern exists in the system design improves the program understanding and software maintenance. Therefore, an automatic and reliable design patter...

it is necessary to generate the automorphism group of a chemical graph in computer-aidedstructure elucidation. an euclidean graph associated with a molecule is defined by a weightedgraph with adjacency matrix m = [dij], where for i≠j, dij is the euclidean distance between thenuclei i and j. in this matrix dii can be taken as zero if all the nuclei are equivalent. otherwise,one may introduce dif...

in this paper, we introduce the notions of product vague graph, balanced product vague graph, irregularity and total irregularity of any irregular vague graphs and some results are presented. also, density and balanced irregular vague graphs are discussed and some of their properties are established. finally we give an application of vague digraphs.

Transformational design integrates design and verification. It combines “correctness by construction” and design creativity by the use of pre-proven behaviour preserving transformations as design steps. The formal aspects of this methodology are hidden in the transformations. A constraint is the availability of a design representation with a compositional formal semantics. Graph representations...

Let G(V;E) be a graph. The common neighborhood graph (congraph) of G is a graph with vertex set V , in which two vertices are adjacent if and only if they have a common neighbor in G. In this paper, we obtain characteristics of congraphs under graph operations; Graph :::::union:::::, Graph cartesian product, Graph tensor product, and Graph join, and relations between Cayley graphs and its c...

The work reported in the paper employs a general approach of associating engineering domains with general discrete mathematical models, called – graph representations. Once the engineering system is represented by a graph representation, all the reasoning processes upon the system are substituted by a reasoning of a more mathematical nature over the graph representation. Accordingly, graph repr...

Basic operations in graph signal processing consist in processing signals indexed on graphs either by filtering them, to extract specific part out of them, or by changing their domain of representation, using some transformation or dictionary more adapted to represent the information contained in them. The aim of this chapter is to review general concepts for the introduction of filters and rep...

This paper presents PLCTools, a formal environment for designing and simulating programmable controllers. Control models are specified with IEC FBD (Function Block Diagram), and translated into functionally equivalent HLTPNs (High-Level Timed Petri Nets), through MetaEnv, for analysis and simulation and obtained results are presented in terms of suitable animations of FBD blocks. The peculiarit...

We examine the number of controlled experiments required to discover a causal graph. Hauser and Buhlmann [1] showed that the number of experiments required is logarithmic in the cardinality of maximum undirected clique in the essential graph. Their lower bounds, however, assume that the experiment designer cannot use randomization in selecting the experiments. We show that significant improveme...

Many applications, from everyday file system browsers to visual programming tools, require the display of network and graph structures. The Graph Visualization Framework (GVF) is an architecture that supports the tasks common to most graph browsers and editors. This article gives a brief overview of the design of the GVF and focuses on the core classes that are used to represent and manipulate ...