Open Access. Powered by Scholars. Published by Universities.®
- Discipline
-
- Physical Sciences and Mathematics (8549)
- Computer Sciences (8532)
- Databases and Information Systems (3451)
- Software Engineering (2164)
- Artificial Intelligence and Robotics (1697)
-
- Information Security (1067)
- Numerical Analysis and Scientific Computing (1024)
- Engineering (956)
- Graphics and Human Computer Interfaces (933)
- Social and Behavioral Sciences (734)
- Business (686)
- Computer Engineering (512)
- Theory and Algorithms (493)
- Operations Research, Systems Engineering and Industrial Engineering (417)
- Programming Languages and Compilers (379)
- OS and Networks (323)
- Communication (310)
- Social Media (248)
- Public Affairs, Public Policy and Public Administration (227)
- Transportation (204)
- Medicine and Health Sciences (186)
- Education (180)
- Management Information Systems (178)
- Data Storage Systems (176)
- E-Commerce (151)
- International and Area Studies (125)
- Asian Studies (124)
- Digital Communications and Networking (123)
- Technology and Innovation (114)
- Health Information Technology (113)
- Keyword
-
- Machine learning (125)
- Deep learning (124)
- Social media (80)
- Artificial intelligence (72)
- Reinforcement learning (69)
-
- Data mining (65)
- Privacy (65)
- Cloud computing (58)
- Deep Learning (56)
- Empirical study (55)
- Optimization (55)
- Security (54)
- Singapore (52)
- Visualization (52)
- Task analysis (50)
- Twitter (50)
- Neural networks (49)
- Online learning (49)
- Software engineering (49)
- Training (49)
- Anomaly detection (47)
- Feature extraction (46)
- Collaboration (45)
- Large Language Models (45)
- Blockchain (44)
- Semantics (43)
- Access control (41)
- Algorithms (40)
- Android (39)
- Natural language processing (39)
- Publication Year
- File Type
Articles 3271 - 3300 of 8722
Full-Text Articles in Entire DC Network
We Mind Your Well-Being: Preventing Depression In Uncertain Social Networks By Sequential Interventions, Aye Phye Phye Aung, Xinrun Wang, Bo An, Xiaoli Li
We Mind Your Well-Being: Preventing Depression In Uncertain Social Networks By Sequential Interventions, Aye Phye Phye Aung, Xinrun Wang, Bo An, Xiaoli Li
Research Collection School Of Computing and Information Systems
Mental health has become a major concern according to WHO who estimates that more than 350 million people worldwide are affected by depression. Studies have shown that interventions and social support can reduce stress and depression. However, counselling centers do not have enough resources to provide counselling and social support to all the participants in their interest. This paper helps social support organizations (e.g., university counselling centers) sequentially select the participants for interventions. Unfortunately, previous works do not consider emotion propagation from other neighbours of the influencees and initial uncertainties of mental states and influence. Moreover, they fail to scale …
Extracting Deep Features From Short Ecg Signals For Early Atrial Fibrillation Detection, Xiaodan Wu, Yumeng Zheng, Chao-Hsien Chu, Zhen He
Extracting Deep Features From Short Ecg Signals For Early Atrial Fibrillation Detection, Xiaodan Wu, Yumeng Zheng, Chao-Hsien Chu, Zhen He
Research Collection School Of Computing and Information Systems
Atrial Fibrillation (AF) at an early stage has a short duration and is sometimes asymptomatic, making it difficult to detect. Although the use of mobile sensing devices has provided the possibility of real-time cardiac detection, it is highly susceptible to the noise signals generated by body movement. Therefore, it is of great importance to study early AF detection for mobile terminals with noise immunity. Extracting effective features is critical to AF detection, but most existing studies used shallow time, frequency or time-frequency energy (TFE) features with weak representation that need to rely on long ECG signals to capture the variation …
Querying Recurrent Convoys Over Trajectory Data, Munkh-Erdene Yadamjav, Zhifeng Bao, Baihua Zheng, Farhana M. Choudhury, Hanan Samet
Querying Recurrent Convoys Over Trajectory Data, Munkh-Erdene Yadamjav, Zhifeng Bao, Baihua Zheng, Farhana M. Choudhury, Hanan Samet
Research Collection School Of Computing and Information Systems
Moving objects equipped with location-positioning devices continuously generate a large amount of spatio-temporal trajectory data. An interesting finding over a trajectory stream is a group of objects that are travelling together for a certain period of time. Existing studies on mining co-moving objects do not consider an important correlation between co-moving objects, which is the reoccurrence of the movement pattern. In this study, we define a problem of finding recurrent pattern of co-moving objects from streaming trajectories and propose an efficient solution that enables us to discover recent co-moving object patterns repeated within a given time period. Experimental results on …
The Future Of Work Now: The Multi-Faceted Mall Security Guard At A Multi-Faceted Jewel, Thomas H. Davenport, Steven M. Miller
The Future Of Work Now: The Multi-Faceted Mall Security Guard At A Multi-Faceted Jewel, Thomas H. Davenport, Steven M. Miller
Research Collection School Of Computing and Information Systems
One of the most frequently-used phrases at business events these days is “the future of work.” It’s increasingly clear that artificial intelligence and other new technologies will bring substantial changes in work tasks and business processes. But while these changes are predicted for the future, they’re already present in many organizations for many different jobs. The job and incumbents described below are an example of this phenomenon. Steve Miller of Singapore Management University and I co-authored the story.
Privacy-Preserving Outsourced Calculation Toolkit In The Cloud, Ximeng Liu, Robert H. Deng, Kim-Kwang Raymond Choo, Yang Yang, Hwee Hwa Pang
Privacy-Preserving Outsourced Calculation Toolkit In The Cloud, Ximeng Liu, Robert H. Deng, Kim-Kwang Raymond Choo, Yang Yang, Hwee Hwa Pang
Research Collection School Of Computing and Information Systems
In this paper, we propose a privacy-preserving outsourced calculation toolkit, Pockit, designed to allow data owners to securely outsource their data to the cloud for storage. The outsourced encrypted data can be processed by the cloud server to achieve commonly-used plaintext arithmetic operations without involving additional servers. Specifically, we design both signed and unsigned integer circuits using a fully homomorphic encryption (FHE) scheme, construct a new packing technique (hereafter referred to as integer packing), and extend the secure circuits to its packed version. This achieves significant improvements in performance compared with the original secure signed/unsigned integer circuit. The secure integer …
Persona Perception Scale: Development And Exploratory Validation Of An Instrument For Evaluating Individuals' Perceptions Of Personas, Joni Salminen, Joao M. Santos, Haewoon Kwak, Jisun An, Soon-Gyo Jung
Persona Perception Scale: Development And Exploratory Validation Of An Instrument For Evaluating Individuals' Perceptions Of Personas, Joni Salminen, Joao M. Santos, Haewoon Kwak, Jisun An, Soon-Gyo Jung
Research Collection School Of Computing and Information Systems
Although used in many domains, the evaluation of personas is difficult due to the lack of validated measurement instruments. To tackle this challenge, we propose the Persona Perception Scale (PPS), a survey instrument for evaluating how individuals perceive personas. We develop the scale by reviewing relevant literature from social psychology, persona studies, and Human-Computer Interaction to find relevant constructs and items for measuring persona perceptions. Following initial pilot testing, we conduct an exploratory validation of the scale with 412 respondents and find that the constructs and items of the scale perform satisfactorily for deployment. The research has implications for both …
On Modeling Labor Markets For Fine-Grained Insights, Hendrik Santoso Sugiarto, Ee-Peng Lim
On Modeling Labor Markets For Fine-Grained Insights, Hendrik Santoso Sugiarto, Ee-Peng Lim
Research Collection School Of Computing and Information Systems
The labor market consists of job seekers looking for jobs, and job openings waiting for applications. Classical labor market models assume that salary is the primary factor explaining why job-seekers select certain jobs. In practice, job seeker behavior is much more complex and there are other factors that should be considered. In this paper, we therefore propose the Probabilistic Labor Model (PLM) which considers salary satisfaction, topic preference matching, and accessibility as important criteria for job seekers to decide when they apply for jobs. We also determine the user and job latent variables for each criterion and define a graphical …
Urban Scale Trade Area Characterization For Commercial Districts With Cellular Footprints, Yi Zhao, Zimu Zhou, Xu Wang, Tongtong Liu, Zheng Yang
Urban Scale Trade Area Characterization For Commercial Districts With Cellular Footprints, Yi Zhao, Zimu Zhou, Xu Wang, Tongtong Liu, Zheng Yang
Research Collection School Of Computing and Information Systems
Understanding customer mobility patterns to commercial districts is crucial for urban planning, facility management, and business strategies. Trade areas are a widely applied measure to quantify where the visitors are from. Traditional trade area analysis is limited to small-scale or store-level studies, because information such as visits to competitor commercial entities and place of residence is collected by labour-intensive questionnaires or heavily biased location-based social media data. In this article, we propose CellTradeMap, a novel district-level trade area analysis framework using mobile flow records (MFRs), a type of fine-grained cellular network data. We show that compared to traditional cellular data …
Attribute-Based Encryption For Cloud Computing Access Control: A Survey, Yinghui Zhang, Robert H. Deng, Shengmin Xu, Jianfei Sun, Qi Li, Dong Zheng
Attribute-Based Encryption For Cloud Computing Access Control: A Survey, Yinghui Zhang, Robert H. Deng, Shengmin Xu, Jianfei Sun, Qi Li, Dong Zheng
Research Collection School Of Computing and Information Systems
Attribute-based encryption (ABE) for cloud computing access control is reviewed in this article. A taxonomy and comprehensive assessment criteria of ABE are first proposed. In the taxonomy, ABE schemes are assorted into key-policy ABE (KP-ABE) schemes, ciphertext-policy ABE (CP-ABE) schemes, anti-quantum ABE schemes, and generic constructions. In accordance with cryptographically functional features, CP-ABE is further divided into nine subcategories with regard to basic functionality, revocation, accountability, policy hiding, policy updating, multi-authority, hierarchy, offline computation, and outsourced computation. In addition, a systematical methodology for discussing and comparing existing ABE schemes is proposed. For KP-ABE and each type of CP-ABE, the corresponding …
A Genetic Algorithm To Minimise Number Of Vehicles In An Electric Vehicle Routing Problem, Kiian Leong Bertran Queck, Hoong Chuin Lau
A Genetic Algorithm To Minimise Number Of Vehicles In An Electric Vehicle Routing Problem, Kiian Leong Bertran Queck, Hoong Chuin Lau
Research Collection School Of Computing and Information Systems
Electric Vehicles (EVs) and charging infrastructure are starting to become commonplace in major cities around the world. For logistics providers to adopt an EV fleet, there are many factors up for consideration, such as route planning for EVs with limited travel range as well as long-term planning of fleet size. In this paper, we present a genetic algorithm to perform route planning that minimises the number of vehicles required. Specifically, we discuss the challenges on the violations of constraints in the EV routing problem (EVRP) arising from applying genetic algorithm operators. To overcome the challenges, techniques specific to addressing the …
Pine: Enabling Privacy-Preserving Deep Packet Inspection On Tls With Rule-Hiding And Fast Connection Establishment, Jianting Ning, Xinyi Huang, Geong Sen Poh, Shengmin Xu, Jia-Chng Loh, Jain Weng, Robert H. Deng
Pine: Enabling Privacy-Preserving Deep Packet Inspection On Tls With Rule-Hiding And Fast Connection Establishment, Jianting Ning, Xinyi Huang, Geong Sen Poh, Shengmin Xu, Jia-Chng Loh, Jain Weng, Robert H. Deng
Research Collection School Of Computing and Information Systems
Transport Layer Security Inspection (TLSI) enables enterprises to decrypt, inspect and then re-encrypt users’ traffic before it is routed to the destination. This breaks the end-to-end security guarantee of the TLS specification and implementation. It also raises privacy concerns since users’ traffic is now known by the enterprises, and third-party middlebox providers providing the inspection services may additionally learn the inspection or attack rules, policies of the enterprises. Two recent works, BlindBox (SIGCOMM 2015) and PrivDPI (CCS 2019) propose privacy-preserving approaches that inspect encrypted traffic directly to address the privacy concern of users’ traffic. However, BlindBox incurs high preprocessing overhead …
Visualization Research Lab At Hkust, Yong Wang
Visualization Research Lab At Hkust, Yong Wang
Research Collection School Of Computing and Information Systems
HKUST VisLab (http://vis.cse.ust.hk/) is one of the leading research labs in the field of data visualization and human-computer interaction worldwide. The lab is dedicated to conducting cutting-edge research on data visualization and human-computer interaction to facilitate data exploration and analytics in various application domains, including E-learning, urban computing, social media and industry 4.0. Starting from its foundation by Prof. Huamin Qu in August 2004, the mission of HKUST VisLab is to build an excellent visualization research center and foster data visualization research and talent cultivation in Asia, as there were very few visualization researchers in Asia around 2004.
A Hybrid Framework Using A Qubo Solver For Permutation-Based Combinatorial Optimization, Siong Thye Goh, Sabrish Gopalakrishnan, Jianyuan Bo, Hoong Chuin Lau
A Hybrid Framework Using A Qubo Solver For Permutation-Based Combinatorial Optimization, Siong Thye Goh, Sabrish Gopalakrishnan, Jianyuan Bo, Hoong Chuin Lau
Research Collection School Of Computing and Information Systems
In this paper, we propose a hybrid framework to solve large-scale permutation-based combinatorial problems effectively using a high-performance quadratic unconstrained binary optimization (QUBO) solver. To do so, transformations are required to change a constrained optimization model to an unconstrained model that involves parameter tuning. We propose techniques to overcome the challenges in using a QUBO solver that typically comes with limited numbers of bits. First, to smooth the energy landscape, we reduce the magnitudes of the input without compromising optimality. We propose a machine learning approach to tune the parameters for good performance effectively. To handle possible infeasibility, we introduce …
Research Directions For Sharing Economy Issues, Robert J. Kauffman, Maurizio Naldi
Research Directions For Sharing Economy Issues, Robert J. Kauffman, Maurizio Naldi
Research Collection School Of Computing and Information Systems
The sharing economy proposes a new approach to designing and delivering products and services, that aims at avoiding waste, improving efficiency, and favoring bottom-up change. In this research commentary, we survey the current state of things and propose some directions for research. We first describe the industries, products, and services currently representing the sharing paradigm, the technology platforms enabling it, the business models driving it, and the regulatory issues. We envisage that promising areas of research should include: (1) devising more efficient algorithms; (2) considering ecological and prosocial objective functions; (3) dealing with regulatory issues; (4) expanding the span of …
A Lattice-Based Key-Insulated And Privacy-Preserving Signature Scheme With Publicly Derived Public Key, Wenling Liu, Zhen Liu, Khoa Nguyen, Guomin Yang, Yu Yu
A Lattice-Based Key-Insulated And Privacy-Preserving Signature Scheme With Publicly Derived Public Key, Wenling Liu, Zhen Liu, Khoa Nguyen, Guomin Yang, Yu Yu
Research Collection School Of Computing and Information Systems
As a widely used privacy-preserving technique for cryptocurrencies, Stealth Address constitutes a key component of Ring Confidential Transaction (RingCT) protocol and it was adopted by Monero, one of the most popular privacy-centric cryptocurrencies. Recently, Liu et al. [EuroS&P 2019] pointed out a flaw in the current widely used stealth address algorithm that once a derived secret key is compromised, the damage will spread to the corresponding master secret key, and all the derived secret keys thereof. To address this issue, Liu et al. introduced Key-Insulated and Privacy-Preserving Signature Scheme with Publicly Derived Public Key (PDPKS scheme), which captures the functionality, …
Group Instance: Flexible Co-Location Resistant Virtual Machine Placement In Iaas Clouds, Vu Duc Long, Nguyen Binh Duong Ta
Group Instance: Flexible Co-Location Resistant Virtual Machine Placement In Iaas Clouds, Vu Duc Long, Nguyen Binh Duong Ta
Research Collection School Of Computing and Information Systems
This paper proposes and analyzes a new virtual machine (VM) placement technique called Group Instance to deal with co-location attacks in public Infrastructure-as-a-Service (IaaS) clouds. Specifically, Group Instance organizes cloud users into groups with pre-determined sizes set by the cloud provider. Our empirical results obtained via experiments with real-world data sets containing million of VM requests have demonstrated the effectiveness of the new technique. In particular, the advantages of Group Instance are three-fold: 1) it is simple and highly configurable to suit the financial and security needs of cloud providers, 2) it produces better or at least similar performance compared …
Detectif: Unified Detection And Correction Of Iot Faults In Smart Homes, Madhumita Maliick, Archan Misra, Niloy Ganguly, Youngki Lee
Detectif: Unified Detection And Correction Of Iot Faults In Smart Homes, Madhumita Maliick, Archan Misra, Niloy Ganguly, Youngki Lee
Research Collection School Of Computing and Information Systems
This paper tackles the problem of detecting a comprehensive set of sensor faults that can occur in IoT-instrumented smart homes customized to infer Activities of Daily Living (ADL) from the activation of sensor sets. Specifically, sensors can suffer faults that (a) span durations that vary between several seconds to hours, (b) can result in both missing or false-alarm sensor-events. Previous fault detection approaches are geared primarily to identify missing faults (absence of sensor readings) of a permanent (very long-lived) nature, or sporadic false-alarm events. We propose DetectIF, a fault-detection framework that detects faults of varying time duration, and identifies both …
Deepstyle: User Style Embedding For Authorship Attribution Of Short Texts, Zhiqiang Hu, Roy Ka-Wei Lee, Lei Wang, Ee-Peng Lim
Deepstyle: User Style Embedding For Authorship Attribution Of Short Texts, Zhiqiang Hu, Roy Ka-Wei Lee, Lei Wang, Ee-Peng Lim
Research Collection School Of Computing and Information Systems
Authorship attribution (AA), which is the task of finding the owner of a given text, is an important and widely studied research topic with many applications. Recent works have shown that deep learning methods could achieve significant accuracy improvement for the AA task. Nevertheless, most of these proposed methods represent user posts using a single type of features (e.g., word bi-grams) and adopt a text classification approach to address the task. Furthermore, these methods offer very limited explainability of the AA results. In this paper, we address these limitations by proposing DeepStyle, a novel embedding-based framework that learns the representations …
Vehicle Routing Problem With Reverse Cross-Docking: An Adaptive Large Neighborhood Search Algorithm, Aldy Gunawan, Audrey Tedja Widjaja, Pieter Vansteenwegen, Vincent F. Yu
Vehicle Routing Problem With Reverse Cross-Docking: An Adaptive Large Neighborhood Search Algorithm, Aldy Gunawan, Audrey Tedja Widjaja, Pieter Vansteenwegen, Vincent F. Yu
Research Collection School Of Computing and Information Systems
Cross-docking is a logistics strategy that aims at less transportation costs and fast customer deliveries. Incorporating an efficient vehicle routing could increase the benefits of the cross-docking. In this paper, the vehicle routing problem with reverse cross-docking (VRP-RCD) is studied. Reverse logistics has attracted more attention due to its ability to gain more profit and maintain the competitiveness of a company. VRP-RCD includes a four-level supply chain network: suppliers, cross-dock, customers, and outlets, with the objective of minimizing vehicle operational and transportation costs. A two-phase heuristic that employs an adaptive large neighborhood search (ALNS) with various destroy and repair operators …
Social Influence Attentive Neural Network For Friend-Enhanced Recommendation, Yuanfu Lu, Ruobing Xie, Chuan Shi, Yuan Fang, Wei Wang, Xu Zhang, Leyu Lin
Social Influence Attentive Neural Network For Friend-Enhanced Recommendation, Yuanfu Lu, Ruobing Xie, Chuan Shi, Yuan Fang, Wei Wang, Xu Zhang, Leyu Lin
Research Collection School Of Computing and Information Systems
With the thriving of online social networks, there emerges a new recommendation scenario in many social apps, called FriendEnhanced Recommendation (FER) in this paper. In FER, a user is recommended with items liked/shared by his/her friends (called a friend referral circle). These friend referrals are explicitly shown to users. Different from conventional social recommendation, the unique friend referral circle in FER may significantly change the recommendation paradigm, making users to pay more attention to enhanced social factors. In this paper, we first formulate the FER problem, and propose a novel Social Influence Attentive Neural network (SIAN) solution. In order to …
Temporal Heterogeneous Interaction Graph Embedding For Next-Item Recommendation, Yugang Ji, Mingyang Yin, Yuan Fang, Hongxia Yang, Xiangwei Wang, Tianrui Jia, Chuan Shi
Temporal Heterogeneous Interaction Graph Embedding For Next-Item Recommendation, Yugang Ji, Mingyang Yin, Yuan Fang, Hongxia Yang, Xiangwei Wang, Tianrui Jia, Chuan Shi
Research Collection School Of Computing and Information Systems
In the scenario of next-item recommendation, previous methods attempt to model user preferences by capturing the evolution of sequential interactions. However, their sequential expression is often limited, without modeling complex dynamics that short-term demands can often be influenced by long-term habits. Moreover, few of them take into account the heterogeneous types of interaction between users and items. In this paper, we model such complex data as a Temporal Heterogeneous Interaction Graph (THIG) and learn both user and item embeddings on THIGs to address next-item recommendation. The main challenges involve two aspects: the complex dynamics and rich heterogeneity of interactions. We …
Hierarchical Multimodal Attention For End-To-End Audio-Visual Scene-Aware Dialogue Response Generation, Hung Le, Doyen Sahoo, Nancy F. Chen, Steven C. H. Hoi
Hierarchical Multimodal Attention For End-To-End Audio-Visual Scene-Aware Dialogue Response Generation, Hung Le, Doyen Sahoo, Nancy F. Chen, Steven C. H. Hoi
Research Collection School Of Computing and Information Systems
This work is extended from our participation in the Dialogue System Technology Challenge (DSTC7), where we participated in the Audio Visual Scene-aware Dialogue System (AVSD) track. The AVSD track evaluates how dialogue systems understand video scenes and responds to users about the video visual and audio content. We propose a hierarchical attention approach on user queries, video caption, audio and visual features that contribute to improved evaluation results. We also apply a nonlinear feature fusion approach to combine the visual and audio features for better knowledge representation. Our proposed model shows superior performance in terms of both objective evaluation and …
Fasts: A Satisfaction-Boosting Bus Scheduling Assistant (Demo), Momo Song, Zhifeng Bao, Baihua Zheng, Zhiyong Peng
Fasts: A Satisfaction-Boosting Bus Scheduling Assistant (Demo), Momo Song, Zhifeng Bao, Baihua Zheng, Zhiyong Peng
Research Collection School Of Computing and Information Systems
In this paper, we demonstrate a satisfaction-boosting bus scheduling assistant called FASTS, which assists users to find an optimal bus schedule. FASTS performs bus scheduling based on the constraints specified by the user in either a coarse-grained or a fine-grained manner, supports different explorations with a varying number of constraints, and provides analysis to quantify the performance of bus schedules and presents the results in a visually pleasing way. We demonstrate FASTS using real-world bus routes (396 routes) and one-week bus touch-on/touch-off records (28 million trip records) in Singapore.
Zone Path Construction (Zac) Based Approaches For Effective Real-Time Ridesharing, Meghna Lowalekar, Pradeep Varakantham, Patrick Jaillet
Zone Path Construction (Zac) Based Approaches For Effective Real-Time Ridesharing, Meghna Lowalekar, Pradeep Varakantham, Patrick Jaillet
Research Collection School Of Computing and Information Systems
Real-time ridesharing systems such as UberPool, Lyft Line, GrabShare have become hugely popular as they reduce the costs for customers, improve per trip revenue for drivers and reduce traffic on the roads by grouping customers with similar itineraries. The key challenge in these systems is to group the "right" requests to travel together in the "right" available vehicles in real-time, so that the objective (e.g., requests served, revenue or delay) is optimized. This challenge has been addressed in existing work by: (i) generating as many relevant feasible (with respect to the available delay for customers) combinations of requests as possible …
Pricing And Equilibrium In On-Demand Ride-Pooling Markets, Jintao Ke, Hai Yang, Xinwei Li, Hai Wang, Jieping Ye
Pricing And Equilibrium In On-Demand Ride-Pooling Markets, Jintao Ke, Hai Yang, Xinwei Li, Hai Wang, Jieping Ye
Research Collection School Of Computing and Information Systems
With the recent rapid growth of technology-enabled mobility services, ride-sourcing platforms, such as Uber and DiDi, have launched commercial on-demand ride-pooling programs that allow drivers to serve more than one passenger request in each ride. Without requiring the prearrangement of trip schedules, these programs match on-demand passenger requests with vehicles that have vacant seats. Ride-pooling programs are expected to offer benefits for both individual passengers in the form of cost savings and for society in the form of traffic alleviation and emission reduction. In addition to some exogenous variables and environments for ride-sourcing market, such as city size and population …
How (Not) To Find Bugs: The Interplay Between Merge Conflicts, Co-Changes, And Bugs, Luis Amaral, Marcos C. Oliveira, Welder Luz, José Fortes, Rodrigo Bonifacio, Daniel Alencar, Eduardo Monteiro, Gustavo Pinto, David Lo
How (Not) To Find Bugs: The Interplay Between Merge Conflicts, Co-Changes, And Bugs, Luis Amaral, Marcos C. Oliveira, Welder Luz, José Fortes, Rodrigo Bonifacio, Daniel Alencar, Eduardo Monteiro, Gustavo Pinto, David Lo
Research Collection School Of Computing and Information Systems
Context: In a seminal work, Ball et al. [1] investigate if the information available in version control systems could be used to predict defect density, arguing that practitioners and researchers could better understand errors "if [our] version control system could talk". In the meanwhile, several research works have reported that conflict merge resolution is a time consuming and error-prone task, while other contributions diverge about the correlation between co-change dependencies and defect density. Problem: The correlation between conflicting merge scenarios and bugs has not been addressed before, whilst the correlation between co-change dependencies and bug density has been only investigated …
An Empirical Study Of The Dependency Networks Of Deep Learning Libraries, Junxiao Han, Shuiguang Deng, David Lo, Chen Zhi, Jianwei Yin, Xin Xia
An Empirical Study Of The Dependency Networks Of Deep Learning Libraries, Junxiao Han, Shuiguang Deng, David Lo, Chen Zhi, Jianwei Yin, Xin Xia
Research Collection School Of Computing and Information Systems
Deep Learning techniques have been prevalent in various domains, and more and more open source projects in GitHub rely on deep learning libraries to implement their algorithms. To that end, they should always keep pace with the latest versions of deep learning libraries to make the best use of deep learning libraries. Aptly managing the versions of deep learning libraries can help projects avoid crashes or security issues caused by deep learning libraries. Unfortunately, very few studies have been done on the dependency networks of deep learning libraries. In this paper, we take the first step to perform an exploratory …
Marble: Model-Based Robustness Analysis Of Stateful Deep Learning Systems, Xiaoning Du, Yi Li, Xiaofei Xie, Lei Ma, Yang Liu, Jianjun Zhao
Marble: Model-Based Robustness Analysis Of Stateful Deep Learning Systems, Xiaoning Du, Yi Li, Xiaofei Xie, Lei Ma, Yang Liu, Jianjun Zhao
Research Collection School Of Computing and Information Systems
State-of-the-art deep learning (DL) systems are vulnerable to adversarial examples, which hinders their potential adoption in safetyand security-critical scenarios. While some recent progress has been made in analyzing the robustness of feed-forward neural networks, the robustness analysis for stateful DL systems, such as recurrent neural networks (RNNs), still remains largely uncharted. In this paper, we propose Marble, a model-based approach for quantitative robustness analysis of real-world RNN-based DL systems. Marble builds a probabilistic model to compactly characterize the robustness of RNNs through abstraction. Furthermore, we propose an iterative refinement algorithm to derive a precise abstraction, which enables accurate quantification of …
The Gap Of Semantic Parsing: A Survey On Automatic Math Word Problem Solvers, Dongxiang Zhang, Lei Wang, Luming Zhang, Bing Tian Dai, Heng Tao Shen
The Gap Of Semantic Parsing: A Survey On Automatic Math Word Problem Solvers, Dongxiang Zhang, Lei Wang, Luming Zhang, Bing Tian Dai, Heng Tao Shen
Research Collection School Of Computing and Information Systems
Solving mathematical word problems (MWPs) automatically is challenging, primarily due to the semantic gap between human-readable words and machine-understandable logics. Despite the long history dated back to the 1960s, MWPs have regained intensive attention in the past few years with the advancement of Artificial Intelligence (AI). Solving MWPs successfully is considered as a milestone towards general AI. Many systems have claimed promising results in self-crafted and small-scale datasets. However, when applied on large and diverse datasets, none of the proposed methods in the literature achieves high precision, revealing that current MWP solvers still have much room for improvement. This motivated …
Weakly Paired Multi-Domain Image Translation, M.Y. Zhang, Zhiwu Huang, D.P. Paudel, J. Thoma, Gool L. Van
Weakly Paired Multi-Domain Image Translation, M.Y. Zhang, Zhiwu Huang, D.P. Paudel, J. Thoma, Gool L. Van
Research Collection School Of Computing and Information Systems
In this paper, we aim at studying the new problem of weakly paired multi-domain image translation. To this end, we collect a dataset that contains weakly paired images from multiple domains. Two images are considered to be weakly paired if they are captured from nearby locations and share an overlapping field of view. These images are possibly captured by two asynchronous cameras—often resulting in images from separate domains, e.g. summer and winter. Major motivations for using weakly paired images are: (i) performance improvement towards that of paired data; (ii) cheap labels and abundant data availability. For the first time in …