Open Access. Powered by Scholars. Published by Universities.®
- Keyword
-
- Cloud security (2)
- Africa (1)
- Association rule mining (1)
- Attribute manipulation (1)
- Authentication (1)
-
- Blockchain (1)
- Cloud computing (1)
- Co-location attacks (1)
- Constant size (1)
- Criteria-based encryption (1)
- Data centers (1)
- Dummy attributes (1)
- EI tree (1)
- Fair payment (1)
- Feature Selection (1)
- Frequent itemset mining (1)
- Geospatial autocorrelation (1)
- Hierarchical grid index (1)
- Hotspot detection (1)
- Knowledge discovery (1)
- Multimodal fashion retrieval (1)
- Outlier Detection (1)
- Outlier Ensemble (1)
- Outsourcing computation (1)
- Political violence (1)
- Polynomial (1)
- Privacy preserving outsourcing (1)
- Provable data possession (1)
- Provable security (1)
- Road network (1)
Articles 1 - 14 of 14
Full-Text Articles in Engineering
Co-Location Resistant Virtual Machine Placement In Cloud Data Centers, Amit Agarwal, Nguyen Binh Duong Ta
Co-Location Resistant Virtual Machine Placement In Cloud Data Centers, Amit Agarwal, Nguyen Binh Duong Ta
Research Collection School Of Computing and Information Systems
Due to increasing number of avenues for conducting cross-virtual machine (VM) side-channel attacks, the security of public IaaS cloud data centers is a growing concern. These attacks allow an adversary to steal private information from a target user whose VM instance is co-located with that of the adversary. To reduce the probability of malicious co-location, we propose a novel VM placement algorithm called “Previously Co-Located Users First”. We perform a theoretical and empirical analysis of our proposed algorithm to evaluate its resource efficiency and security. Our results, obtained using real-world cloud traces containing millions of VM requests and thousands of …
Is There Space For Violence?: A Data-Driven Approach To The Exploration Of Spatial-Temporal Dimensions Of Conflict, Tin Seong Kam, Vincent Zhi
Is There Space For Violence?: A Data-Driven Approach To The Exploration Of Spatial-Temporal Dimensions Of Conflict, Tin Seong Kam, Vincent Zhi
Research Collection School Of Computing and Information Systems
With recent increases in incidences of political violence globally, the world has now become more uncertain and less predictable. Of particular concern is the case of violence against civilians, who are often caught in the crossfire between armed state or non-state actors. Classical methods of studying political violence and international relations need to be updated. Adopting the use of data analytic tools and techniques of studying big data would enable academics and policy makers to make sense of a rapidly changing world.
Interpretable Multimodal Retrieval For Fashion Products, Lizi Liao, Xiangnan He, Bo Zhao, Chong-Wah Ngo, Tat-Seng Chua
Interpretable Multimodal Retrieval For Fashion Products, Lizi Liao, Xiangnan He, Bo Zhao, Chong-Wah Ngo, Tat-Seng Chua
Research Collection School Of Computing and Information Systems
Deep learning methods have been successfully applied to fashion retrieval. However, the latent meaning of learned feature vectors hinders the explanation of retrieval results and integration of user feedback. Fortunately, there are many online shopping websites organizing fashion items into hierarchical structures based on product taxonomy and domain knowledge. Such structures help to reveal how human perceive the relatedness among fashion products. Nevertheless, incorporating structural knowledge for deep learning remains a challenging problem. This paper presents techniques for organizing and utilizing the fashion hierarchies in deep learning to facilitate the reasoning of search results and user intent. The novelty of …
Simknn: A Scalable Method For In-Memory Knn Search Over Moving Objects In Road Networks, Bin Cao, Chenyu Hou, Suifei Li, Jing Fan, Jianwei Yin, Baihua Zheng, Jie Bao
Simknn: A Scalable Method For In-Memory Knn Search Over Moving Objects In Road Networks, Bin Cao, Chenyu Hou, Suifei Li, Jing Fan, Jianwei Yin, Baihua Zheng, Jie Bao
Research Collection School Of Computing and Information Systems
Nowadays, many location-based applications require the ability of querying k-nearest neighbors over a very large scale of5 moving objects in road networks, e.g., taxi-calling and ride-sharing services. Traditional grid index with equal-sized cells can not adapt6 to the skewed distribution of moving objects in real scenarios. Thus, to obtain the fast querying response time, the grid needs to be split7 into more smaller cells which introduces the side-effect of higher memory cost, i.e., maintaining such a large volume of cells requires a8 much larger memory space at the server side. In this paper, we present SIMkNN, a scalable and in-memory …
Blockchain Based Efficient And Robust Fair Payment For Outsourcing Services In Cloud Computing, Yinghui Zhang, Robert H. Deng, Ximeng Liu, Dong Zheng
Blockchain Based Efficient And Robust Fair Payment For Outsourcing Services In Cloud Computing, Yinghui Zhang, Robert H. Deng, Ximeng Liu, Dong Zheng
Research Collection School Of Computing and Information Systems
As an attractive business model of cloud computing, outsourcing services usually involve online payment and security issues. The mutual distrust between users and outsourcing service providers may severely impede the wide adoption of cloud computing. Nevertheless, most existing payment solutions only consider a specific type of outsourcing service and rely on a trusted third-party to realize fairness. In this paper, in order to realize secure and fair payment of outsourcing services in general without relying on any third-party, trusted or not, we introduce BCPay, a blockchain based fair payment framework for outsourcing services in cloud computing. We first present the …
Learning Representations Of Ultrahigh-Dimensional Data For Random Distance-Based Outlier Detection, Guansong Pang, Longbing Cao, Ling Chen, Defu Lian, Huan Liu
Learning Representations Of Ultrahigh-Dimensional Data For Random Distance-Based Outlier Detection, Guansong Pang, Longbing Cao, Ling Chen, Defu Lian, Huan Liu
Research Collection School Of Computing and Information Systems
Learning expressive low-dimensional representations of ultrahigh-dimensional data, e.g., data with thousands/millions of features, has been a major way to enable learning methods to address the curse of dimensionality. However, existing unsupervised representation learning methods mainly focus on preserving the data regularity information and learning the representations independently of subsequent outlier detection methods, which can result in suboptimal and unstable performance of detecting irregularities (i.e., outliers).This paper introduces a ranking model-based framework, called RAMODO, to address this issue. RAMODO unifies representation learning and outlier detection to learn low-dimensional representations that are tailored for a state-of-the-art outlier detection approach - the random …
Exact Processing Of Uncertain Top-K Queries In Multi-Criteria Settings, Kyriakos Mouratidis, Bo Tang
Exact Processing Of Uncertain Top-K Queries In Multi-Criteria Settings, Kyriakos Mouratidis, Bo Tang
Research Collection School Of Computing and Information Systems
Traditional rank-aware processing assumes a dataset that contains available options to cover a specific need (e.g., restaurants, hotels, etc) and users who browse that dataset via top-k queries with linear scoring functions, i.e., by ranking the options according to the weighted sum of their attributes, for a set of given weights. In practice, however, user preferences (weights) may only be estimated with bounded accuracy, or may be inherently uncertain due to the inability of a human user to specify exact weight values with absolute accuracy. Motivated by this, we introduce the uncertain top-k query (UTK). Given uncertain preferences, that is, …
Privacy-Preserving Mining Of Association Rule On Outsourced Cloud Data From Multiple Parties, Lin Liu, Jinshu Su, Rongmao Chen, Ximeng Liu, Xiaofeng Wang, Shuhui Chen, Ho-Fung Fung Leung
Privacy-Preserving Mining Of Association Rule On Outsourced Cloud Data From Multiple Parties, Lin Liu, Jinshu Su, Rongmao Chen, Ximeng Liu, Xiaofeng Wang, Shuhui Chen, Ho-Fung Fung Leung
Research Collection School Of Computing and Information Systems
It has been widely recognized as a challenge to carry out data analysis and meanwhile preserve its privacy in the cloud. In this work, we mainly focus on a well-known data analysis approach namely association rule mining. We found that the data privacy in this mining approach have not been well considered so far. To address this problem, we propose a scheme for privacy-preserving association rule mining on outsourced cloud data which are uploaded from multiple parties in a twin-cloud architecture. In particular, we mainly consider the scenario where the data owners and miners have different encryption keys that are …
Criteria-Based Encryption, Tran Viet Xuan Phuong, Guomin Yang, Willy Susilo
Criteria-Based Encryption, Tran Viet Xuan Phuong, Guomin Yang, Willy Susilo
Research Collection School Of Computing and Information Systems
We present a new type of public-key encryption called Criteria-based Encryption (or , for short). Different from Attribute-based Encryption, in , we consider the access policies as criteria carrying different weights. A user must hold some cases (or answers) satisfying the criteria and have sufficient weights in order to successfully decrypt a message. We then propose two Schemes under different settings: the first scheme requires a user to have at least one case for a criterion specified by the encryptor in the access structure, while the second scheme requires a user to have all the cases for each criterion. We …
Continuous Top-K Monitoring On Document Streams (Extended Abstract), Leong Hou U, Junjie Zhang, Kyriakos Mouratidis, Ye Li
Continuous Top-K Monitoring On Document Streams (Extended Abstract), Leong Hou U, Junjie Zhang, Kyriakos Mouratidis, Ye Li
Research Collection School Of Computing and Information Systems
The efficient processing of document streams plays an important role in many information filtering systems. Emerging applications, such as news update filtering and social network notifications, demand presenting end-users with the most relevant content to their preferences. In this work, user preferences are indicated by a set of keywords. A central server monitors the document stream and continuously reports to each user the top-k documents that are most relevant to her keywords. The objective is to support large numbers of users and high stream rates, while refreshing the topk results almost instantaneously. Our solution abandons the traditional frequency-ordered indexing approach, …
Fixation And Confusion: Investigating Eye-Tracking Participants' Exposure To Information In Personas, Joni Salminen, Bernard J. Jansen, Jisun An, Soon-Gyo Jung, Lene Nielsen, Haewoon Kwak
Fixation And Confusion: Investigating Eye-Tracking Participants' Exposure To Information In Personas, Joni Salminen, Bernard J. Jansen, Jisun An, Soon-Gyo Jung, Lene Nielsen, Haewoon Kwak
Research Collection School Of Computing and Information Systems
To more effectively convey relevant information to end users of persona profiles, we conducted a user study consisting of 29 participants engaging with three persona layout treatments. We were interested in confusion engendered by the treatments on the participants, and conducted a within-subjects study in the actual work environment, using eye-tracking and talk-aloud data collection. We coded the verbal data into classes of informativeness and confusion and correlated it with fixations and durations on the Areas of Interests recorded by the eye-tracking device. We used various analysis techniques, including Mann-Whitney, regression, and Levenshtein distance, to investigate how confused users differed …
Constant-Size Ciphertexts In Threshold Attribute-Based Encryption Without Dummy Attributes, Willy Susilo, Guomin Yang, Fuchun Guo, Qiong Huang
Constant-Size Ciphertexts In Threshold Attribute-Based Encryption Without Dummy Attributes, Willy Susilo, Guomin Yang, Fuchun Guo, Qiong Huang
Research Collection School Of Computing and Information Systems
Attribute-based encryption (ABE) is an augmentation of public key encryption that allows users to encrypt and decrypt messages based on users' attributes. In a (t, s) threshold ABE, users who can decrypt a ciphertext must hold at least t attributes among the s attributes specified by the encryptor. At PKC 2010, Herranz, Laguillaumie and Raft& proposed the first threshold ABE with constant-size ciphertexts. In order to ensure the encryptor can flexibly select the attribute set and a threshold value, they use dummy attributes to satisfy the decryption requirement. The advantage of their scheme is that any addition or removal of …
Scaling Human Activity Recognition Via Deep Learning-Based Domain Adaptation, Md Abdullah Hafiz Khan, Nirmalya Roy, Archan Misra
Scaling Human Activity Recognition Via Deep Learning-Based Domain Adaptation, Md Abdullah Hafiz Khan, Nirmalya Roy, Archan Misra
Research Collection School Of Computing and Information Systems
We investigate the problem of making human activityrecognition (AR) scalable–i.e., allowing AR classifiers trainedin one context to be readily adapted to a different contextualdomain. This is important because AR technologies can achievehigh accuracy if the classifiers are trained for a specific individualor device, but show significant degradation when the sameclassifier is applied context–e.g., to a different device located ata different on-body position. To allow such adaptation withoutrequiring the onerous step of collecting large volumes of labeledtraining data in the target domain, we proposed a transductivetransfer learning model that is specifically tuned to the propertiesof convolutional neural networks (CNNs). Our model, …
Sparse Modeling-Based Sequential Ensemble Learning For Effective Outlier Detection In High-Dimensional Numeric Data, Guansong Pang, Longbing Cao, Ling Chen, Defu Lian, Huan Liu
Sparse Modeling-Based Sequential Ensemble Learning For Effective Outlier Detection In High-Dimensional Numeric Data, Guansong Pang, Longbing Cao, Ling Chen, Defu Lian, Huan Liu
Research Collection School Of Computing and Information Systems
The large proportion of irrelevant or noisy features in reallife high-dimensional data presents a significant challenge to subspace/feature selection-based high-dimensional outlier detection (a.k.a. outlier scoring) methods. These methods often perform the two dependent tasks: relevant feature subset search and outlier scoring independently, consequently retaining features/subspaces irrelevant to the scoring method and downgrading the detection performance. This paper introduces a novel sequential ensemble-based framework SEMSE and its instance CINFO to address this issue. SEMSE learns the sequential ensembles to mutually refine feature selection and outlier scoring by iterative sparse modeling with outlier scores as the pseudo target feature. CINFO instantiates SEMSE …