Transactions on Large-Scale Data- and Knowledge-Centered Systems XVI

The LNCS journal Transactions on Large-Scale Data- and Knowledge-Centered Systems focuses on data management, knowledge discovery, and knowledge processing, which are core and hot topics in computer science. Since the 1990s, the Internet has become the main driving force behind application development in all domains. An increase in the demand for resource sharing across different sites connected through networks has led to an evolution of data- and knowledge-management systems from centralized systems to decentralized systems enabling large-scale distributed applications providing high scalability. Current decentralized systems still focus on data and knowledge as their main resource. Feasibility of these systems relies basically on P2P (peer-to-peer) techniques and the support of agent systems with scaling and decentralized control. Synergy between grids, P2P systems, and agent technologies is the key to data- and knowledge-centered systems in large-scale environments.This, the 16th issue of Transactions on Large-Scale Data- and Knowledge-Centered Systems, contains extended and revised versions of 7 papers, selected from the 30 papers presented at the International Conference on Advanced Computing and Applications, ACOMP 2013, held October 23-25, 2013, in Ho Chi Minh City, Vietnam. Topics covered include data engineering, information retrieval, query processing and optimization, energy-efficient resource allocation, and security and privacy.

[1]  S. Kanade,et al.  Three factor scheme for biometric-based cryptographic key regeneration using iris , 2008, 2008 Biometrics Symposium.

[2]  Andrew Beng Jin Teoh,et al.  Biohashing: two factor authentication featuring fingerprint data and tokenised random number , 2004, Pattern Recognit..

[3]  Micha Sharir,et al.  On Shortest Paths in Polyhedral Spaces , 1986, SIAM J. Comput..

[4]  Marcelo Kallmann Path Planning in Triangulations Marcelo Kallmann , 2005 .

[5]  T.E. Boult,et al.  Cracking Fuzzy Vaults and Biometric Encryption , 2007, 2007 Biometrics Symposium.

[6]  Jens Lehmann,et al.  DBpedia: A Nucleus for a Web of Open Data , 2007, ISWC/ASWC.

[7]  Leonidas J. Guibas,et al.  Visibility and intersection problems in plane geometry , 1989, Discret. Comput. Geom..

[8]  Christoph Meinel,et al.  Energy efficient scheduling of HPC-jobs on virtualize clusters using host and VM dynamic configuration , 2012, OPSR.

[9]  Tran Van Hoai,et al.  Direct multiple shooting method for solving approximate shortest path problems , 2013, J. Comput. Appl. Math..

[10]  Nalini K. Ratha,et al.  Generating Cancelable Fingerprint Templates , 2007, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[11]  Nasir D. Memon,et al.  A secure biometric authentication scheme based on robust hashing , 2005, MM&Sec '05.

[12]  Yongdong Wu,et al.  Transforming a pattern identifier into biometric key generators , 2010, 2010 IEEE International Conference on Multimedia and Expo.

[13]  Kenneth L. Clarkson,et al.  Approximation algorithms for shortest path motion planning , 1987, STOC.

[14]  Joseph O'Rourke,et al.  Computational geometry in C (2nd ed.) , 1998 .

[15]  Joseph S. B. Mitchell,et al.  Geometric Shortest Paths and Network Optimization , 2000, Handbook of Computational Geometry.

[16]  P. An Incremental Convex Hull as an Orientation to Solving theShortest Path Problem , 2012 .

[17]  Michael Buro,et al.  Efficient Triangulation-Based Pathfinding , 2006, AAAI.

[18]  William Stafford Noble,et al.  Support vector machine , 2013 .

[19]  Enrico Motta,et al.  Is Question Answering fit for the Semantic Web?: A survey , 2011, Semantic Web.

[20]  M. Zhenjiang Zernike moment-based image shape analysis and its application , 2000 .

[21]  D. T. Lee,et al.  Euclidean shortest paths in the presence of rectilinear barriers , 1984, Networks.

[22]  Tran Khanh Dang,et al.  Enhance fuzzy vault security using nonrandom chaff point generator , 2016, Inf. Process. Lett..

[23]  Gerry Leversha,et al.  Introduction to numerical analysis (3rd edn), by J. Stoer and R. Bulirsch. Pp. 744. £49. 2002. ISBN 0 387 95452 X (Springer-Verlag). , 2004, The Mathematical Gazette.

[24]  Manish Khare,et al.  Moving object segmentation in Daubechies complex wavelet domain , 2015, Signal Image Video Process..

[25]  Jörg-Rüdiger Sack,et al.  Approximation algorithms for geometric shortest path problems , 2000, STOC '00.