Due to cost constraints and limited sensing capability of sensor nodes, it may be impossible or unrealistic for a wireless sensor network to provide full area coverage in some circumstances. In this paper, we introduc...
详细信息
Due to cost constraints and limited sensing capability of sensor nodes, it may be impossible or unrealistic for a wireless sensor network to provide full area coverage in some circumstances. In this paper, we introduce the novel concept of information-oriented sensing coverage, which measures the actual information utility obtained by a wireless sensor network. An information-oriented sensor deployment algorithm is proposed. The algorithm makes use of the fact that in many applications the importance or the information utility at different locations is non-uniform across the sensing field. The effectiveness of the proposed algorithm is studied using simulation. Being a pioneering effort in this area, our work paves a new direction of sensor deployment.
Skin surfaces are used for the modeling and visualization of molecules. They form a class of tangent continuous surfaces defined in terms of a set of balls (the atoms of the molecule) and a shrink factor. More recentl...
详细信息
Skin surfaces are used for the modeling and visualization of molecules. They form a class of tangent continuous surfaces defined in terms of a set of balls (the atoms of the molecule) and a shrink factor. More recently, skin surfaces have been used to approximate arbitrary surfaces. We present an algorithm that approximates a skin surface with a topologically correct mesh. The complexity of the mesh is linear in the size of the Delaunay triangulation of the balls, which is worst case optimal. We also adapt two existing refinement algorithms to improve the quality of the mesh and show that the same algorithm can be used for meshing a union of balls.
Many lock-free data structures in the literature exploit techniques that are possible only because state-of-the-art 64-bit processors are still running 32-bit operating systems and applications. As software catches up...
详细信息
ISBN:
(纸本)9781581138023
Many lock-free data structures in the literature exploit techniques that are possible only because state-of-the-art 64-bit processors are still running 32-bit operating systems and applications. As software catches up to hardware, "64-bit-clean" lock-free data structures, which cannot use such techniques, are needed. We present several 64-bit-clean lock-free implementations: load-linked/store-conditional variables of arbitrary size, a FIFO queue, and a freelist. In addition to being portable to 64-bit software, our implementations also improve on previous ones in that they are space-adaptive and do not require knowledge of the number of threads that will access them.
This paper provides a brief development roadmap of the neural network sensitivity analysis, from 1960's to now on. The two main streams of the sensitivity measures: partial derivative and stochastic sensitivity me...
详细信息
ISBN:
(纸本)0780384032
This paper provides a brief development roadmap of the neural network sensitivity analysis, from 1960's to now on. The two main streams of the sensitivity measures: partial derivative and stochastic sensitivity measures are compared. The partial derivative sensitivity (PD-SM) finds the rate of change of the network output with respect to parameter changes, while the stochastic sensitivity (ST-SM) finds the magnitudes of the output perturbations between the original training samples and the perturbed samples, in statistical sense. Their computational complexities are compared. Furthermore, how to evaluate multiple parameters of the neural network with or without correlation will be explored too. In addition, the differences of them in the application of supervised pattern classification problems are also discussed. The evaluations are based on three major applications of sensitivity analysis in supervised pattern classification problems: feature selection, sample selection and neural network generalization assessment ST-SM and PD-SM of the RBFNN will be used for investigations.
In this paper, a novel approach of rough set-based case-based reasoning (CBR) approach is proposed to tackle the task of text categorization (TC). The initial work of integrating both feature and document reduction/se...
详细信息
ISBN:
(纸本)0780384032
In this paper, a novel approach of rough set-based case-based reasoning (CBR) approach is proposed to tackle the task of text categorization (TC). The initial work of integrating both feature and document reduction/selection in TC using rough sets and CBR properties is presented. Rough set theory is incorporated to reduce the number of feature terms through generating reducts. On the other hand, two concepts of case coverage and case reachability in CBR are used in selecting representative documents. The main contribution of this paper is that both the number of features and the documents are reduced with minimal loss of useful information. Some experiments are conducted on the text datasets of Reuters21578. The experimental results show that, although the number of feature terms and documents are reduced greatly, the problem-solving quality in terms of classification accuracy is still preserved.
It is generally believed that the queueing behavior of an arrival process is most sensitive to its first and second order statistics. In this paper, we show that this is not generally true. We consider the queueing be...
详细信息
It is generally believed that the queueing behavior of an arrival process is most sensitive to its first and second order statistics. In this paper, we show that this is not generally true. We consider the queueing behavior of two classes of sources. The first class is the superposition of multiple discrete autoregressive sources of order 1 (referred to as DAR(1) sources), and the second class is a single DAR(1) source having the same first and second order statistics as the superposed source. In particular, we show that in the homogeneous case, the mean queue lengths of the two models are identical, but the queue length variances of the two models are significantly different depending on the correlation of individual sources.
In this paper, we present a matching method that can improve the classification performance of a fuzzy decision tree (FDT). This method takes into consideration prediction strength of leave nodes of a fuzzy decision t...
详细信息
ISBN:
(纸本)0780378652
In this paper, we present a matching method that can improve the classification performance of a fuzzy decision tree (FDT). This method takes into consideration prediction strength of leave nodes of a fuzzy decision tree by combining true degrees (CF) of fuzzy rules, generated from a fuzzy decision tree, with membership degrees of antecedent parts of rules when applied to cases for classification. We illustrate the importance of CF through an example. An experiment shows by using this method, we can obtain more accurate results of classification when compared to the original method and to those obtained using the C5.0 decision tree.
More and more digital images are being stored in compressed formats, among which the format using discrete cosine transform (DCT) coefficients is widely adopted (JPEG, MPEG, H.263 etc). To exploit those successful ima...
详细信息
More and more digital images are being stored in compressed formats, among which the format using discrete cosine transform (DCT) coefficients is widely adopted (JPEG, MPEG, H.263 etc). To exploit those successful image processing techniques developed in the pixel domain, the authors propose a fast image extraction algorithm to allow images to be extracted directly from compressed DCT coefficients without full decompression. In the proposed technique the extracted images retain quality comparable with that of fully decoded images. However, the computing cost and the storage expense incurred by the proposed algorithm are very much lower than the costs of full decompression. The experiments also demonstrate that the proposed algorithm has tremendous potential in that all existing image processing techniques developed in the pixel domain can be directly applied to compressed images, without involving full decompression.
暂无评论