38959890
The bandwidth sum of join and composition of graphs
Given a graph G, a proper labeling f of G is a one-to-one function f:V(G)->{1,2,...,|V(G)|}. The bandwidth sum of a graph G, denoted by B"s(G), is defined by B"s(G)=min@?"u"v"@?"E"("G")|f(u)-f(v)|, where the minimum is taken for all proper labelings f of G. In this paper, we give some results for the bandwidth sum problem for the join of k graphs G"1,G"2,...,G"k, where each G"i is a path, cycle, complete graph, or union of isolated vertices. We also discuss the bandwidth sum for the composition of two graphs G and H, where G and H are path, cycle, or union of isolated vertices.
36905463
Quasi-threshold Graphs
Abstract Quasi-threshold graphs are defined recursively by the following rules: 1. (1) K1 is a quasi-threshold graph, 2. (2) adding a new vertex adjacent to all vertices of a quasi-threshold graph results in a quasi-threshold graph, 3. (3) the disjoint union of two quasi-threshold graphs is a quasi-threshold graph. This paper gives some new equivalent definitions of a quasi-threshold graph. From them, linear time recognition algorithms follow. We also give linear time algorithms for the edge domination problem and the bandwidth problem in this class of graphs.
15940423
k-Path Partitions in Trees
For a fixed positive integer k, the k-path partition problem is to partition the vertex set of a graph into the smallest number of paths such that each path has at most k vertices. The 2-path partition problem is equivalent to the edge-cover problem. This paper presents a linear-time algorithm for the k-path partition problem in trees. The algorithm is applicable to the problem of finding the minimum number of message originators necessary to broadcast a message to all vertices in a tree network in one or two time units.
16598523
Algorithmic Aspects of the Generalized Clique-transversal Problem on Chordal Graphs
Suppose G = (V, E) is a graph in which each maximal clique Ci is associated with an integer ri, where 0 ⩽ ri ⩽ ¦Ci¦. The generalized clique transversal problem is to determine the minimum cardinality of a subset D of V such that ¦D ∩ Ci¦ ⩾ ri for every maximal clique Ci of G. The problem includes the clique-transversal problem, the i, 1 clique-cover problem, and for perfect graphs, the maximum q-colorable subgraph problems as special cases. This paper gives complexity results for the problem on subclasses of chordal graphs, e.g., strongly chordal graphs, k-trees, split graphs, and undirected path graphs.
14117241
Denial of Service: Another Example
Although denial of service attack has been becoming a fast-growing concern in security research, previous work focused on a type of classical denial of service caused by resource exhaustion. In this paper, a different type of network denial of service attack is discussed. Since traditional models and countermeasures are not applicable, we discuss solutions that can defend this non-classical service denial attack.
18875168
Towards Autonomous Service Level Agreement Negotiation for Adaptive Service Composition
This paper reports innovative research aiming at supporting autonomous establishment and maintenance of service level agreements in order to guarantee end-to-end quality of service requirements for service composition provision. In this research, a set of interrelated service level agreements is established and maintained for a service composition, through autonomous agent negotiation. To enable this, an innovative framework is proposed in which agents on behalf of the service requestor and the service providers can negotiate service level agreements in a coordinated way. This framework also enables adaptive service level agreement re-negotiation in the dynamic and ever-changing service environment
1380525
Towards a force-reflecting motion-scale system for microsurgery
This paper presents design aspects of a force-reflecting, motion-scaling teleoperation system for use in microsurgery experiments. A coarse-macro-micro approach is proposed. Two magnetically levitated wrists-a macro-master and a micro-slave-would share a common base positioned at the surgical site by a coarse-motion transport robot. The discussion includes features of the proposed system, a detailed slave wrist description, and aspects of coordination and control for the multistage teleoperation.<<ETX>>
34419420
A Semantic Analyzer for Aiding Emotion Recognition in Chinese
15557099
Enacting Business Processes in a Decentralised Environment with p2p-Based Workflow Support
Traditionally, workflow adopts a centralised client/server architecture to enact processes, which has exhibited many weaknesses. This paper combines concepts from workflow technology and peer-to-peer computing and presents an innovative approach to support decentralised process enactment. With this approach, both process instantiation and instance execution are carried out in a genuinely decentralised fashion, which reflects applications’ increasingly distributed nature better. In general, the process instance is created with relevant participants creating various task instances at different locations. In addition, instance execution is coordinated through direct communication among relevant workflow participants.