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 511 - 540 of 5707
Full-Text Articles in Entire DC Network
Open-Set Graph Anomaly Detection Via Normal Structure Regularisation, Qizhou Wang, Guansong Pang, Mahsa Salehi, Xiaokun Xia, Christopher Leckie
Open-Set Graph Anomaly Detection Via Normal Structure Regularisation, Qizhou Wang, Guansong Pang, Mahsa Salehi, Xiaokun Xia, Christopher Leckie
Research Collection School Of Computing and Information Systems
This paper considers an important Graph Anomaly Detection (GAD) task, namely open-set GAD, which aims to train a detection model using a small number of normal and anomaly nodes (referred to as *seen anomalies*) to detect both seen anomalies and *unseen anomalies* (*i.e*., anomalies that cannot be illustrated the training anomalies). Those labelled training data provide crucial prior knowledge about abnormalities for GAD models, enabling substantially reduced detection errors. However, current supervised GAD methods tend to over-emphasise fitting the seen anomalies, leading to many errors of detecting the unseen anomalies as normal nodes. Further, existing open-set AD models were introduced …
A Functional Software Reference Architecture For Llm-Integrated Systems, Alessio Bucaioni, Martin Weyssow, Junda He, Yunbo Lyu, David Lo
A Functional Software Reference Architecture For Llm-Integrated Systems, Alessio Bucaioni, Martin Weyssow, Junda He, Yunbo Lyu, David Lo
Research Collection School Of Computing and Information Systems
The integration of large language models into software systems is transforming capabilities such as natural language understanding, decision-making, and autonomous task execution. However, the absence of a commonly accepted software reference architecture hinders systematic reasoning about their design and quality attributes. This gap makes it challenging to address critical concerns like privacy, security, modularity, and interoperability, which are increasingly important as these systems grow in complexity and societal impact. In this paper, we describe our emerging results for a preliminary functional reference architecture as a conceptual framework to address these challenges and guide the design, evaluation, and evolution of large …
On Minimizing Adversarial Counterfactual Error In Adversarial Reinforcement Learning, Roman Belaire, Arunesh Sinha, Pradeep Varakantham
On Minimizing Adversarial Counterfactual Error In Adversarial Reinforcement Learning, Roman Belaire, Arunesh Sinha, Pradeep Varakantham
Research Collection School Of Computing and Information Systems
Deep Reinforcement Learning (DRL) policies are highly susceptible to adversarial noise in observations, which poses significant risks in safety-critical scenarios. The challenge inherent to adversarial perturbations is that by altering the information observed by the agent, the state becomes only partially observable. Existing approaches address this by either enforcing consistent actions across nearby states or maximizing the worst-case value within adversarially perturbed observations. However, the former suffers from performance degradation when attacks succeed, while the latter tends to be overly conservative, leading to suboptimal performance in benign settings. We hypothesize that these limitations stem from their failing to account for …
Hand1000: Generating Realistic Hands From Text With Only 1,000 Images, Haozhuo Zhang, Bin Zhu, Yu Cao, Yanbin Hao
Hand1000: Generating Realistic Hands From Text With Only 1,000 Images, Haozhuo Zhang, Bin Zhu, Yu Cao, Yanbin Hao
Research Collection School Of Computing and Information Systems
Text-to-image generation models have achieved remarkable advancements in recent years, aiming to produce realistic images from textual descriptions. However, these models often struggle with generating anatomically accurate representations of human hands. The resulting images frequently exhibit issues such as incorrect numbers of fingers, unnatural twisting or interlacing of fingers, or blurred and indistinct hands. These issues stem from the inherent complexity of hand structures and the difficulty in aligning textual descriptions with precise visual depictions of hands. To address these challenges, we propose a novel approach named Hand1000 that enables the generation of realistic hand images with target gesture using …
Birdie: Natural Language-Driven Table Discovery Using Differentiable Search Index, Yuxiang Guo, Zhonghao Hu, Yuren Mao, Baihua Zheng, Yunjun Gao, Mingwei Zhou
Birdie: Natural Language-Driven Table Discovery Using Differentiable Search Index, Yuxiang Guo, Zhonghao Hu, Yuren Mao, Baihua Zheng, Yunjun Gao, Mingwei Zhou
Research Collection School Of Computing and Information Systems
Natural language (NL)-driven table discovery identifies relevant tables from large table repositories based on NL queries. While current deep-learning-based methods using the traditional dense vector search pipeline, i.e., representation-index-search, achieve remarkable accuracy, they face several limitations that impede further performance improvements: (i) the errors accumulated during the table representation and indexing phases affect the subsequent search accuracy; and (ii) insufficient query-table interaction hinders effective semantic alignment, impeding accuracy improvements. In this paper, we propose a novel framework Birdie, using a differentiate search index. It unifies the indexing and search into a single encoder-decoder language model, thus getting rid of error …
Ragg: Retrieval-Augmented Grasp Generation Model, Zhenhua Tang, Bin Zhu, Yanbin Hao, Chong-Wah Ngo, Richang Hong
Ragg: Retrieval-Augmented Grasp Generation Model, Zhenhua Tang, Bin Zhu, Yanbin Hao, Chong-Wah Ngo, Richang Hong
Research Collection School Of Computing and Information Systems
Intent-based grasp generation inherently involves challenges such as manipulation ambiguity and modality gaps. To address these, we propose a novel Retrieval-Augmented Grasp Generation model (RAGG). Our key insight is that when humans manipulate new objects, they initially mimic the interaction patterns observed in similar objects, then progressively adjust hand-object contact. Consequently, we develop RAGG as a two-stage approach, encompassing retrieval-guided generation and structurally stable grasp refinement. In the first stage, we propose a Retrieval-Augmented Diffusion Model (ReDim), which identifies the most relevant interaction instance from a knowledge base to explicitly guide grasp generation, thereby mitigating ambiguity and bridging modality gaps …
Offline Safe Reinforcement Learning Using Trajectory Classification, Ze Gong, Akshat Kumar, Pradeep Varakantham
Offline Safe Reinforcement Learning Using Trajectory Classification, Ze Gong, Akshat Kumar, Pradeep Varakantham
Research Collection School Of Computing and Information Systems
Offline safe reinforcement learning (RL) has emerged as a promising approach for learning safe behaviors without engaging in risky online interactions with the environment. Most existing methods in offline safe RL rely on cost constraints at each time step (derived from global cost constraints) and this can result in either overly conservative policies or violation of safety constraints. In this paper, we propose to learn a policy that generates desirable trajectories and avoids undesirable trajectories. To be specific, we first partition the pre-collected dataset of state-action trajectories into desirable and undesirable subsets. Intuitively, the desirable set contains high reward and …
Retrieval Augmented Recipe Generation, Guoshan Liu, Hailong Yin, Bin Zhu, Jingjing Chen, Chong-Wah Ngo, Yu-Gang Jiang
Retrieval Augmented Recipe Generation, Guoshan Liu, Hailong Yin, Bin Zhu, Jingjing Chen, Chong-Wah Ngo, Yu-Gang Jiang
Research Collection School Of Computing and Information Systems
The growing interest in generating recipes from food images has drawn substantial research attention in recent years. Existing works for recipe generation primarily utilize a two-stage training method—first predicting ingredients from a food image and then generating instructions from both the image and ingredients. Large Multi-modal Models (LMMs), which have achieved notable success across a variety of vision and language tasks, shed light on generating both ingredients and instructions directly from images. Nevertheless, LMMs still face the common issue of hallu- cinations during recipe generation, leading to suboptimal performance. To tackle this issue, we propose a retrieval augmented large multimodal …
Mimic: Ai And Ar-Enhanced Multi-Modal, Immersive, Relative Instruction Comprehension, Dhanuja Wanniarachchi, Archan Misra
Mimic: Ai And Ar-Enhanced Multi-Modal, Immersive, Relative Instruction Comprehension, Dhanuja Wanniarachchi, Archan Misra
Research Collection School Of Computing and Information Systems
We present a multimodal instruction comprehension framework, called MImIC, that utilizes visual sensing (including LIDAR and 2D RGB sensing) & AI spatial reasoning capabilities to support more seamless and immersive interaction between humans and AI-driven situated assistive agents. MImIC's key new capability is to support disambiguation of a wider set of relative spatial references that users naturally employ while issuing spatially-situated instructions. To support enhanced visual grounding via a combination of both fully-qualified and relative attribute references, MImIC uses (a) a fine-tuned transformer-based language translation DNN to accurately convert natural verbal commands into a structured set of machine understandable constraints …
Explainable Neural Networks With Guarantee: A Sparse Estimation Approach, Antoine Ledent, Peng Liu
Explainable Neural Networks With Guarantee: A Sparse Estimation Approach, Antoine Ledent, Peng Liu
Research Collection School Of Computing and Information Systems
Balancing predictive power and interpretability has long been a challenging research area, particularly in powerful yet complex models like neural networks, where nonlinearity obstructs direct interpretation. This paper introduces a novel approach to constructing an explainable neural network that harmonizes predictiveness and explainability. Our model is designed as a linear combination of a sparse set of jointly learned features, each derived from a different trainable function applied to a single 1-dimensional input feature. Leveraging the ability to learn arbitrarily complex relationships, our neural network architecture enables automatic selection of a sparse set of important features, with the final prediction being …
Graph Foundation Models: Concepts, Opportunities And Challenges, Jiawei Liu, Cheng Yang, Zhiyuan Lu, Junze Chen, Yibo Li, Mengmei Zhang, Ting Bai, Fang Yuan, Lichao Sun, Philip S. Yu, Chuan Shi
Graph Foundation Models: Concepts, Opportunities And Challenges, Jiawei Liu, Cheng Yang, Zhiyuan Lu, Junze Chen, Yibo Li, Mengmei Zhang, Ting Bai, Fang Yuan, Lichao Sun, Philip S. Yu, Chuan Shi
Research Collection School Of Computing and Information Systems
Foundation models have emerged as critical components in a variety of artificial intelligence applications, and showcase significant success in natural language processing and several other domains. Meanwhile, the field of graph machine learning is witnessing a paradigm transition from shallow methods to more sophisticated deep learning approaches. The capabilities of foundation models in generalization and adaptation motivate graph machine learning researchers to discuss the potential of developing a new graph learning paradigm. This paradigm envisions models that are pre-trained on extensive graph data and can be adapted for various graph tasks. Despite this burgeoning interest, there is a noticeable lack …
Leveraging Constraint Violation Signals For Action Constrained Reinforcement Learning, Janaka Chathuranga Brahmanage, Jiajing Ling, Akshat Kumar
Leveraging Constraint Violation Signals For Action Constrained Reinforcement Learning, Janaka Chathuranga Brahmanage, Jiajing Ling, Akshat Kumar
Research Collection School Of Computing and Information Systems
In many RL applications, ensuring an agent’s actions adhere to constraints is crucial for safety. Most previous methods in Action-Constrained Reinforcement Learning (ACRL) employ a projection layer after the policy network to correct the action. However projection-based methods suffer from issues like the zero gradient problem and higher runtime due to the usage of optimization solvers. Recently methods were proposed to train generative models to learn a differentiable mapping between latent variables and feasible actions to address this issue. However, generative models require training using samples from the constrained action space, which itself is challenging. To address such limitations, first, …
Marginal Benefit Driven Rl Teacher For Unsupervised Environment Design, Dexun Li, Wenjun Li, Pradeep Varakantham
Marginal Benefit Driven Rl Teacher For Unsupervised Environment Design, Dexun Li, Wenjun Li, Pradeep Varakantham
Research Collection School Of Computing and Information Systems
Training generally capable agents in complex environments is a challenging task that involves identifying the “right” environments at the training stage. Recent research has highlighted the potential of the Unsupervised Environment Design framework, which generates environment instances/levels adaptively at the frontier of the agent’s capabilities using regret measures. While regret approaches have shown promise in generating feasible environments, they can produce difficult environments that are challenging for an RL agent to learn from. This is because regret represents the best-case (upper bound) learning potential and not the actual learning potential of an environment. To address this, we propose an alternative …
Improving Multimodal Human Pose Estimation By Adversarial Modality Enhancement, Jiangnan Xia, Qilong Wu, Yanyin Guo, Yi Li, Jianghan Cheng, Junwei Li, Zhiyuan Zhang
Improving Multimodal Human Pose Estimation By Adversarial Modality Enhancement, Jiangnan Xia, Qilong Wu, Yanyin Guo, Yi Li, Jianghan Cheng, Junwei Li, Zhiyuan Zhang
Research Collection School Of Computing and Information Systems
Human pose estimation in computer vision predominantly focuses on the visible modality, with limited research on the infrared modality. No existing methods demonstrate robust performance across both modalities, missing their complementary strengths. This gap arises from the lack of a multimodal benchmark and the difficulty of developing robust multimodal capabilities. To address this, we introduce MMPD, a novel visible-infrared multimodal pose benchmark with high-quality annotations for both modalities. Leveraging MMPD, we expose the limitations of state-of-the-art methods due to modality variance. To overcome this challenge, we propose a novel method-agnostic scheme called AMMPE. By employing the Modality Adversarial Enhancement Stage …
Generalization Analysis For Deep Contrastive Representation Learning, Minh Hieu Nong, Antoine Ledent, Yunwen Lei, Cheng Yeaw Ku
Generalization Analysis For Deep Contrastive Representation Learning, Minh Hieu Nong, Antoine Ledent, Yunwen Lei, Cheng Yeaw Ku
Research Collection School Of Computing and Information Systems
In this paper, we present generalization bounds for the unsupervised risk in the Deep Contrastive Representation Learning framework, which employs deep neural networks as representation functions. We approach this problem from two angles. On the one hand, we derive a parameter-counting bound that scales with the overall size of the neural networks. On the other hand, we provide a norm-based bound that scales with the norms of neural networks’ weight matrices. Ignoring logarithmic factors, the bounds are independent of k, the size of the tuples provided for contrastive learning. To the best of our knowledge, this property is only shared …
Revisiting Sentiment Analysis For Software Engineering In The Era Of Large Language Models, Ting Zhang, Ivana Clairine Irsan, Thung Ferdian, David Lo
Revisiting Sentiment Analysis For Software Engineering In The Era Of Large Language Models, Ting Zhang, Ivana Clairine Irsan, Thung Ferdian, David Lo
Research Collection School Of Computing and Information Systems
Software development involves collaborative interactions where stakeholders express opinions across various platforms. Recognizing the sentiments conveyed in these interactions is crucial for the effective development and ongoing maintenance of software systems. For software products, analyzing the sentiment of user feedback, e.g., reviews, comments, and forum posts can provide valuable insights into user satisfaction and areas for improvement. This can guide the development of future updates and features. However, accurately identifying sentiments in software engineering datasets remains challenging.This study investigates bigger large language models (bLLMs) in addressing the labeled data shortage that hampers fine-tuned smaller large language models (sLLMs) in software …
Backdoor Token Unlearning: Exposing And Defending Backdoors In Pretrained Language Models, Peihai Jiang, Xixiang Lyu, Yige Li, Jing Ma
Backdoor Token Unlearning: Exposing And Defending Backdoors In Pretrained Language Models, Peihai Jiang, Xixiang Lyu, Yige Li, Jing Ma
Research Collection School Of Computing and Information Systems
Supervised fine-tuning has become the predominant method for adapting large pretrained models to downstream tasks. However, recent studies have revealed that these models are vulnerable to backdoor attacks, where even a small number of malicious samples can successfully embed backdoor triggers into the model. While most existing defense methods focus on post-training backdoor defense, efficiently defending against backdoor attacks during training phase remains largely unexplored. To address this gap, we propose a novel defense method called Backdoor Token Unlearning (BTU), which proactively detects and neutralizes trigger tokens during the training stage. Our work is based on two key findings: 1) …
Sticky Information Technology Investment: Theory And Empirical Evidence, Peng Liang, Hasan Cavusoglu, Nan Hu
Sticky Information Technology Investment: Theory And Empirical Evidence, Peng Liang, Hasan Cavusoglu, Nan Hu
Research Collection School Of Computing and Information Systems
This article provides a new way of thinking about managerial discretion in information technology (IT) investment decisions. We delve into the existence, antecedents, and consequences of sticky IT investment behavior, an understudied managerial deliberate resource commitment decision in response to changes in sales. Guided by downsizing theory, we initially theorize and find that IT investments exhibit stickiness: IT investments move downward less for sales decreases than they move upward for equivalent increases. Then drawing upon agency theory, adjustment costs theory, and managerial expectations theory—which influence managers’ motivation for downsizing—we predict and demonstrate that managers’ empire-building incentives, their avoidance of adjustment …
Understanding The Oss Communities Of Deep Learning Frameworks: A Comparative Case Study Of Pytorch And Tensorflow, Yunqi Chen, Zhiyuan Wan, Yifei Zhuang, Ning Liu, David Lo, Xiaohu Yang
Understanding The Oss Communities Of Deep Learning Frameworks: A Comparative Case Study Of Pytorch And Tensorflow, Yunqi Chen, Zhiyuan Wan, Yifei Zhuang, Ning Liu, David Lo, Xiaohu Yang
Research Collection School Of Computing and Information Systems
Over the past two decades, deep learning has received tremendous success in developing software systems across various domains. Deep learning frameworks have been proposed to facilitate the development of such software systems, among which, PyTorch and TensorFlow stand out as notable examples. Considerable attention focuses on exploring software engineering practices and addressing diverse technical aspects in developing and deploying deep learning frameworks and software systems. Despite these efforts, little is known about the open source software communities involved in the development of deep learning frameworks. In this article, we perform a comparative investigation into the open source software communities of …
Deepvmunprotect: Neural Network-Based Recovery Of Vm‑Protected Android Apps For Semantics‑Aware Malware Detection, Xin Zhao, Mu Zhang, Xiaopeng Ke, Yu Pan, Yue Duan, Sheng Zhong, Fengyuan Xu
Deepvmunprotect: Neural Network-Based Recovery Of Vm‑Protected Android Apps For Semantics‑Aware Malware Detection, Xin Zhao, Mu Zhang, Xiaopeng Ke, Yu Pan, Yue Duan, Sheng Zhong, Fengyuan Xu
Research Collection School Of Computing and Information Systems
The emerging virtual machine-based Android packers render existing unpacking techniques ineffective. The state-of-the-art unpacker falls short because it relies on unreliable heuristics and manually crafted semantic models. Hence, it cannot precisely recover app semantics necessary for malware detection. In this paper, we propose DeepVMUnProtect, a deep learning-based approach to automatically and accurately capture the semantics of VM-packed code, so as to facilitate semantic-based Android malware classification. Experiments have shown that DeepVMUnProtect outperforms the state-of-the-art tool on recovering opcode semantics in Qihoo(58.3%), Baidu(47.5%) and NMMP (58.8%) respectively, and can enable semantics-aware malware detection which prior work fails to do.
Private Reachability Queries On Structured Encrypted Temporal Bipartite Graphs, Yulin Wu, Lanxiang Chen, Gaolin Chen, Yi Mu, Robert H. Deng
Private Reachability Queries On Structured Encrypted Temporal Bipartite Graphs, Yulin Wu, Lanxiang Chen, Gaolin Chen, Yi Mu, Robert H. Deng
Research Collection School Of Computing and Information Systems
A temporal bipartite graph is a graph model that incorporates time-related information into its edges, making it suitable for modeling real-world phenomena like disease outbreaks. However, this temporal information is often sensitive. To protect the privacy of graph data, researchers have explored various approaches to preserve privacy in graph queries, with reachability queries being popular and fundamental as they determine the possibility of reaching one node from others in a graph. While privacy-preserving reachability queries have been extensively studied, existing efforts often overlook the valuable attribute information present in both edges and nodes of the graphs. Moreover, reachability queries on …
Forward-Secure Hierarchical Delegable Signature For Smart Homes, Jianfei Sun, Guowen Xu, Yang Yang, Xuehuan Yang, Xiaoguo Li, Cong Wu, Zhen Liu, Guomin Yang, Robert H. Deng
Forward-Secure Hierarchical Delegable Signature For Smart Homes, Jianfei Sun, Guowen Xu, Yang Yang, Xuehuan Yang, Xiaoguo Li, Cong Wu, Zhen Liu, Guomin Yang, Robert H. Deng
Research Collection School Of Computing and Information Systems
Aiming to provide people with great convenience and comfort, smart home systems have been deployed in thousands of homes. In this paper, we focus on handling the security and privacy issues in such a promising system by customizing a new cryptographic primitive to provide the following security guarantees: (1) fine-grained, privacy-preserving authorization for smart home users and integrity protection of communication contents; (2) flexible self-sovereign permission delegation; (3) forward security of previous messages. To our knowledge, no previous system has been designed to consider these three security and privacy requirements simultaneously. To tackle these challenges, we put forward the first-ever …
Fully Selective Opening Secure Ibe From Lwe, Dingding Jia, Haiyang Xue, Bao Li
Fully Selective Opening Secure Ibe From Lwe, Dingding Jia, Haiyang Xue, Bao Li
Research Collection School Of Computing and Information Systems
Selective opening security ensures that, when an adversary is given multiple ciphertexts and corrupts a subset of the senders (thereby obtaining the plaintexts and the senders’ randomness), the privacy of the remaining ciphertexts is still preserved. Previous selective opening secure IBE schemes encrypt messages bit-by-bit, or only achieve selective-id security. In this paper, we present the first adaptive-id, selective opening secure identity-based encryption (IBE) tightly from LWE. To achieve this, we introduce a new primitive called delegatable all-but-many lossy trapdoor functions (DABM-LTDF) and provide a generic construction that converts DABM-LTDF into an adaptive-id, selective opening secure IBE through a tight …
Imageinthat: Manipulating Images To Convey User Instructions To Robots, Karthik Mahadevan, Blaine Lewis, Jiannan Li, Bilge Mutlu, Anthony Tang, Tovi Grossman
Imageinthat: Manipulating Images To Convey User Instructions To Robots, Karthik Mahadevan, Blaine Lewis, Jiannan Li, Bilge Mutlu, Anthony Tang, Tovi Grossman
Research Collection School Of Computing and Information Systems
Foundation models are rapidly improving the capability of robots in performing everyday tasks autonomously such as meal preparation, yet robots will still need to be instructed by humans due to model performance, the difficulty of capturing user preferences, and the need for user agency. Robots can be instructed using various methods---natural language conveys immediate instructions but can be abstract or ambiguous, whereas end-user programming supports longer-horizon tasks but interfaces face difficulties in capturing user intent. In this work, we propose using direct manipulation of images as an alternative paradigm to instruct robots, and introduce a specific instantiation called ImageInThat which …
Explainable Neural Networks With Guarantees: A Sparse Estimation Approach, Antoine Ledent, Peng Liu
Explainable Neural Networks With Guarantees: A Sparse Estimation Approach, Antoine Ledent, Peng Liu
Research Collection School Of Computing and Information Systems
Balancing predictive power and interpretability has long been a challenging research area, particularly in powerful yet complex models like neural networks, where nonlinearity obstructs direct interpretation. This paper introduces a novel approach to constructing an explainable neural network that harmonizes predictiveness and explainability. Our model is designed as a linear combination of a sparse set of jointly learned features, each derived from a different trainable function applied to a single 1-dimensional input feature. Leveraging the ability to learn arbitrarily complex relationships, our neural network architecture enables automatic selection of a sparse set of important features, with the final prediction being …
Varium: Variational Autoencoder For Multi-Interest Representation With Inter-User Memory, Nhu Thuat Tran, Hady W. Lauw
Varium: Variational Autoencoder For Multi-Interest Representation With Inter-User Memory, Nhu Thuat Tran, Hady W. Lauw
Research Collection School Of Computing and Information Systems
Frameworks for discovering multiple user interest factors based on Variational AutoEncoder (VAE) has demonstrated competitive recommendation performance. However, as VAE only considers one user as input at a time, sharing across like-minded users may not be adequately facilitated. Moreover, interest sharing between users is not always available and thus, poses a challenge for VAE to explicitly model this information. To resolve this, we introduce an inter-user memory-based mechanism to unsupervisedly discover latent interest sharing between users under VAE framework. Concretely, we design a memory including an array of prototypes, each hypothetically representing a group of users sharing a particular interest. …
Multi-Uav Reconnaissance Mission Planning Via Deep Reinforcement Learning With Simulated Annealing, Mingfeng Fan, Huan Liu, Guohua Wu, Aldy Gunawan, Guillaume Sartoretti
Multi-Uav Reconnaissance Mission Planning Via Deep Reinforcement Learning With Simulated Annealing, Mingfeng Fan, Huan Liu, Guohua Wu, Aldy Gunawan, Guillaume Sartoretti
Research Collection School Of Computing and Information Systems
Unmanned aerial vehicles (UAVs) are widely used in reconnaissance missions due to their autonomy and flexibility. Efficient mission planning for multiple UAVs is crucial for tasks such as traffic monitoring and data collection. However, existing approaches to multi-UAV reconnaissance mission planning problem (MURMPP) often struggle with high computational demands, leading to suboptimal solutions. To overcome this challenge, we introduce a divide-and-conquer framework that splits the problem into two phases: target allocation and UAV routing, effectively reducing computational complexity. Specifically, we propose a hybrid method, SA-NNO-DRL, which combines the nearest neighbor optima-based deep reinforcement learning (NNO-DRL) approach with simulated annealing (SA). …
How To Securely Delegate And Revoke Partial Authorization Credentials, Meng Sun, Junzuo Lai, Wei Wu, Ye Yang, Cheng-Kang Chu, Robert H. Deng
How To Securely Delegate And Revoke Partial Authorization Credentials, Meng Sun, Junzuo Lai, Wei Wu, Ye Yang, Cheng-Kang Chu, Robert H. Deng
Research Collection School Of Computing and Information Systems
An attribute-based credential (ABC) system allows a user, obtaining a credential on a set of attributes from an issuer, to anonymously prove a subset of attributes to a service provider. Nowadays, delegation is an important requirement of ABC, which allows a user to delegate his credentials to other users. However, traditional delegatable ABC systems only support delegating a credential with all attributes. In many scenarios, an appropriate delegation is a user can delegate his credential on parts of attributes to others. Another requirement is revocation of credentials in case of unexpected events. In this article, we propose a delegatable and …
Dualopt: A Dual Divide-And-Optimize Algorithm For The Large-Scale Traveling Salesman Problem, Shipei Zhou, Yuandong Ding, Chi Zhang, Zhiguang Cao, Yan Jin
Dualopt: A Dual Divide-And-Optimize Algorithm For The Large-Scale Traveling Salesman Problem, Shipei Zhou, Yuandong Ding, Chi Zhang, Zhiguang Cao, Yan Jin
Research Collection School Of Computing and Information Systems
This paper proposes a dual divide-and-optimize algorithm (DualOpt) for solving the large-scale traveling salesman problem (TSP). DualOpt combines two complementary strategies to improve both solution quality and computational efficiency. The first strategy is a grid-based divide-and-conquer procedure that partitions the TSP into smaller subproblems, solving them in parallel and iteratively refining the solution by merging nodes and partial routes. The process continues until only one grid remains, yielding a high-quality initial solution. The second strategy involves a path-based divide-and-optimize procedure that further optimizes the solution by dividing it into sub-paths, optimizing each using a neural solver, and merging them back …
Cachealarm: Monitoring Sensitive Behaviors Of Android Apps Using Cache Side Channel, Jianwen Tian, Haoyu Ma, Debin Gao, Xiaohui Kuang
Cachealarm: Monitoring Sensitive Behaviors Of Android Apps Using Cache Side Channel, Jianwen Tian, Haoyu Ma, Debin Gao, Xiaohui Kuang
Research Collection School Of Computing and Information Systems
Malware attack has been a serious threat to the security and privacy of both individual and corporation users of the Android platform. Business entities seek to protect themselves by means of monitoring privacy-related sensitive behaviors conducted on company-issued Android devices. However, due to Android’s own access control and privacy protection policies, this is difficult to be done with third-party apps using only normal privileges. Existing works proposed using side-channel readings from leaky APIs and system virtual files to speculate runtime app behaviors, which could be unreliable due to future system updates (that ban exploited resources), hardware jittering, etc. In this …