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

Digital Commons Network™

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

Research Collection School Of Computing and Information Systems

Discipline
Keyword
Publication Year
File Type

Articles 211 - 240 of 8612

Full-Text Articles in Entire DC Network

Prompt Tuning Without Labeled Samples For Zero-Shot Node Classification In Text-Attributed Graphs, Sethupathy Parameswaran, Suresh Sundaram, Yuan Fang Feb 2026

Prompt Tuning Without Labeled Samples For Zero-Shot Node Classification In Text-Attributed Graphs, Sethupathy Parameswaran, Suresh Sundaram, Yuan Fang

Research Collection School Of Computing and Information Systems

Node classification is a fundamental problem in information retrieval with many real-world applications, such as community detection in social networks, grouping articles published online and product categorization in e-commerce. Zero-shot node classification in text-attributed graphs (TAGs) presents a significant challenge, particularly due to the absence of labeled data. In this paper, we propose a novel Zero-shot Prompt Tuning (ZPT) framework to address this problem by leveraging a Universal Bimodal Conditional Generator (UBCG). Our approach begins with pre-training a graph-language model to capture both the graph structure and the associated textual descriptions of each node. Following this, a conditional generative model …

Go to article

Fortifying The Seams Between C/C++ And Rust: Characterizing Bugs In Interop Tools, Xuemeng Cai, Jiakun Liu, Cunyang Liu, Lingfeng Bao, Yijun Yu, Lingxiao Jiang Feb 2026

Fortifying The Seams Between C/C++ And Rust: Characterizing Bugs In Interop Tools, Xuemeng Cai, Jiakun Liu, Cunyang Liu, Lingfeng Bao, Yijun Yu, Lingxiao Jiang

Research Collection School Of Computing and Information Systems

Rust has become increasingly popular in recent years due to its safety and high performance. Despite these advantages, Rust projects rarely start from scratch in practice, and many Rust-based systems instead use hybrid programming, where Rust interoperates with existing C/C++ code. To reduce the manual effort involved in this interoperation (interop) process, several interop tools have been proposed to facilitate hybrid programming between Rust and C/C++. However, the challenges and limitations of these tools remain largely unexplored, leaving developers unclear about the future directions and users unclear about the appropriate usage scenarios. To fill the gap, we mined 320 bugs …

Go to article

Mm-Attackg: A Multimodal Approach To Attack Graph Construction With Large Language Models, Yongheng Zhang, Xinyun Zhao, Yunshan Ma, Haokai Ma, Yingxiao Guan, Guozheng Yang, Yuliang Lu, Xiang Wang Feb 2026

Mm-Attackg: A Multimodal Approach To Attack Graph Construction With Large Language Models, Yongheng Zhang, Xinyun Zhao, Yunshan Ma, Haokai Ma, Yingxiao Guan, Guozheng Yang, Yuliang Lu, Xiang Wang

Research Collection School Of Computing and Information Systems

Cyber Threat Intelligence (CTI) parsing aims to extract key threat information from massive data, transform it into actionable intelligence, enhance threat detection and defense efficiency, including attack graph construction, intelligence fusion, and indicator extraction. Among these research topics, Attack Graph Construction (AGC) is essential for visualizing and understanding the potential attack paths of threat events from CTI reports. Existing approaches primarily construct the attack graphs purely from the textual data to reveal the logical threat relationships between entities within the attack behavioral sequence. However, they typically overlook the specific threat information inherent in visual modalities, which preserves key threat details …

Go to article

Obstructive Sleep Apnea Prediction: A Comprehensive Review And Comparative Study, Thi Khanh Chi Huynh, Amonae Dabbs-Brown, Anna Jurek-Loughrey, James Mulhall, Tuan Dung Pham, Ngoc Phu Doan, Viet Hung Tran, Zichi Zhang, Xuan Hoang Nguyen, Yimeng An, Peixin Li, Phi Hung Nguyen, Thi Linh Hoang, Xinming Shi, Hans Vandierendonck, Sebastien Bailly, Jean-Louis Pépin, Thai Son Mai Feb 2026

Obstructive Sleep Apnea Prediction: A Comprehensive Review And Comparative Study, Thi Khanh Chi Huynh, Amonae Dabbs-Brown, Anna Jurek-Loughrey, James Mulhall, Tuan Dung Pham, Ngoc Phu Doan, Viet Hung Tran, Zichi Zhang, Xuan Hoang Nguyen, Yimeng An, Peixin Li, Phi Hung Nguyen, Thi Linh Hoang, Xinming Shi, Hans Vandierendonck, Sebastien Bailly, Jean-Louis Pépin, Thai Son Mai

Research Collection School Of Computing and Information Systems

Obstructive Sleep Apnea (OSA) is a highly prevalent sleep disorder linked to considerable public health burdens and comorbidities. However, its heterogeneous presentation and the limited accessibility of traditional diagnostic tools such as polysomnography (PSG) lead to widespread underdiagnosis. As a result, artificial intelligence (AI) approaches, including machine learning (ML) and deep learning (DL) models, have attracted attention as an alternative pathway to detection. This paper first provides a comprehensive review of AI-driven OSA diagnosis, covering different diagnosis problems, input-data types, data biases, pre-processing techniques, and model performance. We then leverage the largest clinical dataset used in OSA prediction to date, …

Go to article

Defending Code Language Models Against Backdoor Attacks With Deceptive Cross-Entropy Loss, Guang Yang, Yu Zhou, Xiangyu Zhang, Xiang Chen, Terry Yue Zhuo, David Lo, Taolue Chen Feb 2026

Defending Code Language Models Against Backdoor Attacks With Deceptive Cross-Entropy Loss, Guang Yang, Yu Zhou, Xiangyu Zhang, Xiang Chen, Terry Yue Zhuo, David Lo, Taolue Chen

Research Collection School Of Computing and Information Systems

Code Language Models (CLMs), particularly those leveraging deep learning, have achieved significant success in code intelligence domain. However, the issue of security, particularly backdoor attacks, is often overlooked in this process. The previous research has focused on designing backdoor attacks for CLMs, but effective defenses have not been adequately addressed. In particular, existing defense methods from natural language processing, when directly applied to CLMs, are not effective enough and lack generality, working well in some models and scenarios but failing in others, thus fall short in consistently mitigating backdoor attacks. To bridge this gap, we first confirm the phenomenon of …

Go to article

G-Trac: Graph-Textual Representations Alignment For Cold-Start Recommendations, Li Yang Chang, Yuan Fang, Ming Feng Tsai, Chuan Ju Wang Feb 2026

G-Trac: Graph-Textual Representations Alignment For Cold-Start Recommendations, Li Yang Chang, Yuan Fang, Ming Feng Tsai, Chuan Ju Wang

Research Collection School Of Computing and Information Systems

The cold-start problem remains a significant challenge in recommendation systems, particularly for new users or unseen items with little to no historical data. Existing methods, including graph neural networks, often struggle in such scenarios. Inspired by the success of transformer models in natural language processing, we propose G-TRAC (Graph-Textual Representations Alignment for Cold-start Recommendations), a novel approach that integrates transformer-based textual modeling with graph neural networks. By effectively leveraging both textual and structural information, G-TRAC addresses cold-start challenges more effectively. Extensive experiments demonstrate its ability to enhance recommendation quality and generalize well across diverse scenarios.

Go to article

Vercation: Precise Vulnerable Open-Source Software Version Identification Based On Static Analysis And Llm, Yiran Cheng, Ting Zhang, Lwin Khin Shar, Shouguo Yang, Chaopeng Dong, David Lo, Shichao Lv, Zhiqiang Shi, Limin Sun Feb 2026

Vercation: Precise Vulnerable Open-Source Software Version Identification Based On Static Analysis And Llm, Yiran Cheng, Ting Zhang, Lwin Khin Shar, Shouguo Yang, Chaopeng Dong, David Lo, Shichao Lv, Zhiqiang Shi, Limin Sun

Research Collection School Of Computing and Information Systems

Open-source software (OSS) has experienced a surge in popularity, attributed to its collaborative development model and cost-effective nature. However, the adoption of specific software versions in development projects may introduce security risks when these versions bring along vulnerabilities. Current methods of identifying vulnerable versions typically analyze and extract the code features involved in vulnerability patches using static analysis with pre-defined rules. They then use code clone detection to identify the vulnerable versions. These methods are hindered by imprecision due to (1) the exclusion of vulnerability- irrelevant code in the analysis and (2) the inadequacy of code clone detection. This paper …

Go to article

Efficient Function Orchestration For Large Language Models, Xiaoxia Liu, Peng Di, Cong Li, Jun Sun, Jingyi Wang Feb 2026

Efficient Function Orchestration For Large Language Models, Xiaoxia Liu, Peng Di, Cong Li, Jun Sun, Jingyi Wang

Research Collection School Of Computing and Information Systems

Function calling is a fundamental capability of today's large language models, but sequential function calling posed efficiency problems. Recent studies have proposed to request function calls with parallelism support in order to alleviate this issue. However, they either delegate the concurrent function calls to users for execution which are conversely executed sequentially, or overlook the relations among various function calls, rending limited efficiency. This paper introduces LLMOrch, an advanced framework for automated, parallel function calling in large language models. The key principle behind LLMOrch is to identify an available processor to execute a function call while preventing any single processor …

Go to article

Exploring Jvm Garbage Collector Testing With Event-Coverage, Kai Zheng, Yingquan Zhao, Junjie Chen, Hanmo You, Haoyu Wang, Haoyu Wang, Tianchang Gao Feb 2026

Exploring Jvm Garbage Collector Testing With Event-Coverage, Kai Zheng, Yingquan Zhao, Junjie Chen, Hanmo You, Haoyu Wang, Haoyu Wang, Tianchang Gao

Research Collection School Of Computing and Information Systems

Garbage Collection (GC) in the Java Virtual Machine (JVM) serves as an automatic memory management mechanism, efficiently reclaiming unused memory space in different production scenarios. To optimize JVM performance, developers typically fine-tune the garbage collector by identifying an optimal set of GC configurations for specific scenarios. Despite the sophisticated design of garbage collectors, they still have the potential for bugs in different settings, and these bugs can result in more severe consequences. Hence, comprehensive testing of these garbage collectors is imperative before their release. Code coverage criteria are typically employed to assess the comprehensiveness of a test suite. However, traditional …

Go to article

Less Is More: Docstring Compression In Code Generation, Guang Yang, Yu Zhou, Wei Cheng, Xiangyu Zhang, Xiang Chen, Terry Yue Zhuo, Xin Zhou, Ke Liu, David Lo, Taolue Chen Feb 2026

Less Is More: Docstring Compression In Code Generation, Guang Yang, Yu Zhou, Wei Cheng, Xiangyu Zhang, Xiang Chen, Terry Yue Zhuo, Xin Zhou, Ke Liu, David Lo, Taolue Chen

Research Collection School Of Computing and Information Systems

The widespread use of Large Language Models (LLMs) in software engineering has intensified the need for improved model and resource efficiency. In particular, for neural code generation, LLMs are used to translate function/method signature and DocString to executable code. DocStrings, which capture user requirements for the code and are typically used as the prompt for LLMs, often contain redundant information. Recent advancements in prompt compression have shown promising results in Natural Language Processing (NLP), but their applicability to code generation remains uncertain. Our empirical study shows that the state-ofthe-art prompt compression methods achieve only about 10% reduction, as further reductions …

Go to article

Constrained Pricing In Logit-Based Revenue Management, Qian Shao, Tien Mai, Shih-Fen Cheng Feb 2026

Constrained Pricing In Logit-Based Revenue Management, Qian Shao, Tien Mai, Shih-Fen Cheng

Research Collection School Of Computing and Information Systems

We consider a dynamic pricing problem in network revenue management in which customer behavior is predicted by a choice model, that is, the multinomial logit model. The problem, even in the static setting (i.e., customer demand remains unchanged over time), is highly nonconcave in prices. Existing studies mostly rely on the observation that the objective function is concave in terms of purchasing probabilities, implying that the static pricing problem with linear constraints on purchasing probabilities can be efficiently solved. However, this approach is limited in handling constraints on prices, noting that such constraints could be highly relevant in some real …

Go to article

Fcghunter: Towards Evaluating Robustness Of Graph-Based Android Malware Detection, Shiwen Song, Xiaofei Xie, Ruitao Feng, Qi Guo, Sen Chen Feb 2026

Fcghunter: Towards Evaluating Robustness Of Graph-Based Android Malware Detection, Shiwen Song, Xiaofei Xie, Ruitao Feng, Qi Guo, Sen Chen

Research Collection School Of Computing and Information Systems

Graph-based detection methods leveraging Function Call Graph (FCG) have shown promise for Android malware detection (AMD) due to their semantic insights. However, the deployment of malware detectors in dynamic and hostile environments raises significant concerns about their robustness. While recent approaches evaluate the robustness of FCG-based detectors using adversarial attacks, their effectiveness is constrained by the vast perturbation space, particularly across diverse models and features. To address these challenges, we introduce FCGHunter, a novel robustness testing framework for FCG-based AMD systems. Specifically, FCGHunter employs innovative techniques to enhance exploration and exploitation within this huge search space. Initially, it identifies critical …

Go to article

Quantum Chebyshev Transform-Based Graph Neural Networks For Financial Fraud Detection, Minrui Xu, Bingyan Guan, Bethel Hui Ting Loke, Paul R. Griffin Feb 2026

Quantum Chebyshev Transform-Based Graph Neural Networks For Financial Fraud Detection, Minrui Xu, Bingyan Guan, Bethel Hui Ting Loke, Paul R. Griffin

Research Collection School Of Computing and Information Systems

Financial fraud detection is a critical challenge requiring accurate identification of anomalous patterns in complex transaction networks. Graph Neural Networks (GNNs) have emerged as powerful tools for fraud detection by capturing relational structures among entities. Meanwhile, quantum computing offers new possibilities to enhance machine learning through high-dimensional Hilbert spaces and parallelism. In this paper, we propose a hybrid classical-quantum model called QCTGNN (Quantum Chebyshev Transform-based Graph Neural Network) for financial fraud detection. The QCTGNN integrates a classical graph neural network component based on Simplified Graph Convolutions (SGConv) with a quantum component that performs a Chebyshev polynomial-based transform via variational quantum …

Go to article

Lagrangian Motion Fields For Long-Term Motion Generation, Yifei Yang, Zikai Huang, Chenshu Xu, Shengfeng He Feb 2026

Lagrangian Motion Fields For Long-Term Motion Generation, Yifei Yang, Zikai Huang, Chenshu Xu, Shengfeng He

Research Collection School Of Computing and Information Systems

Long-term motion generation is a challenging task that requires producing coherent and realistic sequences over extended durations. Current methods primarily rely on framewise motion representations, which capture only static spatial details and overlook temporal dynamics. This approach leads to significant redundancy across the temporal dimension, complicating the generation of effective long-term motion. To overcome these limitations, we introduce the novel concept of Lagrangian Motion Fields, specifically designed for long-term motion generation. By treating each joint as a Lagrangian particle with uniform velocity over short intervals, our approach condenses motion representations into a series of "supermotions" (analogous to superpixels). This method …

Go to article

Zero-Shot Video Translation Via Token Warping, Haiming Zhu, Yangyang Xu, Jun Yu, Shengfeng He Feb 2026

Zero-Shot Video Translation Via Token Warping, Haiming Zhu, Yangyang Xu, Jun Yu, Shengfeng He

Research Collection School Of Computing and Information Systems

With the revolution of generative AI, video-related tasks have been widely studied. However, current state-of-the-art video models still lag behind image models in visual quality and user control over generated content. In this paper, we introduce TokenWarping, a novel framework for temporally coherent video translation. Existing diffusion-based video editing approaches rely solely on key and value patches in self-attention to ensure temporal consistency, often sacrificing the preservation of local and structural regions. Critically, these methods overlook the significance of the query patches in achieving accurate feature aggregation and temporal coherence. In contrast, TokenWarping leverages complementary token priors by constructing temporal …

Go to article

Light Cone Cancellation For Variational Quantum Eigensolver In Solving Noisy Max-Cut, Xinwei Lee, Xinjian Yan, Ningyi Xie, Yoshiyuki Saito, Leo Kurosawa, Nobuyoshi Asai, Dongsheng Cai, Hoong Chuin Lau Feb 2026

Light Cone Cancellation For Variational Quantum Eigensolver In Solving Noisy Max-Cut, Xinwei Lee, Xinjian Yan, Ningyi Xie, Yoshiyuki Saito, Leo Kurosawa, Nobuyoshi Asai, Dongsheng Cai, Hoong Chuin Lau

Research Collection School Of Computing and Information Systems

Variational Quantum Eigensolver (VQE) is a quantum-classical hybrid algorithm used to estimate the ground energy of a given Hamiltonian. It consists of a parameterized quantum circuit, which the parameters are optimized using a classical optimizer. With the increasing need in solving large-scale problems in real-world applications, solving those large problems with fewer qubits and fewer gates becomes essential, so that we reduce the simulation difficulty and mitigate the effect of noise in real quantum hardware. In this study, we applied the Light Cone Cancellation (LCC) method to reduce the number of qubits and gates required in a two-local ansatz. LCC …

Go to article

Grounding Is All You Need? Dual Temporal Grounding For Video Dialog, You Qin, Wei Ji, Xinze Lan, Hao Fei, Xun Yang, Dan Guo, Roger Zimmermann, Lizi Liao Feb 2026

Grounding Is All You Need? Dual Temporal Grounding For Video Dialog, You Qin, Wei Ji, Xinze Lan, Hao Fei, Xun Yang, Dan Guo, Roger Zimmermann, Lizi Liao

Research Collection School Of Computing and Information Systems

In the realm of video dialog response generation, capturing both the essence of video content and the temporal nuances of conversation history is crucial. While some approaches rely on large-scale pretrained visual-language models, often neglecting temporal dynamics, others emphasize spatial-temporal relationships within videos but demand intricate object trajectory pre-extractions and overlook dialog temporal dynamics. This paper introduces the Dual Temporal Grounding-enhanced Video Dialog model (DTGVD), designed to bridge the gap between these two approaches. DTGVD uniquely integrates the strengths of both by emphasizing dual temporal relationships. It achieves this by predicting dialog turn-specific temporal regions, selectively filtering video content, and …

Go to article

Learnable Game-Theoretic Policy Optimization For Data-Centric Self-Explanation Rationalization, Yunxiao Zhao, Zhiqiang Wang, Xingtong Yu, Xiaoli Li, Jiye Liang, Ru Li Feb 2026

Learnable Game-Theoretic Policy Optimization For Data-Centric Self-Explanation Rationalization, Yunxiao Zhao, Zhiqiang Wang, Xingtong Yu, Xiaoli Li, Jiye Liang, Ru Li

Research Collection School Of Computing and Information Systems

Rationalization, a data-centric framework, aims to build self-explanatory models to explain the prediction outcome by generating a subset of human-intelligible pieces of the input data. It involves a cooperative game model where a generator generates the most human-intelligible parts of the input (i.e., rationales), followed by a predictor that makes predictions based on these generated rationales. Conventional rationalization methods typically impose constraints via regularization terms to calibrate or penalize undesired generation. However, these methods are suffering from a problem called mode collapse, in which the predictor produces correct predictions yet the generator consistently outputs rationales with collapsed patterns. Moreover, existing …

Go to article

The Gains Do Not Make Up For The Losses: A Comprehensive Evaluation For Safety Alignment Of Large Language Models Via Machine Unlearning, Weixiang Zhao, Yulin Hu, Xingyu Sui, Zhuojun Li, Yang Deng, Yanyan Zhao, Bing Qin, Wanxiang Che Feb 2026

The Gains Do Not Make Up For The Losses: A Comprehensive Evaluation For Safety Alignment Of Large Language Models Via Machine Unlearning, Weixiang Zhao, Yulin Hu, Xingyu Sui, Zhuojun Li, Yang Deng, Yanyan Zhao, Bing Qin, Wanxiang Che

Research Collection School Of Computing and Information Systems

Machine Unlearning (MU) has emerged as a promising technique for aligning large language models (LLMs) with safety requirements to steer them forgetting specific harmful contents. Despite the significant progress in previous studies, we argue that the current evaluation criteria, which solely focus on safety evaluation, are actually impractical and biased, leading to concerns about the true effectiveness of MU techniques. To address this, we propose to comprehensively evaluate LLMs after MU from three aspects: safety, over-safety, and general utility. Specifically, a novel benchmark MuBench with 18 related datasets is first constructed, where the safety is measured with both vanilla harmful …

Go to article

Design Principles For Customer-Engaging Digital Service Systems: An Action Research Study, Keng Leng Siau, Xiaofeng Chen, Xin Tan Jan 2026

Design Principles For Customer-Engaging Digital Service Systems: An Action Research Study, Keng Leng Siau, Xiaofeng Chen, Xin Tan

Research Collection School Of Computing and Information Systems

Digital services represent a business approach employed by organizations to operate in the digital environment. However, systematic development guidelines for developing quality digital service systems are lacking in the literature. The authors identified four general challenges for developing and implementing customer-engaging digital service systems (CEDSS). By employing the method of canonical action research in a digital service system project, they derived 10 design principles for developing high-quality CEDSS. They empirically evaluated the design principles in the development project and through follow-up focus group sessions. The design principles provide applicable and actionable guidelines for the development of CEDSS.

Go to article

Choice-Based Crowdshipping For Next-Day Delivery Services: A Dynamic Task Display Problem, Alp Arslan, Firat Kilci, Shih-Fen Cheng, Archan Misra Jan 2026

Choice-Based Crowdshipping For Next-Day Delivery Services: A Dynamic Task Display Problem, Alp Arslan, Firat Kilci, Shih-Fen Cheng, Archan Misra

Research Collection School Of Computing and Information Systems

This paper studies integrating the crowd workforce into next-day home delivery services. In this setting, both crowd drivers and contract drivers collaborate in making deliveries. Crowd drivers have limited capacity and can choose not to deliver if the presented tasks do not align with their preferences. The central question addressed is: How can the platform minimize the total task fulfilment cost, which includes payouts to crowd drivers and additional payouts to contract drivers for delivering the unselected tasks by customizing task displays to crowd drivers? To tackle this problem, we formulate it as a finite-horizon Stochastic Decision Problem, capturing crowd …

Go to article

Reinforce Trustworthiness In Multimodal Emotional Support System, Huy M. Le, Dat Tien Nguyen, Ngan T. T. Vo, Tuan D. Q. Nguyen, Nguyen Le Binh, Duy Minh Ho Nguyen, Daniel Sonntag, Lizi Liao, Binh T. Nguyen Jan 2026

Reinforce Trustworthiness In Multimodal Emotional Support System, Huy M. Le, Dat Tien Nguyen, Ngan T. T. Vo, Tuan D. Q. Nguyen, Nguyen Le Binh, Duy Minh Ho Nguyen, Daniel Sonntag, Lizi Liao, Binh T. Nguyen

Research Collection School Of Computing and Information Systems

In today's world, emotional support is increasingly essential, yet it remains challenging for both those seeking help and those offering it. Multimodal approaches to emotional support show great promise by integrating diverse data sources to provide empathetic, contextually relevant responses, fostering more effective interactions. However, current methods have notable limitations, often relying solely on text or converting other data types into text, or providing emotion recognition only, thus overlooking the full potential of multimodal inputs. Moreover, many studies prioritize response generation without accurately identifying critical emotional support elements or ensuring the reliability of outputs. To overcome these issues, we introduce …

Go to article

Towards Secure Program Partitioning For Smart Contracts With Llm’S In-Context Learning, Ye Liu, Yuqing Niu, Chengyan Ma, Ruidong Han, Wei Ma, Yi Li, Debin Gao, David Lo Jan 2026

Towards Secure Program Partitioning For Smart Contracts With Llm’S In-Context Learning, Ye Liu, Yuqing Niu, Chengyan Ma, Ruidong Han, Wei Ma, Yi Li, Debin Gao, David Lo

Research Collection School Of Computing and Information Systems

Smart contracts are highly susceptible to manipulation attacks due to the leakage of sensitive information. Addressing manipulation vulnerabilities is particularly challenging because they stem from inherent data confidentiality issues rather than straightforward implementation bugs. To tackle this by preventing sensitive information leakage, we present PARTITIONGPT, the first LLM-driven approach that combines static analysis with the in-context learning capabilities of large language models (LLMs) to partition smart contracts into critical (privileged) and normal codebases, guided by a few annotated sensitive data variables. We evaluated PARTITIONGPT on 18 annotated smart contracts containing 99 sensitive functions. The results demonstrate that PARTITIONGPT successfully generates …

Go to article

Qualitative Study For Llm-Assisted Design Study Process: Strategies, Challenges, And Roles, Shaolun Ruan, Rui Sheng, Xiaolin Wen, Jiachen Wang, Tianyi Zhang, Yong Wang, Tim Dwyer, Jiannan Li Jan 2026

Qualitative Study For Llm-Assisted Design Study Process: Strategies, Challenges, And Roles, Shaolun Ruan, Rui Sheng, Xiaolin Wen, Jiachen Wang, Tianyi Zhang, Yong Wang, Tim Dwyer, Jiannan Li

Research Collection School Of Computing and Information Systems

Design studies aim to develop visualization solutions for real-world problems across various application domains. Recently, the emergence of large language models (LLMs) has introduced new opportunities to enhance the design study process, providing capabilities such as creative problem-solving, data handling, and insightful analysis. However, despite their growing popularity, there remains a lack of systematic understanding of how LLMs can effectively assist researchers in visualization-specific design studies. In this paper, we conducted a rnulti-stage qualitative study to fill this gap, which involved 30 design study researchers from diverse backgrounds and expertise levels. Through in-depth interviews and carefully-designed questionnaires, we investigated strategies …

Go to article

Artem: Enhancing Large Language Model Agents With Spatial-Temporal Episodic Memory, Cassandra Hui Ming Tan, Budhitama Subagdja, Ah-Hwee Tan Jan 2026

Artem: Enhancing Large Language Model Agents With Spatial-Temporal Episodic Memory, Cassandra Hui Ming Tan, Budhitama Subagdja, Ah-Hwee Tan

Research Collection School Of Computing and Information Systems

Current large language models (LLMs) exhibit significant deficiencies in episodic memory tasks including encoding, storing, and retrieving specific information from temporally dependent events over a long period of time. Recent approaches to handle memory tasks in LLMs, such as in-context learning, retrieval-augmented generation (RAG), and fine-tuning, may resolve the long-term retention issues, but are still inadequate to handle tasks requiring chronological awareness of the stored information. We introduce Agentic Retrieval with Temporal-Episodic Memory (ARTEM), a hybrid LLM-based agent architecture integrating LLMs with a self-organizing neural network named Spatial-Temporal Episodic Memory (STEM), designed to handle episodic memory tasks. Our approach employs …

Go to article

A Case Study Of Gender And Online Team Communication In Software Engineering Education, Rita Garcia, Christoph Treude Jan 2026

A Case Study Of Gender And Online Team Communication In Software Engineering Education, Rita Garcia, Christoph Treude

Research Collection School Of Computing and Information Systems

Collaboration is crucial in Software Engineering (SE), yet factors like gender bias can shape team dynamics and behaviours. This descriptive case study examines an eight-week project involving 39 SE students across eight teams contributing to GitHub projects. Focusing on gender, we used a mixed-methods approach to analyse Slack communications, identifying gender differences in how students respond to initiated communications and comparing how students’ communications influenced other aspects of students’ performance, including learning gains. We found higher help-seeking and leadership behaviours in the all-woman team involved in this case study, while men responded more slowly. Although communication did not directly affect …

Go to article

Gig Worker Social Referrals On An On-Demand Food Delivery Platform, Hai Wang, Hao Sun, Peter Zhang Jan 2026

Gig Worker Social Referrals On An On-Demand Food Delivery Platform, Hai Wang, Hao Sun, Peter Zhang

Research Collection School Of Computing and Information Systems

Social referral programs are commonly used by online labor platforms to incentivize labor supply by rewarding existing workers for successful referrals. This study investigates the impact of such programs on gig workers' labor supply in online labor platforms using data from an on-demand food delivery platform in Singapore. In particular, we analyze how gig workers' past labor supply and referral behavior influence the generation and value of social referrals. This research offers insights into the mechanisms that drive labor supply dynamics in the gig economy and highlights the effectiveness of social referral programs for shaping worker behavior and enhancing platform …

Go to article

Compendia: Automated Visual Storytelling Generation From Online Article Collection, Manusha Imesh Karunathilaka Gamage Vidana, Litian Lei, Yiming Gao, Yong Wang, Jiannan Li Jan 2026

Compendia: Automated Visual Storytelling Generation From Online Article Collection, Manusha Imesh Karunathilaka Gamage Vidana, Litian Lei, Yiming Gao, Yong Wang, Jiannan Li

Research Collection School Of Computing and Information Systems

In the digital age, readers value quantitative journalism that is clear, concise, analytical, and humancentred. To understand complex topics, they often piece together scattered facts from multiple articles. Visual storytelling can transform fragmented information into clear, engaging narratives, yet its use with unstructured online articles remains largely unexplored. To fill this gap, we present Compendia, an automated system that analyzes online articles in response to a user’s query and generates a coherent data story tailored to the user’s informational needs. Compendia addresses key challenges of storytelling from unstructured text through two modules covering: Online Article Retrieval, which gathers relevant articles; …

Go to article

Editorial: Special Section On Challenges And Opportunities In Retrieval-Augmented Generation For Llms: Techniques, Trends, And Applications, Philip S. Yu, Haofen Wang, Feida Zhu Jan 2026

Editorial: Special Section On Challenges And Opportunities In Retrieval-Augmented Generation For Llms: Techniques, Trends, And Applications, Philip S. Yu, Haofen Wang, Feida Zhu

Research Collection School Of Computing and Information Systems

Retrieval-Augmented Generation (RAG) represents a transformative advancement for Large Language Models (LLMs) by integrating external knowledge to substantially improve accuracy and mitigate hallucinations. As a pivotal technology in the contemporary generative Artificial Intelligence (AI) landscape, RAG addresses fundamental challenges in knowledge-intensive tasks. This special issue serves as a dedicated platform to showcase these cutting-edge advancements. It features six rigorously peer-reviewed papers that present state-of-the-art research and applications in the rapidly evolving field of RAG.

Go to article

Clique Annealing: Semi-Supervised Community Detection Under Crystallization Kinetics, Ling Cheng, Jiashu Pu, Ruicheng Liang, Qian Shao, Hezhe Qiao, Feida Zhu Jan 2026

Clique Annealing: Semi-Supervised Community Detection Under Crystallization Kinetics, Ling Cheng, Jiashu Pu, Ruicheng Liang, Qian Shao, Hezhe Qiao, Feida Zhu

Research Collection School Of Computing and Information Systems

Semi-supervised community detection seeks to find a specified community type when only few communities are labeled. Existing "select-then-refine" pipelines often start from mis-aligned cores and rely on Reinforcement-Learning or Generative Adversarial Network, increasing computational cost and limiting scalability. We address these issues with a unified energy framework under crystallization kinetics that jointly models energy, structure, and growth. Based on this perspective, we propose CLique ANNealing (CLANN), which first employs Nucleus Proposer to select candidate clique as community core under four physics-inspired criteria. A learning-free Transitive Annealer then iteratively merges neighboring cliques and repositions the nucleus, enabling spontaneous, scalable community growth. …

Go to article

First Prev Next Last