Open Access. Powered by Scholars. Published by Universities.®
Physical Sciences and Mathematics Commons™
Open Access. Powered by Scholars. Published by Universities.®
Articles 1 - 2 of 2
Full-Text Articles in Physical Sciences and Mathematics
Pervasive Data Access In Wireless And Mobile Computing Environments, Ken C. K. Lee, Wang-Chien Lee, Sanjay Kumar Madria
Pervasive Data Access In Wireless And Mobile Computing Environments, Ken C. K. Lee, Wang-Chien Lee, Sanjay Kumar Madria
Computer Science Faculty Research & Creative Works
The rapid advance of wireless and portable computing technology has brought a lot of research interests and momentum to the area of mobile computing. One of the research focus is on pervasive data access. with wireless connections, users can access information at any place at any time. However, various constraints such as limited client capability, limited bandwidth, weak connectivity, and client mobility impose many challenging technical issues. In the past years, tremendous research efforts have been put forth to address the issues related to pervasive data access. A number of interesting research results were reported in the literature. This survey …
Multimedia Correlation Analysis In Unstructured Peer-To-Peer Network, Bo Yang, A. R. Hurson, Yu Jiao, Thomas E. Potok
Multimedia Correlation Analysis In Unstructured Peer-To-Peer Network, Bo Yang, A. R. Hurson, Yu Jiao, Thomas E. Potok
Computer Science Faculty Research & Creative Works
Recent years saw the rapid development of peer-topeer (P2P) networks in a great variety of applications. However, similarity-based k-nearest-neighbor retrieval (k-NN) is still a challenging task in P2P networks due to the multiple constraints such as the dynamic topologies and the unpredictable data updates. Caching is an attractive solution that reduces network traffic and hence could remedy the technological constraints of P2P networks. However, traditional caching techniques have some major shortcomings that make them unsuitable for similarity search, such as the lack of semantic locality representation and the rigidness of exact matching on data objects. To facilitate the efficient similarity …