Computer Sciences Commons^™

Tracing The Twenty-Year Evolution Of Developing Ai For Eye Screening In Singapore: A Master Chronology Of Sidrp, Selena+ And Eyris, Steven M. Miller

Research Collection School Of Computing and Information Systems

This working paper is entirely comprised of a timeline table that begins in 2002 and runs through mid-2023. Across these two decades, this timeline traces the evolutionary development of the following:

• The early Singapore R&D efforts to apply software-based image analysis algorithms and methods to analyse eye retina images for diabetic retinopathy and other eye diseases. This was based on a collaboration between the Singapore Eye Research Institute (SERI) and its parent organization, the Singapore National Eye Centre (SNEC), with faculty from the School of Computing at National University of Singapore.
• The establishment and operation of the Singapore Integrated Diabetic …

Catching The Fast Payments Trend: Optimal Designs And Leadership Strategies Of Retail Payment And Settlement Systems, Zhiling Guo, Dan Ma

Research Collection School Of Computing and Information Systems

Recent financial technologies have enabled fast payments and are reshaping retail payment and settlement systems globally. We developed an analytical model to study the optimal design of a new retail payment system in terms of settlement speed and system capability under both bank and fintech firm heterogeneous participation incentives. We found that three types of payment systems emerge as equilibrium outcomes: batch retail (BR), expedited retail (ER), and real-time retail (RR) payment systems. Although the base value of the payment service positively affects both settlement speed and system capability, the expected liquidity cost negatively impacts settlement speed, and total transaction …

How Does Credit Risk Affect Cost Management Strategies? Evidence On The Initiation Of Credit Default Swap And Sticky Cost Behavior, Jing Dai, Nan Hu, Rong Huang, Yan Yan

Research Collection School Of Computing and Information Systems

In this paper, we examine the effect of credit defaults swaps (CDS) initiation on reference firms' cost management strategies. CDS contracts provide insurance protection for creditors, inducing a shift in bargaining power from borrowers to creditors and an excessive incidence of bankruptcy. Anticipating more intransigent creditors in debt renegotiations and higher bankruptcy risk, CDS firms are incentivized to mitigate risk through decreasing cost stickiness after CDS initiation, as cost stickiness lowers liquidity and triggers early covenant violations. We find that, on average, CDS initiation is associated with a decline in reference firms' cost stickiness. This association is more pronounced for …

Glocal Energy-Based Learning For Few-Shot Open-Set Recognition, Haoyu Wang, Guansong Pang, Peng Wang, Lei Zhang, Wei Wei, Yanning Zhang

Research Collection School Of Computing and Information Systems

Few-shot open-set recognition (FSOR) is a challenging task of great practical value. It aims to categorize a sample to one of the pre-defined, closed-set classes illustrated by few examples while being able to reject the sample from unknown classes. In this work, we approach the FSOR task by proposing a novel energy-based hybrid model. The model is composed of two branches, where a classification branch learns a metric to classify a sample to one of closedset classes and the energy branch explicitly estimates the open-set probability. To achieve holistic detection of openset samples, our model leverages both class-wise and pixelwise …

Class-Incremental Exemplar Compression For Class-Incremental Learning, Zilin Luo, Yaoyao Liu, Bernt Schiele, Qianru Sun

Research Collection School Of Computing and Information Systems

Exemplar-based class-incremental learning (CIL) finetunes the model with all samples of new classes but few-shot exemplars of old classes in each incremental phase, where the "few-shot" abides by the limited memory budget. In this paper, we break this "few-shot" limit based on a simple yet surprisingly effective idea: compressing exemplars by downsampling non-discriminative pixels and saving "many-shot" compressed exemplars in the memory. Without needing any manual annotation, we achieve this compression by generating 0-1 masks on discriminative pixels from class activation maps (CAM). We propose an adaptive mask generation model called class-incremental masking (CIM) to explicitly resolve two difficulties of …

Extracting Class Activation Maps From Non-Discriminative Features As Well, Zhaozheng Chen, Qianru Sun

Research Collection School Of Computing and Information Systems

Extracting class activation maps (CAM) from a classification model often results in poor coverage on foreground objects, i.e., only the discriminative region (e.g., the “head” of “sheep”) is recognized and the rest (e.g., the “leg” of “sheep”) mistakenly as background. The crux behind is that the weight of the classifier (used to compute CAM) captures only the discriminative features of objects. We tackle this by introducing a new computation method for CAM that explicitly captures non-discriminative features as well, thereby expanding CAM to cover whole objects. Specifically, we omit the last pooling layer of the classification model, and perform clustering …

Freestyle Layout-To-Image Synthesis, Han Xue, Zhiwu Huang, Qianru Sun, Li Song, Wenjun Zhang

Research Collection School Of Computing and Information Systems

Typical layout-to-image synthesis (LIS) models generate images for a close set of semantic classes, e.g., 182 common objects in COCO-Stuff. In this work, we explore the freestyle capability of the model, i.e., how far can it generate unseen semantics (e.g., classes, attributes, and styles) onto a given layout, and call the task Freestyle LIS (FLIS). Thanks to the development of large-scale pre-trained language-image models, a number of discriminative models (e.g., image classification and object detection) trained on limited base classes are empowered with the ability of unseen class prediction. Inspired by this, we opt to leverage large-scale pre-trained text-to-image diffusion …

3d Dental Biometrics: Transformer-Based Dental Arch Extraction And Matching, Zhiyuan Zhang, Zhong Xin

Research Collection School Of Computing and Information Systems

The dental arch is a significant anatomical feature that is crucial in assessing tooth arrangement and configuration and has a potential for human identification in biometrics and digital forensic dentistry. In a previous study, we proposed an auto pose-invariant arch feature extraction Radial Ray Algorithm (RRA) and a matching framework [1] based solely on 3D dental geometry. To enhance the identification accuracy and speed of our previous work, we propose in this study a transformer architecture that can extract dental keypoints by encoding both local and global features. The dental arch is then constructed through robust interpolation of the dental …

Improving Quantal Cognitive Hierarchy Model Through Iterative Population Learning, Yuhong Xu, Shih-Fen Cheng, Xinyu Chen

Research Collection School Of Computing and Information Systems

In this paper, we propose to enhance the state-of-the-art quantal cognitive hierarchy (QCH) model with iterative population learning (IPL) to estimate the empirical distribution of agents’ reasoning levels and fit human agents’ behavioral data. We apply our approach to a real-world dataset from the Swedish lowest unique positive integer (LUPI) game and show that our proposed approach outperforms the theoretical Poisson Nash equilibrium predictions and the QCH approach by 49.8% and 46.6% in Wasserstein distance respectively. Our approach also allows us to explicitly measure an agent’s reasoning level distribution, which is not previously possible.

Strategic Planning For Flexible Agent Availability In Large Taxi Fleets, Rajiv Ranjan Kumar, Pradeep Varakantham, Shih-Fen Cheng

Research Collection School Of Computing and Information Systems

In large scale multi-agent systems like taxi fleets, individual agents (taxi drivers) are self interested (maximizing their own profits) and this can introduce inefficiencies in the system. One such inefficiency is with regards to the "required" availability of taxis at different time periods during the day. Since a taxi driver can work for limited number of hours in a day (e.g., 8-10 hours in a city like Singapore), there is a need to optimize the specific hours, so as to maximize individual as well as social welfare. Technically, this corresponds to solving a large scale multi-stage selfish routing game with …

How To Resuscitate A Sick Vm In The Cloud, Xuhua Ding

Research Collection School Of Computing and Information Systems

A guest virtual machine in a cloud platform may fall “sick” when its kernel encounters a fatal low-level bug or is subverted by an adversary. The VM owner is hence likely to lose her control over it due to a kernel hang or being denied of remote accesses. While the VM can be rebooted with the assistance from the cloud server, the owner not only faces service disruption but also is left with no opportunity to make an in-depth diagnosis and forensics on the spot, not to mention a live rectification. Currently, the cloud service provider has neither incentive nor …

Semantic Scene Completion With Cleaner Self, Fengyun Wang, Dong Zhang, Hanwang Zhang, Jinhui Tang, Qianru Sun

Research Collection School Of Computing and Information Systems

Semantic Scene Completion (SSC) transforms an image of single-view depth and/or RGB 2D pixels into 3D voxels, each of whose semantic labels are predicted. SSC is a well-known ill-posed problem as the prediction model has to “imagine” what is behind the visible surface, which is usually represented by Truncated Signed Distance Function (TSDF). Due to the sensory imperfection of the depth camera, most existing methods based on the noisy TSDF estimated from depth values suffer from 1) incomplete volumetric predictions and 2) confused semantic labels. To this end, we use the ground-truth 3D voxels to generate a perfect visible surface, …

Unbiased Multiple Instance Learning For Weakly Supervised Video Anomaly Detection, Hui Lyu, Zhongqi Yue, Qianru Sun, Bin Luo, Zhen Cui, Hanwang Zhang

Research Collection School Of Computing and Information Systems

Weakly Supervised Video Anomaly Detection (WSVAD) is challenging because the binary anomaly label is only given on the video level, but the output requires snippet-level predictions. So, Multiple Instance Learning (MIL) is prevailing in WSVAD. However, MIL is notoriously known to suffer from many false alarms because the snippet-level detector is easily biased towards the abnormal snippets with simple context, confused by the normality with the same bias, and missing the anomaly with a different pattern. To this end, we propose a new MIL framework: Unbiased MIL (UMIL), to learn unbiased anomaly features that improve WSVAD. At each MIL training …

Livoauth: Liveness Detection In Voiceprint Authentication With Random Challenges And Detection Modes, Rui Zhang, Zheng Yan, Xueru Wang, Robert H. Deng

Research Collection School Of Computing and Information Systems

Voiceprint authentication provides great convenience to users in many application scenarios. However, it easily suffers from spoofing attacks including speech synthesis, speech conversion, and speech replay. Liveness detection is an effective way to resist these attacks. But existing methods suffer from many disadvantages, such as extra deployment costs due to precise data collection, environmental disturbance, high computational overhead, and operational complexity. A uniform platform that can offer voiceprint authentication as a service (VAaS) over the cloud is also lacked. Hence, it is imperative to design an economic and effective method for liveness detection in voiceprint authentication. In this article, we …

Evading Deepfake Detectors Via Adversarial Statistical Consistency, Yang Hou, Qing Guo, Yihao Huang, Xiaofei Xie, Lei Ma, Jianjun Zhao

Research Collection School Of Computing and Information Systems

In recent years, as various realistic face forgery techniques known as DeepFake improves by leaps and bounds, more and more DeepFake detection techniques have been proposed. These methods typically rely on detecting statistical differences between natural (i.e., real) and DeepFake-generated images in both spatial and frequency domains. In this work, we propose to explicitly minimize the statistical differences to evade state-of-the-art DeepFake detectors. To this end, we propose a statistical consistency attack (StatAttack) against DeepFake detectors, which contains two main parts. First, we select several statistical-sensitive natural degradations (i.e., exposure, blur, and noise) and add them to the fake images …

The Bemi Stardust: A Structured Ensemble Of Binarized Neural Networks, Ambrogio Maria Bernardelli, Stefano Gualandi, Hoong Chuin Lau, Simone Milanesi

Research Collection School Of Computing and Information Systems

Binarized Neural Networks (BNNs) are receiving increasing attention due to their lightweight architecture and ability to run on low-power devices, given the fact that they can be implemented using Boolean operations. The state-of-the-art for training classification BNNs restricted to few-shot learning is based on a Mixed Integer Programming (MIP) approach. This paper proposes the BeMi ensemble, a structured architecture of classification-designed BNNs based on training a single BNN for each possible pair of classes and applying a majority voting scheme to predict the final output. The training of a single BNN discriminating between two classes is achieved by a MIP …

Knowledge Compilation For Constrained Combinatorial Action Spaces In Reinforcement Learning, Jiajing Ling, Moritz Lukas Schuler, Akshat Kumar, Pradeep Varakantham

Research Collection School Of Computing and Information Systems

Action-constrained reinforcement learning (ACRL), where any action taken in a state must satisfy given constraints, has several practical applications such as resource allocation in supply-demand matching, and path planning among others. A key challenge is to enforce constraints when the action space is discrete and combinatorial. To address this, first, we assume an action is represented using propositional variables, and action constraints are represented using Boolean functions. Second, we compactly encode the set of all valid actions that satisfy action constraints using a probabilistic sentential decision diagram (PSDD), a recently proposed knowledge compilation framework. Parameters of the PSDD compactly encode …

Enhancing Third-Party Software Reliability Through Bug Bounty Programs, Tianlu Zhou, Dan Ma, Nan Feng

Research Collection School Of Computing and Information Systems

Bug Bounty Programs (BBPs) reward external hackers for identifying and reporting software vulnerabilities. As the number of security issues caused by third-party applications has been significantly increased recently, many digital platforms are considering launching BBPs to help enhance the reliability of third-party software. BBPs bring benefits to the platform and vendors, meanwhile impose additional costs on them as well. As a result, the overall impact of using BBP is unclear. In this paper, we present an analytical model to examine the strategic decisions of launching and participating in a BBP for the platform and the third-party vendor, respectively. We find …

Gnnlens: A Visual Analytics Approach For Prediction Error Diagnosis Of Graph Neural Networks., Zhihua Jin, Yong Wang, Qianwen Wang, Yao Ming, Tengfei Ma, Huamin Qu

Research Collection School Of Computing and Information Systems

Graph Neural Networks (GNNs) aim to extend deep learning techniques to graph data and have achieved significant progress in graph analysis tasks (e.g., node classification) in recent years. However, similar to other deep neural networks like Convolutional Neural Networks (CNNs) and Recurrent Neural Networks (RNNs), GNNs behave like a black box with their details hidden from model developers and users. It is therefore difficult to diagnose possible errors of GNNs. Despite many visual analytics studies being done on CNNs and RNNs, little research has addressed the challenges for GNNs. This paper fills the research gap with an interactive visual analysis …

Invalidator: Automated Patch Correctness Assessment Via Semantic And Syntactic Reasoning, Tranh Le-Cong, Duc Minh Luong, Xuan Bach D. Le, David Lo, Nhat-Hoa Tran, Bui Quang-Huy, Quyet-Thang Huynh

Research Collection School Of Computing and Information Systems

Automated program repair (APR) has been gaining ground recently. However, a significant challenge that still remains is test overfitting, in which APR-generated patches plausibly pass the validation test suite but fail to generalize. A common practice to assess the correctness of APR-generated patches is to judge whether they are equivalent to ground truth, i.e., developer-written patches, by either generating additional test cases or employing human manual inspections. The former often requires the generation of at least one test that shows behavioral differences between the APR-patched and developer-patched programs. Searching for this test, however, can be difficult as the search space …

Venus: A Geometrical Representation For Quantum State Visualization, Shaolun Ruan, Ribo Yuan, Qiang Guan, Yanna Lin, Ying Mao, Weiwen Jiang, Zhepeng Wang, Wei Xu, Yong Wang

Research Collection School Of Computing and Information Systems

Visualizations have played a crucial role in helping quantum computing users explore quantum states in various quantum computing applications. Among them, Bloch Sphere is the widely-used visualization for showing quantum states, which leverages angles to represent quantum amplitudes. However, it cannot support the visualization of quantum entanglement and superposition, the two essential properties of quantum computing. To address this issue, we propose VENUS, a novel visualization for quantum state representation. By explicitly correlating 2D geometric shapes based on the math foundation of quantum computing characteristics, VENUS effectively represents quantum amplitudes of both the single qubit and two qubits for quantum …

Privacy-Preserving Ranked Spatial Keyword Query In Mobile Cloud-Assisted Fog Computing, Qiuyun Tong, Yinbin Li Miao, Ximeng Liu, Robert H. Deng, Robert H. Deng

Research Collection School Of Computing and Information Systems

With the increasing popularity of GPS-equipped mobile devices in cloud-assisted fog computing scenarios, massive spatio-textual data is generated and outsourced to cloud servers for storage and analysis. Existing privacy-preserving range query or ranked keyword search schemes does not support a unified index, and are just applicable for the symmetric environment where all users sharing the same secret key. To solve this issue, we propose a Privacy-preserving Ranked Spatial keyword Query in mobile cloud-assisted Fog computing (PRSQ-F). Specifically, we design a novel comparable product encoding strategy that combines both spatial and textual conditions tightly to retrieve the objects in query range …

Compositional Prompt Tuning With Motion Cues For Open-Vocabulary Video Relation Detection, Kaifeng Gao, Long Chen, Hanwang Zhang, Jun Xiao, Qianru Sun

Research Collection School Of Computing and Information Systems

Prompt tuning with large-scale pretrained vision-language models empowers open-vocabulary prediction trained on limited base categories, e.g., object classification and detection. In this paper, we propose compositional prompt tuning with motion cues: an extended prompt tuning paradigm for compositional predictions of video data. In particular, we present Relation Prompt (RePro) for Open-vocabulary Video Visual Relation Detection (Open-VidVRD), where conventional prompt tuning is easily biased to certain subject-object combinations and motion patterns. To this end, RePro addresses the two technical challenges of Open-VidVRD: 1) the prompt tokens should respect the two different semantic roles of subject and object, and 2) the tuning …

Neural Episodic Control With State Abstraction, Zhuo Li, Derui Zhu, Yujing Hu, Xiaofei Xie, Lei Ma, Yan Zheng, Yan Song, Yingfeng Chen, Jianjun Zhao

Research Collection School Of Computing and Information Systems

Existing Deep Reinforcement Learning (DRL) algorithms suffer from sample inefficiency.Generally, episodic control-based approaches are solutions that leveragehighly-rewarded past experiences to improve sample efficiency of DRL algorithms.However, previous episodic control-based approaches fail to utilize the latentinformation from the historical behaviors (e.g., state transitions, topological similarities,etc.) and lack scalability during DRL training. This work introducesNeural Episodic Control with State Abstraction (NECSA), a simple but effectivestate abstraction-based episodic control containing a more comprehensive episodicmemory, a novel state evaluation, and a multi-step state analysis. We evaluate ourapproach to the MuJoCo and Atari tasks in OpenAI gym domains. The experimentalresults indicate that NECSA achieves higher …

Diffseer: Difference-Based Dynamic Weighted Graph Visualization, Xiaolin Wen, Yong Wang, Meixuan Wu, Fengjie Wang, Xuanwu Yue, Qiaomu Shen, Yuxin Ma, Min Zhu

Research Collection School Of Computing and Information Systems

Existing dynamic weighted graph visualization approaches rely on users’ mental comparison to perceive temporal evolution of dynamic weighted graphs, hindering users from effectively analyzing changes across multiple timeslices. We propose DiffSeer, a novel approach for dynamic weighted graph visualization by explicitly visualizing the differences of graph structures (e.g., edge weight differences) between adjacent timeslices. Specifically, we present a novel nested matrix design that overviews the graph structure differences over a time period as well as shows graph structure details in the timeslices of user interest. By collectively considering the overall temporal evolution and structure details in each timeslice, an optimization-based …

Ncq: Code Reuse Support For Node.Js Developers, Brittany Reid, Marcelo D'Amorim, Markus Wagner, Christoph Treude

Research Collection School Of Computing and Information Systems

Code reuse is an important part of software development. The adoption of code reuse practices is especially common among Node.js developers. The Node.js package manager, NPM, indexes over 1 Million packages and developers often seek out packages to solve programming tasks. Due to the vast number of packages, selecting the right package is difficult and time consuming. With the goal of improving productivity of developers that heavily reuse code through third-party packages, we present Node Code Query (NCQ), a Read-Eval-Print-Loop environment that allows developers to 1) search for NPM packages using natural language queries, 2) search for code snippets related …

Two Sides Of The Same Coin: Exploiting The Impact Of Identifiers In Neural Code Comprehension, Shuzheng Gao, Cuiyun Gao, Chaozheng Wang, Jun Sun, David Lo, Yue Yu

Research Collection School Of Computing and Information Systems

Previous studies have demonstrated that neural code comprehension models are vulnerable to identifier naming. By renaming as few as one identifier in the source code, the models would output completely irrelevant results, indicating that identifiers can be misleading for model prediction. However, identifiers are not completely detrimental to code comprehension, since the semantics of identifier names can be related to the program semantics. Well exploiting the two opposite impacts of identifiers is essential for enhancing the robustness and accuracy of neural code comprehension, and still remains under-explored. In this work, we propose to model the impact of identifiers from a …

What Do Users Ask In Open-Source Ai Repositories? An Empirical Study Of Github Issues, Zhou Yang, Chenyu Wang, Jieke Shi, Thong Hoang, Pavneet Singh Kochhar, Qinghua Lu, Zhenchang Xing, David Lo

Research Collection School Of Computing and Information Systems

Artificial Intelligence (AI) systems, which benefit from the availability of large-scale datasets and increasing computational power, have become effective solutions to various critical tasks, such as natural language understanding, speech recognition, and image processing. The advancement of these AI systems is inseparable from open-source software (OSS). Specifically, many benchmarks, implementations, and frameworks for constructing AI systems are made open source and accessible to the public, allowing researchers and practitioners to reproduce the reported results and broaden the application of AI systems. The development of AI systems follows a data-driven paradigm and is sensitive to hyperparameter settings and data separation. Developers …

Win: Weight-Decay-Integrated Nesterov Acceleration For Adaptive Gradient Algorithms, Pan Zhou, Xingyu Xie, Shuicheng Yan

Research Collection School Of Computing and Information Systems

Training deep networks on large-scale datasets is computationally challenging. In this work, we explore the problem of “how to accelerate adaptive gradient algorithms in a general manner”, and aim to provide practical efficiency-boosting insights. To this end, we propose an effective and general Weight-decay-Integrated Nesterov acceleration (Win) to accelerate adaptive algorithms. Taking AdamW and Adam as examples, we minimize a dynamical loss per iteration which combines the vanilla training loss and a dynamic regularizer inspired by proximal point method (PPM) to improve the convexity of the problem. To introduce Nesterov-alike-acceleration into AdamW and Adam, we respectively use the first- and …

Mando-Hgt: Heterogeneous Graph Transformers For Smart Contract Vulnerability Detection, Huu Hoang Nguyen, Nhat Minh Nguyen, Chunyao Xie, Zahra Ahmadi, Daniel Kudendo, Thanh-Nam Doan, Lingxiao Jiang

Research Collection School Of Computing and Information Systems

Smart contracts in blockchains have been increasingly used for high-value business applications. It is essential to check smart contracts' reliability before and after deployment. Although various program analysis and deep learning techniques have been proposed to detect vulnerabilities in either Ethereum smart contract source code or bytecode, their detection accuracy and scalability are still limited. This paper presents a novel framework named MANDO-HGT for detecting smart contract vulnerabilities. Given Ethereum smart contracts, either in source code or bytecode form, and vulnerable or clean, MANDO-HGT custom-builds heterogeneous contract graphs (HCGs) to represent control-flow and/or function-call information of the code. It then …