In order to improve stimulus-response compatibility of touchpad in pen-based user interface, we present the tilt cursor, i.e. a cursor dynamically reshapes itself to providing the 3D orientation cue of pen. We also pr...
详细信息
In lager-scale P2P file sharing systems, peers often must interact with unknown or unfamiliar peers without the benefit of trusted third parties or authorities to mediate the interactions. The decentralized and anonym...
详细信息
ISBN:
(纸本)9783540725893
In lager-scale P2P file sharing systems, peers often must interact with unknown or unfamiliar peers without the benefit of trusted third parties or authorities to mediate the interactions. The decentralized and anonymous characteristics of P2P environments make the task of controlling access to sharing information more difficult. In this paper, we identify access control requirements and propose a trust based access control framework for P2P file-sharing systems. The model integrates aspects of trust and recommendation, fairness based participation schemes and access control schemes.
In this paper, we study the following minimum rooted star cover problem: given a complete graph G = (V, E) with a length function l : E &rarr + that satisfies the triangle inequality, a designated root vertex r ∈...
详细信息
ISBN:
(纸本)3540725032
In this paper, we study the following minimum rooted star cover problem: given a complete graph G = (V, E) with a length function l : E &rarr + that satisfies the triangle inequality, a designated root vertex r ∈ V, and a length bound D, the objective is to find a minimum cardinality set of rooted stars, that covers all vertices in V such that the length of each rooted star is at most D, where a rooted star is a subset of E having a common center s S V and containing the edge (r, s). This problem is NP-complete and we present a constant ratio approximation algorithm for this problem. Springer-Verlag Berlin Heidelberg 2007.
Secure group key distribution and efficient rekeying is one of the most challenging security issues in ad hoc networks at present. In this paper, Latin squares are used to construct orthogonal arrays in order to quick...
详细信息
ISBN:
(纸本)9781595937575
Secure group key distribution and efficient rekeying is one of the most challenging security issues in ad hoc networks at present. In this paper, Latin squares are used to construct orthogonal arrays in order to quickly obtain t-packing designs. Based on cover-free family properties, t-packing designs are adopted in key predistribution phase. Then the pre-deployed keys are used for implementing secure channels between members for group key distribution. The new scheme improves the collusion-resilience of the networks using the cover-free family properties, and enhances the key-sharing connectivity of nodes which makes key management more efficient. This paper also presents in depth theory and data analysis of the new scheme in terms of network security and connectivity.1 Copyright 2007 ACM.
Data gathering is a major function of many applications in wireless sensor networks (WSNs). The most important issue in designing a data gathering algorithm is how to save energy of sensor nodes while meeting the requ...
详细信息
ISBN:
(纸本)9781424403523
Data gathering is a major function of many applications in wireless sensor networks (WSNs). The most important issue in designing a data gathering algorithm is how to save energy of sensor nodes while meeting the requirement of applications/users such as sensing area coverage. In this paper, we propose a novel hierarchical clustering protocol for long-lived sensor network. EAP achieves a good performance in terms of lifetime by minimizing energy consumption for in-network communications and balancing the energy load among all nodes. EAP introduces a new clustering parameter for cluster head election, which can better handle the heterogeneous energy capacities. Furthermore, it also introduces a simple but efficient approach, namely intra-cluster coverage to cope with the area coverage problem. We evaluate the performance of the proposed protocol using a simple temperature sensing application. Simulation results show that our protocol significantly outperforms LEACH and HEED in terms of network lifetime and the amount of data gathered.
Since the current rate control schemes in H.264 do not present the capability of efficient GOP-level bit allocation, the video quality varies greatly for sequences with the scene change or the scene complexity varying...
详细信息
ISBN:
(纸本)9780863418365
Since the current rate control schemes in H.264 do not present the capability of efficient GOP-level bit allocation, the video quality varies greatly for sequences with the scene change or the scene complexity varying from one GOP to another. To overcome the limitation, we propose a novel rate control scheme based on incremental PID algorithm. The incremental PID algorithm is introduced to minimize video quality variations in GOP-level bit allocation. Extensive simulation results show that the proposed rate control scheme, without expensive computational complexity added, decreases the average video quality variations by 15.07%.
Autonomy is one of the characteristics that agent has which distinguish agent systems from the other conceptualisations within computerscience. To prove the validity of intention execution in AgentSpeak, according to...
详细信息
In component-based software development, it is important to use formal models to describe component composition. However, the existing component composition models generally ignore real-time issues. We present a forma...
详细信息
The method of using in-network aggregation for energy efficient data collection often results in processing delay and additional time for gathering related data at an intermediate node. This unfortunately may make the...
详细信息
ISBN:
(纸本)1595936955
The method of using in-network aggregation for energy efficient data collection often results in processing delay and additional time for gathering related data at an intermediate node. This unfortunately may make the scheme undesirable for networks deployed for emergent event monitoring. In this paper, we propose ReCoDa - Reliable forwarding of Correlated Data with low latency, an energy-efficient and reliable delivery scheme benefiting from data correlation among sensor nodes but without performing in-network aggregation. Our idea is to allow each node to determine the data transmission reliability it shall obtain based on the preceding transmissions from other nodes, subjecting to the overall information reliability requirement. This in turn is achieved through controllab.e multi-path forwarding. Simulation shows that ReCoDa can successfully reduce redundancy up to 2.9 times compared with schemes not exploiting data redundancy and achieves energy efficiency up to 4.79 times higher. Copyright 2007 ACM.
Trusted platform model (TPM) is special-purpose integrated circuits built into a variety of platforms to enable strong user authentication and machine attestation-essential to prevent inappropriate access to confident...
详细信息
暂无评论