Reviewerly/exHarmony huggingface dataset:
SemEval-2020 Task 12: Multilingual Offensive Language Identification in Social Media (OffensEval 2020)

We present the results and the main findings of SemEval-2020 Task 12 on Multilingual Offensive Language Identification in Social Media (OffensEval-2020).The task included three subtasks corresponding to the hierarchical taxonomy of the OLID schema from OffensEval-2019, and it was offered in five languages: Arabic, Danish, English, Greek, and Turkish.OffensEval-2020 was one of the most popular tasks at SemEval-2020, attracting a large number of participants across all subtasks and languages: a total of 528 teams signed up to participate in the task, 145 teams submitted official runs on the test data, and 70 teams submitted system description papers.
Knowledge Transfer via Distillation of Activation Boundaries Formed by Hidden Neurons

An activation boundary for a neuron refers to a separating hyperplane that determines whether the neuron is activated or deactivated. It has been long considered in neural networks that the activations of neurons, rather than their exact output values, play the most important role in forming classificationfriendly partitions of the hidden feature space. However, as far as we know, this aspect of neural networks has not been considered in the literature of knowledge transfer. In this paper, we propose a knowledge transfer method via distillation of activation boundaries formed by hidden neurons. For the distillation, we propose an activation transfer loss that has the minimum value when the boundaries generated by the student coincide with those by the teacher. Since the activation transfer loss is not differentiable, we design a piecewise differentiable loss approximating the activation transfer loss. By the proposed method, the student learns a separating boundary between activation region and deactivation region formed by each neuron in the teacher. Through the experiments in various aspects of knowledge transfer, it is verified that the proposed method outperforms the current state-of-the-art.
Trust in humanoid robots: implications for services marketing

Purpose Service robots can offer benefits to consumers (e.g. convenience, flexibility, availability, efficiency) and service providers (e.g. cost savings), but a lack of trust hinders consumer adoption. To enhance trust, firms add human-like features to robots; yet, anthropomorphism theory is ambiguous about their appropriate implementation. This study therefore aims to investigate what is more effective for fostering trust: appearance features that are more human-like or social functioning features that are more human-like. Design/methodology/approach In an experimental field study, a humanoid service robot displayed gaze cues in the form of changing eye colour in one condition and static eye colour in the other. Thus, the robot was more human-like in its social functioning in one condition (displaying gaze cues, but not in the way that humans do) and more human-like in its appearance in the other (static eye colour, but no gaze cues). Self-reported data from 114 participants revealing their perceptions of trust, anthropomorphism, interaction comfort, enjoyment and intention to use were analysed using partial least squares path modelling. Findings Interaction comfort moderates the effect of gaze cues on anthropomorphism, insofar as gaze cues increase anthropomorphism when comfort is low and decrease it when comfort is high. Anthropomorphism drives trust, intention to use and enjoyment. Research limitations/implications To extend human–robot interaction literature, the findings provide novel theoretical understanding of anthropomorphism directed towards humanoid robots. Practical implications By investigating which features influence trust, this study gives managers insights into reasons for selecting or optimizing humanoid robots for service interactions. Originality/value This study examines the difference between appearance and social functioning features as drivers of anthropomorphism and trust, which can benefit research on self-service technology adoption.
Multi-News: A Large-Scale Multi-Document Summarization Dataset and Abstractive Hierarchical Model

Automatic generation of summaries from multiple news articles is a valuable tool as the number of online publications grows rapidly. Single document summarization (SDS) systems have benefited from advances in neural encoder-decoder model thanks to the availability of large datasets. However, multi-document summarization (MDS) of news articles has been limited to datasets of a couple of hundred examples. In this paper, we introduce Multi-News, the first large-scale MDS news dataset. Additionally, we propose an end-to-end model which incorporates a traditional extractive summarization model with a standard SDS model and achieves competitive results on MDS datasets. We benchmark several methods on Multi-News and hope that this work will promote advances in summarization in the multi-document setting.
Knowledge Graph Embedding for Link Prediction

Knowledge Graphs (KGs) have found many applications in industry and academic settings, which in turn, have motivated considerable research efforts towards large-scale information extraction from a variety of sources. Despite such efforts, it is well known that even state-of-the-art KGs suffer from incompleteness. Link Prediction (LP), the task of predicting missing facts among entities already a KG, is a promising and widely studied task aimed at addressing KG incompleteness. Among the recent LP techniques, those based on KG embeddings have achieved very promising performances in some benchmarks. Despite the fast growing literature in the subject, insufficient attention has been paid to the effect of the various design choices in those methods. Moreover, the standard practice in this area is to report accuracy by aggregating over a large number of test facts in which some entities are over-represented; this allows LP methods to exhibit good performance by just attending to structural properties that include such entities, while ignoring the remaining majority of the KG. This analysis provides a comprehensive comparison of embedding-based LP methods, extending the dimensions of analysis beyond what is commonly available in the literature. We experimentally compare effectiveness and efficiency of 16 state-of-the-art methods, consider a rule-based baseline, and report detailed analysis over the most popular benchmarks in the literature.
Pay Less Attention with Lightweight and Dynamic Convolutions

Self-attention is a useful mechanism to build generative models for language and images. It determines the importance of context elements by comparing each element to the current time step. In this paper, we show that a very lightweight convolution can perform competitively to the best reported self-attention results. Next, we introduce dynamic convolutions which are simpler and more efficient than self-attention. We predict separate convolution kernels based solely on the current time-step in order to determine the importance of context elements. The number of operations required by this approach scales linearly in the input length, whereas self-attention is quadratic. Experiments on large-scale machine translation, language modeling and abstractive summarization show that dynamic convolutions improve over strong self-attention models. On the WMT'14 English-German test set dynamic convolutions achieve a new state of the art of 29.7 BLEU.
Remote health monitoring of elderly through wearable sensors

Due to a rapidly increasing aging population and its associated challenges in health and social care, Ambient Assistive Living has become the focal point for both researchers and industry alike. The need to manage or even reduce healthcare costs while improving the quality of service is high government agendas. Although, technology has a major role to play in achieving these aspirations, any solution must be designed, implemented and validated using appropriate domain knowledge. In order to overcome these challenges, the remote real-time monitoring of a person’s health can be used to identify relapses in conditions, therefore, enabling early intervention. Thus, the development of a smart healthcare monitoring system, which is capable of observing elderly people remotely, is the focus of the research presented in this paper. The technology outlined in this paper focuses on the ability to track a person’s physiological data to detect specific disorders which can aid in Early Intervention Practices. This is achieved by accurately processing and analysing the acquired sensory data while transmitting the detection of a disorder to an appropriate career. The finding reveals that the proposed system can improve clinical decision supports while facilitating Early Intervention Practices. Our extensive simulation results indicate a superior performance of the proposed system: low latency (96% of the packets are received with less than 1 millisecond) and low packets-lost (only 2.2% of total packets are dropped). Thus, the system runs efficiently and is cost-effective in terms of data acquisition and manipulation.
Breast Cancer Classification from Histopathological Images with Inception Recurrent Residual Convolutional Neural Network

The Deep Convolutional Neural Network (DCNN) is one of the most powerful and successful deep learning approaches. DCNNs have already provided superior performance in different modalities of medical imaging including breast cancer classification, segmentation, and detection. Breast cancer is one of the most common and dangerous cancers impacting women worldwide. In this paper, we have proposed a method for breast cancer classification with the Inception Recurrent Residual Convolutional Neural Network (IRRCNN) model. The IRRCNN is a powerful DCNN model that combines the strength of the Inception Network (Inception-v4), the Residual Network (ResNet), and the Recurrent Convolutional Neural Network (RCNN). The IRRCNN shows superior performance against equivalent Inception Networks, Residual Networks, and RCNNs for object recognition tasks. In this paper, the IRRCNN approach is applied for breast cancer classification on two publicly available datasets including BreakHis and Breast Cancer (BC) classification challenge 2015. The experimental results are compared against the existing machine learning and deep learning–based approaches with respect to image-based, patch-based, image-level, and patient-level classification. The IRRCNN model provides superior classification performance in terms of sensitivity, area under the curve (AUC), the ROC curve, and global accuracy compared to existing approaches for both datasets.
Evolutionary Multitasking via Explicit Autoencoding

Evolutionary multitasking (EMT) is an emerging research topic in the field of evolutionary computation. In contrast to the traditional single-task evolutionary search, EMT conducts evolutionary search on multiple tasks simultaneously. It aims to improve convergence characteristics across multiple optimization problems at once by seamlessly transferring knowledge among them. Due to the efficacy of EMT, it has attracted lots of research attentions and several EMT algorithms have been proposed in the literature. However, existing EMT algorithms are usually based on a common mode of knowledge transfer in the form of implicit genetic transfer through chromosomal crossover. This mode cannot make use of multiple biases embedded in different evolutionary search operators, which could give better search performance when properly harnessed. Keeping this in mind, this paper proposes an EMT algorithm with explicit genetic transfer across tasks, namely EMT via autoencoding, which allows the incorporation of multiple search mechanisms with different biases in the EMT paradigm. To confirm the efficacy of the proposed EMT algorithm with explicit autoencoding, comprehensive empirical studies have been conducted on both the singleand multi-objective multitask optimization problems.
Improving Metaheuristic Algorithms With Information Feedback Models

In most metaheuristic algorithms, the updating process fails to make use of information available from individuals in previous iterations. If this useful information could be exploited fully and used in the later optimization process, the quality of the succeeding solutions would be improved significantly. This paper presents our method for reusing the valuable information available from previous individuals to guide later search. In our approach, previous useful information was fed back to the updating process. We proposed six information feedback models. In these models, individuals from previous iterations were selected in either a fixed or random manner. Their useful information was incorporated into the updating process. Accordingly, an individual at the current iteration was updated based on the basic algorithm plus some selected previous individuals by using a simple fitness weighting method. By incorporating six different information feedback models into ten metaheuristic algorithms, this approach provided a number of variants of the basic algorithms. We demonstrated experimentally that the variants outperformed the basic algorithms significantly on 14 standard test functions and 10 CEC 2011 real world problems, thereby, establishing the value of the information feedback models.
Segment Anything

We introduce the Segment Anything (SA) project: a new task, model, and dataset for image segmentation. Using our efficient model in a data collection loop, we built the largest segmentation dataset to date (by far), with over 1 billion masks on 11M licensed and privacy respecting images. The model is designed and trained to be promptable, so it can transfer zero-shot to new image distributions and tasks. We evaluate its capabilities on numerous tasks and find that its zero-shot performance is impressive – often competitive with or even superior to prior fully supervised results. We are releasing the Segment Anything Model (SAM) and corresponding dataset (SA-1B) of 1B masks and 11M images at segment-anything.com to foster research into foundation models for computer vision. We recommend reading the full paper at: arxiv.org/abs/2304.02643.
The Ethics of Realism in Virtual and Augmented Reality

In this paper we consider ethical issues that could emerge with the widespread adoption ofvirtual and augmented reality (XR) as a consumer product. Our major focus is on a likelyfuture where, with technological advances, virtual and augmented reality may becomeindistinguishable from reality thanks to the improvements in sensory feedback, in the abilityto interact with virtual features, and in other elements that enhance the realism of the virtualexperience—what we refer to as superrealism. In the introductory section we first considermore general ethical issues related to XR use, and in later sections we consider issues specificto superrealism in XR. Finally, we propose approaches towards remedies and outline a seriesof scientific questions targeted at the research community. This work is the result of a groupmeeting under the auspices of Digital Catapult in London, and reports findings of theirdiscussions. The intention of this paper is to highlight important areas for consideration bythe wider XR community, and provoke the discussion and further research needed toinvestigate and address these important topics.
An Empirical Study on Learning Bug-Fixing Patches in the Wild via Neural Machine Translation

Millions of open source projects with numerous bug fixes are available in code repositories. This proliferation of software development histories can be leveraged to learn how to fix common programming bugs. To explore such a potential, we perform an empirical study to assess the feasibility of using Neural Machine Translation techniques for learning bug-fixing patches for real defects. First, we mine millions of bug-fixes from the change histories of projects hosted on GitHub in order to extract meaningful examples of such bug-fixes. Next, we abstract the buggy and corresponding fixed code, and use them to train an Encoder-Decoder model able to translate buggy code into its fixed version. In our empirical investigation, we found that such a model is able to fix thousands of unique buggy methods in the wild. Overall, this model is capable of predicting fixed patches generated by developers in 9--50% of the cases, depending on the number of candidate patches we allow it to generate. Also, the model is able to emulate a variety of different Abstract Syntax Tree operations and generate candidate patches in a split second.
Text-based editing of talking-head video

Editing talking-head video to change the speech content or to remove filler words is challenging. We propose a novel method to edit talking-head video based on its transcript to produce a realistic output video in which the dialogue of the speaker has been modified, while maintaining a seamless audio-visual flow (i.e. no jump cuts). Our method automatically annotates an input talking-head video with phonemes, visemes, 3D face pose and geometry, reflectance, expression and scene illumination per frame. To edit a video, the user has to only edit the transcript, and an optimization strategy then chooses segments of the input corpus as base material. The annotated parameters corresponding to the selected segments are seamlessly stitched together and used to produce an intermediate video representation in which the lower half of the face is rendered with a parametric face model. Finally, a recurrent video generation network transforms this representation to a photorealistic video that matches the edited transcript. We demonstrate a large variety of edits, such as the addition, removal, and alteration of words, as well as convincing language translation and full sentence synthesis.
Strongly correlated quantum walks with a 12-qubit superconducting processor

Quantum walks are the quantum analogs of classical random walks, which allow for the simulation of large-scale quantum many-body systems and the realization of universal quantum computation without time-dependent control. We experimentally demonstrate quantum walks of one and two strongly correlated microwave photons in a one-dimensional array of 12 superconducting qubits with short-range interactions. First, in one-photon quantum walks, we observed the propagation of the density and correlation of the quasiparticle excitation of the superconducting qubit and quantum entanglement between qubit pairs. Second, when implementing two-photon quantum walks by exciting two superconducting qubits, we observed the fermionization of strongly interacting photons from the measured time-dependent long-range anticorrelations, representing the antibunching of photons with attractive interactions. The demonstration of quantum walks on a quantum processor, using superconducting qubits as artificial atoms and tomographic readout, paves the way to quantum simulation of many-body phenomena and universal quantum computation.
Design and Implementation of an Integrated IoT Blockchain Platform for Sensing Data Integrity

With the rapid development of communication technologies, the Internet of Things (IoT) is getting out of its infancy, into full maturity, and tends to be developed in an explosively rapid way, with more and more data transmitted and processed. As a result, the ability to manage devices deployed worldwide has been given more and advanced requirements in practical application performances. Most existing IoT platforms are highly centralized architectures, which suffer from various technical limitations, such as a cyber-attack and single point of failure. A new solution direction is essential to enhance data accessing, while regulating it with government mandates in privacy and security. In this paper, we propose an integrated IoT platform using blockchain technology to guarantee sensing data integrity. The aim of this platform is to afford the device owner a practical application that provides a comprehensive, immutable log and allows easy access to their devices deployed in different domains. It also provides characteristics of general IoT systems, allows for real-time monitoring, and control between the end user and device. The business logic of the application is defined by the smart contract, which contains rules and conditions. The proposed approach is backed by a proof of concept implementation in realistic IoT scenarios, utilizing Raspberry Pi devices and a permissioned network called Hyperledger Fabric. Lastly, a benchmark study using various performance metrics is made to highlight the significance of the proposed work. The analysis results indicate that the designed platform is suitable for the resource-constrained IoT architecture and is scalable to be extended in various IoT scenarios.
Multiple-Input Deep Convolutional Neural Network Model for Short-Term Photovoltaic Power Forecasting

With the fast expansion of renewable energy system installed capacity in recent years, the availability, stability, and quality of smart grids have become increasingly important. The renewable energy output forecasting applications have also been developing rapidly in recent years, and such techniques have particularly been applied in the fields of wind and solar photovoltaic (PV). In the case of solar PV output forecasting, many applications have been performed with machine learning and hybrid techniques. In this paper, we propose a high-precision deep neural network model named PVPNet to forecast PV system output power. The methodology behind the proposed model is based on deep neural networks, and the model is able to generate a 24-h probabilistic and deterministic forecasting of PV power output based on meteorological information, such as temperature, solar radiation, and historical PV system output data. The forecasting accuracy of PVPNet is determined by the mean absolute error (MAE) and root mean square error (RMSE) values. The results from the experiments show that the MAE and RMSE of the proposed algorithm are 109.4845 and 163.1513, respectively. The results prove that the prediction accuracy of the PVPNet outperforms other benchmark models, and the algorithm also effectively predicts complex time series with a high degree of volatility and irregularity.
Load balancing in cloud computing: A big picture

Scheduling or the allocation of user requests (tasks) in the cloud environment is an NP-hard optimization problem. According to the cloud infrastructure and the user requests, the cloud system is assigned with some load (that may be underloaded or overloaded or load is balanced). Situations like underloaded and overloaded cause different system failure concerning the power consumption, execution time, machine failure, etc. Therefore, load balancing is required to overcome all mentioned problems. This load balancing of tasks (those are may be dependent or independent) on virtual machines (VMs) is a significant aspect of task scheduling in clouds. There are various types of loads in the cloud network such as memory load, Computation (CPU) load, network load, etc. Load balancing is the mechanism of detecting overloaded and underloaded nodes and then balance the load among them. Researchers proposed various load balancing approaches in cloud computing to optimize different performance parameters. We have presented a taxonomy for the load balancing algorithms in the cloud. A brief explanation of considered performance parameters in the literature and their effects is presented in this paper. To analyze the performance of heuristic-based algorithms, the simulation is carried out in CloudSim simulator and the results are presented in detail.