In this paper we describe Enron email corpus in graph/network data format. Nodes of the graph are emails connected with named entities (NE) extracted from text like people, email addresses, telephone numbers. Edges are links between NE representing concurrence in same email part, paragraph, sentence or composite NE. Enron Graph corpus contains a few millions of nodes and it is quite large corpu...

Existing techniques for Web service discovery focus mainly on matching functional parameters of atomic services, such as inputs and outputs. However, one of the main advantages of Web services is that they are often composed into more complex processes to achieve a given goal. Applying such techniques in these cases, ignores the workflow structure of the composite process, and therefore may pro...

The first part of our paper presents a composite programmable graph grammar model for the self-adaptive two dimensional hp Finite Element Method algorithms (2D hp-FEM) with mixed triangular and rectangular finite elements. The two dimensional model is a starting point for the three dimensional model of self-adaptive hp-FEM presented in the second part of this paper. A computational mesh is repr...

This paper considers a graph-oriented, nonprocedural, development environment where new composite programs are constructed by coupling a collection of existing component programs, each of whose interface is defined by a fixed number of input ports and output ports. When the coupling graph is cyclic there is the possibility of a deadlock. The intent of this paper is to present a system that perm...

In this paper, we propose a new framework of model transformation that combines graph transformation with algebraic specification. While graph transformation is well-suited to describe the transformation of visual models, one can observe that models are often composite structures with visual, graphical and diagrammatic components accompanied by all kinds of data objects like strings, sets, numb...

We shall prove that a connected graph G is projective-planar if and only if it has a 2n-fold planar connected covering obtained as a composition of an n-fold covering and a double covering for some n¿ 1 and show that every planar regular covering of a nonplanar graph is such a composite covering. c © 2002 Elsevier Science B.V. All rights reserved.

Composite likelihood methods provide a wide spectrum of computationally efficient techniques for statistical tasks such as parameter estimation and model selection. In this paper, we present a formal connection between the optimization of composite likelihoods and the well-known contrastive divergence algorithm. In particular, we show that composite likelihoods can be stochastically optimized b...

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...