Reviewerly/exHarmony huggingface dataset:
Reassessing automatic evaluation metrics for code summarization tasks

In recent years, research in the domain of source code summarization has adopted data-driven techniques pioneered in machine translation (MT). Automatic evaluation metrics such as BLEU, METEOR, and ROUGE, are fundamental to the evaluation of MT systems and have been adopted as proxies of human evaluation in the code summarization domain. However, the extent to which automatic metrics agree with the gold standard of human evaluation has not been evaluated on code summarization tasks. Despite this, marginal improvements in metric scores are often used to discriminate between the performance of competing summarization models. In this paper, we present a critical exploration of the applicability and interpretation of automatic metrics as evaluation techniques for code summarization tasks. We conduct an empirical study with 226 human annotators to assess the degree to which automatic metrics reflect human evaluation. Results indicate that metric improvements of less than 2 points do not guarantee systematic improvements in summarization quality, and are unreliable as proxies of human evaluation. When the difference between metric scores for two summarization approaches increases but remains within 5 points, some metrics such as METEOR and chrF become highly reliable proxies, whereas others, such as corpus BLEU, remain unreliable. Based on these findings, we make several recommendations for the use of automatic metrics to discriminate model performance in code summarization.
Customer acceptance of frontline service robots in retail banking: A qualitative approach

Purpose The purpose of this paper is to explore what drives customer acceptance of frontline service robots (FSR), as a result of their interaction experiences with FSR in the context of retail banking services. Design/methodology/approach Applications of the unified theory of acceptance and use of technology and service robot acceptance model frame the exploration of customers’ interaction experiences with physical FSR to explain acceptance. A thematic analysis of information obtained through observations, focus groups and participant interviews was applied to identify themes. Findings This study identifies 16 dimensions that group into five main themes that influence customer acceptance of FSR in retail banking services: (1) utilitarian aspect, (2) social interaction, (3) customer responses toward FSR, (4) customer perspectives of the company brand and (5) individual and task heterogeneity. Themes 1 and 2 are labeled confirmed themes based on existing theoretical frameworks used; themes 3–5 are additional themes. Practical implications This study provides actionable suggestions to allow managers to reflect on their strategy and consider ways to design and improve the delivery of services that involve FSR. Originality/value This study adds to our limited knowledge of how human-robot interaction research in robotics translates to a relatively new research area in frontline services and provides a step toward a comprehensive FSR acceptance model.
Mobile microscopy and telemedicine platform assisted by deep learning for the quantification of Trichuris trichiura infection

Soil-transmitted helminths (STH) are the most prevalent pathogens among the group of neglected tropical diseases (NTDs). The Kato-Katz technique is the diagnosis method recommended by the World Health Organization (WHO) although it often presents a decreased sensitivity in low transmission settings and it is labour intensive. Visual reading of Kato-Katz preparations requires the samples to be analyzed in a short period of time since its preparation. Digitizing the samples could provide a solution which allows to store the samples in a digital database and perform remote analysis. Artificial intelligence (AI) methods based on digitized samples can support diagnosis by performing an objective and automatic quantification of disease infection. In this work, we propose an end-to-end pipeline for microscopy image digitization and automatic analysis of digitized images of STH. Our solution includes (a) a digitization system based on a mobile app that digitizes microscope samples using a 3D printed microscope adapter, (b) a telemedicine platform for remote analysis and labelling, and (c) novel deep learning algorithms for automatic assessment and quantification of parasitological infections by STH. The deep learning algorithm has been trained and tested on 51 slides of stool samples containing 949 Trichuris spp. eggs from 6 different subjects. The algorithm evaluation was performed using a cross-validation strategy, obtaining a mean precision of 98.44% and a mean recall of 80.94%. The results also proved the potential of generalization capability of the method at identifying different types of helminth eggs. Additionally, the AI-assisted quantification of STH based on digitized samples has been compared to the one performed using conventional microscopy, showing a good agreement between measurements. In conclusion, this work has presented a comprehensive pipeline using smartphone-assisted microscopy. It is integrated with a telemedicine platform for automatic image analysis and quantification of STH infection using AI models.
Appropriate Learning Rates of Adaptive Learning Rate Optimization Algorithms for Training Deep Neural Networks

This article deals with nonconvex stochastic optimization problems in deep learning. Appropriate learning rates, based on theory, for adaptive-learning-rate optimization algorithms (e.g., Adam and AMSGrad) to approximate the stationary points of such problems are provided. These rates are shown to allow faster convergence than previously reported for these algorithms. Specifically, the algorithms are examined in numerical experiments on text and image classification and are shown in experiments to perform better with constant learning rates than algorithms using diminishing learning rates.
Quantum Speed Limit Quantified by the Changing Rate of Phase

The quantum speed limit is important in determining the minimum evolution time of a quantum system, and thus is essential for quantum community. In this Letter, we derive a novel unified quantum speed limit bound for Hermitian and non-Hermitian quantum systems. The bound is quantified by the changing rate of phase of the quantum system, which represents the transmission mode of the quantum states over their evolution. The bound leads to further insights beyond the previous bounds on concrete evolution modes of the quantum system, such as horizontal or parallel transition or horizontal joining of the two quantum states in Hilbert space. The bound is linked to the feasibility of the evolutions of the state vectors, and provides a tighter upper bound. In addition, the generalized Margolus-Levitin bound is discussed.
An efficient and secure certificateless searchable encryption scheme against keyword guessing attacks

As the wave of data breaches continues crashing down on companies, specially for companies that provide cloud storage services, the data security and privacy have become the main concern of most clients that use this kind of services. Certificateless public key encryption with keyword search (CLPEKS) is a novel cryptographic primitives that if implemented correctly, provides the possibility to search over an encrypted data that has been outsourced to the cloud server, while guaranteeing the privacy of the search-keyword used in the process. Several CLPEKS schemes have been presented in the literature, but many of them are found vulnerable to offline/online keyword guessing attacks either performed by inside attackers, outside attackers or by both. To overcome these security weaknesses, we propose an efficient and secure certificateless searchable encryption scheme that is proven to be resistant against different keyword guessing attacks under both, the hardness of solving the discrete logarithm (DL) and the computational Diffie-Hellman (CDH) problems in the random oracle model. Then, by conducting a comprehensive comparison between our proposed scheme and other related schemes, we found that the proposed scheme has better overall performance in terms of communication and computation complexities, while guaranteeing security against online and offline KGA performed by either outside attackers or inside attacker.
Do ICTs drive wealth inequality? Evidence from a dynamic panel analysis

Surprisingly, little is known about the cross-country effect of information and communication technology (ICT) on wealth inequality. At the same time, there is some tentative evidence suggesting that information and communication technology is positively correlated with income inequality. However, whether and how ICT affects wealth inequality is less explored, particularly because of the lack of reliable data on wealth inequality. This paper, therefore, fills this gap and contributes to this new literature by investigating the effect of ICT on wealth inequality in a sample of 45 developed and developing countries over the period 2000–2017. ICT is measured with six different indicators (including internet penetration, mobile penetration, ICT service exports, the ICT index, ICT quality, and ICT quantity), while wealth inequality is measured with three different indicators (comprising billionaire wealth to GDP, the Top 1% wealth share, and the Top 10% wealth share). The empirical analysis is based on the Generalised Method of Moments, and the results show that ICT increases wealth inequality. Furthermore, we show that democracy mitigates the increasing effect of ICT on wealth inequality. This result suggests that improving democracy in both developed and developing countries is an effective mechanism for mitigating the effects of ICT on wealth inequality. Therefore, we encourage efforts to implement democratic institutions that ensure respect for citizens' freedoms, greater democratic accountability, and executive constraints that allow for a more egalitarian distribution of wealth.
AI Based Emotion Detection for Textual Big Data: Techniques and Contribution

Online Social Media (OSM) like Facebook and Twitter has emerged as a powerful tool to express via text people’s opinions and feelings about the current surrounding events. Understanding the emotions at the fine-grained level of these expressed thoughts is important for system improvement. Such crucial insights cannot be completely obtained by doing AI-based big data sentiment analysis; hence, text-based emotion detection using AI in social media big data has become an upcoming area of Natural Language Processing research. It can be used in various fields such as understanding expressed emotions, human–computer interaction, data mining, online education, recommendation systems, and psychology. Even though the research work is ongoing in this domain, it still lacks a formal study that can give a qualitative (techniques used) and quantitative (contributions) literature overview. This study has considered 827 Scopus and 83 Web of Science research papers from the years 2005–2020 for the analysis. The qualitative review represents different emotion models, datasets, algorithms, and application domains of text-based emotion detection. The quantitative bibliometric review of contributions presents research details such as publications, volume, co-authorship networks, citation analysis, and demographic research distribution. In the end, challenges and probable solutions are showcased, which can provide future research directions in this area.
Exathlon

Access to high-quality data repositories and benchmarks have been instrumental in advancing the state of the art in many experimental research domains. While advanced analytics tasks over time series data have been gaining lots of attention, lack of such community resources severely limits scientific progress. In this paper, we present Exathlon, the first comprehensive public benchmark for explainable anomaly detection over high-dimensional time series data. Exathlon has been systematically constructed based on real data traces from repeated executions of large-scale stream processing jobs on an Apache Spark cluster. Some of these executions were intentionally disturbed by introducing instances of six different types of anomalous events (e.g., misbehaving inputs, resource contention, process failures). For each of the anomaly instances, ground truth labels for the root cause interval as well as those for the extended effect interval are provided, supporting the development and evaluation of a wide range of anomaly detection (AD) and explanation discovery (ED) tasks. We demonstrate the practical utility of Exathlon's dataset, evaluation methodology, and end-to-end data science pipeline design through an experimental study with three state-of-the-art AD and ED techniques.
On applications of quantum computing to plasma simulations

Quantum computing is gaining increased attention as a potential way to speed up simulations of physical systems, and it is also of interest to apply it to simulations of classical plasmas. However, quantum information science is traditionally aimed at modeling linear Hamiltonian systems of a particular form that is found in quantum mechanics, so extending the existing results to plasma applications remains a challenge. Here, we report a preliminary exploration of the long-term opportunities and likely obstacles in this area. First, we show that many plasma-wave problems are naturally representable in a quantumlike form and thus are naturally fit for quantum computers. Second, we consider more general plasma problems that include non-Hermitian dynamics (instabilities, irreversible dissipation) and nonlinearities. We show that by extending the configuration space, such systems can also be represented in a quantumlike form and thus can be simulated with quantum computers too, albeit that requires more computational resources compared to the first case. Third, we outline potential applications of hybrid quantum–classical computers, which include analysis of global eigenmodes and also an alternative approach to nonlinear simulations.
Federated Learning With Soft Clustering

In this article, we consider the problem of federated learning (FL) with training data that are non independent and identically distributed (non-IID) across the clients. To cope with data heterogeneity, an iterative federated clustering algorithm (IFCA) has been proposed. IFCA partitions the clients into a number of clusters and lets the clients in the same cluster optimize a shared model. However, in IFCA, the clusters are nonoverlapping, which leads to an inefficient utilization of the local information since the knowledge of a client is used by only one cluster during each round. To capture the complex nature of real-world data, soft clustering methods with overlapping clusters have been proposed that attain superior performance over the hard ones. Motivated by this, we propose a new algorithm named FL with soft clustering (FLSC) by combining the strengths of soft clustering and IFCA, where the clients are partitioned into overlapping clusters and the information of each participating client is used by multiple clusters simultaneously during each round. The experimental results show that FLSC achieves better learning performance on the classification tasks on the MNIST and Fashion-MNIST data sets, compared with the state-of-the-art baseline methods, i.e., the global model method and IFCA.
A hybrid whale optimization algorithm with differential evolution optimization for multi-objective virtual machine scheduling in cloud computing

Virtual machine (VM) scheduling in a dynamic cloud environment is often bound with multiple quality of service parameters; therefore, it is classed as an NP-hard optimization problem. Swarm-based metaheuristics, such as the whale optimization algorithm (WOA), have gained a notable reputation for solving optimization problems. The unique bubble-net hunting behaviour and fast convergence of the algorithm led to the development of a hybrid multi-objective whale optimization algorithm-based differential evolution (M-WODE) technique to solve the VM scheduling problem. The differential evolution (DE) strategy is used to replace the randomly generated solution produced by the WOA to ensure diversity in the solution and to strengthen the local search of the M-WODE. In addition, the DE technique is applied to the Pareto front produced by the WOA to escape local optima entrapment problems. The experimental results showed that the proposed M-WODE outperformed previous algorithms in most cases on makespan and the cost trade-off.
Cooperative Assurance of Cache Data Integrity for Mobile Edge Computing

The new mobile edge computing (MEC) paradigm fundamentally changes the data caching technique by allowing data to be cached on edge servers attached to base stations within hundreds of meters from users. It provides a bounded latency guarantee for latency-sensitive applications, e.g., interactive AR/VR applications, online gaming, etc. However, in the highly distributed MEC environment, cache data is subject to corruption and their integrity must be ensured. Existing centralized data integrity assurance schemes are rendered obsolete by the unique characteristics of MEC, i.e., unlike cloud servers, edge servers have only limited computing and storage resources and they are deployed massively and distributed geographically. Thus, it is a new and significant challenge to ensure cache data integrity over tremendous geographically-distributed resource-constrained edge servers. This paper proposes the CooperEDI scheme to guarantee the edge data integrity in a distributed manner. CooperEDI employs a distributed consensus mechanism to form a self-management edge caching system. In the system, edge servers cooperatively ensure the integrity of cached replicas and repair corrupted ones. We experimentally evaluate its performance against three representative schemes. The results demonstrate that CooperEDI can effectively and efficiently ensure cache data integrity in the MEC environment.
A Lightweight Framework for Human Activity Recognition on Wearable Devices

Human Activity Recognition (HAR) is the automatic detection and understanding of human motion behavior based on data extracted from video camera, ambient sensors or wearable sensors which particularly has recently attracted increased attention from both researchers and industry. However, for running practical HAR systems on wearable devices, there are some requirements such as design and development of small, lightweight, powerful, and low-cost smart sensors. In this context, data must be continuously collected, and edge computing is a viable solution, which is an energy-efficient technique, offering real-time response and privacy requirements for HAR applications. Rather than sending data to the cloud, edge computing is a local process that minimizes the data transmission time and responds with low latency. Recently, HAR system designers have adopted deep learning techniques inspired by their outstanding performance in many application areas and achieved relevant gain in activity recognition performance, however, these techniques were not demonstrated suitable for running on resource constrained devices. Thus, designing energy-efficient deep learning models is critical for realizing efficient HAR for mobile applications. In this work, we present a lightweight framework for the deployment of low-power but accurate HAR systems for these devices. We also implement and run the system in a microcontroller and analyze computational cost and energy consumption, and how different system configurations and deep learning model complexity influence on that.
A Performance Based Study on Deep Learning Algorithms in the Effective Prediction of Breast Cancer

Breast Cancer is one of the leading causes of death worldwide. Early detection is very important in increasing survival rates. Intensive research is therefore done to improve early detection of such cancers through the use of available technology. This includes various image processing techniques andgeneral machine learning. However, the reported accuracy for many of these studies was often not at the desirable level. Deep Learning based techniques are a promising approach for the early detection of Breast Cancer. We have therefore done a comparative analysis of seven Deep Learning techniques applied to the Wisconsin Breast Cancer (Diagnostic) Dataset. Long Short Term Memory (LSTM) and Gated Recurrent Unit (GRU) were proven to be the most effective algorithms as these have demonstrated good results for the majority of performance indicators used in this study, including an accuracy of over 99 percent.
A cumulative unmanned aerial vehicle routing problem approach for humanitarian coverage path planning

This paper presents a Cumulative Unmanned Aerial Vehicle Routing Problem (CUAVRP) approach to optimize Humanitarian Coverage Path Planning (HCPP). Coverage path planning consists of finding the route which covers every point of a certain area of interest. This paper considers a Search & Rescue mission, using a homogeneous fleet of Unmanned Aerial Vehicles (UAVs). In this scenario, the objective is to minimize the sum of arrival times at all points of the area of interest, thus, completing the search with minimum latency. The HCPP problem is transformed into a Vehicle Routing Problem by using an approximate cellular decomposition technique to discretize the area into a grid, where the rectangles represent the UAV sensor's field of view. The center points of the formed rectangles, become the nodes used for a UAV routing problem. This approach uses the objective of minimizing the sum of arrival times at customers, found in the Cumulative Capacitated Vehicle Routing Problem (CCVRP), adjusted for the Search & Rescue Coverage Path Planning using UAVs. The Min-max objective is also implemented and tested. Three versions of a Parallel Weighted Greedy Randomized Adaptive Search Procedure - Variable Neighborhood Decent (GRASP-VND) algorithm is implemented to solve the Cumulative UAV Routing Problem for Humanitarian Coverage Path Planning.
MARS: mmWave-based Assistive Rehabilitation System for Smart Healthcare

Rehabilitation is a crucial process for patients suffering from motor disorders. The current practice is performing rehabilitation exercises under clinical expert supervision. New approaches are needed to allow patients to perform prescribed exercises at their homes and alleviate commuting requirements, expert shortages, and healthcare costs. Human joint estimation is a substantial component of these programs since it offers valuable visualization and feedback based on body movements. Camera-based systems have been popular for capturing joint motion. However, they have high-cost, raise serious privacy concerns, and require strict lighting and placement settings. We propose a millimeter-wave (mmWave)-based assistive rehabilitation system (MARS) for motor disorders to address these challenges. MARS provides a low-cost solution with a competitive object localization and detection accuracy. It first maps the 5D time-series point cloud from mmWave to a lower dimension. Then, it uses a convolution neural network (CNN) to estimate the accurate location of human joints. MARS can reconstruct 19 human joints and their skeleton from the point cloud generated by mmWave radar. We evaluate MARS using ten specific rehabilitation movements performed by four human subjects involving all body parts and obtain an average mean absolute error of 5.87 cm for all joint positions. To the best of our knowledge, this is the first rehabilitation movements dataset using mmWave point cloud. MARS is evaluated on the Nvidia Jetson Xavier-NX board. Model inference takes only 64 <?TeX $\mu$?> s and consumes 442 <?TeX $\mu$?> J energy. These results demonstrate the practicality of MARS on low-power edge devices.