14632183
Collection of network information in active networks
Collection of information about the state of the network is very important for applications both in active networks and in traditional passive networks. However, the existing methods for the collection and prediction of network state cannot meet the needs of complex and intelligent applications. Active networks provide an environment that supports the injection and execution of application-specified codes in the network nodes, and consequently suggest possibilities for the solving of such a problem. In this article we present a new method for the collection of network state information by describing how active network techniques can be used to collect this information more freely and in a user-specific way. We give also an implementation of this approach to collect network resource information and evaluate it by measurements. By using this method, users can specify both the content and the format of the network resource information that they want to acquire as well as nodes at which they want to gather these information.
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.
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.
5886737
Using KCCA for Japanese–English cross-language information retrieval and document classification
Kernel Canonical Correlation Analysis (KCCA) is a method of correlating linear relationship between two variables in a kernel defined feature space. A machine learning algorithm based on KCCA is studied for cross-language information retrieval. We apply the algorithm in Japanese–English cross-language information retrieval. The results are quite encouraging and are significantly better than those obtained by other state of the art methods. Computational complexity is an important issue when applying KCCA to large dataset as in information retrieval. We experimentally evaluate several methods to alleviate the problem of applying KCCA to large datasets. We also investigate cross-language document classification using KCCA as well as other methods. Our results show that it is feasible to use a classifier learned in one language to classify the documents in other languages.
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
3890576
Design and experimental analysis of continuous location tracking techniques for Wizard of Oz testing
Wizard of Oz (WOz) testing has shown promise as an effective way to test location-enhanced applications. However, it is challenging to conduct a location-based WOz test because of the dynamic nature of target settings in the field. In particular, continuous location tracking, a major task in such a test, requires a wizard to frequently update a user's location to simulate a location system. This imposes a heavy task load on a wizard. To ease wizards' tasks for location tracking, we designed two techniques, Directional Crossing and Steering, and conducted a field experiment to investigate the performance of the two techniques. A quantitative analysis shows that Directional Crossing and Steering significantly lowered a wizard's task load for location tracking without sacrificing accuracy.
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).
14560604
Recent development in bioluminescence tomography
Bioluminescence tomography (BLT) is a new molecular imaging tool. Using a modality fusion approach, we built the first BLT prototype to combine BLI data and micro-CT images for proof of concept, established a theoretical framework for BLT, and reported encouraging preliminary results. In this overview, we highlight our key results and discuss further directions