The paper presents a system of Composite Graph Grammars (CGGs) modelling adaptive two dimensional hp Finite Element Method (hp-FEM) algorithms with rectangular finite elements. A computational mesh is represented by a composite graph. The operations performed over the mesh are defined by the graph grammar rules. The CGG system contains different graph grammars defining different kinds of rules ...

This paper presents a formalization of the Web Service composition problem as a search problem in an AND/OR graph, and a search algorithm for searching the graph to identify composite service(s) that satisfies a Web Service request. Given a service request that only can be satisfied by a composition of Web Services, we identify the service categories that are relevant to the request and dynamic...

In this paper we generalize the concept of alternating knots to alternating graphs and show that every abstract graph has a spatial embedding that is alternating. We also prove that every spatial graph is a subgraph of an alternating graph. We define n-composition for spatial graphs and generalize the results of Menasco on alternating knots to show that an alternating graph is n-composite for n...

let $g$ be a connected graph. the multiplicative zagreb eccentricity indices of $g$ are defined respectively as ${bf pi}_1^*(g)=prod_{vin v(g)}varepsilon_g^2(v)$ and ${bf pi}_2^*(g)=prod_{uvin e(g)}varepsilon_g(u)varepsilon_g(v)$, where $varepsilon_g(v)$ is the eccentricity of vertex $v$ in graph $g$ and $varepsilon_g^2(v)=(varepsilon_g(v))^2$. in this paper, we present some bounds of the multi...

Let G = (V,E) be a planar graph. An arrangement of circular arcs is called a composite arc-drawing of G, if its 1-skeleton is isomorphic to G. Similarly, a composite segment-drawing is described by an arrangement of straight-line segments. We ask for the smallest possible ground set of arcs/segments for a composite arc/segment-drawing. We present algorithms for constructing composite arc-drawin...

This paper presents an image blending approach which combines optimal seam finding and transition smoothing for merging a set of aligned source images into a composite panoramic image seamlessly. In this approach, graph cut optimization is used for finding optimal seams in overlapping areas of the source images to create a composite image. If the seams in the composite image are still visible, ...

In this work, we show a general approach for inhomogeneous composite thermoelectric systems, and as an illustrative case, we consider a dual thermoelectric cooler. This composite cooler consists of two thermoelectric modules (TEMs) connected thermally in parallel and electrically in series. Each TEM has different thermoelectric (TE) properties, namely thermal conductance, electrical resistance ...

This paper proposes an adaptation mechanism based on adaptation planning graph for servicebased business processes. First, a three-layer representation model of service-based business process is introduced. Second, control-flow patterns of tasks, goal, logic model of service-based business process and adaptation planning graph are introduced to enforce reliability of composite web services at r...

the vertex-edge wiener index of a simple connected graph g is defined as the sum of distances between vertices and edges of g. two possible distances d_1(u,e|g) and d_2(u,e|g) between a vertex u and an edge e of g were considered in the literature and according to them, the corresponding vertex-edge wiener indices w_{ve_1}(g) and w_{ve_2}(g) were introduced. in this paper, we present exact form...