Digital Commons Network^™

Neutrosophic Sets And Systems, Vol. 70,2024, Florentin Smarandache, Mohamed Abdel-Basset, Said Broumi

Neutrosophic Sets and Systems

the whole volume

Value-Based Subgoal Discovery And Path Planning For Reaching Long-Horizon Goals, Shubham Pateria, Budhitama Subagdja, Ah-Hwee Tan, Chai Quek

Research Collection School Of Computing and Information Systems

Learning to reach long-horizon goals in spatial traversal tasks is a significant challenge for autonomous agents. Recent subgoal graph-based planning methods address this challenge by decomposing a goal into a sequence of shorter-horizon subgoals. These methods, however, use arbitrary heuristics for sampling or discovering subgoals, which may not conform to the cumulative reward distribution. Moreover, they are prone to learning erroneous connections (edges) between subgoals, especially those lying across obstacles. To address these issues, this article proposes a novel subgoal graph-based planning method called learning subgoal graph using value-based subgoal discovery and automatic pruning (LSGVP). The proposed method uses a …

Anopas: Practical Anonymous Transit Pass From Group Signatures With Time-Bound Keys, Rui Shi, Yang Yang, Yingjiu Li, Huamin Feng, Hwee Hwa Pang, Robert H. Deng

Research Collection School Of Computing and Information Systems

An anonymous transit pass system allows passengers to access transport services within fixed time periods, with their privileges automatically deactivating upon time expiration. Although existing transit pass systems are deployable on powerful devices like PCs, their adaptation to more user-friendly devices, such as mobile phones with smart cards, is inefficient due to their reliance on heavy-weight operations like bilinear maps. In this paper, we introduce an innovative anonymous transit pass system, dubbed Anopas, optimized for deployment on mobile phones with smart cards, where the smart card is responsible for crucial lightweight operations and the mobile phone handles key-independent and time-consuming …

An Llm-Assisted Easy-To-Trigger Poisoning Attack On Code Completion Models: Injecting Disguised Vulnerabilities Against Strong Detection, Shenao Yan, Shen Wang, Yue Duan, Hanbin Hong, Kiho Lee, Doowon Kim, Yuan Hong

Research Collection School Of Computing and Information Systems

Large Language Models (LLMs) have transformed code completion tasks, providing context-based suggestions to boost developer productivity in software engineering. As users often fine-tune these models for specific applications, poisoning and backdoor attacks can covertly alter the model outputs. To address this critical security challenge, we introduce CODEBREAKER, a pioneering LLM-assisted backdoor attack framework on code completion models. Unlike recent attacks that embed malicious payloads in detectable or irrelevant sections of the code (e.g., comments), CODEBREAKER leverages LLMs (e.g., GPT-4) for sophisticated payload transformation (without affecting functionalities), ensuring that both the poisoned data for fine-tuning and generated code can evade strong …

Path-Choice-Constrained Bus Bridging Design Under Urban Rail Transit Disruptions, Yiyang Zhu, Jian Gang Jin, Hai Wang

Research Collection School Of Computing and Information Systems

Although urban rail transit systems play a crucial role in urban mobility, they frequently suffer from unexpected disruptions due to power loss, severe weather, equipment failure, and other factors that cause significant disruptions in passenger travel and, in turn, socioeconomic losses. To alleviate the inconvenience of affected passengers, bus bridging services are often provided when rail service has been suspended. Prior research has yielded various methodologies for effective bus bridging services; however, they are mainly based on the strong assumption that passengers must follow predetermined bus bridging routes. Less attention is paid to passengers’ path choice behaviors, which could affect …

Nonfactoid Question Answering As Query-Focused Summarization With Graph-Enhanced Multihop Inference, Yang Deng, Wenxuan Zhang, Weiwen Xu, Ying Shen, Wai Lam

Research Collection School Of Computing and Information Systems

Nonfactoid question answering (QA) is one of the most extensive yet challenging applications and research areas in natural language processing (NLP). Existing methods fall short of handling the long-distance and complex semantic relations between the question and the document sentences. In this work, we propose a novel query-focused summarization method, namely a graph-enhanced multihop query-focused summarizer (GMQS), to tackle the nonfactoid QA problem. Specifically, we leverage graph-enhanced reasoning techniques to elaborate the multihop inference process in nonfactoid QA. Three types of graphs with different semantic relations, namely semantic relevance, topical coherence, and coreference linking, are constructed for explicitly capturing the …

Style: Improving Domain Transferability Of Asking Clarification Questions In Large Language Model Powered Conversational Agents, Yue Chen, Chen Huang, Yang Deng, Wenqiang Lei, Dingnan Jin, Jia Liu, Tat-Seng Chua

Research Collection School Of Computing and Information Systems

Equipping a conversational search engine with strategies regarding when to ask clarification questions is becoming increasingly important across various domains. Attributing to the context understanding capability of LLMs and their access to domain-specific sources of knowledge, LLM-based clarification strategies feature rapid transfer to various domains in a posthoc manner. However, they still struggle to deliver promising performance on unseen domains, struggling to achieve effective domain transferability. We take the first step to investigate this issue and existing methods tend to produce one-size-fits-all strategies across diverse domains, limiting their search effectiveness. In response, we introduce a novel method, called STYLE, to …

On The Multi-Turn Instruction Following For Conversational Web Agents, Yang Deng, Xuan Zhang, Wenxuan Zhang, Yifei Yuan, See-Kiong Ng, Tat-Seng Chua

Research Collection School Of Computing and Information Systems

Web agents powered by Large Language Models (LLMs) have demonstrated remarkable abilities in planning and executing multi-step interactions within complex web-based environments, fulfilling a wide range of web navigation tasks. Despite these advancements, the potential for LLM-powered agents to effectively engage with sequential user instructions in real-world scenarios has not been fully explored. In this work, we introduce a new task of Conversational Web Navigation, which necessitates sophisticated interactions that span multiple turns with both the users and the environment, supported by a specially developed dataset named Multi-Turn Mind2Web (MT-Mind2Web). To tackle the limited context length of LLMs and the …

Watme: Towards Lossless Watermarking Through Lexical Redundancy, Liang Chen, Yatao Bian, Yang Deng, Deng Cai, Shuaiyi Li, Peilin Zhao, Kam-Fai Wong

Research Collection School Of Computing and Information Systems

Text watermarking has emerged as a pivotal technique for identifying machine-generated text. However, existing methods often rely on arbitrary vocabulary partitioning during decoding to embed watermarks, which compromises the availability of suitable tokens and significantly degrades the quality of responses. This study assesses the impact of watermarking on different capabilities of large language models (LLMs) from a cognitive science lens. Our finding highlights a significant disparity; knowledge recall and logical reasoning are more adversely affected than language generation. These results suggest a more profound effect of watermarking on LLMs than previously understood. To address these challenges, we introduce Watermarking with …

A New Hope: Contextual Privacy Policies For Mobile Applications And An Approach Toward Automated Generation, Shidong Pan, Zhen Tao, Thong Hoang, Dawen Zhang, Tianshi Li, Zhenchang Xing, Xiwei Xu, Mark Staples, Thierry Rakotoarivelo, David Lo

Research Collection School Of Computing and Information Systems

Privacy policies have emerged as the predominant approach to conveying privacy notices to mobile application users. In an effort to enhance both readability and user engagement, the concept of contextual privacy policies (CPPs) has been proposed by researchers. The aim of CPPs is to fragment privacy policies into concise snippets, displaying them only within the corresponding contexts within the application’s graphical user interfaces (GUIs). In this paper, we first formulate CPP in mobile application scenario, and then present a novel multimodal framework, named SEEPRIVACY, specifically designed to automatically generate CPPs for mobile applications. This method uniquely integrates vision-based GUI understanding …

Exponential Qubit Reduction In Optimization For Financial Transaction Settlement, Elias X. Huber, Benjamin Y. L. Tan, Paul Robert Griffin, Dimitris G. Angelakis

Research Collection School Of Computing and Information Systems

We extend the qubit-efficient encoding presented in (Tan et al. in Quantum 5:454, 2021) and apply it to instances of the financial transaction settlement problem constructed from data provided by a regulated financial exchange. Our methods are directly applicable to any QUBO problem with linear inequality constraints. Our extension of previously proposed methods consists of a simplification in varying the number of qubits used to encode correlations as well as a new class of variational circuits which incorporate symmetries thereby reducing sampling overhead, improving numerical stability and recovering the expression of the cost objective as a Hermitian observable. We also …

Prompt Tuning On Graph-Augmented Low-Resource Text Classification, Zhihao Wen, Yuan Fang

Research Collection School Of Computing and Information Systems

Text classification is a fundamental problem in information retrieval with many real-world applications, such as predicting the topics of online articles and the categories of e-commerce product descriptions. However, low-resource text classification, with no or few labeled samples, presents a serious concern for supervised learning. Meanwhile, many text data are inherently grounded on a network structure, such as a hyperlink/citation network for online articles, and a user-item purchase network for e-commerce products. These graph structures capture rich semantic relationships, which can potentially augment low-resource text classification. In this paper, we propose a novel model called Graph-Grounded Pre-training and Prompting (G2P2) …

Unifying Global-Local Representations In Salient Object Detection With Transformers, Sucheng Ren, Nanxuan Zhao, Qiang Wen, Guoqiang Han, Shengfeng He

Research Collection School Of Computing and Information Systems

The fully convolutional network (FCN) has dominated salient object detection for a long period. However, the locality of CNN requires the model deep enough to have a global receptive field and such a deep model always leads to the loss of local details. In this paper, we introduce a new attention-based encoder, vision transformer, into salient object detection to ensure the globalization of the representations from shallow to deep layers. With the global view in very shallow layers, the transformer encoder preserves more local representations to recover the spatial details in final saliency maps. Besides, as each layer can capture …

Decoding Gpt Mania In Chinese Stock Market, Yan Ma, Nan Hu, Shuyang Jia

Research Collection School Of Computing and Information Systems

This study investigates the impact of investor attention on stock market reactions to ChatGPT using dialogues on the Chinese interactive investor platforms (IIPs). We measure investor attention by the number of investors’ questions toward ChatGPT on the IIPs and categorize the firms’ answers as Investing, Speculative, and Absent. The research reveals positive and statistically significant market reactions surrounding the initial questions that occur before firm responses. Positive abnormal returns are also observed around the initial answer dates, with Investing firms evoking the highest market response, followed by Speculative firms, and Absent firms exhibiting the lowest reactions. Our results suggest that …

Self-Adaptive Psro : Towards An Automatic Population-Based Game Solver, Pengdeng Li, Shuxin Li, Chang Yang, Xinrun Wang, Xiao Huang, Hau Chan, Bo An

Research Collection School Of Computing and Information Systems

Policy-Space Response Oracles (PSRO) as a general algorithmic framework has achieved state-of-the-art performance in learning equilibrium policies of two-player zero-sum games. However, the hand-crafted hyperparameter value selection in most of the existing works requires extensive domain knowledge, forming the main barrier to applying PSRO to different games. In this work, we make the first attempt to investigate the possibility of self-adaptively determining the optimal hyperparameter values in the PSRO framework. Our contributions are three-fold: (1) Using several hyperparameters, we propose a parametric PSRO that unifies the gradient descent ascent (GDA) and different PSRO variants. (2) We propose the self-adaptive PSRO …

Macrohft : Memory Augmented Context-Aware Reinforcement Learning On High Frequency Trading, Chuqiao Zong, Chaojie Wang, Molei Qin, Lei Feng, Xinrun Wang, Xinrun Wang

Research Collection School Of Computing and Information Systems

High-frequency trading (HFT) that executes algorithmic trading in short time scales, has recently occupied the majority of cryptocurrency market. Besides traditional quantitative trading methods, reinforcement learning (RL) has become another appealing approach for HFT due to its terrific ability of handling high-dimensional financial data and solving sophisticated sequential decision-making problems, e.g., hierarchical reinforcement learning (HRL) has shown its promising performance on second-level HFT by training a router to select only one sub-agent from the agent pool to execute the current transaction. However, existing RL methods for HFT still have some defects: 1) standard RL-based trading agents suffer from the overfitting …

Reinforcement Tuning For Detecting Stances And Debunking Rumors Jointly With Large Language Models, Ruichao Yang, Wei Gao, Jing Ma, Hongzhan Ling, Bo Wang

Research Collection School Of Computing and Information Systems

Learning multi-task models for jointly detecting stance and verifying rumors poses challenges due to the need for training data of stance at post level and rumor veracity at claim level, which are difficult to obtain. To address this issue, we leverage large language models (LLMs) as the foundation annotators for the joint stance detection (SD) and rumor verification (RV) tasks, dubbed as JSDRV. We introduce a novel reinforcement tuning framework to enhance the joint predictive capabilities of LLM-based SD and RV components. Specifically, we devise a policy for selecting LLM-annotated data at the two levels, employing a hybrid reward mechanism …

Reinforcement Nash Equilibrium Solver, Xinrun Wang, Chang Yang, Shuxin Li, Pengdeng Li, Xiao Huang, Hau Chan, Bo An

Research Collection School Of Computing and Information Systems

Nash Equilibrium (NE) is the canonical solution concept of game theory, which provides an elegant tool to understand the rationalities. Though mixed strategy NE exists in any game with finite players and actions, computing NE in two- or multi-player general-sum games is PPAD-Complete. Various alternative solutions, e.g., Correlated Equilibrium (CE), and learning methods, e.g., fictitious play (FP), are proposed to approximate NE. For convenience, we call these methods as "inexact solvers", or "solvers" for short. However, the alternative solutions differ from NE and the learning methods generally fail to converge to NE. Therefore, in this work, we propose REinforcement Nash …

Gamification In Erp Systems: A Study On Intrinsic Motivation And User Behavioral Intentions, Esi Adeborna, Fiona Fui-Hoon Nah, Luvai Motiwalla

Research Collection School Of Computing and Information Systems

In the evolving landscape of Enterprise Resource Planning (ERP) systems, integrating gamification shows promise for enhancing user training and education. However, empirical research on gamification's effect on intrinsic motivation in using ERP is limited. Hence, we examined the intrinsic motivational effects of a gamified ERP environment in this research. We created a Gamified Web Application linked to SAP ERP to investigate how gamification affects users' behavioral intention. Leveraging self-determination theory, we examined the influence of perceived competence, autonomy, and relatedness on usage intent. In a controlled experiment with 63 participants, data collected via survey revealed that gamification enhances perceived competence, …

The Fourth International Workshop On Smart Data For Blockchain And Distributed Ledger (Sdbd '24), Feida Zhu, Jian Pei, Michael Zeller, Bingxue Zhang

Research Collection School Of Computing and Information Systems

With the advent of Bitcoin, a cryptographically-enabled peer-to-peer digital payment system, blockchain together with a whole package of distributed ledger technologies, which serve as the underlying foundation of all the crypto-currencies, have been gaining attention from both academia and industry in the last fifteen years. The recent years have witnessed tremendous momentum in the development of blockchain and distributed ledger technologies, largely due to the impressive rise in the market capital of these digital tokens. More and more industries, from banking and insurance, to supply chain and e-commerce, are quickly realizing the great potential in blockchain technology in efficiency boost, …

Fuel-Saving Route Planning With Data-Driven And Learning-Based Approaches: A Systematic Solution For Harbor Tugs, Shengming Wang, Xiaocai Zhang, Jing Li, Xiaoyang Wei, Hoong Chuin Lau, Bing Tian Dai, Binbin Huang Huang, Zhe Xiao, Xiuju Fu, Zheng Qin

Research Collection School Of Computing and Information Systems

In recent years, there are trends toward cleaner port environments through enforcement by imposed legislation. Transit optimisation of fuel-based port service boats like harbour tugs has emerged as a critical task to reduce fuel consumption and carbon emission. In this paper, an innovative learning-based method, comprising a Reinforcement Learning (RL) model together with a fuel consumption prediction model, was proposed to formulate fuel-saving transit routes. Firstly, an ensemble model is established by combining a Long Short-Term Memory (LSTM) model with a Multilayer Perceptron (MLP) model, predicting fuel use based on tugboat movement and environment factors. Subsequently, an innovative RL based …

Anopay: Anonymous Payment For Vehicle Parking With Updatable Credential, Yang Yang, Wenyi Xue, Yonghua Zhan, Minming Huang, Yingjiu Li, Robert H. Deng

Research Collection School Of Computing and Information Systems

Many existing anonymous parking payment schemes lack high efficiency and flexibility. For instance, the calculation and communication costs involved in payment may linearly increase with the payment amount. In this paper, we propose an anonymous payment system (dubbed AnoPay) for vehicle parking, which leverages updatable attribute-based anonymous credentials and efficient zero-knowledge proof (ZKP) to achieve user anonymity and constant overhead for parking fee payment. To further improve the efficiency, we design a secure parking fee aggregation protocol based on linear homomorphic encryption to aggregate parking transactions, where the amount of each parking transaction is hidden and the privacy of the …

Is Aggregation The Only Choice? Federated Learning Via Layer-Wise Model Recombination, Ming Hu, Zhihao Yue, Xiaofei Xie, Cheng Chen Chen

Research Collection School Of Computing and Information Systems

Although Federated Learning (FL) enables global model training Xiaofei Xie [email protected] Singapore Management University Singapore, Singapore Xian Wei [email protected] East China Normal University Shanghai, China Mingsong Chen∗ [email protected] East China Normal University Shanghai, China • Computing methodologies → Distributed artificial intelligence. across clients without compromising their raw data, due to the unevenly distributed data among clients, existing Federated Averaging (FedAvg)-based methods suffer from the problem of low inference performance. Specifically, different data distributions among clients lead to various optimization directions of local models. Aggregating local models usually results in a low-generalized global model, which performs worse on most of the …

Contrastive General Graph Matching With Adaptive Augmentation Sampling, Jianyuan Bo, Yuan Fang

Research Collection School Of Computing and Information Systems

Graph matching has important applications in pattern recognition and beyond. Current approaches predominantly adopt supervised learning, demanding extensive labeled data which can be limited or costly. Meanwhile, self-supervised learning methods for graph matching often require additional side information such as extra categorical information and input features, limiting their application to the general case. Moreover, designing the optimal graph augmentations for self-supervised graph matching presents another challenge to ensure robustness and effcacy. To address these issues, we introduce a novel Graph-centric Contrastive framework for Graph Matching (GCGM), capitalizing on a vast pool of graph augmentations for contrastive learning, yet without needing …

A Learned Generalized Geodesic Distance Function-Based Approach For Node Feature Augmentation On Graphs, Amitoz Azad, Yuan Fang

Research Collection School Of Computing and Information Systems

Geodesic distances on manifolds have numerous applications in image processing, computer graphics and computer vision. In this work, we introduce an approach called 'LGGD' (Learned Generalized Geodesic Distances). This method involves generating node features by learning a generalized geodesic distance function through a training pipeline that incorporates training data, graph topology and the node content features. The strength of this method lies in the proven robustness of the generalized geodesic distances to noise and outliers. Our contributions encompass improved performance in node classification tasks, competitive results with state-of-the-art methods on real-world graph datasets, the demonstration of the learnability of parameters …

Tackling Stackelberg Network Interdiction Against A Boundedly Rational Adversary, Tien Mai, Avinandan Bose, Arunesh Sinha, Thanh Nguyen, Ayushman Kumar Singh

Research Collection School Of Computing and Information Systems

This work studies Stackelberg network interdiction games --- an important class of games in which a defender first allocates (randomized) defense resources to a set of critical nodes on a graph while an adversary chooses its path to attack these nodes accordingly. We consider a boundedly rational adversary in which the adversary's response model is based on a dynamic form of classic logit-based (quantal response) discrete choice models. The resulting optimization is non-convex and additionally, involves complex terms that sum over exponentially many paths. We tackle these computational challenges by presenting new efficient algorithms with solution guarantees. First, we present …

Analyzing Temporal Complex Events With Large Language Models? A Benchmark Towards Temporal, Long Context Understanding, Zhihan Zhang, Yixin Cao, Chenchen Ye, Ma. Yunshan, Lizi Liao, Tat-Seng Chua

Research Collection School Of Computing and Information Systems

The digital landscape is rapidly evolving with an ever-increasing volume of online news, emphasizing the need for swift and precise analysis of complex events.We refer to the complex events composed of many news articles over an extended period as Temporal Complex Event (TCE). This paper proposes a novel approach using Large Language Models (LLMs) to systematically extract and analyze the event chain within TCE, characterized by their key points and timestamps. We establish a benchmark, named TCELongBench, to evaluate the proficiency of LLMs in handling temporal dynamics and understanding extensive text. This benchmark encompasses three distinct tasks - reading comprehension, …

Firm-Level Ai Ethical Awareness: Measurement And Effects, Yan Ma, Nan Hu

Research Collection School Of Computing and Information Systems

With rapid integration of AI technologies into business operation, ethical issues associated with AI development, implementation, and deployment, has become increasingly conspicuous. An effective measure of firm-level AI Ethical Awareness (FAIEA) is crucial for both academics and practitioners to assess FAIEA efficiently. In this study, based on qualitative information in earning conference call, we construct and validate a firm specific measure of FAIEA. Upon establishing a reliable measure, we explore the determinants and consequence of FAIEA. We find Corporate Social Responsibility (CSR) engagement and the presence of a Chief Information Officer (CIO) as key determinants of higher FAIEA, suggesting the …

Consistency Of Advanced Radiation Therapy Qa Methods And Global Auditing Systems, Fre'etta Brooks

Dissertations and Theses (Open Access)

Consistency of Advanced Radiation Therapy QA Methods and Global Auditing Systems

Fre’Etta M.D. Brooks, B.S.

Advisory Professor: Stephen F. Kry, Ph.D.

Abstract

Auditing systems provide a means to verify the implementation and operation of all equipment and radiation parameters used by an institution providing radiation therapy treatments. The systems are important tools that are used to determine if an institution can accurately deliver radiation therapy that requires complex planning in the form of IMRT or VMAT and credential radiotherapy treatment institutions for specific clinical trial protocols; to assure the quality of treatment to all patients. Auditing techniques vary by region …

Influential Factors And Predicting Dose Delivery Accuracy For Imaging And Radiation Oncology Core’S Phantom Program Using Machine Learning, Hunter Mehrens

Dissertations and Theses (Open Access)

IROC’s mission is to help ensure consistent and comparable, high-quality radiotherapy across clinics that participate in national clinical trials. To obtain this mission, IROC’s phantom program provides a third-party end-to-end check of the clinical workflow of a patient receiving radiotherapy. The goal of the phantom audit is to compare the dose delivered to the dose planned by the treatment system ensuring dose delivery accuracy. While IROC’s phantoms are better equipped to catch dose delivery errors compared to a clinic’s QA process, the end-to-end process and reporting of results is time-consuming creating a bottleneck for clinical trial participation. Furthermore, IROC’s passing …