Open Access. Powered by Scholars. Published by Universities.®
- Institution
-
- Singapore Management University (9030)
- Missouri University of Science and Technology (1896)
- City University of New York (CUNY) (957)
- Brigham Young University (710)
- University of Texas at Arlington (661)
-
- Syracuse University (479)
- University of Central Florida (475)
- University of Nevada, Las Vegas (392)
- Chulalongkorn University (258)
- Regis University (254)
- Portland State University (242)
- TÜBİTAK (230)
- Old Dominion University (197)
- San Jose State University (192)
- University of South Carolina (188)
- Wright State University (186)
- Technological University Dublin (152)
- Washington University in St. Louis (148)
- University of South Florida (137)
- Purdue University (112)
- Edith Cowan University (109)
- University of Nebraska - Lincoln (108)
- Nova Southeastern University (101)
- Zayed University (97)
- California Polytechnic State University, San Luis Obispo (96)
- Dartmouth College (94)
- University of New Mexico (94)
- University at Albany, State University of New York (89)
- Air Force Institute of Technology (88)
- Kennesaw State University (75)
- Keyword
-
- Machine learning (601)
- Artificial intelligence (410)
- Deep learning (342)
- Machine Learning (264)
- College for Professional Studies (253)
-
- School of Computer & Information Science (236)
- Security (196)
- Artificial Intelligence (191)
- Natural language processing (184)
- Deep Learning (183)
- Computer Science (180)
- Privacy (145)
- Social media (140)
- Algorithms (138)
- Computer science (137)
- MS Computer and Information Technology (136)
- Data mining (135)
- Neural networks (129)
- Reinforcement learning (123)
- Computer vision (121)
- Natural Language Processing (121)
- Cybersecurity (117)
- Twitter (116)
- Software engineering (115)
- AI (110)
- Classification (109)
- Regis University MSCIT thesis (108)
- Cloud computing (106)
- Optimization (106)
- Clustering (96)
- Publication Year
- Publication
-
- Research Collection School Of Computing and Information Systems (8502)
- Computer Science Faculty Research & Creative Works (907)
- Theses and Dissertations (831)
- Computer Science Technical Reports (411)
- Faculty Publications (381)
-
- Computer Science and Engineering Theses - Archive (364)
- Electronic Theses and Dissertations (331)
- Publications and Research (291)
- Electrical and Computer Engineering Faculty Research & Creative Works (282)
- Computer Science and Engineering Dissertations - Archive (270)
- Open Educational Resources (262)
- Chulalongkorn University Theses and Dissertations (Chula ETD) (258)
- Regis University Student Publications (comprehensive collection) (254)
- Masters Theses (236)
- UNLV Theses, Dissertations, Professional Papers, and Capstones (236)
- Turkish Journal of Electrical Engineering and Computer Sciences (230)
- Dissertations and Theses (203)
- Dissertations and Theses Collection (Open Access) (189)
- Electrical Engineering and Computer Science - Technical Reports (176)
- Master's Projects (167)
- Dissertations, Theses, and Capstone Projects (145)
- Electrical Engineering and Computer Science - All Scholarship (138)
- McKelvey School of Engineering Graduate Student Theses & Dissertations (137)
- USF Tampa Graduate Theses and Dissertations (122)
- Doctoral Dissertations (119)
- Electronic Theses and Dissertations, 2020-2023 (119)
- All Works (97)
- Computer Science Faculty Publications (94)
- Northeast Parallel Architecture Center (92)
- Dissertations (89)
- Publication Type
- File Type
Articles 1681 - 1710 of 20575
Full-Text Articles in Entire DC Network
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 …
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 …
Lightprof: A Lightweight Reasoning Framework For Large Language Model On Knowledge Graph, Tu Ao, Yanhua Yu, Yuling Wang, Yang Deng, Zirui Guo, Liang Pang, Pinghui Wang, Tat-Seng Chua, Xiao Zhang, Zhen Cai
Lightprof: A Lightweight Reasoning Framework For Large Language Model On Knowledge Graph, Tu Ao, Yanhua Yu, Yuling Wang, Yang Deng, Zirui Guo, Liang Pang, Pinghui Wang, Tat-Seng Chua, Xiao Zhang, Zhen Cai
Research Collection School Of Computing and Information Systems
Large Language Models (LLMs) have impressive capabilities in text understanding and zero-shot reasoning. However, delays in knowledge updates may cause them to reason incorrectly or produce harmful results. Knowledge Graphs (KGs) provide rich and reliable contextual information for the reasoning process of LLMs by structurally organizing and connecting a wide range of entities and relations. Existing KG-based LLM reasoning methods only inject KGs’ knowledge into prompts in a textual form, ignoring its structural information. Moreover, they mostly rely on close-source models or open-source models with large parameters, which poses challenges to high resource consumption. To address this, we propose a …
Aligning Large Language Models For Faithful Integrity Against Opposing Argument, Yong Zhao, Yang Deng, See-Kiong Ng, Tat-Seng Chua
Aligning Large Language Models For Faithful Integrity Against Opposing Argument, Yong Zhao, Yang Deng, See-Kiong Ng, Tat-Seng Chua
Research Collection School Of Computing and Information Systems
Large Language Models (LLMs) have demonstrated impressive capabilities in complex reasoning tasks. However, they can be easily misled by unfaithful arguments during conversations, even when their original statements are correct. To this end, we investigate the problem of maintaining faithful integrity in LLMs. This involves ensuring that LLMs adhere to their faithful statements in the face of opposing arguments and are able to correct their incorrect statements when presented with faithful arguments. In this work, we propose a novel framework, named Alignment for Faithful Integrity with Confidence Estimation (AFICE), which aims to align the LLM responses with faithful integrity. Specifically, …
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 …
Learning To Identify Seen, Unseen And Unknown In The Open World: A Practical Setting For Zero-Shot Learning, Sethupathy Parameswaran, Yuan Fang, Chandan Gautam, Savitha Ramasamy, Xiaoli Li
Learning To Identify Seen, Unseen And Unknown In The Open World: A Practical Setting For Zero-Shot Learning, Sethupathy Parameswaran, Yuan Fang, Chandan Gautam, Savitha Ramasamy, Xiaoli Li
Research Collection School Of Computing and Information Systems
As vision-language models advance, addressing the Zero-Shot Learning (ZSL) problem in the open world becomes increasingly crucial. Specifically, a robust model must handle three types of samples during inference: seen classes with visual and semantic information provided in training, unseen classes with only the semantic information in training, and unknown samples with no prior information from training. Existing methods either handle seen and unseen classes together (ZSL) or seen and unknown classes (known as Open-Set Recognition, OSR). However, none addresses the simultaneous handling of all three, which we term Open-Set Zero-Shot Learning (OZSL). To address this problem, we propose a …
Dr. Tongue: Sign-Oriented Multi-Label Detection For Remote Tongue Diagnosis, Yiliang Chen, Steven S. C. Ho, Cheng Xu, Yao Jie Xie, Wing Fai Yeung, Shengfeng He, Jing Qin
Dr. Tongue: Sign-Oriented Multi-Label Detection For Remote Tongue Diagnosis, Yiliang Chen, Steven S. C. Ho, Cheng Xu, Yao Jie Xie, Wing Fai Yeung, Shengfeng He, Jing Qin
Research Collection School Of Computing and Information Systems
Tongue diagnosis is a vital tool in Western and Traditional Chinese Medicine, providing key insights into a patient's health by analyzing tongue attributes. The COVID-19 pandemic has heightened the need for accurate remote medical assessments, emphasizing the importance of precise tongue attribute recognition via telehealth. To address this, we propose a Sign-Oriented multi-label Attributes Detection framework. Our approach begins with an adaptive tongue feature extraction module that standardizes tongue images and mitigates environmental factors. This is followed by a Sign-oriented Network (SignNet) that identifies specific tongue attributes, emulating the diagnostic process of experienced practitioners and enabling comprehensive health evaluations. To …
Attackg+: Boosting Attack Graph Construction With Large Language Models, Yongheng Zhang, Tingwen Du, Yunshan Ma, Xiang Wang, Yi Xie, Guozheng Yang, Yuliang Lu, Ee‑Chien Chang
Attackg+: Boosting Attack Graph Construction With Large Language Models, Yongheng Zhang, Tingwen Du, Yunshan Ma, Xiang Wang, Yi Xie, Guozheng Yang, Yuliang Lu, Ee‑Chien Chang
Research Collection School Of Computing and Information Systems
Attack graph construction seeks to convert textual cyber threat intelligence (CTI) reports into structuredrepresentations, portraying the evolutionary traces of cyber attacks. Even though previous research hasproposed various methods to construct attack graphs, they generally suffer from limited generalizationcapability to diverse knowledge types as well as requirement of expertise in model design and tuning.Addressing these limitations, we seek to utilize Large Language Models (LLMs), which have achieved enormoussuccess in a broad range of tasks given exceptional capabilities in both language understanding and zeroshot task fulfillment. Thus, we propose a fully automatic LLM-based framework to construct attack graphsnamed: AttacKG+. Our framework consists …
Enhanced Sample Selection With Confidence Tracking: Identifying Correctly Labeled Yet Hard-To-Learn Samples In Noisy Data, Weiran Pan, Wei Wei, Feida Zhu, Yong Deng
Enhanced Sample Selection With Confidence Tracking: Identifying Correctly Labeled Yet Hard-To-Learn Samples In Noisy Data, Weiran Pan, Wei Wei, Feida Zhu, Yong Deng
Research Collection School Of Computing and Information Systems
We propose a novel sample selection method for image classification in the presence of noisy labels. Existing methods typically consider small-loss samples as correctly labeled. However, some correctly labeled samples are inherently difficult for the model to learn and can exhibit high loss similar to mislabeled samples in the early stages of training. Consequently, setting a threshold on per-sample loss to select correct labels results in a trade-off between precision and recall in sample selection: a lower threshold may miss many correctly labeled hard-to-learn samples (low recall), while a higher threshold may include many mislabeled samples (low precision). To address …
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. …
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 …
Evaluating Software Development Agents: Patch Patterns, Code Quality, And Issue Complexity In Real-World Github Scenarios, Zhi Chen, Lingxiao Jiang
Evaluating Software Development Agents: Patch Patterns, Code Quality, And Issue Complexity In Real-World Github Scenarios, Zhi Chen, Lingxiao Jiang
Research Collection School Of Computing and Information Systems
In recent years, AI-based software engineering has progressed from pre-trained models to advanced agentic workflows, with Software Development Agents representing the next major leap. These agents, capable of reasoning, planning, and interacting with external environments, offer promising solutions to complex software engineering tasks. However, while much research has evaluated code generated by large language models (LLMs), comprehensive studies on agent-generated patches, particularly in real-world settings, are lacking. This study addresses that gap by evaluating 4,892 patches from 10 top-ranked agents on 500 real-world GitHub issues from SWE-Bench Verified, focusing on their impact on code quality. Our analysis shows no single …
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 …
Gender Biases Within Artificial Intelligence And Chatgpt: Evidence, Sources Of Biases, And Solutions, Qi Hui Jerlyn Ho, Andree Hartanto, Andrew Koh, Nadyanna M. Majeed
Gender Biases Within Artificial Intelligence And Chatgpt: Evidence, Sources Of Biases, And Solutions, Qi Hui Jerlyn Ho, Andree Hartanto, Andrew Koh, Nadyanna M. Majeed
Research Collection School of Social Sciences
The growing adoption of Artificial Intelligence (AI) in various sectors has introduced significant benefits, but also raised concerns over biases, particularly in relation to gender. Despite AI's potential to enhance sectors like healthcare, education, and business, it often mirrors reality and its societal prejudices and can manifest itself through unequal treatment in hiring decisions, academic recommendations, or healthcare diagnostics, systematically disadvantaging women. This paper explores how AI systems and chatbots, notably ChatGPT, can perpetuate gender biases due to inherent flaws in training data, algorithms, and user feedback loops. This problem stems from several sources, including biased training datasets, algorithmic design …
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 …
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 …
Personamagic: Stage-Regulated High-Fidelity Face Customization With Tandem Equilibrium, Xinzhe Li, Jiahui Zhan, Shengfeng He, Yangyang Xu, Junyu Dong, Huaidong Zhang, Yong Du
Personamagic: Stage-Regulated High-Fidelity Face Customization With Tandem Equilibrium, Xinzhe Li, Jiahui Zhan, Shengfeng He, Yangyang Xu, Junyu Dong, Huaidong Zhang, Yong Du
Research Collection School Of Computing and Information Systems
Personalized image generation has made significant strides in adapting content to novel concepts. However, a persistent challenge remains: balancing the accurate reconstruction of unseen concepts with the need for editability according to the prompt, especially when dealing with the complex nuances of facial features. In this study, we delve into the temporal dynamics of the text-to-image conditioning process, emphasizing the crucial role of stage partitioning in introducing new concepts. We present PersonaMagic, a stage-regulated generative technique designed for high-fidelity face customization. Using a simple MLP network, our method learns a series of embeddings within a specific timestep interval to capture …
An Aspect Performance-Aware Hypergraph Neural Network For Review-Based Recommendation, Junrui Liu, Tong Li, Di Wu, Zifang Tang, Yuan Fang, Zhen Yang
An Aspect Performance-Aware Hypergraph Neural Network For Review-Based Recommendation, Junrui Liu, Tong Li, Di Wu, Zifang Tang, Yuan Fang, Zhen Yang
Research Collection School Of Computing and Information Systems
Online reviews allow consumers to provide detailed feedback on various aspects of items. Existing methods utilize these aspects to model users' fine-grained preferences for specific item features through graph neural networks. We argue that the performance of items on different aspects is important for making precise recommendations, which has not been taken into account by existing approaches, due to lack of data. In this paper, we propose an aspect performance-aware hypergraph neural network (APH) for the review-based recommendation, which learns the performance of items from the conflicting sentiment polarity of user reviews. Specifically, APH comprehensively models the relationships among users, …
Exploring Ai Technology In Grammar Performance Testing For Children With Learning Disabilities, Dimitra V. Katsarou, Evangelos Mantsos, Soultana Papadopoulou, Maria Sofologi, Efthymia Efthymiou, Ilias Vasileiou, Kalliopi Megari, Maria Theodoratou, Georgios A. Kougioumtzis
Exploring Ai Technology In Grammar Performance Testing For Children With Learning Disabilities, Dimitra V. Katsarou, Evangelos Mantsos, Soultana Papadopoulou, Maria Sofologi, Efthymia Efthymiou, Ilias Vasileiou, Kalliopi Megari, Maria Theodoratou, Georgios A. Kougioumtzis
All Works
The study explores the application of artificial intelligence (AI) in addressing grammar challenges among children with learning disabilities, aiming to assess the efficacy of an AI-driven tool for personalized interventions. A sample of 100 children aged 8–12, diagnosed with learning disabilities, was recruited from special education programs. Participants were divided into an experimental group (n = 50), which used an AI-based grammar assessment tool with personalized feedback, and a control group (n = 50), which completed conventional paper-based grammar tests without feedback. The AI tool administered adaptive grammar tasks, including sentence correction and verb conjugation, and performance was evaluated over …
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.
Respear: Earable-Based Robust Respiratory Rate Monitoring, Yang Liu, Kayla-Jade Butkow, Jake Stuchbury-Wass, Adam Pullin, Dong Ma, Cecilia Masolo
Respear: Earable-Based Robust Respiratory Rate Monitoring, Yang Liu, Kayla-Jade Butkow, Jake Stuchbury-Wass, Adam Pullin, Dong Ma, Cecilia Masolo
Research Collection School Of Computing and Information Systems
Respiratory rate (RR) monitoring is integral to understanding physical and mental health and tracking fitness. Existing studies have demonstrated the feasibility of RR monitoring under specific user conditions (e.g., while remaining still, or while breathing heavily). Yet, performing accurate, continuous and non-obtrusive RR monitoring across diverse daily routines and activities remains challenging. In this work, we present RespEar, an earable-based system for robust RR monitoring. By leveraging the unique properties of in-ear microphones in earbuds, RespEar enables the use of Respiratory Sinus Arrhythmia (RSA) and Locomotor Respiratory Coupling (LRC), physiological couplings between cardiovascular activity, gait and respiration, to indirectly determine …
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 …
Adaptive Deviation Learning For Visual Anomaly Detection With Data Contamination, Aanindya Sundar Das, Guansong Pang, Monowar Bhuyan
Adaptive Deviation Learning For Visual Anomaly Detection With Data Contamination, Aanindya Sundar Das, Guansong Pang, Monowar Bhuyan
Research Collection School Of Computing and Information Systems
Visual anomaly detection targets to detect images that notably differ from normal pattern, and it has found extensive application in identifying defective parts within the manufacturing industry. These anomaly detection paradigms predominantly focus on training detection models using only clean, unlabeled normal samples, assuming an absence of contamination; a condition often unmet in real-world scenarios. The performance of these methods significantly depends on the quality of the data and usually decreases when exposed to noise. We introduce a systematic adaptive method that employs deviation learning to compute anomaly scores end-to-end while addressing data contamination by assigning relative importance to the …
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 …
Understanding Individual Agent Importance In Multi-Agent System Via Counterfactual Reasoning, Jianming Chen, Yawen Wang, Junjie Wang, Xiaofei Xie, Jun Hu, Qing Wang, Fanjiang Xu
Understanding Individual Agent Importance In Multi-Agent System Via Counterfactual Reasoning, Jianming Chen, Yawen Wang, Junjie Wang, Xiaofei Xie, Jun Hu, Qing Wang, Fanjiang Xu
Research Collection School Of Computing and Information Systems
Explaining multi-agent systems (MAS) is urgent as these systems become increasingly prevalent in various applications. Previous work has provided explanations for the actions or states of agents, yet falls short in understanding the black-boxed agent's importance within a MAS and the overall team strategy. To bridge this gap, we propose EMAI, a novel agent-level explanation approach that evaluates the individual agent's importance. Inspired by counterfactual reasoning, a larger change in reward caused by the randomized action of agent indicates its higher importance. We model it as a MARL problem to capture interactions across agents. Utilizing counterfactual reasoning, EMAI learns the …
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 …
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, …