Open Access. Powered by Scholars. Published by Universities.®

Physical Sciences and Mathematics Commons™

Open Access. Powered by Scholars. Published by Universities.®

Discipline
Institution
Keyword
Publication Year
Publication
Publication Type
File Type

Articles 38581 - 38610 of 291706

Full-Text Articles in Physical Sciences and Mathematics

Transfer-Once-For-All: Ai Model Optimization For Edge, Achintya Kundu, Laura Wynter, Rhui Dih Lee, Luis Angel Bathen Jul 2023

Transfer-Once-For-All: Ai Model Optimization For Edge, Achintya Kundu, Laura Wynter, Rhui Dih Lee, Luis Angel Bathen

Research Collection School Of Computing and Information Systems

Weight-sharing neural architecture search aims to optimize a configurable neural network model (supernet) for a variety of deployment scenarios across many devices with different resource constraints. Existing approaches use evolutionary search to extract models of different sizes from a supernet trained on a very large data set, and then fine-tune the extracted models on the typically small, real-world data set of interest. The computational cost of training thus grows linearly with the number of different model deployment scenarios. Hence, we propose Transfer-Once-For-All (TOFA) for supernet-style training on small data sets with constant computational training cost over any number of edge …

Go to article

Estimation Of Recursive Route Choice Models With Incomplete Trip Observations, Tien Mai, The Viet Bui, Quoc Phong Nguyen, Tho V. Le Jul 2023

Estimation Of Recursive Route Choice Models With Incomplete Trip Observations, Tien Mai, The Viet Bui, Quoc Phong Nguyen, Tho V. Le

Research Collection School Of Computing and Information Systems

This work concerns the estimation of recursive route choice models in the situation that the trip observations are incomplete, i.e., there are unconnected links (or nodes) in the observations. A direct approach to handle this issue could be intractable because enumerating all paths between unconnected links (or nodes) in a real network is typically not possible. We exploit an expectation–maximization (EM) method that allows dealing with the missing-data issue by alternatively performing two steps of sampling the missing segments in the observations and solving maximum likelihood estimation problems. Moreover, observing that the EM method could be expensive, we propose a …

Go to article

Impact Of Difficult Negatives On Twitter Crisis Detection, Yuhao Zhang, Siaw Ling Lo, Phyo Yi Win Myint Jul 2023

Impact Of Difficult Negatives On Twitter Crisis Detection, Yuhao Zhang, Siaw Ling Lo, Phyo Yi Win Myint

Research Collection School Of Computing and Information Systems

Twitter has become an alternative information source during a crisis. However, the short, noisy nature of tweets hinders information extraction. While models trained with standard Twitter crisis datasets accomplished decent performance, it remained a challenge to generalize to unseen crisis events. Thus, we proposed adding “difficult” negative examples during training to improve model generalization for Twitter crisis detection. Although adding random noise is a common practice, the impact of difficult negatives, i.e., negative data semantically similar to true examples, was never examined in NLP. Most of existing research focuses on the classification task, without considering the primary information need of …

Go to article

Imitation Improvement Learning For Large-Scale Capacitated Vehicle Routing Problems, The Viet Bui, Tien Mai Jul 2023

Imitation Improvement Learning For Large-Scale Capacitated Vehicle Routing Problems, The Viet Bui, Tien Mai

Research Collection School Of Computing and Information Systems

Recent works using deep reinforcement learning (RL) to solve routing problems such as the capacitated vehicle routing problem (CVRP) have focused on improvement learning-based methods, which involve improving a given solution until it becomes near-optimal. Although adequate solutions can be achieved for small problem instances, their efficiency degrades for large-scale ones. In this work, we propose a newimprovement learning-based framework based on imitation learning where classical heuristics serve as experts to encourage the policy model to mimic and produce similar or better solutions. Moreover, to improve scalability, we propose Clockwise Clustering, a novel augmented framework for decomposing large-scale CVRP into …

Go to article

Plan-And-Solve Prompting: Improving Zero-Shot Chain-Of-Thought Reasoning By Large Language Models, Lei Wang, Wanyu Xu, Yihuai Lan, Zhiqiang Hu, Yunshi Lan, Roy Ka-Wei Lee, Ee-Peng Lim Jul 2023

Plan-And-Solve Prompting: Improving Zero-Shot Chain-Of-Thought Reasoning By Large Language Models, Lei Wang, Wanyu Xu, Yihuai Lan, Zhiqiang Hu, Yunshi Lan, Roy Ka-Wei Lee, Ee-Peng Lim

Research Collection School Of Computing and Information Systems

Large language models (LLMs) have recently been shown to deliver impressive performance in various NLP tasks. To tackle multi-step reasoning tasks, few-shot chain-of-thought (CoT) prompting includes a few manually crafted step-by-step reasoning demonstrations which enable LLMs to explicitly generate reasoning steps and improve their reasoning task accuracy. To eliminate the manual effort, Zeroshot-CoT concatenates the target problem statement with “Let’s think step by step” as an input prompt to LLMs. Despite the success of Zero-shot-CoT, it still suffers from three pitfalls: calculation errors, missing-step errors, and semantic misunderstanding errors. To address the missing-step errors, we propose Planand-Solve (PS) Prompting. It …

Go to article

Machine-Learning Approach To Automated Doubt Identification On Stack Overflow Comments To Guide Programming Learners, Tianhao Chen, Eng Lieh Ouh, Kar Way Tan, Siaw Ling Lo Jul 2023

Machine-Learning Approach To Automated Doubt Identification On Stack Overflow Comments To Guide Programming Learners, Tianhao Chen, Eng Lieh Ouh, Kar Way Tan, Siaw Ling Lo

Research Collection School Of Computing and Information Systems

Stack Overflow is a popular Q&A platform for developers to find solutions to programming problems. However, due to the varying quality of user-generated answers, there is a need for ways to help users find high-quality answers. While Stack Overflow's community-based approach can be effective, important technical aspects of the answer need to be captured, and users’ comments might contain doubts regarding these aspects. In this paper, we showed the feasibility of using a machine learning model to identify doubts and conducted data analysis. We found that highly reputed users tend to raise more doubts; most answers have doubt in the …

Go to article

Chatgpt, Can You Generate Solutions For My Coding Exercises? An Evaluation On Its Effectiveness In An Undergraduate Java Programming Course, Eng Lieh Ouh, Benjamin Gan, Kyong Jin Shim, Swavek Wlodkowski Jul 2023

Chatgpt, Can You Generate Solutions For My Coding Exercises? An Evaluation On Its Effectiveness In An Undergraduate Java Programming Course, Eng Lieh Ouh, Benjamin Gan, Kyong Jin Shim, Swavek Wlodkowski

Research Collection School Of Computing and Information Systems

In this study, we assess the efficacy of employing the ChatGPT language model to generate solutions for coding exercises within an undergraduate Java programming course. ChatGPT, a large-scale, deep learning-driven natural language processing model, is capable of producing programming code based on textual input. Our evaluation involves analyzing ChatGPT-generated solutions for 80 diverse programming exercises and comparing them to the correct solutions. Our findings indicate that ChatGPT accurately generates Java programming solutions, which are characterized by high readability and well-structured organization. Additionally, the model can produce alternative, memory-efficient solutions. However, as a natural language processing model, ChatGPT struggles with coding …

Go to article

Nodemedic: End-To-End Analysis Of Node.Js Vulnerabilities With Provenance Graphs, Darion Cassel, Wai Tuck Wong, Limin Jia Jul 2023

Nodemedic: End-To-End Analysis Of Node.Js Vulnerabilities With Provenance Graphs, Darion Cassel, Wai Tuck Wong, Limin Jia

Research Collection School Of Computing and Information Systems

Packages in the Node.js ecosystem often suffer from serious vulnerabilities such as arbitrary command injection and code execution. Existing taint analysis tools fall short in providing an end-to-end infrastructure for automatically detecting and triaging these vulnerabilities.We develop NodeMedic, an end-to-end analysis infrastructure that automates test driver creation, performs precise yet scalable dynamic taint propagation via algorithmically tuned propagation policies, and exposes taint provenance information as a provenance graph. Using provenance graphs we develop two post-detection analyses: automated constraint-based exploit synthesis to confirm vulnerabilities; Attack-defense-tree-based rating of flow exploitability.We demonstrate the effectiveness of NodeMedic through a large-scale evaluation of 10,000 Node.js …

Go to article

Semantic-Based Neural Network Repair, Richard Schumi, Jun Sun Jul 2023

Semantic-Based Neural Network Repair, Richard Schumi, Jun Sun

Research Collection School Of Computing and Information Systems

Recently, neural networks have spread into numerous fields including many safety-critical systems. Neural networks are built (and trained) by programming in frameworks such as TensorFlow and PyTorch. Developers apply a rich set of pre-defined layers to manually program neural networks or to automatically generate them (e.g., through AutoML). Composing neural networks with different layers is error-prone due to the non-trivial constraints that must be satisfied in order to use those layers. In this work, we propose an approach to automatically repair erroneous neural networks. The challenge is in identifying a minimal modification to the network so that it becomes valid. …

Go to article

Qebverif: Quantization Error Bound Verification Of Neural Networks, Yedi Zhang, Fu Song, Jun Sun Jul 2023

Qebverif: Quantization Error Bound Verification Of Neural Networks, Yedi Zhang, Fu Song, Jun Sun

Research Collection School Of Computing and Information Systems

To alleviate the practical constraints for deploying deep neural networks (DNNs) on edge devices, quantization is widely regarded as one promising technique. It reduces the resource requirements for computational power and storage space by quantizing the weights and/or activation tensors of a DNN into lower bit-width fixed-point numbers, resulting in quantized neural networks (QNNs). While it has been empirically shown to introduce minor accuracy loss, critical verified properties of a DNN might become invalid once quantized. Existing verification methods focus on either individual neural networks (DNNs or QNNs) or quantization error bound for partial quantization. In this work, we propose …

Go to article

Seed Selection For Testing Deep Neural Networks, Yuhan Zhi, Xiaofei Xie, Chao Shen, Jun Sun, Xiaoyu Zhang, Xiaohong Guan Jul 2023

Seed Selection For Testing Deep Neural Networks, Yuhan Zhi, Xiaofei Xie, Chao Shen, Jun Sun, Xiaoyu Zhang, Xiaohong Guan

Research Collection School Of Computing and Information Systems

Deep learning (DL) has been applied in many applications. Meanwhile, the quality of DL systems is becoming a big concern. To evaluate the quality of DL systems, a number of DL testing techniques have been proposed. To generate test cases, a set of initial seed inputs are required. Existing testing techniques usually construct seed corpus by randomly selecting inputs from training or test dataset. Till now, there is no study on how initial seed inputs affect the performance of DL testing and how to construct an optimal one. To fill this gap, we conduct the first systematic study to evaluate …

Go to article

Proactive Conversational Agents In The Post-Chatgpt World, Lizi Liao, Grace Hui Yang, Chirag Shah Jul 2023

Proactive Conversational Agents In The Post-Chatgpt World, Lizi Liao, Grace Hui Yang, Chirag Shah

Research Collection School Of Computing and Information Systems

ChatGPT and similar large language model (LLM) based conversational agents have brought shock waves to the research world. Although astonished by their human-like performance, we find they share a significant weakness with many other existing conversational agents in that they all take a passive approach in responding to user queries. This limits their capacity to understand the users and the task better and to offer recommendations based on a broader context than a given conversation. Proactiveness is still missing in these agents, including their ability to initiate a conversation, shift topics, or offer recommendations that take into account a more …

Go to article

Silent Compiler Bug De-Duplication Via Three-Dimensional Analysis, Chen Yang, Junjie Chen, Xingyu Fan, Jiajun Jiang, Jun Sun Jul 2023

Silent Compiler Bug De-Duplication Via Three-Dimensional Analysis, Chen Yang, Junjie Chen, Xingyu Fan, Jiajun Jiang, Jun Sun

Research Collection School Of Computing and Information Systems

Compiler testing is an important task for assuring the quality of compilers, but investigating test failures is very time-consuming. This is because many test failures are caused by the same compiler bug (known as bug duplication problem). In particular, this problem becomes much more challenging on silent compiler bugs (also called wrong code bugs), since these bugs can provide little information (unlike crash bugs that can produce error messages) for bug de-duplication. In this work, we propose a novel technique (called D3) to solve the duplication problem on silent compiler bugs. Its key insight is to characterize the silent bugs …

Go to article

Towards Omni-Generalizable Neural Methods For Vehicle Routing Problems, Jianan Zhou, Yaoxin Wu, Wen Song, Zhiguang Cao, Jie Zhang Jul 2023

Towards Omni-Generalizable Neural Methods For Vehicle Routing Problems, Jianan Zhou, Yaoxin Wu, Wen Song, Zhiguang Cao, Jie Zhang

Research Collection School Of Computing and Information Systems

Learning heuristics for vehicle routing problems (VRPs) has gained much attention due to the less reliance on hand-crafted rules. However, existing methods are typically trained and tested on the same task with a fixed size and distribution (of nodes), and hence suffer from limited generalization performance. This paper studies a challenging yet realistic setting, which considers generalization across both size and distribution in VRPs. We propose a generic meta-learning framework, which enables effective training of an initialized model with the capability of fast adaptation to new tasks during inference. We further develop a simple yet efficient approximation method to reduce …

Go to article

Forward/Backward And Content Private Dsse For Spatial Keyword Queries, Xiangyu Wang, Jianfeng Ma, Ximeng Liu, Yinbin Miao, Yang Liu, Robert H. Deng Jul 2023

Forward/Backward And Content Private Dsse For Spatial Keyword Queries, Xiangyu Wang, Jianfeng Ma, Ximeng Liu, Yinbin Miao, Yang Liu, Robert H. Deng

Research Collection School Of Computing and Information Systems

Spatial keyword queries are attractive techniques that have been widely deployed in real-life applications in recent years, such as social networks and location-based services. However, existing solutions neither support dynamic update nor satisfy the privacy requirements in real applications. In this article, we investigate the problem of Dynamic Searchable Symmetric Encryption (DSSE) for spatial keyword queries. First, we formulate the definition of DSSE for spatial keyword queries (namely, DSSESKQ) and extend the DSSE leakage functions to capture the leakages in DSSESKQ. Then, we present a practical DSSESKQ construction based on geometric prefix encoding inverted-index and encrypted bitmap. Rigorous security analysis …

Go to article

An Efficient Hybrid Genetic Algorithm For The Quadratic Traveling Salesman Problem, Quang Anh Pham, Hoong Chuin Lau, Minh Hoang Ha, Lam Vu Jul 2023

An Efficient Hybrid Genetic Algorithm For The Quadratic Traveling Salesman Problem, Quang Anh Pham, Hoong Chuin Lau, Minh Hoang Ha, Lam Vu

Research Collection School Of Computing and Information Systems

The traveling salesman problem (TSP) is the most well-known problem in combinatorial optimization which hasbeen studied for many decades. This paper focuses on dealing with one of the most difficult TSP variants named thequadratic traveling salesman problem (QTSP) that has numerous planning applications in robotics and bioinformatics.The goal of QTSP is similar to TSP which finds a cycle visiting all nodes exactly once with minimum total costs. However, the costs in QTSP are associated with three vertices traversed in succession (instead of two like in TSP). This leadsto a quadratic objective function that is much harder to solve.To efficiently solve …

Go to article

Adaptive Split-Fusion Transformer, Zixuan Su, Jingjing Chen, Lei Pang, Chong-Wah Ngo, Yu-Gang Jiang Jul 2023

Adaptive Split-Fusion Transformer, Zixuan Su, Jingjing Chen, Lei Pang, Chong-Wah Ngo, Yu-Gang Jiang

Research Collection School Of Computing and Information Systems

Neural networks for visual content understanding have recently evolved from convolutional ones to transformers. The prior (CNN) relies on small-windowed kernels to capture the regional clues, demonstrating solid local expressiveness. On the contrary, the latter (transformer) establishes long-range global connections between localities for holistic learning. Inspired by this complementary nature, there is a growing interest in designing hybrid models which utilize both techniques. Current hybrids merely replace convolutions as simple approximations of linear projection or juxtapose a convolution branch with attention without considering the importance of local/global modeling. To tackle this, we propose a new hybrid named Adaptive Split-Fusion Transformer …

Go to article

Few-Shot Event Detection: An Empirical Study And A Unified View, Yubo Ma, Zehao Wang, Yixin Cao, Aixin Sun Jul 2023

Few-Shot Event Detection: An Empirical Study And A Unified View, Yubo Ma, Zehao Wang, Yixin Cao, Aixin Sun

Research Collection School Of Computing and Information Systems

Few-shot event detection (ED) has been widely studied, while this brings noticeable discrepancies, e.g., various motivations, tasks, and experimental settings, that hinder the understanding of models for future progress. This paper presents a thorough empirical study, a unified view of ED models, and a better unified baseline. For fair evaluation, we compare 12 representative methods on three datasets, which are roughly grouped into prompt-based and prototype-based models for detailed analysis. Experiments consistently demonstrate that prompt-based methods, including ChatGPT, still significantly trail prototype-based methods in terms of overall performance. To investigate their superior performance, we break down their design elements along …

Go to article

Cheer: Centrality-Aware High-Order Event Reasoning Network For Document-Level Event Causality Identification, Meiqi Chen, Yixin Cao, Yan Zhang, Zhiwei Liu Jul 2023

Cheer: Centrality-Aware High-Order Event Reasoning Network For Document-Level Event Causality Identification, Meiqi Chen, Yixin Cao, Yan Zhang, Zhiwei Liu

Research Collection School Of Computing and Information Systems

Document-level Event Causality Identification (DECI) aims to recognize causal relations between events within a document. Recent studies focus on building a document-level graph for cross-sentence reasoning, but ignore important causal structures — there are one or two “central” events that prevail throughout the document, with most other events serving as either their cause or consequence. In this paper, we manually annotate central events for a systematical investigation and propose a novel DECI model, CHEER, which performs high-order reasoning while considering event centrality. First, we summarize a general GNN-based DECI model and provide a unified view for better understanding. Second, we …

Go to article

Discriminative Reasoning With Sparse Event Representation For Document-Level Event-Event Relation Extraction, Changsen Yuan, Heyan Huang, Yixin Cao, Yonggang Wen Jul 2023

Discriminative Reasoning With Sparse Event Representation For Document-Level Event-Event Relation Extraction, Changsen Yuan, Heyan Huang, Yixin Cao, Yonggang Wen

Research Collection School Of Computing and Information Systems

Document-level Event-Event Relation Extraction (DERE) aims to extract relations between events in a document. It challenges conventional sentence-level task (SERE) with difficult long-text understanding. In this paper, we propose a novel DERE model (SENDIR) for better document-level reasoning. Different from existing works that build an event graph via linguistic tools, SENDIR does not require any prior knowledge. The basic idea is to discriminate event pairs in the same sentence or span multiple sentences by assuming their different information density: 1) low density in the document suggests sparse attention to skip irrelevant information. Our module 1 designs various types of attention …

Go to article

Context-Aware Neural Fault Localization, Zhuo Zhang, Xiaoguang Mao, Meng Yan, Xin Xia, David Lo, David Lo Jul 2023

Context-Aware Neural Fault Localization, Zhuo Zhang, Xiaoguang Mao, Meng Yan, Xin Xia, David Lo, David Lo

Research Collection School Of Computing and Information Systems

Numerous fault localization techniques identify suspicious statements potentially responsible for program failures by discovering the statistical correlation between test results (i.e., failing or passing) and the executions of the different statements of a program (i.e., covered or not covered). They rarely incorporate a failure context into their suspiciousness evaluation despite the fact that a failure context showing how a failure is produced is useful for analyzing and locating faults. Since a failure context usually contains the transitive relationships among the statements of causing a failure, its relationship complexity becomes one major obstacle for the context incorporation in suspiciousness evaluation of …

Go to article

Is Web3 Better Than Web2 For Investors? Evidence From Domain Name Auctions, Ping Fan Ke, Yi Meng Lau, Daniel Varghese Hanley Jul 2023

Is Web3 Better Than Web2 For Investors? Evidence From Domain Name Auctions, Ping Fan Ke, Yi Meng Lau, Daniel Varghese Hanley

Research Collection School Of Computing and Information Systems

Blockchain-based assets are commonly believed to attract new investors. To investigate this claim, we compared investor preferences for Web2 and Web3 domain name auctions by analyzing daily auction patterns in Namecheap and OpenSea. Our results indicate that Web3 platforms may attract extreme investors with low or high values as a niche market. We found a significantly higher number of bids per auction, higher average bid prices, and greater price spreads on OpenSea, but a significantly lower number of unique bidders per auction. Our findings highlight the importance of considering the auction platform's characteristics and asset context when evaluating bid patterns …

Go to article

Balancing Privacy And Flexibility Of Cloud-Based Personal Health Records Sharing System, Yudi Zhang, Fuchun Guo, Willy Susilo, Guomin Yang Jul 2023

Balancing Privacy And Flexibility Of Cloud-Based Personal Health Records Sharing System, Yudi Zhang, Fuchun Guo, Willy Susilo, Guomin Yang

Research Collection School Of Computing and Information Systems

The Internet of Things and cloud services have been widely adopted in many applications, and personal health records (PHR) can provide tailored medical care. The PHR data is usually stored on cloud servers for sharing. Weighted attribute-based encryption (ABE) is a practical and flexible technique to protect PHR data. Under a weighted ABE policy, the data user's attributes will be “scored”, if and only if the score reaches the threshold value, he/she can access the data. However, while this approach offers a flexible access policy, the data owners have difficulty controlling their privacy, especially sharing PHR data in collaborative e-health …

Go to article

Large-Scale Correlation Analysis Of Automated Metrics For Topic Models, Jia Peng Lim, Hady Wirawan Lauw Jul 2023

Large-Scale Correlation Analysis Of Automated Metrics For Topic Models, Jia Peng Lim, Hady Wirawan Lauw

Research Collection School Of Computing and Information Systems

Automated coherence metrics constitute an important and popular way to evaluate topic models. Previous works present a mixed picture of their presumed correlation with human judgement. In this paper, we conduct a large-scale correlation analysis of coherence metrics. We propose a novel sampling approach to mine topics for the purpose of metric evaluation, and conduct the analysis via three large corpora showing that certain automated coherence metrics are correlated. Moreover, we extend the analysis to measure topical differences between corpora. Lastly, we examine the reliability of human judgement by conducting an extensive user study, which is designed as an amalgamation …

Go to article

Reducing Spatial Labeling Redundancy For Active Semi-Supervised Crowd Counting, Yongtuo Liu, Sucheng Ren, Liangyu Chai, Hanjie Wu, Dan Xu, Jing Qin, Shengfeng He Jul 2023

Reducing Spatial Labeling Redundancy For Active Semi-Supervised Crowd Counting, Yongtuo Liu, Sucheng Ren, Liangyu Chai, Hanjie Wu, Dan Xu, Jing Qin, Shengfeng He

Research Collection School Of Computing and Information Systems

Labeling is onerous for crowd counting as it should annotate each individual in crowd images. Recently, several methods have been proposed for semi-supervised crowd counting to reduce the labeling efforts. Given a limited labeling budget, they typically select a few crowd images and densely label all individuals in each of them. Despite the promising results, we argue the None-or-All labeling strategy is suboptimal as the densely labeled individuals in each crowd image usually appear similar while the massive unlabeled crowd images may contain entirely diverse individuals. To this end, we propose to break the labeling chain of previous methods and …

Go to article

Prompt To Be Consistent Is Better Than Self-Consistent? Few-Shot And Zero-Shot Fact Verification With Pre-Trained Language Models, Fengzhu Zeng, Wei Gao Jul 2023

Prompt To Be Consistent Is Better Than Self-Consistent? Few-Shot And Zero-Shot Fact Verification With Pre-Trained Language Models, Fengzhu Zeng, Wei Gao

Research Collection School Of Computing and Information Systems

Few-shot or zero-shot fact verification only relies on a few or no labeled training examples. In this paper, we propose a novel method called ProToCo, to Prompt pre-trained language models (PLMs) To be Consistent, for improving the factuality assessment capability of PLMs in the few-shot and zero-shot settings. Given a claim-evidence pair, ProToCo generates multiple variants of the claim with different relations and frames a simple consistency mechanism as constraints for making compatible predictions across these variants. We update PLMs by using parameter-efficient fine-tuning (PEFT), leading to more accurate predictions in few-shot and zero-shot fact verification tasks. Our experiments on …

Go to article

Augmenting Fake Content Detection In Online Platforms: A Domain Adaptive Transfer Learning Via Adversarial Training Approach, Ka Chung Ng, Ping Fan Ke, Mike K. P. So, Kar Yan Tam Jul 2023

Augmenting Fake Content Detection In Online Platforms: A Domain Adaptive Transfer Learning Via Adversarial Training Approach, Ka Chung Ng, Ping Fan Ke, Mike K. P. So, Kar Yan Tam

Research Collection School Of Computing and Information Systems

Online platforms are experimenting with interventions such as content screening to moderate the effects of fake, biased, and incensing content. Yet, online platforms face an operational challenge in implementing machine learning algorithms for managing online content due to the labeling problem, where labeled data used for model training are limited and costly to obtain. To address this issue, we propose a domain adaptive transfer learning via adversarial training approach to augment fake content detection with collective human intelligence. We first start with a source domain dataset containing deceptive and trustworthy general news constructed from a large collection of labeled news …

Go to article

Singapore's Hospital To Home Program: Raising Patient Engagement Through Ai, John Abisheganaden, Kheng Hock Lee, Lian Leng Low, Eugene Shum, Han Leong Goh, Christine Gian Lee Ang, Andy Wee An Ta, Steven M. Miller Jul 2023

Singapore's Hospital To Home Program: Raising Patient Engagement Through Ai, John Abisheganaden, Kheng Hock Lee, Lian Leng Low, Eugene Shum, Han Leong Goh, Christine Gian Lee Ang, Andy Wee An Ta, Steven M. Miller

Research Collection School Of Computing and Information Systems

Because of their complex care needs, many elderly patients are discharged from hospitals only to be readmitted for multiple stays within the following twelve months. John Abisheganaden and his fellow authors describe Singapore’s Hospital to Home program, a community care initiative fueled by artificial intelligence.

Go to article

Singapore's Ai Applications In The Public Sector: Six Examples, Steven M. Miller Jul 2023

Singapore's Ai Applications In The Public Sector: Six Examples, Steven M. Miller

Research Collection School Of Computing and Information Systems

Steven M. Miller describes six instances in which Singapore has applied AI in the public sector, illustrating different ways of improving its engagement with the public by making government services more accessible, anywhere, anytime, and speeding its responses to public processes and feedback. He illustrates how its leaders made the city a living lab for AI use, and what they learned.

Go to article

Finding Causally Different Tests For An Industrial Control System, Christopher M. Poskitt, Yuqi Chen, Jun Sun, Yu Jiang Jul 2023

Finding Causally Different Tests For An Industrial Control System, Christopher M. Poskitt, Yuqi Chen, Jun Sun, Yu Jiang

Research Collection School Of Computing and Information Systems

Industrial control systems (ICSs) are types of cyber-physical systems in which programs, written in languages such as ladder logic or structured text, control industrial processes through sensing and actuating. Given the use of ICSs in critical infrastructure, it is important to test their resilience against manipulations of sensor/actuator inputs. Unfortunately, existing methods fail to test them comprehensively, as they typically focus on finding the simplest-to-craft manipulations for a testing goal, and are also unable to determine when a test is simply a minor permutation of another, i.e. based on the same causal events. In this work, we propose a guided …

Go to article

First Prev Next Last