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

Digital Commons Network™

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

Singapore Management University

Discipline
Keyword
Publication Year
Publication
Publication Type
File Type

Articles 31 - 60 of 10460

Full-Text Articles in Entire DC Network

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

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 …

Go to article

Promotion Architecture: A Deal Fairness Model Of Restricted Price Promotions, Shangwen Yi, David Hardisty, Dale Griffin, Thomas Allard Aug 2026

Promotion Architecture: A Deal Fairness Model Of Restricted Price Promotions, Shangwen Yi, David Hardisty, Dale Griffin, Thomas Allard

Research Collection Lee Kong Chian School Of Business

This research examines the effectiveness of two common types of restricted price promotions: threshold promotions (conditional on spending more than a threshold amount; e.g., “Get $5 off on orders of $10 or more”) and capped promotions (limited to a maximum dollar value; e.g., “Get 50% off, up to $5 per order”). Results from seven pre-registered studies, including one field study, show that threshold promotions lead to higher purchase intentions and conversion rates (but potentially lower purchase amounts) than comparable capped promotions—even though capped promotions are equivalent in maximal economic savings for the consumer—when the trigger value (the spending amount at …

Go to article

Dynamics Of High-Growth Young Firms And The Role Of Venture Capitalists, Yoshiki Ando Aug 2026

Dynamics Of High-Growth Young Firms And The Role Of Venture Capitalists, Yoshiki Ando

Research Collection School Of Economics

Motivated by the substantial growth and upfront investments of venture capital (VC)-backed firms observed in administrative US Census data, this study develops a life-cycle firm dynamics model. In the model, startups choose the source of financing from VC, angel investors, or banks, depending on their growth potential, and invest in innovation. The calibrated model explains the life-cycle dynamics of firms with different sources of financing and suggests that venture capitalists' managerial advice accounts for around 22% of the growth in VC-backed firms. A counterfactual economy without VC financing would experience an aggregate consumption loss of around 0.46%.

Go to article

Semiparametric Cointegrating Rank Selection For Curved Cross-Section Time Series, Peter C. B. Phillips Aug 2026

Semiparametric Cointegrating Rank Selection For Curved Cross-Section Time Series, Peter C. B. Phillips

Research Collection School Of Economics

Cointegrating rank selection is studied in a function space reduced rank regression where the data are time series of cross-section curves. Consistent cointegrating rank estimation is developed using information criteria extended to curve time series environments. The asymptotic theory involves two-parameter Gaussian processes that generalise the standard limit processes involved in cointegrating regressions. Simulations provide evidence of the effectiveness of consistent rank selection by the BIC criterion and the tendency of AIC to overestimate order as in standard lag order selection in autoregression, as well as in reduced rank regression with multiple time series.

Go to article

Marital Stability And Intrahousehold Inequality, Tomoki Fujii, Xirong Lin, Jacob Penglase Aug 2026

Marital Stability And Intrahousehold Inequality, Tomoki Fujii, Xirong Lin, Jacob Penglase

Research Collection School Of Economics

We study what predicts marital instability using a unique dataset from Japan with detailed measures of spouses’ consumption, savings, labor supply, satisfaction, and marriage-market conditions. We combine descriptive survival and event-study analyses with several econometric and machine-learning approaches, including Cox proportional-hazards models and DynForest, a method designed for survival data with time-varying covariates. Across these approaches, match quality, household resources, time use, stated satisfaction, and marriage-market conditions all contain predictive information. Our main contribution is to show that intrahousehold consumption allocation matters, highlighting information that is missed by standard demographic, time use, and income measures. We relate these findings to …

Go to article

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

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 …

Go to article

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

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, …

Go to article

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 Aug 2026

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 …

Go to article

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

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 …

Go to article

Audeter: A Large-Scale Dataset For Deepfake Audio Detection In Open Worlds, Qizhou Wang, Hanxun Huang, Guansong Pang, Sarah Erfani, Christopher Leckie Aug 2026

Audeter: A Large-Scale Dataset For Deepfake Audio Detection In Open Worlds, Qizhou Wang, Hanxun Huang, Guansong Pang, Sarah Erfani, Christopher Leckie

Research Collection School Of Computing and Information Systems

Speech synthesis systems can now produce highly realistic vocalisations that pose significant authenticity challenges. Despite substantial progress in deepfake detection models, their real-world effectiveness is often undermined by evolving distribution shifts between training and test data, driven by the complexity of human speech and the rapid evolution of synthesis systems. Existing datasets suffer from limited real speech diversity, insufficient coverage of recent synthesis systems, and heterogeneous mixtures of deepfake sources, which hinder systematic evaluation and open-world model training. To address these issues, we introduce AUDETER (AUdio DEepfake TEst Range), a large-scale and highly diverse deepfake audio dataset comprising over 4,500 …

Go to article

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 Aug 2026

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 …

Go to article

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

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 …

Go to article

Task-Aligned Haze Removal With Semantic-Aware Fusion And Contrast Self-Correction, Jinbin Wang, Aiping Yang, Guosong Jiang, Wenlong Yu, Dongwei Ren, Qinghua Hu Aug 2026

Task-Aligned Haze Removal With Semantic-Aware Fusion And Contrast Self-Correction, Jinbin Wang, Aiping Yang, Guosong Jiang, Wenlong Yu, Dongwei Ren, Qinghua Hu

Research Collection School Of Computing and Information Systems

Adverse haze conditions introduce complex degradations that obscure scene details and distort structural cues critical for object detection, posing persistent challenges for vision‐based sensing systems. Although existing haze removal methods have achieved notable improvements in visual clarity, their optimisation objectives are often misaligned with downstream detection requirements, leading to limited detection performance in real‐world scenarios. To address this issue, this work proposes a task‐aligned weakly supervised haze removal framework, termed Dehaze4Detection, which explicitly aligns low‐level restoration with high‐level detection objectives. The framework incorporates a Semantic‐Aware Multi‐Scale Fusion Module (SMFM) that embeds pixel‐level semantic knowledge into the dehazing process, enabling selective …

Go to article

Hvi-Cidnet+: Beyond Extreme Darkness For Low-Light Image Enhancement, Kangbiao Shi, Xiaowen Ma, Yixu Feng, Tao Hu, Peng Wu, Guansong Pang, Qingsen Yan Aug 2026

Hvi-Cidnet+: Beyond Extreme Darkness For Low-Light Image Enhancement, Kangbiao Shi, Xiaowen Ma, Yixu Feng, Tao Hu, Peng Wu, Guansong Pang, Qingsen Yan

Research Collection School Of Computing and Information Systems

Low-Light Image Enhancement (LLIE) aims to recover visually pleasing content and details from degraded low-light images. However, existing RGB-based methods often suffer from color bias and brightness artifacts due to inherent high color sensitivity. Although the HSV color space can decouple brightness and color, it introduces noticeable red and black noise artifacts. To address these challenges, we adopt the Horizontal/Vertical-Intensity (HVI) color space for LLIE, which is defined by the HV color map and learnable intensity. The former enforces small distances for red coordinates to alleviate red noise artifacts, while the latter adaptively compresses low-light regions to suppress black noise …

Go to article

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

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 …

Go to article

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 Aug 2026

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 …

Go to article

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 Aug 2026

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 …

Go to article

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 Aug 2026

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 …

Go to article

Definitions And Mathematical Models Of Op Variants, Pieter Vansteenwegen, Aldy Gunawan Aug 2026

Definitions And Mathematical Models Of Op Variants, Pieter Vansteenwegen, Aldy Gunawan

Research Collection School Of Computing and Information Systems

We have described the basic orienteering problem (OP) in Chap. 2, as one known variant of the single vehicle routing problems with profits (VRPP). In this chapter, we introduce the best-known variants of the OP. The first one is the team orienteering problem (TOP). In the TOP multiple routes can be composed to visit a subset of customers. In the context of the game of orienteering, the TOP corresponds to several players of the same team, each collecting profits in parallel, during the same time span. Another well-known variant of the basic OP is the OP with time windows (OPTW), …

Go to article

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

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 …

Go to article

Multimodal Contrastive Spatiotemporal Self-Organizing Neural Networks For In-Home Activity Learning Of Mild Cognitive Impairment, Seng Khoon Teh, Ah-Hwee Tan, Kar Way Tan, Iris Rawtaer Jul 2026

Multimodal Contrastive Spatiotemporal Self-Organizing Neural Networks For In-Home Activity Learning Of Mild Cognitive Impairment, Seng Khoon Teh, Ah-Hwee Tan, Kar Way Tan, Iris Rawtaer

Research Collection School Of Computing and Information Systems

In-home spatiotemporal data, such as the movement trajectory data and the spatial time series data, contains potential predictive utility for detection of geriatric conditions including Mild Cognitive Impairment (MCI), frailty, and cognitive frailty. However, few have explored spatiotemporal learning models for learning and fusion of such disparate spatiotemporal data, owing to the lack of a generalized machine learning model that can jointly model these different spatiotemporal data types. This work reports a multimodal spatiotemporal machine learning model based on a class of self-organizing neural networks that can integrate different spatiotemporal data types for MCI detection. Specifically, Episodic Memory Adaptive Resonance …

Go to article

Configuring Agentic Ai Coding Tools: An Exploratory Study, Matthias Galster, Seyedmoein Mohsenimofidi, Jai Lal Lulla, Muhammad Auwal Abubakar, Christoph Treude, Sebastian Baltes Jul 2026

Configuring Agentic Ai Coding Tools: An Exploratory Study, Matthias Galster, Seyedmoein Mohsenimofidi, Jai Lal Lulla, Muhammad Auwal Abubakar, Christoph Treude, Sebastian Baltes

Research Collection School Of Computing and Information Systems

Agentic AI coding tools increasingly automate software development tasks. Developers can configure these tools through versioned repository-level artifacts such as Markdown and JSON files. We present a systematic analysis of configuration mechanisms for agentic AI coding tools, covering Claude Code, GitHub Copilot, Cursor, Gemini, and Codex. We identify eight configuration mechanisms spanning from static context to executable and external integrations and, in an empirical study of 2,853 GitHub repositories, examine whether and how they are adopted, with a detailed analysis of Context Files, Skills, and Subagents. First, Context Files dominate the configuration landscape and are often the sole mechanism in …

Go to article

Air: Improving Agent Safety Through Incident Response, Zibo Xiao, Jun Sun, Junjie Chen Jul 2026

Air: Improving Agent Safety Through Incident Response, Zibo Xiao, Jun Sun, Junjie Chen

Research Collection School Of Computing and Information Systems

Large Language Model (LLM) agents are increasingly deployed in practice across a wide range of autonomous applications. Yet current safety mechanisms for LLM agents focus almost exclusively on preventing failures in advance, providing limited capabilities for responding to, containing, or recovering from incidents after they inevitably arise. In this work, we introduce AIR, the first incident response framework for LLM agent systems. AIR defines a domain-specific language for managing the incident response lifecycle autonomously in LLM agent systems, and integrates it into the agent's execution loop to (1) detect incidents via semantic checks grounded in the current environment state and …

Go to article

A Framework For Top-K Queries With Constrained Preferences, Kyriakos Mouratidis, Nikolaos Chaloulakos, Bo Tang Jul 2026

A Framework For Top-K Queries With Constrained Preferences, Kyriakos Mouratidis, Nikolaos Chaloulakos, Bo Tang

Research Collection School Of Computing and Information Systems

Traditional rank-aware processing assumes a dataset that contains available options to cover a specific need (e.g., restaurants, hotels, etc) and users who browse that dataset via top-k queries with linear scoring functions, i.e., by ranking the options according to the weighted sum of their attributes, for a set of given weights. In practice, however, user preferences (weights) may only be estimated with bounded accuracy, or may be inherently imprecise due to the inability of a human user to specify exact weight values with absolute accuracy. Motivated by this, we define the constrained-preference top-k (CT) query. Given an approximate description of …

Go to article

Robust Graph Learning On The Web: Challenges, Methods, And Applications, Ao Xiang, Yang Liu, Guansong Pang, Yuanhao Ding, Hezhe Qiao, Dawei Cheng, Qing He Jul 2026

Robust Graph Learning On The Web: Challenges, Methods, And Applications, Ao Xiang, Yang Liu, Guansong Pang, Yuanhao Ding, Hezhe Qiao, Dawei Cheng, Qing He

Research Collection School Of Computing and Information Systems

Graph learning is transforming web intelligence, powering applications from recommender systems to anomaly detection. However, most existing approaches implicitly assume ideal conditions where training and testing data are accurate, complete, and free from manipulation. In reality, web environments rarely exhibit such stability. Dynamic user behavior, incomplete or outdated content, adversarial interference, and sudden distribution shifts can all erode the reliability of even state-of-the-art models, leading to biased or unsafe outcomes. This tutorial provides a comprehensive survey of emerging strategies for robust graph learning on the web. We first present a structured taxonomy of the principal robustness threats specific to web …

Go to article

Constrained Assortment Optimization Under The Mixed-Logit Model, Hoang Giang Pham, Tien Mai Jul 2026

Constrained Assortment Optimization Under The Mixed-Logit Model, Hoang Giang Pham, Tien Mai

Research Collection School Of Computing and Information Systems

In this paper, we study the assortment optimization problem under the mixed-logit customer choice model. While assortment optimization has been a central topic in revenue management for decades, the mixed-logit model is widely regarded as one of the most general and flexible frameworks for modeling and predicting customer purchasing behavior. The assortment optimization problem is known to be NP-hard to be approximated to any constant factor, even in the unconstrained case. To address this challenge, we first explore the submodularity properties of a simplified version of the objective function to derive novel semi-constant factor approximation solutions for assortment problems under …

Go to article

Late-Night And Early-Morning Train Scheduling With Non-Traffic Hour Maintenance Window In Urban Rail Transit Systems, Yaochen Ma, Hai Yang, Hai Wang Jul 2026

Late-Night And Early-Morning Train Scheduling With Non-Traffic Hour Maintenance Window In Urban Rail Transit Systems, Yaochen Ma, Hai Yang, Hai Wang

Research Collection School Of Computing and Information Systems

Regular maintenance during non-traffic hours (NTH) is vital for the resilience of urban rail transit (URT) systems, yet an insufficient NTH maintenance window poses a challenge for URT systems in various cities. For instance, the Hong Kong MTR Corporation has noted that the required NTH maintenance time often exceeds the available window, prompting service adjustments such as earlier late-night closures and/or later early-morning starts. To address this challenge, this study develops an optimal scheduling framework that links late-night and early-morning URT services through the NTH maintenance window requirement to maximize public welfare. A Decoupled Optimization Model (DOM) first derives closed-form …

Go to article

Accountable Agents In Software Engineering: An Analysis Of Terms Of Service And A Research Roadmap, Christoph Treude Jul 2026

Accountable Agents In Software Engineering: An Analysis Of Terms Of Service And A Research Roadmap, Christoph Treude

Research Collection School Of Computing and Information Systems

AI coding assistants and autonomous agents are becoming integral to software development workflows, reshaping how code is produced, reviewed, and maintained. While recent research has focused mainly on the capabilities and impacts of productivity of these systems, much less attention has been paid to accountability: who is responsible when agents generate, modify, or recommend code? In practice, accountability is defined through the Terms of Service (ToS) and related policy documents that govern the use of AI-powered development tools.In this vision paper, we present a comparative analysis of the Terms of Service for widely used AI coding assistants and agent-enabled development …

Go to article

Operationalizing Ethics For Ai Agents: How Developers Encode Values Into Repository Context Files, Christoph Treude, Sebastian Baltes, Marc Cheong Jul 2026

Operationalizing Ethics For Ai Agents: How Developers Encode Values Into Repository Context Files, Christoph Treude, Sebastian Baltes, Marc Cheong

Research Collection School Of Computing and Information Systems

As AI coding agents become embedded in software development workflows, developers are beginning to operationalize ethical principles by encoding behavioral rules into repository-level context files for AI agents, such as AGENTS.md files. Rather than examining the ethics of AI agents in the abstract, this vision paper investigates how ethics and values are already being translated for AI agents into actionable instructions that shape agent behavior. Through a preliminary investigation, we find that developers are already embedding guidance related to fairness, accessibility, sustainability, tone, and privacy. These artifacts function as a developer-authored governance layer, translating abstract principles into situated, natural-language directives …

Go to article

A Dataset Of Agentic Ai Coding Tool Configurations, Matthias Galster, Seyedmoein Mohsenimofidi, Levi Böhme, Jai Lal Lulla, Muhammad Auwal Abubakar, Christoph Treude, Sebastian Baltes Jul 2026

A Dataset Of Agentic Ai Coding Tool Configurations, Matthias Galster, Seyedmoein Mohsenimofidi, Levi Böhme, Jai Lal Lulla, Muhammad Auwal Abubakar, Christoph Treude, Sebastian Baltes

Research Collection School Of Computing and Information Systems

Agentic AI coding tools such as Claude Code and OpenAI Codex execute multi-step coding tasks with limited human oversight. To steer these tools, developers create repository-level configuration artifacts (e.g., Markdown files) for configuration mechanisms such as Context Files, Skills, Rules, and Hooks. There is no curated dataset yet that captures these configurations at scale. This dataset, collected from open-source GitHub repositories, fills that gap. We selected 40,585 actively maintained repositories through metadata filtering, classified them using GPT-5.2 to identify 36,710 as belonging to engineered software projects, and systematically detected configuration artifacts in these repositories. The dataset covers 4,738 repositories across …

Go to article

First Prev Next Last