Reviewerly/exHarmony huggingface dataset:
MedBloc: A Blockchain-Based Secure EHR System for Sharing and Accessing Medical Data

In New Zealand, there is currently no shared Electronic Health Record (EHR) system integrated between major healthcare organisations, such as hospitals, medical centres, and specialists. Thanks to its characteristics, blockchain technology can be a suitable platform for building a large-scale EHR system for New Zealand. In this paper, we present MedBloc, a blockchain-based secure EHR system that enables patients and healthcare providers to access and share health records in a usable yet privacy-preserving manner. MedBloc captures a longitudinal view of the patient's health story and enables patients to give or withdraw consent for regulating access to their records. To protect medical data, MedBloc uses an encryption mechanism and enforces a smart contract based access control mechanism for regulating access. MedBloc not only demonstrates how the blockchain can establish New Zealand's first shared EHR system but it shows how blockchain can potentially disrupt the entire medical technology domain.
Elucidating the Auxiliary Particle Filter via Multiple Importance Sampling [Lecture Notes]

Sequential Monte Carlo methods, also known as particle filtering, have seen an explosion of development both in theory and applications. The publication of [1] sparked huge interest in the area of sequential signal processing, particularly in sequential filtering. Ever since, the number of publications in which particle filtering plays a prominent role has continued to grow. An early reference of development is [2] and later tutorials include [3]-[9]. With particle filtering, we estimate probability density functions (pdfs) of interest by probability mass functions, whose masses are placed at randomly chosen locations (particles) and whose weights are assigned to the particles. The particle filter (PF) proposed in [1] is often called the bootstrap PF (BPF), and although it is not optimal, it is the most often used filter by practitioners. A filter that became also popular is known as the auxiliary PF (APF) and was proposed in [10]. With the APF, the objective is to generate better particles at each time step compared to those generated with the BPF, thereby improving filtering accuracy. In this article, we derive the APF from a new perspective, one based on interpreting the APF from the multiple importance sampling (MIS) paradigm. The derivation also shows its relationship with the BPF.
Return and volatility spillovers between Bitcoin and other asset classes in Turkey

Purpose With a substantial return and volatility characteristic of Bitcoin, which may be seen as a new category of investment assets, better understanding of the nature of return and volatility spillover can help investors and regulators in achieving the potential goal from portfolio diversification. The paper aims to discuss these issues. Design/methodology/approach This paper explores the return and volatility transmission between the Bitcoin, as the largest cryptocurrency, and other traditional asset classes, namely stock, bond and currencies from the standpoint of Turkey over the period July, 2010–June, 2018 using the newly developed multivariate econometric technique, VAR–GARCH, in mean framework with the BEKK representation. Findings The empirical results reveal the existence of the positive unilateral return spillovers from the bond market to Bitcoin market. Regarding the results of shock and volatility spillovers, there exists strong evidence of bidirectional cross-market shock and volatility spillover effects between Bitcoin and all other financial asset classes, except US Dollar exchange rate. Originality/value The important extention is the adoption of a newly developed multivariate econometric technique, VAR–GARCH, in mean framework with the BEKK representation, proposed by Engle and Kroner (1995), which is employed for the first time specifically to examine the extent of integration in terms of volatility and return between Bitcoin and key asset classes. Second, Bitcoin has experienced a rapid growth since around a decade and a number of investors are showing interest in its potential as an integrative part of portfolio diversification. The information provided by empirical results gives empirical bases from which to address topics concerning hedging purposes and optimal portfolio allocation. It is also increasingly important to analyze the current behavior of Bitcoin in relation to other assets to provide policy makers and regulatory bodies with guidance on the role of the Bitcoin as an investment asset in Turkey. Thus, this is the first serious attempt at exploring the potential for Bitcoin to offer diversification opportunities in the context of Turkey.
Reinforcement-based denoising of distantly supervised NER with partial annotation

Existing named entity recognition (NER) systems rely on large amounts of human-labeled data for supervision.However, obtaining large-scale annotated data is challenging particularly in specific domains like health-care, e-commerce and so on.Given the availability of domain specific knowledge resources, (e.g., ontologies, dictionaries), distant supervision is a solution to generate automatically labeled training data to reduce human effort.The outcome of distant supervision for NER, however, is often noisy.False positive and false negative instances are the main issues that reduce performance on this kind of auto-generated data.In this paper, we explore distant supervision in a supervised setup.We adopt a technique of partial annotation to address false negative cases and implement a reinforcement learning strategy with a neural network policy to identify false positive instances.Our results establish a new state-of-the-art on four benchmark datasets taken from different domains and different languages.We then go on to show that our model reduces the amount of manually annotated data required to perform NER in a new domain.
Lightweighted Secure Searching Over Public-Key Ciphertexts for Edge-Cloud-Assisted Industrial IoT Devices

For the industrial Internet of Things (IIoT), public-key encryption with keyword search (PEKS) is a type of applicable and promising encryption technique to maintain the data stored in clouds secure and searchable. To further improve the efficiency of searching, it is popular to introduce edge computing near the IIoT as the substitute for a cloud. However, the straightforward collaboration of the two techniques performs negatively in latency-sensitive applications since the sluggish encryption of PEKS by IIoT devices negates the instant reaction of edges. To meet this challenge, in this article, we exploit the capability of the edge-cloud architecture and propose a lightweight-designed scheme called edge-aided searchable public-key encryption (ESPE). It allows IIoT devices to delegate their costly cryptographic operations to the nearby edge for fast computing and guarantees that all outsourced ciphertexts are semantically secure. Consequently, ESPE accelerates the corresponding ciphertext procedures on edges and saves over 70% encryption cost of an IIoT device.
Light plane calibration and accuracy analysis for multi-line structured light vision measurement system

This paper investigates the overall fitting accuracy of the light plane can be improved by changing the relative distance between camera and laser, altering the projection direction of the light stripe and increasing the number of extracted light stripe in the multi-line structure light measurement system. Firstly, a multi-line structured light three-dimensional measurement system platform is built, and the existing calibration plate is modified according to the requirements of the experimental design. Then, laser stripes are projected onto a blank area in the checkerboard to facilitate the extraction of the centerline of the light stripe. Moreover, the three-dimensional (3D) point cloud transformed from centerline of each stripe is used to fit into a plane by a random sample consensus algorithm (RANSAC). Finally, the influence of different experiment methods on the overall fitting accuracy of the light plane is observed. Experiments illustrate that the proposed experimental methods can reduce the relative error of the overall fitting result of the multi-line structured light plane by more than two times, and the overall calibration accuracy of the light plane is improved in terms of the error of angle between the calibrated light planes.
A Dynamic Adjusting Reward Function Method for Deep Reinforcement Learning with Adjustable Parameters

In deep reinforcement learning, network convergence speed is often slow and easily converges to local optimal solutions. For an environment with reward saltation, we propose a magnify saltatory reward (MSR) algorithm with variable parameters from the perspective of sample usage. MSR dynamically adjusts the rewards for experience with reward saltation in the experience pool, thereby increasing an agent’s utilization of these experiences. We conducted experiments in a simulated obstacle avoidance search environment of an unmanned aerial vehicle and compared the experimental results of deep Q-network (DQN), double DQN, and dueling DQN after adding MSR. The experimental results demonstrate that, after adding MSR, the algorithms exhibit a faster network convergence and can obtain the global optimal solution easily.
Real-Time Observation of Single Atoms Trapped and Interfaced to a Nanofiber Cavity

We demonstrate efficient interfacing of individually trapped single atoms to a nanofiber cavity. The cavity is formed by fabricating photonic crystal structures directly on the nanofiber using femtosecond laser ablation. The single atoms are interfaced to the nanofiber cavity using an optical tweezer based side-illumination trapping scheme. We show that the fluorescence of individual single atoms trapped on the nanofiber cavity can be readily observed in real-time through the fiber guided modes. From the photon statistics measured for different cavity decay rates, the effective coupling rate of the atom-cavity interface is estimated to be $34\ifmmode\pm\else\textpm\fi{}2\text{ }\text{ }\mathrm{MHz}$. This yields a cooperativity of $5.4\ifmmode\pm\else\textpm\fi{}0.6$ ($\text{Purcell factor}=6.4\ifmmode\pm\else\textpm\fi{}0.6$) and a cavity enhanced channeling efficiency as high as $85\ifmmode\pm\else\textpm\fi{}2%$ for a cavity mode with a finesse of 140. The trap lifetime is measured to be $52\ifmmode\pm\else\textpm\fi{}5\text{ }\text{ }\mathrm{ms}$. These results may open new possibilities for deterministic preparation of single atom events for quantum photonics applications on an all-fiber platform.
Calibration method for panoramic 3D shape measurement with plane mirrors

High-speed panoramic three-dimensional (3D) shape measurement can be achieved by introducing plane mirrors into the traditional fringe projection profilometry (FPP) system because such a system simultaneously captures fringe patterns from three different perspectives (i.e., by a real camera and two virtual cameras in the plane mirrors). However, calibrating such a system is nontrivial due to the complicated setup. This work introduces a flexible new technique to calibrate such a system. We first present the mathematical representation of the plane mirror, and then mathematically prove that it only requires the camera to observe a set of feature point pairs (including real points and virtual points) to generate a solution to the reflection matrix of a plane mirror. By calibrating the virtual and real camera in the same world coordinate system, 3D point cloud data obtained from real and virtual perspectives can be automatically aligned to generate a panoramic 3D model of the object. Finally, we developed a system to verify the performance of the proposed calibration technique for panoramic 3D shape measurement.
How different are different diff algorithms in Git?

Abstract Automatic identification of the differences between two versions of a file is a common and basic task in several applications of mining code repositories. Git, a version control system, has a diff utility and users can select algorithms of diff from the default algorithm Myers to the advanced Histogram algorithm. From our systematic mapping, we identified three popular applications of diff in recent studies. On the impact on code churn metrics in 14 Java projects, we obtained different values in 1.7% to 8.2% commits based on the different diff algorithms. Regarding bug-introducing change identification, we found 6.0% and 13.3% in the identified bug-fix commits had different results of bug-introducing changes from 10 Java projects. For patch application, we found that the Histogram is more suitable than Myers for providing the changes of code, from our manual analysis. Thus, we strongly recommend using the Histogram algorithm when mining Git repositories to consider differences in source code.
Adaptive Structural Fingerprints for Graph Attention Networks

Many real-world data sets are represented as graphs, such as citation links, social media, and biological interaction. The volatile graph structure makes it non-trivial to employ convolutional neural networks (CNN's) for graph data processing. Recently, graph attention network (GAT) has proven a promising attempt by combining graph neural networks with attention mechanism, so as to achieve massage passing in graphs with arbitrary structures. However, the attention in GAT is computed mainly based on the similarity between the node content, while the structures of the graph remains largely unemployed (except in masking the attention out of one-hop neighbors). In this paper, we propose an `````````````````````````````ADaptive Structural Fingerprint (ADSF) model to fully exploit both topological details of the graph and content features of the nodes. The key idea is to contextualize each node with a weighted, learnable receptive field encoding rich and diverse local graph structures. By doing this, structural interactions between the nodes can be inferred accurately, thus improving subsequent attention layer as well as the convergence of learning. Furthermore, our model provides a useful platform for different subspaces of node features and various scales of graph structures to ``cross-talk'' with each other through the learning of multi-head attention, being particularly useful in handling complex real-world data. Encouraging performance is observed on a number of benchmark data sets in node classification.
Developing Purposeful AI Use Cases – A Structured Method and Its Application in Project Management

An appropriate problem-solution-fit is essential to develop purposeful artificial intelligence (AI) applications. However, in domains with an unintuitive problem-solution-fit, such as project management (PM), organizations require methodological guidance. Hence, we propose a five-step method to develop organization-specific AI use cases: First, companies must consider the context factors technology, organization (in particular data and application domain), and environment. Second, companies must identify existing domain problems and AI solutions. Third, our method facilitates abstraction to understand the underlying nature of the identified problems and AI solutions. Fourth, our problem-solution-matrix assists companies to match AI functions with the domain context. Fifth, companies derive necessary implications for the subsequent use case implementation. To construct and evaluate our method, we followed the design science research paradigm complemented by situational method engineering and based on 14 interviews. Our method addresses a relevant practical problem and contributes to identifying purposeful AI use cases in unintuitive application domains.
Multi-Task Self-Supervised Learning for Disfluency Detection

Most existing approaches to disfluency detection heavily rely on human-annotated data, which is expensive to obtain in practice. To tackle the training data bottleneck, we investigate methods for combining multiple self-supervised tasks-i.e., supervised tasks where data can be collected without manual labeling. First, we construct large-scale pseudo training data by randomly adding or deleting words from unlabeled news data, and propose two self-supervised pre-training tasks: (i) tagging task to detect the added noisy words. (ii) sentence classification to distinguish original sentences from grammatically-incorrect sentences. We then combine these two tasks to jointly train a network. The pre-trained network is then fine-tuned using human-annotated disfluency detection training data. Experimental results on the commonly used English Switchboard test set show that our approach can achieve competitive performance compared to the previous systems (trained using the full dataset) by using less than 1% (1000 sentences) of the training data. Our method trained on the full dataset significantly outperforms previous methods, reducing the error by 21% on English Switchboard.
Depth optimization of quantum search algorithms beyond Grover's algorithm

Grover's quantum search algorithm provides a quadratic speedup over the classical one. The computational complexity is based on the number of queries to the oracle. However, depth is a more modern metric for noisy intermediate-scale quantum computers. We propose a depth optimization method for the quantum search algorithm. We show that Grover's algorithm is not optimal in depth. We propose a quantum search algorithm, which can be divided into several stages. Each stage has a new initialization, which is a rescaling of the database. This decreases errors. The multistage design is natural for parallel running of the quantum search algorithm.
A Robust Adversarial Training Approach to Machine Reading Comprehension

Lacking robustness is a serious problem for Machine Reading Comprehension (MRC) models. To alleviate this problem, one of the most promising ways is to augment the training dataset with sophisticated designed adversarial examples. Generally, those examples are created by rules according to the observed patterns of successful adversarial attacks. Since the types of adversarial examples are innumerable, it is not adequate to manually design and enrich training data to defend against all types of adversarial attacks. In this paper, we propose a novel robust adversarial training approach to improve the robustness of MRC models in a more generic way. Given an MRC model well-trained on the original dataset, our approach dynamically generates adversarial examples based on the parameters of current model and further trains the model by using the generated examples in an iterative schedule. When applied to the state-of-the-art MRC models, including QANET, BERT and ERNIE2.0, our approach obtains significant and comprehensive improvements on 5 adversarial datasets constructed in different ways, without sacrificing the performance on the original SQuAD development set. Moreover, when coupled with other data augmentation strategy, our approach further boosts the overall performance on adversarial datasets and outperforms the state-of-the-art methods.
Adversarial Training Based Multi-Source Unsupervised Domain Adaptation for Sentiment Analysis

Multi-source unsupervised domain adaptation (MS-UDA) for sentiment analysis (SA) aims to leverage useful information in multiple source domains to help do SA in an unlabeled target domain that has no supervised information. Existing algorithms of MS-UDA either only exploit the shared features, i.e., the domain-invariant information, or based on some weak assumption in NLP, e.g., smoothness assumption. To avoid these problems, we propose two transfer learning frameworks based on the multi-source domain adaptation methodology for SA by combining the source hypotheses to derive a good target hypothesis. The key feature of the first framework is a novel Weighting Scheme based Unsupervised Domain Adaptation framework ((WS-UDA), which combine the source classifiers to acquire pseudo labels for target instances directly. While the second framework is a Two-Stage Training based Unsupervised Domain Adaptation framework (2ST-UDA), which further exploits these pseudo labels to train a target private extractor. Importantly, the weights assigned to each source classifier are based on the relations between target instances and source domains, which measured by a discriminator through the adversarial training. Furthermore, through the same discriminator, we also fulfill the separation of shared features and private features.Experimental results on two SA datasets demonstrate the promising performance of our frameworks, which outperforms unsupervised state-of-the-art competitors.
A Calculus for Stochastic Interventions:Causal Effect Identification and Surrogate Experiments

Some of the most prominent results in causal inference have been developed in the context of atomic interventions, following the semantics of the do-operator and the inferential power of the do-calculus. In practice, many real-world settings require more complex types of interventions that cannot be represented by a simple atomic intervention. In this paper, we investigate a general class of interventions that covers some non-trivial types of policies (conditional and stochastic), which goes beyond the atomic class. Our goal is to develop general understanding and formal machinery to be able to reason about the effects of those policies, similar to the robust treatment developed to handle the atomic case. Specifically, in this paper, we introduce a new set of inference rules (akin to do-calculus) that can be used to derive claims about general interventions, which we call σ-calculus. We develop a systematic and efficient procedure for finding estimands of the effect of general policies as a function of the available observational and experimental distributions. We then prove that our algorithm and σ-calculus are both sound for the tasks of identification (Pearl, 1995) and z-identification (Bareinboim and Pearl, 2012) under this class of interventions.
A RGB-D Based Real-Time Multiple Object Detection and Ranging System for Autonomous Driving

Real-time object detection and ranging of multiple objects on the road are the essential tasks in the field of autonomous driving. In this paper, we introduce a system for simultaneous detection and ranging of vehicles, people, non-motor vehicles and lanes based on RGB-D images. Among them, the detection of vehicles, people and non-motor vehicles belongs to general detection task and the lane detection belongs to segmentation task. In order to improve the accuracy and speed, we use two networks to complete these two tasks. We propose a real-time synchronization method with multi-GPU, which achieves separate training and simultaneous detection of lane detectior and vehicle, people and non-motor vehicle detector. We also propose a center-selective ranging module based on binocular ranging technology to distance the detected object. The system reaches nearly 15 FPS with four 1080Ti GPUs. We construct datasets about these problems including daytime and night in which the system achieves high accuracy. A real-time test of the system on the streets of Tianjin, China has been conducted by us, it has proved that the system can be applied to actual driving.