Open Access. Powered by Scholars. Published by Universities.®
Articles 1 - 8 of 8
Full-Text Articles in Entire DC Network
A Longitudinal Study Of A Capstone Course, Benjamin Gan, Eng Lieh Ouh, Yin Yin Fiona Lee
A Longitudinal Study Of A Capstone Course, Benjamin Gan, Eng Lieh Ouh, Yin Yin Fiona Lee
Research Collection School Of Computing and Information Systems
This is a 7 years study on a capstone course completed by 1700+ students for 200+ organizations involving 300+ projects. Student teams deliver a system to solve real-world problems proposed by industry partners. We want to understand what independent variables influence student performance. We analyzed the deployment status of systems delivered, the type of organization/industry, the number of meetings and the technology used. Our results show some organization value proof of concept over fully deployed systems, student strengths are in Infocomm and Finance projects, the number of meetings is a weak correlation to performance and best performing projects are fully …
Provable De-Anonymization Of Large Datasets With Sparse Dimensions, Anupam Datta, Divya Sharma, Arunesh Sinha
Provable De-Anonymization Of Large Datasets With Sparse Dimensions, Anupam Datta, Divya Sharma, Arunesh Sinha
Research Collection School Of Computing and Information Systems
There is a significant body of empirical work on statistical de-anonymization attacks against databases containing micro-dataabout individuals, e.g., their preferences, movie ratings, or transactiondata. Our goal is to analytically explain why such attacks work. Specifically, we analyze a variant of the Narayanan-Shmatikov algorithm thatwas used to effectively de-anonymize the Netflix database of movie ratings. We prove theorems characterizing mathematical properties of thedatabase and the auxiliary information available to the adversary thatenable two classes of privacy attacks. In the first attack, the adversarysuccessfully identifies the individual about whom she possesses auxiliaryinformation (an isolation attack). In the second attack, the adversarylearns additional …
Database Access Pattern Protection Without Full-Shuffles, Xuhua Ding, Yanjiang Yang, Robert H. Deng
Database Access Pattern Protection Without Full-Shuffles, Xuhua Ding, Yanjiang Yang, Robert H. Deng
Research Collection School Of Computing and Information Systems
Privacy protection is one of the fundamental security requirements for database outsourcing. A major threat is information leakage from database access patterns generated by query executions. The standard private information retrieval (PIR) schemes, which are widely regarded as theoretical solutions, entail O(n) computational overhead per query for a database with items. Recent works propose to protect access patterns by introducing a trusted component with constant storage size. The resulting privacy assurance is as strong as PIR, though with O(1) online computation cost, they still have O(n) amortized cost per query due to periodically full database shuffles. In this paper, we …
Shifting Inference Control To User Side: Architecture And Protocol, Yanjiang Yang, Yingjiu Li, Robert H. Deng, Feng Bao
Shifting Inference Control To User Side: Architecture And Protocol, Yanjiang Yang, Yingjiu Li, Robert H. Deng, Feng Bao
Research Collection School Of Computing and Information Systems
Inference has been a longstanding issue in database security, and inference control, aiming to curb inference, provides an extra line of defense to the confidentiality of databases by complementing access control. However, in traditional inference control architecture, database server is a crucial bottleneck, as it enforces highly computation-intensive auditing for all users who query the protected database. As a result, most auditing methods, though rigorously studied, are not practical for protecting large-scale real-world database systems. In this paper, we shift this paradigm by proposing a new inference control architecture, entrusting inference control to each user's platform that is equipped with …
Ranked Reverse Nearest Neighbor Search, Ken C. K. Lee, Baihua Zheng, Wang-Chien Lee
Ranked Reverse Nearest Neighbor Search, Ken C. K. Lee, Baihua Zheng, Wang-Chien Lee
Research Collection School Of Computing and Information Systems
Given a set of data points P and a query point q in a multidimensional space, Reverse Nearest Neighbor (RNN) query finds data points in P whose nearest neighbors are q. Reverse k-Nearest Neighbor (RkNN) query (where k ≥ 1) generalizes RNN query to find data points whose kNNs include q. For RkNN query semantics, q is said to have influence to all those answer data points. The degree of q's influence on a data point p (∈ P) is denoted by κp where q is the κp-th NN of p. We introduce a new variant of RNN query, namely, …
Sgpm: Static Group Pattern Mining Using Apriori-Like Sliding Window, John Goh, David Taniar, Ee Peng Lim
Sgpm: Static Group Pattern Mining Using Apriori-Like Sliding Window, John Goh, David Taniar, Ee Peng Lim
Research Collection School Of Computing and Information Systems
Mobile user data mining is a field that focuses on extracting interesting pattern and knowledge out from data generated by mobile users. Group pattern is a type of mobile user data mining method. In group pattern mining, group patterns from a given user movement database is found based on spatio-temporal distances. In this paper, we propose an improvement of efficiency using area method for locating mobile users and using sliding window for static group pattern mining. This reduces the complexity of valid group pattern mining problem. We support the use of static method, which uses areas and sliding windows instead …
Efficient Native Xml Storage System (Enaxs), Khin-Myo Win, Wee-Keong Ng, Ee Peng Lim
Efficient Native Xml Storage System (Enaxs), Khin-Myo Win, Wee-Keong Ng, Ee Peng Lim
Research Collection School Of Computing and Information Systems
XML is a self-describing meta-language and fast emerging as a dominant standard for Web data exchange among various applications. With the tremendous growth of XML documents, an efficient storage system is required to manage them. The conventional databases, which require all data to adhere to an explicitly specified rigid schema, are unable to provide an efficient storage for tree-structured XML documents. A new data model that is specifically designed for XML documents is required. In this paper, we propose a new storage system, named Efficient Native XML Storage System (ENAXS), for large and complex XML documents. ENAXS stores all XML …
An Integrated Web-Based Ill System For Singapore Libraries, Schubert Foo, Ee Peng Lim
An Integrated Web-Based Ill System For Singapore Libraries, Schubert Foo, Ee Peng Lim
Research Collection School Of Computing and Information Systems
The paper proposes an integrated Web-based inter-library loan (ILL) system to replace and enhance the existing manual-based ILL system used by Singapore libraries. It describes the system requirements that must be supported in order to make it a viable and acceptable solution to all participating libraries. Subsequently, it presents the client-server Web-based system architecture, database design and Java development platform that are used to implement the system. The new system exhibits a host of advantages over the manual system including the minimising of human resource by eliminating form-filling and other forms of paper work completely, improving the access and speed …