The Web Service Composition (WSC) is a prominent technique to help software developers to easily build applications on top of the Service Oriented Architecture. Given a set of web services and a user request, the aim of the WSC problem is to construct an optimal composite web service to satisfy the request. In this paper, in particular, we study the Quality of Services (QoS)-aware WSC problem t...

Describing graphs: Exponents vs. Averages. Power-laws provide a new way to describe topological properties. Average values falsely imply a uniform distribution, and they can be misleading. For example, 85% of the AS-nodes in December 1998 had an outdegree less than the average outdegree! Protocol performance: Formulas based on power-laws provide estimates for the effective diameter, the average...

So far, trust evaluation models depend highly on collected evidences, which are mainly in the form of ratings, to produce trust values [3]. However, many situations require agents to form groups to provide more complicated services (composite services); meanwhile, consumers rate the quality of a composite service as a whole rather than individual group members [2]. Namely, all providers, who ar...

A {it topological index} of a graph is a real number related to the graph; it does not depend on labeling or pictorial representation of a graph. In this paper, we present the upper bounds for the product version of reciprocal degree distance of the tensor product, join and strong product of two graphs in terms of other graph invariants including the Harary index and Zagreb indices.

The present RDF is opaque in reusing the descriptions in ready-made metadata repositories. To enhance reusability of descriptions in RDF/XML, we need a unit for packaging a set of descriptions on a semantic schema level. And, we may need a new rule to handle a composite unit of not linearfold but link-based or graph data structure, and serialize it to reuse.

A graph G is 1-homogeneous if certain isomorphisms between similarly embedded induced subgraphs of G extend to automorphisms of G. We show that the only connected composite 1-homogeneous graphs are the cube, and Kn ×K2 and Kn ×Kn with n ≥ 2.

Some new relations have been established between Wiener indices, stability numbers and clique numbers for several classes of composite graphs that arise via graph products. For three of considered operations we show that they make a multiplicative pair with the clique number. 2010 Mathematics Subject Classification: 05C40, 05C90

The smallest number of edges that have to be deleted from a graph to obtain a bipartite spanning subgraph is called the bipartite edge frustration of G and denoted by φ(G). In this paper we determine the bipartite edge frustration of some classes of composite graphs. © 2010 Elsevier B.V. All rights reserved.

Locally preserving projection (LPP) does not take advantage of the spatial correlation of pixels in the image, and the pixels are considered as independent pieces of information. In this paper, a kernel based manifold learning feature extraction method which considers spatial relationship of neighboring pixels, called supervised composite kernel locality preserving projection (SCKLPP), is propo...

Model-driven development (MDD) has become a promising trend in software engineering. The model-driven development of highly complex software systems may lead to large models which deserve a modularization concept to enable their structured development in larger teams. Graphs are a natural way to represent the underlying structure of visual models. Typed graphs with inheritance and containment a...