Open Access. Powered by Scholars. Published by Universities.®
- Discipline
-
- Physical Sciences and Mathematics (8556)
- Computer Sciences (8539)
- Databases and Information Systems (3453)
- Software Engineering (2164)
- Artificial Intelligence and Robotics (1697)
-
- Information Security (1071)
- Numerical Analysis and Scientific Computing (1025)
- Graphics and Human Computer Interfaces (933)
- Engineering (891)
- Social and Behavioral Sciences (682)
- Business (646)
- Theory and Algorithms (493)
- Computer Engineering (459)
- Operations Research, Systems Engineering and Industrial Engineering (405)
- Programming Languages and Compilers (379)
- OS and Networks (324)
- Communication (300)
- Social Media (242)
- Public Affairs, Public Policy and Public Administration (212)
- Transportation (189)
- Medicine and Health Sciences (183)
- Education (172)
- Management Information Systems (168)
- Data Storage Systems (162)
- E-Commerce (148)
- International and Area Studies (114)
- Asian Studies (113)
- Health Information Technology (112)
- Digital Communications and Networking (109)
- Technology and Innovation (106)
- Keyword
-
- Deep learning (124)
- Machine learning (122)
- Social media (76)
- Artificial intelligence (71)
- Reinforcement learning (69)
-
- Privacy (65)
- Data mining (64)
- Cloud computing (58)
- Deep Learning (56)
- Empirical study (54)
- Security (54)
- Optimization (53)
- Visualization (52)
- Task analysis (50)
- Neural networks (49)
- Online learning (49)
- Singapore (49)
- Software engineering (49)
- Training (49)
- Anomaly detection (47)
- Feature extraction (46)
- Twitter (46)
- Large Language Models (45)
- Blockchain (44)
- Collaboration (44)
- Semantics (43)
- Access control (41)
- Algorithms (40)
- Android (39)
- Classification (38)
- Publication Year
- File Type
Articles 691 - 720 of 8612
Full-Text Articles in Entire DC Network
Sigscope: Detecting And Understanding Off‑Chain Message Signing‑Related Vulnerabilities In Decentralized Applications, Sajad Meisami, Hugo Dabadie, Song Li, Yuzhe Tang, Yue Duan
Sigscope: Detecting And Understanding Off‑Chain Message Signing‑Related Vulnerabilities In Decentralized Applications, Sajad Meisami, Hugo Dabadie, Song Li, Yuzhe Tang, Yue Duan
Research Collection School Of Computing and Information Systems
In Web 3.0, an emerging paradigm of building decentralized applications or DApps is off-chain message signing, which has advantages in performance, cost efficiency, and usability compared to conventional transaction-signing schemes. However, message signing burdens DApp developers with extra coding complexity and message designing, leading to new security risks.This paper presents the first systematic study to uncover and characterize the security issues in off-chain message signing schemes and the DApps built atop them. We present a holistic static-analysis framework, SigScope, that uniquely combines the insights extracted from DApp front-end code (HTML and Javascript) off-chain and back-end smart contracts on-chain. We evaluate …
Real-Time Rectifying Flight Control Misconfiguration Using Intelligent Agent, Ruidong Han, Shangzhi Xu, Juanru Li, Elisa Bertino, David Lo, Jianfeng Ma, Siqi Ma
Real-Time Rectifying Flight Control Misconfiguration Using Intelligent Agent, Ruidong Han, Shangzhi Xu, Juanru Li, Elisa Bertino, David Lo, Jianfeng Ma, Siqi Ma
Research Collection School Of Computing and Information Systems
Configurations are supported by most flight control systems, allowing users to control a flying drone adapted to complexities such as environmental changes or mission alterations. Such an advanced functionality also introduces a significant problem—misconfiguration settings. It may cause drone instability, threaten drone safety, and potentially lead to substantial financial loss. However, detecting and rectifying misconfigurations across different flight control systems is challenging because (1) (mis)configuration-related code snippets might be syntactically correct and thus hard to identify through traditional code analysis; (2) the response to each configuration varies under different flying scenarios.In this article, we propose and implement a novel rectification …
Cyberoception: Finding A Painlessly-Measurable New Sense In The Cyberworld Towards Emotion-Awareness In Computing, Tadashi Okoshi, Zexiong Gao, Yi Zhen Tan, Takumi Karasawa, Takeshi Miki, Wataru Sasaki, Rajesh Krishna Balan
Cyberoception: Finding A Painlessly-Measurable New Sense In The Cyberworld Towards Emotion-Awareness In Computing, Tadashi Okoshi, Zexiong Gao, Yi Zhen Tan, Takumi Karasawa, Takeshi Miki, Wataru Sasaki, Rajesh Krishna Balan
Research Collection School Of Computing and Information Systems
In Affective computing, recognizing users’ emotions accurately is the basis of affective human–computer interaction. Understanding users’ interoception contributes to a better understanding of individually different emotional abilities, which is essential for achieving inter-individually accurate emotion estimation. However, existing interoception measurement methods, such as the heart rate discrimination task, have several limitations, including their dependence on a well-controlled laboratory environment and precision apparatus, making monitoring users’ interoception challenging. This study aims to determine other forms of data that can explain users’ interoceptive or similar states in their real-world lives and propose a novel hypothetical concept “cyberoception,” a new sense (1) which …
Hierarchical Frameworks For Scaling-Up Multi-Agent Coordination, Minghong Geng
Hierarchical Frameworks For Scaling-Up Multi-Agent Coordination, Minghong Geng
Research Collection School Of Computing and Information Systems
Multi-agent reinforcement learning has emerged as a powerful framework for developing collaborative behaviors in autonomous systems. However, existing MARL methods often struggle with scalability in terms of both the number of agents and decision-making horizons. My research focuses on developing hierarchicalapproaches to scale up MARL systems through two complementary directions: structural scaling by increasing the number of coordinated agents and temporal scaling by extending planning horizons. My initial work introduced HiSOMA, a hierarchical framework integrating self-organizing neural networks with MARL forlong-horizon planning, and MOSMAC, a benchmark for evaluating MARL methods on multi-objective MARL scenarios. Building on these foundations, my recent …
Mosmac: A Multi-Agent Reinforcement Learning Benchmark On Sequential Multi-Objective Tasks, Minghong Geng, Shubham Pateria, Budhitama Subagdja, Ah-Hwee Tan
Mosmac: A Multi-Agent Reinforcement Learning Benchmark On Sequential Multi-Objective Tasks, Minghong Geng, Shubham Pateria, Budhitama Subagdja, Ah-Hwee Tan
Research Collection School Of Computing and Information Systems
Recent advancements in multi-agent reinforcement learning (MARL) have demonstrated success on various cooperative multi-agent tasks. However, current benchmarks often fall short of representing realistic scenarios that demand agents to execute sequential tasks over long temporal horizons while balancing multiple objectives. To address this limitation, we introduce multi-objective SMAC (MOSMAC), a comprehensive MARL benchmark designed to evaluate MARL methods on tasks involving multiple objectives, sequential subtask assignments, and varying temporal horizons. MOSMAC requires agents to tackle a series of interconnected subtasks in StarCraft II while simultaneously optimizing for multiple objectives, including combat, safety, and navigation. Through rigorous evaluation of nine state-of-the-art …
Toward Better Comprehension Of Breaking Changes In The Npm Ecosystem, Dezhen Kong, Jiakun Liu, Lingfeng Bao, David Lo
Toward Better Comprehension Of Breaking Changes In The Npm Ecosystem, Dezhen Kong, Jiakun Liu, Lingfeng Bao, David Lo
Research Collection School Of Computing and Information Systems
Code evolution is prevalent in software ecosystems, which can provide many benefits, such as new features, bug fixes, security patches, while still introducing breaking changes that make downstream projects fail to work. Breaking changes cause a lot of effort to both downstream and upstream developers: downstream developers need to adapt to breaking changes and upstream developers are responsible for identifying and documenting them. In the NPM ecosystem, characterized by frequent code changes and a high tolerance for making breaking changes, the effort is larger.For better comprehension of breaking changes in the NPM ecosystem and to enhance breaking change detection tools, …
Seaexam And Seabench: Benchmarking Llms With Local Multilingual Questions In Southeast Asia, Chaoqun Liu, Wenxuan Zhang, Jiahao Ying, Mahani Aljunied, Anh Tuan Luu, Lidong Bing
Seaexam And Seabench: Benchmarking Llms With Local Multilingual Questions In Southeast Asia, Chaoqun Liu, Wenxuan Zhang, Jiahao Ying, Mahani Aljunied, Anh Tuan Luu, Lidong Bing
Research Collection School Of Computing and Information Systems
This study introduces two novel benchmarks, SeaExam and SeaBench, designed to evalu ate the capabilities of Large Language Models (LLMs) in Southeast Asian (SEA) application scenarios. Unlike existing multilingual datasets primarily derived from English translations, these benchmarks are constructed based on real world scenarios from SEA regions. SeaExam draws from regional educational exams to form a comprehensive dataset that encompasses sub jects such as local history and literature. In contrast, SeaBench is crafted around multi turn, open-ended tasks that reflect daily inter actions within SEA communities. Our evalua tions demonstrate that SeaExam and SeaBench more effectively discern LLM performance on …
Few-Shot Learning On Graphs: From Meta-Learning To Llm-Empowered Pre-Training And Beyond, Yuan Fang, Yuxia Wu, Xingtong Yu, Shirui Pan
Few-Shot Learning On Graphs: From Meta-Learning To Llm-Empowered Pre-Training And Beyond, Yuan Fang, Yuxia Wu, Xingtong Yu, Shirui Pan
Research Collection School Of Computing and Information Systems
Graph representation learning has become central to many graph-based tasks, driving advancements in various domains such as web search, recommendation systems, and social network analysis. Traditionally, these methods rely on end-to-end supervised learning paradigms that require abundant labeled data, which can be costly and difficult to obtain. To address this limitation, few-shot learning on graphs has emerged as a promising approach, allowing models to generalize with minimal supervision and overcome data scarcity in real-world applications. This tutorial offers an in-depth exploration of recent advancements in few-shot learning for graphs, providing a comparative analysis of state-of-the-art methods and identifying future research …
Eduqate: Generating Adaptive Curricula Through Rmabs In Education Settings, Sidney Tio, Dexun Li, Pradeep Varakantham
Eduqate: Generating Adaptive Curricula Through Rmabs In Education Settings, Sidney Tio, Dexun Li, Pradeep Varakantham
Research Collection School Of Computing and Information Systems
There has been significant interest in the development of personalized and adaptive educational tools that cater to a student's individual learning progress. A crucial aspect in developing such tools is in exploring how mastery can be achieved across a diverse yet related range of content in an efficient manner. While Reinforcement Learning and Multi-armed Bandits have shown promise in educational settings, existing works often assume the independence of learning content, neglecting the prevalent interdependencies between such content. In response, we introduce Education Network Restless Multi-armed Bandits (EdNetRMABs), utilizing a network to represent the relationships between interdependent arms. Subsequently, we propose …
Does Chatgpt-Permitted Assessments Help Students Generate Better Answers And Learn More?, Michelle L. F. Cheong, Yun-Chen Chen
Does Chatgpt-Permitted Assessments Help Students Generate Better Answers And Learn More?, Michelle L. F. Cheong, Yun-Chen Chen
Research Collection School Of Computing and Information Systems
We discuss our methodology and implementation of ChatGPT-permitted assessments for a university-level spreadsheets modelling module. Through our quantitative data analysis, our students rated ChatGPT’s answers to be incorrect on average and thus will not help them generate better answers directly, representing low “Perceived usefulness” (PU), while they rated ChatGPT 3.5 with relatively high “Perceived ease of use” (PE). They gave a good “Behavioural intention” (BI) rating indicating that they were motivated to use it in future as they could still learn more about this module by using ChatGPT 3.5. We found that both PU and PE affected BI positively, with …
Chatcrs: Incorporating External Knowledge And Goal Guidance For Llm-Based Conversational Recommender Systems, Chuang Li, Yang Deng, Hengchang Hu, Min-Yen Kan, Haizhou Li
Chatcrs: Incorporating External Knowledge And Goal Guidance For Llm-Based Conversational Recommender Systems, Chuang Li, Yang Deng, Hengchang Hu, Min-Yen Kan, Haizhou Li
Research Collection School Of Computing and Information Systems
This paper aims to efficiently enable large language models (LLMs) to use external knowledge and goal guidance in conversational recommender system (CRS) tasks. Advanced LLMs (e.g., ChatGPT) are limited in domain-specific CRS tasks for 1) generating grounded responses with recommendation-oriented knowledge, or 2) proactively leading the conversations through different dialogue goals. In this work, we first analyze those limitations through a comprehensive evaluation, showing the necessity of external knowledge and goal guidance which contribute significantly to the recommendation accuracy and language quality. In light of this finding, we propose a novel ChatCRS framework to decompose the complex CRS task into …
A Selective Vehicle Routing Problem For The Bloodmobile System, Aldy Gunawan, Samuel Alan Darmasaputra, Sy Hoang Do, Vincent F. Yu
A Selective Vehicle Routing Problem For The Bloodmobile System, Aldy Gunawan, Samuel Alan Darmasaputra, Sy Hoang Do, Vincent F. Yu
Research Collection School Of Computing and Information Systems
Mobile blood collection has the advantage of greater reach compared to blood drives at fixed donation sites and is preferable for individuals with limited time or means of transportation. Bloodmobiles are widely used in healthcare logistics to increase the number of donors and donation frequency and to better match blood demand with collection. Bloodmobiles are stationed at predetermined locations, while shuttles are assigned to visit these locations to collect the donated blood. This problem is formulated as the Selective Vehicle Routing Problem under the Bloodmobile System (SVRP-BM). This research extends the Selective Vehicle Routing Problem with Integrated Tours problem (SVRPwIT) …
Sita: Structurally Imperceptible And Transferable Adversarial Attacks For Stylized Image Generation, Jingdan Kang, Haoxin Yang, Yan Cai, Huaidong Zhang, Xuemiao Xu, Yong Du, Shengfeng He
Sita: Structurally Imperceptible And Transferable Adversarial Attacks For Stylized Image Generation, Jingdan Kang, Haoxin Yang, Yan Cai, Huaidong Zhang, Xuemiao Xu, Yong Du, Shengfeng He
Research Collection School Of Computing and Information Systems
Image generation technology has brought significant advancements across various fields but has also raised concerns about data misuse and potential rights infringements, particularly with respect to creating visual artworks. Current methods aimed at safeguarding artworks often employ adversarial attacks. However, these methods face challenges such as poor transferability, high computational costs, and the introduction of noticeable noise, which compromises the aesthetic quality of the original artwork. To address these limitations, we propose a Structurally Imperceptible and Transferable Adversarial (SITA) attacks. SITA leverages a CLIP-based destylization loss, which decouples and disrupts the robust style representation of the image. This disruption hinders …
Comadice: Offline Cooperative Multi-Agent Reinforcement Learning With Stationary Distribution Shift Regularization, The Viet Bui, Tien Mai, Hong Thanh Nguyen
Comadice: Offline Cooperative Multi-Agent Reinforcement Learning With Stationary Distribution Shift Regularization, The Viet Bui, Tien Mai, Hong Thanh Nguyen
Research Collection School Of Computing and Information Systems
Offline reinforcement learning (RL) has garnered significant attention for its ability to learn effective policies from pre-collected datasets without the need for further environmental interactions. While promising results have been demonstrated in single-agent settings, offline multi-agent reinforcement learning (MARL) presents additional challenges due to the large joint state-action space and the complexity of multi-agent behaviors. A key issue in offline RL is the distributional shift, which arises when the target policy being optimized deviates from the behavior policy that generated the data. This problem is exacerbated in MARL due to the interdependence between agents' local policies and the expansive joint …
Agentstudio: A Toolkit For Building General Virtual Agents, Longtao Zheng, Zhiyuan Huang, Zhenghai Xue, Xinrun Wang, Bo An, Shuicheng Yan
Agentstudio: A Toolkit For Building General Virtual Agents, Longtao Zheng, Zhiyuan Huang, Zhenghai Xue, Xinrun Wang, Bo An, Shuicheng Yan
Research Collection School Of Computing and Information Systems
General virtual agents need to handle multimodal observations, master complex action spaces, and self-improve in dynamic, open-domain environments. However, existing environments are often domain-specific and require complex setups, which limits agent development and evaluation in real-world settings. As a result, current evaluations lack in-depth analyses that decompose fundamental agent capabilities. We introduce AgentStudio, a trinity of environments, tools, and benchmarks to address these issues. AgentStudio provides a lightweight, interactive environment with highly generic observation and action spaces, e.g., video observations and GUI/API actions. It integrates tools for creating online benchmark tasks, annotating GUI elements, and labeling actions in videos. Based …
Semantic Loss-Guided Data-Efficient Supervised Fine-Tuning For Safe Responses In Llms, Yuxiao Lu, Pradeep Varakantham, Pradeep Varakantham
Semantic Loss-Guided Data-Efficient Supervised Fine-Tuning For Safe Responses In Llms, Yuxiao Lu, Pradeep Varakantham, Pradeep Varakantham
Research Collection School Of Computing and Information Systems
Large Language Models (LLMs) generating unsafe responses to toxic prompts is a significant issue in their applications. While various efforts aim to address this safety concern, previous approaches often demand substantial human data collection or rely on the less dependable option of using another LLM to generate corrective data. In this paper, we aim to take this problem and overcome limitations of requiring significant high-quality human data. Our method requires only a small set of unsafe responses to toxic prompts, easily obtained from the unsafe LLM itself. By employing a semantic cost combined with a negative Earth Mover Distance (EMD) …
Minimum Multi-Service Fleet Size Problem: Shareability Graph And Network Flow Approach, Dingtong Yang, Yubin Liu, Hai Wang, Jinhua Zhao, Hamsa Balakrishnan
Minimum Multi-Service Fleet Size Problem: Shareability Graph And Network Flow Approach, Dingtong Yang, Yubin Liu, Hai Wang, Jinhua Zhao, Hamsa Balakrishnan
Research Collection School Of Computing and Information Systems
On-demand, vehicle-based services—such as ride-hailing, food, grocery, and parcel delivery—have become ubiquitous over the past decade. These services can be categorized into four types (Sun et al., 2023): passenger mobility, goods delivery, information acquisition (e.g., probe vehicle for traffic conditions), and mobile server (e.g., vehicle displaying advertisements). Passenger mobility and goods delivery are typically fulfilled by separate fleets, each dedicated to a single service. However, if various services can be pooled and handled simultaneously by a multi-functional fleet while maintaining service quality, the total number of required vehicles and overall vehicle mileage could be significantly reduced. This exciting potential motivates …
Prioritizing Speech Test Cases, Zhou Yang, Jieke Shi, Muhammad Hilmi Asyrofi, Bowen Xu, Xin Zhou, Donggyun Han, David Lo
Prioritizing Speech Test Cases, Zhou Yang, Jieke Shi, Muhammad Hilmi Asyrofi, Bowen Xu, Xin Zhou, Donggyun Han, David Lo
Research Collection School Of Computing and Information Systems
As Automated Speech Recognition (ASR) systems gain widespread acceptance, there is a pressing need to rigorously test and enhance their performance. Nonetheless, the process of collecting and executing speech test cases is typically both costly and time-consuming. This presents a compelling case for the strategic prioritization of speech test cases, which consist of a piece of audio and the corresponding reference text. The central question we address is: In what sequence should speech test cases be collected and executed to identify the maximum number of errors at the earliest stage? In this study, we introduce PRiOritizing sPeecH tEsT …
Bigcodebench: Benchmarking Code Generation With Diverse Function Calls And Complex Instructions, T.Y. Zhuo, M.C. Vu, J. Chim, ..., David Lo
Bigcodebench: Benchmarking Code Generation With Diverse Function Calls And Complex Instructions, T.Y. Zhuo, M.C. Vu, J. Chim, ..., David Lo
Research Collection School Of Computing and Information Systems
Task automation has been greatly empowered by the recent advances in Large Language Models (LLMs) via Python code, where the tasks ranging from software engineering development to general-purpose reasoning. While current benchmarks have shown that LLMs can solve tasks using programs like human developers, the majority of their evaluations are limited to short and self-contained algorithmic tasks or standalone function calls. Solving challenging and practical tasks requires the capability of utilizing diverse function calls as tools to efficiently implement functionalities like data analysis and web development. In addition, using multiple tools to solve a task needs compositional reasoning by accurately …
Nash Bargaining Strategy In Autonomous Decision Making For Multi-Ship Collision Avoidance Based On Route Exchange, Yang Wang, Qiangsheng Ye, Hoong Chuin Lau, Tengfei Wang, Bing Wu
Nash Bargaining Strategy In Autonomous Decision Making For Multi-Ship Collision Avoidance Based On Route Exchange, Yang Wang, Qiangsheng Ye, Hoong Chuin Lau, Tengfei Wang, Bing Wu
Research Collection School Of Computing and Information Systems
A novel scheme is proposed for the distributed multi-ship collision avoidance (CA) problem with consideration of the autonomous, dynamic nature of the real circumstance. All the ships in the envisioned scenarios can share their decisions or intentions through route exchange, allowing them to make subsequent decisions based on the route planning in each iteration. By leveraging route exchange, the multi-ship CA problem involves iterations for negotiation, and is regarded as a staged cooperative game under conditions of complete information. The concept of closest spatio-temporal distance (CSTD) is introduced to more accurately assess collision risk between ships. A coordinated CA mechanism …
Samgpt: Text-Free Graph Foundation Model For Multi-Domain Pre-Training And Cross-Domain Adaptation, Xingtong Yu, Zechuan Gong, Chang Zhou, Yuan Fang, Hui Zhang
Samgpt: Text-Free Graph Foundation Model For Multi-Domain Pre-Training And Cross-Domain Adaptation, Xingtong Yu, Zechuan Gong, Chang Zhou, Yuan Fang, Hui Zhang
Research Collection School Of Computing and Information Systems
Graphs are able to model interconnected entities in many online services, supporting a wide range of applications on the Web. This raises an important question: How can we train a graph foundational model on multiple source domains and adapt to an unseen target domain? A major obstacle is that graphs from different domains often exhibit divergent characteristics. Some studies leverage large language models to align multiple domains based on textual descriptions associated with the graphs, limiting their applicability to text-attributed graphs. For text-free graphs, a few recent works attempt to align different feature distributions across domains, while generally neglecting structural …
Node-Time Conditional Prompt Learning In Dynamic Graphs, Xingtong Yu, Zhenghao Liu, Xinming Zhang, Yuan Fang
Node-Time Conditional Prompt Learning In Dynamic Graphs, Xingtong Yu, Zhenghao Liu, Xinming Zhang, Yuan Fang
Research Collection School Of Computing and Information Systems
Dynamic graphs capture evolving interactions between entities, such as in social networks, online learning platforms, and crowdsourcing projects. For dynamic graph modeling, dynamic graph neural networks (DGNNs) have emerged as a mainstream technique. However, they are generally pre-trained on the link prediction task, leaving a significant gap from the objectives of downstream tasks such as node classification. To bridge the gap, prompt-based learning has gained traction on graphs, but most existing efforts focus on static graphs and neglect the evolution of dynamic graphs. In this paper, we propose DYGPROMPT, a novel pre-training and prompt learning framework for dynamic graph modeling. …
Bootstrapping Language Models With Dpo Implicit Rewards, Changyu Chen, Zichen Liu, Chao Du, Tianyu Pang, Qian Liu, Arunesh Sinha, Pradeep Varakantham, Min Lin
Bootstrapping Language Models With Dpo Implicit Rewards, Changyu Chen, Zichen Liu, Chao Du, Tianyu Pang, Qian Liu, Arunesh Sinha, Pradeep Varakantham, Min Lin
Research Collection School Of Computing and Information Systems
Human alignment in large language models (LLMs) is an active area of research. A recent groundbreaking work, direct preference optimization (DPO), has greatly simplified the process from past work in reinforcement learning from human feedback (RLHF) by bypassing the reward learning stage in RLHF. DPO, after training, provides an implicit reward model. In this work, we make a novel observation that this implicit reward model can by itself be used in a bootstrapping fashion to further align the LLM. Our approach is to use the rewards from a current LLM model to construct a preference dataset, which is then used …
On The Probability Of Necessity And Sufficiency Of Explaining Graph Neural Networks: A Lower Bound Optimization Approach, Ruichu Cai, Yuxuan Zhu, Xuexin Chen, Yuan Fang, Min Wu, Jie Qiao, Zhifeng Hao
On The Probability Of Necessity And Sufficiency Of Explaining Graph Neural Networks: A Lower Bound Optimization Approach, Ruichu Cai, Yuxuan Zhu, Xuexin Chen, Yuan Fang, Min Wu, Jie Qiao, Zhifeng Hao
Research Collection School Of Computing and Information Systems
The explainability of Graph Neural Networks (GNNs) is critical to various GNN applications, yet it remains a significant challenge. A convincing explanation should be both necessary and sufficient simultaneously. However, existing GNN explaining approaches focus on only one of the two aspects, necessity or sufficiency, or a heuristic trade-off between the two. Theoretically, the Probability of Necessity and Sufficiency (PNS) holds the potential to identify the most necessary and sufficient explanation since it can mathematically quantify the necessity and sufficiency of an explanation. Nevertheless, the difficulty of obtaining PNS due to non-monotonicity and the challenge of counterfactual estimation limit its …
Characterising Reproducibility Debt In Scientific Software: A Systematic Literature Review, Zara Hassan, Christoph Treude, Michael Norrish, Graham Williams, Alex Potanin
Characterising Reproducibility Debt In Scientific Software: A Systematic Literature Review, Zara Hassan, Christoph Treude, Michael Norrish, Graham Williams, Alex Potanin
Research Collection School Of Computing and Information Systems
Context: In scientific software, the inability to reproduce results is often due to technical issues and challenges in recreating the full computational workflow from the original analysis. We conceptualise this problem as Reproducibility Debt (RpD). Much research has been performed to propose solutions to tackle these issues across various computational science disciplines. It is essential to identify and accumulate existing knowledge on reproducibility issues and state-of-the-art solutions so as to provide researchers and practitioners with information that enables further research activities and RpD management in practice. Objective: In the context of scientific software, we aim to characterise RpD by providing …
Enmob: Unveil The Behavior With Multi-Flow Analysis Of Encrypted App Traffic, Mengmeng Ge, Ruitao Feng, Likun Liu, Xiangzhan Yu, Sachidananda Vinay, Xiaofei Xie, Yang Liu
Enmob: Unveil The Behavior With Multi-Flow Analysis Of Encrypted App Traffic, Mengmeng Ge, Ruitao Feng, Likun Liu, Xiangzhan Yu, Sachidananda Vinay, Xiaofei Xie, Yang Liu
Research Collection School Of Computing and Information Systems
In the contemporary digital landscape, mobile applications have become the predominant conduit for internet connectivity and daily tasks. Simultaneously, the advent of application encryption technology has safeguarded users’ privacy. However, this encryption, while fortifying privacy, introduces challenges to security by hindering the effective management of network applications within encrypted data streams. Conventional detection methods for encrypted application traffic, relying heavily on statistical metrics like payload, packet size, and distribution, are constrained to single traffic flows, often yielding results of limited specificity. To address this limitation, our paper introduces an innovative approach that elucidates the multi-flow nature of application behavior traffic …
Verification Of Bit-Flip Attacks Against Quantized Neural Networks, Yedi Zhang, Lei Huang, Pengfei Gao, Fu Song, Jun Sun, Jin Song Dong
Verification Of Bit-Flip Attacks Against Quantized Neural Networks, Yedi Zhang, Lei Huang, Pengfei Gao, Fu Song, Jun Sun, Jin Song Dong
Research Collection School Of Computing and Information Systems
In the rapidly evolving landscape of neural network security, the resilience of neural networks against bit-flip attacks (i.e., an attacker maliciously flips an extremely small amount of bits within its parameter storage memory system to induce harmful behavior), has emerged as a relevant area of research. Existing studies suggest that quantization may serve as a viable defense against such attacks. Recognizing the documented susceptibility of real-valued neural networks to such attacks and the comparative robustness of quantized neural networks (QNNs), in this work, we introduce BFAVerifier, the first verification framework designed to formally verify the absence of bit-flip attacks against …
Digital Transformation And The Future Of Work: Closing The Digital Skills Gap, Siu Loon Hoe
Digital Transformation And The Future Of Work: Closing The Digital Skills Gap, Siu Loon Hoe
Research Collection School Of Computing and Information Systems
The purpose of this article is to discuss the near future digital technology landscape and propose several specific in-demand digital skills for organizations and individuals in the next few years. This article reviews some recent publications from representative inter-governmental, governmental, non-governmental, and commercial organizations on the rise of digital technologies and corresponding growth in digital jobs. Within this context, several specific in-demand skills are proposed by the author who has written a book on the topic of digital transformation. Rapid advancements in digital technologies continue to shape organizational practices and the future of work. To take advantage of emerging digital …
On Unraveling Student Resilience And Academic Performance In Higher Education, Aldy Gunawan, Ee-Peng Lim, Audrey Tedja Widjaja, William Tov, James Foo, Lieven Lode E. Demeester
On Unraveling Student Resilience And Academic Performance In Higher Education, Aldy Gunawan, Ee-Peng Lim, Audrey Tedja Widjaja, William Tov, James Foo, Lieven Lode E. Demeester
Research Collection School Of Computing and Information Systems
The transition period from pre-tertiary to higher education levels is critical. We explore the role of resilience by conducting a survey to investigate students’ resilience and the relationship with overall academic performance, learning experience, and well-being. This effort is part of an initiative to develop strategies for better student engagement in the academic program, enhance their resilience, and prepare them for a competitive job market. We conclude that (i) high-resilience students are associated with better life satisfaction and are likely to perform well academically, (ii) a favorable learning environment supports students to study and perform well in the university, and …
Scuzer: A Scheduling Optimization Fuzzer For Tvm, Xiangxiang Chen, Xingwei Lin, Jingyi Wang, Jun Sun, Jiashui Wang, Wenhai Wang
Scuzer: A Scheduling Optimization Fuzzer For Tvm, Xiangxiang Chen, Xingwei Lin, Jingyi Wang, Jun Sun, Jiashui Wang, Wenhai Wang
Research Collection School Of Computing and Information Systems
The concept of Deep Learning (DL) compiler was proposed to deploy DL models more efficiently on diverse hardware through optimization techniques. As one of the most popular DL compilers, TVM incorporates three levels (high-level, schedule, and low-level) of optimizations, which can inadvertently introduce code logic bugs and build failure bugs. Among these optimizations, scheduling optimization is the core component of DL compilers, which ensures the acceleration of models on all devices. However, the existing works only focus on the testing of high-level and low-level optimizations in TVM, fail to take the most important and challenging intermediate scheduling optimization layer into …