Reviewerly/exHarmony huggingface dataset:
Cross-Generation Kinship Verification with Sparse Discriminative Metric

Kinship verification is a very important technique in many real-world applications, e.g., personal album organization, missing person investigation and forensic analysis. However, it is extremely difficult to verify a family pair with generation gap, e.g., father and son, since there exist both age gap and identity variation. It is essential to well fight off such challenges to achieve promising kinship verification performance. To this end, we propose a towards-young cross-generation model for effective kinship verification by mitigating both age and identity divergences. Specifically, we explore a conditional generative model to bring in an intermediate domain to bridge each pair. Thus, we could extract more effective features through deep architectures with a newly-designed Sparse Discriminative Metric Loss (SDM-Loss), which is exploited to involve the positive and negative information. Experimental results on kinship benchmark demonstrate the superiority of our proposed model by comparing with the state-of-the-art kinship verification methods.
Neural transfer learning for assigning diagnosis codes to EMRs

Electronic medical records (EMRs) are manually annotated by healthcare professionals and specialized medical coders with a standardized set of alphanumeric diagnosis and procedure codes, specifically from the International Classification of Diseases (ICD). Annotating EMRs with ICD codes is important for medical billing and downstream epidemiological studies. However, manually annotating EMRs is both time-consuming and error prone. In this paper, we explore the use of convolutional neural networks (CNNs) for automatic ICD coding. Because many codes occur infrequently, CNN performance is inhibited. Therefore, we propose supplementing EMR data with PubMed indexed biomedical research abstracts through neural transfer learning. Transfer learning is the process of “transferring” knowledge acquired from one task (the source task) to a different (target) task. For the source task, we train a CNN to predict medical subject headings (MeSH) using 1.6 million PubMed indexed biomedical abstracts. For the target task, we train a CNN on 71,463 real-world EMRs collected from the University of Kentucky (UKY) medical center to predict ICD diagnosis codes. We introduce a simple, yet effective, transfer learning methodology which avoids forgetting knowledge gained from the source task. Compared to our prior work using EMRs from the UKY medical center, we improve both the micro and macro F-scores by more than 8%. Likewise, compared to other transfer learning methods, our approach results in nearly 2% improvement in macro F-score. We show that transfer learning can improve CNN performance for EMR coding in the presence of data sparsity issues. Furthermore, we find that our proposed transfer learning approach outperforms other methods with respect to macro F-score. Finally, we analyze how transfer learning impacts codes with respect to code frequency. We find that we achieve greater improvement on infrequent codes compared to improvements in most frequent codes.
Categorizing and Inferring the Relationship between the Text and Image of Twitter Posts

Text in social media posts is frequently accompanied by images in order to provide content, supply context, or to express feelings. This paper studies how the meaning of the entire tweet is composed through the relationship between its textual content and its image. We build and release a data set of image tweets annotated with four classes which express whether the text or the image provides additional information to the other modality. We show that by combining the text and image information, we can build a machine learning approach that accurately distinguishes between the relationship types. Further, we derive insights into how these relationships are materialized through text and image content analysis and how they are impacted by user demographic traits. These methods can be used in several downstream applications including pre-training image tagging models, collecting distantly supervised data for image captioning, and can be directly used in end-user applications to optimize screen estate.
Sequential Monte Carlo with kernel embedded mappings: The mapping particle filter

In this work, a novel sequential Monte Carlo filter is introduced which aims at an efficient sampling of the state space. Particles are pushed forward from the prediction to the posterior density using a sequence of mappings that minimizes the Kullback-Leibler divergence between the posterior and the sequence of intermediate densities. The sequence of mappings represents a gradient flow based on the principles of local optimal transport. A key ingredient of the mappings is that they are embedded in a reproducing kernel Hilbert space, which allows for a practical and efficient Monte Carlo algorithm. The kernel embedding provides a direct means to calculate the gradient of the Kullback-Leibler divergence leading to quick convergence using well-known gradient-based stochastic optimization algorithms. Evaluation of the method is conducted in the chaotic Lorenz-63 system, the Lorenz-96 system, which is a coarse prototype of atmospheric dynamics, and an epidemic model that describes cholera dynamics. No resampling is required in the mapping particle filter even for long recursive sequences. The number of effective particles remains close to the total number of particles in all the sequence. Hence, the mapping particle filter does not suffer from sample impoverishment.
Color Crafting: Automating the Construction of Designer Quality Color Ramps

Visualizations often encode numeric data using sequential and diverging color ramps. Effective ramps use colors that are sufficiently discriminable, align well with the data, and are aesthetically pleasing. Designers rely on years of experience to create high-quality color ramps. However, it is challenging for novice visualization developers that lack this experience to craft effective ramps as most guidelines for constructing ramps are loosely defined qualitative heuristics that are often difficult to apply. Our goal is to enable visualization developers to readily create effective color encodings using a single seed color. We do this using an algorithmic approach that models designer practices by analyzing patterns in the structure of designer-crafted color ramps. We construct these models from a corpus of 222 expert-designed color ramps, and use the results to automatically generate ramps that mimic designer practices. We evaluate our approach through an empirical study comparing the outputs of our approach with designer-crafted color ramps. Our models produce ramps that support accurate and aesthetically pleasing visualizations at least as well as designer ramps and that outperform conventional mathematical approaches.
CHERIvoke

A lack of temporal safety in low-level languages has led to an epidemic of use-after-free exploits. These have surpassed in number and severity even the infamous buffer-overflow exploits violating spatial safety. Capability addressing can directly enforce spatial safety for the C language by enforcing bounds on pointers and by rendering pointers unforgeable. Nevertheless, an efficient solution for strong temporal memory safety remains elusive.
Artificial Intelligence Chatbots are New Recruiters

The purpose of the paper is to assess the artificial intelligence chatbots influence on recruitment process.The authors explore how chatbots offered service delivery to attract and candidates engagement in the recruitment process.The aim of the study is to identify chatbots impact across the recruitment process.The study is completely based on secondary sources like conceptual papers, peer reviewed articles, websites are used to present the current paper.The paper found that artificial intelligence chatbots are very productive tools in recruitment process and it will be helpful in preparing recruitment strategy for the Industry.Additionally, it focuses more on to resolve complex issues in the process of recruitment.Through the amalgamation of artificial intelligence recruitment process is increasing attention among the researchers still there is opportunity to explore in the field.The paper provided future research avenues in the field of chatbots and recruiters.
Knowing What’s Coming: Unpredictable Motion Causes More Motion Sickness

This study explores the role of anticipation in motion sickness. We compared three conditions varying in motion predictability and assessed the effect of anticipation on subsequent illness ratings using a within-subjects design.Anticipation is thought to play a role in motion sickness by reducing the discrepancy between sensed and expected sensory information. However, both the exact role and potential magnitude of anticipation on motion sickness are unknown.Participants (N = 17) were exposed to three 15-min conditions consisting of repeated fore-aft motion on a sled on a 40-m rail (1) at constant intervals and consistent motion direction, (2) at constant intervals but varied motion direction, and (3) at varied intervals but consistent motion direction. Conditions were otherwise identical in motion intensity and displacement, as they were composed of the same repetitions of identical blocks of motion. Illness ratings were recorded at 1-min intervals using an 11-point motion sickness scale.Average illness ratings after exposure were significantly lower for the predictable condition, compared with both the directionally unpredictable condition and the temporally unpredictable condition.Unpredictable motion is significantly more provocative compared with predictable motion. Findings suggest motion sickness results from a discrepancy between sensed and expected motion, rather than from unpreparedness to motion.This study underlines the importance of an individual's anticipation to motion in motion sickness. Furthermore, this knowledge could be used in domains such as that of autonomous vehicles to reduce carsickness.
Combining deep generative and discriminative models for Bayesian semi-supervised learning

Generative models can be used for a wide range of tasks, and have the appealing ability to learn from both labelled and unlabelled data. In contrast, discriminative models cannot learn from unlabelled data, but tend to outperform their generative counterparts in supervised tasks. We develop a framework to jointly train deep generative and discriminative models, enjoying the benefits of both. The framework allows models to learn from labelled and unlabelled data, as well as naturally account for uncertainty in predictive distributions, providing the first Bayesian approach to semi-supervised learning with deep generative models. We demonstrate that our blended discriminative and generative models outperform purely generative models in both predictive performance and uncertainty calibration in a number of semi-supervised learning tasks.
A Meta-Transfer Objective for Learning to Disentangle Causal Mechanisms

We propose to use a meta-learning objective that maximizes the speed of transfer on a modified distribution to learn how to modularize acquired knowledge. In particular, we focus on how to factor a joint distribution into appropriate conditionals, consistent with the causal directions. We explain when this can work, using the assumption that the changes in distributions are localized (e.g. to one of the marginals, for example due to an intervention on one of the variables). We prove that under this assumption of localized changes in causal mechanisms, the correct causal graph will tend to have only a few of its parameters with non-zero gradient, i.e. that need to be adapted (those of the modified variables). We argue and observe experimentally that this leads to faster adaptation, and use this property to define a meta-learning surrogate score which, in addition to a continuous parametrization of graphs, would favour correct causal graphs. Finally, motivated by the AI agent point of view (e.g. of a robot discovering its environment autonomously), we consider how the same objective can discover the causal variables themselves, as a transformation of observed low-level variables with no causal meaning. Experiments in the two-variable case validate the proposed ideas and theoretical results.
Uncertainty Based Under-Sampling for Learning Naive Bayes Classifiers Under Imbalanced Data Sets

In many real world classification tasks, all data classes are not represented equally. This problem, known also as the curse of class imbalanced in data sets, has a potential impact in the training procedure of a classifier by learning a model that will be biased in favor of the majority class. In this work at hand, an under-sampling approach is proposed, which leverages the usage of a Naive Bayes classifier, in order to select the most informative instances from the available training set, based on a random initial selection. The method starts by learning a Naive Bayes classification model on a small stratified initial training set. Afterwards, it iteratively teaches its base model with the instances that the model is most uncertain about and retrains it until some criteria are satisfied. The overall performance of the proposed method has been scrutinized through a rigorous experimental procedure, being tested using six multimodal data sets, as well as another forty-four standard benchmark data sets. The empirical results indicate that the proposed under-sampling method achieves comparable classification performance in contrast to other resampling techniques, regarding several proper metrics and having performed a suitable statistical testing procedure.
CAT: Customized Adversarial Training for Improved Robustness

Adversarial training has become one of the most effective methods for improving robustness of neural networks. However, it often suffers from poor generalization on both clean and perturbed data. Current robust training method always use a uniformed perturbation strength for every samples to generate adversarial examples during model training for improving adversarial robustness. However, we show it would lead worse training and generalizaiton error and forcing the prediction to match one-hot label. In this paper, therefore, we propose a new algorithm, named Customized Adversarial Training (CAT), which adaptively customizes the perturbation level and the corresponding label for each training sample in adversarial training. We first show theoretically the CAT scheme improves the generalization. Also, through extensive experiments, we show that the proposed algorithm achieves better clean and robust accuracy than previous adversarial training methods. The full version of this paper is available at https://arxiv.org/abs/2002.06789.
Review and Investigation of Simplified Rules Fuzzy Logic Speed Controller of High Performance Induction Motor Drives

The use of Fuzzy Logic Controller (FLC) as a speed controller for Induction Motor (IM) drives is garnering strong researchers’ interest since it has proven to achieve superior performance compared to conventional controllers. The aim of this study is to review and investigate the design, operations, and effects of rules reduction for FLC in IM drives. Based on the literature, the most commonly used technique to design FLC Membership Functions (MFs) rule-base and control model is based on engineering skills and experienced behavioral aspects of the controlled system. Simplified fuzzy rules approaches have been introduced to reduce the number of fuzzy rules in order to realize hardware implementation. This study discusses different simplified rules methods applied to IM drives. Most of the proposed methods shared a common drawback in that they lacked systematic procedures for designing FLC rule base. Therefore, this research proposed a methodological approach to designing and simplifying the FLC rule-base for IM drives based on dynamic step response and phase plane trajectory of the second order representation of IM drives systems. The proposed method presents guidance for designing FLC rule-base based on the general dynamic step response of the controlled system. Following the proposed method procedures, a (9, 25, 49) rules size has been designed and simplified to a (5, 7, 9) rules size. The effectiveness and accuracy of the designed rules as well as the simplified rules were verified by conducting simulation analysis of IM drives using MATLAB/Simulink environment. Step speed command performance comparisons were achieved with both standard designed and simplified rules at various speed demands. The simulation results showed that the simplified rules maintain the drive performance and produced similar behavior as the standard designed rules.
Forty years of Fuzzy Sets and Systems: A bibliometric analysis

Fuzzy Sets and Systems is a leading international journal in computer science and applied mathematics that was created in 1978. In 2018, the journal celebrated its 40th anniversary. The aim of this study is to present a bibliometric overview of the leading trends occurring in the journal between 1978 and 2016 by analysing the most productive and influential authors, institutions and countries as well as the publication and citation structure. Additionally, this work presents a graphical visualization of the bibliographic data by using the visualization of similarities (VOS) viewer and the science mapping analysis tool (SciMAT) software. The results show the strong growth of fuzzy set theory over time and a huge diversity of publications from all over the world, especially from Europe, North America and East Asia.
Recent Trends in Deep Learning Based Open-Domain Textual Question Answering Systems

Open-domain textual question answering (QA), which aims to answer questions from large data sources like Wikipedia or the web, has gained wide attention in recent years. Recent advancements in open-domain textual QA are mainly due to the significant developments of deep learning techniques, especially machine reading comprehension and neural-network-based information retrieval, which allows the models to continuously refresh state-of-the-art performances. However, a comprehensive review of existing approaches and recent trends is lacked in this field. To address this issue, we present a thorough survey to explicitly give the task scope of open-domain textual QA, overview recent key advancements on deep learning based open-domain textual QA, illustrate the models and acceleration methods in detail, and introduce open-domain textual QA datasets and evaluation metrics. Finally, we summary the models, discuss the limitations of existing works and potential future research directions.
Incrementalization of graph partitioning algorithms

This paper studies incremental graph partitioning. Given a (vertex-cut or edge-cut) partition C(G) of a graph G and updates ΔG to G, it is to compute changes ΔO to C(G), yielding a partition of the updated graph such that (a) the new partition is load-balanced, (b) its cut size is minimum, and (c) the changes ΔO are also minimum. We show that this tri-criteria optimization problem is NP-complete, even when ΔG has a constant size. Worse yet, it is unbounded, i.e., there exists no algorithm that computes such ΔO with a cost that is determined only by the changes ΔG and ΔO. We approach this by proposing to incrementalize widely-used graph partitioners A into heuristically-bounded incremental algorithms A Δ . Given graph G, updates ΔG to G and a partition A(G) of G by A, AΔ computes changes ΔO to A(G) such that (1) applying ΔO to A(G) produces a new partition of the updated graph although it may not be exactly the one derived by A, (2) it retains the same bounds on balance and cut sizes as A, and (3) ΔO is decided by ΔG alone. We show that we can deduce A Δ from both vertex-cut and edge-cut partitioners A, retaining their bounds. Using real-life and synthetic data, we verify the efficiency and partition quality of our incremental partitioners.
Multi-view face recognition using deep neural networks

F Face recognition has been widely used in modern intelligent systems, such as smart video surveillance, online payment, and intelligent access control system. Existing face recognition algorithms are prone to be attacked by various face presentation attacks (face-PAs), such as printed paper, video replay, and silicone masks. To optimally handle the aforementioned problems, we formulate a novel deep architecture to increase the accuracy of multi-view human face recognition. In particular, in the first place, a novel deep neural network is built for deeply encoding the face regions, where a novel face alignment algorithm is employed to localize the key points inside faces. Subsequently, we utilize the well-known PCA for reducing the dimensionality of the deep features and simultaneously, removing the redundant and contaminated visual features. Thereafter, we propose a joint Bayesian framework in order to evaluate the similarity of feature vectors and highly competitive face classification accuracy can be achieved. Comprehensive experiments were conducted on our compiled CAS-PEAL dataset and achieved a 98.52% face recognition performance. Moreover, our proposed face recognition system can robustly handle various face recognition attack under various contexts.
A Flexible and Lightweight Group Authentication Scheme

Internet of Things (IoT) networks are becoming a part of our daily lives, as the number of IoT devices around us are surging. The authentication of millions of connected things and the distribution and management of secret keys between these devices pose challenging research problems. Current one-to-one authentication schemes do not take the resource limitations of IoT devices into consideration. Nor do they address the scalability problem of massive machine type communication (mMTC) networks. Group authentication schemes (GAS), on the other hand, have emerged as novel approaches for many-to-many authentication problems. They can be used to simultaneously authenticate numerous resource-constrained devices. However, existing GAS are not energy efficient, and they do not provide enough security for widespread use. In this paper, we propose a lightweight GAS that significantly reduces energy consumption on devices, providing almost 80% energy savings when compared to the state-of-the-art solutions. Our approach is also resistant to the replay and man-in-the-middle attacks. The proposed approach also includes a solution for key agreement and key distribution problems in mMTC environments. Moreover, this approach can be used in both centralized and decentralized group authentication scenarios. The proposed approach has the potential to address the fast authentication requirements of the envisioned agile 6G networks, supported through aerial networking nodes.
Primal–Dual Methods for Large-Scale and Distributed Convex Optimization and Data Analytics

The augmented Lagrangian method (ALM) is a classical optimization tool that solves a given “difficult” (constrained) problem via finding solutions of a sequence of “easier” (often unconstrained) subproblems with respect to the original (primal) variable, wherein constraints satisfaction is controlled via the so-called dual variables. ALM is highly flexible with respect to how primal subproblems can be solved, giving rise to a plethora of different primal-dual methods. The powerful ALM mechanism has recently proved to be very successful in various large-scale and distributed applications. In addition, several significant advances have appeared, primarily on precise complexity results with respect to computational and communication costs in the presence of inexact updates and design and analysis of novel optimal methods for distributed consensus optimization. We provide a tutorial-style introduction to ALM and its variants for solving convex optimization problems in large-scale and distributed settings. We describe control-theoretic tools for the algorithms' analysis and design, survey recent results, and provide novel insights into the context of two emerging applications: federated learning and distributed energy trading.