Reviewerly/exHarmony huggingface dataset:
A Question of Access: Exploring the Perceived Benefits and Barriers of Intelligent Voice Assistants for Improving Access to Consumer Health Resources Among Low-Income Older Adults

Intelligent voice assistants (IVAs) such as Amazon Echo and Google Home present a promising opportunity to improve access to consumer health information and resources for older adults. However, researchers know little about older adults’ opinions of using IVAs for these potentially critical tasks, particularly those with already limited access. In this paper, we explore older adults’ views about IVAs for consumer health and wellness information with the goal of better understanding what they envision as benefits and barriers of using such technology in the future. We shared an IVA prototype with ten older adults (60 years of age or older). We interviewed them about how a similar system might impact their access to consumer health information. Participants saw the potential for IVAs to improve their search experiences and support them with other health tasks. However, participants were also concerned about adopting an IVA for health due to access barriers, confidentiality risks, and concerns about receiving trusted information. Based on our findings, we discuss considerations for designing IVAs for underserved, older adult populations.
Differential evolution and sine cosine algorithm based novel hybrid multi-objective approaches for numerical association rule mining

In association rules mining from data that have numeric-valued attributes, automatically adjusting the attribute intervals at the time of the mining process without a preprocess is very critical for preventing data loss and attribute interactions. In this paper, differential evolution and sine cosine algorithm based novel hybrid multi-objective evolutionary optimization methods are proposed for rapidly and directly mining the reduced high-quality numerical association rules by simultaneously adjusting the relevant intervals of related attributes without finding the frequent itemsets. These algorithms perform a global search and find the high-quality rules set in only one execution by modeling the rule mining task as a multi-objective problem that simultaneously meets different conflicting metrics. The algorithms proposed in this paper ensure the discovered rules to have high confidence and support and to be comprehensible. The proposed methods automate the rule mining process by directly finding the minimum intervals for the attributes and eliminating the need for minimum confidence and minimum support determined beforehand for each data set. The performances of new algorithms proposed in this study were tested with those of the state-of-the-art algorithms. The results show superiority of the proposed methods on the data sets that contain fewer attributes and higher number of instances.
The Language of Derogation and Hate: Functions, Consequences, and Reappropriation

Over the last decades, the use of explicit derogatory language (e.g., hate speech, slurs, micro-insults) has risen in many countries. We provide an overview on blatant language discrimination, including its psychological antecedents and consequences. After presenting a working definition of derogatory language and describing its prevalence, we discuss the social functions it serves and the role it plays in identity protection, in legitimizing group hierarchies, and in establishing and enforcing group norms. Drawing from both the socio-cognitive and discursive traditions in social psychology, it is argued that the language people are exposed to and the language they employ, shape the way they think and construct reality. We also consider two ways in which targeted groups may respond to derogatory language, specifically confrontation and reappropriation. Finally, we address challenges for future research, in particular the need for more cross disciplinary research to ebb the growing proliferation of hate speech on digital media which has become a global international concern.
GBK-means clustering algorithm: An improvement to the K-means algorithm based on the bargaining game

Due to its simplicity, versatility and the diversity of applications to which it can be applied, k-means is one of the well-known algorithms for clustering data. The foundation of this algorithm is based on the distance measure. However, the traditional k-means has some weaknesses that appear in some data sets related to real applications, the most important of which is to consider only the distance criterion for clustering. Various studies have been conducted to address each of these weaknesses to achieve a balance between quality and efficiency. In this paper, a novel k-means variant of the original algorithm is proposed. This approach leverages the power of bargaining game modelling in the k-means algorithm for clustering data. In this novel setting, cluster centres compete with each other to attract the largest number of similar objectives or entities to their cluster. Thus, the centres keep changing their positions so that they have smaller distances with the maximum possible data than other cluster centres. We name this new algorithm the game-based k-means (GBK-means) algorithm. To show the superiority and efficiency of GBK-means over conventional clustering algorithms, namely, k-means and fuzzy k-means, we use the following syntactic and real-world data sets: (1) a series of two-dimensional syntactic data sets; and (2) ten benchmark data sets that are widely used in different clustering studies. The evaluation criteria show GBK-means is able to cluster data more accurately than classical algorithms based on eight evaluation metrics, namely F-measure, the Dunn index (DI), the rand index (RI), the Jaccard index (JI), normalized mutual information (NMI), normalized variation of information (NVI), the measure of concordance and error rate (ER).
JOLO-GCN: Mining Joint-Centered Light-Weight Information for Skeleton-Based Action Recognition

Skeleton-based action recognition has attracted research attentions in recent years. One common drawback in currently popular skeleton-based human action recognition methods is that the sparse skeleton information alone is not sufficient to fully characterize human motion. This limitation makes several existing methods incapable of correctly classifying action categories which exhibit only subtle motion differences. In this paper, we propose a novel framework for employing human pose skeleton and joint-centered light-weight information jointly in a two-stream graph convolutional network, namely, JOLO-GCN. Specifically, we use Joint-aligned optical Flow Patches (JFP) to capture the local subtle motion around each joint as the pivotal joint-centered visual information. Compared to the pure skeleton-based baseline, this hybrid scheme effectively boosts performance, while keeping the computational and memory overheads low. Experiments on the NTU RGB+D, NTU RGB+D 120, and the Kinetics-Skeleton dataset demonstrate clear accuracy improvements attained by the proposed method over the state-of-the-art skeleton-based methods.
Proposal Learning for Semi-Supervised Object Detection

In this paper, we focus on semi-supervised object detection to boost performance of proposal-based object detectors (a.k.a. two-stage object detectors) by training on both labeled and unlabeled data. However, it is non-trivial to train object detectors on unlabeled data due to the un-availability of ground truth labels. To address this problem, we present a proposal learning approach to learn proposal features and predictions from both labeled and unlabeled data. The approach consists of a self-supervised proposal learning module and a consistency-based proposal learning module. In the self-supervised proposal learning module, we present a proposal location loss and a contrastive loss to learn context-aware and noise-robust proposal features respectively. In the consistency-based proposal learning module, we apply consistency losses to both bounding box classification and regression predictions of proposals to learn noise-robust proposal features and predictions. Our approach enjoys the following benefits: 1) encouraging more context information to be delivered in the proposals learning procedure; 2) noisy proposal features and enforcing consistency to allow noise-robust object detection; 3) building a general and high-performance semi-supervised object detection framework, which can be easily adapted to proposal-based object detectors with different backbone architectures. Experiments are conducted on the COCO dataset with all available labeled and unlabeled data. Results demonstrate that our approach consistently improves the performance of fully-supervised baselines. In particular, after combining with data distillation [39], our approach improves AP by about 2.0% and 0.9% on average compared to fully-supervised baselines and data distillation baselines respectively.
Cloud/Edge Computing Resource Allocation and Pricing for Mobile Blockchain: An Iterative Greedy and Search Approach

Blockchain can provide a dependable environment for the Internet of Things (IoT), while the high computing power and energy required by blockchain hinder its applications in IoT. Offloading the computation at the resource-limited IoT devices to a cloud/edge computing service provider (CESP) is a feasible solution to the execution of computation-intensive blockchain tasks. The CESP provides computing resources to IoT users with a cloud and multiple edge servers that work collaboratively such that the users are able to perform mobile blockchain services. Resource allocation and pricing of computing resources at the cloud/edges have a significant impact on the revenues of CESP and users. Most of the existing works on the cooperative edge-cloud for computation offloading assumes that a user is mapped to a prespecified edge server or the cloud. However, the CESP may choose a server from either the edge servers or the cloud to run the offloaded tasks by jointly considering the cost and income of the service provisioning. In this article, we formulate a Stackelberg game with CESP as the leader and users as the followers for cloud/edge computing resource management. We prove the existence of Stackelberg equilibrium and analyze the equilibrium. We then model the resource allocation and pricing at the CESP as a mixed-integer programming problem (MIP) with the objective to optimize the CESP's revenue and propose an efficient iterative greedy-and-search-based resource allocation and pricing algorithm (IGS). The algorithm solves two subproblems comprising the CESP's revenue optimization problem: resource allocation under a given resource price and resource pricing based on a specified resource allocation scheme. The first subproblem evaluates where to execute the computing tasks via a greedy-and-search-based approach, whereas the second subproblem estimates the resource price through golden section search. We conduct experiments through simulations. Simulation results show that the proposed algorithm can effectively improve the revenue of both the CESP and the IoT terminals.
A Visually Interpretable Deep Learning Framework for Histopathological Image-Based Skin Cancer Diagnosis

Owing to the high incidence rate and the severe impact of skin cancer, the precise diagnosis of malignant skin tumors is a significant goal, especially considering treatment is normally effective if the tumor is detected early. Limited published histopathological image sets and the lack of an intuitive correspondence between the features of lesion areas and a certain type of skin cancer pose a challenge to the establishment of high-quality and interpretable computer-aided diagnostic (CAD) systems. To solve this problem, a light-weight attention mechanism-based deep learning framework, namely, DRANet, is proposed to differentiate 11 types of skin diseases based on a real histopathological image set collected by us during the last 10 years. The CAD system can output not only the name of a certain disease but also a visualized diagnostic report showing possible areas related to the disease. The experimental results demonstrate that the DRANet obtains significantly better performance than baseline models (i.e., InceptionV3, ResNet50, VGG16, and VGG19) with comparable parameter size and competitive accuracy with fewer model parameters. Visualized results produced by the hidden layers of the DRANet actually highlight part of the class-specific regions of diagnostic points and are valuable for decision making in the diagnosis of skin diseases.
Hypergraph Neural Network for Skeleton-Based Action Recognition

Recently, skeleton-based human action recognition has attracted a lot of research attention in the field of computer vision. Graph convolutional networks (GCNs), which model the human body skeletons as spatial-temporal graphs, have shown excellent results. However, the existing methods only focus on the local physical connection between the joints, and ignore the non-physical dependencies among joints. To address this issue, we propose a hypergraph neural network (Hyper-GNN) to capture both spatial-temporal information and high-order dependencies for skeleton-based action recognition. In particular, to overcome the influence of noise caused by unrelated joints, we design the Hyper-GNN to extract the local and global structure information via the hyperedge (i.e., non-physical connection) constructions. In addition, the hypergraph attention mechanism and improved residual module are induced to further obtain the discriminative feature representations. Finally, a three-stream Hyper-GNN fusion architecture is adopted in the whole framework for action recognition. The experimental results performed on two benchmark datasets demonstrate that our proposed method can achieve the best performance when compared with the state-of-the-art skeleton-based methods.
Private blockchain-envisioned multi-authority CP-ABE-based user access control scheme in IIoT

Recent advances in Low Power Wide Area Network (LPWAN) are expected to augment the already prodigious proliferation of Industrial Internet of Things (IIoT). However, this unrepresented growth is tinged by the uncertainty of possible challenges in security and privacy. In this work, we propose a novel blockchain-envisioned fine grained user access control scheme for data security and scalability in IIoT environment. The proposed scheme supports multiple attribute authorities and also a constant size key and ciphertext. The data gathered by the IoT smart devices are encrypted using the cipher-policy attribute based encryption (CP-ABE) and sent to their nearby gateway nodes. Later, the gateway nodes form the transactions from the encrypted data from the smart devices which are used to form partial blocks. The partial blocks are then forwarded to the cloud server(s) in the peer-to-peer (P2P) network to convert them into full blocks, which are verified, mined and added into the blockchain using the voting-based practical Byzantine fault tolerance (PBFT) consensus algorithm. The proposed scheme also allows a user to access the secure data stored in the blocks into the blockchain using the CP-ABE mechanism. The security analysis demonstrates the robustness of the proposed scheme against various attacks, and the comparative study with related relevant schemes also highlights the advantage of the proposed scheme over existing approaches. Finally, a blockchain implementation of the presented scheme summarizes the computational costs for a varied number of transactions per block, and also for a varied number of blocks mined in the blockchain.
A Lifelong Learning Approach to Mobile Robot Navigation

This letter presents a self-improving lifelong learning framework for a mobile robot navigating in different environments. Classical static navigation methods require environment-specific in-situ system adjustment, e.g., from human experts, or may repeat their mistakes regardless of how many times they have navigated in the same environment. Having the potential to improve with experience, learning-based navigation is highly dependent on access to training resources, e.g., sufficient memory and fast computation, and is prone to forgetting previously learned capability, especially when facing different environments. In this work, we propose Lifelong Learning for Navigation (LLfN) which (1) improves a mobile robot's navigation behavior purely based on its own experience, and (2) retains the robot's capability to navigate in previous environments after learning in new ones. LLfN is implemented and tested entirely onboard a physical robot with a limited memory and computation budget.
Less complexity one-class classification approach using construction error of convolutional image transformation network

One-class classification is a machine learning problem, where training data has only one class. The objective is to determine if the input data is seen class or unseen class. Traditional deep learning algorithms are not suitable for this task since the algorithm can predict only class in training data. In this paper, the one-class classification algorithm using construction error of image transformation network (OCITN) is proposed. In particular, image transformation network (ITN) is introduced as a subtask, which transforms input image into one image, namely goal image. Moreover, the error of ITN, namely construction error (CE), is computed as a distance metric between the goal image and model output. ITN model is trained using only one-class images and is applied for testing images. Since the model is trained with only one-class images, the CE for one-class is small relative to other classes. Thus, one-class classification is made determining CE is large or small. The proposed method is experimented with using MNIST, Fashion MNIST, CIFAR10, CIFAR100, and Cat-vs-Dog datasets. OCITN shows good results where the goal image has high entropy. Additionally, the extension of OCITN, namely OCITNE, is implemented. This method shows the state of the art performance in MNIST (98.0), Fashion MNIST(95.6), and acceptable performance in CIFAR10(78.4). Furthermore, these methods provide high-speed processing, OCITN process 5291 images, and OCITNE 1261 images per second, 137 times and 33 times faster than state of the art. The source code used in this paper can be downloaded from: https://github.com/ToshiHayashi/OCITN.
Learning Person Re-Identification Models From Videos With Weak Supervision

Most person re-identification methods, being supervised techniques, suffer from the burden of massive annotation requirement. Unsupervised methods overcome this need for labeled data, but perform poorly compared to the supervised alternatives. In order to cope with this issue, we introduce the problem of learning person re-identification models from videos with weak supervision. The weak nature of the supervision arises from the requirement of video-level labels, i.e. person identities who appear in the video, in contrast to the more precise frame-level annotations. Towards this goal, we propose a multiple instance attention learning framework for person re-identification using such video-level labels. Specifically, we first cast the video person re-identification task into a multiple instance learning setting, in which person images in a video are collected into a bag. The relations between videos with similar labels can be utilized to identify persons, on top of that, we introduce a co-person attention mechanism which mines the similarity correlations between videos with person identities in common. The attention weights are obtained based on all person images instead of person tracklets in a video, making our learned model less affected by noisy annotations. Extensive experiments demonstrate the superiority of the proposed method over the related methods on two weakly labeled person re-identification datasets.
Analysis of the implementation of teaching and learning processes at Catalan schools during the Covid-19 lockdown

Most countries around the world have temporarily closed educational institutions with the aim of containing the spread of the Covid-19 pandemic. How have schools overcome these challenges and delivered education during the confinement period? The purpose of this research was to analyse how primary and secondary schools in Catalonia (Spain) implemented the teaching and learning process during the lockdown, based on 48 semi-structured interviews with school principals from different types of schools, located in urban and rural environments, and from diverse socioeconomic statuses. This article shows that there is a digital divide in students and teachers, emotional accompaniment as a need for online learning, older students are more autonomous and self-regulate better their own learning process, each school used their own strategy because there was no programme prepared for emergency situations, teachers had difficulties in self-regulating their work and communication with families became essential.
A Comparative Study on Word Embeddings in Deep Learning for Text Classification

Word embeddings act as an important component of deep models for providing input features in downstream language tasks, such as sequence labelling and text classification. In the last decade, a substantial number of word embedding methods have been proposed for this purpose, mainly falling into the categories of classic and context-based word embeddings. In this paper, we conduct controlled experiments to systematically examine both classic and contextualised word embeddings for the purposes of text classification. To encode a sequence from word representations, we apply two encoders, namely CNN and BiLSTM, in the downstream network architecture. To study the impact of word embeddings on different datasets, we select four benchmarking classification datasets with varying average sample length, comprising both single-label and multi-label classification tasks. The evaluation results with confidence intervals indicate that CNN as the downstream encoder outperforms BiLSTM in most situations, especially for document context-insensitive datasets. This study recommends choosing CNN over BiLSTM for document classification datasets where the context in sequence is not as indicative of class membership as sentence datasets. For word embeddings, concatenation of multiple classic embeddings or increasing their size does not lead to a statistically significant difference in performance despite a slight improvement in some cases. For context-based embeddings, we studied both ELMo and BERT. The results show that BERT overall outperforms ELMo, especially for long document datasets. Compared with classic embeddings, both achieve an improved performance for short datasets while the improvement is not observed in longer datasets.
Real‐Time Earthquake Early Warning With Deep Learning: Application to the 2016 M 6.0 Central Apennines, Italy Earthquake

Earthquake early warning systems are required to report earthquake locations and magnitudes as quickly as possible before the damaging S wave arrival to mitigate seismic hazards. Deep learning techniques provide potential for extracting earthquake source information from full seismic waveforms instead of seismic phase picks. We developed a novel deep learning earthquake early warning system that utilizes fully convolutional networks to simultaneously detect earthquakes and estimate their source parameters from continuous seismic waveform streams. The system determines earthquake location and magnitude as soon as one station receives earthquake signals and evolutionarily improves the solutions by receiving continuous data. We apply the system to the 2016 Mw 6.0 earthquake in Central Apennines, Italy and its subsequent sequence. Earthquake locations and magnitudes can be reliably determined as early as four seconds after the earliest P phase, with mean error ranges of 6.8-3.7 km and 0.31-0.23, respectively.