Open Access. Powered by Scholars. Published by Universities.®
- Keyword
-
- Reinforcement learning (7)
- Data mining (6)
- Image search (6)
- Clustering (5)
- Deep learning (5)
-
- Human action recognition (5)
- Machine learning (5)
- Searchable encryption (5)
- Artificial intelligence (4)
- Cloud security (4)
- Cloud storage (4)
- Data Mining (4)
- Social media (4)
- Twitter (4)
- Unsupervised learning (4)
- Visualization (4)
- 802.11 (3)
- AoA (3)
- Attribute-based encryption (3)
- Bag-of-words (3)
- Categorization (3)
- Click-through data (3)
- Cloud computing (3)
- Co-occurrence (3)
- Collaboration (3)
- Collaborative filtering (3)
- Crowdsourcing (3)
- Data integration (3)
- Fault localization (3)
- Game theory (3)
- Publication Year
Articles 1 - 30 of 466
Full-Text Articles in Engineering
Data Provenance Via Differential Auditing, Xin Mu, Ming Pang, Feida Zhu
Data Provenance Via Differential Auditing, Xin Mu, Ming Pang, Feida Zhu
Research Collection School Of Computing and Information Systems
With the rising awareness of data assets, data governance, which is to understand where data comes from, how it is collected, and how it is used, has been assuming evergrowing importance. One critical component of data governance gaining increasing attention is auditing machine learning models to determine if specific data has been used for training. Existing auditing techniques, like shadow auditing methods, have shown feasibility under specific conditions such as having access to label information and knowledge of training protocols. However, these conditions are often not met in most real-world applications. In this paper, we introduce a practical framework for …
Objectfusion: Multi-Modal 3d Object Detection With Object-Centric Fusion, Q. Cai, Y. Pan, T. Yao, Chong-Wah Ngo, T. Mei
Objectfusion: Multi-Modal 3d Object Detection With Object-Centric Fusion, Q. Cai, Y. Pan, T. Yao, Chong-Wah Ngo, T. Mei
Research Collection School Of Computing and Information Systems
Recent progress on multi-modal 3D object detection has featured BEV (Bird-Eye-View) based fusion, which effectively unifies both LiDAR point clouds and camera images in a shared BEV space. Nevertheless, it is not trivial to perform camera-to-BEV transformation due to the inherently ambiguous depth estimation of each pixel, resulting in spatial misalignment between these two multi-modal features. Moreover, such transformation also inevitably leads to projection distortion of camera image features in BEV space. In this paper, we propose a novel Object-centric Fusion (ObjectFusion) paradigm, which completely gets rid of camera-to-BEV transformation during fusion to align object-centric features across different modalities for …
Owner-Free Distributed Symmetric Searchable Encryption Supporting Conjunctive Queries, Qiuyun Tong, Xinghua Li, Yinbin Miao, Yunwei Wang, Ximeng Liu, Robert H. Deng
Owner-Free Distributed Symmetric Searchable Encryption Supporting Conjunctive Queries, Qiuyun Tong, Xinghua Li, Yinbin Miao, Yunwei Wang, Ximeng Liu, Robert H. Deng
Research Collection School Of Computing and Information Systems
Symmetric Searchable Encryption (SSE), as an ideal primitive, can ensure data privacy while supporting retrieval over encrypted data. However, existing multi-user SSE schemes require the data owner to share the secret key with all query users or always be online to generate search tokens. While there are some solutions to this problem, they have at least one weakness, such as non-supporting conjunctive query, result decryption assistance of the data owner, and unauthorized access. To solve the above issues, we propose an Owner-free Distributed Symmetric searchable encryption supporting Conjunctive query (ODiSC). Specifically, we first evaluate the Learning-Parity-with-Noise weak Pseudorandom Function (LPN-wPRF) …
Prirpt: Practical Blockchain-Based Privacy-Preserving Reporting System With Rewards, Rui. Shi, Yang Yang, Huamin. Feng, Feng. Yuan, Huiqin. Xie, Jianyi. Zhang
Prirpt: Practical Blockchain-Based Privacy-Preserving Reporting System With Rewards, Rui. Shi, Yang Yang, Huamin. Feng, Feng. Yuan, Huiqin. Xie, Jianyi. Zhang
Research Collection School Of Computing and Information Systems
In order to obtain evidence of a crime timely, most authorities encourage whistleblowers to provide valuable reports by rewarding them with prizes. However, criminals will try their best to delete or tamper with the reports and even threaten and revenge the whistleblowers to escape punishment. Hence, to make the reporting system work, it is essential to ensure the integrity of reported messages and the anonymity of the reporting and rewarding procedures in the reporting system. Most existing schemes for this problem are generally based on ring signatures, which incur high computational overhead and imperfect anonymity. In this paper, we introduce …
When Routing Meets Recommendation: Solving Dynamic Order Recommendations Problem In Peer-To-Peer Logistics Platforms, Zhiqin Zhang, Waldy Joe, Yuyang Er, Hoong Chuin Lau
When Routing Meets Recommendation: Solving Dynamic Order Recommendations Problem In Peer-To-Peer Logistics Platforms, Zhiqin Zhang, Waldy Joe, Yuyang Er, Hoong Chuin Lau
Research Collection School Of Computing and Information Systems
Peer-to-Peer (P2P) logistics platforms, unlike traditional last-mile logistics providers, do not have dedicated delivery resources (both vehicles and drivers). Thus, the efficiency of such operating model lies in the successful matching of demand and supply, i.e., how to match the delivery tasks with suitable drivers that will result in successful assignment and completion of the tasks. We consider a Same-Day Delivery Problem (SDDP) involving a P2P logistics platform where new orders arrive dynamically and the platform operator needs to generate a list of recommended orders to the crowdsourced drivers. We formulate this problem as a Dynamic Order Recommendations Problem (DORP). …
Context-Aware Event Forecasting Via Graph Disentanglement, Yunshan Ma, Chenchen Ye, Zijian Wu, Xiang Wang, Yixin Cao, Tat-Seng Chua
Context-Aware Event Forecasting Via Graph Disentanglement, Yunshan Ma, Chenchen Ye, Zijian Wu, Xiang Wang, Yixin Cao, Tat-Seng Chua
Research Collection School Of Computing and Information Systems
Event forecasting has been a demanding and challenging task throughout the entire human history. It plays a pivotal role in crisis alarming and disaster prevention in various aspects of the whole society. The task of event forecasting aims to model the relational and temporal patterns based on historical events and makes forecasting to what will happen in the future. Most existing studies on event forecasting formulate it as a problem of link prediction on temporal event graphs. However, such pure structured formulation suffers from two main limitations: 1) most events fall into general and high-level types in the event ontology, …
The Heterogeneous Vehicle Routing Problem With Multiple Time Windows For The E-Waste Collection Problem, Aldy Gunawan, Minh P.K Nguyen, Vincent F. Yu, Dang Viet Anh Nguyen
The Heterogeneous Vehicle Routing Problem With Multiple Time Windows For The E-Waste Collection Problem, Aldy Gunawan, Minh P.K Nguyen, Vincent F. Yu, Dang Viet Anh Nguyen
Research Collection School Of Computing and Information Systems
Waste from electrical and electronic equipment (WEEE) or e-waste describes end-of-life electronic products that are discarded. Due to their toxic and negative impacts to humans' health, many publications have been proposed to handle, however, studies related to e-waste collection and transportation to waste disposal sites are not widely studied so far. This study proposes a mixed integer linear programming (MILP) model to solve the e-waste collecting problem by formulating it as the heterogeneous vehicle routing problem with multiple time windows (HVRPMTW). The model is validated with newly developed benchmark instances that are solved by commercial software, CPLEX. The model is …
Niche: A Curated Dataset Of Engineered Machine Learning Projects In Python, Ratnadira Widyasari, Zhou Yang, Ferdian Thung, Sheng Qin Sim, Fiona Wee, Camellia Lok, Jack Phan, Haodi Qi, Constance Tan, David Lo, David Lo
Niche: A Curated Dataset Of Engineered Machine Learning Projects In Python, Ratnadira Widyasari, Zhou Yang, Ferdian Thung, Sheng Qin Sim, Fiona Wee, Camellia Lok, Jack Phan, Haodi Qi, Constance Tan, David Lo, David Lo
Research Collection School Of Computing and Information Systems
Machine learning (ML) has gained much attention and has been incorporated into our daily lives. While there are numerous publicly available ML projects on open source platforms such as GitHub, there have been limited attempts in filtering those projects to curate ML projects of high quality. The limited availability of such a high-quality dataset poses an obstacle to understanding ML projects. To help clear this obstacle, we present NICHE, a manually labelled dataset consisting of 572 ML projects. Based on the evidence of good software engineering practices, we label 441 of these projects as engineered and 131 as non-engineered. This …
Nftdisk: Visual Detection Of Wash Trading In Nft Markets, Xiaolin Wen, Yong Wang, Xuanwu Yue, Feida Zhu, Min Zhu
Nftdisk: Visual Detection Of Wash Trading In Nft Markets, Xiaolin Wen, Yong Wang, Xuanwu Yue, Feida Zhu, Min Zhu
Research Collection School Of Computing and Information Systems
With the growing popularity of Non-Fungible Tokens (NFT), a new type of digital assets, various fraudulent activities have appeared in NFT markets. Among them, wash trading has become one of the most common frauds in NFT markets, which attempts to mislead investors by creating fake trading volumes. Due to the sophisticated patterns of wash trading, only a subset of them can be detected by automatic algorithms, and manual inspection is usually required. We propose NFTDisk, a novel visualization for investors to identify wash trading activities in NFT markets, where two linked visualization modules are presented: a radial visualization module with …
Learning Relation Prototype From Unlabeled Texts For Long-Tail Relation Extraction, Yixin Cao, Jun Kuang, Ming Gao, Aoying Zhou, Yonggang Wen, Tat-Seng Chua
Learning Relation Prototype From Unlabeled Texts For Long-Tail Relation Extraction, Yixin Cao, Jun Kuang, Ming Gao, Aoying Zhou, Yonggang Wen, Tat-Seng Chua
Research Collection School Of Computing and Information Systems
Relation Extraction (RE) is a vital step to complete Knowledge Graph (KG) by extracting entity relations from texts. However, it usually suffers from the long-tail issue. The training data mainly concentrates on a few types of relations, leading to the lack of sufficient annotations for the remaining types of relations. In this paper, we propose a general approach to learn relation prototypes from unlabeled texts, to facilitate the long-tail relation extraction by transferring knowledge from the relation types with sufficient training data. We learn relation prototypes as an implicit factor between entities, which reflects the meanings of relations as well …
Mitigating Popularity Bias In Recommendation With Unbalanced Interactions: A Gradient Perspective, Weijieying Ren, Lei Wang, Kunpeng Liu, Ruocheng Guo, Ee-Peng Lim, Yanjie Fu
Mitigating Popularity Bias In Recommendation With Unbalanced Interactions: A Gradient Perspective, Weijieying Ren, Lei Wang, Kunpeng Liu, Ruocheng Guo, Ee-Peng Lim, Yanjie Fu
Research Collection School Of Computing and Information Systems
Recommender systems learn from historical user-item interactions to identify preferred items for target users. These observed interactions are usually unbalanced following a long-tailed distribution. Such long-tailed data lead to popularity bias to recommend popular but not personalized items to users. We present a gradient perspective to understand two negative impacts of popularity bias in recommendation model optimization: (i) the gradient direction of popular item embeddings is closer to that of positive interactions, and (ii) the magnitude of positive gradient for popular items are much greater than that of unpopular items. To address these issues, we propose a simple yet efficient …
A Quality Metric For K-Means Clustering Based On Centroid Locations, Manoj Thulasidas
A Quality Metric For K-Means Clustering Based On Centroid Locations, Manoj Thulasidas
Research Collection School Of Computing and Information Systems
K-Means clustering algorithm does not offer a clear methodology to determine the appropriate number of clusters; it does not have a built-in mechanism for K selection. In this paper, we present a new metric for clustering quality and describe its use for K selection. The proposed metric, based on the locations of the centroids, as well as the desired properties of the clusters, is developed in two stages. In the initial stage, we take into account the full covariance matrix of the clustering variables, thereby making it mathematically similar to a reduced chi2. We then extend it to account for …
Fastklee: Faster Symbolic Execution Via Reducing Redundant Bound Checking Of Type-Safe Pointers, Haoxin Tu, Lingxiao Jiang, Xuhua Ding, He Jiang
Fastklee: Faster Symbolic Execution Via Reducing Redundant Bound Checking Of Type-Safe Pointers, Haoxin Tu, Lingxiao Jiang, Xuhua Ding, He Jiang
Research Collection School Of Computing and Information Systems
Symbolic execution (SE) has been widely adopted for automatic program analysis and software testing. Many SE engines (e.g., KLEE or Angr) need to interpret certain Intermediate Representations (IR) of code during execution, which may be slow and costly. Although a plurality of studies proposed to accelerate SE, few of them consider optimizing the internal interpretation operations. In this paper, we propose FastKLEE, a faster SE engine that aims to speed up execution via reducing redundant bound checking of type-safe pointers during IR code interpretation. Specifically, in FastKLEE, a type inference system is first leveraged to classify pointer types (i.e., safe …
Softskip: Empowering Multi-Modal Dynamic Pruning For Single-Stage Referring Comprehension, Dulanga Weerakoon, Vigneshwaran Subbaraju, Tuan Tran, Archan Misra
Softskip: Empowering Multi-Modal Dynamic Pruning For Single-Stage Referring Comprehension, Dulanga Weerakoon, Vigneshwaran Subbaraju, Tuan Tran, Archan Misra
Research Collection School Of Computing and Information Systems
Supporting real-time referring expression comprehension (REC) on pervasive devices is an important capability for human-AI collaborative tasks. Model pruning techniques, applied to DNN models, can enable real-time execution even on resource-constrained devices. However, existing pruning strategies are designed principally for uni-modal applications, and suffer a significant loss of accuracy when applied to REC tasks that require fusion of textual and visual inputs. We thus present a multi-modal pruning model, LGMDP, which uses language as a pivot to dynamically and judiciously select the relevant computational blocks that need to be executed. LGMDP also introduces a new SoftSkip mechanism, whereby 'skipped' visual …
Reflecting On Experiences For Response Generation, Chenchen Ye, Lizi Liao, Suyu Liu, Tat-Seng Chua
Reflecting On Experiences For Response Generation, Chenchen Ye, Lizi Liao, Suyu Liu, Tat-Seng Chua
Research Collection School Of Computing and Information Systems
Multimodal dialogue systems attract much attention recently, but they are far from skills like: 1) automatically generate context- specific responses instead of safe but general responses; 2) naturally coordinate between the different information modalities (e.g. text and image) in responses; 3) intuitively explain the reasons for generated responses and improve a specific response without re-training the whole model. To approach these goals, we propose a different angle for the task - Reflecting Experiences for Response Generation (RERG). This is supported by the fact that generating a response from scratch can be hard, but much easier if we can access other …
Remgen: Remanufacturing A Random Program Generator For Compiler Testing, Haoxin Tu, He Jiang, Xiaochen Li, Zhide Zhou, Lingxiao Jiang, Lingxiao Jiang
Remgen: Remanufacturing A Random Program Generator For Compiler Testing, Haoxin Tu, He Jiang, Xiaochen Li, Zhide Zhou, Lingxiao Jiang, Lingxiao Jiang
Research Collection School Of Computing and Information Systems
Program generators play a critical role in generating bug-revealing test programs for compiler testing. However, existing program generators have been tamed nowadays (i.e., compilers have been hardened against test programs generated by them), thus calling for new solutions to improve their capability in generating bug-revealing test programs. In this study, we propose a framework named Remgen, aiming to Remanufacture a random program Generator for this purpose. RemgEnaddresses the challenges of the synthesis of diverse code snippets at a low cost and the selection of the bug-revealing code snippets for constructing new test programs. More specifically, RemgEnfirst designs a grammar-aided synthesis …
An Attribute-Aware Attentive Gcn Model For Attribute Missing In Recommendation, Fan Liu, Zhiyong Cheng, Lei Zhu, Chenghao Liu, Liqiang Nie
An Attribute-Aware Attentive Gcn Model For Attribute Missing In Recommendation, Fan Liu, Zhiyong Cheng, Lei Zhu, Chenghao Liu, Liqiang Nie
Research Collection School Of Computing and Information Systems
As important side information, attributes have been widely exploited in the existing recommender system for better performance. However, in the real-world scenarios, it is common that some attributes of items/users are missing (e.g., some movies miss the genre data). Prior studies usually use a default value (i.e., "other") to represent the missing attribute, resulting in sub-optimal performance. To address this problem, in this paper, we present an attribute-aware attentive graph convolution network (A(2)-GCN). In particular, we first construct a graph, where users, items, and attributes are three types of nodes and their associations are edges. Thereafter, we leverage the graph …
Who Is Missing? Characterizing The Participation Of Different Demographic Groups In A Korean Nationwide Daily Conversation Corpus, Haewoon Kwak, Jisun An, Kunwoo Park
Who Is Missing? Characterizing The Participation Of Different Demographic Groups In A Korean Nationwide Daily Conversation Corpus, Haewoon Kwak, Jisun An, Kunwoo Park
Research Collection School Of Computing and Information Systems
A conversation corpus is essential to build interactive AI applications. However, the demographic information of the participants in such corpora is largely underexplored mainly due to the lack of individual data in many corpora. In this work, we analyze a Korean nationwide daily conversation corpus constructed by the National Institute of Korean Language (NIKL) to characterize the participation of different demographic (age and sex) groups in the corpus.
Taxi Travel Time Based Geographically Weighted Regression Model (Gwr) For Modeling Public Housing Prices In Singapore, Yi’An Wang, Fangyi Cai, Shih-Fen Cheng, Bo Wu, Kai Cao
Taxi Travel Time Based Geographically Weighted Regression Model (Gwr) For Modeling Public Housing Prices In Singapore, Yi’An Wang, Fangyi Cai, Shih-Fen Cheng, Bo Wu, Kai Cao
Research Collection School Of Computing and Information Systems
In this research, a taxi travel time based Geographically Weighted Regression model (GWR) is proposed and utilized to model the public housing price in the case study of Singapore. In addition, a comparison between the proposed taxi data driven GWR and other models, such as ordinary least squares model (OLS), GWR model based on Euclidean distance and GWR model based on public transport travel time, have also been carried out. Results indicates that taxi travel time based GWR model has better fitting performance than the OLS model, and slightly better than the Euclidean distance-based GWR model, however, it is not …
Shellfusion: Answer Generation For Shell Programming Tasks Via Knowledge Fusion, Neng Zhang, Chao Liu, Xin Xia, Christoph Treude, Ying Zou, David Lo, Zibin Zheng
Shellfusion: Answer Generation For Shell Programming Tasks Via Knowledge Fusion, Neng Zhang, Chao Liu, Xin Xia, Christoph Treude, Ying Zou, David Lo, Zibin Zheng
Research Collection School Of Computing and Information Systems
Shell commands are widely used for accomplishing tasks, such as network management and file manipulation, in Unix and Linux platforms. There are a large number of shell commands available. For example, 50,000+ commands are documented in the Ubuntu Manual Pages (MPs). Quite often, programmers feel frustrated when searching and orchestrating appropriate shell commands to accomplish specific tasks. To address the challenge, the shell programming community calls for easy-to-use tutorials for shell commands. However, existing tutorials (e.g., TLDR) only cover a limited number of frequently used commands for shell beginners and provide limited support for users to search for commands by …
Message-Locked Searchable Encryption: A New Versatile Tool For Secure Cloud Storage, Xueqiao Liu, Guomin Yang, Willy Susilo, Joseph Tonien, Rongmao Chen, Xixiang Lv
Message-Locked Searchable Encryption: A New Versatile Tool For Secure Cloud Storage, Xueqiao Liu, Guomin Yang, Willy Susilo, Joseph Tonien, Rongmao Chen, Xixiang Lv
Research Collection School Of Computing and Information Systems
Message-Locked Encryption (MLE) is a useful tool to enable deduplication over encrypted data in cloud storage. It can significantly improve the cloud service quality by eliminating redundancy to save storage resources, and hence user cost, and also providing defense against different types of attacks, such as duplicate faking attack and brute-force attack. A typical MLE scheme only focuses on deduplication. On the other hand, supporting search operations on stored content is another essential requirement for cloud storage. In this article, we present a message-locked searchable encryption (MLSE) scheme in a dual-server setting, which achieves simultaneously the desirable features of supporting …
Benchmarking Library Recognition In Tweets, Ting Zhang, Divya Prabha Chandrasekaran, Ferdian Thung, David Lo
Benchmarking Library Recognition In Tweets, Ting Zhang, Divya Prabha Chandrasekaran, Ferdian Thung, David Lo
Research Collection School Of Computing and Information Systems
Software developers often use social media (such as Twitter) to shareprogramming knowledge such as new tools, sample code snippets,and tips on programming. One of the topics they talk about is thesoftware library. The tweets may contain useful information abouta library. A good understanding of this information, e.g., on thedeveloper’s views regarding a library can be beneficial to weigh thepros and cons of using the library as well as the general sentimentstowards the library. However, it is not trivial to recognize whethera word actually refers to a library or other meanings. For example,a tweet mentioning the word “pandas" may refer to …
An Empirical Study Of Memorization In Nlp, Xiaosen Zheng, Jing Jiang
An Empirical Study Of Memorization In Nlp, Xiaosen Zheng, Jing Jiang
Research Collection School Of Computing and Information Systems
A recent study by Feldman (2020) proposed a long-tail theory to explain the memorization behavior of deep learning models. However, memorization has not been empirically verified in the context of NLP, a gap addressed by this work. In this paper, we use three different NLP tasks to check if the long-tail theory holds. Our experiments demonstrate that top-ranked memorized training instances are likely atypical, and removing the top-memorized training instances leads to a more serious drop in test accuracy compared with removing training instances randomly. Furthermore, we develop an attribution method to better understand why a training instance is memorized. …
Pre-Training Graph Neural Networks For Link Prediction In Biomedical Networks, Yahui Long, Min Wu, Yong Liu, Yuan Fang, Chee Kong Kwoh, Jiawei Luo, Xiaoli Li
Pre-Training Graph Neural Networks For Link Prediction In Biomedical Networks, Yahui Long, Min Wu, Yong Liu, Yuan Fang, Chee Kong Kwoh, Jiawei Luo, Xiaoli Li
Research Collection School Of Computing and Information Systems
Motivation: Graphs or networks are widely utilized to model the interactions between different entities (e.g., proteins, drugs, etc) for biomedical applications. Predicting potential links in biomedical networks is important for understanding the pathological mechanisms of various complex human diseases, as well as screening compound targets for drug discovery. Graph neural networks (GNNs) have been designed for link prediction in various biomedical networks, which rely on the node features extracted from different data sources, e.g., sequence, structure and network data. However, it is challenging to effectively integrate these data sources and automatically extract features for different link prediction tasks. Results: In …
Improving Feature Generalizability With Multitask Learning In Class Incremental Learning, Dong Ma, Chi Ian Tang, Cecilia Mascolo
Improving Feature Generalizability With Multitask Learning In Class Incremental Learning, Dong Ma, Chi Ian Tang, Cecilia Mascolo
Research Collection School Of Computing and Information Systems
Many deep learning applications, like keyword spotting [1], [2], require the incorporation of new concepts (classes) over time, referred to as Class Incremental Learning (CIL). The major challenge in CIL is catastrophic forgetting, i.e., preserving as much of the old knowledge as possible while learning new tasks. Various techniques, such as regularization, knowledge distillation, and the use of exemplars, have been proposed to resolve this issue. However, prior works primarily focus on the incremental learning step, while ignoring the optimization during the base model training. We hypothesise that a more transferable and generalizable feature representation from the base model would …
Verifiable Searchable Encryption Framework Against Insider Keyword-Guessing Attack In Cloud Storage, Yinbin Miao, Robert H. Deng, Kim-Kwang Raymond Choo, Ximeng Liu, Hongwei Li
Verifiable Searchable Encryption Framework Against Insider Keyword-Guessing Attack In Cloud Storage, Yinbin Miao, Robert H. Deng, Kim-Kwang Raymond Choo, Ximeng Liu, Hongwei Li
Research Collection School Of Computing and Information Systems
Searchable encryption (SE) allows cloud tenants to retrieve encrypted data while preserving data confidentiality securely. Many SE solutions have been designed to improve efficiency and security, but most of them are still susceptible to insider Keyword-Guessing Attacks (KGA), which implies that the internal attackers can guess the candidate keywords successfully in an off-line manner. Also in existing SE solutions, a semi-honest-but-curious cloud server may deliver incorrect search results by performing only a fraction of retrieval operations honestly (e.g., to save storage space). To address these two challenging issues, we first construct the basic Verifiable SE Framework (VSEF), which can withstand …
Analyzing Offline Social Engagements: An Empirical Study Of Meetup Events Related To Software Development, Abhishek Sharma, Gede Artha Azriadi Prana, Anamika Sawhney, Nachiappan Nagappan, David Lo
Analyzing Offline Social Engagements: An Empirical Study Of Meetup Events Related To Software Development, Abhishek Sharma, Gede Artha Azriadi Prana, Anamika Sawhney, Nachiappan Nagappan, David Lo
Research Collection School Of Computing and Information Systems
Software developers use a variety of social mediachannels and tools in order to keep themselves up to date,collaborate with other developers, and find projects to contributeto. Meetup is one of such social media used by softwaredevelopers to organize community gatherings. We in this work,investigate the dynamics of Meetup groups and events relatedto software development. Our work is different from previouswork as we focus on the actual event and group data that wascollected using Meetup API.In this work, we performed an empirical study of eventsand groups present on Meetup which are related to softwaredevelopment. First, we identified 6,327 Meetup groups related …
Batchlens: A Visualization Approach For Analyzing Batch Jobs In Cloud Systems, Shaolun Ruan, Yong Wang, Hailong Jiang, Weijia Xu, Qiang. Guan
Batchlens: A Visualization Approach For Analyzing Batch Jobs In Cloud Systems, Shaolun Ruan, Yong Wang, Hailong Jiang, Weijia Xu, Qiang. Guan
Research Collection School Of Computing and Information Systems
Cloud systems are becoming increasingly powerful and complex. It is highly challenging to identify anomalous execution behaviors and pinpoint problems by examining the overwhelming intermediate results/states in complex application workflows. Domain scientists urgently need a friendly and functional interface to understand the quality of the computing services and the performance of their applications in real time. To meet these needs, we explore data generated by job schedulers and investigate general performance metrics (e.g., utilization of CPU, memory and disk I/O). Specifically, we propose an interactive visual analytics approach, BatchLens, to provide both providers and users of cloud service with an …
Efficient Certificateless Multi-Copy Integrity Auditing Scheme Supporting Data Dynamics, Lei Zhou, Anmin Fu, Guomin Yang, Huaqun Wang, Yuqing Zhang
Efficient Certificateless Multi-Copy Integrity Auditing Scheme Supporting Data Dynamics, Lei Zhou, Anmin Fu, Guomin Yang, Huaqun Wang, Yuqing Zhang
Research Collection School Of Computing and Information Systems
To improve data availability and durability, cloud users would like to store multiple copies of their original files at servers. The multi-copy auditing technique is proposed to provide users with the assurance that multiple copies are actually stored in the cloud. However, most multi-replica solutions rely on Public Key Infrastructure (PKI), which entails massive overhead of certificate computation and management. In this article, we propose an efficient multi-copy dynamic integrity auditing scheme by employing certificateless signatures (named MDSS), which gets rid of expensive certificate management overhead and avoids the key escrow problem in identity-based signatures. Specifically, we improve the classic …
Efficient Server-Aided Secure Two-Party Computation In Heterogeneous Mobile Cloud Computing, Yulin Wu, Xuan Wang, Willy Susilo, Guomin Yang, Zoe L. Jiang, Qian Chen, Peng Xu
Efficient Server-Aided Secure Two-Party Computation In Heterogeneous Mobile Cloud Computing, Yulin Wu, Xuan Wang, Willy Susilo, Guomin Yang, Zoe L. Jiang, Qian Chen, Peng Xu
Research Collection School Of Computing and Information Systems
With the ubiquity of mobile devices and rapid development of cloud computing, mobile cloud computing (MCC) has been considered as an essential computation setting to support complicated, scalable and flexible mobile applications by overcoming the physical limitations of mobile devices with the aid of cloud. In the MCC setting, since many mobile applications (e.g., map apps) interacting with cloud server and application server need to perform computation with the private data of users, it is important to realize secure computation for MCC. In this article, we propose an efficient server-aided secure two-party computation (2PC) protocol for MCC. This is the …