Open Access. Powered by Scholars. Published by Universities.®
- Discipline
-
- Physical Sciences and Mathematics (5591)
- Computer Sciences (5576)
- Databases and Information Systems (2329)
- Software Engineering (1250)
- Artificial Intelligence and Robotics (1149)
-
- Numerical Analysis and Scientific Computing (724)
- Engineering (708)
- Information Security (686)
- Graphics and Human Computer Interfaces (581)
- Business (502)
- Social and Behavioral Sciences (501)
- Computer Engineering (349)
- Theory and Algorithms (341)
- Operations Research, Systems Engineering and Industrial Engineering (335)
- Programming Languages and Compilers (241)
- OS and Networks (219)
- Communication (186)
- Public Affairs, Public Policy and Public Administration (184)
- Transportation (167)
- Medicine and Health Sciences (160)
- Education (150)
- Social Media (148)
- Management Information Systems (140)
- E-Commerce (116)
- Data Storage Systems (109)
- Health Information Technology (98)
- International and Area Studies (87)
- Asian Studies (86)
- Digital Communications and Networking (82)
- Higher Education (78)
- Keyword
-
- Deep learning (90)
- Machine learning (88)
- Artificial intelligence (55)
- Reinforcement learning (53)
- Cloud computing (51)
-
- Privacy (49)
- Data mining (47)
- Online learning (44)
- Security (44)
- Social media (43)
- Empirical study (42)
- Optimization (42)
- Training (42)
- Visualization (41)
- Task analysis (39)
- Access control (38)
- Feature extraction (37)
- Neural networks (37)
- Deep Learning (34)
- Software engineering (34)
- Blockchain (33)
- Machine Learning (31)
- Twitter (31)
- Anomaly detection (30)
- Large Language Models (30)
- Privacy-preserving (30)
- Natural language processing (29)
- Singapore (29)
- Clustering (28)
- Collaboration (28)
- Publication Year
Articles 871 - 900 of 5707
Full-Text Articles in Entire DC Network
On The Feasibility Of Simple Transformer For Dynamic Graph Modeling, Yuxia Wu, Yuan Fang, Lizi Liao
On The Feasibility Of Simple Transformer For Dynamic Graph Modeling, Yuxia Wu, Yuan Fang, Lizi Liao
Research Collection School Of Computing and Information Systems
Dynamic graph modeling is crucial for understanding complex structures in web graphs, spanning applications in social networks, recommender systems, and more. Most existing methods primarily emphasize structural dependencies and their temporal changes. However, these approaches often overlook detailed temporal aspects or struggle with long-term dependencies. Furthermore, many solutions overly complicate the process by emphasizing intricate module designs to capture dynamic evolutions. In this work, we harness the strength of the Transformer’s self-attention mechanism, known for adeptly handling long-range dependencies in sequence modeling. Our approach offers a simple Transformer model, called SimpleDyG, tailored for dynamic graph modeling without complex modifications. We …
Multigprompt For Multi-Task Pre-Training And Prompting On Graphs, Xingtong Yu, Chang Zhou, Yuan Fang, Xinming Zhan
Multigprompt For Multi-Task Pre-Training And Prompting On Graphs, Xingtong Yu, Chang Zhou, Yuan Fang, Xinming Zhan
Research Collection School Of Computing and Information Systems
Graph Neural Networks (GNNs) have emerged as a mainstream technique for graph representation learning. However, their efficacy within an end-to-end supervised framework is significantly tied to the availability of task-specific labels. To mitigate labeling costs and enhance robustness in few-shot settings, pre-training on self-supervised tasks has emerged as a promising method, while prompting has been proposed to further narrow the objective gap between pretext and downstream tasks. Although there has been some initial exploration of prompt-based learning on graphs, they primarily leverage a single pretext task, resulting in a limited subset of general knowledge that could be learned from the …
Vibmilk: Non-Intrusive Milk Spoilage Detection Via Smartphone Vibration, Yuezhong Wu, Wei Song, Yanxiang Wang, Dong Ma, Weitao Xu, Mahbub Hassan, Wen Hu
Vibmilk: Non-Intrusive Milk Spoilage Detection Via Smartphone Vibration, Yuezhong Wu, Wei Song, Yanxiang Wang, Dong Ma, Weitao Xu, Mahbub Hassan, Wen Hu
Research Collection School Of Computing and Information Systems
Quantifying the chemical process of milk spoilage is challenging due to the need for bulky, expensive equipment that is not user-friendly for milk producers or customers. This lack of a convenient and accurate milk spoilage detection system can cause two significant issues. First, people who consume spoiled milk may experience serious health problems. Secondly, milk manufacturers typically provide a “best before” date to indicate freshness, but this date only shows the highest quality of the milk, not the last day it can be safely consumed, leading to significant milk waste. A practical and efficient solution to this problem is proposed …
Large Language Models For Qualitative Research In Software Engineering: Exploring Opportunities And Challenges, Muneera Bano, Rashina Hoda, Didar Zowghi, Christoph Treude
Large Language Models For Qualitative Research In Software Engineering: Exploring Opportunities And Challenges, Muneera Bano, Rashina Hoda, Didar Zowghi, Christoph Treude
Research Collection School Of Computing and Information Systems
The recent surge in the integration of Large Language Models (LLMs) like ChatGPT into qualitative research in software engineering, much like in other professional domains, demands a closer inspection. This vision paper seeks to explore the opportunities of using LLMs in qualitative research to address many of its legacy challenges as well as potential new concerns and pitfalls arising from the use of LLMs. We share our vision for the evolving role of the qualitative researcher in the age of LLMs and contemplate how they may utilize LLMs at various stages of their research experience.
Reinforcement Nash Equilibrium Solver, Xinrun Wang, Chang Yang, Shuxin Li, Pengdeng Li, Xiao Huang, Hau Chan, Bo An
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. Computing NE in two- or multi-player general-sum games is PPAD-Complete. Therefore, in this work, we propose REinforcement Nash Equilibrium Solver (RENES), which trains a single policy to modify the games with different sizes and applies the solvers on the modified games where the obtained solution is evaluated on the original games. Specifically, our contributions are threefold. i) We represent the games as ��-rank response graphs and leverage graph neural network (GNN) to handle the games with different sizes as inputs; …
Social Balance On Networks: Local Minima And Best-Edge Dynamics, Krishnendu Chatterjee, Jakub Svoboda, Dorde Zikelic, Andreas Pavlogiannis, Josef Tkadlec
Social Balance On Networks: Local Minima And Best-Edge Dynamics, Krishnendu Chatterjee, Jakub Svoboda, Dorde Zikelic, Andreas Pavlogiannis, Josef Tkadlec
Research Collection School Of Computing and Information Systems
Structural balance theory is an established framework for studying social relationships of friendship and enmity. These relationships are modeled by a signed network whose energy potential measures the level of imbalance, while stochastic dynamics drives the network toward a state of minimum energy that captures social balance. It is known that this energy landscape has local minima that can trap socially aware dynamics, preventing it from reaching balance. Here we first study the robustness and attractor properties of these local minima. We show that a stochastic process can reach them from an abundance of initial states and that some local …
Large Language Model Powered Agents In The Web, Yang Deng, An Zhang, Yankai Lin, Xu Chen, Ji-Rong Wen, Tat-Seng Chua
Large Language Model Powered Agents In The Web, Yang Deng, An Zhang, Yankai Lin, Xu Chen, Ji-Rong Wen, Tat-Seng Chua
Research Collection School Of Computing and Information Systems
Web applications serve as vital interfaces for users to access information, perform various tasks, and engage with content. Traditional web designs have predominantly focused on user interfaces and static experiences. With the advent of large language models (LLMs), there’s a paradigm shift as we integrate LLM-powered agents into these platforms. These agents bring forth crucial human capabilities like memory and planning to make them behave like humans in completing various tasks, effectively enhancing user engagement and offering tailored interactions in web applications. In this tutorial, we delve into the cutting-edge techniques of LLM-powered agents across various web applications, such as …
Dlvs4audio2sheet: Deep Learning-Based Vocal Separation For Audio Into Music Sheet Conversion, Nicole Teo, Zhaoxia Wang, Ezekiel Ghe, Yee Sen Tan, Kevan Oktavio, Alexander Vincent Lewi, Allyne Zhang, Seng-Beng Ho
Dlvs4audio2sheet: Deep Learning-Based Vocal Separation For Audio Into Music Sheet Conversion, Nicole Teo, Zhaoxia Wang, Ezekiel Ghe, Yee Sen Tan, Kevan Oktavio, Alexander Vincent Lewi, Allyne Zhang, Seng-Beng Ho
Research Collection School Of Computing and Information Systems
While manual transcription tools exist, music enthusiasts, including amateur singers, still encounter challenges when transcribing performances into sheet music. This paper addresses the complex task of translating music audio into music sheets, particularly challenging in the intricate field of choral arrangements where multiple voices intertwine. We propose DLVS4Audio2Sheet, a novel method leveraging advanced deep learning models, Open-Unmix and Band-Split Recurrent Neural Networks (BSRNN), for vocal separation. DLVS4Audio2Sheet segments choral audio into individual vocal sections and selects the optimal model for further processing, aiming towards audio into music sheet conversion. We evaluate DLVS4Audio2Sheet’s performance using these deep learning algorithms and assess …
Flipped Classroom For Linear Algebra At Undergraduate Level, M. Thulasidas
Flipped Classroom For Linear Algebra At Undergraduate Level, M. Thulasidas
Research Collection School Of Computing and Information Systems
In this article, we describe our experience in developing an undergraduate Linear Algebra course tailored to highlight its relevance and applicability in Computer Science. Over the course of three years, the course transitioned from a traditional direct-instruction format to a flipped-classroom design, resulting in positive student learning outcomes. This article covers the course design philosophy, its syllabus, learning objectives, and the incorporation of both quantitative and qualitative student feedback in shaping the course. Furthermore, the article shares the insights gleaned from our experience, which can serve as best practices for instructors aiming to deliver a successful Linear Algebra course for …
The Grader: A Grading Assistant For Lab Tests And A Teaching Tool, M. Thulasidas, David Lo
The Grader: A Grading Assistant For Lab Tests And A Teaching Tool, M. Thulasidas, David Lo
Research Collection School Of Computing and Information Systems
This article presents the design and implementation of the Grader, a grading assistant application deployed for a Web Application Development course at our school. The Grader is equipped to handle various logistical aspects of lab tests, including file management, consistent application of rubrics, and auto-grading of questions with test cases. Additionally, it incorporates heuristic rules to detect cheating attempts. We anticipate that the Grader will find widespread utility in programming courses where lab tests serve as summative assessments. Developed within the same programming environment taught in the class, the Grader also serves as a pedagogical tool, demonstrating to students a …
Exploring Diffusion Time-Steps For Unsupervised Representation Learning, Zhongqi Yue, Jiankun Wang, Qianru Sun, Lei Ji, Eric I-Chao Chang, Hanwang Zhang
Exploring Diffusion Time-Steps For Unsupervised Representation Learning, Zhongqi Yue, Jiankun Wang, Qianru Sun, Lei Ji, Eric I-Chao Chang, Hanwang Zhang
Research Collection School Of Computing and Information Systems
Representation learning is all about discovering the hidden modular attributes that generate the data faithfully. We explore the potential of Denoising Diffusion Probabilistic Model (DM) in unsupervised learning of the modular attributes. We build a theoretical framework that connects the diffusion time-steps and the hidden attributes, which serves as an effective inductive bias for unsupervised learning. Specifically, the forward diffusion process incrementally adds Gaussian noise to samples at each time-step, which essentially collapses different samples into similar ones by losing attributes, e.g., fine-grained attributes such as texture are lost with less noise added (i.e., early time-steps), while coarse-grained ones such …
Regret-Based Defense In Adversarial Reinforcement Learning, Roman Belaire, Pradeep Varakantham, Thanh Hong Nguyen, David Lo
Regret-Based Defense In Adversarial Reinforcement Learning, Roman Belaire, Pradeep Varakantham, Thanh Hong Nguyen, David Lo
Research Collection School Of Computing and Information Systems
Deep Reinforcement Learning (DRL) policies are vulnerable to adversarial noise in observations, which can have disastrous consequences in safety-critical environments. For instance, a self-driving car receiving adversarially perturbed sensory observations about traffic signs (e.g., a stop sign physically altered to be perceived as a speed limit sign) can be fatal. Leading existing approaches for making RL algorithms robust to an observation-perturbing adversary have focused on (a) regularization approaches that make expected value objectives robust by adding adversarial loss terms; or (b) employing "maximin'' (i.e., maximizing the minimum value) notions of robustness. While regularization approaches are adept at reducing the probability …
Automatic Grading Of Short Answers Using Large Language Models In Software Engineering Courses, Nguyen Binh Duong Ta, Yi Meng Chai
Automatic Grading Of Short Answers Using Large Language Models In Software Engineering Courses, Nguyen Binh Duong Ta, Yi Meng Chai
Research Collection School Of Computing and Information Systems
Short-answer based questions have been used widely due to their effectiveness in assessing whether the desired learning outcomes have been attained by students. However, due to their open-ended nature, many different answers could be considered entirely or partially correct for the same question. In the context of computer science and software engineering courses where the enrolment has been increasing recently, manual grading of short-answer questions is a time-consuming and tedious process for instructors. In software engineering courses, assessments concern not just coding but many other aspects of software development such as system analysis, architecture design, software processes and operation methodologies …
Lecture-Style Tutorial: Towards Graph Foundation Models, Chuan Shi, Cheng Yang, Yuan Fang, Lichao Sun, Philip Yu
Lecture-Style Tutorial: Towards Graph Foundation Models, Chuan Shi, Cheng Yang, Yuan Fang, Lichao Sun, Philip Yu
Research Collection School Of Computing and Information Systems
Emerging as fundamental building blocks for diverse artificial intelligence applications, foundation models have achieved notable success across natural language processing and many other domains. Concurrently, graph machine learning has gradually evolved from shallow methods to deep models to leverage the abundant graph-structured data that constitute an important pillar in the data ecosystem for artificial intelligence. Naturally, the emergence and homogenization capabilities of foundation models have piqued the interest of graph machine learning researchers. This has sparked discussions about developing a next-generation graph learning paradigm, one that is pre-trained on broad graph data and can be adapted to a wide range …
Towards Low-Resource Rumor Detection: Unified Contrastive Transfer With Propagation Structure, Hongzhan Lin, Jing Ma, Ruichao Yang, Zhiwei Yang, Mingfei Cheng
Towards Low-Resource Rumor Detection: Unified Contrastive Transfer With Propagation Structure, Hongzhan Lin, Jing Ma, Ruichao Yang, Zhiwei Yang, Mingfei Cheng
Research Collection School Of Computing and Information Systems
The truth is significantly hampered by massive rumors that spread along with breaking news or popular topics. Since there is sufficient corpus gathered from the same domain for model training, existing rumor detection algorithms show promising performance on yesterday's news. However, due to a lack of substantial training data and prior expert knowledge, they are poor at spotting rumors concerning unforeseen events, especially those propagated in different languages (i.e., low-resource regimes). In this paper, we propose a simple yet effective framework with unified contrastive transfer learning, to detect rumors by adapting the features learned from well-resourced rumor data to that …
Environmental, Social, And Governance (Esg) And Artificial Intelligence In Finance: State-Of-The-Art And Research Takeaways, Tristan Lim
Research Collection School Of Computing and Information Systems
The rapidly growing research landscape in finance, encompassing environmental, social, and governance (ESG) topics and associated Artificial Intelligence (AI) applications, presents challenges for both new researchers and seasoned practitioners. This study aims to systematically map the research area, identify knowledge gaps, and examine potential research areas for researchers and practitioners. The investigation focuses on three primary research questions: the main research themes concerning ESG and AI in finance, the evolution of research intensity and interest in these areas, and the application and evolution of AI techniques specifically in research studies within the ESG and AI in finance domain. Eight archetypical …
Flgan: Gan-Based Unbiased Federated Learning Under Non-Iid Settings, Zhuoran Ma, Yang Liu, Yinbin Miao, Guowen Xu, Ximeng Liu, Jianfeng Ma, Robert H. Deng
Flgan: Gan-Based Unbiased Federated Learning Under Non-Iid Settings, Zhuoran Ma, Yang Liu, Yinbin Miao, Guowen Xu, Ximeng Liu, Jianfeng Ma, Robert H. Deng
Research Collection School Of Computing and Information Systems
Federated Learning (FL) suffers from low convergence and significant accuracy loss due to local biases caused by non-Independent and Identically Distributed (non-IID) data. To enhance the non-IID FL performance, a straightforward idea is to leverage the Generative Adversarial Network (GAN) to mitigate local biases using synthesized samples. Unfortunately, existing GAN-based solutions have inherent limitations, which do not support non-IID data and even compromise user privacy. To tackle the above issues, we propose a GAN-based unbiased FL scheme, called FlGan, to mitigate local biases using synthesized samples generated by GAN while preserving user-level privacy in the FL setting. Specifically, FlGan first …
Concretely Mapped Symbolic Memory Locations For Memory Error Detection, Haoxin Tu, Lingxiao Jiang, Jiaqi Hong, Xuhua Ding, He Jiang
Concretely Mapped Symbolic Memory Locations For Memory Error Detection, Haoxin Tu, Lingxiao Jiang, Jiaqi Hong, Xuhua Ding, He Jiang
Research Collection School Of Computing and Information Systems
Memory allocation is a fundamental operation for managing memory objects in many programming languages. Misusing allocated memory objects (e.g., buffer overflow and use-after-free) can lead to catastrophic consequences. Symbolic execution-based approaches are often used to detect such memory errors, leveraging their capabilities in automatic path exploration and test case generation. However, existing symbolic execution engines face significant limitations in modeling dynamic memory layouts. These engines either represent memory object locations as concrete addresses, limiting analyses to specific address layouts and missing errors that occur at special addresses, or represent locations as simple symbolic variables without sufficient constraints, resulting in memory …
Bidirectional Paper-Repository Tracing In Software Engineering, Daniel Garijo, Miguel Arroyo, Esteban González Guardia, Christoph Treude, Nicola Tarocco
Bidirectional Paper-Repository Tracing In Software Engineering, Daniel Garijo, Miguel Arroyo, Esteban González Guardia, Christoph Treude, Nicola Tarocco
Research Collection School Of Computing and Information Systems
While computer science papers frequently include their associated code repositories, establishing a clear link between papers and their corresponding implementations may be challenging due to the number of code repositories used in research publications. In this paper we describe a lightweight method for effectively identifying bidirectional links between papers and repositories from both LaTeX and PDF sources. We have used our approach to analyze more than 14000 PDF and Latex files in the Software Engineering category of Arxiv, generating a dataset of more than 1400 paper-code implementations and assessing current citation practices on it.
Encoding Version History Context For Better Code Representation, Huy Nguyen, Christoph Treude, Patanamon Thongtanunam
Encoding Version History Context For Better Code Representation, Huy Nguyen, Christoph Treude, Patanamon Thongtanunam
Research Collection School Of Computing and Information Systems
With the exponential growth of AI tools that generate source code, understanding software has become crucial. When developers comprehend a program, they may refer to additional contexts to look for information, e.g. program documentation or historical code versions. Therefore, we argue that encoding this additional contextual information could also benefit code representation for deep learning. Recent papers incorporate contextual data (e.g. call hierarchy) into vector representation to address program comprehension problems. This motivates further studies to explore additional contexts, such as version history, to enhance models' understanding of programs. That is, insights from version history enable recognition of patterns in …
Classifying Source Code: How Far Can Compressor-Based Classifiers Go?, Zhou Yang
Classifying Source Code: How Far Can Compressor-Based Classifiers Go?, Zhou Yang
Research Collection School Of Computing and Information Systems
Pre-trained language models of code, which are built upon large-scale datasets, millions of trainable parameters, and high computational resources cost, have achieved phenomenal success. Recently, researchers have proposed a compressor-based classifier (Cbc); it trains no parameters but is found to outperform BERT. We conduct the first empirical study to explore whether this lightweight alternative can accurately classify source code. Our study is more than applying Cbc to code-related tasks. We first identify an issue that the original implementation overestimates Cbc. After correction, Cbc's performance on defect prediction drops from 80.7% to 63.0%, which is still comparable to CodeBERT (63.7%). We …
The Impact Of Bug Localization Based On Crash Report Mining: A Developers' Perspective, Marcos Medeiros, Uirá Kulesza, Roberta Coelho, Rodrigo Bonifacio, Christoph Treude, Eiji Adachi Barbosa
The Impact Of Bug Localization Based On Crash Report Mining: A Developers' Perspective, Marcos Medeiros, Uirá Kulesza, Roberta Coelho, Rodrigo Bonifacio, Christoph Treude, Eiji Adachi Barbosa
Research Collection School Of Computing and Information Systems
Developers often use crash reports to understand the root cause of bugs. However, locating the buggy source code snippet from such information is a challenging task, mainly when the log database contains many crash reports. To mitigate this issue, recent research has proposed and evaluated approaches for grouping crash report data and using stack trace information to locate bugs. The effectiveness of such approaches has been evaluated by mainly comparing the candidate buggy code snippets with the actual changed code in bug-fix commits—which happens in the context of retrospective repository mining studies. Therefore, the existing literature still lacks discussing the …
Test Optimization In Dnn Testing: A Survey, Qiang Hu, Yuejun Guo, Xiaofei Xie, Maxime Cordy, Lei Ma, Mike Papadakis, Yves Le Traon
Test Optimization In Dnn Testing: A Survey, Qiang Hu, Yuejun Guo, Xiaofei Xie, Maxime Cordy, Lei Ma, Mike Papadakis, Yves Le Traon
Research Collection School Of Computing and Information Systems
This article presents a comprehensive survey on test optimization in deep neural network (DNN) testing. Here, test optimization refers to testing with low data labeling effort. We analyzed 90 papers, including 43 from the software engineering (SE) community, 32 from the machine learning (ML) community, and 15 from other communities. Our study: (i) unifies the problems as well as terminologies associated with low-labeling cost testing, (ii) compares the distinct focal points of SE and ML communities, and (iii) reveals the pitfalls in existing literature. Furthermore, we highlight the research opportunities in this domain.
Assessing Ai Detectors In Identifying Ai-Generated Code: Implications For Education, Wei Hung Pan, Ming Jie Chok, Jonathan Leong Shan Wong, Yung Xin Shin, Yeong Shian Poon, Zhou Yang, Chun Yong Chong, David Lo, Mei Kuan Lim
Assessing Ai Detectors In Identifying Ai-Generated Code: Implications For Education, Wei Hung Pan, Ming Jie Chok, Jonathan Leong Shan Wong, Yung Xin Shin, Yeong Shian Poon, Zhou Yang, Chun Yong Chong, David Lo, Mei Kuan Lim
Research Collection School Of Computing and Information Systems
Educators are increasingly concerned about the usage of Large Language Models (LLMs) such as ChatGPT in programming education, particularly regarding the potential exploitation of imperfections in Artificial Intelligence Generated Content (AIGC) Detectors for academic misconduct.In this paper, we present an empirical study where the LLM is examined for its attempts to bypass detection by AIGC Detectors. This is achieved by generating code in response to a given question using different variants. We collected a dataset comprising 5,069 samples, with each sample consisting of a textual description of a coding problem and its corresponding human-written Python solution codes. These samples were …
The Important Role Of System Dynamics Investigation On Business Model, Industry And Performance Management, Lina Gozali, Teuku Yuri M. Zagloel, Togar Mangihut Simatupang, Wahyudi Sutopo, Aldy Gunawan, Yun-Chia Liang, Bernardo Nugroho Yahya, Jose Arturo Garza-Reyes, Agustinus Purna Irawan, Yuliani Suseno
The Important Role Of System Dynamics Investigation On Business Model, Industry And Performance Management, Lina Gozali, Teuku Yuri M. Zagloel, Togar Mangihut Simatupang, Wahyudi Sutopo, Aldy Gunawan, Yun-Chia Liang, Bernardo Nugroho Yahya, Jose Arturo Garza-Reyes, Agustinus Purna Irawan, Yuliani Suseno
Research Collection School Of Computing and Information Systems
Purpose: This research studies the development of the evolving dynamic system model and explores the important elements or factors and what detailed attributes are the main influences model in achieving the success of a business, industry and management. It also identifies the real and major differences between static and dynamic business management models and the detailed factors that influence them. Later, this research investigates the benefits/advantages and limitations/disadvantages of some research studies. The studies conducted in this research put more emphasis on the capabilities of system dynamics (SD) in modeling and the ability to measure, analyse and capture problems in …
Development Of An Explainable Artificial Intelligence Model For Asian Vascular Wound Images, Zhiwen Joseph Lo, Malcolm Han Wen Mak, Shanying Liang, Yam Meng Chan, Cheng Cheng Goh, Tina Peiting Lai, Audrey Hui Min Tan, Patrick Thng, Patrick Thng, Tillman Weyde, Sylvia Smit
Development Of An Explainable Artificial Intelligence Model For Asian Vascular Wound Images, Zhiwen Joseph Lo, Malcolm Han Wen Mak, Shanying Liang, Yam Meng Chan, Cheng Cheng Goh, Tina Peiting Lai, Audrey Hui Min Tan, Patrick Thng, Patrick Thng, Tillman Weyde, Sylvia Smit
Research Collection School Of Computing and Information Systems
Chronic wounds contribute to significant healthcare and economic burden worldwide. Wound assessment remains challenging given its complex and dynamic nature. The use of artificial intelligence (AI) and machine learning methods in wound analysis is promising. Explainable modelling can help its integration and acceptance in healthcare systems. We aim to develop an explainable AI model for analysing vascular wound images among an Asian population. Two thousand nine hundred and fifty-seven wound images from a vascular wound image registry from a tertiary institution in Singapore were utilized. The dataset was split into training, validation and test sets. Wound images were classified into …
Adaptive Content-Aware Influence Maximization Via Online Learning To Rank, Konstantinos Theocharidis, Panagiotis Karras, Manolis Terrovitis, Spiros Skiadopoulos, Hady Wirawan Lauw
Adaptive Content-Aware Influence Maximization Via Online Learning To Rank, Konstantinos Theocharidis, Panagiotis Karras, Manolis Terrovitis, Spiros Skiadopoulos, Hady Wirawan Lauw
Research Collection School Of Computing and Information Systems
How can we adapt the composition of a post over a series of rounds to make it more appealing in a social network? Techniques that progressively learn how to make a fixed post more influential over rounds have been studied in the context of the Influence Maximization (IM) problem, which seeks a set of seed users that maximize a post’s influence. However, there is no work on progressively learning how a post’s features affect its influence. In this article, we propose and study the problem of Adaptive Content-Aware Influence Maximization (ACAIM), which calls to find k features to form a …
Stealthy Backdoor Attack For Code Models, Zhou Yang, Bowen Xu, Jie M. Zhang, Hong Jin Kang, Jieke Shi, Junda He, David Lo
Stealthy Backdoor Attack For Code Models, Zhou Yang, Bowen Xu, Jie M. Zhang, Hong Jin Kang, Jieke Shi, Junda He, David Lo
Research Collection School Of Computing and Information Systems
Code models, such as CodeBERT and CodeT5, offer general-purpose representations of code and play a vital role in supporting downstream automated software engineering tasks. Most recently, code models were revealed to be vulnerable to backdoor attacks. A code model that is backdoor-attacked can behave normally on clean examples but will produce pre-defined malicious outputs on examples injected with that activate the backdoors. Existing backdoor attacks on code models use unstealthy and easy-to-detect triggers. This paper aims to investigate the vulnerability of code models with backdoor attacks. To this end, we propose A (dversarial eature as daptive Back). A achieves stealthiness …
Teaching Software Development For Real-World Problems Using A Microservice-Based Collaborative Problem-Solving Approach, Yi Meng Lau, Christian Michael Koh, Lingxiao Jiang
Teaching Software Development For Real-World Problems Using A Microservice-Based Collaborative Problem-Solving Approach, Yi Meng Lau, Christian Michael Koh, Lingxiao Jiang
Research Collection School Of Computing and Information Systems
Experienced and skillful software developers are needed in organizations to develop software products effective for their business with shortened time-to-market. Such developers will not only need to code but also be able to work in teams and collaboratively solve real-world problems that organizations arefacing. It is challenging for educators to nurture students to become such developers with strong technical, social, and cognitive skills. Towards addressing the challenge, this study presents a Collaborative Software Development Project Framework for a course that focuses on learning microservices architectures anddeveloping a software application for a real-world business. Students get to work in teams to …
Deep Reinforcement Learning For Dynamic Algorithm Selection: A Proof-Of-Principle Study On Differential Evolution, Hongshu Guo, Yining Ma, Zeyuan Ma, Jiacheng Chen, Xinglin Zhang, Zhiguang Cao, Jun Zhang, Yue-Jiao Gong
Deep Reinforcement Learning For Dynamic Algorithm Selection: A Proof-Of-Principle Study On Differential Evolution, Hongshu Guo, Yining Ma, Zeyuan Ma, Jiacheng Chen, Xinglin Zhang, Zhiguang Cao, Jun Zhang, Yue-Jiao Gong
Research Collection School Of Computing and Information Systems
Evolutionary algorithms, such as differential evolution, excel in solving real-parameter optimization challenges. However, the effectiveness of a single algorithm varies across different problem instances, necessitating considerable efforts in algorithm selection or configuration. This article aims to address the limitation by leveraging the complementary strengths of a group of algorithms and dynamically scheduling them throughout the optimization progress for specific problems. We propose a deep reinforcement learning-based dynamic algorithm selection framework to accomplish this task. Our approach models the dynamic algorithm selection a Markov decision process, training an agent in a policy gradient manner to select the most suitable algorithm according …