Open Access. Powered by Scholars. Published by Universities.®
Physical Sciences and Mathematics Commons™
Open Access. Powered by Scholars. Published by Universities.®
Articles 1 - 11 of 11
Full-Text Articles in Physical Sciences and Mathematics
Segac: Sample Efficient Generalized Actor Critic For The Stochastic On-Time Arrival Problem, Honglian Guo, Zhi He, Wenda Sheng, Zhiguang Cao, Yingjie Zhou, Weinan Gao
Segac: Sample Efficient Generalized Actor Critic For The Stochastic On-Time Arrival Problem, Honglian Guo, Zhi He, Wenda Sheng, Zhiguang Cao, Yingjie Zhou, Weinan Gao
Research Collection School Of Computing and Information Systems
This paper studies the problem in transportation networks and introduces a novel reinforcement learning-based algorithm, namely. Different from almost all canonical sota solutions, which are usually computationally expensive and lack generalizability to unforeseen destination nodes, segac offers the following appealing characteristics. segac updates the ego vehicle’s navigation policy in a sample efficient manner, reduces the variance of both value network and policy network during training, and is automatically adaptive to new destinations. Furthermore, the pre-trained segac policy network enables its real-time decision-making ability within seconds, outperforming state-of-the-art sota algorithms in simulations across various transportation networks. We also successfully deploy segac …
Decentralized Multimedia Data Sharing In Iov: A Learning-Based Equilibrium Of Supply And Demand, Jiani Fan, Minrui Xu, Jiale Guo, Lwin Khin Shar, Jiawen Kang, Dusit Niyato, Kwok-Yan Lam
Decentralized Multimedia Data Sharing In Iov: A Learning-Based Equilibrium Of Supply And Demand, Jiani Fan, Minrui Xu, Jiale Guo, Lwin Khin Shar, Jiawen Kang, Dusit Niyato, Kwok-Yan Lam
Research Collection School Of Computing and Information Systems
The Internet of Vehicles (IoV) has great potential to transform transportation systems by enhancing road safety, reducing traffic congestion, and improving user experience through onboard infotainment applications. Decentralized data sharing can improve security, privacy, reliability, and facilitate infotainment data sharing in IoVs. However, decentralized data sharing may not achieve the expected efficiency if there are IoV users who only want to consume the shared data but are not willing to contribute their own data to the community, resulting in incomplete information observed by other vehicles and infrastructure, which can introduce additional transmission latency. Therefore, in this paper, by modeling the …
Detecting C++ Compiler Front-End Bugs Via Grammar Mutation And Differential Testing, Haoxin Tu, He Jiang, Zhide Zhou, Yixuan Tang, Zhilei Ren, Lei Qiao, Lingxiao Jiang
Detecting C++ Compiler Front-End Bugs Via Grammar Mutation And Differential Testing, Haoxin Tu, He Jiang, Zhide Zhou, Yixuan Tang, Zhilei Ren, Lei Qiao, Lingxiao Jiang
Research Collection School Of Computing and Information Systems
C++ is a widely used programming language and the C++ front-end is a critical part of a C++ compiler. Although many techniques have been proposed to test compilers, few studies are devoted to detecting bugs in C++ compiler. In this study, we take the first step to detect bugs in C++ compiler front-ends. To do so, two main challenges need to be addressed, namely, the acquisition of test programs that are more likely to trigger bugs in compiler front-ends and the bug identification from complicated compiler outputs. In this article, we propose a novel framework named Ccoft to detect bugs …
Gp3: Gaussian Process Path Planning For Reliable Shortest Path In Transportation Networks, Hongliang Guo, Xuejie Hou, Zhiguang Cao, Jie Zhang
Gp3: Gaussian Process Path Planning For Reliable Shortest Path In Transportation Networks, Hongliang Guo, Xuejie Hou, Zhiguang Cao, Jie Zhang
Research Collection School Of Computing and Information Systems
This paper investigates the reliable shortest path (RSP) problem in Gaussian process (GP) regulated transportation networks. Specifically, the RSP problem that we are targeting at is to minimize the (weighted) linear combination of mean and standard deviation of the path's travel time. With the reasonable assumption that the travel times of the underlying transportation network follow a multi-variate Gaussian distribution, we propose a Gaussian process path planning (GP3) algorithm to calculate the a priori optimal path as the RSP solution. With a series of equivalent RSP problem transformations, we are able to reach a polynomial time complexity algorithm with guaranteed …
Deep Unsupervised Anomaly Detection, Tangqing Li, Zheng Wang, Siying Liu, Wen-Yan Lin
Deep Unsupervised Anomaly Detection, Tangqing Li, Zheng Wang, Siying Liu, Wen-Yan Lin
Research Collection School Of Computing and Information Systems
This paper proposes a novel method to detect anomalies in large datasets under a fully unsupervised setting. The key idea behind our algorithm is to learn the representation underlying normal data. To this end, we leverage the latest clustering technique suitable for handling high dimensional data. This hypothesis provides a reliable starting point for normal data selection. We train an autoencoder from the normal data subset, and iterate between hypothesizing normal candidate subset based on clustering and representation learning. The reconstruction error from the learned autoencoder serves as a scoring function to assess the normality of the data. Experimental results …
Crowdservice: Optimizing Mobile Crowdsourcing And Service Composition, Xin Peng, Jingxiao Gu, Tian Huat Tan, Jun Sun, Yijun Yu, Bashar Nuseibeh, Wenyun Zhao Zhao
Crowdservice: Optimizing Mobile Crowdsourcing And Service Composition, Xin Peng, Jingxiao Gu, Tian Huat Tan, Jun Sun, Yijun Yu, Bashar Nuseibeh, Wenyun Zhao Zhao
Research Collection School Of Computing and Information Systems
Some user needs can only be met by leveraging the capabilities of others to undertake particular tasks that require intelligence and labor. Crowdsourcing such capabilities is one way to achieve this. But providing a service that leverages crowd intelligence and labor is a challenge, since various factors need to be considered to enable reliable service provisioning. For example, the selection of an optimal set of workers from those who bid to perform a task needs to be made based on their reliability, expected reward, and distance to the target locations. Moreover, for an application involving multiple services, the overall cost …
Crowdservice: Serving The Individuals Through Mobile Crowdsourcing And Service Composition, Xin Peng, Jingxiao Gu, Tian Huat Tan, Jun Sun, Yijun Yu, Bashar Nuseibeh, Wenyun Zhao Zhao
Crowdservice: Serving The Individuals Through Mobile Crowdsourcing And Service Composition, Xin Peng, Jingxiao Gu, Tian Huat Tan, Jun Sun, Yijun Yu, Bashar Nuseibeh, Wenyun Zhao Zhao
Research Collection School Of Computing and Information Systems
Some user needs in real life can only be accomplished by leveraging the intelligence and labor of other people via crowdsourcing tasks. For example, one may want to confirm the validity of the description of a secondhand laptop by asking someone else to inspect the laptop on site. To integrate these crowdsourcing tasks into user applications, it is required that crowd intelligence and labor be provided as easily accessible services (e.g., Web services), which can be called crowd services. In this paper, we develop a framework named CROWDSERVICE which supplies crowd intelligence and labor as publicly accessible crowd services via …
Managing Technical Debt: Insights From Recent Empirical Evidence, Narayan Ramasubbu, Chris F. Kemerer, C. Jason Woodard
Managing Technical Debt: Insights From Recent Empirical Evidence, Narayan Ramasubbu, Chris F. Kemerer, C. Jason Woodard
Research Collection School Of Computing and Information Systems
Technical debt refers to maintenance obligations that software teams accumulate as a result of their actions. Empirical research has led researchers to suggest three dimensions along which software development teams should map their technical-debt metrics: customer satisfaction needs, reliability needs, and the probability of technology disruption.
A Discriminative Model Approach For Accurate Duplicate Bug Report Retrieval, Chengnian Sun, David Lo, Xiaoyin Wang, Siau-Cheng Khoo
A Discriminative Model Approach For Accurate Duplicate Bug Report Retrieval, Chengnian Sun, David Lo, Xiaoyin Wang, Siau-Cheng Khoo
Research Collection School Of Computing and Information Systems
Bug repositories are usually maintained in software projects. Testers or users submit bug reports to identify various issues with systems. Sometimes two or more bug reports correspond to the same defect. To address the problem with duplicate bug reports, a person called a triager needs to manually label these bug reports as duplicates, and link them to their "master" reports for subsequent maintenance work. However, in practice there are considerable duplicate bug reports sent daily; requesting triagers to manually label these bugs could be highly time consuming. To address this issue, recently, several techniques have be proposed using various similarity …
Beyond Output Voting: Detecting Compromised Replicas Using Hmm-Based Behavioral Distance, Debin Gao, Michael K. Reiter, Dawn Song
Beyond Output Voting: Detecting Compromised Replicas Using Hmm-Based Behavioral Distance, Debin Gao, Michael K. Reiter, Dawn Song
Research Collection School Of Computing and Information Systems
Many host-based anomaly detection techniques have been proposed to detect code-injection attacks on servers. The vast majority, however, are susceptible to "mimicry" attacks in which the injected code masquerades as the original server software, including returning the correct service responses, while conducting its attack. "Behavioral distance," by which two diverse replicas processing the same inputs are continually monitored to detect divergence in their low-level (system-call) behaviors and hence potentially the compromise of one of them, has been proposed for detecting mimicry attacks. In this paper, we present a novel approach to behavioral distance measurement using a new type of hidden …
Dynamic Web Service Selection For Reliable Web Service Composition, San-Yih Hwang, Ee Peng Lim, Chien-Hsiang Lee, Cheng-Hung Chen
Dynamic Web Service Selection For Reliable Web Service Composition, San-Yih Hwang, Ee Peng Lim, Chien-Hsiang Lee, Cheng-Hung Chen
Research Collection School Of Computing and Information Systems
This paper studies the dynamic web service selection problem in a failure-prone environment, which aims to determine a subset of Web services to be invoked at run-time so as to successfully orchestrate a composite web service. We observe that both the composite and constituent web services often constrain the sequences of invoking their operations and therefore propose to use finite state machine to model the permitted invocation sequences of Web service operations. We assign each state of execution an aggregated reliability to measure the probability that the given state will lead to successful execution in the context where each web …