29006676
A Remote Resource Monitoring Approach in Active Networks
Monitoring the resource status in active network nodes is important both for the network administrator to maintain and deploy active networks and for the normal end-users to acquire better performance. Hence, a method that can monitor the resource status at a remote node is needed. Moreover, due to the complexity of the resource usage in active networks, the corresponding method should be able to monitor the status of various resources at remote node dynamically and in a user-specified way. This paper presents the design and implementation of such a resource monitoring method. The method adopts the active application technique to obtain the desired resource status information at a remote network node and transfer them back to the user in the user-specified way. It also allows the user to control the content, the procedure and the precise of the monitoring.
1111436
Adaptive resource management in active network nodes
Resource management in active network nodes is challenging because more types and amount of resources are needed compared with traditional networks, and the consumption of different types of resources is not equally balanced. Hence, it is possible and important to consider the relationship between different types of resources, needed by an application. Adaptation of applications resource usages in network nodes enables the applications to react promptly to the resource status in the network nodes and therefore offers a better performance guarantee and more flexibility to the applications. This paper studies the resource management in active network nodes considering the relationship among different types of resources. The resource vectors (RVs) are introduced to describe the resource requirements of applications and their adaptation capabilities. And an adaptive resource management mechanism based on RV is proposed and the implementation of it in an active node is given.
11166931
Automatic Extraction of Hierarchical Relations from Text
Automatic extraction of semantic relationships between entity instances in an ontology is useful for attaching richer semantic metadata to documents. In this paper we propose an SVM based approach to hierarchical relation extraction, using features derived automatically from a number of GATE-based open-source language processing tools. In comparison to the previous works, we use several new features including part of speech tag, entity subtype, entity class, entity role, semantic representation of sentence and WordNet synonym set. The impact of the features on the performance is investigated, as is the impact of the relation classification hierarchy. The results show there is a trade-off among these factors for relation extraction and the features containing more information such as semantic ones can improve the performance of the ontological relation extraction task.
18109263
Automatically Acquiring Training Sets for Web Information Gathering
The traditional techniques rely on human effort to acquire training sets, which is expensive and inefficient. In this paper we present an alternative method to automatically acquire training sets without heavy investment of user efforts. The proposed method tends to fill a gap for effectiveness of using Web data in Web mining, and contributes to Web information gathering. The evaluation shows that the method is adequate to yield an promising achievement
7971918
An Efficient Algorithm for Fault Tolerant Routing Based on Adaptive Binomial-Tree Technique in Hypercubes
We propose an efficient fault-tolerant routing algorithm for hypercube networks with a very large number of faulty nodes. The algorithm is distributed and local-information-based in the sense that each node in the network knows only its neighbors’ status and no global information of the network is required by the algorithm. For any two given nonfaulty nodes in a hypercube network that may contain a large fraction of faulty nodes, the algorithm can find a fault-free path of nearly optimal length with very high probability. The algorithm uses the adaptive binomial-tree to select a suitable dimension to route a node. We perform empirical analysis of our algorithm through simulations under a uniform node failure distribution and a clustered node failure distribution. The experimental results show that the algorithm successfully finds a fault-free path of nearly optimal length with the probability larger than 90 percent in a hypercube network that may contain up to 50 percent faulty nodes.
1293275
Getting work done on the web: supporting transactional queries
Many searches on the web have a transactional intent. We argue that pages satisfying transactional needs can be distinguished from the more common pages that have some information and links, but cannot be used to execute a transaction. Based on this hypothesis, we provide a recipe for constructing a transaction annotator. By constructing an annotator with one corpus and then demonstrating its classification performance on another,we establish its robustness. Finally, we show experimentally that a search procedure that exploits such pre-annotation greatly outperforms traditional search for retrieving transactional pages.
24660543
A note on the lower bounds of signed domination number of a graph
Abstract Let G = (V, E) be a graph. For a function f : V → {−1, 1}, the weight of f is w(f) = Σv ∈ V f(v). For a vertex v in V, we define f[v] = Σu∈N[v] f(u). A signed dominating function of G is a function f : V → {−1, 1} such that f[v] ⩾ 1 for all v ∈ V. The signed domination number γs(G) of G is the minimum weight of a signed dominating function on G. A signed dominating function of a weight γs(G) we call a γs-function of G. In this paper, we study the signed domination problem of general graph, and obtain some lower bounds of the signed domination number of a graph, and show that these lower bounds are sharp, and extend a result in Dunbar et al. (1995).