Open Access. Powered by Scholars. Published by Universities.®
- Discipline
-
- Databases and Information Systems (3436)
- Software Engineering (2136)
- Artificial Intelligence and Robotics (1648)
- Information Security (1051)
- Numerical Analysis and Scientific Computing (1024)
-
- Graphics and Human Computer Interfaces (916)
- Engineering (857)
- Social and Behavioral Sciences (661)
- Business (625)
- Theory and Algorithms (493)
- Computer Engineering (431)
- Operations Research, Systems Engineering and Industrial Engineering (399)
- Programming Languages and Compilers (379)
- OS and Networks (322)
- Communication (297)
- Social Media (240)
- Public Affairs, Public Policy and Public Administration (207)
- Transportation (185)
- Medicine and Health Sciences (177)
- Education (164)
- Management Information Systems (164)
- Data Storage Systems (160)
- E-Commerce (146)
- Health Information Technology (107)
- International and Area Studies (107)
- Asian Studies (106)
- Technology and Innovation (100)
- Digital Communications and Networking (96)
- Keyword
-
- Deep learning (122)
- Machine learning (121)
- Social media (74)
- Artificial intelligence (70)
- Reinforcement learning (69)
-
- Data mining (64)
- Privacy (61)
- Cloud computing (58)
- Deep Learning (55)
- Empirical study (54)
- Security (53)
- Optimization (52)
- Visualization (51)
- Software engineering (49)
- Training (49)
- Neural networks (48)
- Online learning (48)
- Task analysis (48)
- Anomaly detection (47)
- Singapore (47)
- Twitter (46)
- Feature extraction (45)
- Blockchain (44)
- Collaboration (44)
- Semantics (43)
- Large Language Models (42)
- Access control (41)
- Algorithms (40)
- Android (39)
- Machine Learning (38)
- Publication Year
- File Type
Articles 361 - 390 of 8458
Full-Text Articles in Computer Sciences
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 …
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 …
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 …
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 …
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 …
Ponzilens+: Visualizing Bytecode Actions For Smart Ponzi Scheme Identification, Xiaolin Wen, Tai D. Nguyen, Shaolun Ruan, Qiaomu Shen, Jun Sun, Feida Zhu, Yong Wang
Ponzilens+: Visualizing Bytecode Actions For Smart Ponzi Scheme Identification, Xiaolin Wen, Tai D. Nguyen, Shaolun Ruan, Qiaomu Shen, Jun Sun, Feida Zhu, Yong Wang
Research Collection School Of Computing and Information Systems
With the prevalence of smart contracts, smart Ponzi schemes have become a common fraud on blockchain and have caused significant financial loss to cryptocurrency investors in the past few years. Despite the critical importance of detecting smart Ponzi schemes, a reliable and transparent identification approach adaptive to various smart Ponzi schemes is still missing. To fill the research gap, we first extract semantic-meaningful actions to represent the execution behaviors specified in smart contract bytecodes, which are derived from a literature review and in-depth interviews with domain experts. We then propose PonziLens+, a novel visual analytic approach that provides an intuitive …
Apidocbooster: An Extract-Then-Abstract Framework Leveraging Large Language Models For Augmenting Api Documentation, Chengran Yang, Jiakun Liu, Bowen Xu, Christoph Treude, Yunbo Lyu, Junda He, Ming Li, David Lo
Apidocbooster: An Extract-Then-Abstract Framework Leveraging Large Language Models For Augmenting Api Documentation, Chengran Yang, Jiakun Liu, Bowen Xu, Christoph Treude, Yunbo Lyu, Junda He, Ming Li, David Lo
Research Collection School Of Computing and Information Systems
API documentation is often the most trusted resource for programming. Many approaches have been proposed to augment API documentation by summarizing complementary information from external resources such as Stack Overflow. Existing extractive-based summarization approaches excel in producing faithful summaries that accurately represent the source content without input length restrictions. Nevertheless, they suffer from inherent readability limitations. On the other hand, our empirical study on the abstractive-based summarization method, i.e., GPT-4, reveals that GPT-4 can generate coherent and concise summaries but presents limitations in terms of informativeness and faithfulness. We introduce APIDocBooster, an extract-then-abstract framework that seamlessly fuses the advantages of …
Map As A By-Product: Collective Landmark Mapping From Imu Data And User-Provided Texts In Situated Tasks, Ryo Yonetani, Kotaro Hara
Map As A By-Product: Collective Landmark Mapping From Imu Data And User-Provided Texts In Situated Tasks, Ryo Yonetani, Kotaro Hara
Research Collection School Of Computing and Information Systems
This paper presents Collective Landmark Mapper, a novel map-as-a-by-product system for generating semantic landmark maps of indoor environments. Consider users engaged in situated tasks that require them to navigate these environments and regularly take notes on their smartphones. Collective Landmark Mapper exploits the smartphone's IMU data and the user's free text input during these tasks to identify a set of landmarks encountered by the user. The identified landmarks are then aggregated across multiple users to generate a unified map representing the positions and semantic information of all landmarks. In developing the proposed system, we focused specifically on retail applications and …
Conv4rec: A 1‑By‑1 Convolutional Autoencoder For User Profiling Through Joint Analysis Of Implicit And Explicit Feedbacks, Antoine Ledent, Petr Kasalický, Rodrigo Alves, Hady Wirawan Lauw
Conv4rec: A 1‑By‑1 Convolutional Autoencoder For User Profiling Through Joint Analysis Of Implicit And Explicit Feedbacks, Antoine Ledent, Petr Kasalický, Rodrigo Alves, Hady Wirawan Lauw
Research Collection School Of Computing and Information Systems
We introduce a new convolutional autoencoder architecture for user modeling and recommendation tasks with several improvements over the state of the art. First, our model has the flexibility to learn a set of associations and combinations between different interaction types in a way that carries over to each user and item. Second, our model is able to learn jointly from both the explicit ratings and the implicit information in the sampling pattern (which we refer to as ”implicit feedback”). It can also make separate predictions for the probability of consuming content and the likelihood of granting it a high rating …
Finding Safety Violations Of Ai-Enabled Control Systems Through The Lens Of Synthesized Proxy Programs, Jieke Shi, Zhou Yang, Junda He, Bowen Xu, Dongsun Kim, Donggyun Han, David Lo
Finding Safety Violations Of Ai-Enabled Control Systems Through The Lens Of Synthesized Proxy Programs, Jieke Shi, Zhou Yang, Junda He, Bowen Xu, Dongsun Kim, Donggyun Han, David Lo
Research Collection School Of Computing and Information Systems
Given the increasing adoption of modern AI-enabled control systems, ensuring their safety and reliability has become a critical task in software testing. One prevalent approach to testing control systems is falsification, which aims to find an input signal that causes the control system to violate a formal safety specification using optimization algorithms. However, applying falsification to AI-enabled control systems poses two significant challenges: (1) it requires the system to execute numerous candidate test inputs, which can be time-consuming, particularly for systems with AI models that have many parameters, and (2) multiple safety requirements are typically defined as a conjunctive specification, …
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, …
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 …
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 …
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 …
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 …
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.
Privacy-Preserving Ridge Regression Over Encrypted Data Under Multiple Keys, Yanling Li, Junzuo Lai, Meng Sun, Beibei Song, Robert H. Deng
Privacy-Preserving Ridge Regression Over Encrypted Data Under Multiple Keys, Yanling Li, Junzuo Lai, Meng Sun, Beibei Song, Robert H. Deng
Research Collection School Of Computing and Information Systems
With the increase of private data being collected by data owners, it has been a trend for data owners to store the data on cloud computing platforms. The huge amounts of data in cloud servers bring fresh development opportunities to machine learning, which is applied to build a high-quality machine learning model based on a large training dataset. However, to ensure the privacy of data and facilitate retrieval, data owners often upload encrypted data under their public keys. But it creates new challenges for machine learning to learn a predictive model over these encrypted data under different keys. Most existing …
Static Analysis As A Feedback Loop: Enhancing Llm-Generated Code Beyond Correctness, Scott Blyth, Sherlock Licorish, Christoph Treude, Markus Wagner
Static Analysis As A Feedback Loop: Enhancing Llm-Generated Code Beyond Correctness, Scott Blyth, Sherlock Licorish, Christoph Treude, Markus Wagner
Research Collection School Of Computing and Information Systems
Large language models (LLMs) have demonstrated impressive capabilities in code generation, achieving high scores on benchmarks such as HumanEval and MBPP. However, these benchmarks primarily assess functional correctness and neglect broader dimensions of code quality, including security, reliability, readability, and maintainability. In this work, we systematically evaluate the ability of LLMs to generate high-quality code across multiple dimensions using the PythonSecurityEval benchmark. We introduce an iterative static analysis-driven prompting algorithm that leverages Bandit and Pylint to identify and resolve code quality issues. Our experiments with GPT-4o show substantial improvements: security issues reduced from >40% to 13%, readability violations from >80% …
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 …
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 …
Coupling Category Alignment For Graph Domain Adaptation, Nan Yin, Xiao Teng, Zhiguang Cao, Mengzhu Wang
Coupling Category Alignment For Graph Domain Adaptation, Nan Yin, Xiao Teng, Zhiguang Cao, Mengzhu Wang
Research Collection School Of Computing and Information Systems
Graph domain adaptation (GDA), which transfers knowledge from a labeled source domain to an unlabeled target graph domain, attracts considerable attention in numerous fields. However, existing methods commonly employ message-passing neural networks (MPNNs) to learn domain-invariant representations by aligning the entire domain distribution, inadvertently neglecting category-level distribution alignment and potentially causing category confusion. To address the problem, we propose an effective framework named Coupling Category Alignment (CoCA) for GDA, which effectively addresses the category alignment issue with theoretical guarantees. CoCA incorporates a graph convolutional network branch and a graph kernel network branch, which explore graph topology in implicit and explicit …
Detecting Defi Fraud With A Graph-Transformer Language Model, Wei Ma, Junjie Shi, Jiaxi Qiu, Cong Wu, Jing Chen, Lingxiao Jiang, Shangqing Liu, Yang Liu, Yang Xiang
Detecting Defi Fraud With A Graph-Transformer Language Model, Wei Ma, Junjie Shi, Jiaxi Qiu, Cong Wu, Jing Chen, Lingxiao Jiang, Shangqing Liu, Yang Liu, Yang Xiang
Research Collection School Of Computing and Information Systems
With the rapid development of blockchain technology, the widespread adoption of smart contracts—particularly in decentralized finance (DeFi) applications—has introduced significant security challenges, such as reentrancy attacks, phishing, and Sybil attacks. To address these issues, we propose a novel model called TrxGNNBERT, which combines Graph Neural Network (GNN) and the Transformer architecture to effectively handle both graph-structured and textual data. This combination enhances the detection of suspicious transactions and accounts on blockchain platforms like Ethereum. TrxGNNBERT was pre-trained using a masked language model (MLM) on a dataset of 60,000 Ethereum transactions by randomly masking the attributes of nodes and edges, thereby …
Towards Multimodal Emotional Support Conversation Systems, Yuqi Chu, Lizi Liao, Zhiyuan Zhou, Chong-Wah Ngo, Richang Hong
Towards Multimodal Emotional Support Conversation Systems, Yuqi Chu, Lizi Liao, Zhiyuan Zhou, Chong-Wah Ngo, Richang Hong
Research Collection School Of Computing and Information Systems
The integration of conversational artificial intelligence (AI) into mental health care promises a new horizon for therapist-client interactions, aiming to closely emulate the depth and nuance of human conversations. Despite the potential, the current landscape of conversational AI is markedly limited by its reliance on single-modal data, constraining the systems’ ability to empathize and provide effective emotional support. This limitation stems from a paucity of resources that encapsulate the multimodal nature of human communication essential for therapeutic counseling. To address this gap, we introduce the Multimodal Emotional Support Conversation (MESC) dataset, a first-of-its-kind resource enriched with comprehensive annotations across text, …
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 …
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 …