Open Access. Powered by Scholars. Published by Universities.®
- Discipline
-
- Physical Sciences and Mathematics (5591)
- Computer Sciences (5576)
- Databases and Information Systems (2329)
- Software Engineering (1250)
- Artificial Intelligence and Robotics (1149)
-
- Numerical Analysis and Scientific Computing (724)
- Engineering (708)
- Information Security (686)
- Graphics and Human Computer Interfaces (581)
- Business (502)
- Social and Behavioral Sciences (501)
- Computer Engineering (349)
- Theory and Algorithms (341)
- Operations Research, Systems Engineering and Industrial Engineering (335)
- Programming Languages and Compilers (241)
- OS and Networks (219)
- Communication (186)
- Public Affairs, Public Policy and Public Administration (184)
- Transportation (167)
- Medicine and Health Sciences (160)
- Education (150)
- Social Media (148)
- Management Information Systems (140)
- E-Commerce (116)
- Data Storage Systems (109)
- Health Information Technology (98)
- International and Area Studies (87)
- Asian Studies (86)
- Digital Communications and Networking (82)
- Higher Education (78)
- Keyword
-
- Deep learning (90)
- Machine learning (88)
- Artificial intelligence (55)
- Reinforcement learning (53)
- Cloud computing (51)
-
- Privacy (49)
- Data mining (47)
- Online learning (44)
- Security (44)
- Social media (43)
- Empirical study (42)
- Optimization (42)
- Training (42)
- Visualization (41)
- Task analysis (39)
- Access control (38)
- Feature extraction (37)
- Neural networks (37)
- Deep Learning (34)
- Software engineering (34)
- Blockchain (33)
- Machine Learning (31)
- Twitter (31)
- Anomaly detection (30)
- Large Language Models (30)
- Privacy-preserving (30)
- Natural language processing (29)
- Singapore (29)
- Clustering (28)
- Collaboration (28)
- Publication Year
Articles 811 - 840 of 5707
Full-Text Articles in Entire DC Network
Pkt-Sin: A Secure Communication Protocol For Space Information Networks With Periodic K-Time Anonymous Authentication, Yang Yang, Wenyi Xue, Jianfei Sun, Guomin Yang, Yingjiu Li, Hwee Hwa Pang, Robert H. Deng
Pkt-Sin: A Secure Communication Protocol For Space Information Networks With Periodic K-Time Anonymous Authentication, Yang Yang, Wenyi Xue, Jianfei Sun, Guomin Yang, Yingjiu Li, Hwee Hwa Pang, Robert H. Deng
Research Collection School Of Computing and Information Systems
Space Information Network (SIN) enables universal Internet connectivity for any object, even in remote and extreme environments where deploying a cellular network is difficult. Access authentication is crucial for ensuring user access control in SIN and preventing unauthorized entities from gaining access to network services. However, due to the complex communication environment in SIN, including exposed links and higher signal delay, designing a secure and efficient authentication scheme presents a significant challenge. In this paper, we propose a secure communication protocol for SIN with periodic k-time anonymous authentication (named PkT-SIN) that allows satellite users to anonymously authenticate to ground stations …
Factors Affecting Online Consumers' Cultural Presence And Cultural Immersion Experiences In Live Streaming Shopping, Lifu Li, Kyeong Kang, Yafei Feng, Anqi Zhao
Factors Affecting Online Consumers' Cultural Presence And Cultural Immersion Experiences In Live Streaming Shopping, Lifu Li, Kyeong Kang, Yafei Feng, Anqi Zhao
Research Collection School Of Computing and Information Systems
This paper conducts research on the interaction between ethnic minority group (EMG) live streamers and online consumers, aiming to present how EMG live streamers’ appearance and interaction factors affect online consumers’ cultural experience during live streaming shopping. Based on the social presence theory and the immersion theory, this paper explores how EMG live streamers impact online consumers’ cultural experience, and it designs personal EMG knowledge as a moderating variable under specific social and cultural backgrounds. Through analysing 325 online questionnaires based on the partial least squares path modelling and variance-based structural equation modelling (PLS-SEM), the study results support that both …
Imitating Cost-Constrained Behaviors In Reinforcement Learning, Qian Shao, Pradeep Varakantham, Shih-Fen Cheng
Imitating Cost-Constrained Behaviors In Reinforcement Learning, Qian Shao, Pradeep Varakantham, Shih-Fen Cheng
Research Collection School Of Computing and Information Systems
Complex planning and scheduling problems have long been solved using various optimization or heuristic approaches. In recent years, imitation learning that aims to learn from expert demonstrations has been proposed as a viable alternative to solving these problems. Generally speaking, imitation learning is designed to learn either the reward (or preference) model or directly the behavioral policy by observing the behavior of an expert. Existing work in imitation learning and inverse reinforcement learning has focused on imitation primarily in unconstrained settings (e.g., no limit on fuel consumed by the vehicle). However, in many real-world domains, the behavior of an expert …
The Next 'Deep' Thing In X To Z Marketing: An Artificial Intelligence Driven Approach, Vincent Charles, Nripendra Rana, Ilias O. Pappas, Morten Kamphaug, Keng Siau, Kenth Engo-Monsen
The Next 'Deep' Thing In X To Z Marketing: An Artificial Intelligence Driven Approach, Vincent Charles, Nripendra Rana, Ilias O. Pappas, Morten Kamphaug, Keng Siau, Kenth Engo-Monsen
Research Collection School Of Computing and Information Systems
The existing body of literature indicates a growing interest in research pertaining to the influence of artificial intelligence (AI) on marketing strategies, processes, and practices. However, further studies are required to fully unravel its complete potential and the implications it holds for practical application. The aim of this special issue on “The Next ‘Deep’ Thing in X to Z Marketing: An Artificial Intelligence-Driven Approach” is to explore the next frontiers and delve into the various facets of AI-driven marketing, shedding light on cutting-edge research and practical insights that can shape the future of the field. It also focuses on novel …
Mix-Initiative Response Generation With Dynamic Prefix Tuning, Yuxiang Nie, Heyan Huang, Xian-Ling Mao, Lizi Liao
Mix-Initiative Response Generation With Dynamic Prefix Tuning, Yuxiang Nie, Heyan Huang, Xian-Ling Mao, Lizi Liao
Research Collection School Of Computing and Information Systems
Mixed initiative serves as one of the key factors in controlling conversation directions. For a speaker, responding passively or leading proactively would result in rather different responses. However, most dialogue systems focus on training a holistic response generation model without any distinction among different initiatives. It leads to the cross-contamination problem, where the model confuses different initiatives and generates inappropriate responses. Moreover, obtaining plenty of human annotations for initiative labels can be expensive. To address this issue, we propose a general mix-Initiative Dynamic Prefix Tuning framework (IDPT) to decouple different initiatives from the generation model, which learns initiative-aware prefixes in …
Generalized Graph Prompt: Toward A Unification Of Pre-Training And Downstream Tasks On Graphs, Xingtong Yu, Zhenghao Liu, Yuan Fang, Et Al.
Generalized Graph Prompt: Toward A Unification Of Pre-Training And Downstream Tasks On Graphs, Xingtong Yu, Zhenghao Liu, Yuan Fang, Et Al.
Research Collection School Of Computing and Information Systems
Graphs can model complex relationships between objects, enabling a myriad of Web applications such as online page/article classification and social recommendation. While graph neural networks (GNNs) have emerged as a powerful tool for graph representation learning, in an end-to-end supervised setting, their performance heavily relies on a large amount of task-specific supervision. To reduce labeling requirement, the 'pre-train, fine-tune' and 'pre-train, prompt' paradigms have become increasingly common. In particular, prompting is a popular alternative to fine-tuning in natural language processing, which is designed to narrow the gap between pre-training and downstream objectives in a task-specific manner. However, existing study of …
Learning Transferable Negative Prompts For Out-Of-Distribution Detection, Tianqi Li, Guansong Pang, Xiao Bai, Wenjun Miao, Jin Zheng
Learning Transferable Negative Prompts For Out-Of-Distribution Detection, Tianqi Li, Guansong Pang, Xiao Bai, Wenjun Miao, Jin Zheng
Research Collection School Of Computing and Information Systems
Existing prompt learning methods have shown certain capabilities in Out-of-Distribution (OOD) detection, but the lack of OOD images in the target dataset in their training can lead to mismatches between OOD images and In-Distribution (ID) categories, resulting in a high false positive rate. To address this issue, we introduce a novel OOD detection method, named ‘NegPrompt’, to learn a set of negative prompts, each representing a negative connotation of a given class label, for delineating the boundaries between ID and OOD images. It learns such negative prompts with ID data only, without any reliance on external out-lier data. Further, current …
Anomaly Heterogeneity Learning For Open-Set Supervised Anomaly Detection, Jiawen Zhu, Choubo Ding, Yu Tian, Guansong Pang
Anomaly Heterogeneity Learning For Open-Set Supervised Anomaly Detection, Jiawen Zhu, Choubo Ding, Yu Tian, Guansong Pang
Research Collection School Of Computing and Information Systems
Open-set supervised anomaly detection (OSAD) - a recently emerging anomaly detection area - aims at utilizing a few samples of anomaly classes seen during training to detect unseen anomalies (i.e., samples from open-set anomaly classes), while effectively identifying the seen anomalies. Benefiting from the prior knowledge illustrated by the seen anomalies, current OSAD methods can often largely reduce false positive errors. However, these methods are trained in a closed-set setting and treat the anomaly examples as from a homogeneous distribution, rendering them less effective in generalizing to unseen anomalies that can be drawn from any distribution. This paper proposes to …
Open-Vocabulary Video Anomaly Detection, Peng Wu, Xuerong Zhou, Guansong Pang, Yujia Sun, Jing Liu, Peng Wang, Yanning Zhang
Open-Vocabulary Video Anomaly Detection, Peng Wu, Xuerong Zhou, Guansong Pang, Yujia Sun, Jing Liu, Peng Wang, Yanning Zhang
Research Collection School Of Computing and Information Systems
Current video anomaly detection (VAD) approaches with weak supervisions are inherently limited to a closed-set setting and may struggle in open-world applications where there can be anomaly categories in the test data unseen during training. A few recent studies attempt to tackle a more realistic setting, open-set VAD, which aims to de-tect unseen anomalies given seen anomalies and normal videos. However, such a setting focuses on predicting frame anomaly scores, having no ability to recognize the specific categories of anomalies, despite the fact that this ability is essential for building more informed video surveillance systems. This paper takes a step …
Toward Generalist Anomaly Detection Via In-Context Residual Learning With Few-Shot Sample Prompts, Jiawen Zhu, Guansong Pang
Toward Generalist Anomaly Detection Via In-Context Residual Learning With Few-Shot Sample Prompts, Jiawen Zhu, Guansong Pang
Research Collection School Of Computing and Information Systems
This paper explores the problem of Generalist Anomaly Detection (GAD), aiming to train one single detection model that can generalize to detect anomalies in diverse datasets from different application domains without any further training on the target data. Some recent studies have showed that large pre-trained Visual-Language Models (VLMs) like CLIP have strong generalization capabilities on detecting industrial defects from various datasets, but their methods rely heavily on handcrafted text prompts about defects, making them difficult to generalize to anomalies in other applications, e.g., medical image anomalies or semantic anomalies in natural images. In this work, we propose to train …
D3still : Decoupled Differential Distillation For Asymmetric Image Retrieval, Yi Xie, Yihong Lin, Wenjie Cai, Xuemiao Xu, Huaidong Zhang, Yong Du, Shengfeng He
D3still : Decoupled Differential Distillation For Asymmetric Image Retrieval, Yi Xie, Yihong Lin, Wenjie Cai, Xuemiao Xu, Huaidong Zhang, Yong Du, Shengfeng He
Research Collection School Of Computing and Information Systems
Existing methods for asymmetric image retrieval employ a rigid pairwise similarity constraint between the query network and the larger gallery network. However, these oneto-one constraint approaches often fail to maintain retrieval order consistency, especially when the query network has limited representational capacity. To overcome this problem, we introduce the Decoupled Differential Distillation (D3still) framework. This framework shifts from absolute one-to-one supervision to optimizing the relational differences in pairwise similarities produced by the query and gallery networks, thereby preserving a consistent retrieval order across both networks. Our method involves computing a pairwise similarity differential matrix within the gallery domain, which is …
Rethinking Multi-View Representation Learning Via Distilled Disentangling, Guanzhou Ke, Bo Wang, Xiaoli Wang, Shengfeng He
Rethinking Multi-View Representation Learning Via Distilled Disentangling, Guanzhou Ke, Bo Wang, Xiaoli Wang, Shengfeng He
Research Collection School Of Computing and Information Systems
Multi-view representation learning aims to derive robust representations that are both view-consistent and view-specific from diverse data sources. This paper presents an in-depth analysis of existing approaches in this domain, highlighting a commonly overlooked aspect: the redundancy between view-consistent and view-specific representations. To this end, we propose an innovative framework for multi-view representation learning, which incorporates a technique we term 'distilled disentangling'. Our method introduces the concept of masked cross-view prediction, enabling the extraction of compact, high-quality view-consistent representations from various sources without incurring extra computational overhead. Additionally, we develop a distilled disentangling module that efficiently filters out consistency-related information …
Network-Based Representations And Dynamic Discrete Choice Models For Multiple Discrete Choice Analysis, Huy Hung Tran, Tien Mai
Network-Based Representations And Dynamic Discrete Choice Models For Multiple Discrete Choice Analysis, Huy Hung Tran, Tien Mai
Research Collection School Of Computing and Information Systems
In many choice modeling applications, consumer demand is frequently characterized as multiple discrete, which means that consumer choose multiple items simultaneously. The analysis and prediction of consumer behavior in multiple discrete choice situations pose several challenges. In this paper, to address this, we propose a random utility maximization (RUM) based model that considers each subset of choice alternatives as a composite alternative, where individuals choose a subset according to the RUM framework. While this approach offers a natural and intuitive modeling approach for multiple-choice analysis, the large number of subsets of choices in the formulation makes its estimation and application …
Inceptionnext: When Inception Meets Convnext, Weihao Yu, Pan Zhou, Shuicheng Yan, Xinchao Wang
Inceptionnext: When Inception Meets Convnext, Weihao Yu, Pan Zhou, Shuicheng Yan, Xinchao Wang
Research Collection School Of Computing and Information Systems
Inspired by the long-range modeling ability of ViTs, large-kernel convolutions are widely studied and adopted recently to enlarge the receptive field and improve model performance, like the remarkable work ConvNeXt which employs 7×7 depthwise convolution. Although such depthwise operator only consumes a few FLOPs, it largely harms the model efficiency on powerful computing devices due to the high memory access costs. For example, ConvNeXtT has similar FLOPs with ResNet-50 but only achieves ∼ 60% throughputs when trained on A100 GPUs with full precision. Although reducing the kernel size of ConvNeXt can improve speed, it results in significant performance degradation, which …
Consistent3d: Towards Consistent High-Fidelity Text-To-3d Generation With Deterministic Sampling Prior, Zike Wu, Pan Zhou, Xuanyu Yi, Xiaoding Yuan, Hanwang Zhang
Consistent3d: Towards Consistent High-Fidelity Text-To-3d Generation With Deterministic Sampling Prior, Zike Wu, Pan Zhou, Xuanyu Yi, Xiaoding Yuan, Hanwang Zhang
Research Collection School Of Computing and Information Systems
Score distillation sampling (SDS) and its variants have greatly boosted the development of text-to-3D generation, but are vulnerable to geometry collapse and poor textures yet. To solve this issue, we first deeply analyze the SDS and find that its distillation sampling process indeed corresponds to the trajectory sampling of a stochastic differential equation (SDE): SDS samples along an SDE trajectory to yield a less noisy sample which then serves as a guidance to optimize a 3D model. However, the randomness in SDE sampling often leads to a diverse and unpredictable sample which is not always less noisy, and thus is …
Let’S Think Outside The Box: Exploring Leap-Of-Thought In Large Language Models With Multimodal Humor Generation, Shanshan Zhong, Zhongzhan Huang, Shanghua Gao, Wushao Wen, Liang Lin, Marinka Zitnik, Pan Zhou
Let’S Think Outside The Box: Exploring Leap-Of-Thought In Large Language Models With Multimodal Humor Generation, Shanshan Zhong, Zhongzhan Huang, Shanghua Gao, Wushao Wen, Liang Lin, Marinka Zitnik, Pan Zhou
Research Collection School Of Computing and Information Systems
Chain-of-Thought (CoT) [2, 3] guides large language models (LLMs) to reason step-by-step, and can motivate their logical reasoning ability. While effective for logical tasks, CoT is not conducive to creative problem-solving which often requires out-of-box thoughts and is crucial for innovation advancements. In this paper, we explore the Leap-of-Thought (LoT) abilities within LLMs — a nonsequential, creative paradigm involving strong associations and knowledge leaps. To this end, we study LLMs on the popular Oogiri game which needs participants to have good creativity and strong associative thinking for responding unexpectedly and humorously to the given image, text, or both, and thus …
Friendly Sharpness-Aware Minimization, Tao Li, Pan Zhou, Zhengbao He, Xinwen Cheng, Xiaolin Huang
Friendly Sharpness-Aware Minimization, Tao Li, Pan Zhou, Zhengbao He, Xinwen Cheng, Xiaolin Huang
Research Collection School Of Computing and Information Systems
Sharpness-Aware Minimization (SAM) has been instrumental in improving deep neural network training by minimizing both training loss and loss sharpness. Despite the practical success, the mechanisms behind SAM’s generalization enhancements remain elusive, limiting its progress in deep learning optimization. In this work, we investigate SAM’s core components for generalization improvement and introduce “Friendly-SAM” (F-SAM) to further enhance SAM’s generalization. Our investigation reveals the key role of batch-specific stochastic gradient noise within the adversarial perturbation, i.e., the current minibatch gradient, which significantly influences SAM’s generalization performance. By decomposing the adversarial perturbation in SAM into full gradient and stochastic gradient noise components, …
Detecting Foot Strikes During Running With Earbuds, Changshuo Hu, Thivya Kandappu, Jake Stuchbury-Wass, Yang Liu, Anthony Tang, Cecelia Mascolo, Dong Ma
Detecting Foot Strikes During Running With Earbuds, Changshuo Hu, Thivya Kandappu, Jake Stuchbury-Wass, Yang Liu, Anthony Tang, Cecelia Mascolo, Dong Ma
Research Collection School Of Computing and Information Systems
Running is a widely embraced form of aerobic exercise, offering various physical and mental benefits. However, improper running gaits (i.e., the way of foot landing) can pose safety risks and impact running efficiency. As many runners lack the knowledge or continuous attention to manage their foot strikes during running, in this work, we present a portable and non-invasive running gait monitoring system. Specifically, we leverage the in-ear microphone on wireless earbuds to capture the vibrations generated by foot strikes. Landing with different parts of the foot (e.g., forefoot and heel) generates distinct vibration patterns, and thus we utilize machine learning …
Gts: Gpu-Based Tree Index For Fast Similarity Search, Yifan Zhu, Ruiyao Ma, Baihua Zheng, Xiangyu Ke, Lu Chen, Yunjun Gao
Gts: Gpu-Based Tree Index For Fast Similarity Search, Yifan Zhu, Ruiyao Ma, Baihua Zheng, Xiangyu Ke, Lu Chen, Yunjun Gao
Research Collection School Of Computing and Information Systems
Similarity search, the task of identifying objects most similar to a given query object under a specific metric, has gathered significant attention due to its practical applications. However, the absence of coordinate information to accelerate similarity search and the high computational cost of measuring object similarity hinder the efficiency of existing CPU-based methods. Additionally, these methods struggle to meet the demand for high throughput data management. To address these challenges, we propose GTS, a GPU-based tree index designed for the parallel processing of similarity search in general metric spaces, where only the distance metric for measuring object similarity is known. …
How Is Our Mobility Affected As We Age? Findings From A 934 Users Field Study Of Older Adults Conducted In An Urban Asian City, Yi Zhen Tan, Ngoc Doan Thu Tran, Sapphire Lin, Fang Zhao, Yee Sien Ng, Dong Ma, Jeonggil Ko, Rajesh Krishna Balan
How Is Our Mobility Affected As We Age? Findings From A 934 Users Field Study Of Older Adults Conducted In An Urban Asian City, Yi Zhen Tan, Ngoc Doan Thu Tran, Sapphire Lin, Fang Zhao, Yee Sien Ng, Dong Ma, Jeonggil Ko, Rajesh Krishna Balan
Research Collection School Of Computing and Information Systems
In this paper, we analyze the results of a large study involving 934 older adults living in an urban Asian city that collected their mobility patterns, in the form of logged GPS data, along with a multitude of demographic and health data. We show that mobility, in terms of average distance travelled per day, is greatly affected by age and by employment status. In addition, other factors such as type of day, household size, physical and financial conditions and the onset of retirement also play a significant role in determining the mobility of an individual. These results will have high …
Usability Versus Collectibility In Nft: The Case Of Web3 Domain Names, Ping Fan Ke, Yi Meng Lau
Usability Versus Collectibility In Nft: The Case Of Web3 Domain Names, Ping Fan Ke, Yi Meng Lau
Research Collection School Of Computing and Information Systems
This study examines the market’s inclination towards usability and collectibility aspects of Non-Fungible Tokens (NFTs) within Web3 domain name marketplaces, drawing insights from resale records. Our findings reveal a prevailing preference for usability, as evidenced by consistently higher average resale prices observed for Ethereum Name Service (ENS) domains compared to Linagee Name Registrar (LNR) domains. However, domains with diminished usability, such as those containing non-ASCII characters, tend to attract investors due to their enhanced collectibility. Our analysis on the effect from previous resale suggests a potential aversion towards second-hand acquisitions among NFT investors when value derives primarily from usability, while …
Predicting Mild Cognitive Impairment Through Ambient Sensing And Artificial Intelligence, Ah-Hwee Tan, Weng Yan Ying, Budhitama Subagdja, Anni Huang, Shanthoshigaa D, Tony Chin-Ian Tay, Iris Rawtaer
Predicting Mild Cognitive Impairment Through Ambient Sensing And Artificial Intelligence, Ah-Hwee Tan, Weng Yan Ying, Budhitama Subagdja, Anni Huang, Shanthoshigaa D, Tony Chin-Ian Tay, Iris Rawtaer
Research Collection School Of Computing and Information Systems
This paper reports an emerging application leveraging ambient and artificial intelligence techniques for in-home sensing and cognitive health assessment. The application involves a prospective longitudinal study, wherein non-pervasive sensing devices are installed in homes of over 63 real users undergoing clinical cognitive assessment, and digital signals of the users’ activities and behaviour are transmitted to a central cloud-based data server for further processing and analysis. Based on the sensor readings, we identify a set of digital biomarkers covering four key aspects of daily living, namely physical, activity, cognitive, and sleep, and develop a suite of customized feature extraction methods for …
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. …
Collaborative Deep Reinforcement Learning For Solving Multi-Objective Vehicle Routing Problems, Yaoxin Wu, Mingfeng Fan, Zhiguang Cao, Ruobin Gao, Yaqing Hou, Guillaume Sartoretti
Collaborative Deep Reinforcement Learning For Solving Multi-Objective Vehicle Routing Problems, Yaoxin Wu, Mingfeng Fan, Zhiguang Cao, Ruobin Gao, Yaqing Hou, Guillaume Sartoretti
Research Collection School Of Computing and Information Systems
Existing deep reinforcement learning (DRL) methods for multi-objective vehicle routing problems (MOVRPs) typically decompose an MOVRP into subproblems with respective preferences and then train policies to solve corresponding subproblems. However, such a paradigm is still less effective in tackling the intricate interactions among subproblems, thus holding back the quality of the Pareto solutions. To counteract this limitation, we introduce a collaborative deep reinforcement learning method. We first propose a preference-based attention network (PAN) that allows the DRL agents to reason out solutions to subproblems in parallel, where a shared encoder learns the instance embedding and a decoder is tailored for …
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, …
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. …
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 …
Breathpro: Monitoring Breathing Mode During Running With Earables, Changshuo Hu, Thivya Kandappu, Yang Liu, Cecilia Mascolo, Dong Ma
Breathpro: Monitoring Breathing Mode During Running With Earables, Changshuo Hu, Thivya Kandappu, Yang Liu, Cecilia Mascolo, Dong Ma
Research Collection School Of Computing and Information Systems
Running is a popular and accessible form of aerobic exercise, significantly benefiting our health and wellness. By monitoring a range of running parameters with wearable devices, runners can gain a deep understanding of their running behavior, facilitating performance improvement in future runs. Among these parameters, breathing, which fuels our bodies with oxygen and expels carbon dioxide, is crucial to improving the efficiency of running. While previous studies have made substantial progress in measuring breathing rate, exploration of additional breathing monitoring during running is still lacking. In this work, we fill this gap by presenting BreathPro, the first breathing mode monitoring …
Unveiling Code Pre-Trained Models: Investigating Syntax And Semantics Capacities, Wei Ma, Shangqing Liu, Mengjie Zhao, Xiaofei Xie, Wenhang Wang, Qiang Hu, Jie Zhang, Liu Yang
Unveiling Code Pre-Trained Models: Investigating Syntax And Semantics Capacities, Wei Ma, Shangqing Liu, Mengjie Zhao, Xiaofei Xie, Wenhang Wang, Qiang Hu, Jie Zhang, Liu Yang
Research Collection School Of Computing and Information Systems
Code models have made significant advancements in code intelligence by encoding knowledge about programming languages. While previous studies have explored the capabilities of these models in learning code syntax, there has been limited investigation on their ability to understand code semantics. Additionally, existing analyses assume the number of edges between nodes at the abstract syntax tree (AST) is related to syntax distance, and also often require transforming the high-dimensional space of deep learning models to a low-dimensional one, which may introduce inaccuracies. To study how code models represent code syntax and semantics, we conduct a comprehensive analysis of 7 code …
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. …