A data-driven game theoretic strategy for developers in software crowdsourcing: a case study

Crowdsourcing has the advantages of being cost-effective and saving time, which is a typical embodiment of collective wisdom and community workers’ collaborative development. However, this development paradigm of software crowdsourcing has not been used widely. A very important reason is that requesters have limited knowledge about crowd workers’ professional skills and qualities. Another reason is that the crowd workers in the competition cannot get the appropriate reward, which affects their motivation. To solve this problem, this paper proposes a method of maximizing reward based on the crowdsourcing ability of workers, they can choose tasks according to their own abilities to obtain appropriate bonuses. Our method includes two steps: Firstly, it puts forward a method to evaluate the crowd workers’ ability, then it analyzes the intensity of competition for tasks at Topcoder.com—an open community crowdsourcing platform—on the basis of the workers’ crowdsourcing ability; secondly, it follows dynamic programming ideas and builds game models under complete information in different cases, offering a strategy of reward maximization for workers by solving a mixed-strategy Nash equilibrium. This paper employs crowdsourcing data from Topcoder.com to carry out experiments. The experimental results show that the distribution of workers’ crowdsourcing ability is uneven, and to some extent it can show the activity degree of crowdsourcing tasks. Meanwhile, according to the strategy of reward maximization, a crowd worker can get the theoretically maximum reward

FRACTAL ANALYSES OF GAIT VARIABILITY DURING A MARATHON

Detrended fluctuation analysis (DFA) and Higuchi’s fractal dimension (HG) have previously been used to characterise motor control during gait. However, there is limited evidence of either being applied to running gait within a race environment. The aims were to: i) examine statistical persistence and fractal dimension of stride dynamics during a marathon, and ii) explore the relationship between DFA and HG for running gait. Therefore, DFA and HG were applied to stride interval series of each km of the 2018 TCS New York Marathon. Results showed consistent persistence, variability, and fractal dimension of stride interval series throughout the marathon with no significant differences observed between the beginning, middle, and end of the Marathon. Moreover, HG was shown to correlate strongly with DFA, which may be useful in monitoring motor control using fractal analyses in real time, by decreasing computation time and improving robustness to changing time series lengths

Reducing Interanalyst Variability in Photovoltaic Degradation Rate Assessments

The economic return on investment of a commercial photovoltaic system depends greatly on its performance over the long term and, hence, its degradation rate. Many methods have been proposed for assessing system degradation rates from outdoor performance data. However, comparing reported values from one analyst and research group to another requires a common baseline of performance; consistency between methods and analysts can be a challenge. An interlaboratory study was conducted involving different volunteer analysts reporting on the same photovoltaic performance data using different methodologies. Initial variability of the reported degradation rates was so high that analysts could not come to a consensus whether a system degraded or not. More consistent values are received when written guidance is provided to each analyst. Further improvements in analyst variance was accomplished by using the free open-source software RdTools, allowing a reduction in variance between analysts by more than two orders of magnitude over the first round, where multiple analysis methods are allowed. This article highlights many pitfalls in conducting 'routine' degradation analysis, and it addresses some of the factors that must be considered when comparing degradation results reported by different analysts or methods

You Cannot Fix What You Cannot Find! An Investigation of Fault Localization Bias in Benchmarking Automated Program Repair Systems

Properly benchmarking Automated Program Repair (APR) systems should contribute to the development and adoption of the research outputs by practitioners. To that end, the research community must ensure that it reaches significant milestones by reliably comparing state-of-the-art tools for a better understanding of their strengths and weaknesses. In this work, we identify and investigate a practical bias caused by the fault localization (FL) step in a repair pipeline. We propose to highlight the different fault localization configurations used in the literature, and their impact on APR systems when applied to the Defects4J benchmark. Then, we explore the performance variations that can be achieved by `tweaking' the FL step. Eventually, we expect to create a new momentum for (1) full disclosure of APR experimental procedures with respect to FL, (2) realistic expectations of repairing bugs in Defects4J, as well as (3) reliable performance comparison among the state-of-the-art APR systems, and against the baseline performance results of our thoroughly assessed kPAR repair tool. Our main findings include: (a) only a subset of Defects4J bugs can be currently localized by commonly-used FL techniques; (b) current practice of comparing state-of-the-art APR systems (i.e., counting the number of fixed bugs) is potentially misleading due to the bias of FL configurations; and (c) APR authors do not properly qualify their performance achievement with respect to the different tuning parameters implemented in APR systems.Comment: Accepted by ICST 201

Overcoming Language Dichotomies: Toward Effective Program Comprehension for Mobile App Development

Mobile devices and platforms have become an established target for modern software developers due to performant hardware and a large and growing user base numbering in the billions. Despite their popularity, the software development process for mobile apps comes with a set of unique, domain-specific challenges rooted in program comprehension. Many of these challenges stem from developer difficulties in reasoning about different representations of a program, a phenomenon we define as a "language dichotomy". In this paper, we reflect upon the various language dichotomies that contribute to open problems in program comprehension and development for mobile apps. Furthermore, to help guide the research community towards effective solutions for these problems, we provide a roadmap of directions for future work.Comment: Invited Keynote Paper for the 26th IEEE/ACM International Conference on Program Comprehension (ICPC'18