Reviewerly/exHarmony huggingface dataset:
Continuous sign language recognition from wearable IMUs using deep capsule networks and game theory

Sign Language is used by the deaf community all over world. The work presented here proposes a novel one-dimensional deep capsule network (CapsNet) architecture for continuous Indian Sign Language recognition by means of signals obtained from a custom designed wearable IMU system. The performance of the proposed CapsNet architecture is assessed by altering dynamic routing between capsule layers. The proposed CapsNet yields improved accuracy values of 94% for 3 routings and 92.50% for 5 routings in comparison with the convolutional neural network (CNN) that yields an accuracy of 87.99%. Improved learning of the proposed architecture is also validated by spatial activations depicting excited units at the predictive layer. Finally, a novel non-cooperative pick-and-predict competition is designed between CapsNet and CNN. Higher value of Nash equilibrium for CapsNet as compared to CNN indicates the suitability of the proposed approach.
Safety Barrier Functions for Human-Robot Interaction with Industrial Manipulators

A change in the paradigm of Human-Robot Interaction has allowed to place robots nearby human operators, creating shared working environments. Industrial manipulators are becoming human helpers in different industrial tasks. As a consequence, human safety plays a leading role in the development of control algorithms. In this paper we propose an optimization-based algorithm that allows to avoid obstacles while minimizing the difference between the nominal acceleration input and the commanded one. Safety barriers are built around the robot links and allow to generate collision-free movements of the whole robot body. The algorithm is implemented on an Universal Robots UR5 in order to validate the proposed approach.
Let’s Ask Again: Refine Network for Automatic Question Generation

In this work, we focus on the task of Automatic Question Generation (AQG) where given a passage and an answer the task is to generate the corresponding question.It is desired that the generated question should be (i) grammatically correct (ii) answerable from the passage and (iii) specific to the given answer.An analysis of existing AQG models shows that they produce questions which do not adhere to one or more of the abovementioned qualities.In particular, the generated questions look like an incomplete draft of the desired question with a clear scope for refinement.To alleviate this shortcoming, we propose a method which tries to mimic the human process of generating questions by first creating an initial draft and then refining it.More specifically, we propose Refine Network (RefNet) which contains two decoders.The second decoder uses a dual attention network which pays attention to both (i) the original passage and (ii) the question (initial draft) generated by the first decoder.In effect, it refines the question generated by the first decoder, thereby making it more correct and complete.We evaluate RefNet on three datasets, viz., SQuAD, HOTPOT-QA, and DROP, and show that it outperforms existing state-of-the-art methods by 7-16% on all of these datasets.Lastly, we show that we can improve the quality of the second decoder on specific metrics, such as, fluency and answerability by explicitly rewarding revisions that improve on the corresponding metric during training.The code has been made publicly available 1 .
Improving Question Generation With to the Point Context

Question generation (QG) is the task of generating a question from a reference sentence and a specified answer within the sentence.A major challenge in QG is to identify answer-relevant context words to finish the declarative-to-interrogative sentence transformation.Existing sequence-to-sequence neural models achieve this goal by proximity-based answer position encoding under the intuition that neighboring words of answers are of high possibility to be answer-relevant.However, such intuition may not apply to all cases especially for sentences with complex answerrelevant relations.Consequently, the performance of these models drops sharply when the relative distance between the answer fragment and other non-stop sentence words that also appear in the ground truth question increases.To address this issue, we propose a method to jointly model the unstructured sentence and the structured answer-relevant relation (extracted from the sentence in advance) for question generation.Specifically, the structured answer-relevant relation acts as the to the point context and it thus naturally helps keep the generated question to the point, while the unstructured sentence provides the full information.Extensive experiments show that to the point context helps our question generation model achieve significant improvements on several automatic evaluation metrics.Furthermore, our model is capable of generating diverse questions for a sentence which conveys multiple relations of its answer fragment.
CPM-Nets: Cross Partial Multi-View Networks

Despite multi-view learning progressed fast in past decades, it is still challenging due to the difficulty in modeling complex correlation among different views, especially under the context of view missing. To address the challenge, we propose a novel framework termed Cross Partial Multi-View Networks (CPM-Nets). In this framework, we first give a formal definition of completeness and versatility for multi-view representation and then theoretically prove the versatility of the latent representation learned from our algorithm. To achieve the completeness, the task of learning latent multi-view representation is specifically translated to degradation process through mimicking data transmitting, such that the optimal tradeoff between consistence and complementarity across different views could be achieved. In contrast with methods that either complete missing views or group samples according to view-missing patterns, our model fully exploits all samples and all views to produce structured representation for interpretability. Extensive experimental results validate the effectiveness of our algorithm over existing state-of-the-arts.
A novel hybrid approach of SVM combined with NLP and probabilistic neural network for email phishing

Phishing attacks are one of the slanting cyber-attacks that apply socially engineered messages that are imparted to individuals from expert hackers going for tricking clients to uncover their delicate data, the most mainstream correspondence channel to those messages is through clients' emails. Phishing has turned into a generous danger for web clients and a noteworthy reason for money related misfortunes. Therefore, different arrangements have been created to handle this issue. Deceitful emails, also called phishing emails, utilize a scope of impact strategies to convince people to react, for example, promising a fiscal reward or summoning a feeling of criticalness. Regardless of far reaching alerts and intends to instruct clients to distinguish phishing sends, these are as yet a pervasive practice and a worthwhile business. The creators accept that influence, as a style of human correspondence intended to impact others, has a focal job in fruitful advanced tricks. Cyber criminals have ceaselessly propelling their techniques for assault. The current strategies to recognize the presence of such malevolent projects and to keep them from executing are static, dynamic and hybrid analysis. In this work we are proposing a hybrid methodology for phishing detection incorporating feature extraction and classification of the mails using SVM. At last, alongside the chose features, the PNN characterizes the spam mails from the genuine mails with more exactness and accuracy.
Using Vehicle Synthesis Generative Adversarial Networks to Improve Vehicle Detection in Remote Sensing Images

Vehicle detection based on very high-resolution (VHR) remote sensing images is beneficial in many fields such as military surveillance, traffic control, and social/economic studies. However, intricate details about the vehicle and the surrounding background provided by VHR images require sophisticated analysis based on massive data samples, though the number of reliable labeled training data is limited. In practice, data augmentation is often leveraged to solve this conflict. The traditional data augmentation strategy uses a combination of rotation, scaling, and flipping transformations, etc., and has limited capabilities in capturing the essence of feature distribution and proving data diversity. In this study, we propose a learning method named Vehicle Synthesis Generative Adversarial Networks (VS-GANs) to generate annotated vehicles from remote sensing images. The proposed framework has one generator and two discriminators, which try to synthesize realistic vehicles and learn the background context simultaneously. The method can quickly generate high-quality annotated vehicle data samples and greatly helps in the training of vehicle detectors. Experimental results show that the proposed framework can synthesize vehicles and their background images with variations and different levels of details. Compared with traditional data augmentation methods, the proposed method significantly improves the generalization capability of vehicle detectors. Finally, the contribution of VS-GANs to vehicle detection in VHR remote sensing images was proved in experiments conducted on UCAS-AOD and NWPU VHR-10 datasets using up-to-date target detection frameworks.
Some results on &lt;inline-formula&gt;&lt;tex-math id="M1111"&gt;\begin{document}$ \mathbb{Z}_p\mathbb{Z}_p[v] $\end{document}&lt;/tex-math&gt;&lt;/inline-formula&gt;-additive cyclic codes

<p style='text-indent:20px;'><inline-formula><tex-math id="M1">\begin{document}$ \mathbb{Z}_p\mathbb{Z}_p[v] $\end{document}</tex-math></inline-formula>-Additive cyclic codes of length <inline-formula><tex-math id="M2">\begin{document}$ (\alpha,\beta) $\end{document}</tex-math></inline-formula> can be viewed as <inline-formula><tex-math id="M3">\begin{document}$ R[x] $\end{document}</tex-math></inline-formula>-submodules of <inline-formula><tex-math id="M4">\begin{document}$ \mathbb{Z}_p[x]/(x^\alpha-1)\times R[x]/(x^\beta-1) $\end{document}</tex-math></inline-formula>, where <inline-formula><tex-math id="M5">\begin{document}$ R = \mathbb{Z}_p+v\mathbb{Z}_p $\end{document}</tex-math></inline-formula> with <inline-formula><tex-math id="M6">\begin{document}$ v^2 = v $\end{document}</tex-math></inline-formula>. In this paper, we determine the generator polynomials and the minimal generating sets of this family of codes as <inline-formula><tex-math id="M7">\begin{document}$ R[x] $\end{document}</tex-math></inline-formula>-submodules of <inline-formula><tex-math id="M8">\begin{document}$ \mathbb{Z}_p[x]/(x^\alpha-1)\times R[x]/(x^\beta-1) $\end{document}</tex-math></inline-formula>. We also determine the generator polynomials of the dual codes of <inline-formula><tex-math id="M9">\begin{document}$ \mathbb{Z}_p\mathbb{Z}_p[v] $\end{document}</tex-math></inline-formula>-additive cyclic codes. Some optimal <inline-formula><tex-math id="M10">\begin{document}$ \mathbb{Z}_p\mathbb{Z}_p[v] $\end{document}</tex-math></inline-formula>-linear codes and MDSS codes are obtained from <inline-formula><tex-math id="M11">\begin{document}$ \mathbb{Z}_p\mathbb{Z}_p[v] $\end{document}</tex-math></inline-formula>-additive cyclic codes. Moreover, we also get some quantum codes from <inline-formula><tex-math id="M12">\begin{document}$ \mathbb{Z}_p\mathbb{Z}_p[v] $\end{document}</tex-math></inline-formula>-additive cyclic codes.
High Quality, Lightweight and Adaptable TTS Using LPCNet

We present a lightweight adaptable neural TTS system with high quality output. The system is composed of three separate neural network blocks: prosody prediction, acoustic feature prediction and Linear Prediction Coding Net as a neural vocoder. This system can synthesize speech with close to natural quality while running 3 times faster than real-time on a standard CPU. The modular setup of the system allows for simple adaptation to new voices with a small amount of data. We first demonstrate the ability of the system to produce high quality speech when trained on large, high quality datasets. Following that, we demonstrate its adaptability by mimicking unseen voices using 5 to 20 minutes long datasets with lower recording quality. Large scale Mean Opinion Score quality and similarity tests are presented, showing that the system can adapt to unseen voices with quality gap of 0.12 and similarity gap of 3% compared to natural speech for male voices and quality gap of 0.35 and similarity of gap of 9 % for female voices.
Radio Galaxy Zoo: Unsupervised Clustering of Convolutionally Auto-encoded Radio-astronomical Images

This paper demonstrates a novel and efficient unsupervised clustering method with the combination of a self-organizing map (SOM) and a convolutional autoencoder. The rapidly increasing volume of radio-astronomical data has increased demand for machine-learning methods as solutions to classification and outlier detection. Major astronomical discoveries are unplanned and found in the unexpected, making unsupervised machine learning highly desirable by operating without assumptions and labeled training data. Our approach shows SOM training time is drastically reduced and high-level features can be clustered by training on auto-encoded feature vectors instead of raw images. Our results demonstrate this method is capable of accurately separating outliers on a SOM with neighborhood similarity and K-means clustering of radio-astronomical features. We present this method as a powerful new approach to data exploration by providing a detailed understanding of the morphology and relationships of Radio Galaxy Zoo (RGZ) data set image features which can be applied to new radio survey data.
Nonunitary Operations for Ground-State Calculations in Near-Term Quantum Computers

We introduce a quantum Monte Carlo inspired reweighting scheme to accurately compute energies from optimally short quantum circuits. This effectively hybrid quantum-classical approach features both entanglement provided by a short quantum circuit, and the presence of an effective non-unitary operator at the same time. The functional form of this projector is borrowed from classical computation and is able to filter-out high-energy components generated by a sub-optimal variational quantum heuristic ansatz. The accuracy of this approach is demonstrated numerically in finding energies of entangled ground-states of many-body lattice models. We demonstrate a practical implementation on IBM quantum hardwares up to an 8 qubits circuit.
AirwayNet: A Voxel-Connectivity Aware Approach for Accurate Airway Segmentation Using Convolutional Neural Networks

Airway segmentation on CT scans is critical for pulmonary disease diagnosis and endobronchial navigation. Manual extraction of airway requires strenuous efforts due to the complicated structure and various appearance of airway. For automatic airway extraction, convolutional neural networks (CNNs) based methods have recently become the state-of-the-art approach. However, there still remains a challenge for CNNs to perceive the tree-like pattern and comprehend the connectivity of airway. To address this, we propose a voxel-connectivity aware approach named AirwayNet for accurate airway segmentation. By connectivity modeling, conventional binary segmentation task is transformed into 26 tasks of connectivity prediction. Thus, our AirwayNet learns both airway structure and relationship between neighboring voxels. To take advantage of context knowledge, lung distance map and voxel coordinates are fed into AirwayNet as additional semantic information. Compared to existing approaches, AirwayNet achieved superior performance, demonstrating the effectiveness of the network's awareness of voxel connectivity.
Deep Feature Fusion Model for Sentence Semantic Matching

Sentence semantic matching (SSM) is a fundamental research in solving natural language processing tasks such as question answering and machine translation. The latest SSM research benefits from deep learning techniques by inc... | Find, read and cite all the research you need on Tech Science Press
Deep Structured Neural Network for Event Temporal Relation Extraction

We propose a novel deep structured learning framework for event temporal relation extraction.The model consists of 1) a recurrent neural network (RNN) to learn scoring functions for pair-wise relations, and 2) a structured support vector machine (SSVM) to make joint predictions.The neural network automatically learns representations that account for long-term contexts to provide robust features for the structured model, while the SSVM incorporates domain knowledge such as transitive closure of temporal relations as constraints to make better globally consistent decisions.By jointly training the two components, our model combines the benefits of both data-driven learning and knowledge exploitation.Experimental results on three highquality event temporal relation datasets (TCR, MATRES, and TB-Dense) demonstrate that incorporated with pre-trained contextualized embeddings, the proposed model achieves significantly better performances than the stateof-the-art methods on all three datasets.We also provide thorough ablation studies to investigate our model.
Data Sharing and Privacy for Patient IoT Devices Using Blockchain

Once a fitness fad, wearable and other related Internet of Things (IoT) devices are fast becoming common place in many different smart city applications such as healthcare. However, IoT devices, particularly inexpensive devices, often trade security and privacy for usability. One solution to protect privacy in the healthcare domain which has begun to be explored is blockchain-based technology. However, there are a number of limitations underpinning the use of blockchain, which limits its adoption particularly in applications that require low energy and computational footprints. In this paper, we present a transactional protocol for remote patient monitoring using directed acyclic graphs. We use a newer blockchain protocol called GHOSTDAG in both a public blockchain and a private blockchain. Our novel proposed solution aims to resolve known security issues for healthcare, without affecting scalability (a feature of classic blockchain architecture).
ESNet: An Efficient Symmetric Network for Real-Time Semantic Segmentation

The recent years have witnessed great advances for semantic segmentation using deep convolutional neural networks (DCNNs). However, a large number of convolutional layers and feature channels lead to semantic segmentation as a computationally heavy task, which is disadvantage to the scenario with limited resources. In this paper, we design an efficient symmetric network, called (ESNet), to address this problem. The whole network has nearly symmetric architecture, which is mainly composed of a series of factorized convolution unit (FCU) and its parallel counterparts. On one hand, the FCU adopts a widely-used 1D factorized convolution in residual layers. On the other hand, the parallel version employs a transform-split-transform-merge strategy in the designment of residual module, where the split branch adopts dilated convolutions with different rate to enlarge receptive field. Our model has nearly 1.6M parameters, and is able to be performed over 62 FPS on a single GTX 1080Ti GPU. The experiments demonstrate that our approach achieves state-of-the-art results in terms of speed and accuracy trade-off for real-time semantic segmentation on CityScapes dataset.
Deep learning for clustering of multivariate clinical patient trajectories with missing values

Abstract Background Precision medicine requires a stratification of patients by disease presentation that is sufficiently informative to allow for selecting treatments on a per-patient basis. For many diseases, such as neurological disorders, this stratification problem translates into a complex problem of clustering multivariate and relatively short time series because (i) these diseases are multifactorial and not well described by single clinical outcome variables and (ii) disease progression needs to be monitored over time. Additionally, clinical data often additionally are hindered by the presence of many missing values, further complicating any clustering attempts. Findings The problem of clustering multivariate short time series with many missing values is generally not well addressed in the literature. In this work, we propose a deep learning–based method to address this issue, variational deep embedding with recurrence (VaDER). VaDER relies on a Gaussian mixture variational autoencoder framework, which is further extended to (i) model multivariate time series and (ii) directly deal with missing values. We validated VaDER by accurately recovering clusters from simulated and benchmark data with known ground truth clustering, while varying the degree of missingness. We then used VaDER to successfully stratify patients with Alzheimer disease and patients with Parkinson disease into subgroups characterized by clinically divergent disease progression profiles. Additional analyses demonstrated that these clinical differences reflected known underlying aspects of Alzheimer disease and Parkinson disease. Conclusions We believe our results show that VaDER can be of great value for future efforts in patient stratification, and multivariate time-series clustering in general.
Clinically Accurate Chest X-Ray Report Generation.

The automatic generation of radiology reports given medical radiographs has significant potential to operationally and improve clinical patient care. A number of prior works have focused on this problem, employing advanced methods from computer vision and natural language generation to produce readable reports. However, these works often fail to account for the particular nuances of the radiology domain, and, in particular, the critical importance of clinical accuracy in the resulting generated reports. In this work, we present a domain-aware automatic chest X-ray radiology report generation system which first predicts what topics will be discussed in the report, then conditionally generates sentences corresponding to these topics. The resulting system is fine-tuned using reinforcement learning, considering both readability and clinical accuracy, as assessed by the proposed Clinically Coherent Reward. We verify this system on two datasets, Open-I and MIMIC-CXR, and demonstrate that our model offers marked improvements on both language generation metrics and CheXpert assessed accuracy over a variety of competitive baselines.
Individuality- and Commonality-Based Multiview Multilabel Learning

In multiview multilabel learning, each object is represented by several heterogeneous feature representations and is also annotated with a set of discrete nonexclusive labels. Previous studies typically focus on capturing the shared latent patterns among multiple views, while not sufficiently considering the diverse characteristics of individual views, which can cause performance degradation. In this article, we propose a novel approach [individuality- and commonality-based multiview multilabel learning (ICM2L)] to explicitly explore the individuality and commonality information of multilabel multiple view data in a unified model. Specifically, a common subspace is learned across different views to capture the shared patterns. Then, multiple individual classifiers are exploited to explore the characteristics of individual views. Next, an ensemble strategy is adopted to make a prediction. Finally, we develop an alternative solution to jointly optimize our model, which can enhance the robustness of the proposed model toward rare labels and reinforce the reciprocal effects of individuality and commonality among heterogeneous views, and thus further improve the performance. Experiments on various real-word datasets validate the effectiveness of ICM2L against the state-of-the-art solutions, and ICM2L can leverage the individuality and commonality information to achieve an improved performance as well as to enhance the robustness toward rare labels.