Open Access. Powered by Scholars. Published by Universities.®
- Discipline
-
- Physical Sciences and Mathematics (8526)
- Computer Sciences (8509)
- Databases and Information Systems (3448)
- Software Engineering (2153)
- Artificial Intelligence and Robotics (1686)
-
- Information Security (1060)
- Numerical Analysis and Scientific Computing (1024)
- Graphics and Human Computer Interfaces (926)
- Engineering (887)
- Social and Behavioral Sciences (681)
- Business (641)
- 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 (217)
- Transportation (195)
- Medicine and Health Sciences (178)
- Education (168)
- 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)
- Large Language Models (45)
- Blockchain (44)
- Collaboration (44)
- Semantics (43)
- Access control (41)
- Algorithms (40)
- Android (39)
- Classification (38)
- Publication Year
- File Type
Articles 1231 - 1260 of 8567
Full-Text Articles in Entire DC Network
Learning To Generate Explainable Stock Predictions Using Self‑Reflective Large Language Models, Kelvin J.L. Koa, Yunshan Ma, Ritchie Ng, Tat‑Seng Chua
Learning To Generate Explainable Stock Predictions Using Self‑Reflective Large Language Models, Kelvin J.L. Koa, Yunshan Ma, Ritchie Ng, Tat‑Seng Chua
Research Collection School Of Computing and Information Systems
Explaining stock predictions is generally a difficult task for traditional non-generative deep learning models, where explanations are limited to visualizing the attention weights on important texts. Today, Large Language Models (LLMs) present a solution to this problem, given their known capabilities to generate human-readable explanations for their decision-making process. However, the task of stock prediction remains challenging for LLMs, as it requires the ability to weigh the varying impacts of chaotic social texts on stock prices. The problem gets progressively harder with the introduction of the explanation component, which requires LLMs to explain verbally why certain factors are more important …
Discovering Personalized Characteristic Communities In Attributed Graphs, Yudong Niu, Yuchen Li, Panagiotis Karras, Yanhao Wang, Zhao Li
Discovering Personalized Characteristic Communities In Attributed Graphs, Yudong Niu, Yuchen Li, Panagiotis Karras, Yanhao Wang, Zhao Li
Research Collection School Of Computing and Information Systems
What is the widest community in which a person exercises a strong impact? Although extensive attention has been devoted to searching communities containing given individuals, the problem of finding their unique communities of influence has barely been examined. In this paper, we study the novel problem of Characteristic cOmmunity Discovery (COD) in attributed graphs. Our goal is to identify the largest community, taking into account the query attribute, in which the query node has a significant impact. The key challenge of the COD problem is that it requires evaluating the influence of the query node over a large number of …
Make Revocation Cheaper: Hardware-Based Revocable Attribute-Based Encryption, Xiaoguo Li, Guomin Yang, Tao Xiang, Shengmin Xu, Bowen Zhao, Robert H. Deng, Hwee Hwa Pang
Make Revocation Cheaper: Hardware-Based Revocable Attribute-Based Encryption, Xiaoguo Li, Guomin Yang, Tao Xiang, Shengmin Xu, Bowen Zhao, Robert H. Deng, Hwee Hwa Pang
Research Collection School Of Computing and Information Systems
As an advanced one-to-many public key encryption system, attribute-based encryption (ABE) is widely believed to be a promising technology for achieving flexible and fine-grained access control of encrypted data on untrusted storage servers (e.g., public cloud servers). However, user revocation in ABE is a critical but challenging problem, and designing efficient revocable ABE has been an active research topic in the past decade. Almost all the existing revocable ABE schemes incorporate a timestamp in the encryption algorithm such that revoked users cannot decrypt ciphertexts generated in future time intervals. To prevent revoked users from decrypting past ciphertexts, the storage server …
A Survey On Searchable Symmetric Encryption, Feng Li, Jianfeng Ma, Yinbin Miao, Ximeng Liu, Jianting Ning, Robert H. Deng
A Survey On Searchable Symmetric Encryption, Feng Li, Jianfeng Ma, Yinbin Miao, Ximeng Liu, Jianting Ning, Robert H. Deng
Research Collection School Of Computing and Information Systems
Outsourcing data to the cloud has become prevalent, so Searchable Symmetric Encryption (SSE), one of the methods for protecting outsourced data, has arisen widespread interest. Moreover, many novel technologies and theories have emerged, especially for the attacks on SSE and privacy-preserving. But most surveys related to SSE concentrate on one aspect (e.g., single keyword search, fuzzy keyword search) or lack in-depth analysis. Therefore, we revisit the existing work and conduct a comprehensive analysis and summary. We provide an overview of state-of-the-art in SSE and focus on the privacy it can protect. Generally, (1) we study the work of the past …
An Adaptive Large Neighborhood Search For The Multi-Vehicle Profitable Tour Problem With Flexible Compartments And Mandatory Customers, Vincent F. Yu, Nabila Yuraisyah Salsabila, Aldy Gunawan, Anggun Nurfitriani Handoko
An Adaptive Large Neighborhood Search For The Multi-Vehicle Profitable Tour Problem With Flexible Compartments And Mandatory Customers, Vincent F. Yu, Nabila Yuraisyah Salsabila, Aldy Gunawan, Anggun Nurfitriani Handoko
Research Collection School Of Computing and Information Systems
The home-refill delivery system is a business model that addresses the concerns of plastic waste and its impact on the environment. It allows customers to pick up their household goods at their doorsteps and refill them into their own containers. However, the difficulty in accessing customers’ locations and product consolidations are undeniable challenges. To overcome these issues, we introduce a new variant of the Profitable Tour Problem, named the multi-vehicle profitable tour problem with flexible compartments and mandatory customers (MVPTPFC-MC). The objective is to maximize the difference between the total collected profit and the traveling cost. We model the proposed …
Plug-And-Play Policy Planner For Large Language Model Powered Dialogue Agents, Yang Deng, Wenxuan Zhang, Wai Lam, See-Kiong Ng, Tat-Seng Chua
Plug-And-Play Policy Planner For Large Language Model Powered Dialogue Agents, Yang Deng, Wenxuan Zhang, Wai Lam, See-Kiong Ng, Tat-Seng Chua
Research Collection School Of Computing and Information Systems
Proactive dialogues serve as a practical yet challenging dialogue problem in the era of large language models (LLMs), where the dialogue policy planning is the key to improving the proactivity of LLMs. Most existing studies enable the dialogue policy planning of LLMs using various prompting schemes or iteratively enhance this capability in handling the given case with verbal AI feedback. However, these approaches are either bounded by the policy planning capability of the frozen LLMs or hard to be transferred to new cases. In this work, we introduce a new dialogue policy planning paradigm to strategize LLMs for proactive dialogue …
From Tweets To Token Sales: Assessing Ico Success Through Social Media Sentiments, Donghao Huang, S. Samuel, Quoc Toan Huynh, Zhaoxia Wang
From Tweets To Token Sales: Assessing Ico Success Through Social Media Sentiments, Donghao Huang, S. Samuel, Quoc Toan Huynh, Zhaoxia Wang
Research Collection School Of Computing and Information Systems
With the advent of social network technology, the influence of collective opinions has significantly impacted business, marketing, and fundraising. Particularly in the blockchain space, Initial Coin Offerings (ICOs) gain substantial exposure across various online platforms. Yet, the intricate relationships among these elements remain largely unexplored. This study aims to investigate the relationships between social media sentiment, engagement metrics, and ICO success. We hypothesize a positive correlation between favorable sentiment in ICO-related tweets and overall project success. Additionally, we recognize social media engagement indicators (mentions, retweets, likes, follower counts) as critical factors affecting ICO performance. Employing machine learning techniques, we conduct …
Intriguing Properties Of Data Attribution On Diffusion Models, Xiaosen Zheng, Tianyu Pang, Chao Du, Jing Jiang, Min Lin
Intriguing Properties Of Data Attribution On Diffusion Models, Xiaosen Zheng, Tianyu Pang, Chao Du, Jing Jiang, Min Lin
Research Collection School Of Computing and Information Systems
Data attribution seeks to trace model outputs back to training data. With the recent development of diffusion models, data attribution has become a desired module to properly assign valuations for high-quality or copyrighted training samples, ensuring that data contributors are fairly compensated or credited. Several theoretically motivated methods have been proposed to implement data attribution, in an effort to improve the trade-off between computational scalability and effectiveness. In this work, we conduct extensive experiments and ablation studies on attributing diffusion models, specifically focusing on DDPMs trained on CIFAR-10 and CelebA, as well as a Stable Diffusion model LoRA-finetuned on ArtBench. …
Learning Multi-Faceted Prototypical User Interests, Nhu Thuat Tran, Hady W. Lauw
Learning Multi-Faceted Prototypical User Interests, Nhu Thuat Tran, Hady W. Lauw
Research Collection School Of Computing and Information Systems
We seek to uncover the latent interest units from behavioral data to better learn user preferences under the VAE framework. Existing practices tend to ignore the multiple facets of item characteristics, which may not capture it at appropriate granularity. Moreover, current studies equate the granularity of item space to that of user interests, which we postulate is not ideal as user interests would likely map to a small subset of item space. In addition, the compositionality of user interests has received inadequate attention, preventing the modeling of interactions between explanatory factors driving a user's decision. To resolve this, we propose …
Reinforcement Retrieval Leveraging Fine-Grained Feedback For Fact Checking News Claims With Black-Box Llm, Xuan Zhang, Wei Gao
Reinforcement Retrieval Leveraging Fine-Grained Feedback For Fact Checking News Claims With Black-Box Llm, Xuan Zhang, Wei Gao
Research Collection School Of Computing and Information Systems
Retrieval-augmented language models have exhibited promising performance across various areas of natural language processing (NLP), including fact-critical tasks. However, due to the black-box nature of advanced large language models (LLMs) and the non-retrieval-oriented supervision signal of specific tasks, the training of retrieval model faces significant challenges under the setting of black-box LLM. We propose an approach leveraging Fine-grained Feedback with Reinforcement Retrieval (FFRR) to enhance fact-checking on news claims by using black-box LLM. FFRR adopts a two-level strategy to gather fine-grained feedback from the LLM, which serves as a reward for optimizing the retrieval policy, by rating the retrieved documents …
Benchmarking Marl On Long Horizon Sequential Multi-Objective Tasks, Minghong Geng, Shubham Pateria, Budhitama Subagdja, Ah-Hwee Tan
Benchmarking Marl On Long Horizon Sequential Multi-Objective Tasks, Minghong Geng, Shubham Pateria, Budhitama Subagdja, Ah-Hwee Tan
Research Collection School Of Computing and Information Systems
Current MARL benchmarks fall short in simulating realistic scenarios, particularly those involving long action sequences with sequential tasks and multiple conflicting objectives. Addressing this gap, we introduce Multi-Objective SMAC (MOSMAC), a novel MARL benchmark tailored to assess MARL methods on tasks with varying time horizons and multiple objectives. Each MOSMAC task contains one or multiple sequential subtasks. Agents are required to simultaneously balance between two objectives - combat and navigation - to successfully complete each subtask. Our evaluation of nine state-of-the-art MARL algorithms reveals that MOSMAC presents substantial challenges to many state-of-the-art MARL methods and effectively fills a critical gap …
Difference Of Convex Functions Programming For Policy Optimization In Reinforcement Learning, Akshat Kumar
Difference Of Convex Functions Programming For Policy Optimization In Reinforcement Learning, Akshat Kumar
Research Collection School Of Computing and Information Systems
We formulate the problem of optimizing an agent's policy within the Markov decision process (MDP) model as a difference-of-convex functions (DC) program. The DC perspective enables optimizing the policy iteratively where each iteration constructs an easier-to-optimize lower bound on the value function using the well known concave-convex procedure. We show that several popular policy gradient based deep RL algorithms (both for discrete and continuous state, action spaces, and stochastic/deterministic policies) such as actor-critic, deterministic policy gradient (DPG), and soft actor critic (SAC) can be derived from the DC perspective. Additionally, the DC formulation enables more sample efficient learning approaches by …
Quantum Machine Learning For Credit Scoring, Nikolaos Schetakis, Davit Aghamalyan, Micheael Boguslavsky, Agnieszka Rees, Marc Rakotomalala, Paul Robert Griffin
Quantum Machine Learning For Credit Scoring, Nikolaos Schetakis, Davit Aghamalyan, Micheael Boguslavsky, Agnieszka Rees, Marc Rakotomalala, Paul Robert Griffin
Research Collection School Of Computing and Information Systems
This study investigates the integration of quantum circuits with classical neural networks for enhancing credit scoring for small- and medium-sized enterprises (SMEs). We introduce a hybrid quantum–classical model, focusing on the synergy between quantum and classical rather than comparing the performance of separate quantum and classical models. Our model incorporates a quantum layer into a traditional neural network, achieving notable reductions in training time. We apply this innovative framework to a binary classification task with a proprietary real-world classical credit default dataset for SMEs in Singapore. The results indicate that our hybrid model achieves efficient training, requiring significantly fewer epochs …
An Evaluation Of Heart Rate Monitoring With In-Ear Microphones Under Motion, Kayla-Jade Butkow, Ting Dang, Andrea Ferlini, Dong Ma, Yang Liu, Cecilia Mascolo
An Evaluation Of Heart Rate Monitoring With In-Ear Microphones Under Motion, Kayla-Jade Butkow, Ting Dang, Andrea Ferlini, Dong Ma, Yang Liu, Cecilia Mascolo
Research Collection School Of Computing and Information Systems
With the soaring adoption of in-ear wearables, the research community has started investigating suitable in-ear heart rate detection systems. Heart rate is a key physiological marker of cardiovascular health and physical fitness. Continuous and reliable heart rate monitoring with wearable devices has therefore gained increasing attention in recent years. Existing heart rate detection systems in wearables mainly rely on photoplethysmography (PPG) sensors, however, these are notorious for poor performance in the presence of human motion. In this work, leveraging the occlusion effect that enhances low-frequency bone-conducted sounds in the ear canal, we investigate for the first time in-ear audio-based motion-resilient …
On The Feasibility Of Simple Transformer For Dynamic Graph Modeling, Yuxia Wu, Yuan Fang, Lizi Liao
On The Feasibility Of Simple Transformer For Dynamic Graph Modeling, Yuxia Wu, Yuan Fang, Lizi Liao
Research Collection School Of Computing and Information Systems
Dynamic graph modeling is crucial for understanding complex structures in web graphs, spanning applications in social networks, recommender systems, and more. Most existing methods primarily emphasize structural dependencies and their temporal changes. However, these approaches often overlook detailed temporal aspects or struggle with long-term dependencies. Furthermore, many solutions overly complicate the process by emphasizing intricate module designs to capture dynamic evolutions. In this work, we harness the strength of the Transformer’s self-attention mechanism, known for adeptly handling long-range dependencies in sequence modeling. Our approach offers a simple Transformer model, called SimpleDyG, tailored for dynamic graph modeling without complex modifications. We …
Swapvid: Integrating Video Viewing And Document Exploration With Direct Manipulation, Taichi Murakami, Kazuyuki Fujita, Kotaro Hara, Kazuki Takashima, Yoshifumi Kitamura
Swapvid: Integrating Video Viewing And Document Exploration With Direct Manipulation, Taichi Murakami, Kazuyuki Fujita, Kotaro Hara, Kazuki Takashima, Yoshifumi Kitamura
Research Collection School Of Computing and Information Systems
Videos accompanied by documents—document-based videos—enable presenters to share contents beyond videos and audience to use them for detailed content comprehension. However, concurrently exploring multiple channels of information could be taxing. We propose SwapVid, a novel interface for viewing and exploring document-based videos. SwapVid seamlessly integrates a video and a document into a single view and lets the content behaves as both video and a document; it adaptively switches a document-based video to act as a video or a document upon direct manipulation (e.g., scrolling the document, manipulating the video timeline). We conducted a user study with twenty participants, comparing SwapVid …
Large Language Model Powered Agents In The Web, Yang Deng, An Zhang, Yankai Lin, Xu Chen, Ji-Rong Wen, Tat-Seng Chua
Large Language Model Powered Agents In The Web, Yang Deng, An Zhang, Yankai Lin, Xu Chen, Ji-Rong Wen, Tat-Seng Chua
Research Collection School Of Computing and Information Systems
Web applications serve as vital interfaces for users to access information, perform various tasks, and engage with content. Traditional web designs have predominantly focused on user interfaces and static experiences. With the advent of large language models (LLMs), there’s a paradigm shift as we integrate LLM-powered agents into these platforms. These agents bring forth crucial human capabilities like memory and planning to make them behave like humans in completing various tasks, effectively enhancing user engagement and offering tailored interactions in web applications. In this tutorial, we delve into the cutting-edge techniques of LLM-powered agents across various web applications, such as …
Reinforcement Learning With Maskable Stock Representation For Portfolio Management In Customizable Stock Pools, Wentao Zhang, Yilei Zhao, Shuo Sun, Jie Ying, Yonggang Xie, Zitao Song, Xinrun Wang, Bo An
Reinforcement Learning With Maskable Stock Representation For Portfolio Management In Customizable Stock Pools, Wentao Zhang, Yilei Zhao, Shuo Sun, Jie Ying, Yonggang Xie, Zitao Song, Xinrun Wang, Bo An
Research Collection School Of Computing and Information Systems
Portfolio management (PM) is a fundamental financial trading task, which explores the optimal periodical reallocation of capitals into different stocks to pursue long-term profits. Reinforcement learning (RL) has recently shown its potential to train profitable agents for PM through interacting with financial markets. However, existing work mostly focuses on fixed stock pools, which is inconsistent with investors’ practical demand. Specifically, the target stock pool of different investors varies dramatically due to their discrepancy on market states and individual investors may temporally adjust stocks they desire to trade (e.g., adding one popular stocks), which lead to customizable stock pools (CSPs). Existing …
Unraveling The ‘Anomaly’ In Time Series Anomaly Detection: A Self-Supervised Tri-Domain Solution, Yuting Sun, Guansong Pang, Guanhua Ye, Tong Chen, Xia Hu, Hongzhi Yin
Unraveling The ‘Anomaly’ In Time Series Anomaly Detection: A Self-Supervised Tri-Domain Solution, Yuting Sun, Guansong Pang, Guanhua Ye, Tong Chen, Xia Hu, Hongzhi Yin
Research Collection School Of Computing and Information Systems
The ongoing challenges in time series anomaly detection (TSAD), including the scarcity of anomaly labels and the variability in anomaly lengths and shapes, have led to the need for a more robust and efficient solution. As limited anomaly labels hinder traditional supervised models in anomaly detection, various state-of-the-art (SOTA) deep learning (DL) techniques (e.g., self-supervised learning) are introduced to tackle this issue. However, they encounter difficulties handling variations in anomaly lengths and shapes, limiting their adaptability to diverse anomalies. Additionally, many benchmark datasets suffer from the problem of having explicit anomalies that even random functions can detect. This problem is …
Anomalyclip: Object-Agnostic Prompt Learning For Zero-Shot Anomaly Detection, Qihang Zhou, Guansong Pang, Yu Tian, Shibo He, Jiming Chen
Anomalyclip: Object-Agnostic Prompt Learning For Zero-Shot Anomaly Detection, Qihang Zhou, Guansong Pang, Yu Tian, Shibo He, Jiming Chen
Research Collection School Of Computing and Information Systems
Zero-shot anomaly detection (ZSAD) requires detection models trained using auxiliary data to detect anomalies without any training sample in a target dataset. It is a crucial task when training data is not accessible due to various concerns, e.g., data privacy, yet it is challenging since the models need to generalize to anomalies across different domains where the appearance of foreground objects, abnormal regions, and background features, such as defects/tumors on different products/ organs, can vary significantly. Recently large pre-trained vision-language models (VLMs), such as CLIP, have demonstrated strong zero-shot recognition ability in various vision tasks, including anomaly detection. However, their …
Deep Reinforcement Learning Guided Improvement Heuristic For Job Shop Scheduling, Cong Zhang, Zhiguang Cao, Wen Song, Yaoxin Wu, Jie Zhang
Deep Reinforcement Learning Guided Improvement Heuristic For Job Shop Scheduling, Cong Zhang, Zhiguang Cao, Wen Song, Yaoxin Wu, Jie Zhang
Research Collection School Of Computing and Information Systems
Recent studies in using deep reinforcement learning (DRL) to solve Job-shop scheduling problems (JSSP) focus on construction heuristics. However, their performance is still far from optimality, mainly because the underlying graph representation scheme is unsuitable for modelling partial solutions at each construction step. This paper proposes a novel DRL-guided improvement heuristic for solving JSSP, where graph representation is employed to encode complete solutions. We design a Graph-Neural-Network-based representation scheme, consisting of two modules to effectively capture the information of dynamic topology and different types of nodes in graphs encountered during the improvement process. To speed up solution evaluation during improvement, …
Text-Attributed Graph Representation Learning : Methods, Applications, And Challenges, Ce Zhang, Menglin Yang, Rex Ying, Hady Wirawan Lauw
Text-Attributed Graph Representation Learning : Methods, Applications, And Challenges, Ce Zhang, Menglin Yang, Rex Ying, Hady Wirawan Lauw
Research Collection School Of Computing and Information Systems
Text documents are usually connected in a graph structure, resulting in an important class of data named text-attributed graph, e.g., paper citation graph and Web page hyperlink graph. On the one hand, Graph Neural Networks (GNNs) consider text in each document as general vertex attribute and do not specifically deal with text data. On the other hand, Pre-trained Language Models (PLMs) and Topic Models (TMs) learn effective document embeddings. However, most models focus on text content in each single document only, ignoring link adjacency across documents. The above two challenges motivate the development of text-attributed graph representation learning, combining GNNs …
Learning Adversarial Semantic Embeddings For Zero-Shot Recognition In Open Worlds, Tianqi Li, Guansong Pang, Xiao Bai, Jin Zheng, Lei Zhou, Xin Ning
Learning Adversarial Semantic Embeddings For Zero-Shot Recognition In Open Worlds, Tianqi Li, Guansong Pang, Xiao Bai, Jin Zheng, Lei Zhou, Xin Ning
Research Collection School Of Computing and Information Systems
Zero-Shot Learning (ZSL) focuses on classifying samples of unseen classes with only their side semantic information presented during training. It cannot handle real-life, open-world scenarios where there are test samples of unknown classes for which neither samples (e.g., images) nor their side semantic information is known during training. Open-Set Recognition (OSR) is dedicated to addressing the unknown class issue, but existing OSR methods are not designed to model the semantic information of the unseen classes. To tackle this combined ZSL and OSR problem, we consider the case of “Zero-Shot Open-Set Recognition” (ZS-OSR), where a model is trained under the ZSL …
Escaping Saddle Points In Heterogeneous Federated Learning Via Distributed Sgd With Communication Compression, Sijin Chen, Zhize Li, Yuejie Chi
Escaping Saddle Points In Heterogeneous Federated Learning Via Distributed Sgd With Communication Compression, Sijin Chen, Zhize Li, Yuejie Chi
Research Collection School Of Computing and Information Systems
We consider the problem of finding second-order stationary points in the optimization of heterogeneous federated learning (FL). Previous works in FL mostly focus on first-order convergence guarantees, which do not rule out the scenario of unstable saddle points. Meanwhile, it is a key bottleneck of FL to achieve communication efficiency without compensating the learning accuracy, especially when local data are highly heterogeneous across different clients. Given this, we propose a novel algorithm PowerEF-SGD that only communicates compressed information via a novel error-feedback scheme. To our knowledge, PowerEF-SGD is the first distributed and compressed SGD algorithm that provably escapes saddle points …
Analyzing And Revivifying Function Signature Inference Using Deep Learning, Yan Lin, Trisha Singhal, Debin Gao, David Lo
Analyzing And Revivifying Function Signature Inference Using Deep Learning, Yan Lin, Trisha Singhal, Debin Gao, David Lo
Research Collection School Of Computing and Information Systems
Function signature plays an important role in binary analysis and security enhancement, with typical examples in bug finding and control-flow integrity enforcement. However, recovery of function signatures by static binary analysis is challenging since crucial information vital for such recovery is stripped off during compilation. Although function signature recovery using deep learning (DL) is proposed in an effort to handle such challenges, the reported accuracy is low for binaries compiled with optimizations. In this paper, we first perform a systematic study to quantify the extent to which compiler optimizations (negatively) impact the accuracy of existing DL techniques based on Recurrent …
Q-Learning Based Framework For Solving The Stochastic E-Waste Collection Problem, Dang Viet Anh Nguyen, Aldy Gunawan, Mustafa Misir, Pieter Vansteenwegen
Q-Learning Based Framework For Solving The Stochastic E-Waste Collection Problem, Dang Viet Anh Nguyen, Aldy Gunawan, Mustafa Misir, Pieter Vansteenwegen
Research Collection School Of Computing and Information Systems
Electrical and Electronic Equipment (EEE) has evolved into a gateway for accessing technological innovations. However, EEE imposes substantial pressure on the environment due to the shortened life cycles. E-waste encompasses discarded EEE and its components which are no longer in use. This study focuses on the e-waste collection problem and models it as a Vehicle Routing Problem with a heterogeneous fleet and a multi-period planning problem with time windows as well as stochastic travel times. Two different Q-learning-based methods are designed to enhance the search procedure for finding solutions. The first method involves utilizing the state-action value to determine the …
Ublade: Efficient Batch Processing For Uncertainty Graph Queries, Siyuan Yao, Yuchen Li, Shixuan Sun, Jiaxin Jiang, Bingsheng He
Ublade: Efficient Batch Processing For Uncertainty Graph Queries, Siyuan Yao, Yuchen Li, Shixuan Sun, Jiaxin Jiang, Bingsheng He
Research Collection School Of Computing and Information Systems
The study of uncertain graphs is crucial in diverse fields, including but not limited to protein interaction analysis, viral marketing, and network reliability. Processing queries on uncertain graphs presents formidable challenges due to the vast probabilistic space they encapsulate. While existing systems employ batch processing to address these challenges, their performance is often compromised by the suboptimal selection of parallel graph traversal methods, the excessive costs in random number generation, and additional sampling-loads intrinsic to batch processing. In this paper, we introduce uBlade, an efficient batch-processing framework for uncertain graph queries on multi-core CPUs. uBlade utilizes the work-efficient graph traversal, …
Online Control Of Adaptive Large Neighborhood Search Using Deep Reinforcement Learning, Reijnen Reijnen, Yingqian Zhang, Hoong Chuin Lau, Zaharah Bukhsh
Online Control Of Adaptive Large Neighborhood Search Using Deep Reinforcement Learning, Reijnen Reijnen, Yingqian Zhang, Hoong Chuin Lau, Zaharah Bukhsh
Research Collection School Of Computing and Information Systems
The Adaptive Large Neighborhood Search (ALNS) algorithm has shown considerable success in solving combinatorial optimization problems (COPs). Nonetheless, the performance of ALNS relies on the proper configuration of its selection and acceptance parameters, which is known to be a complex and resource-intensive task. To address this, we introduce a Deep Reinforcement Learning (DRL) based approach called DR-ALNS that selects operators, adjusts parameters, and controls the acceptance criterion throughout the search. The proposed method aims to learn, based on the state of the search, to configure ALNS for the next iteration to yield more effective solutions for the given optimization problem. …
Diffusion-Based Negative Sampling On Graphs For Link Prediction, Yuan Fang, Yuan Fang
Diffusion-Based Negative Sampling On Graphs For Link Prediction, Yuan Fang, Yuan Fang
Research Collection School Of Computing and Information Systems
Link prediction is a fundamental task for graph analysis with important applications on the Web, such as social network analysis and recommendation systems, etc. Modern graph link prediction methods often employ a contrastive approach to learn robust node representations, where negative sampling is pivotal. Typical negative sampling methods aim to retrieve hard examples based on either predefined heuristics or automatic adversarial approaches, which might be inflexible or difficult to control. Furthermore, in the context of link prediction, most previous methods sample negative nodes from existing substructures of the graph, missing out on potentially more optimal samples in the latent space. …
Multigprompt For Multi-Task Pre-Training And Prompting On Graphs, Xingtong Yu, Chang Zhou, Yuan Fang, Xinming Zhan
Multigprompt For Multi-Task Pre-Training And Prompting On Graphs, Xingtong Yu, Chang Zhou, Yuan Fang, Xinming Zhan
Research Collection School Of Computing and Information Systems
Graph Neural Networks (GNNs) have emerged as a mainstream technique for graph representation learning. However, their efficacy within an end-to-end supervised framework is significantly tied to the availability of task-specific labels. To mitigate labeling costs and enhance robustness in few-shot settings, pre-training on self-supervised tasks has emerged as a promising method, while prompting has been proposed to further narrow the objective gap between pretext and downstream tasks. Although there has been some initial exploration of prompt-based learning on graphs, they primarily leverage a single pretext task, resulting in a limited subset of general knowledge that could be learned from the …