Physical Sciences and Mathematics Commons^™

Which Variables Should I Log?, Zhongxin Liu, Xin Xia, David Lo, Zhenchang Xing, Ahmed E. Hassan, Shanping Li

Research Collection School Of Computing and Information Systems

Developers usually depend on inserting logging statements into the source code to collect system runtime information. Such logged information is valuable for software maintenance. A logging statement usually prints one or more variables to record vital system status. However, due to the lack of rigorous logging guidance and the requirement of domain-specific knowledge, it is not easy for developers to make proper decisions about which variables to log. To address this need, in this work, we propose an approach to recommend logging variables for developers during development by learning from existing logging statements. Different from other prediction tasks in software …

Injecting Descriptive Meta-Information Into Pre-Trained Language Models With Hypernetworks, Wenying Duan, Xiaoxi He, Zimu Zhou, Hong Rao, Lothar Thiele

Research Collection School Of Computing and Information Systems

Pre-trained language models have been widely adopted as backbones in various natural language processing tasks. However, existing pre-trained language models ignore the descriptive meta-information in the text such as the distinction between the title and the mainbody, leading to over-weighted attention to insignificant text. In this paper, we propose a hypernetwork-based architecture to model the descriptive meta-information and integrate it into pre-trained language models. Evaluations on three natural language processing tasks show that our method notably improves the performance of pre-trained language models and achieves the state-of-the-art results on keyphrase extraction.

Automatic Fairness Testing Of Neural Classifiers Through Adversarial Sampling, Peixin Zhang, Jingyi Wang, Jun Sun, Xinyu Wang, Guoliang Dong, Xinggen Wang, Ting Dai, Jinsong Dong

Research Collection School Of Computing and Information Systems

Although deep learning has demonstrated astonishing performance in many applications, there are still concerns about its dependability. One desirable property of deep learning applications with societal impact is fairness (i.e., non-discrimination). Unfortunately, discrimination might be intrinsically embedded into the models due to the discrimination in the training data. As a countermeasure, fairness testing systemically identifies discriminatory samples, which can be used to retrain the model and improve the model’s fairness. Existing fairness testing approaches however have two major limitations. Firstly, they only work well on traditional machine learning models and have poor performance (e.g., effectiveness and efficiency) on deep learning …

Robust And Ethical Data Governance Critical To Growth In Digital Age, Themin Suwardy, Melvin Yong

Research Collection School Of Accountancy

With increasing digitalisation, and companies collecting an ever-increasing amount of their customer and business data, organisations have to become more accountable to stakeholders such as regulators, customers and investors on the issue of data. Observers say expectations are also increasing, with incidents of data breaches capturing much media attention. Just as corporate governance encompasses more than just compliance, experts say data governance is more than just data protection and security but also about creating value.

Holistic Prediction For Public Transport Crowd Flows: A Spatio Dynamic Graph Network Approach, Bingjie He, Shukai Li, Chen Zhang, Baihua Zheng, Fugee Tsung

Research Collection School Of Computing and Information Systems

This paper targets at predicting public transport in-out crowd flows of different regions together with transit flows between them in a city. The main challenge is the complex dynamic spatial correlation of crowd flows of different regions and origin-destination (OD) paths. Different from road traffic flows whose spatial correlations mainly depend on geographical distance, public transport crowd flows significantly relate to the region’s functionality and connectivity in the public transport network. Furthermore, influenced by commuters’ time-varying travel patterns, the spatial correlations change over time. Though there exist many works focusing on either predicting in-out flows or OD transit flows of …

Artificial Intelligence And Work: Two Perspectives, Steven Miller, Thomas H. Davenport

Research Collection School Of Computing and Information Systems

One of the most important issues in contemporary societies is the impact of intelligent technologies on human work. For an empirical perspective on the issue, we recently completed 30 case studies of people collaborating with AI-enabled smart machines. Twenty-four were from North America, mostly in the US. Six were from Southeast Asia, mostly in Singapore. We compare some of our observations to one of the broadest academic examinations of the issue. In particular, we focus on our case study observations with regard to key findings from the MIT Task Force on the Work of the Future report.

A Learning And Optimization Framework For Collaborative Urban Delivery Problems With Alliances, Jingfeng Yang, Hoong Chuin Lau

Research Collection School Of Computing and Information Systems

The emergence of e-Commerce imposes a tremendous strain on urban logistics which in turn raises concerns on environmental sustainability if not performed efficiently. While large logistics service providers (LSPs) can perform fulfillment sustainably as they operate extensive logistic networks, last-mile logistics are typically performed by small LSPs who need to form alliances to reduce delivery costs and improve efficiency, and to compete with large players. In this paper, we consider a multi-alliance multi-depot pickup and delivery problem with time windows (MAD-PDPTW) and formulate it as a mixed-integer programming (MIP) model. To cope with large-scale problem instances, we propose a two-stage …

Semi-Supervised Semantic Visualization For Networked Documents, Delvin Ce Zhang, Hady W. Lauw

Research Collection School Of Computing and Information Systems

Semantic interpretability and visual expressivity are important objectives in exploratory analysis of text. On the one hand, while some documents may have explicit categories, we could develop a better understanding of a corpus by studying its finer-grained structures, which may be latent. By inferring latent topics and discovering keywords associated with each topic, one obtains a semantic interpretation of the corpus. One the other hand, by visualizing documents, latent topics, and category labels on the same plot, one gains a bird’s eye view of the relationships among documents, topics, and various categories. Semantic visualization is a class of methods that …

Adversarial Attacks And Mitigation For Anomaly Detectors Of Cyber-Physical Systems, Yifan Jia, Jingyi Wang, Christopher M. Poskitt, Sudipta Chattopadhyay, Jun Sun, Yuqi Chen

Research Collection School Of Computing and Information Systems

The threats faced by cyber-physical systems (CPSs) in critical infrastructure have motivated research into a multitude of attack detection mechanisms, including anomaly detectors based on neural network models. The effectiveness of anomaly detectors can be assessed by subjecting them to test suites of attacks, but less consideration has been given to adversarial attackers that craft noise specifically designed to deceive them. While successfully applied in domains such as images and audio, adversarial attacks are much harder to implement in CPSs due to the presence of other built-in defence mechanisms such as rule checkers (or invariant checkers). In this work, we …

Redesigning Patient Flow In Paediatric Eye Clinic For Pandemic Using Simulation, Kar Way Tan, Bee Keow Goh, Aldy Gunawan

Research Collection School Of Computing and Information Systems

This study proposes a systematic approach to the construction of a simulation model to support decision-making concerning the capacity limit and staffing configurations at the paediatric eye clinic in Singapore under the COVID-19 pandemic situation. During the pandemic, the clinic must ensure that the operations are aligned to the safe-distancing regulations put in place by the Ministry of Health while coping with the demand. We developed simulation models to examine the ‘asis’ process and proposed numerous ‘to-be’ processes for new clinic configurations to operate under the pandemic conditions. We combined scenario-thinking and simulation optimization to determine the additional manpower and …

Routing Policy Choice Prediction In A Stochastic Network: Recursive Model And Solution Algorithm, Tien Mai, Xinlian Yu, Song Gao, Emma Frejinger

Research Collection School Of Computing and Information Systems

We propose a Recursive Logit (STD-RL) model for routing policy choice in a stochastic time-dependent (STD) network, where a routing policy is a mapping from states to actions on which link to take next, and a state is defined by node, time and information. A routing policy encapsulates travelers’ adaptation to revealed traffic conditions when making route choices. The STD-RL model circumvents choice set generation, a procedure with known issues related to estimation and prediction. In a given state, travelers make their link choice maximizing the sum of the utility of the outgoing link and the expected maximum utility until …

Characterization And Automatic Updates Of Deprecated Machine-Learning Api Usages, Stefanus Agus Haryono, Thung Ferdian, David Lo, Julia Lawall, Lingxiao Jiang

Research Collection School Of Computing and Information Systems

Due to the rise of AI applications, machine learning (ML) libraries, often written in Python, have become far more accessible. ML libraries tend to be updated periodically, which may deprecate existing APIs, making it necessary for application developers to update their usages. In this paper, we build a tool to automate deprecated API usage updates. We first present an empirical study to better understand how updates of deprecated ML API usages in Python can be done. The study involves a dataset of 112 deprecated APIs from Scikit-Learn, TensorFlow, and PyTorch. Guided by the findings of our empirical study, we propose …

Biasheal: On-The-Fly Black-Box Healing Of Bias In Sentiment Analysis Systems, Zhou Yang, Harshit Jain, Jieke Shi, Muhammad Hilmi Asyrofi, David Lo

Research Collection School Of Computing and Information Systems

Although Sentiment Analysis (SA) is widely applied in many domains, existing research has revealed that the unfairness in SA systems can be harmful to the welfare of less privileged people. Several works propose pre-processing and in-processing methods to eliminate bias in SA systems, but little attention is paid to utilizing post-processing methods to heal bias. Postprocessing methods are particularly important for systems that use third-party SA services. Systems that use such services have no access to the SA engine or its training data and thus cannot apply pre-processing nor in-processing methods. Therefore, this paper proposes a black-box post-processing method to …

Dynamic Heterogeneous Graph Embedding Via Heterogeneous Hawkes Process, Yugang Ji, Tianrui Jia, Yuan Fang, Chuan Shi

Research Collection School Of Computing and Information Systems

Graph embedding, aiming to learn low-dimensional representations of nodes while preserving valuable structure information, has played a key role in graph analysis and inference. However, most existing methods deal with static homogeneous topologies, while graphs in real-world scenarios are gradually generated with different-typed temporal events, containing abundant semantics and dynamics. Limited work has been done for embedding dynamic heterogeneous graphs since it is very challenging to model the complete formation process of heterogeneous events. In this paper, we propose a novel Heterogeneous Hawkes Process based dynamic Graph Embedding (HPGE) to handle this problem. HPGE effectively integrates the Hawkes process into …

Orthogonal Inductive Matrix Completion, Antoine Ledent, Rrodrigo Alves, Marius Kloft

Research Collection School Of Computing and Information Systems

We propose orthogonal inductive matrix completion (OMIC), an interpretable approach to matrix completion based on a sum of multiple orthonormal side information terms, together with nuclear-norm regularization. The approach allows us to inject prior knowledge about the singular vectors of the ground-truth matrix. We optimize the approach by a provably converging algorithm, which optimizes all components of the model simultaneously. We study the generalization capabilities of our method in both the distribution-free setting and in the case where the sampling distribution admits uniform marginals, yielding learning guarantees that improve with the quality of the injected knowledge in both cases. As …

The Empathetic Car: Exploring Emotion Inference Via Driver Behaviour And Traffic Context, Shu Liu, Kevin Koch, Zimu Zhou, Simon Foll, Xiaoxi He, Tina Menke, Elgar Fleisch, Felix Wortmann

Research Collection School Of Computing and Information Systems

An empathetic car that is capable of reading the driver’s emotions has been envisioned by many car manufacturers. Emotion inference enables in-vehicle applications to improve driver comfort, well-being, and safety. Available emotion inference approaches use physiological, facial, and speech-related data to infer emotions during driving trips. However, existing solutions have two major limitations: Relying on sensors that are not built into the vehicle restricts emotion inference to those people leveraging corresponding devices (e.g., smartwatches). Relying on modalities such as facial expressions and speech raises privacy concerns. By contrast, researchers in mobile health have been able to infer affective states (e.g., …

Precision Public Health Campaign: Delivering Persuasive Messages To Relevant Segments Through Targeted Advertisements On Social Media, Jisun An, Haewoon Kwak, Hanya M. Qureshi, Ingmar Weber

Research Collection School Of Computing and Information Systems

Although established marketing techniques have been applied to design more effective health campaigns, more often than not, the same message is broadcasted to large populations, irrespective of unique characteristics. As individual digital device use has increased, so have individual digital footprints, creating potential opportunities for targeted digital health interventions. We propose a novel precision public health campaign framework to structure and standardize the process of designing and delivering tailored health messages to target particular population segments using social media–targeted advertising tools. Our framework consists of five stages: defining a campaign goal, priority audience, and evaluation metrics; splitting the target audience …

Secure Self-Checkout Kiosks Using Alma Api With Two-Factor Authentication, Ron Bulaon

Research Collection Library

Self-checkout kiosks have become a staple feature of many modern and digitized libraries. These devices are used by library patrons for self-service item loans. Most implementations are not new, in fact many of these systems are simple, straight forward and work as intended. But behind this useful technology, there is a security concern on authentication that has to be addressed.

In my proposed presentation, I will discuss the risk factors of self-checkout kiosks and propose a solution using Alma APIs. I will address the technical shortcomings of the current implementations, compared to the proposed solution, and where the weakest link …

Up Close And Personal With Mr Sundar Selvam: Hitting Zero Targets, Sundar Selvam

Oral History Collection

He might not be one you would have come across on campus. And not one you might read much about in SMU news or in the limelight for its achievements, preferring to remain in the background. But look around the SMU campus and you will see the fruits of his work and that of his team. Meet Sundar, SMU’s Vice-President for Campus Infrastructure and Services. Since January 2015, he has been at the forefront of driving SMU’s own sustainability journey which has resulted in several “firsts”. This interview was published in the August edition of SMU CIRCLE.

Type And Interval Aware Array Constraint Solving For Symbolic Execution, Ziqi Shuai, Zhenbang Chen, Yufeng Zhang, Jun Sun, Ji Wang

Research Collection School Of Computing and Information Systems

Array constraints are prevalent in analyzing a program with symbolic execution. Solving array constraints is challenging due to the complexity of the precise encoding for arrays. In this work, we propose to synergize symbolic execution and array constraint solving. Our method addresses the difficulties in solving array constraints with novel ideas. First, we propose a lightweight method for pre-checking the unsatisfiability of array constraints based on integer linear programming. Second, observing that encoding arrays at the byte-level introduces many redundant axioms that reduce the effectiveness of constraint solving, we propose type and interval aware axiom generation. Note that the type …

A Survey On Ml4vis: Applying Machine Learning Advances To Data Visualization, Qianwen Wang, Zhutian Chen, Yong Wang, Huamin Qu

Research Collection School Of Computing and Information Systems

Inspired by the great success of machine learning (ML), researchers have applied ML techniques to visualizations to achieve a better design, development, and evaluation of visualizations. This branch of studies, known as ML4VIS, is gaining increasing research attention in recent years. To successfully adapt ML techniques for visualizations, a structured understanding of the integration of ML4VIS is needed. In this article, we systematically survey 88 ML4VIS studies, aiming to answer two motivating questions: “what visualization processes can be assisted by ML?” and “how ML techniques can be used to solve visualization problems? ” This survey reveals seven main processes where …

Learning And Exploiting Shaped Reward Models For Large Scale Multiagent Rl, Arambam James Singh, Akshat Kumar, Hoong Chuin Lau

Research Collection School Of Computing and Information Systems

Many real world systems involve interaction among large number of agents to achieve a common goal, for example, air traffic control. Several model-free RL algorithms have been proposed for such settings. A key limitation is that the empirical reward signal in model-free case is not very effective in addressing the multiagent credit assignment problem, which determines an agent's contribution to the team's success. This results in lower solution quality and high sample complexity. To address this, we contribute (a) an approach to learn a differentiable reward model for both continuous and discrete action setting by exploiting the collective nature of …

The Role Of Trust In Advice Acceptance From Non-Human Actors, Rahul Banerjee

Dissertations and Theses Collection (Open Access)

Advancements in technology are now allowing non-human actors in the form of robot-advisors, driverless cars, medical assistants to perform increasingly complex tasks. While technological change is as old as civilization, these non-human actors can do novel tasks. One such task is that they provide advice which is a credence service (Dulleck, & Kerschbamer, 2006). Using a financial services context this thesis studies the role trust plays in advice acceptance.

Robo-advisors are rapidly replacing human financial advisors as the agent-provider for portfolio investment services. For centuries, it was the banker (human financial advisor) who was responsible for providing his investors with …

Credit Assignment In Multiagent Reinforcement Learning For Large Agent Population, Arambam James Singh

Dissertations and Theses Collection (Open Access)

In the current age, rapid growth in sectors like finance, transportation etc., involve fast digitization of industrial processes. This creates a huge opportunity for next-generation artificial intelligence system with multiple agents operating at scale. Multiagent reinforcement learning (MARL) is the field of study that addresses problems in the multiagent systems. In this thesis, we develop and evaluate novel MARL methodologies that address the challenges in large scale multiagent system with cooperative setting. One of the key challenge in cooperative MARL is the problem of credit assignment. Many of the previous approaches to the problem relies on agent's individual trajectory which …

Learning To Interpret Knowledge From Software Q&A Sites, Bowen Xu

Dissertations and Theses Collection (Open Access)

Nowadays, software question and answer (SQA) data has become a treasure for software engineering as it contains a huge volume of programming knowledge. That knowledge can be interpreted in many different ways to support various software activities, such as code recommendation, program repair, and so on. In this dissertation, we interpret SQA data by addressing three novel research problems.

The first research problem is about linkable knowledge unit prediction. In this problem, a question and its answers within a post in Stack Overflow are considered as a knowledge unit (KU). KUs often contain semantically relevant knowledge, and thus linkable for …

Invertible Grayscale With Sparsity Enforcing Priors, Yong Du, Yangyang Xu, Taizhong Ye, Qiang Wen, Chufeng Xiao, Junyu Dong, Guoqiang Han, Shengfeng He

Research Collection School Of Computing and Information Systems

Color dimensionality reduction is believed as a non-invertible process, as re-colorization results in perceptually noticeable and unrecoverable distortion. In this article, we propose to convert a color image into a grayscale image that can fully recover its original colors, and more importantly, the encoded information is discriminative and sparse, which saves storage capacity. Particularly, we design an invertible deep neural network for color encoding and decoding purposes. This network learns to generate a residual image that encodes color information, and it is then combined with a base grayscale image for color recovering. In this way, the non-differentiable compression process (e.g., …

An Improved Learnable Evolution Model For Solving Multi-Objective Vehicle Routing Problem With Stochastic Demand, Yunyun Niu, Detian Kong, Rong Wen, Zhiguang Cao, Jianhua Xiao

Research Collection School Of Computing and Information Systems

The multi-objective vehicle routing problem with stochastic demand (MO-VRPSD) is much harder to tackle than other traditional vehicle routing problems (VRPs), due to the uncertainty in customer demands and potentially conflicted objectives. In this paper, we present an improved multi-objective learnable evolution model (IMOLEM) to solve MO-VRPSD with three objectives of travel distance, driver remuneration and number of vehicles. In our method, a machine learning algorithm, i.e., decision tree, is exploited to help find and guide the desirable direction of evolution process. To cope with the key issue of "route failure" caused due to stochastic customer demands, we propose a …

Gp3: Gaussian Process Path Planning For Reliable Shortest Path In Transportation Networks, Hongliang Guo, Xuejie Hou, Zhiguang Cao, Jie Zhang

Research Collection School Of Computing and Information Systems

This paper investigates the reliable shortest path (RSP) problem in Gaussian process (GP) regulated transportation networks. Specifically, the RSP problem that we are targeting at is to minimize the (weighted) linear combination of mean and standard deviation of the path's travel time. With the reasonable assumption that the travel times of the underlying transportation network follow a multi-variate Gaussian distribution, we propose a Gaussian process path planning (GP3) algorithm to calculate the a priori optimal path as the RSP solution. With a series of equivalent RSP problem transformations, we are able to reach a polynomial time complexity algorithm with guaranteed …

Linear Algebra For Computer Science, M. Thulasidas

Research Collection School Of Computing and Information Systems

This book has its origin in my experience teaching Linear Algebra to Computer Science students at Singapore Management University. Traditionally, Linear Algebra is taught as a pure mathematics course, almost as an afterthought, not fully integrated with any other applied curriculum. It certainly was taught that way to me. The course I was teaching, however, had a definite pedagogical objective of bringing out the applicability and the usefulness of Linear Algebra in Computer Science, which is nothing but applied mathematics. In today’s age of machine learning and artificial intelligence, Linear Algebra is the branch of mathematics that holds the most …

Pruning-Aware Merging For Efficient Multitask Inference, Dawei Gao, Xiaoxi He, Zimu Zhou, Yongxin Tong, Lothar Thiele

Research Collection School Of Computing and Information Systems

Many mobile applications demand selective execution of multiple correlated deep learning inference tasks on resource-constrained platforms. Given a set of deep neural networks, each pre-trained for a single task, it is desired that executing arbitrary combinations of tasks yields minimal computation cost. Pruning each network separately yields suboptimal computation cost due to task relatedness. A promising remedy is to merge the networks into a multitask network to eliminate redundancy across tasks before network pruning. However, pruning a multitask network combined by existing network merging schemes cannot minimise the computation cost of every task combination because they do not consider such …