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

Software Engineering Commons™

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

Research Collection School Of Computing and Information Systems

Discipline
Keyword
Publication Year

Articles 511 - 540 of 2149

Full-Text Articles in Software Engineering

Automatic Pull Request Title Generation, Ting Zhang, Ivana Clairine Irsan, Ferdian Thung, Donggyun Han, David Lo, Lingxiao Jiang Oct 2022

Automatic Pull Request Title Generation, Ting Zhang, Ivana Clairine Irsan, Ferdian Thung, Donggyun Han, David Lo, Lingxiao Jiang

Research Collection School Of Computing and Information Systems

Pull Requests (PRs) are a mechanism on modern collaborative coding platforms, such as GitHub. PRs allow developers to tell others that their code changes are available for merging into another branch in a repository. A PR needs to be reviewed and approved by the core team of the repository before the changes are merged into the branch. Usually, reviewers need to identify a PR that is in line with their interests before providing a review. By default, PRs are arranged in a list view that shows the titles of PRs. Therefore, it is desirable to have a precise and concise …


Compressing Pre-Trained Models Of Code Into 3 Mb, Jieke Shi, Zhou Yang, Bowen Xu, Hong Jin Kang, David Lo Oct 2022

Compressing Pre-Trained Models Of Code Into 3 Mb, Jieke Shi, Zhou Yang, Bowen Xu, Hong Jin Kang, David Lo

Research Collection School Of Computing and Information Systems

Although large pre-trained models of code have delivered significant advancements in various code processing tasks, there is an impediment to the wide and fluent adoption of these powerful models in software developers’ daily workflow: these large models consume hundreds of megabytes of memory and run slowly on personal devices, which causes problems in model deployment and greatly degrades the user experience. It motivates us to propose Compressor, a novel approach that can compress the pre-trained models of code into extremely small models with negligible performance sacrifice. Our proposed method formulates the design of tiny models as simplifying the pre-trained model …


Lawbreaker: An Approach For Specifying Traffic Laws And Fuzzing Autonomous Vehicles, Yang Sun, Christopher M. Poskitt, Jun Sun, Yuqi Chen, Zijiang Yang Oct 2022

Lawbreaker: An Approach For Specifying Traffic Laws And Fuzzing Autonomous Vehicles, Yang Sun, Christopher M. Poskitt, Jun Sun, Yuqi Chen, Zijiang Yang

Research Collection School Of Computing and Information Systems

Autonomous driving systems (ADSs) must be tested thoroughly before they can be deployed in autonomous vehicles. High-fidelity simulators allow them to be tested against diverse scenarios, including those that are difficult to recreate in real-world testing grounds. While previous approaches have shown that test cases can be generated automatically, they tend to focus on weak oracles (e.g. reaching the destination without collisions) without assessing whether the journey itself was undertaken safely and satisfied the law. In this work, we propose LawBreaker, an automated framework for testing ADSs against real-world traffic laws, which is designed to be compatible with different scenario …


Guaranteeing Timed Opacity Using Parametric Timed Model Checking, Étienne André, Didier Lime, Dylan Marinho, Jun Sun Oct 2022

Guaranteeing Timed Opacity Using Parametric Timed Model Checking, Étienne André, Didier Lime, Dylan Marinho, Jun Sun

Research Collection School Of Computing and Information Systems

Information leakage can have dramatic consequences on systems security. Among harmful information leaks, the timing information leakage occurs whenever an attacker successfully deduces confidential internal information. In this work, we consider that the attacker has access (only) to the system execution time. We address the following timed opacity problem: given a timed system, a private location and a final location, synthesize the execution times from the initial location to the final location for which one cannot deduce whether the system went through the private location. We also consider the full timed opacity problem, asking whether the system is opaque for …


Automatic Fairness Testing Of Neural Classifiers Through Adversarial Sampling, Peixin Zhang, Jingyi Wang, Jun Sun, Xinyu Wang, Guoliang Dong, Xinggen Wang, Ting Dai, Jinsong Dong Sep 2022

Automatic Fairness Testing Of Neural Classifiers Through Adversarial Sampling, Peixin Zhang, Jingyi Wang, Jun Sun, Xinyu Wang, Guoliang Dong, Xinggen Wang, Ting Dai, Jinsong Dong

Research Collection School Of Computing and Information Systems

Although deep learning has demonstrated astonishing performance in many applications, there are still concerns about its dependability. One desirable property of deep learning applications with societal impact is fairness (i.e., non-discrimination). Unfortunately, discrimination might be intrinsically embedded into the models due to the discrimination in the training data. As a countermeasure, fairness testing systemically identifies discriminatory samples, which can be used to retrain the model and improve the model’s fairness. Existing fairness testing approaches however have two major limitations. Firstly, they only work well on traditional machine learning models and have poor performance (e.g., effectiveness and efficiency) on deep learning …


Hierarchical Semantic-Aware Neural Code Representation, Yuan Jiang, Xiaohong Su, Christoph Treude, Tiantian Wang Sep 2022

Hierarchical Semantic-Aware Neural Code Representation, Yuan Jiang, Xiaohong Su, Christoph Treude, Tiantian Wang

Research Collection School Of Computing and Information Systems

Code representation is a fundamental problem in many software engineering tasks. Despite the effort made by many researchers, it is still hard for existing methods to fully extract syntactic, structural and sequential features of source code, which form the hierarchical semantics of the program and are necessary to achieve a deeper code understanding. To alleviate this difficulty, we propose a new supervised approach based on the novel use of Tree-LSTM to incorporate the sequential and the global semantic features of programs explicitly into the representation model. Unlike previous techniques, our proposed model can not only learn low-level syntactic information within …


Finding Meta Winning Ticket To Train Your Maml, Dawei Gao, Yuexiang Xie, Zimu Zhou, Zhen Wang, Yaliang Li, Bolin. Ding Aug 2022

Finding Meta Winning Ticket To Train Your Maml, Dawei Gao, Yuexiang Xie, Zimu Zhou, Zhen Wang, Yaliang Li, Bolin. Ding

Research Collection School Of Computing and Information Systems

The lottery ticket hypothesis (LTH) states that a randomly initialized dense network contains sub-networks that can be trained in isolation to the performance of the dense network. In this paper, to achieve rapid learning with less computational cost, we explore LTH in the context of meta learning. First, we experimentally show that there are sparse sub-networks, known as meta winning tickets, which can be meta-trained to few-shot classification accuracy to the original backbone. The application of LTH in meta learning enables the adaptation of meta-trained networks on various IoT devices with fewer computation. However, the status quo to identify winning …


Aligning Dual Disentangled User Representations From Ratings And Textual Content, Nhu Thuat Tran, Hady Wirawan Lauw Aug 2022

Aligning Dual Disentangled User Representations From Ratings And Textual Content, Nhu Thuat Tran, Hady Wirawan Lauw

Research Collection School Of Computing and Information Systems

Classical recommendation methods typically render user representation as a single vector in latent space. Oftentimes, a user's interactions with items are influenced by several hidden factors. To better uncover these hidden factors, we seek disentangled representations. Existing disentanglement methods for recommendations are mainly concerned with user-item interactions alone. To further improve not only the effectiveness of recommendations but also the interpretability of the representations, we propose to learn a second set of disentangled user representations from textual content and to align the two sets of representations with one another. The purpose of this coupling is two-fold. For one benefit, we …


Self-Adaptive Systems: A Systematic Literature Review Across Categories And Domains, Terence Wong, Markus Wagner, Christoph Treude Aug 2022

Self-Adaptive Systems: A Systematic Literature Review Across Categories And Domains, Terence Wong, Markus Wagner, Christoph Treude

Research Collection School Of Computing and Information Systems

Context: Championed by IBM’s vision of autonomic computing paper in 2003, the autonomic computing research field has seen increased research activity over the last 20 years. Several conferences (SEAMS, SASO, ICAC) and workshops (SISSY) have been established and have contributed to the autonomic computing knowledge base in search of a new kind of system — a self-adaptive system (SAS). These systems are characterized by being context-aware and can act on that awareness. The actions carried out could be on the system or on the context (or environment). The underlying goal of a SAS is the sustained achievement of its goals …


Finding Meta Winning Ticket To Train Your Maml, Dawei Gao, Yuexiang Xie, Zimu Zhou, Zhen Wang, Yaliang Li, Bolin. Ding Aug 2022

Finding Meta Winning Ticket To Train Your Maml, Dawei Gao, Yuexiang Xie, Zimu Zhou, Zhen Wang, Yaliang Li, Bolin. Ding

Research Collection School Of Computing and Information Systems

The lottery ticket hypothesis (LTH) states that a randomly initialized dense network contains sub-networks that can be trained in isolation to the performance of the dense network. In this paper, to achieve rapid learning with less computational cost, we explore LTH in the context of meta learning. First, we experimentally show that there are sparse sub-networks, known as meta winning tickets, which can be meta-trained to few-shot classification accuracy to the original backbone. The application of LTH in meta learning enables the adaptation of meta-trained networks on various IoT devices with fewer computation. However, the status quo to identify winning …


Holistic Combination Of Structural And Textual Code Information For Context Based Api Recommendation, Chi Chen, Xin Peng, Zhengchang Xing, Jun Sun, Xin Wang, Yifan Zhao, Wenyun Zhao Aug 2022

Holistic Combination Of Structural And Textual Code Information For Context Based Api Recommendation, Chi Chen, Xin Peng, Zhengchang Xing, Jun Sun, Xin Wang, Yifan Zhao, Wenyun Zhao

Research Collection School Of Computing and Information Systems

Context based API recommendation is an important way to help developers find the needed APIs effectively and efficiently. For effective API recommendation, we need not only a joint view of both structural and textual code information, but also a holistic view of correlated API usage in control and data flow graph as a whole. Unfortunately, existing API recommendation methods exploit structural or textual code information separately. In this work, we propose a novel API recommendation approach called APIRec-CST (API Recommendation by Combining Structural and Textual code information). APIRec-CST is a deep learning model that combines the API usage with the …


Legion: Massively Composing Rankers For Improved Bug Localization At Adobe, Darryl Jarman, Jeffrey Berry, Riley Smith, Ferdian Thung, David Lo Aug 2022

Legion: Massively Composing Rankers For Improved Bug Localization At Adobe, Darryl Jarman, Jeffrey Berry, Riley Smith, Ferdian Thung, David Lo

Research Collection School Of Computing and Information Systems

Studies have estimated that, in industrial settings, developers spend between 30 and 90 percent of their time fixing bugs. As such, tools that assist in identifying the location of bugs provide value by reducing debugging costs. One such tool is BugLocator. This study initially aimed to determine if developers working on the Adobe Analytics product could use BugLocator. The initial results show that BugLocator achieves a similar accuracy on five of seven Adobe Analytics repositories and on open-source projects. However, these results do not meet the minimum applicability requirement deemed necessary by Adobe Analytics developers prior to possible adoption. Thus, …


Fed-Ltd: Towards Cross-Platform Ride Hailing Via Federated Learning To Dispatch, Yansheng Wang, Yongxin Tong, Zimu Zhou, Ziyao Ren, Yi Xu, Guobin Wu, Weifeng Lv Aug 2022

Fed-Ltd: Towards Cross-Platform Ride Hailing Via Federated Learning To Dispatch, Yansheng Wang, Yongxin Tong, Zimu Zhou, Ziyao Ren, Yi Xu, Guobin Wu, Weifeng Lv

Research Collection School Of Computing and Information Systems

Learning based order dispatching has witnessed tremendous success in ride hailing. However, the success halts within individual ride hailing platforms because sharing raw order dispatching data across platforms may leak user privacy and business secrets. Such data isolation not only impairs user experience but also decreases the potential revenues of the platforms. In this paper, we advocate federated order dispatching for cross-platform ride hailing, where multiple platforms collaboratively make dispatching decisions without sharing their local data. Realizing this concept calls for new federated learning strategies that tackle the unique challenges on effectiveness, privacy and efficiency in the context of order …


Digbug: Pre/Post-Processing Operator Selection For Accurate Bug Localization, Kisub Kim, Sankalp Ghatpande, Kui Liu, Anil Koyuncu, Dongsun Kim, Tegawendé F. Bissyande, Jacques Klein, Yves Le Traon Jul 2022

Digbug: Pre/Post-Processing Operator Selection For Accurate Bug Localization, Kisub Kim, Sankalp Ghatpande, Kui Liu, Anil Koyuncu, Dongsun Kim, Tegawendé F. Bissyande, Jacques Klein, Yves Le Traon

Research Collection School Of Computing and Information Systems

Bug localization is a recurrent maintenance task in software development. It aims at identifying relevant code locations (e.g., code files) that must be inspected to fix bugs. When such bugs are reported by users, the localization process become often overwhelming as it is mostly a manual task due to incomplete and informal information (written in natural languages) available in bug reports. The research community has then invested in automated approaches, notably using Information Retrieval techniques. Unfortunately, reported performance in the literature is still limited for practical usage. Our key observation, after empirically investigating a large dataset of bug reports as …


Gbgallery: A Benchmark And Framework For Game Testing, Zhuo Li, Yuechen Wu, Lei Ma, Xiaofei Xie, Yingfeng Chen, Changjie Fan Jul 2022

Gbgallery: A Benchmark And Framework For Game Testing, Zhuo Li, Yuechen Wu, Lei Ma, Xiaofei Xie, Yingfeng Chen, Changjie Fan

Research Collection School Of Computing and Information Systems

Software bug database and benchmark are the wheels of advancing automated software testing. In practice, real bugs often occur sparsely relative to the amount of software code, the extraction and curation of which are quite labor-intensive but can be essential to facilitate the innovation of testing techniques. Over the past decade, several milestones have been made to construct bug databases, pushing the progress of automated software testing research. However, up to the present, it still lacks a real bug database and benchmark for game software, making current game testing research mostly stagnant. The missing of bug database and framework greatly …


An Empirical Study On Data Distribution-Aware Test Selection For Deep Learning Enhancement, Qiang Hu, Yuejun Guo, Maxime Cordy, Xiaofei Xie, Lei Ma, Mike Papadakis, Yves Le Traon Jul 2022

An Empirical Study On Data Distribution-Aware Test Selection For Deep Learning Enhancement, Qiang Hu, Yuejun Guo, Maxime Cordy, Xiaofei Xie, Lei Ma, Mike Papadakis, Yves Le Traon

Research Collection School Of Computing and Information Systems

Similar to traditional software that is constantly under evolution, deep neural networks need to evolve upon the rapid growth of test data for continuous enhancement (e.g., adapting to distribution shift in a new environment for deployment). However, it is labor intensive to manually label all of the collected test data. Test selection solves this problem by strategically choosing a small set to label. Via retraining with the selected set, deep neural networks will achieve competitive accuracy. Unfortunately, existing selection metrics involve three main limitations: (1) using different retraining processes, (2) ignoring data distribution shifts, and (3) being insufficiently evaluated. To …


Data Quality Matters: A Case Study On Data Label Correctness For Security Bug Report Prediction, Xiaoxue Wu, Wei Zheng, Xin Xia, David Lo Jul 2022

Data Quality Matters: A Case Study On Data Label Correctness For Security Bug Report Prediction, Xiaoxue Wu, Wei Zheng, Xin Xia, David Lo

Research Collection School Of Computing and Information Systems

In the research of mining software repositories, we need to label a large amount of data to construct a predictive model. The correctness of the labels will affect the performance of a model substantially. However, limited studies have been performed to investigate the impact of mislabeled instances on a predictive model. To bridge the gap, in this article, we perform a case study on the security bug report (SBR) prediction. We found five publicly available datasets for SBR prediction contains many mislabeled instances, which lead to the poor performance of SBR prediction models of recent studies (e.g., the work of …


Neural Network Based Scene Text Recognition [Us Patent Us 2022/0237403 A1], Pan Zhou, Peng Tang, Ran Xu, Steven Chu Hong Hoi Jul 2022

Neural Network Based Scene Text Recognition [Us Patent Us 2022/0237403 A1], Pan Zhou, Peng Tang, Ran Xu, Steven Chu Hong Hoi

Research Collection School Of Computing and Information Systems

A system uses a neural network based model to perform scene text recognition. The system achieves high accuracy of prediction of text from scenes based on a neural network architecture that uses double attention mechanism. The neural network based model includes a convolutional neural network component that outputs a set of visual features and an attention extractor neural network component that determines attention scores based on the visual features. The visual features and the attention scores are combined to generate mixed features that are provided as input to a character recognizer component that determines a second attention score and recognizes …


Cross-Lingual Transfer Learning For Statistical Type Inference, Zhiming Li, Xiaofei Xie, Haoliang Li, Zhengzi Xu, Yi Li, Yang Liu Jul 2022

Cross-Lingual Transfer Learning For Statistical Type Inference, Zhiming Li, Xiaofei Xie, Haoliang Li, Zhengzi Xu, Yi Li, Yang Liu

Research Collection School Of Computing and Information Systems

Hitherto statistical type inference systems rely thoroughly on supervised learning approaches, which require laborious manual effort to collect and label large amounts of data. Most Turing-complete imperative languages share similar control- and data-flow structures, which make it possible to transfer knowledge learned from one language to another. In this paper, we propose a cross-lingual transfer learning framework, Plato, for statistical type inference, which allows us to leverage prior knowledge learned from the labeled dataset of one language and transfer it to the others, e.g., Python to JavaScript, Java to JavaScript, etc. Plato is powered by a novel kernelized attention mechanism …


Test Mimicry To Assess The Exploitability Of Library Vulnerabilities, Hong Jin Kang, Truong Giang Nguyen, Bach Le, Corina S. Pasareanu, David Lo Jul 2022

Test Mimicry To Assess The Exploitability Of Library Vulnerabilities, Hong Jin Kang, Truong Giang Nguyen, Bach Le, Corina S. Pasareanu, David Lo

Research Collection School Of Computing and Information Systems

Modern software engineering projects often depend on open-source software libraries, rendering them vulnerable to potential security issues in these libraries. Developers of client projects have to stay alert of security threats in the software dependencies. While there are existing tools that allow developers to assess if a library vulnerability is reachable from a project, they face limitations. Call graphonly approaches may produce false alarms as the client project may not use the vulnerable code in a way that triggers the vulnerability, while test generation-based approaches faces difficulties in overcoming the intrinsic complexity of exploiting a vulnerability, where extensive domain knowledge …


Proceedings Of The 13th International Workshop On Graph Computation Models (Gcm 2022), Reiko Heckel, Christopher M. Poskitt Jul 2022

Proceedings Of The 13th International Workshop On Graph Computation Models (Gcm 2022), Reiko Heckel, Christopher M. Poskitt

Research Collection School Of Computing and Information Systems

This volume contains the proceedings of the Thirteenth International Workshop on Graph Computation Models (GCM 2022) , which was held in Nantes, France on 6th July 2022 as part of the STAF federation of conferences. Graphs are common mathematical structures that are visual and intuitive. They constitute a natural and seamless way for system modelling in science, engineering, and beyond, including computer science, biology, and business process modelling. Graph computation models constitute a class of very high-level models where graphs are first-class citizens. The aim of the International GCM Workshop series is to bring together researchers interested in all aspects …


Xss For The Masses: Integrating Security In A Web Programming Course Using A Security Scanner, Lwin Khin Shar, Christopher M. Poskitt, Kyong Jin Shim, Li Ying Leonard Wong Jul 2022

Xss For The Masses: Integrating Security In A Web Programming Course Using A Security Scanner, Lwin Khin Shar, Christopher M. Poskitt, Kyong Jin Shim, Li Ying Leonard Wong

Research Collection School Of Computing and Information Systems

Cybersecurity education is considered an important part of undergraduate computing curricula, but many institutions teach it only in dedicated courses or tracks. This optionality risks students graduating with limited exposure to secure coding practices that are expected in industry. An alternative approach is to integrate cybersecurity concepts across non-security courses, so as to expose students to the interplay between security and other sub-areas of computing. In this paper, we report on our experience of applying the security integration approach to an undergraduate web programming course. In particular, we added a practical introduction to secure coding, which highlighted the OWASP Top …


Npc: Neuron Path Coverage Via Characterizing Decision Logic Of Deep Neural Networks, Xiaofei Xie, Tianlin Li, Jian Wang, Lei Ma, Qing Guo, Felix Juefei-Xu, Yang Liu Jul 2022

Npc: Neuron Path Coverage Via Characterizing Decision Logic Of Deep Neural Networks, Xiaofei Xie, Tianlin Li, Jian Wang, Lei Ma, Qing Guo, Felix Juefei-Xu, Yang Liu

Research Collection School Of Computing and Information Systems

Deep learning has recently been widely applied to many applications across different domains, e.g., image classification and audio recognition. However, the quality of Deep Neural Networks (DNNs) still raises concerns in the practical operational environment, which calls for systematic testing, especially in safety-critical scenarios. Inspired by software testing, a number of structural coverage criteria are designed and proposed to measure the test adequacy of DNNs. However, due to the blackbox nature of DNN, the existing structural coverage criteria are difficult to interpret, making it hard to understand the underlying principles of these criteria. The relationship between the structural coverage and …


Learning To Solve Routing Problems Via Distributionally Robust Optimization, Jiang Yuan, Yaoxin Wu, Zhiguang Cao Jun 2022

Learning To Solve Routing Problems Via Distributionally Robust Optimization, Jiang Yuan, Yaoxin Wu, Zhiguang Cao

Research Collection School Of Computing and Information Systems

Recent deep models for solving routing problems always assume a single distribution of nodes for training, which severely impairs their cross-distribution generalization ability. In this paper, we exploit group distributionally robust optimization (group DRO) to tackle this issue, where we jointly optimize the weights for different groups of distributions and the parameters for the deep model in an interleaved manner during training. We also design a module based on convolutional neural network, which allows the deep model to learn more informative latent pattern among the nodes. We evaluate the proposed approach on two types of wellknown deep models including GCN …


Hu-Fu: Efficient And Secure Spatial Queries Over Data Federation, Yongxin Tong, Xuchen Pan, Yuxiang Zeng, Yexuan Shi, Chunbo Xue, Zimu Zhou, Xiaofei Zhang, Lei Chen, Yi Xu, Ke Xu, Weifeng Lv Jun 2022

Hu-Fu: Efficient And Secure Spatial Queries Over Data Federation, Yongxin Tong, Xuchen Pan, Yuxiang Zeng, Yexuan Shi, Chunbo Xue, Zimu Zhou, Xiaofei Zhang, Lei Chen, Yi Xu, Ke Xu, Weifeng Lv

Research Collection School Of Computing and Information Systems

Data isolation has become an obstacle to scale up query processing over big data, since sharing raw data among data owners is often prohibitive due to security concerns. A promising solution is to perform secure queries over a federation of multiple data owners leveraging secure multi-party computation (SMC) techniques, as evidenced by recent federation work over relational data. However, existing solutions are highly inefficient on spatial queries due to excessive secure distance operations for query processing and their usage of general-purpose SMC libraries for secure operation implementation. In this paper, we propose Hu-Fu, the first system for efficient and secure …


A Practical Comparison Of Quantum And Classical Leaderless Consensus, Paul Robert Griffin, Dimple Mevada Jun 2022

A Practical Comparison Of Quantum And Classical Leaderless Consensus, Paul Robert Griffin, Dimple Mevada

Research Collection School Of Computing and Information Systems

Quantum computing is coming of age and being explored in many business areas for either solving difficult problems or improving business processes. Distributed ledger technology (DLT) is now embedded in many businesses and continues to mature. Consensus, at the heart of DLTs, has practical scaling issues and, as we move into needing bigger datasets, bigger networks and more security, the problem is ever increasing. Consensus agreement is a non-deterministic problem which is a good match to quantum computers due to the probabilistic nature of quantum phenomena. In this paper, we show that quantum nodes entangled in a variety of network …


You Have Earned A Trophy: Characterize In-Game Achievements And Their Completions, Haewoon Kwak Jun 2022

You Have Earned A Trophy: Characterize In-Game Achievements And Their Completions, Haewoon Kwak

Research Collection School Of Computing and Information Systems

Achievement systems have been actively adopted in gaming platforms to maintain players’ interests. Among them, trophies in PlayStation games are one of the most successful achievement systems. While the importance of trophy design has been casually discussed in many game developers’ forums, there has been no systematic study of the historical dataset of trophies yet. In this work, we construct a complete dataset of PlayStation games and their trophies and investigate them from both the developers’ and players’ perspectives.


Reinforcement Learning Approach To Solve Dynamic Bi-Objective Police Patrol Dispatching And Rescheduling Problem, Waldy Joe, Hoong Chuin Lau, Jonathan Pan Jun 2022

Reinforcement Learning Approach To Solve Dynamic Bi-Objective Police Patrol Dispatching And Rescheduling Problem, Waldy Joe, Hoong Chuin Lau, Jonathan Pan

Research Collection School Of Computing and Information Systems

Police patrol aims to fulfill two main objectives namely to project presence and to respond to incidents in a timely manner. Incidents happen dynamically and can disrupt the initially-planned patrol schedules. The key decisions to be made will be which patrol agent to be dispatched to respond to an incident and subsequently how to adapt the patrol schedules in response to such dynamically-occurring incidents whilst still fulfilling both objectives; which sometimes can be conflicting. In this paper, we define this real-world problem as a Dynamic Bi-Objective Police Patrol Dispatching and Rescheduling Problem and propose a solution approach that combines Deep …


Challenges For Inclusion In Software Engineering: The Case Of The Emerging Papua New Guinean Society, Raula Kula, Christoph Treude, Hideaki Hata, Sebastian Baltes, Igor Steinmacher, Marco Gerosa, Winifred Kula Amini Jun 2022

Challenges For Inclusion In Software Engineering: The Case Of The Emerging Papua New Guinean Society, Raula Kula, Christoph Treude, Hideaki Hata, Sebastian Baltes, Igor Steinmacher, Marco Gerosa, Winifred Kula Amini

Research Collection School Of Computing and Information Systems

Software plays a central role in modern societies, with its high economic value and potential for advancing societal change. In this paper, we characterise challenges and opportunities for a country progressing towards entering the global software industry, focusing on Papua New Guinea (PNG). By hosting a Software Engineering workshop, we conducted a qualitative study by recording talks (n=3), employing a questionnaire (n=52), and administering an in-depth focus group session with local actors (n=5). Based on a thematic analysis, we identified challenges as barriers and opportunities for the PNG software engineering community. We also discuss the state of practices and how …


Adaptive Task Planning For Large-Scale Robotized Warehouses, Dingyuan Shi, Yongxin Tong, Zimu Zhou, Ke Xu, Wenzhe Tan, Hongbo Li May 2022

Adaptive Task Planning For Large-Scale Robotized Warehouses, Dingyuan Shi, Yongxin Tong, Zimu Zhou, Ke Xu, Wenzhe Tan, Hongbo Li

Research Collection School Of Computing and Information Systems

Robotized warehouses are deployed to automatically distribute millions of items brought by the massive logistic orders from e-commerce. A key to automated item distribution is to plan paths for robots, also known as task planning, where each task is to deliver racks with items to pickers for processing and then return the rack back. Prior solutions are unfit for large-scale robotized warehouses due to the inflexibility to time-varying item arrivals and the low efficiency for high throughput. In this paper, we propose a new task planning problem called TPRW, which aims to minimize the end-to-end makespan that incorporates the entire …