Open Access. Powered by Scholars. Published by Universities.®
- Discipline
-
- Physical Sciences and Mathematics (8512)
- Computer Sciences (8495)
- Databases and Information Systems (3446)
- Software Engineering (2149)
- Artificial Intelligence and Robotics (1676)
-
- Information Security (1059)
- Numerical Analysis and Scientific Computing (1024)
- Graphics and Human Computer Interfaces (924)
- Engineering (887)
- Social and Behavioral Sciences (679)
- Business (640)
- Theory and Algorithms (493)
- Computer Engineering (450)
- Operations Research, Systems Engineering and Industrial Engineering (410)
- Programming Languages and Compilers (379)
- OS and Networks (323)
- Communication (297)
- Social Media (240)
- Public Affairs, Public Policy and Public Administration (216)
- Transportation (194)
- Medicine and Health Sciences (178)
- Education (167)
- Management Information Systems (166)
- Data Storage Systems (161)
- E-Commerce (148)
- International and Area Studies (111)
- Asian Studies (110)
- Health Information Technology (107)
- Digital Communications and Networking (104)
- Technology and Innovation (104)
- Keyword
-
- Deep learning (123)
- Machine learning (121)
- Social media (74)
- Artificial intelligence (71)
- Reinforcement learning (69)
-
- Data mining (64)
- Privacy (61)
- Cloud computing (58)
- Deep Learning (56)
- Empirical study (54)
- Optimization (54)
- Security (53)
- Visualization (51)
- Online learning (49)
- Software engineering (49)
- Training (49)
- Neural networks (48)
- Singapore (48)
- Task analysis (48)
- Anomaly detection (47)
- Twitter (46)
- Feature extraction (45)
- Blockchain (44)
- Collaboration (44)
- Large Language Models (44)
- Semantics (43)
- Access control (41)
- Algorithms (40)
- Android (39)
- Classification (38)
- Publication Year
- File Type
Articles 391 - 420 of 8553
Full-Text Articles in Entire DC Network
Contrastrepair: Enhancing Conversation-Based Automated Program Repair Via Contrastive Test Case Pairs, Jiaolong Kong, Xiaofei Xie, Mingfei Cheng, Shangqing Liu, Xiaoning Du, Qi Guo
Contrastrepair: Enhancing Conversation-Based Automated Program Repair Via Contrastive Test Case Pairs, Jiaolong Kong, Xiaofei Xie, Mingfei Cheng, Shangqing Liu, Xiaoning Du, Qi Guo
Research Collection School Of Computing and Information Systems
Automated Program Repair (APR) aims to automatically generate patches for rectifying software bugs. Recentstrides in Large Language Models (LLM), such as ChatGPT, have yielded encouraging outcomes in APR,especially within the conversation-driven APR framework. Nevertheless, the efficacy of conversation-drivenAPR is contingent on the quality of the feedback information. In this article, we propose ContrastRepair, anovel conversation-based APR approach that augments conversation-driven APR by providing LLMs withcontrastive test pairs. A test pair consists of a failing test and a passing test, which offer contrastive feedback tothe LLM. Our key insight is to minimize the difference between the generated passing test and the …
Polyqent: A Polynomial Quantified Entailment Solver, Krishnendu Chatterjee, Amir Kafshdar Goharshady, Ehsan Kafshdar Goharshady, Mehrdad Karrabi, Milad Saadat, Maximilian Seeliger, Dorde Zikelic
Polyqent: A Polynomial Quantified Entailment Solver, Krishnendu Chatterjee, Amir Kafshdar Goharshady, Ehsan Kafshdar Goharshady, Mehrdad Karrabi, Milad Saadat, Maximilian Seeliger, Dorde Zikelic
Research Collection School Of Computing and Information Systems
Polynomial quantified entailments with existentially and universally quantified variables arise in many problems of verification and program analysis. We present PolyQEnt which is a tool for solving polynomial quantified entailments in which variables on both sides of the implication are real valued or unbounded integers. Our tool provides a unified framework for polynomial quantified entailment problems that arise in several papers in the literature. Our experimental evaluation over a wide range of benchmarks shows the applicability of the tool as well as its benefits as opposed to simply using existing SMT solvers to solve such constraints.
Deep Learning For Hate Speech Detection: A Comparative Study, Jitendra Singh Malik, Hezhe Qiao, Guansong Pang, Anton Van Den Hengel
Deep Learning For Hate Speech Detection: A Comparative Study, Jitendra Singh Malik, Hezhe Qiao, Guansong Pang, Anton Van Den Hengel
Research Collection School Of Computing and Information Systems
Automated hate speech detection is an important tool in combating the spread of hate speech, particularly in social media. Numerous methods have been developed for the task, including a recent proliferation of deep-learning based approaches. A variety of datasets have also been developed, exemplifying various manifestations of the hate-speech detection problem. We present here a largescale empirical comparison of deep and shallow hate-speech detection methods, mediated through the three most commonly used datasets. Our goal is to illuminate progress in the area, and identify strengths and weaknesses in the current state-of-the-art. We particularly focus our analysis on measures of practical …
Learning Orientation Field For Osm-Guided Autonomous Navigation, Yuming Huang, Wei Gao, Zhiyuan Zhang, Maani Ghaffari, Dezhen Song, Cheng-Zhong Xu, Hui Kong
Learning Orientation Field For Osm-Guided Autonomous Navigation, Yuming Huang, Wei Gao, Zhiyuan Zhang, Maani Ghaffari, Dezhen Song, Cheng-Zhong Xu, Hui Kong
Research Collection School Of Computing and Information Systems
OpenStreetMap (OSM) has gained popularity recently in autonomous navigation due to its public accessibility, lower maintenance costs, and broader geographical coverage. However, existing methods often struggle with noisy OSM data and incomplete sensor observations, leading to inaccuracies in trajectory planning. These challenges are particularly evident in complex driving scenarios, such as at intersections or facing occlusions. To address these challenges, we propose a robust and explainable two-stage framework to learn an Orientation Field (OrField) for robot navigation by integrating LiDAR scans and OSM routes. In the first stage, we introduce a novel representation, OrField, which can provide orientations for each …
Preference-Based Deep Reinforcement Learning For Historical Route Estimation, Boshen Pan, Yaoxin Wu, Zhiguang Cao, Yaqing Hou, Guangyu Zou, Qiang Zhang
Preference-Based Deep Reinforcement Learning For Historical Route Estimation, Boshen Pan, Yaoxin Wu, Zhiguang Cao, Yaqing Hou, Guangyu Zou, Qiang Zhang
Research Collection School Of Computing and Information Systems
Recent Deep Reinforcement Learning (DRL) techniques have advanced solutions to Vehicle Routing Problems (VRPs). However, many of these methods focus exclusively on optimizing distance-oriented objectives (i.e., minimizing route length), often overlooking the implicit drivers' preferences for routes. These preferences, which are crucial in practice, are challenging to model using traditional DRL approaches. To address this gap, we propose a preference-based DRL method characterized by its reward design and optimization objective, which is specialized to learn historical route preferences. Our experiments demonstrate that the method aligns generated solutions more closely with human preferences. Moreover, it exhibits strong generalization performance across a …
From Release To Adoption: Challenges In Reusing Pre-Trained Ai Models For Downstream Developers, Peerachai Banyongrakkul, Mansooreh Zahedi, Patanamon Thongtanunam, Christoph Treude, Haoyu Gao
From Release To Adoption: Challenges In Reusing Pre-Trained Ai Models For Downstream Developers, Peerachai Banyongrakkul, Mansooreh Zahedi, Patanamon Thongtanunam, Christoph Treude, Haoyu Gao
Research Collection School Of Computing and Information Systems
Pre-trained models (PTMs) have gained widespread popularity and achieved remarkable success across various fields, driven by their groundbreaking performance and easy accessibility through hosting providers. However, the challenges faced by downstream developers in reusing PTMs in software systems are less explored. To bridge this knowledge gap, we qualitatively created and analyzed a dataset of 840 PTM-related issue reports from 31 OSS GitHub projects. We systematically developed a comprehensive taxonomy of PTM-related challenges that developers face in downstream projects. Our study identifies seven key categories of challenges that downstream developers face in reusing PTMs, such as model usage, model performance, and …
Recurrent Autoregressive Linear Model For Next-Basket Recommendation, Tereza Zmeskalova, Antoine Ledent, Martin Spisak, Pavel Kordik, Rodrigo Alves
Recurrent Autoregressive Linear Model For Next-Basket Recommendation, Tereza Zmeskalova, Antoine Ledent, Martin Spisak, Pavel Kordik, Rodrigo Alves
Research Collection School Of Computing and Information Systems
Next-basket recommendation aims to predict the (sets of) items that a user is most likely to purchase during their next visit, capturing both short-term sequential patterns and long-term user preferences. However, effectively modeling these dynamics remains a challenge for traditional methods, which often struggle with interpretability and computational efficiency, particularly when dealing with intricate temporal dependencies and inter-item relationships. In this paper, we propose ReALM, a Recurrent Autoregressive Linear Model that explicitly captures temporal item-to-item dependencies across multiple time steps. By leveraging a recurrent loss function and a closed-form optimization solution, our approach offers both interpretability and scalability while maintaining …
Storage Location Optimization In Automated Storage And Retrieval Systems: A Deep Reinforcement Learning Approach, Lingjun Wang, Aldy Gunawan, Pieter Vansteenwegen
Storage Location Optimization In Automated Storage And Retrieval Systems: A Deep Reinforcement Learning Approach, Lingjun Wang, Aldy Gunawan, Pieter Vansteenwegen
Research Collection School Of Computing and Information Systems
This study investigates the optimization of storage location in automated storage and retrieval systems (AS/RS). We introduce an optimization approach based on the Deep Q-Network (DQN) algorithm to enhance warehouse task efficiency and minimize stacker travel during storage and retrieval. To accelerate the algorithm training process, we integrate a prioritized experience replay mechanism. Furthermore, we decouple action selection from value estimation within the DQN framework to address the issue of value overestimation. The proposed model is evaluated against three heuristic methods. The experimental results demonstrate that our approach significantly outperforms these baselines.
An Efficient Security-Enhanced Accountable Access Control For Named Data Networking, Jianfei Sun, Yuxian Li, Xuehuan Yang, Guomin Yang, Robert H. Deng
An Efficient Security-Enhanced Accountable Access Control For Named Data Networking, Jianfei Sun, Yuxian Li, Xuehuan Yang, Guomin Yang, Robert H. Deng
Research Collection School Of Computing and Information Systems
Named Data Networking (NDN) is embraced as the crucial implementation of Information-Centric Networking (ICN), enhancing content distribution and caching efficiency through edge routers. However, existing NDN architectures face significant security and privacy challenges, including: (a) a lack of secure and efficient access control; (b) inadequate support for flexible and selective content management by content publishers; (c) insufficient implementation of accountability and privilege revocation mechanisms. To handle these challenges, we propose ESAS, the first-ever Efficient Security-enhanced Accountable Access Control Scheme for NDN. Specifically, our ESAS incorporates anonymous authentication using group signatures at network routers to prevent unauthorized access, employs key-aggregation-based access …
Educator Perceptions Of Devops Teaching Recommendations And Their Alignment With Common Challenges, Marcelo Romulo Fernandes, Pablo Paiva, Samuel Lucas De Moura Ferino, Roberta Coelho, Christoph Treude, Eduardo Aranha, Uirá Kulesza
Educator Perceptions Of Devops Teaching Recommendations And Their Alignment With Common Challenges, Marcelo Romulo Fernandes, Pablo Paiva, Samuel Lucas De Moura Ferino, Roberta Coelho, Christoph Treude, Eduardo Aranha, Uirá Kulesza
Research Collection School Of Computing and Information Systems
DevOps education presents unique pedagogical challenges due to the diversity of tools, rapid technological change, and the multidisciplinary nature of the field. Although previous work has proposed recommendations to address these challenges, it is unclear how educators perceive these recommendations and whether they align with the challenges encountered in practice. In this paper, we present a quantitative and qualitative methods study involving 11 DevOps educators who interacted with Improve, a tool that presents a curated set of educational challenges and recommendations derived from previous literature. Educators indicated which recommendations they already use, which they intend to use, and which challenges …
Studying Satd In Drone Systems With Human-Ai Collaboration, Leevi Rantala, Lwin Khin Shar, Mäntylä Mika V., Wei Minn, Naing Tun Yan
Studying Satd In Drone Systems With Human-Ai Collaboration, Leevi Rantala, Lwin Khin Shar, Mäntylä Mika V., Wei Minn, Naing Tun Yan
Research Collection School Of Computing and Information Systems
Background: Self-Admitted Technical Debt (SATD) refers to sub-optimal solutions that developers acknowledge within the source code. SATD research originated on Java projects but is expanding to other domains. We focus on SATD in drones, which are used for various critical tasks.Aims: The primary objective is to investigate SATD in drone systems. The second aim is to explore the integration of AI and human collaboration for SATD labelling and classification.Method: We conducted a sample study of SATD comments in drone systems (14 open source, 4 SDKs) to analyse the quantity and types of SATD comments present. Our study incorporates collaboration between …
Large Lithium-Ion Battery Model For Secure Shared E-Bike Battery In Smart Cities, Donghui Ding, Zhao Li, Linhao Luo, Ming Jin, Bin Zhu, Yichen Zhong, Junhao Hu, Peng Cai, Huiqi Hu
Large Lithium-Ion Battery Model For Secure Shared E-Bike Battery In Smart Cities, Donghui Ding, Zhao Li, Linhao Luo, Ming Jin, Bin Zhu, Yichen Zhong, Junhao Hu, Peng Cai, Huiqi Hu
Research Collection School Of Computing and Information Systems
Electric bikes powered by lithium-ion batteries are increasingly used in smart cities to promote sustainable mobility and efficient delivery services. However, limited battery range and slow plug-in charging remain key challenges. Shared electric bike battery systems, facilitated by battery swapping stations, offer a promising solution by enabling quick and efficient battery replacements. However, their success hinges on accurate anomaly detection, battery health estimation and remain range prediction. These tasks remain challenging due to data scarcity, battery diversity and environmental variability. Here we show that a large-scale lithium-ion battery model trained on over ten million battery time series data enables robust …
Stylegan-∞: Extending Stylegan To Arbitrary-Ratio Translation With Stylebook, Yihua Dai, Tianyi Xiang, Bailin Deng, Yong Du, Hongmin Cai, Jing Qin, Shengfeng He
Stylegan-∞: Extending Stylegan To Arbitrary-Ratio Translation With Stylebook, Yihua Dai, Tianyi Xiang, Bailin Deng, Yong Du, Hongmin Cai, Jing Qin, Shengfeng He
Research Collection School Of Computing and Information Systems
Although pre-trained large-scale generative models StyleGAN series have proven to be effective in various editing and translation tasks, they are limited to pre-defined fixed aspect ratio. To overcome this limitation, we propose StyleGAN-∞, a model that enables pre-trained StyleGAN to perform arbitrary-ratio conditional synthesis. Our key insight is to distill the expressive StyleGAN features into a StyleBook, such that an arbitrary-ratio condition can be translated to other forms by properly assembling pre-defined StyleBook vectors. To learn and leverage the StyleBook, we employ a network with three distinct stages, each corresponding to StyleBook extraction, StyleBook correspondence learning, and arbitrary-ratio synthesis. Extensive …
Stable And Fair Cost Allocation In Platform-Enabled Lcl Consolidation, Pang Jin Tan, Shih-Fen Cheng
Stable And Fair Cost Allocation In Platform-Enabled Lcl Consolidation, Pang Jin Tan, Shih-Fen Cheng
Research Collection School Of Computing and Information Systems
Many logistics platforms enable collaboration between agents to reduce costs, but determining fair pricing remains challenging when agents have pre-existing partnerships. This paper introduces a cooperative game theory framework to model platform-mediated collaboration, modeling the platform as an additional player. We present a novel characteristic function that distinguishes between partial collaborations (existing relationships) and full collaborations (platform-enabled). Using Shapley value, we derive fair cost allocations and platform charges that reflect each participant's contribution. We address stability concerns through an optimization model that minimizes platform subsidies while preventing profitable deviations. The framework is demonstrated through an application in freight forwarding for …
Dgl: Dynamic Global-Local Information Aggregation For Scalable Vrp Generalization With Self-Improvement Learning, Yubin Xiao, Yuesong Wu, Rui Cao, Di Wang, Zhiguang Cao, Xuan Wu, Peng Zhao, Yuanshu Li, You Zhou, Yuan Jiang
Dgl: Dynamic Global-Local Information Aggregation For Scalable Vrp Generalization With Self-Improvement Learning, Yubin Xiao, Yuesong Wu, Rui Cao, Di Wang, Zhiguang Cao, Xuan Wu, Peng Zhao, Yuanshu Li, You Zhou, Yuan Jiang
Research Collection School Of Computing and Information Systems
The Vehicle Routing Problem (VRP) is a critical combinatorial optimization problem with wide-reaching real-world applications, particularly in logistics, transportation. While neural network-based VRP solvers have shown impressive results on test instances similar to training data, their performance often degrades when faced with varying scales and unseen distributions, limiting their practical applicability. To overcome these limitations, we introduce DGL (Dynamic Global-Local Information Aggregation), a novel model that combines global and local information to effectively solve VRPs. DGL dynamically adjusts local node selections within a localized range, capturing local invariance across problems of different scales and distributions, thereby enhancing generalization. At the …
Rethinking Cognitive Complexity For Unit Tests: Toward A Readability-Aware Metric Grounded In Developer Perception, Wendkûuni C. Ouédraogo, Yinghua Li, Xueqi Dang, Xin Zhou, Anil Koyuncu, Jacques Klein, David Lo, Tegawendé F. Bissyandé
Rethinking Cognitive Complexity For Unit Tests: Toward A Readability-Aware Metric Grounded In Developer Perception, Wendkûuni C. Ouédraogo, Yinghua Li, Xueqi Dang, Xin Zhou, Anil Koyuncu, Jacques Klein, David Lo, Tegawendé F. Bissyandé
Research Collection School Of Computing and Information Systems
Automatically generated unit tests-from searchbased tools like EvoSuite or LLMs-vary significantly in structure and readability. Yet most evaluations rely on metrics like Cyclomatic Complexity and Cognitive Complexity, designed for functional code rather than test code. Recent studies have shown that SonarSource's Cognitive Complexity metric assigns nearzero scores to LLM-generated tests, yet its behavior on EvoSuitegenerated tests and its applicability to test-specific code structures remain unexplored. We introduce CCTR, a Test-Aware Cognitive Complexity metric tailored for unit tests. CCTR integrates structural and semantic features like assertion density, annotation roles, and test composition patterns-dimensions ignored by traditional complexity models but critical for …
Flow, Immersion, And Presence: Creating Virtual Reality And Engagement In The Era Of Ubiquitous And Intelligent Technologies, Yi Maggie Guo, Fiona Fui-Hoon Nah, Nannan Xi, Marshall Scott Poole
Flow, Immersion, And Presence: Creating Virtual Reality And Engagement In The Era Of Ubiquitous And Intelligent Technologies, Yi Maggie Guo, Fiona Fui-Hoon Nah, Nannan Xi, Marshall Scott Poole
Research Collection School Of Computing and Information Systems
Researchers use the concepts of flow, immersion, and presence to explain the usage of and engagement (e.g., cognitive absorption) with information technology. In this special issue, we showcase four papers on empirical investigations of flow and immersion, their antecedents, and their outcomes. These papers address research questions that range from investigating the antecedents and consequences of immersion in head-mounted displays of virtual reality, designing for the flow experience in extended reality, studying factors influencing user engagement in the metaverse, and identifying adverse effects of work-related flow. We also provide directions and suggestions for future research.
Vibemus: Proactive Agentic System For Music Personalization, Zhiliang Guo, Teng Tu, Yunshan Ma, Xun Yang
Vibemus: Proactive Agentic System For Music Personalization, Zhiliang Guo, Teng Tu, Yunshan Ma, Xun Yang
Research Collection School Of Computing and Information Systems
Large language models (LLMs) enable diverse forms of AI-assisted creation, yet they often struggle to bridge the preference-articulation gap: users may provide incomplete or vague intentions or lack the vocabulary to specify what they want, yielding outputs misaligned with true preferences. To address this gap and facilitate music creation in a vibe-centric environment, we introduce VibeMus, a proactive agentic system built on open-source components. The system engages in multi-turn dialogue to progressively determine the music’s emotion, genre, lyrics, and other aspects before generation. Simulated evaluations show that proactive clarification improves alignment with users’ intended nuances. Our approach is training-free, leveraging …
Improving Co-Decoding Based Security Hardening Of Code Llms Leveraging Knowledge Distillation, Dong Li, Shanfu Shu, Meng Yan, Zhongxin Liu, Chao Liu, Xiaohong Zhang, David Lo
Improving Co-Decoding Based Security Hardening Of Code Llms Leveraging Knowledge Distillation, Dong Li, Shanfu Shu, Meng Yan, Zhongxin Liu, Chao Liu, Xiaohong Zhang, David Lo
Research Collection School Of Computing and Information Systems
Large Language Models (LLMs) have been widely adopted by developers in software development. However, the massive pretraining code data is not rigorously filtered, allowing LLMs to learn unsafe coding patterns. Several prior studies have demonstrated that code LLMs tend to generate code with potential vulnerabilities. The widespread adoption of intelligent programming assistants poses a significant threat to the software development process. Existing approaches to mitigating this risk primarily involve constructing secure data that are free of vulnerabilities and then retraining or fine-tuning the models. However, such an effort is resource intensive and requires significant manual supervision. When the model parameters …
Exploring Parameter-Efficient Fine-Tuning Techniques For Code Generation With Large Language Models, Martin Weyssow, Xin Zhou, Kisub Kim, David Lo, Houari A. Sahraoui
Exploring Parameter-Efficient Fine-Tuning Techniques For Code Generation With Large Language Models, Martin Weyssow, Xin Zhou, Kisub Kim, David Lo, Houari A. Sahraoui
Research Collection School Of Computing and Information Systems
Large language models (LLMs) demonstrate impressive capabilities to generate accurate code snippets given natural language intents in a zero-shot manner, i.e., without the need for specific fine-tuning. While prior studies have highlighted the advantages of fine-tuning LLMs, this process incurs high computational costs, making it impractical in resource-scarce environments, particularly for models with billions of parameters. To address these challenges, previous research explored in-context learning (ICL) and retrieval-augmented generation (RAG) as strategies to guide the LLM generative process with task-specific prompt examples. However, ICL and RAG introduce inconveniences, such as the need for designing contextually relevant prompts and the absence …
Managing Rumors On Electronic Interaction Platforms: How Management Responses Affect Investor Reaction, Runyu Wang, Zili Zhang, Keng Siau, Ziqiong Zhang
Managing Rumors On Electronic Interaction Platforms: How Management Responses Affect Investor Reaction, Runyu Wang, Zili Zhang, Keng Siau, Ziqiong Zhang
Research Collection School Of Computing and Information Systems
This study investigates how listed firms respond to investors’ rumor-related inquiries and examines the impact of these responses on investor reactions, as indicated by subsequent daily abnormal stock returns (ARs). Using a unique dataset of question-and-answer (Q&A) interactions from China’s major e-interaction platforms, established by the stock exchanges, our study provides insights into regulated firm-investor communications in a structured Q&A setting. Unlike informal social media channels, these platforms enable official responses from firm representatives, typically board secretaries, under direct regulatory oversight. By analyzing rumor-related Q&A pairs with regression models and several robustness checks, we find that firms can benefit from …
Lighttransfer: Your Long-Context Llm Is Secretly A Hybrid Model With Effortless Adaptation, Xuan Zhang, Fengzhuo Zhang, Cunxiao Du, Chao Du, Tianyu Pang, Wei Gao, Min Lin
Lighttransfer: Your Long-Context Llm Is Secretly A Hybrid Model With Effortless Adaptation, Xuan Zhang, Fengzhuo Zhang, Cunxiao Du, Chao Du, Tianyu Pang, Wei Gao, Min Lin
Research Collection School Of Computing and Information Systems
Scaling language models to handle longer contexts introduces substantial memory challenges due to the growing cost of key-value (KV) caches. Motivated by the efficiency gains of hybrid models and the broad availability of pretrained large transformer backbones, we explore transitioning transformer models into hybrid architectures for a more efficient generation. In this work, we propose LightTransfer, a lightweight method that transforms models such as LLaMA into hybrid variants. Our approach identifies lazy layers -- those focusing on recent or initial tokens -- and replaces their full attention with streaming attention. This transformation can be performed without any training for long-context …
Guiding Multiple Remote Users In Physical Tasks With Language-Driven Robotic Telepresence, Ruyi Li, Jingfei Guo, Xinyi Zhang, Xuji Zhang, Zeqing Li, Jiannan Li, Jiangtao Gong
Guiding Multiple Remote Users In Physical Tasks With Language-Driven Robotic Telepresence, Ruyi Li, Jingfei Guo, Xinyi Zhang, Xuji Zhang, Zeqing Li, Jiannan Li, Jiangtao Gong
Research Collection School Of Computing and Information Systems
Remote assistance through robotic telepresence could involve both control and memory challenges, particularly in one expert to multiple workers situation. In this work, we proposed a novelty language-driven interface to facilitate remote collaboration through telepresence robots. Through operations and maintenance expert interviews and a scenario simulation study, we identified key pain points in executing one-expert-multiple-workers remote guidance using the telepresence robot and proposed two design goals, which together consist of five sub-design goals with corresponding features. These features were integrated into a standard telepresence robot, resulting in the development of a Collaborative LLM-based Embodied Assistant Robot, named CLEAR Robot. A …
Implementing Slack-Free Custom Penalty Function For Qubo On Gate-Based Quantum Computers, Xin Wei Lee, Hoong Chuin Lau
Implementing Slack-Free Custom Penalty Function For Qubo On Gate-Based Quantum Computers, Xin Wei Lee, Hoong Chuin Lau
Research Collection School Of Computing and Information Systems
Solving NP-hard constrained combinatorial optimization problems using quantum algorithms remains a challenging yet promising avenue toward quantum advantage. Variational Quantum Algorithms (VQAs), such as the Variational Quantum Eigensolver (VQE), typically require constrained problems to be reformulated as unconstrained ones using penalty methods. A common approach introduces slack variables and quadratic penalties in the QUBO formulation to handle inequality constraints. However, this leads to increased qubit requirements and often distorts the optimization landscape, making it harder to find high-quality feasible solutions. To address these issues, we explore a slack-free formulation that directly encodes inequality constraints using custom penalty functions, specifically the …
Robface: A Test Suite For Efficient Robustness Evaluation Of Face Recognition Systems, Ruihan Zhang, Jun Sun
Robface: A Test Suite For Efficient Robustness Evaluation Of Face Recognition Systems, Ruihan Zhang, Jun Sun
Research Collection School Of Computing and Information Systems
Face recognition is a widely used authentication technology in practice, where robustness is required. It is thus essential to have an efficient and easy-to-use method for evaluating the robustness of (possibly third-party) trained face recognition systems. Existing approaches to evaluating the robustness of face recognition systems are either based on empirical evaluation (e.g., measuring attacking success rate using state-of-the-art attacking methods) or formal analysis (e.g., measuring the Lipschitz constant). While the former demands significant user efforts and expertise, the latter is extremely time-consuming. In pursuit of a comprehensive, efficient, easy-to-use, and scalable estimation of the robustness of face recognition systems, …
Neuro-Ins: A Learning-Based One-Shot Node Insertion For Dynamic Routing Problems, Zhiqin Zhang, Jingfeng Yang, Zhiguang Cao, Hoong Chuin Lau
Neuro-Ins: A Learning-Based One-Shot Node Insertion For Dynamic Routing Problems, Zhiqin Zhang, Jingfeng Yang, Zhiguang Cao, Hoong Chuin Lau
Research Collection School Of Computing and Information Systems
The rise in instant delivery services necessitates efficient route planning in last-mile delivery scenarios, where new orders arrive dynamically and need to be integrated into existing routes. In such contexts, complete re-optimization of routes are not permitted, and node insertion to existing route sequences is the only viable option. However, many existing heuristics for node insertion, such as the Cheapest Insertion (CI) method, are myopic and often result in suboptimal solutions retrospectively. This paper presents Neuro-Ins, an initial yet novel attempt at harnessing a learning-based framework to handle the insertion of new orders for the Pickup and Delivery Problem (PDP). …
Shortcuts Everywhere And Nowhere: Exploring Multi-Trigger Backdoor Attacks, Yige Li, Jiabo He, Hanxun Huang, Jun Sun, Xingjun Ma, Yu-Gang Jiang
Shortcuts Everywhere And Nowhere: Exploring Multi-Trigger Backdoor Attacks, Yige Li, Jiabo He, Hanxun Huang, Jun Sun, Xingjun Ma, Yu-Gang Jiang
Research Collection School Of Computing and Information Systems
Backdoor attacks have become a significant threat to the pre-training and deployment of deep neural networks (DNNs). Although numerous methods for detecting and mitigating backdoor attacks have been proposed, most rely on identifying and eliminating the “shortcut” created by the backdoor, which links a specific source class to a target class. However, these approaches can be easily circumvented by designing multiple backdoor triggers that create shortcuts everywhere and therefore nowhere specific. In this study, we explore the concept of Multi-Trigger Backdoor Attacks (MTBAs), where multiple adversaries leverage different types of triggers to poison the same dataset. By proposing and investigating …
Gti: Graph-Based Tree Index With Logarithm Updates For Nearest Neighbor Search In High-Dimensional Spaces, Ruoyao Ma, Yifan Zhu, Baihua Zheng, Lu Chen, Congcong Ge, Yunjun Gao
Gti: Graph-Based Tree Index With Logarithm Updates For Nearest Neighbor Search In High-Dimensional Spaces, Ruoyao Ma, Yifan Zhu, Baihua Zheng, Lu Chen, Congcong Ge, Yunjun Gao
Research Collection School Of Computing and Information Systems
Nearest neighbor search (NNS) is fundamental for high-dimensional space retrieval and impacts various fields, such as pattern recognition, information retrieval, recommendation systems, and vector database management. Among existing NNS methods, graph-based methods often excel in query accuracy and efficiency. However, these methods face significant challenges, including high construction costs and difficulties with dynamic data updates. Recent efforts have focused on combining graph methods with hashing, quantization, and tree-based approaches to address these issues, but problems with large index sizes and update performance remain unresolved. In response, this paper proposes GTI, a novel, lightweight, and dynamic graph-based tree index for high-dimensional …
Deep Graph Anomaly Detection: A Survey And New Perspectives, Hezhe Qiao, Hanghang Tong, Nanyang Technological University, Irwin King, Charu Aggarwal, Guansong Pang
Deep Graph Anomaly Detection: A Survey And New Perspectives, Hezhe Qiao, Hanghang Tong, Nanyang Technological University, Irwin King, Charu Aggarwal, Guansong Pang
Research Collection School Of Computing and Information Systems
Graph anomaly detection (GAD), which aims to identify unusual graph instances (e.g., nodes, edges, subgraphs, or graphs), has attracted increasing attention in recent years due to its significance in a wide range of applications. Deep learning approaches, graph neural networks (GNNs) in particular, have been emerging as a promising paradigm for GAD, owing to its strong capability in capturing complex structure and/or node attributes in graph data. Considering the large number of methods proposed for GNN-based GAD, it is of paramount importance to summarize the methodologies and findings in the existing GAD studies, so that we can pinpoint effective model …
Probabilistic Modeling, Learnability And Uncertainty Estimation For Interaction Prediction In Movie Rating Datasets, Jennifer Poernomo, Nicole Gabrielle Lee Tan, Rodrigo Alves, Antoine Ledent
Probabilistic Modeling, Learnability And Uncertainty Estimation For Interaction Prediction In Movie Rating Datasets, Jennifer Poernomo, Nicole Gabrielle Lee Tan, Rodrigo Alves, Antoine Ledent
Research Collection School Of Computing and Information Systems
In this paper, we examine the hypothesis that the interactions recorded in many Recommendation Systems datasets are distributed according to a low-rank distribution, i.e. a mixture of factorizable distributions. Surprisingly, we find that on several popular datasets, a simple non-negative matrix factorization method equals or outperforms more modern methods such as LightGCN, which indicates that the sampling distribution over interactions is indeed low-rank. Furthermore, we mathematically prove that low-rank distributions are learnable with a sparse number of observations (where m/n and r refer to the number of users/items and the non-negative rank respectively) both in terms of the total variation …