This paper analyses the specification of agent control and agent knowledge in DAML-S and its conversion into executable code. Instead of the usual XML syntax, we propose a S-Expression syntax of DAML-S, which facilitates introducing two extensions in DAML-S specification: concrete definitions of concepts used in DAML-S service descriptions, which were not defined in the DAML-S specification; an...

Unextendible product basis is an important object in quantum information theory and features a broad spectrum of applications, ranging bound entangled states, nonlocality without entanglement, Bell inequalities with no violation. A generalized concept called uncompletable also attracts much attention. In this paper, we find some unextendible bases that are every bipartition, which answers 19 ye...

In this paper, we develop some clique-based methods for social network clustering. The quality of clustering result is measured by a novel cliquebased index, which is innovated from the modularity index proposed in [12]. We design an effective algorithm based on recursive bipartition in order to maximize the objective function of the proposed index. Noting the optimization of the objective func...

Suppose G = (S; T; E) is a bipartite graph, where (S; T) is a bipartition of the vertex set. A-assignment is an edge set X E such that deg X (i) = 1 for all i 2 S. The cardinality-assignment problem is to nd a-assignment X which minimizes (X) = max j2T deg X (j). Suppose we associate every edge with a weight which is a real number. The bottleneck-assignment problem is to nd a-assignment X that ...

Let G = (V,E) be a graph. A set S ⊆ V is a total restrained dominating set if every vertex is adjacent to a vertex in S and every vertex of V − S is adjacent to a vertex in V − S. The total restrained domination number of G, denoted by γtr(G), is the smallest cardinality of a total restrained dominating set of G. We show that if T is a tree of order n, then γtr(T ) ≥ d(n + 2)/2e. Moreover, we s...

A vertex-colored graph G is rainbow vertex-connected if two vertices are connected by a path whose internal vertices have distinct colors. The rainbow vertex-connection number of a connected graph G, denoted by rvc(G), is the smallest number of colors that are needed in order to make G rainbow vertex-connected. If for every pair u, v of distinct vertices, G contains a vertex-rainbow u−v geodesi...

A dominating set S in a graph G is a tree dominating set of G if the subgraph induced by S is a tree. The tree domatic number of G is the maximum number of pairwise disjoint tree dominating sets in V (G). First, some exact values of and sharp bounds for the tree domatic number are given. Then, we establish a sharp lower bound for the number of edges in a connected graph of given order and given...