A software execution trace can be viewed as a series of events. An event may correspond to the execution of a basic block, the invocation of a class or a method. These traces imply important unique characteristics of ...
详细信息
Cardinality estimation is the process to survey the quantity of tags in a RFID system. Generally, the cardinality is estimated by exchanging information between reader(s) and tags. To ensure the time efficiency and ac...
详细信息
ISBN:
(纸本)9781467375887
Cardinality estimation is the process to survey the quantity of tags in a RFID system. Generally, the cardinality is estimated by exchanging information between reader(s) and tags. To ensure the time efficiency and accuracy of estimation, numerous probability-based approaches have been proposed, most of which follow a similar way of minimizing the number of required time slots from tags to reader. The overall execution time of the estimator, however, is not necessarily minimized. The estimation accuracy of those approaches also largely depends on the repeated rounds, leading to a dilemma of choosing efficiency or accuracy. In this paper, we propose BFCE, a Bloom Filter based Cardinality Estimator, which only needs a constant number of time slots to meet desired estimation accuracy, regardless of the actual tag cardinality. The overall communication overhead is also significantly cut down, as the reader only needs to broadcast a constant number of messages for parameter setting. Results from extensive simulations under various tag IDs distributions shows that BFCE is accurate and highly efficient. In terms of the overall execution time, BFCE is 30 times faster than ZOE and 2 times faster than SRC in average, the two state-of-the-arts estimation approaches.
In this paper, we present a new method for constructing quaternary sequence with even period 2f based on cyclotomic classes of order two. Under the premise of v = 2f +1, we construct two binary sequences with period 2...
详细信息
The study on signed social networks community detection has been paid more and more attention. Research shows that two-phase signed social networks community detection algorithm can not correctly divide the network. T...
详细信息
Based on a new feature that macro network structure and micro game have mutual inuence on the formation of the community, to mining communities in signed network, a novel algorithm SNCGHC is proposed. Firstly, accordi...
详细信息
Due to the advantages of scale invariant feature transform (SIFT) feature points on the invariant to image scale, brightness, rotation, occlusion, noise and so on, this paper proposes a Particle Tracking Velocimetry (...
详细信息
Software’s control flow graph can be treated as a complex software network, and a tiny fraction of key function nodes has considerable influence on the stability, reliability and robustness of the network. Identifyin...
详细信息
We present a new GPU scheme for real-time simulation in large-scale water environments with physics-based object interaction. To improve the simulation efficiency, we divide surface waves into ambient waves and intera...
详细信息
Occlusion avoidance is a more challenging problem in visual field. An occlusion avoidance approach based on depth image of visual object is proposed in this paper. Firstly, the occlusion detection is implemented for t...
详细信息
Previous key path mining algorithms have high computation complexity in the whole software executing network. But the network can be clustered into modules to find key paths in the module. If simplified strategy, weig...
详细信息
暂无评论