Physical Sciences and Mathematics Commons^™

Facevalue: Exploring Real-Time Self-View Overlays To Prompt Meaning-Oriented Self-Awareness In Remote Meetings, Gun Woo (Warren) Park, Anthony Tang, Fanny Chevalier

Research Collection School Of Computing and Information Systems

In remote video meetings, visual non-verbal cues, such as facial expressions or head movements, are seen continuously but often only partially. This increases ambiguity compared to in-person settings and can cause misinterpretation or misalignment between intended and perceived meaning. Motivated by communication theories, we designed FaceValue, a technology probe that augments the self-view with private, real-time overlays. These overlays are subtle, suggestive prompts intended to help attendees reflect on how their cues might be interpreted by others. To invite personal interpretation, FaceValue avoids behavioral labeling and instead aims to support meaning-oriented self-awareness: recognizing when visible cues may unintentionally (mis)communicate intent. …

From Withdrawal To Impact: Smu Libraries’ Book Rehoming Initiatives, Kai Leong Heng, Eng Ling Lynn Yeo

Research Collection Library

Academic libraries are no strangers to large-scale deselection exercises. Driven by space constraints, evolving curricula, and the shift towards digital resources, the question is no longer whether to withdraw print materials, but what comes next. In the past year, SMU Libraries explored a different answer: instead of recycling withdrawn books, could we reimagine their next chapter, and rehome them to create meaningful impact for the community?

Learning 1-Bit Lidar-Based Localization With Auxiliary Objective, Kaijie Yin, Zhiyuan Zhang, Tian Gao, Wentao Zhu, Cheng-Zhong Xu, Hui Kong

Research Collection School Of Computing and Information Systems

6-DoF LiDAR-based localization is a fundamental capability for autonomous systems operating in large-scale outdoor environments. Many deep-learning-based localization methods have achieved promising performance so far. However, as one of the always-on modules competing for limited on-board computational resources, the localization module is expected to consume only a small portion of the overall compute budget. Most existing learning-based methods are still too heavy for this purpose. In contrast, binary neural networks (BNNs) offer an appealing solution, but the 1-bit compression causes severe information loss and performance drop. In this paper, we address this challenge by proposing Binarized LiDAR-based Localization (BiLoc), the …

Bayesian And Multi-Objective Decision Support For Incident Mitigation In Cyber-Physical Systems, Shaofei Huang, Christopher M. Poskitt, Lwin Khin Shar

Research Collection School of Computing and Information Systems

Cyber-physical systems increasingly rely on interconnected physical and digital systems whose security incidents can escalate rapidly into safety and operational failures. Existing decision-support approaches struggle to support incident response because they rely on static assumptions, incomplete vulnerability data, and single-objective risk models that do not adequately capture trade-offs between attack success likelihood, impact severity, and system availability. This paper proposes an adaptive decision-support framework for incident mitigation in cyber-physical systems that integrates hierarchical Bayesian Network modelling, confidence-calibrated exposure estimation, and multi-objective optimisation into a unified, adaptive pipeline. The framework constructs probabilistic models from system architecture and vulnerability data, incorporating complementary …

Towards More Inclusive Ai Systems In Cities, Siew Ying Shee, Orlando Woods

Research Collection School of Social Sciences

Artificial Intelligence (AI) is increasingly embedded in urban infrastructures and governance, shaping how people, spaces, and futures are classified, prioritised, and managed. Yet, most AI systems are developed within a narrow set of linguistic and geopolitical contexts and exported globally, embedding particular epistemic assumptions into diverse urban environments. Even where formal inclusion metrics are met, such asymmetries can render certain populations and realities less legible within algorithmic systems. Prevailing approaches in digital inclusion—centred on fairness metrics, representation, or access—presume technologies as politically inert and bounded. Yet, the adaptive and probabilistic behaviour of contemporary AI disrupts this premise, challenging the idea …

From Green Presence To Perceived Greenery: Everyday Mobility And Perceptual Availability In Singapore, Ziheng Zeng, Sonny Rosenthal, Orlando Woods

Research Collection College of Integrative Studies

Urban greenery may be abundant in transit-oriented cities, yet green presence does not necessarily become perceptually available to people moving through it. This paper distinguishes green supply, perceived greenery, and green experience, and examines the step at which greenery enters awareness during travel. The study combined 21 days of ecological momentary assessment from 68 participants in Singapore, yielding 6,794 in-trip moments, and 25 route-reconstruction interviews. A satellite normalized difference vegetation index (NDVI) provided a top-down baseline of green supply, and a street-level green view index (GVI) from Google Street View (GSV), matched to 5,824 moments, provided a co-located eye-level baseline. …

Prune: A Patching Based Repair Framework For Certifiable And Privacy-Robust Unlearning Of Neural Networks, Xuran Li, Jingyi Wang, Xiaohan Yuan, Peixin Zhang

Research Collection School Of Computing and Information Systems

Machine unlearning has emerged as a key mechanism for enabling the “right to be forgotten” in neural network models, allowing the selective removal of specific training data upon request. Existing approaches typically rely on retraining models with the remaining data, which is computationally expensive and difficult to verify, especially when deployed models are distributed or resource-constrained. To address this challenge, our prior conference work introduced PRUNE, a patching-based framework that formulates unlearning as a neural network repair problem. PRUNE achieves targeted forgetting by learning lightweight patch networks that redirect model predictions on the data to be unlearned while preserving performance …

Neural Symphony Of Flow Experience: Evidence For High-Dimensional Metastable Dynamics, Abdelrahman B. M. Eldaly, Kris Zhangguang Kang, Fiona Fui-Hoon Nah, Leanne Lai-Hang Chan, Keng Siau, Xiao Fan Liu, Richard Huskey, Langtao Chen, Tejaswini Yelamanchili, Rene Weber

Research Collection School Of Computing and Information Systems

Flow, an optimal experience characterized by deep immersion and engagement in an activity, has been extensively studied in behavioral research. However, its neural dynamic mechanism remains poorly understood. In a within-subject video gaming experiment, we captured neural activity underlying flow, boredom, and anxiety using a 64-channel electroencephalogram (EEG) system. Compared to boredom and anxiety, flow exhibits the highest global functional connectivity, metastability, and dimensionality of dynamic functional connectivity patterns, suggesting that flow is a highly adaptable process that is supported by high-dimensional neural dynamics. Unlike previous studies that focused on identifying static or localized brain activity, we examine the neural …

Generalized Logit Adjustment: Improved Fine-Tuning By Mitigating Label Bias In Zero-Shot Vision Models, Beier Zhu, Qianru Sun, Xun Yang, Hanwang Zhang

Research Collection School Of Computing and Information Systems

Foundation models like CLIP allow zero-shot transfer on various tasks without additional training data. Yet, the zero-shot performance is less competitive than a fully supervised one. Thus, fine-tuning and ensembling are also commonly adopted to better fit the downstream tasks. However, we argue that such prior work has overlooked the inherent biases in foundation models. Due to the highly imbalanced Web-scale training set, foundation models are inevitably skewed toward frequent semantics, and thus the subsequent fine-tuning or ensembling is still biased. In this study, we systematically examine the biases in foundation models and demonstrate the efficacy of our proposed Generalized …

Smart: When Is It Actually Worth Expanding A Speculative Tree?, Lifu Wang, Pan Zhou

Research Collection School Of Computing and Information Systems

Tree-based speculative decoding accelerates autoregressive generation by verifying a branching tree of draft tokens in a single targetmodel forward pass. However, existing methods prioritize maximizing token-level likelihood or the number of accepted tokens while ignoring a critical “efficiency paradox”: the computational overhead of drafting and verifying big trees can grow super-linearly, particularly at scale. This often leads to negative wall-clock speedup when batch sizes increase or hardware saturation limits are reached. To address this, we propose SMART, a System-aware Marginal Analysis framework for Runtime Tree construction. SMART reformulates tree expansion as a hardware-aware optimization problem that directly maximizes end-toend speedup. …

Llm-As-A-Judge For Software Engineering: Literature Review, Vision, And The Road Ahead, Junda He, Jieke Shi, Terry Yue Zhuo, Christoph Treude, Jiamou Sun, Zhenchang Xing, Xiaoning Du, David Lo

Research Collection School Of Computing and Information Systems

The rapid integration of Large Language Models (LLMs) into software engineering (SE) has revolutionized tasks from code generation to program repair, producing a massive volume of software artifacts. This surge in automated creation has exposed a critical bottleneck: the lack of scalable and reliable methods to evaluate the quality of these outputs. Human evaluation, while effective, is very costly and time-consuming. Traditional automated metrics like BLEU rely on high-quality references and struggle to capture nuanced aspects of software quality, such as readability and usefulness. In response, the LLM-as-a-Judge paradigm, which employs LLMs for automated evaluation, has emerged. This approach leverages …

Efficient Test-Time Retrieval Augmented Generation, Hailong Yin, Bin Zhu, Jingjing Chen, Chong-Wah Ngo

Research Collection School Of Computing and Information Systems

Although Large Language Models (LLMs) demonstrate significant capabilities, their reliance on parametric knowledge often leads to inaccuracies. Retrieval Augmented Generation (RAG) mitigates this by incorporating external knowledge, but these methods may introduce irrelevant retrieved documents, leading to inaccurate responses. While the integration methods filter out incorrect answers from multiple responses, but lack external knowledge like RAG methods, and their high costs require balancing overhead with performance gains. To address these issues, we propose an Efficient Test-Time Retrieval-Augmented Generation Framework named ET2RAG to improve the performance of LLMs while maintaining efficiency. Specifically, ET2RAG is a training-free method, that first retrieves the …

Continuous Query For Top-K Maximal Sum Intervals Over Streaming Data, Zhongshuai Zhang, Xiaochun Yang, Baihua Zheng, Rui Zhu, Haomin Li, Bin Wang

Research Collection School Of Computing and Information Systems

The continuous identification of top-k maximal sum intervals using a sliding window over a data stream is a critical operation for applications in IoT and beyond. A maximal sum interval is a non-overlapping, contiguous subsequence with the maximal sum in a sequence of signed values. Existing algorithms are ill-suited for streaming contexts: they either exhaustively enumerate all intervals even for small k values, or depend on indexes that require frequent and costly restructuring. We propose a novel partition-based strategy. Our core insight is a partitioning scheme that guarantees that any maximal sum interval is fully contained within a single partition, …

Success Of New Ideas In Online Platforms: An Idea Network Perspective, Yimei Zhou, Qian Tang, Vincent Z.W. Mack Mack, Shao Yi Liaw

Research Collection School Of Computing and Information Systems

On online platforms, new ideas often emerge by recombining existing ones within idea networks. Unlike traditional knowledge networks, idea networks represent curated, meaning-based associations among ideas, offering a distinct lens on recombination. Drawing upon a hypergraph perspective, we investigate how new idea success depends on their structural and content attributes, and how collaborative participation shapes these attributes. Using data from an ideation platform, we find that both structural embeddedness and bridging benefit new idea success. Content diversity has no direct effect, but it amplifies the benefits of bridging while constraining those of embeddedness. Both crowd contributions and ideator expertise strengthen …

Approximation And Learning-Based Algorithms For Influence Maximization In Multilayer Social Networks, Xueqin Chang, Ruize Liu, Qing Liu, Baihua Zheng, Yunjun Gao

Research Collection School Of Computing and Information Systems

Motivated by the observation that users in the real world often engage across multiple social networks simultaneously, we study the problem of influence maximization in multilayer social networks (Mlim), aiming to select a small set of nodes that maximizes the total influence spread across all layers. To this end, we introduce a hybrid propagation model that jointly captures layer-specific diffusion dynamics and probabilistic cross-layer propagation. Based on this model, we formally define the Mlim problem and establish its NP-hardness, monotonicity, and submodularity. To address the Mlim problem, we first propose a greedy baseline Mlim-Greedy, which achieves a (1-1/e) approximation. Since …

Left: Learnable Fusion Of Tri-View Tokens For Unsupervised Time Series Anomaly Detection, Dezheng Wang, Tong Chen, Guansong Pang, Congyan Chen, Shihua Li, Hongzhi Yin

Research Collection School Of Computing and Information Systems

As a fundamental data mining task, unsupervised time series anomaly detection (TSAD) aims to build a model for identifying abnormal timestamps without assuming the availability of annotations. A key challenge in unsupervised TSAD is that many anomalies are too subtle to exhibit detectable deviation in any single view (e.g., time domain), and instead manifest as inconsistencies across multiple views like time, frequency, and a mixture of resolutions. However, most cross-view methods rely on feature or score fusion and do not enforce analysis–synthesis consistency, meaning the frequency branch is not required to reconstruct the time signal through an inverse transform, and …

Timeradar: A Domain-Rotatable Foundation Model For Time Series Anomaly Detection, Hui He, Hezhe Qiao, Yutong Chen, Kun Yi, Guansong Pang

Research Collection School Of Computing and Information Systems

Current time series foundation models (TSFMs) primarily focus on learning prevalent and regular patterns within a predefined time or frequency domain to enable supervised downstream tasks (\eg, forecasting). Consequently, they are often ineffective for inherently unsupervised downstream tasks—such as time series anomaly detection (TSAD), which aims to identify rare, irregular patterns. This limitation arises because such abnormal patterns can closely resemble the regular patterns when presented in the same time/frequency domain. To address this issue, we introduce TimeRadar, an innovative TSFM built in a fractional time–frequency domain to support generalist TSAD across diverse unseen datasets. Our key insight is that …

Graph Perturbation Analysis For Subgraph Counting, Hanhua Xiao, Yuchen Li, Kyriakos Mouratidis

PhD Student’s Publications Collection

Subgraph counting, which involves determining the frequency of a query graph within a data graph, has numerous applications such as query optimization, fraud detection, and evaluating the expressiveness of graph neural networks. Despite its importance, there has been no systematic study on the impact of adversarial graph perturbations on subgraph counts. In this work, we examine the kSub problem, which aims to identify k edge additions that maximize the count of a query graph. We prove that kSub is intractable due to its NP-hardness, even for constant approximation. To address this, we relax the problem into a top-k selection, termed …

Leading The Change: Staff-Driven Ai Transformation In Smu Libraries’ Collection Team, Siew Khim Lim, Fion Goh

Research Collection Library

No abstract provided.

Llm-Based Early Rumor Detection With Imitation Agent, Fengzhu Zeng, Qian Shao, Ling Cheng, Wei Gao, Shih-Fen Cheng, Jing Ma, Cheng Niu

Research Collection School Of Computing and Information Systems

Early Rumor Detection (EARD) aims to identify the earliest point at which a claim can be accurately classified based on a sequence of social media posts. This is especially challenging in data-scarce settings. While Large Language Models (LLMs) perform well in few-shot NLP tasks, they are not well-suited for time-series data and are computationally expensive for both training and inference. In this work, we propose a novel EARD framework that combines an autonomous agent and an LLM-based detection model, where the agent acts as a reliable decision-maker for \textit{early time point determination}, while the LLM serves as a powerful \textit{rumor …

A Deep Reinforcement Learning Framework For Dynamic Order And Rack Scheduling In Robotic Mobile Fulfillment Systems, Lingjun Wang, Bayi Cheng, Zhiguang Cao, Aldy Gunawan

Research Collection School Of Computing and Information Systems

Robotic mobile fulfillment systems play a vital role in modern e-commerce, but their efficiencydepends on overcoming a critical challenge: coordinating orders and racks effectively under dynamicorder arrivals, diverse delivery deadlines, and resource sharing among multiple stations. This papertackles the resulting dynamic order and rack scheduling problem and proposes an intelligentscheduling framework centred on deep reinforcement learning. At its core is TriNet-PPO, whichtrains a scheduling policy using TriNet, a tripartite graph neural network encoder tailored to capturethe many-to-many relationships among orders, racks, and items. Furthermore, we introduce IPCSA,an integer programming-based cooperative scheduling algorithm that maps station-level actionpreferences to conflict-free joint decisions …

Ai-Ready Libraries Require Ai-Ready Librarians: Building Organisational Capability For Digital Transformation, Salihin Mohammed Ali

Research Collection Library

Academic libraries worldwide are rapidly experimenting with artificial intelligence (AI) to enhance research, learning, discovery, operations, and user engagement. However, many institutions continue to approach AI adoption primarily through isolated pilots, individual experimentation, or technology-centric initiatives. While these efforts generate innovation, they often struggle to scale sustainably without corresponding organisational capability development. This presentation argues that AI-ready libraries require AI-ready librarians and proposes an organisational capability approach for sustainable AI transformation in academic libraries. Drawing from the development of a library-wide AI strategy plans at Singapore Management University, the presentation explores how AI capability-building can be operationalised across diverse functional …

When The Best-Fit Model Is Not Best: The Glass Slipper Fallacy And Latent Growth Mixture Modelling, Jonathan L. Chia, Markus Wettstein, Andree Hartanto

Research Collection School of Social Sciences

Despite the use of latent growth mixture modelling (LGMM) to study longitudinal changes, existing practices may inadvertently impede this very investigation. Although subgroup trajectories may theoretically differ in their structure (e.g., some subgroups being linear, some curvilinear), the current convention advocates overreliance on the baseline model to derive subsequent profile trajectories, which may obscure these structural differences. In this article, we provide a brief description of extant LGMM practices, after which we explicate the pitfalls of the current approach. Finally, we provide a principled approach for LGMM research moving forward. Specifically, we recommend specifying a set of theoretically plausible models …

Caring With Ai: The Efficacy Of A Customised Chatgpt-Delivered Self-Compassion Intervention On College Students' Well-Being And Academic Functioning, Tracy Xi Chen, Chi-Ying Cheng, Andree Hartanto

Research Collection School of Social Sciences

College students face various challenges, including academic pressure, social stress, and the transition into adulthood, which can lead to increased anxiety and other mental health issues. By recognizing personal struggles as part of a shared human experience and responding with kindness, self-compassion serves as a powerful strategy for enhancing resilience, facilitating better well-being and performance outcomes. Although effective, Compassion-Focused Therapy often requires substantial resources and time, limiting its applicability to college students. To overcome these barriers, the current study designed and evaluated Your Self-Compassion Companion, a ChatGPT-powered AI chatbot intervention grounded in self-compassion theory and delivered over three weekly 20-min …

Artificial Intelligence (Ai) In Forensic Psychology: An Umbrella Review Of Potentials And Pitfalls, Ysabel Thereze Ang Guevarra, Nur Eva Alisha Binte Mohamed Hisham, Andree Hartanto

Research Collection School of Social Sciences

Artificial intelligence (AI) is becoming increasingly embedded within forensic psychological practice, shaping how criminal risk, legal responsibility and public safety are assessed. AI tools are now used in recidivism prediction, behavioural analysis, deception detection and investigative support, high-stakes domains where errors can have profound consequences. Despite this rapid adoption, the existing literature remains fragmented, with most reviews confined to narrow subdomains and offering limited integrated synthesis of AI′s broader role in forensic psychology. Thus, this umbrella review addresses this gap by synthesising findings from 43 reviews obtained from five major databases, namely EBSCOhost ERIC, EBSCOhost PsycInfo, PubMed, Scopus and Web …

Automated Testing And Enhancement For Autonomous Driving Systems, Mingfei Cheng

Dissertations and Theses Collection (Open Access)

Autonomous Vehicles (AVs) rely on Autonomous Driving Systems (ADSs) to perceive their surroundings, predict the behavior of traffic participants, plan driving actions, and control vehicle motion in complex traffic environments. As AVs move toward large-scale real-world deployment, ADSs are expected not only to avoid collisions and traffic-rule violations, but also to make robust decisions, cooperate effectively with other AVs, and maintain high-quality driving behavior. However, the open, dynamic, and uncertain nature of driving environments makes the systematic testing and enhancement of ADSs a challenging problem.

Although scenario-based testing has made substantial progress in discovering safety-critical violations, several important limitations remain. …

Practical On-Device Intelligence For Resource-Constrained Embedded And Wearable Devices, Xiao Ma

Dissertations and Theses Collection (Open Access)

Embedded and wearable devices increasingly rely on deep neural networks to support intelligent sensing applications directly on the device. However, building practical on-device intelligence remains challenging throughout the deployment lifecycle. Before deployment, models must remain accurate despite severe memory, computation, and energy budgets, and a single device often needs to support multiple sensing applications without deploying a separate model for each application. After deployment, the device continues to operate in changing real-world environments, where shifts in data distribution can degrade the model’s performance over time, so the model must be able to adapt to such shifts efficiently.

The first challenge …

Lessons Learned From The Adrenalin Load Disaggregation Challenge, András Balázs Tolnai, Zheng Ma, Igor Sartori, Clayton Miller, Stephen White, Matt Amos, Gustaf Bengtsson, Akram Hameed, Nørregaard Bo Jørgensen

Research Collection College of Integrative Studies

Crowdsourced data science competitions have emerged as a powerful mechanism for advancing research in energy informatics, offering scalable pathways for developing machine learning solutions that enhance energy efficiency and smart building operations. The ADRENALIN Load Disaggregation Challenge addressed a central problem in energy analytics—non-intrusive load monitoring (NILM) of heating and cooling loads in commercial buildings—while emphasizing the importance of model generalization across different buildings. This paper presents a comprehensive reflection on the lessons learned from organizing and executing the ADRENALIN competition, including technical insights, organizational challenges, and recommendations for future energy data challenges. In addition to the ADRENALIN case, a …

Efficient And Universal Watermarking For Llm-Generated Code Detection, Boquan Li, Zirui Fu, Mengdi Zhang, Peixin Zhang, Jun Sun, Xingmei Wang

Research Collection School Of Computing and Information Systems

Large language models (LLMs) have significantly enhanced the usability of AI-generated code, providing effective assistance to programmers. This advancement also raises ethical and legal concerns, such as academic dishonesty and the generation of malicious code. For accountability, it is imperative to detect whether a piece of code is AI-generated. Watermarking is broadly considered a promising solution and has been successfully applied to identify LLM-generated text. However, existing efforts on code are far from ideal, suffering from limited universality and excessive time and memory consumption. In this work, we propose a plugand- play watermarking approach for AI-generated code detection, named ACW …

Dynamic Spectral Denoising With Global-Context Attention For Multi-Behavior Recommendation, Miaomiao Cai, Yunshan Ma, Fangqi Zhu, Junfeng Fang, Zhijie Zhang, Zhiyong Cheng, Xiang Wang, See-Kiong Ng

Research Collection School Of Computing and Information Systems

Multi-behavior recommendation improves target-behavior predic-tion by exploiting heterogeneous auxiliary feedback (e.g., view,collect, and cart), yet its robustness is often undermined by behavior-dependent noise and inconsistency. We argue that the key bottle-neck is not merely noisy behaviors, but a representation-level failurecaused by two coupled heterogeneities. First, intra-behavior rep-resentation entanglement arises when multi-hop propagationblends incidental signals with true preferences in the embeddingspace. This entanglement renders coarse spatial denoising inef-fective, since it cannot suppress noise without sacrificing weak-but-informative niche signals. Second, inter-behavior reliabilityheterogeneity complicates cross-behavior fusion, as the predic-tive value of auxiliary behaviors varies substantially across usersand contexts. Without reliability calibration, aggregation can …