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

Physical Sciences and Mathematics Commons™

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

Research Collection School Of Computing and Information Systems

2019

Discipline
Keyword

Articles 1 - 30 of 406

Full-Text Articles in Physical Sciences and Mathematics

Optimal Management Of Virtual Infrastructures Under Flexible Cloud Service Agreements, Zhiling Guo, Jin Li, Ram Ramesh Dec 2019

Optimal Management Of Virtual Infrastructures Under Flexible Cloud Service Agreements, Zhiling Guo, Jin Li, Ram Ramesh

Research Collection School Of Computing and Information Systems

A cloud service agreement entails the provisioning of a required set of virtual infrastructure resources at a specified level of availability to a client. The agreement also lays out the price charged to the client and a penalty to the provider when the assured availability is not met. The availability assurance involves backup resource provisioning, and the provider needs to allocate backups cost-effectively by balancing the resource-provisioning costs with the potential penalty costs. We develop stochastic dynamic optimization models of the backup resource-provisioning problem, leading to cost-effective resource-management policies in different practical settings. We present two sets of dynamic provisioning …

Go to article

Designing Learning Activities For Experiential Learning In A Design Thinking Course, Benjamin Gan, Eng Lieh Ouh Dec 2019

Designing Learning Activities For Experiential Learning In A Design Thinking Course, Benjamin Gan, Eng Lieh Ouh

Research Collection School Of Computing and Information Systems

One experiential learning design challenge is the duration of learning activities. These learning activities take up time and effort for teachers to design and student to perform. Another design challenge is the minimum instructional guidance of these learning activities which potentially impact the learning effectiveness of novice students. In this paper, we describe our findings of applying experiential learning method in a design thinking course with a list of learning activities performed iteratively. Each of the learning activity varies in their duration required and level of instructional guidance. Our survey seeks to find out which of the learning activities are …

Go to article

Influence, Information And Team Outcomes In Large Scale Software Development, Subhajit Datta Dec 2019

Influence, Information And Team Outcomes In Large Scale Software Development, Subhajit Datta

Research Collection School Of Computing and Information Systems

It is widely perceived that the egalitarian ecosystems of large scale open source software development foster effective team outcomes. In this study, we question this conventional wisdom by examining whether and how the centralization of information and influence in a software development team relate to the quality of the team's work products. Analyzing data from more than a hundred real world projects that include development activities over close to a decade, involving 2000+ developers, who collectively resolve more than two hundred thousand defects through discussions covering more than six hundred thousand comments, we arrive at statistically significant evidence indicating that …

Go to article

Digitalization In Practice: The Fifth Discipline Advantage, Siu Loon Hoe Dec 2019

Digitalization In Practice: The Fifth Discipline Advantage, Siu Loon Hoe

Research Collection School Of Computing and Information Systems

Purpose The purpose of this paper is to provide advice to organizations on how to become successful in the digital age. The paper revisits Peter Senge's (1990) notion of the learning organization and discusses the relevance of systems thinking and the other four disciplines, namely, personal mastery, mental models, shared vision and team learning in the context of the current digitalization megatrend. Design/methodology/approach This paper is based on content analysis of essays from international organizations, strategy experts and management scholars, and insights gained from the author's consulting experience. A comparative case study from the health and social sector is also …

Go to article

Compositional Verification Of Heap-Manipulating Programs Through Property-Guided Learning, Long H. Pham, Jun Sun, Quang Loc Le Dec 2019

Compositional Verification Of Heap-Manipulating Programs Through Property-Guided Learning, Long H. Pham, Jun Sun, Quang Loc Le

Research Collection School Of Computing and Information Systems

Analyzing and verifying heap-manipulating programs automatically is challenging. A key for fighting the complexity is to develop compositional methods. For instance, many existing verifiers for heap-manipulating programs require user-provided specification for each function in the program in order to decompose the verification problem. The requirement, however, often hinders the users from applying such tools. To overcome the issue, we propose to automatically learn heap-related program invariants in a property-guided way for each function call. The invariants are learned based on the memory graphs observed during test execution and improved through memory graph mutation. We implemented a prototype of our approach …

Go to article

Gms: Grid-Based Motion Statistics For Fast, Ultra-Robust Feature Correspondence, Jia-Wang Bian, Wen-Yan Lin, Yun Liu, Le Zhang, Sai-Kit Yeung, Ming-Ming Cheng, Ian Reid Dec 2019

Gms: Grid-Based Motion Statistics For Fast, Ultra-Robust Feature Correspondence, Jia-Wang Bian, Wen-Yan Lin, Yun Liu, Le Zhang, Sai-Kit Yeung, Ming-Ming Cheng, Ian Reid

Research Collection School Of Computing and Information Systems

Feature matching aims at generating correspondences across images, which is widely used in many computer vision tasks. Although considerable progress has been made on feature descriptors and fast matching for initial correspondence hypotheses, selecting good ones from them is still challenging and critical to the overall performance. More importantly, existing methods often take a long computational time, limiting their use in real-time applications. This paper attempts to separate true correspondences from false ones at high speed. We term the proposed method (GMS) grid-based motion Statistics, which incorporates the smoothness constraint into a statistic framework for separation and uses a grid-based …

Go to article

A Mathematical Programming Model For The Green Mixed Fleet Vehicle Routing Problem With Realistic Energy Consumption And Partial Recharges, Vincent F. Yu, Panca Jodiwan, Aldy Gunawan, Audrey Tedja Widjaja Dec 2019

A Mathematical Programming Model For The Green Mixed Fleet Vehicle Routing Problem With Realistic Energy Consumption And Partial Recharges, Vincent F. Yu, Panca Jodiwan, Aldy Gunawan, Audrey Tedja Widjaja

Research Collection School Of Computing and Information Systems

A green mixed fleet vehicle routing with realistic energy consumption and partial recharges problem (GMFVRP-REC-PR) is addressed in this paper. This problem involves a fixed number of electric vehicles and internal combustion vehicles to serve a set of customers. The realistic energy consumption which depends on several variables is utilized to calculate the electricity consumption of an electric vehicle and fuel consumption of an internal combustion vehicle. Partial recharging policy is included into the problem to represent the real life scenario. The objective of this problem is to minimize the total travelled distance and the total emission produced by internal …

Go to article

Happy Toilet: A Social Analytics Approach To The Study Of Public Toilet Cleanliness, Eugene W. J. Choy, Winston M. K. Ho, Xiaohang Li, Ragini Verma, Li Jin Sim, Kyong Jin Shim Dec 2019

Happy Toilet: A Social Analytics Approach To The Study Of Public Toilet Cleanliness, Eugene W. J. Choy, Winston M. K. Ho, Xiaohang Li, Ragini Verma, Li Jin Sim, Kyong Jin Shim

Research Collection School Of Computing and Information Systems

This study presents a social analytics approach to the study of public toilet cleanliness in Singapore. From popular social media platforms, our system automatically gathers and analyzes relevant public posts that mention about toilet cleanliness in highly frequented locations across the Singapore island - from busy shopping malls to food 'hawker' centers.

Go to article

Improved Generalisation Bounds For Deep Learning Through L∞ Covering Numbers, Antoine Ledent, Yunwen Lei, Marius Kloft Dec 2019

Improved Generalisation Bounds For Deep Learning Through L∞ Covering Numbers, Antoine Ledent, Yunwen Lei, Marius Kloft

Research Collection School Of Computing and Information Systems

Using proof techniques involving L∞ covering numbers, we show generalisation error bounds for deep learning with two main improvements over the state of the art. First, our bounds have no explicit dependence on the number of classes except for logarithmic factors. This holds even when formulating the bounds in terms of the L 2 norm of the weight matrices, while previous bounds exhibit at least a square-root dependence on the number of classes in this case. Second, we adapt the Rademacher analysis of DNNs to incorporate weight sharing—a task of fundamental theoretical importance which was previously attempted only under very …

Go to article

Pieces Of Contextual Information Suitable For Predicting Co-Changes? An Empirical Study, Igor Scaliante Wiese, Rodrigo Takashi Kuroda, Igor Steinmacher, Gustavo A. Oliva, Reginaldo Ré, Christoph Treude, Marco Aurélio Gerosa Dec 2019

Pieces Of Contextual Information Suitable For Predicting Co-Changes? An Empirical Study, Igor Scaliante Wiese, Rodrigo Takashi Kuroda, Igor Steinmacher, Gustavo A. Oliva, Reginaldo Ré, Christoph Treude, Marco Aurélio Gerosa

Research Collection School Of Computing and Information Systems

Models that predict software artifact co-changes have been proposed to assist developers in altering a software system and they often rely on coupling. However, developers have not yet widely adopted these approaches, presumably because of the high number of false recommendations. In this work, we conjecture that the contextual information related to software changes, which is collected from issues (e.g., issue type and reporter), developers’ communication (e.g., number of issue comments, issue discussants and words in the discussion), and commit metadata (e.g., number of lines added, removed, and modified), improves the accuracy of co-change prediction. We built customized prediction models …

Go to article

An Iot-Driven Smart Cafe Solution For Human Traffic Management, Maruthi Prithivirajan, Kyong Jin Shim Dec 2019

An Iot-Driven Smart Cafe Solution For Human Traffic Management, Maruthi Prithivirajan, Kyong Jin Shim

Research Collection School Of Computing and Information Systems

In this study, we present an IoT-driven solution for human traffic management in a corporate cafe. Using IoT sensors, our system monitors human traffic in a physical cafe located at a large international corporation located in Singapore. The backend system analyzes the streaming data from the sensors and provides insights useful to the cafe visitors as well as the cafe manager.

Go to article

Quantum Consensus, Jorden Seet, Paul Griffin Dec 2019

Quantum Consensus, Jorden Seet, Paul Griffin

Research Collection School Of Computing and Information Systems

In this paper, we propose a novel consensus mechanism utilizing the quantum properties of qubits. This move from classical computing to quantum computing is shown to theoretically enhance the scalability and speed of distributed consensus as well as improve security and be a potential solution for the problem of blockchain interoperability. Using this method may circumvent the common problem known as the Blockchain Trilemma, enhancing scalability and speed without sacrificing de-centralization or byzantine fault tolerance. Consensus speed and scalability is shown by removing the need for multicast responses and exploiting quantum properties to ensure that only a single multicast is …

Go to article

Study Group Travel Behaviour Patterns From Large-Scale Smart Card Data, Xiancai Tian, Baihua Zheng Dec 2019

Study Group Travel Behaviour Patterns From Large-Scale Smart Card Data, Xiancai Tian, Baihua Zheng

Research Collection School Of Computing and Information Systems

In this paper, we aim at studying the group travel behaviour (GTB) patterns from large-scale auto fare collection (AFC) data. GTB is defined as two or more commuters intentionally and regularly traveling together from an origin to a destination. We propose a method to identify GTB accurately and efficiently and apply our method to the Singapore AFC dataset to reveal the GTB patterns of Singapore commuters. The case study proves that our method is able to identify GTB patterns more accurately and efficiently than the state-of-the-art.

Go to article

The Information Disclosure Trilemma: Privacy, Attribution And Dependency, Ping Fan Ke Dec 2019

The Information Disclosure Trilemma: Privacy, Attribution And Dependency, Ping Fan Ke

Research Collection School Of Computing and Information Systems

Information disclosure has been an important mechanism to increase transparency and welfare in various contexts, from rating a restaurant to whistleblowing the wrongdoing of government agencies. Yet, the author often needs to be sacrificed during information disclosure process – an anonymous disclosure will forgo the reputation and compensation whereas an identifiable disclosure will face the threat of retaliation. On the other hand, the adoption of privacy-enhancing technologies (PETs) lessens the tradeoff between privacy and attribution while introducing dependency and potential threats. This study will develop the desirable design principles and possible threats of an information disclosure system, and discuss how …

Go to article

Smu Teaching Bank: Case Study Of A Multiyear Development Project Utilizing Student Resources, Alan Megargel, Terence P. C. Fan, Venky Shankararaman Dec 2019

Smu Teaching Bank: Case Study Of A Multiyear Development Project Utilizing Student Resources, Alan Megargel, Terence P. C. Fan, Venky Shankararaman

Research Collection School Of Computing and Information Systems

A domain refers to a business sector such as banking, healthcare, insurance, manufacturing etc. For an IS student, it is imperative that the domain knowledge includes a comprehension and understanding of business processes, technology and data related to the chosen domain. For example, when learning the retail banking domain, an IS student must have an understanding of the transactions concerned with retail banking such as fund transfers and loan repayments. The student must also gain a strong foothold in transaction fulfilment processes, the various application services that are used, the data that is transferred, etc. Teaching domain knowledge is very …

Go to article

Treecaps: Tree-Structured Capsule Networks For Program Source Code Processing, Vinoj Jayasundara, Duy Quoc Nghi Bui, Lingxiao Jiang, David Lo Dec 2019

Treecaps: Tree-Structured Capsule Networks For Program Source Code Processing, Vinoj Jayasundara, Duy Quoc Nghi Bui, Lingxiao Jiang, David Lo

Research Collection School Of Computing and Information Systems

Program comprehension is a fundamental task in software development and maintenance processes. Software developers often need to understand a large amount of existing code before they can develop new features or fix bugs in existing programs. Being able to process programming language code automatically and provide summaries of code functionality accurately can significantly help developers to reduce time spent in code navigation and understanding, and thus increase productivity. Different from natural language articles, source code in programming languages often follows rigid syntactical structures and there can exist dependencies among code elements that are located far away from each other through …

Go to article

Online Content Consumption: Social Endorsements, Observational Learning And Word-Of-Mouth, Qian Tang, Tingting Song, Liangfei Qiu, Ashish Agarwal Dec 2019

Online Content Consumption: Social Endorsements, Observational Learning And Word-Of-Mouth, Qian Tang, Tingting Song, Liangfei Qiu, Ashish Agarwal

Research Collection School Of Computing and Information Systems

The consumption of online content can occur through observational learning (OL) whereby consumers follow previous consumers’ choices or social endorsement (SE) wherein consumers receive content sharing from their social ties. As users consume content, they also generate post-consumption word-of-mouth (WOM) signals. OL, SE and WOM together shape the diffusion of the content. This study examines the drivers of SE and the effect of SE on content consumption and post-consumption WOM. In particular, we compare SE with OL. Using a random sample of 8,945 new videos posted on YouTube, we collected a multi-platform dataset consisting of data on video consumption and …

Go to article

Harmony Search Algorithm For Time-Dependent Vehicle Routing Problem With Time Windows, Yun-Chia Liang, Vanny Minanda, Aldy Gunawan, Angela Hsiang-Ling Chen Dec 2019

Harmony Search Algorithm For Time-Dependent Vehicle Routing Problem With Time Windows, Yun-Chia Liang, Vanny Minanda, Aldy Gunawan, Angela Hsiang-Ling Chen

Research Collection School Of Computing and Information Systems

Vehicle Routing Problem (VRP) is a combinatorial problem where a certain set of nodes must be visited within a certain amount of time as well as the vehicle’s capacity. There are numerous variants of VRP such as VRP with time windows, where each node has opening and closing time, therefore, the visiting time must be during that interval. Another variant takes time-dependent constraint into account. This variant fits real-world scenarios, where at different period of time, the speed on the road varies depending on the traffic congestion. In this study, three objectives – total traveling time, total traveling distance, and …

Go to article

Objective Sleep Quality As A Predictor Of Mild Cognitive Impairment In Seniors Living Alone, Brian Chen, Hwee-Pink Tan, Irus Rawtaer, Hwee Xian Tan Dec 2019

Objective Sleep Quality As A Predictor Of Mild Cognitive Impairment In Seniors Living Alone, Brian Chen, Hwee-Pink Tan, Irus Rawtaer, Hwee Xian Tan

Research Collection School Of Computing and Information Systems

Singapore has the fastest ageing population in the Asia Pacific region, with an estimated 82,000 seniors living with dementia. These figures are projected to increase to more than 130,000 by 2030. The challenge is to identify more community dwelling seniors with Mild Cognitive Impairment (MCI), a prodromal state, as it provides an opportunity for evidence-based early intervention to delay the onset of dementia. In this paper, we explore the use of Internet of Things (IoT) systems in detecting MCI symptoms in seniors who are living alone, and accurately grouping them into MCI positive and negative subjects. We present feature extraction …

Go to article

Punctuation Prediction For Vietnamese Texts Using Conditional Random Fields, Hong Quang Pham, Binh T. Nguyen, Nguyen Viet Cuong Dec 2019

Punctuation Prediction For Vietnamese Texts Using Conditional Random Fields, Hong Quang Pham, Binh T. Nguyen, Nguyen Viet Cuong

Research Collection School Of Computing and Information Systems

We investigate the punctuation prediction for the Vietnamese language. This problem is crucial as it can be used to add suitable punctuation marks to machine-transcribed speeches, which usually do not have such information. Similar to previous works for English and Chinese languages, we formulate this task as a sequence labeling problem. After that, we apply the conditional random field model for solving the problem and propose a set of appropriate features that are useful for prediction. Moreover, we build two corpora from Vietnamese online news and movie subtitles and perform extensive experiments on these data. Finally, we ask four volunteers …

Go to article

Salience-Aware Adaptive Resonance Theory For Large-Scale Sparse Data Clustering, Lei Meng, Ah-Hwee Tan, Chunyan Miao Dec 2019

Salience-Aware Adaptive Resonance Theory For Large-Scale Sparse Data Clustering, Lei Meng, Ah-Hwee Tan, Chunyan Miao

Research Collection School Of Computing and Information Systems

Sparse data is known to pose challenges to cluster analysis, as the similarity between data tends to be ill-posed in the high-dimensional Hilbert space. Solutions in the literature typically extend either k-means or spectral clustering with additional steps on representation learning and/or feature weighting. However, adding these usually introduces new parameters and increases computational cost, thus inevitably lowering the robustness of these algorithms when handling massive ill-represented data. To alleviate these issues, this paper presents a class of self-organizing neural networks, called the salience-aware adaptive resonance theory (SA-ART) model. SA-ART extends Fuzzy ART with measures for cluster-wise salient feature modeling. …

Go to article

Learning To Self-Train For Semi-Supervised Few-Shot Classification, Xinzhe Li, Qianru Sun, Yaoyao Liu, Shibao Zheng, Qin Zhou, Tat-Seng Chua, Bernt Schiele Dec 2019

Learning To Self-Train For Semi-Supervised Few-Shot Classification, Xinzhe Li, Qianru Sun, Yaoyao Liu, Shibao Zheng, Qin Zhou, Tat-Seng Chua, Bernt Schiele

Research Collection School Of Computing and Information Systems

Few-shot classification (FSC) is challenging due to the scarcity of labeled training data (e.g. only one labeled data point per class). Meta-learning has shown to achieve promising results by learning to initialize a classification model for FSC. In this paper we propose a novel semi-supervised meta-learning method called learning to self-train (LST) that leverages unlabeled data and specifically meta-learns how to cherry-pick and label such unsupervised data to further improve performance. To this end, we train the LST model through a large number of semi-supervised few-shot tasks. On each task, we train a few-shot model to predict pseudo labels for …

Go to article

A Unified Variance-Reduced Accelerated Gradient Method For Convex Optimization, Guanghui Lan, Zhize Li, Yi Zhou Dec 2019

A Unified Variance-Reduced Accelerated Gradient Method For Convex Optimization, Guanghui Lan, Zhize Li, Yi Zhou

Research Collection School Of Computing and Information Systems

We propose a novel randomized incremental gradient algorithm, namely, VAriance-Reduced Accelerated Gradient (Varag), for finite-sum optimization. Equipped with a unified step-size policy that adjusts itself to the value of the conditional number, Varag exhibits the unified optimal rates of convergence for solving smooth convex finite-sum problems directly regardless of their strong convexity. Moreover, Varag is the first accelerated randomized incremental gradient method that benefits from the strong convexity of the data-fidelity term to achieve the optimal linear convergence. It also establishes an optimal linear rate of convergence for solving a wide class of problems only satisfying a certain error bound …

Go to article

Efficient Meta Learning Via Minibatch Proximal Update, Pan Zhou, Xiao-Tong Yuan, Huan Xu, Shuicheng Yan, Jiashi Feng Dec 2019

Efficient Meta Learning Via Minibatch Proximal Update, Pan Zhou, Xiao-Tong Yuan, Huan Xu, Shuicheng Yan, Jiashi Feng

Research Collection School Of Computing and Information Systems

We address the problem of meta-learning which learns a prior over hypothesis from a sample of meta-training tasks for fast adaptation on meta-testing tasks. A particularly simple yet successful paradigm for this research is model-agnostic meta-learning (MAML). Implementation and analysis of MAML, however, can be tricky; first-order approximation is usually adopted to avoid directly computing Hessian matrix but as a result the convergence and generalization guarantees remain largely mysterious for MAML. To remedy this deficiency, in this paper we propose a minibatch proximal update based meta-learning approach for learning to efficient hypothesis transfer. The principle is to learn a prior …

Go to article

Strongly Secure Authenticated Key Exchange From Supersingular Isogenies, Xiu Xu, Haiyang Xue, Kunpeng Wang, Ho Man Au, Song Tian Dec 2019

Strongly Secure Authenticated Key Exchange From Supersingular Isogenies, Xiu Xu, Haiyang Xue, Kunpeng Wang, Ho Man Au, Song Tian

Research Collection School Of Computing and Information Systems

This paper aims to address the open problem, namely, to find new techniques to design and prove security of supersingular isogeny-based authenticated key exchange (AKE) protocols against the widest possible adversarial attacks, raised by Galbraith in 2018. Concretely, we present two AKEs based on a double-key PKE in the supersingular isogeny setting secure in the sense of CK+, one of the strongest security models for AKE. Our contributions are summarised as follows. Firstly, we propose a strong OW-CPA secure PKE, 2PKEsidh, based on SI-DDH assumption. By applying modified Fujisaki-Okamoto transformation, we obtain a [OW-CCA, OW-CPA] secure KEM, 2KEMsidh. Secondly, we …

Go to article

Ssrgd: Simple Stochastic Recursive Gradient Descent For Escaping Saddle Points, Zhize Li Dec 2019

Ssrgd: Simple Stochastic Recursive Gradient Descent For Escaping Saddle Points, Zhize Li

Research Collection School Of Computing and Information Systems

We analyze stochastic gradient algorithms for optimizing nonconvex problems. In particular, our goal is to find local minima (second-order stationary points) instead of just finding first-order stationary points which may be some bad unstable saddle points. We show that a simple perturbed version of stochastic recursive gradient descent algorithm (called SSRGD) can find an $(\epsilon,\delta)$-second-order stationary point with $\widetilde{O}(\sqrt{n}/\epsilon^2 + \sqrt{n}/\delta^4 + n/\delta^3)$ stochastic gradient complexity for nonconvex finite-sum problems. As a by-product, SSRGD finds an $\epsilon$-first-order stationary point with $O(n+\sqrt{n}/\epsilon^2)$ stochastic gradients. These results are almost optimal since Fang et al. [2018] provided a lower bound $\Omega(\sqrt{n}/\epsilon^2)$ for finding …

Go to article

Twenty Years Of Open Source Software: From Skepticism To Mainstream, Gregorio Robles, Igor Steinmacher, Paul Adams, Christoph Treude Dec 2019

Twenty Years Of Open Source Software: From Skepticism To Mainstream, Gregorio Robles, Igor Steinmacher, Paul Adams, Christoph Treude

Research Collection School Of Computing and Information Systems

Open source software (OSS) has conquered the software world. You can see it nearly everywhere, from Internet infrastructure to mobile phones to the desktop. In addition to that, although many OSS practices were viewed with skepticism 20 years ago, several have become mainstream in software engineering today: from development tools such as Git to practices such as modern code reviews.

Go to article

Strongly Leakage Resilient Authenticated Key Exchange, Revisited, Guomin Yang, Rongmao Chen, Yi Mu, Willy Susilo, Guo Fuchun, Jie Li Dec 2019

Strongly Leakage Resilient Authenticated Key Exchange, Revisited, Guomin Yang, Rongmao Chen, Yi Mu, Willy Susilo, Guo Fuchun, Jie Li

Research Collection School Of Computing and Information Systems

Authenticated Key Exchange (AKE) protocols allow two (or multiple) parties to authenticate each other and agree on a common secret key, which is essential for establishing a secure communication channel over a public network. AKE protocols form a central component in many network security standards such as IPSec, TLS/SSL, and SSH. However, it has been demonstrated that many standardized AKE protocols are vulnerable to side-channel and key leakage attacks. In order to defend against such attacks, leakage resilient (LR-) AKE protocols have been proposed in the literature. Nevertheless, most of the existing LR-AKE protocols only focused on the resistance to …

Go to article

Automating Change-Level Self-Admitted Technical Debt Determination, Meng Yan, Xin Xia, Emad Shihab, David Lo, Jianwei Yin, Xiaohu Yang Dec 2019

Automating Change-Level Self-Admitted Technical Debt Determination, Meng Yan, Xin Xia, Emad Shihab, David Lo, Jianwei Yin, Xiaohu Yang

Research Collection School Of Computing and Information Systems

Self-Admitted Technical Debt (SATD) refers to technical debt that is introduced intentionally. Previous studies that identify SATD at the file-level in isolation cannot describe the TD context related to multiple files. Therefore, it is more beneficial to identify the SATD once a change is being made. We refer to this type of TD identification as “Change-level SATD Determination”, and identifying SATD at the change-level can help to manage and control TD by understanding the TD context through tracing the introducing changes. In this paper, we propose a change-level SATD Determination mode by extracting 25 features from software changes that are …

Go to article

Selective Discrete Particle Swarm Optimization For The Team Orienteering Problem With Time Windows And Partial Scores, Vincent F. Yu, Perwira A. A. N. Redi, Parida Jewpanya, Aldy Gunawan Dec 2019

Selective Discrete Particle Swarm Optimization For The Team Orienteering Problem With Time Windows And Partial Scores, Vincent F. Yu, Perwira A. A. N. Redi, Parida Jewpanya, Aldy Gunawan

Research Collection School Of Computing and Information Systems

This paper introduces the Team Orienteering Problem with Time Windows and Partial Scores (TOPTW-PS),which is an extension of the Team Orienteering Problem with Time Windows (TOPTW). In the context of theTOPTW-PS, each node is associated with a set of scores with respect to a set of attributes. The objective ofTOPTW-PS is to find a set of routes that maximizes the total score collected from a subset of attributes whenvisiting the nodes subject to the time budget and the time window at each visited node. We develop a mathematical model and propose a discrete version of the Particle Swarm Optimization (PSO), …

Go to article

Next Last