Open Access. Powered by Scholars. Published by Universities.®

Digital Commons Network™

Open Access. Powered by Scholars. Published by Universities.®

Research Collection School Of Computing and Information Systems

Discipline
Keyword
Publication Year

Articles 1621 - 1650 of 4266

Full-Text Articles in Entire DC Network

Analysis Of Online Posts To Discover Student Learning Challenges And Inform Targeted Curriculum Improvement Actions, Michelle L. F. Cheong, Jean Y. C. Chen, Bingtian Dai Dec 2020

Analysis Of Online Posts To Discover Student Learning Challenges And Inform Targeted Curriculum Improvement Actions, Michelle L. F. Cheong, Jean Y. C. Chen, Bingtian Dai

Research Collection School Of Computing and Information Systems

Past research on analysing end-of-term student feedback tend to result in only high-level course improvement suggestions, and some recent research even argued that student feedback is a poor indicator of teaching effectiveness and student learning. Our intelligent Q&A platform with machine learning prediction and engagement features allow students to ask self-directed questions and provide answers in an out-of-class informal setting. By analysing such high quality and truthful posts which represent the students’ queries and knowledge about the course content, we can better identify the exact course topics which the students face learning challenges. We have implemented our Q&A platform for …

Go to article

Audee: Automated Testing For Deep Learning Frameworks, Qianyu Guo, Xiaofei Xie, Yi Li, Xiaoyu Zhang, Yang Liu, Xiaohong Li, Chao Shen Dec 2020

Audee: Automated Testing For Deep Learning Frameworks, Qianyu Guo, Xiaofei Xie, Yi Li, Xiaoyu Zhang, Yang Liu, Xiaohong Li, Chao Shen

Research Collection School Of Computing and Information Systems

Deep learning (DL) has been applied widely, and the quality of DL system becomes crucial, especially for safety-critical applications. Existing work mainly focuses on the quality analysis of DL models, but lacks attention to the underlying frameworks on which all DL models depend. In this work, we propose Audee, a novel approach for testing DL frameworks and localizing bugs. Audee adopts a search-based approach and implements three different mutation strategies to generate diverse test cases by exploring combinations of model structures, parameters, weights and inputs. Audee is able to detect three types of bugs: logical bugs, crashes and Not-a-Number (NaN) …

Go to article

Jointly Optimizing Sensing Pipelines For Multimodal Mixed Reality Interaction, Ramesh Darshana Rathnayake Kanatta Gamage, Ashen De Silva, Dasun Puwakdandawa, Lakmal Meegahapola, Archan Misra, Indika Perera Dec 2020

Jointly Optimizing Sensing Pipelines For Multimodal Mixed Reality Interaction, Ramesh Darshana Rathnayake Kanatta Gamage, Ashen De Silva, Dasun Puwakdandawa, Lakmal Meegahapola, Archan Misra, Indika Perera

Research Collection School Of Computing and Information Systems

Natural human interactions for Mixed Reality Applications are overwhelmingly multimodal: humans communicate intent and instructions via a combination of visual, aural and gestural cues. However, supporting low-latency and accurate comprehension of such multimodal instructions (MMI), on resource-constrained wearable devices, remains an open challenge, especially as the state-of-the-art comprehension techniques for each individual modality increasingly utilize complex Deep Neural Network models. We demonstrate the possibility of overcoming the core limitation of latency–vs.–accuracy tradeoff by exploiting cross-modal dependencies–i.e., by compensating for the inferior performance of one model with an increased accuracy of more complex model of a different modality. We present a …

Go to article

Nearest Centroid: A Bridge Between Statistics And Machine Learning, Manoj Thulasidas Dec 2020

Nearest Centroid: A Bridge Between Statistics And Machine Learning, Manoj Thulasidas

Research Collection School Of Computing and Information Systems

In order to guide our students of machine learning in their statistical thinking, we need conceptually simple and mathematically defensible algorithms. In this paper, we present the Nearest Centroid algorithm (NC) algorithm as a pedagogical tool, combining the key concepts behind two foundational algorithms: K-Means clustering and K Nearest Neighbors (k- NN). In NC, we use the centroid (as defined in the K-Means algorithm) of the observations belonging to each class in our training data set and its distance from a new observation (similar to k-NN) for class prediction. Using this obvious extension, we will illustrate how the concepts of …

Go to article

Identifying And Characterizing Alternative News Media On Facebook, Samuel S. Guimaraes, Julia C. S. Reis, Lucas Lima, Filipe N. Ribeiro, Marisa Vasconcelos, Jisun An, Haewoon Kwak, Fabricio Benevenuto Dec 2020

Identifying And Characterizing Alternative News Media On Facebook, Samuel S. Guimaraes, Julia C. S. Reis, Lucas Lima, Filipe N. Ribeiro, Marisa Vasconcelos, Jisun An, Haewoon Kwak, Fabricio Benevenuto

Research Collection School Of Computing and Information Systems

As Internet users increasingly rely on social media sites to receive news, they are faced with a bewildering number of news media choices. For example, thousands of Facebook pages today are registered and categorized as some form of news media outlets. This situation boosted the so-called independent journalism, also known as alternative news media. Identifying and characterizing all the news pages that play an important role in news dissemination is key for understanding the news ecosystems of a country. In this work, we propose a graph-based semi-supervised method to measure the political bias of pages on most countries and show …

Go to article

A Deep Learning Framework Supporting Model Ownership Protection And Traitor Tracing, Guowen Xu, Hongwei Li, Yuan Zhang, Xiaodong Lin, Robert H. Deng, Xuemin (Sherman) Shen Dec 2020

A Deep Learning Framework Supporting Model Ownership Protection And Traitor Tracing, Guowen Xu, Hongwei Li, Yuan Zhang, Xiaodong Lin, Robert H. Deng, Xuemin (Sherman) Shen

Research Collection School Of Computing and Information Systems

Cloud-based deep learning (DL) solutions have been widely used in applications ranging from image recognition to speech recognition. Meanwhile, as commercial software and services, such solutions have raised the need for intellectual property rights protection of the underlying DL models. Watermarking is the mainstream of existing solutions to address this concern, by primarily embedding pre-defined secrets in a model's training process. However, existing efforts almost exclusively focus on detecting whether a target model is pirated, without considering traitor tracing. In this paper, we present SecureMark_DL, which enables a model owner to embed a unique fingerprint for every customer within parameters …

Go to article

A Near-Optimal Change-Detection Based Algorithm For Piecewise-Stationary Combinatorial Semi-Bandits, Huozhi Zhou, Lingda Wang, Lav N. Varshney, Ee-Peng Lim Dec 2020

A Near-Optimal Change-Detection Based Algorithm For Piecewise-Stationary Combinatorial Semi-Bandits, Huozhi Zhou, Lingda Wang, Lav N. Varshney, Ee-Peng Lim

Research Collection School Of Computing and Information Systems

We investigate the piecewise-stationary combinatorial semi-bandit problem. Compared to the original combinatorial semi-bandit problem, our setting assumes the reward distributions of base arms may change in a piecewise-stationary manner at unknown time steps. We propose an algorithm, GLR-CUCB, which incorporates an efficient combinatorial semi-bandit algorithm, CUCB, with an almost parameter-free change-point detector, the Generalized Likelihood Ratio Test (GLRT). Our analysis shows that the regret of GLR-CUCB is upper bounded by O(√NKT logT), where N is the number of piecewise-stationary segments, K is the number of base arms, and T is the number of time steps. As a complement, we also …

Go to article

Generating Concept Based Api Element Comparison Using A Knowledge Graph, Yang Liu, Mingwei Liu, Xin Peng, Christoph Treude, Zhenchang Xing, Xiaoxin Zhang Dec 2020

Generating Concept Based Api Element Comparison Using A Knowledge Graph, Yang Liu, Mingwei Liu, Xin Peng, Christoph Treude, Zhenchang Xing, Xiaoxin Zhang

Research Collection School Of Computing and Information Systems

Recommender systems are a valuable tool for software engineers. For example, they can provide developers with a ranked list of files likely to contain a bug, or multiple auto-complete suggestions for a given method stub. However, the way these recommender systems interact with developers is often rudimentary—a long list of recommendations only ranked by the model’s confidence. In this vision paper, we lay out our research agenda for re-imagining how recommender systems for software engineering communicate their insights to developers. When issuing recommendations, our aim is to recommend diverse rather than redundant solutions and present them in ways that highlight …

Go to article

Improving Gan Training With Probability Ratio Clipping And Sample Reweighting, Yue Wu, Pan Zhou, Andrew Wilson Gordon, Eric Xing, Zhiting Hu Dec 2020

Improving Gan Training With Probability Ratio Clipping And Sample Reweighting, Yue Wu, Pan Zhou, Andrew Wilson Gordon, Eric Xing, Zhiting Hu

Research Collection School Of Computing and Information Systems

Despite success on a wide range of problems related to vision, generative adversarial networks (GANs) often suffer from inferior performance due to unstable training, especially for text generation. To solve this issue, we propose a new variational GAN training framework which enjoys superior training stability. Our approach is inspired by a connection of GANs and reinforcement learning under a variational perspective. The connection leads to (1) probability ratio clipping that regularizes generator training to prevent excessively large updates, and (2) a sample re-weighting mechanism that improves discriminator training by downplaying bad-quality fake samples. Moreover, our variational GAN framework can provably …

Go to article

Algorithms And Hardness Results For Computing Cores Of Markov Chains, Ali Ahmadi, Krishnendu Chatterjee, Amir Kafshdar Goharshady, Tobias Meggendorfer, Roodabeh Safavi, Dorde Zikelic Dec 2020

Algorithms And Hardness Results For Computing Cores Of Markov Chains, Ali Ahmadi, Krishnendu Chatterjee, Amir Kafshdar Goharshady, Tobias Meggendorfer, Roodabeh Safavi, Dorde Zikelic

Research Collection School Of Computing and Information Systems

Given a Markov chain M = (V,v0,δ), with state space V and a starting state v0, and a probability threshold ϵ, an ϵ-core is a subset C of states that is left with probability at most ϵ. More formally, C ⊆V is an ϵ-core, iff P reach(V\C) ≤ ϵ. Cores have been applied in a wide variety of verification problems over Markov chains, Markov decision processes, and probabilistic programs, as a means of discarding uninteresting and low-probability parts of a probabilistic system and instead being able to focus on the states that are likely to be encountered in a real-world …

Go to article

Smartfuzz: An Automated Smart Fuzzing Approach For Testing Smartthings Apps, Lwin Khin Shar, Nguyen Binh Duong Ta, Lingxiao Jiang, David Lo, Wei Minn, Kiah Yong Glenn Yeo, Eugene Kim Dec 2020

Smartfuzz: An Automated Smart Fuzzing Approach For Testing Smartthings Apps, Lwin Khin Shar, Nguyen Binh Duong Ta, Lingxiao Jiang, David Lo, Wei Minn, Kiah Yong Glenn Yeo, Eugene Kim

Research Collection School Of Computing and Information Systems

As IoT ecosystem has been fast-growing recently, there have been various security concerns of this new computing paradigm. Malicious IoT apps gaining access to IoT devices and capabilities to execute sensitive operations (sinks), e.g., controlling door locks and switches, may cause serious security and safety issues. Unlike traditional mobile/web apps, IoT apps highly interact with a wide variety of physical IoT devices and respond to environmental events, in addition to user inputs. It is therefore important to conduct comprehensive testing of IoT apps to identify possible anomalous behaviours. On the other hand, it is also important to optimize the number …

Go to article

Social Media Analytics: A Case Study Of Singapore General Election 2020, Sebastian Zhi Tao Khoo, Leong Hock Ho, Ee Hong Lee, Danston Kheng Boon Goh, Zehao Zhang, Swee Hong Ng, Haodi Qi, Kyong Jin Shim Dec 2020

Social Media Analytics: A Case Study Of Singapore General Election 2020, Sebastian Zhi Tao Khoo, Leong Hock Ho, Ee Hong Lee, Danston Kheng Boon Goh, Zehao Zhang, Swee Hong Ng, Haodi Qi, Kyong Jin Shim

Research Collection School Of Computing and Information Systems

The 2020 Singaporean General Election (GE2020) was a general election held in Singapore on July 10, 2020. In this study, we present an analysis on social conversations about GE2020 during the election period. We analyzed social conversations from popular platforms such as Twitter, HardwareZone, and TR Emeritus.

Go to article

Watch Out! Motion Is Blurring The Vision Of Your Deep Neural Networks, Qing Guo, Felix Juefei-Xu, Xiaofei Xie, Lei Ma, Jian Wang, Bing Yu, Wei Feng, Yang Liu Dec 2020

Watch Out! Motion Is Blurring The Vision Of Your Deep Neural Networks, Qing Guo, Felix Juefei-Xu, Xiaofei Xie, Lei Ma, Jian Wang, Bing Yu, Wei Feng, Yang Liu

Research Collection School Of Computing and Information Systems

The state-of-the-art deep neural networks (DNNs) are vulnerable to adversarial examples with additive random noise-like perturbations. While such examples are hardly found in the physical world, the image blurring effect caused by object motion, on the other hand, commonly occurs in practice, making the study of which greatly important especially for the widely adopted real-time image processing tasks (e.g., object detection, tracking). In this paper, we initiate the first step to comprehensively investigate the potential hazards of blur effect for DNN, caused by object motion. We propose a novel adversarial attack method that can generate visually natural motion-blurred adversarial examples, …

Go to article

Design Of A Two-Echelon Freight Distribution System In An Urban Area Considering Third-Party Logistics And Loading-Unloading Zones, Vincent F. Yu, Winarno, Shih-Wei Lin, Aldy Gunawan Dec 2020

Design Of A Two-Echelon Freight Distribution System In An Urban Area Considering Third-Party Logistics And Loading-Unloading Zones, Vincent F. Yu, Winarno, Shih-Wei Lin, Aldy Gunawan

Research Collection School Of Computing and Information Systems

This research examines the problem of designing a two-echelon freight distribution system in a dense urban area that considers third-party logistics (TPL) and loading–unloading zones (LUZs). The proposed system takes advantage of outsourcing the last mile deliveries to a TPL provider and utilizing LUZs as temporary intermediate facilities instead of using permanent intermediate facilities to consolidate freight. A mathematical model and a simulated annealing (SA) algorithm are developed to solve the problem. The efficiency and effectiveness of the proposed SA heuristic are verified by testing it on existing benchmark instances. Computational results show that the performance of the proposed SA …

Go to article

Debunking Rumors On Twitter With Tree Transformer, Jing Ma, Wei Gao Dec 2020

Debunking Rumors On Twitter With Tree Transformer, Jing Ma, Wei Gao

Research Collection School Of Computing and Information Systems

Rumors are manufactured with no respect for accuracy, but can circulate quickly and widely by "word-of-post" through social media conversations. Conversation tree encodes important information indicative of the credibility of rumor. Existing conversation-based techniques for rumor detection either just strictly follow tree edges or treat all the posts fully-connected during feature learning. In this paper, we propose a novel detection model based on tree transformer to better utilize user interactions in the dialogue where post-level self-attention plays the key role for aggregating the intra-/inter-subtree stances. Experimental results on the TWITTER and PHEME datasets show that the proposed approach consistently improves …

Go to article

Towards Theoretically Understanding Why Sgd Generalizes Better Than Adam In Deep Learning, Pan Zhou, Jiashi Feng, Chao Ma, Caiming Xiong, Steven C. H. Hoi, Weinan E Dec 2020

Towards Theoretically Understanding Why Sgd Generalizes Better Than Adam In Deep Learning, Pan Zhou, Jiashi Feng, Chao Ma, Caiming Xiong, Steven C. H. Hoi, Weinan E

Research Collection School Of Computing and Information Systems

It is not clear yet why ADAM-alike adaptive gradient algorithms suffer from worse generalization performance than SGD despite their faster training speed. This work aims to provide understandings on this generalization gap by analyzing their local convergence behaviors. Specifically, we observe the heavy tails of gradient noise in these algorithms. This motivates us to analyze these algorithms through their Lévy-driven stochastic differential equations (SDEs) because of the similar convergence behaviors of an algorithm and its SDE. Then we establish the escaping time of these SDEs from a local basin. The result shows that (1) the escaping time of both SGD …

Go to article

A Hybrid Approach For Detecting Prerequisite Relations In Multi-Modal Food Recipes, Liangming Pan, Jingjing Chen, Shaoteng Liu, Chong-Wah Ngo, Min-Yen Kan, Tat-Seng Chua Dec 2020

A Hybrid Approach For Detecting Prerequisite Relations In Multi-Modal Food Recipes, Liangming Pan, Jingjing Chen, Shaoteng Liu, Chong-Wah Ngo, Min-Yen Kan, Tat-Seng Chua

Research Collection School Of Computing and Information Systems

Modeling the structure of culinary recipes is the core of recipe representation learning. Current approaches mostly focus on extracting the workflow graph from recipes based on text descriptions. Process images, which constitute an important part of cooking recipes, has rarely been investigated in recipe structure modeling. We study this recipe structure problem from a multi-modal learning perspective, by proposing a prerequisite tree to represent recipes with cooking images at a step-level granularity. We propose a simple-yet-effective two-stage framework to automatically construct the prerequisite tree for a recipe by (1) utilizing a trained classifier to detect pairwise prerequisite relations that fuses …

Go to article

Understanding Continuance Intention Toward Crowdsourcing Games: A Longitudinal Investigation, Xiaohui Wang, Dion Hoe-Lian Goh, Ee-Peng Lim Dec 2020

Understanding Continuance Intention Toward Crowdsourcing Games: A Longitudinal Investigation, Xiaohui Wang, Dion Hoe-Lian Goh, Ee-Peng Lim

Research Collection School Of Computing and Information Systems

Given the increasing popularity of gamified crowdsourcing, the study reported here involved examining determinants of users' continuance intention toward crowdsourcing games, both with longitudinal data and reference to a revised unified theory of acceptance and use of technology (UTAUT). At three time points, data were collected from an online survey about playing crowdsourcing games. Time-lagged regression, cross-temporal correlation, and structural equation modeling were performed to examine determinants of the acceptance of crowdsourcing games. Results indicate that the revised UTAUT2 is applicable to explaining the acceptance of crowdsourcing games. Not only did effort expectancy, hedonic motivation, and social influence directly affect …

Go to article

Secure Answer Book And Automatic Grading, Manoj Thulasidas Dec 2020

Secure Answer Book And Automatic Grading, Manoj Thulasidas

Research Collection School Of Computing and Information Systems

In response to the growing need to perform assessments online, we have developed a secure answer book, as well as a tool for automatically grading it for our course on spread- sheet modeling. We applied these techniques to a cohort of about 160 students who took the course last term. In this paper, we describe the design, implementation and the techniques employed to enhance both the security of the answer book and the ease, accuracy and consistency of grading. In addition, we summarize the experience and takeaways, both from the instructor and the student perspectives. Although the answer book and …

Go to article

Interventional Few-Shot Learning, Zhongqi Yue, Zhang Hanwang, Qianru Sun, Xian-Sheng Hua Dec 2020

Interventional Few-Shot Learning, Zhongqi Yue, Zhang Hanwang, Qianru Sun, Xian-Sheng Hua

Research Collection School Of Computing and Information Systems

We uncover an ever-overlooked deficiency in the prevailing Few-Shot Learning (FSL) methods: the pre-trained knowledge is indeed a confounder that limits the performance. This finding is rooted from our causal assumption: a Structural Causal Model (SCM) for the causalities among the pre-trained knowledge, sample features, and labels. Thanks to it, we propose a novel FSL paradigm: Interventional Few-Shot Learning (IFSL). Specifically, we develop three effective IFSL algorithmic implementations based on the backdoor adjustment, which is essentially a causal intervention towards the SCM of many-shot learning: the upper-bound of FSL in a causal view. It is worth noting that the contribution …

Go to article

Causal Intervention For Weakly-Supervised Semantic Segmentation, Zhang Dong, Hanwang Zhang, Jinhui Tang, Xian-Sheng Hua, Qianru Sun Dec 2020

Causal Intervention For Weakly-Supervised Semantic Segmentation, Zhang Dong, Hanwang Zhang, Jinhui Tang, Xian-Sheng Hua, Qianru Sun

Research Collection School Of Computing and Information Systems

We present a causal inference framework to improve Weakly-Supervised Semantic Segmentation (WSSS). Specifically, we aim to generate better pixel-level pseudo-masks by using only image-level labels --- the most crucial step in WSSS. We attribute the cause of the ambiguous boundaries of pseudo-masks to the confounding context, e.g., the correct image-level classification of "horse'' and "person'' may be not only due to the recognition of each instance, but also their co-occurrence context, making the model inspection (e.g., CAM) hard to distinguish between the boundaries. Inspired by this, we propose a structural causal model to analyze the causalities among images, contexts, and …

Go to article

A Bert-Based Dual Embedding Model For Chinese Idiom Prediction, Minghuan Tan, Jing Jiang Dec 2020

A Bert-Based Dual Embedding Model For Chinese Idiom Prediction, Minghuan Tan, Jing Jiang

Research Collection School Of Computing and Information Systems

Chinese idioms are special fixed phrases usually derived from ancient stories, whose meanings are oftentimes highly idiomatic and non-compositional. The Chinese idiom prediction task is to select the correct idiom from a set of candidate idioms given a context with a blank. We propose a BERT-based dual embedding model to encode the contextual words as well as to learn dual embeddings of the idioms. Specifically, we first match the embedding of each candidate idiom with the hidden representation corresponding to the blank in the context. We then match the embedding of each candidate idiom with the hidden representations of all …

Go to article

Jointly Optimizing Sensing Pipelines For Multimodal Mixed Reality Interaction, Darshana Rathnayake, Ashen De Silva, Dasun Puwakdandawa, Lakmal Meegahapola, Archan Misra, Indika Perera Dec 2020

Jointly Optimizing Sensing Pipelines For Multimodal Mixed Reality Interaction, Darshana Rathnayake, Ashen De Silva, Dasun Puwakdandawa, Lakmal Meegahapola, Archan Misra, Indika Perera

Research Collection School Of Computing and Information Systems

Natural human interactions for Mixed Reality Applications are overwhelmingly multimodal: humans communicate intent and instructions via a combination of visual, aural and gestural cues. However, supporting low-latency and accurate comprehension of such multimodal instructions (MMI), on resource-constrained wearable devices, remains an open challenge, especially as the state-of-the-art comprehension techniques for each individual modality increasingly utilize complex Deep Neural Network models. We demonstrate the possibility of overcoming the core limitation of latency--vs.--accuracy tradeoff by exploiting cross-modal dependencies -- i.e., by compensating for the inferior performance of one model with an increased accuracy of more complex model of a different modality. We …

Go to article

Secure And Verifiable Inference In Deep Neural Networks, Guowen Xu, Hongwei Li, Hao Ren, Jianfei Sun, Shengmin Xu, Jianting Ning, Haoming Yang, Kan Yang, Robert H. Deng Dec 2020

Secure And Verifiable Inference In Deep Neural Networks, Guowen Xu, Hongwei Li, Hao Ren, Jianfei Sun, Shengmin Xu, Jianting Ning, Haoming Yang, Kan Yang, Robert H. Deng

Research Collection School Of Computing and Information Systems

Outsourced inference service has enormously promoted the popularity of deep learning, and helped users to customize a range of personalized applications. However, it also entails a variety of security and privacy issues brought by untrusted service providers. Particularly, a malicious adversary may violate user privacy during the inference process, or worse, return incorrect results to the client through compromising the integrity of the outsourced model. To address these problems, we propose SecureDL to protect the model’s integrity and user’s privacy in Deep Neural Networks (DNNs) inference process. In SecureDL, we first transform complicated non-linear activation functions of DNNs to low-degree …

Go to article

Sadt: Syntax-Aware Differential Testing Of Certificate Validation In Ssl/Tls Implementations, Lili Quan, Qianyu Guo, Hongxu Chen, Xiaofei Xie, Xiaohong Li, Yang Liu, Jing Hu Dec 2020

Sadt: Syntax-Aware Differential Testing Of Certificate Validation In Ssl/Tls Implementations, Lili Quan, Qianyu Guo, Hongxu Chen, Xiaofei Xie, Xiaohong Li, Yang Liu, Jing Hu

Research Collection School Of Computing and Information Systems

The security assurance of SSL/TLS critically depends on the correct validation of X.509 certificates. Therefore, it is important to check whether a certificate is correctly validated by the SSL/TLS implementations. Although differential testing has been proven to be effective in finding semantic bugs, it still suffers from the following limitations: (1) The syntax of test cases cannot be correctly guaranteed. (2) Current test cases are not diverse enough to cover more implementation behaviours. This paper tackles these problems by introducing SADT, a novel syntax-aware differential testing framework for evaluating the certificate validation process in SSL/TLS implementations. We first propose a …

Go to article

Learning Personal Conscientiousness From Footprints In E-Learning Systems, Lo Pang-Yun Ting, Shan Yun Teng, Kun Ta Chuang, Ee-Peng Lim Nov 2020

Learning Personal Conscientiousness From Footprints In E-Learning Systems, Lo Pang-Yun Ting, Shan Yun Teng, Kun Ta Chuang, Ee-Peng Lim

Research Collection School Of Computing and Information Systems

Personality inference has received widespread attention for its potential to infer psychological well being, job satisfaction, romantic relationship success, and professional performance. In this research, we focus on Conscientiousness, one of the well studied Big Five personality traits, which determines if a person is self-disciplined, organized, and hard-working. Research has shown that Conscientiousness is related to a person's academic and workplace success. For an expert to evaluate a person's Conscientiousness, long-term observation of the person's behavior at work place or at home is usually required. To reduce this evaluation effort as well as to cope with the increasing trend of …

Go to article

Multi-User Verifiable Searchable Symmetric Encryption For Cloud Storage, Xueqiao Liu, Guomin Yang, Guomin Yang Nov 2020

Multi-User Verifiable Searchable Symmetric Encryption For Cloud Storage, Xueqiao Liu, Guomin Yang, Guomin Yang

Research Collection School Of Computing and Information Systems

In a cloud data storage system, symmetric key encryption is usually used to encrypt files due to its high efficiency. In order allow the untrusted/semi-trusted cloud storage server to perform searching over encrypted data while maintaining data confidentiality, searchable symmetric encryption (SSE) has been proposed. In a typical SSE scheme, a users stores encrypted files on a cloud storage server and later can retrieve the encrypted files containing specific keywords. The basic security requirement of SSE is that the cloud server learns no information about the files or the keywords during the searching process. Some SSE schemes also offer additional …

Go to article

Cross-Thought For Sentence Encoder Pre-Training, Shuohang Wang, Yuwei Fang, Siqi Sun, Zhe Gan, Yu Cheng, Jingjing Liu, Jing Jiang Nov 2020

Cross-Thought For Sentence Encoder Pre-Training, Shuohang Wang, Yuwei Fang, Siqi Sun, Zhe Gan, Yu Cheng, Jingjing Liu, Jing Jiang

Research Collection School Of Computing and Information Systems

In this paper, we propose Cross-Thought, a novel approach to pre-training sequence encoder, which is instrumental in building reusable sequence embeddings for large-scale NLP tasks such as question answering. Instead of using the original signals of full sentences, we train a Transformer-based sequence encoder over a large set of short sequences, which allows the model to automatically select the most useful information for predicting masked words. Experiments on question answering and textual entailment tasks demonstrate that our pre-trained encoder can outperform state-of-the-art encoders trained with continuous sentence signals as well as traditional masked language modeling baselines. Our proposed approach also …

Go to article

Coupled Hierarchical Transformer For Stance-Aware Rumor Verification In Social Media Conversations, Jianfei Yu, Jing Jiang, Ling Min Serena Khoo, Hai Leong Chieu, Rui Xia Nov 2020

Coupled Hierarchical Transformer For Stance-Aware Rumor Verification In Social Media Conversations, Jianfei Yu, Jing Jiang, Ling Min Serena Khoo, Hai Leong Chieu, Rui Xia

Research Collection School Of Computing and Information Systems

The prevalent use of social media enables rapid spread of rumors on a massive scale, which leads to the emerging need of automatic rumor verification (RV). A number of previous studies focus on leveraging stance classification to enhance RV with multi-task learning (MTL) methods. However, most of these methods failed to employ pre-trained contextualized embeddings such as BERT, and did not exploit inter-task dependencies by using predicted stance labels to improve the RV task. Therefore, in this paper, to extend BERT to obtain thread representations, we first propose a Hierarchical Transformer1 , which divides each long thread into shorter subthreads, …

Go to article

Effort-Aware Just-In-Time Defect Identification In Practice: A Case Study At Alibaba, Meng Yan, Xin Xia, Yuanrui Fan, David Lo, Ahmed E. Hassan, Xindong Zhang Nov 2020

Effort-Aware Just-In-Time Defect Identification In Practice: A Case Study At Alibaba, Meng Yan, Xin Xia, Yuanrui Fan, David Lo, Ahmed E. Hassan, Xindong Zhang

Research Collection School Of Computing and Information Systems

Effort-aware Just-in-Time (JIT) defect identification aims at identifying defect-introducing changes just-in-time with limited code inspection effort. Such identification has two benefits compared with traditional module-level defect identification, i.e., identifying defects in a more cost-effective and efficient manner. Recently, researchers have proposed various effort-aware JIT defect identification approaches, including supervised (e.g., CBS+, OneWay) and unsupervised approaches (e.g., LT and Code Churn). The comparison of the effectiveness between such supervised and unsupervised approaches has attracted a large amount of research interest. However, the effectiveness of the recently proposed approaches and the comparison among them have never been investigated in an industrial setting.In …

Go to article

First Prev Next Last