Open Access. Powered by Scholars. Published by Universities.®
- Discipline
-
- Physical Sciences and Mathematics (6876)
- Computer Sciences (6868)
- Databases and Information Systems (2875)
- Software Engineering (2164)
- Artificial Intelligence and Robotics (1253)
-
- Engineering (957)
- Numerical Analysis and Scientific Computing (844)
- Information Security (709)
- Graphics and Human Computer Interfaces (627)
- Social and Behavioral Sciences (570)
- Computer Engineering (512)
- Business (461)
- Operations Research, Systems Engineering and Industrial Engineering (418)
- Theory and Algorithms (387)
- Programming Languages and Compilers (333)
- OS and Networks (259)
- Communication (239)
- Social Media (194)
- Public Affairs, Public Policy and Public Administration (186)
- Data Storage Systems (176)
- Transportation (170)
- Education (152)
- Medicine and Health Sciences (140)
- Digital Communications and Networking (123)
- Management Information Systems (98)
- Computer and Systems Architecture (89)
- International and Area Studies (89)
- Asian Studies (88)
- Health Information Technology (83)
- Technology and Innovation (78)
- Keyword
-
- Deep learning (112)
- Machine learning (107)
- Social media (63)
- Data mining (59)
- Reinforcement learning (58)
-
- Artificial intelligence (55)
- Empirical study (55)
- Deep Learning (49)
- Software engineering (49)
- Optimization (47)
- Privacy (47)
- Task analysis (46)
- Cloud computing (45)
- Online learning (45)
- Visualization (45)
- Neural networks (44)
- Security (43)
- Training (43)
- Feature extraction (42)
- Anomaly detection (41)
- Collaboration (41)
- Singapore (41)
- Twitter (41)
- Large Language Models (36)
- Semantics (36)
- Android (35)
- Natural language processing (35)
- Classification (34)
- Machine Learning (33)
- Blockchain (32)
- Publication Year
- File Type
Articles 421 - 450 of 7017
Full-Text Articles in Entire DC Network
Simulating Before Planning: Constructing Intrinsic User World Model For User-Tailored Dialogue Policy Planning, Tao He, Lizi Liao, Ming Liu, Bing Qin
Simulating Before Planning: Constructing Intrinsic User World Model For User-Tailored Dialogue Policy Planning, Tao He, Lizi Liao, Ming Liu, Bing Qin
Research Collection School Of Computing and Information Systems
Recent advancements in dialogue policy planning have focused on optimizing system agent policies to achieve predefined goals, emphasizing strategy design, trajectory acquisition, and training efficiency. However, these approaches often overlook the critical role of user characteristics, which are essential in real-world scenarios like conversational search and recommendation, where interactions must adapt to individual user traits such as personality, preferences, and goals. To address this gap, we conduct a comprehensive study using task-specific user personas to evaluate dialogue policy planning under diverse user behaviors. Our analysis, based on these user profiles, reveals significant shortcomings in existing approaches, underscoring the necessity for …
Rustmap: Towards Project-Scale C-To-Rust Migration Via Program Analysis And Llm, Xuemeng Cai, Jiakun Liu, Xiping Huang, Yijun Yu, Haitao Wu, Chunmiao Li, Bo Wang, Imam Nur Bani Yusuf, Lingxiao Jiang
Rustmap: Towards Project-Scale C-To-Rust Migration Via Program Analysis And Llm, Xuemeng Cai, Jiakun Liu, Xiping Huang, Yijun Yu, Haitao Wu, Chunmiao Li, Bo Wang, Imam Nur Bani Yusuf, Lingxiao Jiang
Research Collection School Of Computing and Information Systems
Migrating existing C programs into Rust is increasingly desired, as Rust offers superior memory safety while maintaining C’s high performance. Existing automated translation tools, such as C2Rust, may rely too much on syntactic, template-based translation and generate unsafe Rust code that is hard for human developers to read, maintain, or even compile. More semantic-aware translation that produces safer, idiomatic, and runnable Rust code is much needed. This paper introduces a novel dependency-guided and large language model (LLM)-based C-to-Rust translation approach, RustMap, based on three key ideas: (1) Utilize LLM’s capabilities to produce idiomatic Rust code from given small pieces of …
Retrieval Augmented Generation For Dynamic Graph Modeling, Yuxia Wu, Lizi Liao, Yuan Fang
Retrieval Augmented Generation For Dynamic Graph Modeling, Yuxia Wu, Lizi Liao, Yuan Fang
Research Collection School Of Computing and Information Systems
Modeling dynamic graphs, such as those found in social networks, recommendation systems, and e-commerce platforms, is crucial for capturing evolving relationships and delivering relevant insights over time. Traditional approaches primarily rely on graph neural networks with temporal components or sequence generation models, which often focus narrowly on the historical context of target nodes. This limitation restricts the ability to adapt to new and emerging patterns in dynamic graphs. To address this challenge, we propose a novel framework, Retrieval-Augmented Generation for Dy namic Graph modeling (RAG4DyG ), which enhances dynamic graph predictions by incorporating contextually and temporally relevant examples from broader …
Robust Relevance Feedback For Interactive Known-Item Video Search, Zhixin Ma, Chong-Wah Ngo
Robust Relevance Feedback For Interactive Known-Item Video Search, Zhixin Ma, Chong-Wah Ngo
Research Collection School Of Computing and Information Systems
Known-item search (KIS) involves only a single search target, making relevance feedback-typically a powerful technique for efficiently identifying multiple positive examples to infer user intent-inapplicable. PicHunter addresses this issue by asking users to select the top-k most similar examples to the unique search target from a displayed set. Under ideal conditions, when the user's perception aligns closely with the machine's perception of similarity, consistent and precise judgments can elevate the target to the top position within a few iterations. However, in practical scenarios, expecting users to provide consistent judgments is often unrealistic, especially when the underlying embedding features used for …
Learning Spatio-Temporal Dynamics For Trajectory Recovery Via Time-Aware Transformer, Tian Sun, Yuqi Chen, Baihua Zheng, Weiwei Sun
Learning Spatio-Temporal Dynamics For Trajectory Recovery Via Time-Aware Transformer, Tian Sun, Yuqi Chen, Baihua Zheng, Weiwei Sun
Research Collection School Of Computing and Information Systems
In real-world applications, GPS trajectories often suffer from low sampling rates, with large and irregular intervals between consecutive GPS points. This sparse characteristic presents challenges for their direct use in GPS-based systems. This paper addresses the task of map-constrained trajectory recovery, aiming to enhance trajectory sampling rates of GPS trajectories. Previous studies commonly adopt a sequence-to-sequence framework, where an encoder captures the trajectory patterns and a decoder reconstructs the target trajectory. Within this framework, effectively representing the road network and extracting relevant trajectory features are crucial for overall performance. Despite advancements in these models, they fail to fully leverage the …
Efficient And Green Large Language Models For Software Engineering: Literature Review, Vision, And The Road Ahead, Jieke Shi, Zhou Yang, David Lo
Efficient And Green Large Language Models For Software Engineering: Literature Review, Vision, And The Road Ahead, Jieke Shi, Zhou Yang, David Lo
Research Collection School Of Computing and Information Systems
Large Language Models (LLMs) have recently shown remarkable capabilities in various software engineering tasks, spurring the rapid growth of the Large Language Models for Software Engineering (LLM4SE) area. However, limited attention has been paid to developing efficient LLM4SE techniques that demand minimal computational cost, time, and memory resources, as well as green LLM4SE solutions that reduce energy consumption, water usage, and carbon emissions. This article aims to redirect the focus of the research community toward the efficiency and greenness of LLM4SE, while also sharing potential research directions to achieve this goal. It commences with a brief overview of the significance …
Enhancing Vulnerability Detection Via Inter-Procedural Semantic Completion, Bozhi Wu, Chengjie Liu, Zhiming Li, Yushi Cao, Jun Sun, Shang-Wei Lin
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 …
Ntire 2025 Challenge On Event-Based Image Deblurring: Methods And Results, Lei Sun, Et. Al.
Ntire 2025 Challenge On Event-Based Image Deblurring: Methods And Results, Lei Sun, Et. Al.
Research Collection School Of Computing and Information Systems
This paper presents an overview of NTIRE 2025, the First Challenge on Event-Based Image Deblurring, detailing the proposed methodologies and corresponding results. The primary goal of the challenge is to design an event-based method that achieves high-quality image deblurring, with performance quantitatively assessed using Peak Signal-toNoise Ratio (PSNR). Notably, there are no restrictions on computational complexity or model size. The task focuses on leveraging both events and images as inputs for singleimage deblurring. A total of 199 participants registered, among whom 15 teams successfully submitted valid results, offering valuable insights into the current state of eventbased image deblurring. We anticipate …
On Lexicographic Proof Rules For Probabilistic Termination, Krishnendu Chatterjee, Ehsan Kafshdar Goharshady, Petr Novotný, Jiří Zárevucký, Dorde Zikelic
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 …
Runtime Backdoor Detection For Federated Learning Via Representational Dissimilarity Analysis, Xiyue Zhang, Xiaoyong Xue, Xiaoning Du, Xiaofei Xie, Yang Liu, Meng Sun
Runtime Backdoor Detection For Federated Learning Via Representational Dissimilarity Analysis, Xiyue Zhang, Xiaoyong Xue, Xiaoning Du, Xiaofei Xie, Yang Liu, Meng Sun
Research Collection School Of Computing and Information Systems
Federated learning (FL), as a powerful learning paradigm, trains a shared model by aggregating model updates from distributed clients. However, the decoupling of model learning from local data makes FL highly vulnerable to backdoor attacks, where a single compromised client can poison the shared model. While recent progress has been made in backdoor detection, existing methods face challenges with detection accuracy and runtime effectiveness, particularly when dealing with complex model architectures. In this work, we propose a novel approach to detecting malicious clients in an accurate, stable, and efficient manner. Our method utilizes a sampling-based network representation method to quantify …
Nexusgs: Sparse View Synthesis With Epipolar Depth Priors In 3d Gaussian Splatting, Yulong Zheng, Zicheng Jiang, Shengfeng He, Yandu Sun, Junyu Dong, Huaidong Zhang, Yong Du
Nexusgs: Sparse View Synthesis With Epipolar Depth Priors In 3d Gaussian Splatting, Yulong Zheng, Zicheng Jiang, Shengfeng He, Yandu Sun, Junyu Dong, Huaidong Zhang, Yong Du
Research Collection School Of Computing and Information Systems
Neural Radiance Field (NeRF) and 3D Gaussian Splatting (3DGS) have noticeably advanced photo-realistic novel view synthesis using images from densely spaced camera viewpoints. However, these methods struggle in few-shot scenarios due to limited supervision. In this paper, we present NexusGS, a 3DGS-based approach that enhances novel view synthesis from sparse-view images by directly embedding depth information into point clouds, without relying on complex manual regularizations. Exploiting the inherent epipolar geometry of 3DGS, our method introduces a novel point cloud densification strategy that initializes 3DGS with a dense point cloud, reducing randomness in point placement while preventing over-smoothing and overfitting. Specifically, …
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
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 …
De-Duplicating Silent Compiler Bugs Via Deep Semantic Representation, Junjie Chen, Xingyu Fan, Chen Yang, Shuang Liu, Jun Sun
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 …
Lessons Learned From Sandboxing, Piloting And Policy Experimentation With Ai And Other Digital Initiatives: Part 1, Summary Report, Steven M. Miller
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 …
On-Demand Heterogeneous Drone Delivery Problem, Xupeng Wen, Zhiguang Cao, Shu Xu, Dapeng Ren, Guohua Wu, Yaoxin Wu
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) …
Demystifying Memorization In Llm-Based Program Repair Via A General Hypothesis Testing Framework, Jiaolong Kong, Xiaofei Xie, Shangqing Liu
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 …
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
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. …
Verify All Traffic: Towards Zero-Trust In-Network Intrusion Detection Against Multipath Routing, Ziming Zhao, Zhaoxuan Li, Xiaofei Xie, Zhipeng Liu, Tingting Li, Jiongchi Yu, Fan Zhang, Binbin Chen
Verify All Traffic: Towards Zero-Trust In-Network Intrusion Detection Against Multipath Routing, Ziming Zhao, Zhaoxuan Li, Xiaofei Xie, Zhipeng Liu, Tingting Li, Jiongchi Yu, Fan Zhang, Binbin Chen
Research Collection School Of Computing and Information Systems
With the popularity of encryption protocols, machine learning (ML)-based traffic analysis technologies have attracted widespread attention. To adapt to modern high-speed bandwidth, recent research is dedicated to advancing zero-trust intrusion detection by offloading feature extraction and model inference into the network dataplane. Especially, with the rise of programmable switches, achieving line-speed ML inference becomes promising. However, existing research only considers a single switch node as a relay to conduct evaluation. This is far from real-world deployments involving multiple switches (given that zero-trust security assumes that threats can originate from anywhere, including within the network), particularly the multipath routing phenomenon that …
Meta-Learning Hyperparameters For Foundation Model Adaptation In Remote-Sensing Imagery, Zichen Tian, Yaoyao Liu, Qianru Sun
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 …
Chatgpt’S Performance Evaluation In Spreadsheets Modeling To Inform Assessments Redesign, Michelle L. F. Cheong
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 …
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
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 …
Contested: Consistency-Aided Tested Code Generation With Llm, Jinhao Dong, Jun Sun, Wenjie Zhang, Jinsong Dong, Dan Hao
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 …
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
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 …
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
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, …
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
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 …
Moditector: Module-Directed Testing For Autonomous Driving Systems, Renzhi Wang, Mingfei Cheng, Xiaofei Xie, Yuan Zhou, Lei Ma
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, …
Lessons Learned From Sandboxing, Piloting And Policy Experimentation With Ai And Other Digital Initiatives: Part 2, Ten In-Depth Interviews, Steven M. Miller
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 …
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
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 …
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
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 …
Unsupervised Recognition Of Unknown Objects For Open-World Object Detection, Ruohuan Fang, Guansong Pang, Wenjun Miao, Xiao Bai, Jin Zheng, Xin Ning
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 …