This article proposes a general graph-based representation for modeling Object Oriented (OO) software designs. The advantages of the representation over the Unified Modeling Language (UML) are: it formalizes the link between primitive OO design features and primitive entities of graphs; it models all the design features of an OO design in one cohesive graph; it provides us a convenient platform...

Though it is commonly agreed that the design of large database schemata requires group effort, database design from component subschemata has not been investigated thoroughly. In this paper we investigate snowflake-like subschemata of database schemata expressed in the Higher-order Entity-Relationship Model (HERM). These subschemata are almost hierarchical in the sense that they may contain cyc...

We present a novel circuit representation scheme, namely bond graph, along with strong-typed genetic programming for the evolution of analog filter circuits. Bond graph is a concise and uniform language for the description of circuit systems and more general engineering systems. Many unique characteristics of bond graph makes it an attractive candidate for representing circuit in genetic progra...

The intersection graph of a collection of trapezoids with corner points lying on two parallel lines is called a trapezoid graph. These graphs and their generalizations were applied in various fields, including modeling channel routing problems in VLSI design and identifying the optimal chain of non-overlapping fragments in bioinformatics. Using modified binary indexed tree data structure, we de...

This paper develops adaptive graph filters that operate in reproducing kernel Hilbert spaces. We consider both centralized and fully distributed implementations. first define nonlinear on graph-shifted versions of the input signal. then propose a least mean squares (GKLMS) algorithm to identify filters' model parameters. To reduce dictionary size GKLMS, we apply principles coherence check rando...

A divisible design graph is a graph whose adjacency matrix is the incidence matrix of a divisible design. Divisible design graphs are a natural generalization of (v, k, λ)-graphs, and like (v, k, λ)-graphs they make a link between combinatorial design theory and algebraic graph theory. The study of divisible design graphs benefits from, and contributes to, both parts. Using information of the e...

The concept of super line graph was introduced in the year 1995 by Bagga, Beineke and Varma. Given a graph with at least r edges, the super line graph of index r, Lr(G), has as its vertices the sets of r-edges of G, with two adjacent if there is an edge in one set adjacent to an edge in the other set. The line completion number lc(G) of a graph G is the least positive integer r for which Lr(G) ...

Design support in chemical engineering is typically connected with the configuration of the technical devices that realize a chemical process. In fact, the configuration step is a rather finishing job within the entire design process, and several hurdles have been taken by the designer before. This paper outlines both an idea and a methodology to realize a design support right from the start of...