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

Digital Commons Network™

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

Computer Sciences

Institution
Keyword
Publication Year
Publication
Publication Type
File Type

Articles 3721 - 3750 of 63167

Full-Text Articles in Entire DC Network

Advancing Academic Advising With Knowledge Graphs: Integrating Machine Learning And Llms For Personalized Course Planning, Sara Alshamsi Jun 2025

Advancing Academic Advising With Knowledge Graphs: Integrating Machine Learning And Llms For Personalized Course Planning, Sara Alshamsi

Theses

Academic advising plays a critical role in helping students make informed decisions, improve academic performance, and successfully navigate their university journey. However, with increasing university enrollment, traditional advising methods often struggle to scale, leading to student frustration and overburdened advisors. Additionally, designing course offerings that match student demand is a complex and error-prone process involving multiple stakeholders. To address these challenges, this thesis proposes an automated, data-driven system for generating personalized academic plans for students. The primary aim of this thesis is to develop a system that reduces students’ dependency on advisors while simultaneously providing accurate estimates of course demand …

Go to article

On Lexicographic Proof Rules For Probabilistic Termination, Krishnendu Chatterjee, Ehsan Kafshdar Goharshady, Petr Novotný, Jiří Zárevucký, Dorde Zikelic Jun 2025

On Lexicographic Proof Rules For Probabilistic Termination, Krishnendu Chatterjee, Ehsan Kafshdar Goharshady, Petr Novotný, Jiří Zárevucký, Dorde Zikelic

Research Collection School Of Computing and Information Systems

We consider the almost-sure (a.s.) termination problem for probabilistic programs, which are a stochastic extension of classical imperative programs. Lexicographic ranking functions provide a sound and practical approach for termination of non-probabilistic programs, and their extension to probabilistic programs is achieved via lexicographic ranking supermartingales (LexRSMs). However, LexRSMs introduced in the previous work have a limitation that impedes their automation: all of their components have to be non-negative in all reachable states. This might result in a LexRSM not existing even for simple terminating programs. Our contributions are twofold. First, we introduce a generalization of LexRSMs that allows for some …

Go to article

Building Narratives And Probing Concepts: Preparing Materials For Co-Design With Autistic Livestreamers, Terrance Mok, Tyson Hartley, Anthony Tang, Adam Mccrimmon, Lora Oehlberg Jun 2025

Building Narratives And Probing Concepts: Preparing Materials For Co-Design With Autistic Livestreamers, Terrance Mok, Tyson Hartley, Anthony Tang, Adam Mccrimmon, Lora Oehlberg

Research Collection School Of Computing and Information Systems

Based on ten semi-structured interviews with autistic Twitch streamers, we introduce a series of scenario-based design narratives coupled with technology design concepts as a starting point for co-design discussion about autistic streaming. This work builds on prior thematic analysis of the unique intersection between autism and livestreaming. Our user-centered scenarios highlight the needs, goals, and challenges of autistic individuals in livestreaming contexts. By using evocative narratives, the scenarios serve to facilitate empathy and deeper engagement with the needs of autistic users, and help facilitate and support co-creative dialogues and discussions about new technology designs. We contribute this starting point for …

Go to article

Meta-Learning Hyperparameters For Foundation Model Adaptation In Remote-Sensing Imagery, Zichen Tian, Yaoyao Liu, Qianru Sun Jun 2025

Meta-Learning Hyperparameters For Foundation Model Adaptation In Remote-Sensing Imagery, Zichen Tian, Yaoyao Liu, Qianru Sun

Research Collection School Of Computing and Information Systems

Training large foundation models of remote-sensing (RS) images is almost impossible due to the limited and long-tailed data problems. Fine-tuning natural image pre-trained models on RS images is a straightforward solution. To reduce computational costs and improve performance on tail classes, existing methods apply parameter-efficient fine-tuning (PEFT) techniques, such as LoRA and AdaptFormer. However, we observe that fixed hyperparameters -- such as intra-layer positions, layer depth, and scaling factors, can considerably hinder PEFT performance, as fine-tuning on RS images proves highly sensitive to these settings. To address this, we propose MetaPEFT, a method incorporating adaptive scalers that dynamically adjust module …

Go to article

Irhunter: Universal Detection Of Instruction Reordering Vulnerabilities For Enhanced Concurrency In Distributed And Parallel Systems, Guohua Xin, Guangquan Xu, Yao Zhang, Cheng Wen, Cen Zhang, Xiaofei Xie, Neal N. Xiong, Shaoying Liu, Pan Gao Jun 2025

Irhunter: Universal Detection Of Instruction Reordering Vulnerabilities For Enhanced Concurrency In Distributed And Parallel Systems, Guohua Xin, Guangquan Xu, Yao Zhang, Cheng Wen, Cen Zhang, Xiaofei Xie, Neal N. Xiong, Shaoying Liu, Pan Gao

Research Collection School Of Computing and Information Systems

Instruction reordering is an essential optimization technique used in both compilers and multi-core processors to enhance parallelism and resource utilization. Although the original intent of this technique is to benefit the program, some improper reordering can significantly impact the program correctness, which we call instruction reordering vulnerability (IRV). However, existing methods detect IRV by defining CPU instruction reordering rules to schedule execution paths while neglecting compiler reordering, and thus generate false positives that require manual filtering and resulting in inefficiency. To bridge this gap, in this paper, we propose the IRV detection method, , which analyzes IRV characteristics and extracts …

Go to article

Chatgpt’S Performance Evaluation In Spreadsheets Modeling To Inform Assessments Redesign, Michelle L. F. Cheong Jun 2025

Chatgpt’S Performance Evaluation In Spreadsheets Modeling To Inform Assessments Redesign, Michelle L. F. Cheong

Research Collection School Of Computing and Information Systems

Background: Increasingly, students are using ChatGPT to assist them in learning and even completing their assessments, raising concerns of academic integrity and loss of critical thinking skills. Many articles suggested educators to redesign assessments which are more “Generative-AI-resistant” and to focus on assessing students on higher order thinking skills. However, there is a lack of articles that attempt to quantify assessments at different cognitive levels to provide empirical study insights on ChatGPT’s performance at different levels, which will affect how educators redesign their assessments.Objectives: Educators need new information on how well ChatGPT performs to redesign future assessments to assess their …

Go to article

On-Demand Heterogeneous Drone Delivery Problem, Xupeng Wen, Zhiguang Cao, Shu Xu, Dapeng Ren, Guohua Wu, Yaoxin Wu Jun 2025

On-Demand Heterogeneous Drone Delivery Problem, Xupeng Wen, Zhiguang Cao, Shu Xu, Dapeng Ren, Guohua Wu, Yaoxin Wu

Research Collection School Of Computing and Information Systems

In the on-demand problem domain, actual demand frequently deviates from the expected demand. This paper intricately delves into the exploration of on-demand heterogeneous multi-drone routing problem (ODHDRP), in which a transport drone carries multiple terminal drones to subregions in the first echelon, and the terminal drones deliver parcels during a flight trip to customers with demands in subregions to maintain economies of scale in the second echelon. We formulate the customer demands using a normal distribution, and exploit a reliability model of customer demands with chance constraints. To solve the ODHDRP efficiently, we propose a hybrid iterative optimisation heuristic (HIOH) …

Go to article

Outperforming The Best With Minimal Effort: Algorithm Selection For Constrained Multi-Objective Optimization, Mustafa Misir, Aldy Gunawan Jun 2025

Outperforming The Best With Minimal Effort: Algorithm Selection For Constrained Multi-Objective Optimization, Mustafa Misir, Aldy Gunawan

Research Collection School Of Computing and Information Systems

The present study performs algorithm selection on a suite of optimization algorithms targeting the constrained multi-objective optimization problems. The idea is to utilize the existing, relevant algorithmic experience in the literature to deliver an improved solver with limited effort. The reason being that algorithm development, in general, is a challenging and time-consuming process, especially with the goal of outperforming the existing methods from varying perspectives such as performance, speed, and robustness. Concerning the multi-objective optimization problems, the required development efforts happen to be even harder than addressing the single-objective ones. Furthermore, referring to the fact that the number of candidate …

Go to article

Alayadb: The Data Foundation For Efficient And Effective Long-Context Llm Inference, Yangshen Deng, Zhengxin You, Long Xiang, Qilong Li, Peiqi Yuan, Zhaoyang Hong, Yitao Zheng, Wanting Li, Runzhong Li, Haotian Liu, Kyriakos Mouratidis, Man Lung Yiu, Huan Li, Qiaomu Shen, Rui Mao, Bo Tang Jun 2025

Alayadb: The Data Foundation For Efficient And Effective Long-Context Llm Inference, Yangshen Deng, Zhengxin You, Long Xiang, Qilong Li, Peiqi Yuan, Zhaoyang Hong, Yitao Zheng, Wanting Li, Runzhong Li, Haotian Liu, Kyriakos Mouratidis, Man Lung Yiu, Huan Li, Qiaomu Shen, Rui Mao, Bo Tang

Research Collection School Of Computing and Information Systems

AlayaDB is a cutting-edge vector database system natively architected for efficient and effective long-context inference for Large Language Models (LLMs) at AlayaDB AI. Specifically, it decouples the KV cache and attention computation from the LLM inference systems, and encapsulates them into a novel vector database system. For the Model as a Service providers (MaaS), AlayaDB consumes fewer hardware resources and offers higher generation quality for various workloads with different kinds of Service Level Objectives (SLOs), when compared with the existing alternative solutions (e.g., KV cache disaggregation, retrieval-based sparse attention). The crux of AlayaDB is that it abstracts the attention computation …

Go to article

Contested: Consistency-Aided Tested Code Generation With Llm, Jinhao Dong, Jun Sun, Wenjie Zhang, Jinsong Dong, Dan Hao Jun 2025

Contested: Consistency-Aided Tested Code Generation With Llm, Jinhao Dong, Jun Sun, Wenjie Zhang, Jinsong Dong, Dan Hao

Research Collection School Of Computing and Information Systems

Recent advancements in large language models (LLMs) have significantly improved code generation, which generates code snippets automatically based on natural language requirements. Despite achieving state-of-the-art performance, LLMs often struggle to generate accurate and reliable code, requiring developers to spend substantial effort debugging and evaluating the generated output. Researchers have proposed leveraging Consistency to select code that passes more tests (inter-consistency) and demonstrates consistent behavior across more counterparts (intra-consistency). However, since the tests themselves are also generated by LLMs, relying on majority voting based on incorrect tests leads to unreliable results. To address this, we propose a lightweight interaction framework that …

Go to article

Enhancing Vulnerability Detection Via Inter-Procedural Semantic Completion, Bozhi Wu, Chengjie Liu, Zhiming Li, Yushi Cao, Jun Sun, Shang-Wei Lin Jun 2025

Enhancing Vulnerability Detection Via Inter-Procedural Semantic Completion, Bozhi Wu, Chengjie Liu, Zhiming Li, Yushi Cao, Jun Sun, Shang-Wei Lin

Research Collection School Of Computing and Information Systems

Inspired by advances in deep learning, numerous learning-based approaches for vulnerability detection have emerged, primarily operating at the function level for scalability. However, this design choice has a critical limitation: many vulnerabilities span multiple functions, causing function-level approaches to lose the semantics of called functions and fail to capture true vulnerability patterns. To address this issue, we propose VulnSC, a novel framework designed to enhance learning-based approaches by complementing inter-procedural semantics. VulnSC retrieves the source code of called functions for datasets and leverages large language models (LLMs) with well-designed prompts to generate summaries for these functions. The datasets, enhanced with …

Go to article

Reaccept: Automated Co-Evolution Of Production And Test Code Based On Dynamic Validation And Large Language Models, Jianlei Chi, Xiaotian Wang, Yuhan Huang, Lechen Yu, Di Cui, Jianguo Sun, Jun Sun Jun 2025

Reaccept: Automated Co-Evolution Of Production And Test Code Based On Dynamic Validation And Large Language Models, Jianlei Chi, Xiaotian Wang, Yuhan Huang, Lechen Yu, Di Cui, Jianguo Sun, Jun Sun

Research Collection School Of Computing and Information Systems

Synchronizing production and test code, known as PT co-evolution, is critical for software quality. Given the significant manual effort involved, researchers have tried automating PT co-evolution using predefined heuristics and machine learning models. However, existing solutions are still incomplete. Most approaches only detect and flag obsolete test cases, leaving developers to manually update them. Meanwhile, existing solutions may suffer from low accuracy, especially when applied to real-world software projects. In this paper, we propose ReAccept, a novel approach leveraging large language models (LLMs), retrievalaugmented generation (RAG), and dynamic validation to fully automate PT co-evolution with high accuracy. ReAccept employs an …

Go to article

On-Demand Scenario Generation For Testing Automated Driving Systems, Songyang Yan, Xiaodong Zhang, Kunkun Hao, Haojie Xin, Yonggang Luo, Jucheng Yang, Ming Fan, Chao Yang, Jun Sun, Zijiang Yang Jun 2025

On-Demand Scenario Generation For Testing Automated Driving Systems, Songyang Yan, Xiaodong Zhang, Kunkun Hao, Haojie Xin, Yonggang Luo, Jucheng Yang, Ming Fan, Chao Yang, Jun Sun, Zijiang Yang

Research Collection School Of Computing and Information Systems

The safety and reliability of Automated Driving Systems (ADS) are paramount, necessitating rigorous testing methodologies to uncover potential failures before deployment. Traditional testing approaches often prioritize either natural scenario sampling or safety-critical scenario generation, resulting in overly simplistic or unrealistic hazardous tests. In practice, the demand for natural scenarios (e.g., when evaluating the ADS's reliability in real-world conditions), critical scenarios (e.g., when evaluating safety in critical situations), or somewhere in between (e.g., when testing the ADS in regions with less civilized drivers) varies depending on the testing objectives. To address this issue, we propose the On-demand Scenario Generation (OSG) Framework, …

Go to article

De-Duplicating Silent Compiler Bugs Via Deep Semantic Representation, Junjie Chen, Xingyu Fan, Chen Yang, Shuang Liu, Jun Sun Jun 2025

De-Duplicating Silent Compiler Bugs Via Deep Semantic Representation, Junjie Chen, Xingyu Fan, Chen Yang, Shuang Liu, Jun Sun

Research Collection School Of Computing and Information Systems

The compiler bug duplication problem (where many test failures are caused by the same compiler bug) can lead to huge waste of time and resource in diagnosing test failures produced by compiler testing. It is particularly challenging with regard to the silent compiler bugs that do not produce any error messages. To address this problem, multiple white-box techniques were proposed, but they are inapplicable in many practical scenarios. Black-box techniques are more practical, but the existing ones are less effective as they often rely on irrelevant syntactic information. To bridge this gap, we propose a novel black-box technique (BLADE), which …

Go to article

A Comprehensive Study Of Oop-Related Bugs In C++ Compilers, Bo Wang, Chong Chen, Junjie Chen, Bowen Xu, Chen Ye, Youfang Lin, Guoliang Dong, Jun Sun Jun 2025

A Comprehensive Study Of Oop-Related Bugs In C++ Compilers, Bo Wang, Chong Chen, Junjie Chen, Bowen Xu, Chen Ye, Youfang Lin, Guoliang Dong, Jun Sun

Research Collection School Of Computing and Information Systems

Modern C++, a programming language characterized by its extensive use of object-oriented programming (OOP) features, is widely used for system programming. However, C++ compilers often struggle to correctly handle these sophisticated OOP features, resulting in numerous high-profile compiler bugs that can lead to crashes or miscompilation. Despite the significance of OOP-related bugs, existing studies largely overlook OOP features, hindering their ability to discover such bugs. To assist both compiler fuzzer designers and compiler developers, we conduct a comprehensive study of the compiler bugs caused by incorrectly handling C++ OOP-related features. First, we systematically extract 788 OOP-related C++ compiler bugs from …

Go to article

Lessons Learned From Sandboxing, Piloting And Policy Experimentation With Ai And Other Digital Initiatives: Part 1, Summary Report, Steven M. Miller Jun 2025

Lessons Learned From Sandboxing, Piloting And Policy Experimentation With Ai And Other Digital Initiatives: Part 1, Summary Report, Steven M. Miller

Research Collection School Of Computing and Information Systems

This report, "Lessons Learned from Sandboxing, Piloting and Policy Experimentation with AI and Other Digital Initiatives," captures insights and experiences from project experts involved in recent digital innovation initiatives with the governments of Bangladesh, Maldives, and Kazakhstan, and from project experts actively involved with the use of AI for delivering government digital services in the EU, New Zealand, Rwanda, Singapore, United States, and Uzbekistan. The ten in-depth interview write-ups produced from these nine different country settings provide a small but highly informative sample of rich descriptions of some of the important realities, approaches, nuances, issues and challenges related to testing …

Go to article

Moditector: Module-Directed Testing For Autonomous Driving Systems, Renzhi Wang, Mingfei Cheng, Xiaofei Xie, Yuan Zhou, Lei Ma Jun 2025

Moditector: Module-Directed Testing For Autonomous Driving Systems, Renzhi Wang, Mingfei Cheng, Xiaofei Xie, Yuan Zhou, Lei Ma

Research Collection School Of Computing and Information Systems

Testing Autonomous Driving Systems (ADSs) is crucial for ensuring their safety, reliability, and performance. Despite numerous testing methods available that can generate diverse and challenging scenarios to uncover potential vulnerabilities, these methods often treat ADS as a black-box, primarily focusing on identifying system-level failures like collisions or near-misses without pinpointing the specific modules responsible for these failures. This lack of root causes understanding for the failures hinders effective debugging and subsequent system repair. Furthermore, current approaches often fall short in generating violations that adequately test the individual modules of an ADS from a system-level perspective, such as perception, prediction, planning, …

Go to article

Lessons Learned From Sandboxing, Piloting And Policy Experimentation With Ai And Other Digital Initiatives: Part 2, Ten In-Depth Interviews, Steven M. Miller Jun 2025

Lessons Learned From Sandboxing, Piloting And Policy Experimentation With Ai And Other Digital Initiatives: Part 2, Ten In-Depth Interviews, Steven M. Miller

Research Collection School Of Computing and Information Systems

This report, "Lessons Learned from Sandboxing, Piloting and Policy Experimentation with AI and Other Digital Initiatives," captures insights and experiences from project experts involved in recent digital innovation initiatives with the governments of Bangladesh, Maldives, and Kazakhstan, and from project experts actively involved with the use of AI for delivering government digital services in the EU, New Zealand, Rwanda, Singapore, United States, and Uzbekistan. The ten in-depth interview write-ups produced from these nine different country settings provide a small but highly informative sample of rich descriptions of some of the important realities, approaches, nuances, issues and challenges related to testing …

Go to article

Demystifying Memorization In Llm-Based Program Repair Via A General Hypothesis Testing Framework, Jiaolong Kong, Xiaofei Xie, Shangqing Liu Jun 2025

Demystifying Memorization In Llm-Based Program Repair Via A General Hypothesis Testing Framework, Jiaolong Kong, Xiaofei Xie, Shangqing Liu

Research Collection School Of Computing and Information Systems

Large Language Models (LLMs) have achieved remarkable success in various applications, particularly in code-related tasks such as code generation and program repair, setting new performance benchmarks. However, the extensive use of large training corpora raises concerns about whether these achievements stem from genuine understanding or mere memorization of training data—a question often overlooked in current research. This paper aims to study the memorization issue within LLM-based program repair by investigating whether the correct patches generated by LLMs are the result of memorization. The key challenge lies in the absence of ground truth for confirming memorization, leading to various ad-hoc methods …

Go to article

Cashift: Benchmarking Log-Based Cloud Attack Detection Under Normality Shift, Jiongchi Yu, Xiaofei Xie, Qiang Hu, Bowen Zhang, Ziming Zhao, Yun Lin, Lei Ma, Ruitao Feng, Frank Liau Jun 2025

Cashift: Benchmarking Log-Based Cloud Attack Detection Under Normality Shift, Jiongchi Yu, Xiaofei Xie, Qiang Hu, Bowen Zhang, Ziming Zhao, Yun Lin, Lei Ma, Ruitao Feng, Frank Liau

Research Collection School Of Computing and Information Systems

With the rapid advancement of cloud-native computing, securing cloud environments has become an important task. Log-based Anomaly Detection (LAD) is the most representative technique used in different systems for attack detection and safety guarantee, where multiple LAD methods and relevant datasets have been proposed. However, even though some of these datasets are specifically prepared for cloud systems, they only cover limited cloud behaviors and lack information from a whole-system perspective. Another critical issue to consider is normality shift, which implies that the test distribution could differ from the training distribution and highly affect the performance of LAD. Unfortunately, existing works …

Go to article

Regtrieve: Reducing System-Level Regression Errors For Machine Learning Systems Via Retrieval-Enhanced Ensemble, Junming Cao, Xuwen Xiang, Mingfei Cheng, Bihuan Chen, Xinyan Wang, You Lu, Chaofeng Sha, Xiaofei Xie, Xin Peng Jun 2025

Regtrieve: Reducing System-Level Regression Errors For Machine Learning Systems Via Retrieval-Enhanced Ensemble, Junming Cao, Xuwen Xiang, Mingfei Cheng, Bihuan Chen, Xinyan Wang, You Lu, Chaofeng Sha, Xiaofei Xie, Xin Peng

Research Collection School Of Computing and Information Systems

Multiple machine learning (ML) models are often incorporated into real-world ML systems. However, updating an individual model in these ML systems frequently results in regression errors, where the new model performs worse than the old model for some inputs. While model-level regression errors have been widely studied, little is known about how regression errors propagate at system level. To address this gap, we propose RegTrieve, a novel retrieval-enhanced ensemble approach to reduce regression errors at both model and system level. Our evaluation across various model update scenarios shows that RegTrieve reduces system-level regression errors with almost no impact on system …

Go to article

Hd-Epic: A Highly-Detailed Egocentric Video Dataset, Toby Perrett, Ahmad Darkhalil, Saptarshi Sinha, Omar Emara, Sam Pollard, Kranti Kumar Parida, Kaiting Liu, Prajwal Gatti, Siddhant Bansal, Kevin Flanagan, Jacob Chalk, Zhifan Zhu, Rhodri Guerrier, Fahd Abdelazim, Bin Zhu, Davide Moltisanti, Michael Wray, Hazel Doughty, Dima Damen Jun 2025

Hd-Epic: A Highly-Detailed Egocentric Video Dataset, Toby Perrett, Ahmad Darkhalil, Saptarshi Sinha, Omar Emara, Sam Pollard, Kranti Kumar Parida, Kaiting Liu, Prajwal Gatti, Siddhant Bansal, Kevin Flanagan, Jacob Chalk, Zhifan Zhu, Rhodri Guerrier, Fahd Abdelazim, Bin Zhu, Davide Moltisanti, Michael Wray, Hazel Doughty, Dima Damen

Research Collection School Of Computing and Information Systems

We present a validation dataset of newly-collected kitchenbased egocentric videos, manually annotated with highly detailed and interconnected ground-truth labels covering: recipe steps, fine-grained actions, ingredients with nutritional values, moving objects, and audio annotations. Importantly, all annotations are grounded in 3D through digital twinning of the scene, fixtures, object locations, and primed with gaze. Footage is collected from unscripted recordings in diverse home environments, making HDEPIC the first dataset collected in-the-wild but with detailed annotations matching those in controlled lab environments. We show the potential of our highly-detailed annotations through a challenging VQA benchmark of 26K questions assessing the capability to …

Go to article

Dupin: A Parallel Framework For Densest Subgraph Discovery In Fraud Detection On Massive Graphs, Jiaxin Jiang, Siyuan Yao, Yuchen Li, Qiange Wang, Bingsheng He, Min Chen Jun 2025

Dupin: A Parallel Framework For Densest Subgraph Discovery In Fraud Detection On Massive Graphs, Jiaxin Jiang, Siyuan Yao, Yuchen Li, Qiange Wang, Bingsheng He, Min Chen

Research Collection School Of Computing and Information Systems

Detecting fraudulent activities in financial and e-commerce transaction networks is crucial. One effective method for this is Densest Subgraph Discovery (DSD). However, deploying DSD methods in production systems faces substantial scalability challenges due to the predominantly sequential nature of existing methods, which impedes their ability to handle large-scale transaction networks and results in significant detection delays. To address these challenges, we introduce Dupin, a novel parallel processing framework designed for efficient DSD processing in billion-scale graphs. Dupin is powered by a processing engine that exploits the unique properties of the peeling process, with theoretical guarantees on detection quality and efficiency. …

Go to article

Community Detection In Heterogeneous Information Networks Without Materialization, Jiaxin Jiang, Siyuan Yao, Yuhang Chen, Bingsheng He, Yudong Niu, Yuchen Li, Shixuan Sun, Yongchao Liu Jun 2025

Community Detection In Heterogeneous Information Networks Without Materialization, Jiaxin Jiang, Siyuan Yao, Yuhang Chen, Bingsheng He, Yudong Niu, Yuchen Li, Shixuan Sun, Yongchao Liu

Research Collection School Of Computing and Information Systems

Community detection in heterogeneous information networks (HINs) poses significant challenges due to the diversity of entity types and the complexity of their interrelations. While traditional algorithms may perform adequately in some scenarios, many struggle with the high memory usage and computational demands of large-scale HINs. To address these challenges, we introduce a novel framework, SCAR, which efficiently uncovers community structures in HINs without requiring network materialization. SCAR leverages insights from meta-paths to interpret multi-relational data through compact vertex-based sketches, significantly reducing computational overhead and materialization overhead. We propose a sketch-based technique for estimating changes in modularity, improving both the precision …

Go to article

Unsupervised Recognition Of Unknown Objects For Open-World Object Detection, Ruohuan Fang, Guansong Pang, Wenjun Miao, Xiao Bai, Jin Zheng, Xin Ning Jun 2025

Unsupervised Recognition Of Unknown Objects For Open-World Object Detection, Ruohuan Fang, Guansong Pang, Wenjun Miao, Xiao Bai, Jin Zheng, Xin Ning

Research Collection School Of Computing and Information Systems

Open-world object detection (OWOD) extends object detection problem to a realistic and dynamic scenario, where a detection model is required to be capable of detecting both known and unknown objects and incrementally learning newly introduced knowledge. Current OWOD models detect the unknowns that exhibit similar features to the known objects, but they suffer from a severe label bias problem, i.e., they tend to detect all regions (including unknown object regions) that are dissimilar to the known objects as part of the background. To eliminate the label bias, this article proposes a novel module, namely reconstruction error-based Weibull (REW) model, that …

Go to article

Large Language Model For Vulnerability Detection And Repair: Literature Review And The Road Ahead, Xin Zhou, Sicong Cao, Xiaobing Sun, David Lo Jun 2025

Large Language Model For Vulnerability Detection And Repair: Literature Review And The Road Ahead, Xin Zhou, Sicong Cao, Xiaobing Sun, David Lo

Research Collection School Of Computing and Information Systems

The significant advancements in Large Language Models (LLMs) have resulted in their widespread adoption across various tasks within Software Engineering (SE), including vulnerability detection and repair. Numerous studies have investigated the application of LLMs to enhance vulnerability detection and repair tasks. Despite the increasing research interest, there is currently no existing survey that focuses on the utilization of LLMs for vulnerability detection and repair. In this paper, we aim to bridge this gap by offering a systematic literature review of approaches aimed at improving vulnerability detection and repair through the utilization of LLMs. The review encompasses research work from leading …

Go to article

Collaborative Tree Search For Enhancing Embodied Multi-Agent Collaboration, Lizheng Zu, Lin Lin, Song Fu, Na Zhao, Pan Zhou Jun 2025

Collaborative Tree Search For Enhancing Embodied Multi-Agent Collaboration, Lizheng Zu, Lin Lin, Song Fu, Na Zhao, Pan Zhou

Research Collection School Of Computing and Information Systems

Embodied agents based on large language models (LLMs) face significant challenges in collaborative tasks, requiring effective communication and reasonable division of labor to ensure efficient and correct task completion. Previous approaches with simple communication patterns carry erroneous or incoherent agent actions, which can lead to additional risks. To address these problems, we propose Cooperative Tree Search (CoTS), a framework designed to significantly improve collaborative planning and task execution efficiency among embodied agents. CoTS guides multi-agents to discuss long-term strategic plans within a modified Monte Carlo tree, searching along LLMdriven reward functions to provide a more thoughtful and promising approach to …

Go to article

Keep The Balance: A Parameter-Efficient Symmetrical Framework For Rgb+X Semantic Segmentation, Jiaxin Cai, Jingze Su, Qi Li, Wenjie Yang, Shu Wang, Tiesong Zhao, Shengfeng He, Wenxi Liu Jun 2025

Keep The Balance: A Parameter-Efficient Symmetrical Framework For Rgb+X Semantic Segmentation, Jiaxin Cai, Jingze Su, Qi Li, Wenjie Yang, Shu Wang, Tiesong Zhao, Shengfeng He, Wenxi Liu

Research Collection School Of Computing and Information Systems

Multimodal semantic segmentation is a critical challenge in computer vision, with early methods suffering from high computational costs and limited transferability due to full fine-tuning of RGB-based pre-trained parameters. Recent studies, while leveraging additional modalities as supplementary prompts to RGB, still predominantly rely on RGB, which restricts the full potential of other modalities. To address these issues, we propose a novel symmetric parameter-efficient fine-tuning framework for multimodal segmentation, featuring with a modality-aware prompting and adaptation scheme, to simultaneously adapt the capabilities of a powerful pre-trained model to both RGB and X modalities. Furthermore, prevalent approaches use the global cross-modality correlations …

Go to article

Group-And-Match Vs. Route-Then-Insert: Order Dispatching In Vehicle-Based Dual Services (Vedus), Yue Lin, Hai Yang, Hai Wang Jun 2025

Group-And-Match Vs. Route-Then-Insert: Order Dispatching In Vehicle-Based Dual Services (Vedus), Yue Lin, Hai Yang, Hai Wang

Research Collection School Of Computing and Information Systems

Rapid urban transportation and delivery demand and relevant resource constraints have driven the need for more efficient vehicle utilization. An innovative concept, “Vehicle-based MultiServices” (VeMuS), is a service model in which a single vehicle offers multiple services simultaneously in an urban mobility system. Similarly, “Vehicle-based Dual Services” (VeDuS) refers to a vehicle that provides two services simultaneously (Sun et al., 2023).

Go to article

Predicting Consumers’ Purchase Intention Of Browsed Products: A Study Based On Eye‑Tracking, Feiyan Jia, Choon Ling Sia, Yani Shi, Fiona Fui-Hoon Nah, Keng Siau Jun 2025

Predicting Consumers’ Purchase Intention Of Browsed Products: A Study Based On Eye‑Tracking, Feiyan Jia, Choon Ling Sia, Yani Shi, Fiona Fui-Hoon Nah, Keng Siau

Research Collection School Of Computing and Information Systems

Predicting consumers’ purchase intention of browsed products enables sellers to implement nuanced promotion strategies to stimulate purchase. But how can we predict consumers’ purchase intention of browsed products? Our research demonstrates that consumers’ eye movement data collected when they browse products can serve this aim. We train and test the prediction model using logistic regression and random forest algorithms. Using data collected in a laboratory experiment, our empirical results show that both algorithms perform much better than a random guess, and the logistic regression performs slightly better than the random forest. Our findings imply that eye movement data enable sellers …

Go to article

First Prev Next Last