Reviewerly/exHarmony huggingface dataset:
Certifying quantum teleportation experimentally

Quantum EngineeringVolume 1, Issue 3 e22 RESEARCH HIGHLIGHT Certifying quantum teleportation experimentally Yu-Bo Sheng, Corresponding Author Yu-Bo Sheng shengyb@njupt.edu.cn orcid.org/0000-0002-9536-4696 Institute of Quantum Information and Technology, Nanjing University of Posts and Telecommunications, Nanjing, China School of Science, Nanjing University of Posts and Telecommunications, Nanjing, China Key Laboratory of Broadband Wireless Communication and Sensor Network Technology, Nanjing University of Posts and Telecommunications, Ministry of Education, Nanjing, China Yu-Bo Sheng, Institute of Quantum Information and Technology, Nanjing University of Posts and Telecommunications, Nanjing 210003, China; or School of Science, Nanjing University of Posts and Telecommunications, Nanjing 210003, China; or Key Laboratory of Broadband Wireless Communication and Sensor Network Technology, Nanjing University of Posts and Telecommunications, Ministry of Education, Nanjing 210003, China. Email: shengyb@njupt.edu.cnSearch for more papers by this author Yu-Bo Sheng, Corresponding Author Yu-Bo Sheng shengyb@njupt.edu.cn orcid.org/0000-0002-9536-4696 Institute of Quantum Information and Technology, Nanjing University of Posts and Telecommunications, Nanjing, China School of Science, Nanjing University of Posts and Telecommunications, Nanjing, China Key Laboratory of Broadband Wireless Communication and Sensor Network Technology, Nanjing University of Posts and Telecommunications, Ministry of Education, Nanjing, China Yu-Bo Sheng, Institute of Quantum Information and Technology, Nanjing University of Posts and Telecommunications, Nanjing 210003, China; or School of Science, Nanjing University of Posts and Telecommunications, Nanjing 210003, China; or Key Laboratory of Broadband Wireless Communication and Sensor Network Technology, Nanjing University of Posts and Telecommunications, Ministry of Education, Nanjing 210003, China. Email: shengyb@njupt.edu.cnSearch for more papers by this author First published: 29 August 2019 https://doi.org/10.1002/que2.22Citations: 10Read the full textAboutPDF ToolsRequest permissionExport citationAdd to favoritesTrack citation ShareShare Give accessShare full text accessShare full-text accessPlease review our Terms and Conditions of Use and check box below to share full-text version of article.I have read and accept the Wiley Online Library Terms and Conditions of UseShareable LinkUse the link below to share a full-text version of this article with your friends and colleagues. Learn more.Copy URL Share a linkShare onFacebookTwitterLinkedInRedditWechat No abstract is available for this article.Citing Literature Volume1, Issue3September 2019e22 RelatedInformation
ENIGMAWatch: ProofWatch Meets ENIGMA

In this work we describe a new learning-based proof guidance – ENIGMAWatch – for saturation-style first-order theorem provers. ENIGMAWatch combines two guiding approaches for the given-clause selection implemented for the E ATP system: ProofWatch and ENIGMA. ProofWatch is motivated by the watchlist (hints) method and based on symbolic matching of multiple related proofs, while ENIGMA is based on statistical machine learning. The two methods are combined by using the evolving information about symbolic proof matching as additional characterization of the saturation-style proof search for the statistical learning methods. The new system is evaluated on a large set of problems from the Mizar library. We show that the added proof-matching information is considered important by the statistical machine learners, and that it leads to improved performance over ProofWatch and ENIGMA.
Multi-agent Learning for Neural Machine Translation

Conventional Neural Machine Translation (NMT) models benefit from the training with an additional agent, e.g., dual learning, and bidirectional decoding with one agent decoding from left to right and the other decoding in the opposite direction.In this paper, we extend the training framework to the multi-agent scenario by introducing diverse agents in an interactive updating process.At training time, each agent learns advanced knowledge from others, and they work together to improve translation quality.Experimental results on NIST Chinese-English, IWSLT 2014 German-English, WMT 2014 English-German and large-scale Chinese-English translation tasks indicate that our approach achieves absolute improvements over the strong baseline systems and shows competitive performance on all tasks.
Entropy-Based Semi-Fragile Watermarking of Remote Sensing Images in the Wavelet Domain

This article presents a semi-fragile image tampering detection method for multi-band images. In the proposed scheme, a mark is embedded into remote sensing images, which have multiple frequential values for each pixel, applying tree-structured vector quantization. The mark is not embedded into each frequency band separately, but all the spectral values (known as signature) are used. The mark is embedded in the signature as a means to detect if the original image has been forged. The image is partitioned into three-dimensional blocks with varying sizes. The size of these blocks and the embedded mark is determined by the entropy of each region. The image blocks contain areas that have similar pixel values and represent smooth regions in multispectral or hyperspectral images. Each block is first transformed using the discrete wavelet transform. Then, a tree-structured vector quantizer (TSVQ) is constructed from the low-frequency region of each block. An iterative algorithm is applied to the generated trees until the resulting tree fulfils a requisite criterion. More precisely, the TSVQ tree that matches a particular value of entropy and provides a near-optimal value according to Shannon’s rate-distortion function is selected. The proposed method is shown to be able to preserve the embedded mark under lossy compression (above a given threshold) but, at the same time, it detects possibly forged blocks and their positions in the whole image. Experimental results show how the scheme can be applied to detect forgery attacks, and JPEG2000 compression of the images can be applied without removing the authentication mark. The scheme is also compared to other works in the literature.
A Topic Augmented Text Generation Model: Joint Learning of Semantics and Structural Features

Text generation is among the most fundamental tasks in natural language processing.In this paper, we propose a text generation model that learns semantics and structural features simultaneously.This model captures structural features by a sequential variational autoencoder component and leverages a topic modeling component based on a Gaussian distribution to enhance the recognition of text semantics.To make the reconstructed text more coherent to the topics, the model further adapts the encoder of the topic modeling component for a discriminator.The results of experiments over several datasets demonstrate that our model outperforms several states of the art models in terms of text perplexity and topic coherence.Moreover, the latent representations learned by our model is superior to others in a text classification task.Finally, given the input texts, our model can generate meaningful texts which hold similar structures but under different topics.
Evaluating the Supervised and Zero-shot Performance of Multi-lingual Translation Models

We study several methods for full or partial sharing of the decoder parameters of multilingual NMT models.Using only the WMT 2019 shared task parallel datasets for training, we evaluate both fully supervised and zero-shot translation performance in 110 unique translation directions.We use additional test sets and re-purpose evaluation methods recently used for unsupervised MT in order to evaluate zero-shot translation performance for language pairs where no gold-standard parallel data is available.To our knowledge, this is the largest evaluation of multi-lingual translation yet conducted in terms of the total size of the training data we use, and in terms of the number of zero-shot translation pairs we evaluate.We conduct an in-depth evaluation of the translation performance of different models, highlighting the trade-offs between methods of sharing decoder parameters.We find that models which have task-specific decoder parameters outperform models where decoder parameters are fully shared across all tasks.
ArbDialectID at MADAR Shared Task 1: Language Modelling and Ensemble Learning for Fine Grained Arabic Dialect Identification

In this paper, we present a Dialect Identification system (ArbDialectID) that competed at Task 1 of the MADAR shared task, MADARTravel Domain Dialect Identification. We build a course and a fine-grained identification model to predict the label (corresponding to a dialect of Arabic) of a given text. We build two language models by extracting features at two levels (words and characters). We firstly build a coarse identification model to classify each sentence into one out of six dialects, then use this label as a feature for the fine-grained model that classifies the sentence among 26 dialects from different Arab cities, after that we apply ensemble voting classifier on both sub-systems. Our system ranked 1st that achieving an f-score of 67.32%. Both the models and our feature engineering tools are made available to the research community.
Privacy-Preserving Sketching for Online Social Network Data Publication

Releasing private data can cause panic to both Online Social Network (OSN) users and service providers. Therefore, anonymization mechanisms are proposed to protect data before sharing it. However, some of these mechanisms set unrealistic privacy demands but cannot defend against real-world de-anonymization attacks.In this paper, we introduce an anonymization algorithm based on All-Distance Sketch (ADS). Sketching can significantly limit attackers’ confidence, as well as provide accurate estimation about shortest path length and other utility metrics. Because sketching removes large amounts of edges, it is invulnerable to seed-based and subgraph-based de-anonymization attacks. However, existing sketching algorithms do not add dummy edges and paths. Adversaries have low false positive in extracting linking information, which challenges the privacy performance. We propose the novel bottom-(l, k) sketch to defend against these advanced attacks. We develop a scheme to add and delete enough edges to satisfy our privacy demand. The experiment results show that our published graphs are closely matched with the original graphs under some metrics, preserving utility, while 80% edges are removed, ensuring privacy.
Model Predictive Control for Autonomous Driving considering Actuator Dynamics

In this paper, we propose a new model predictive control (MPC) formulation for autonomous driving. The novelty of our MPC stems from the following results. Firstly, we adopt an alternating minimization approach wherein linear velocities and angular accelerations are alternately optimized. We show that in contrast to the joint optimization, the alternating minimization exploits the structure of the problem better, which in turn translates to reduction in computation time. Secondly, our MPC explicitly incorporates the time dependent non-linear actuator dynamics that captures the transient response of the vehicle for a given commanded velocity. This added complexity improves the predictive component of MPC resulting in improved margin of inter-vehicle distance during maneuvers like overtaking, lane-change, etc. Although, past works have also incorporated actuator dynamics within MPC, there has been very few attempts towards coupling actuator dynamics to collision avoidance constraints through the non-holonomic motion model of the vehicle and analyzing the resulting behavior. We use a high fidelity simulator to benchmark our actuator dynamics augmented MPC with other related approaches in terms of metrics like inter-vehicle distance, trajectory smoothness, and velocity overshoot.
Non-causal Tracking by Deblatting

Tracking by Deblatting (Deblatting = deblurring and matting) stands for solving an inverse problem of deblurring and image matting for tracking motion-blurred objects. We propose non-causal Tracking by Deblatting which estimates continuous, complete and accurate object trajectories. Energy minimization by dynamic programming is used to detect abrupt changes of motion, called bounces. High-order polynomials are fitted to segments, which are parts of the trajectory separated by bounces. The output is a continuous trajectory function which assigns location for every real-valued time stamp from zero to the number of frames. Additionally, we show that from the trajectory function precise physical calculations are possible, such as radius, gravity or sub-frame object velocity. Velocity estimation is compared to the high-speed camera measurements and radars. Results show high performance of the proposed method in terms of Trajectory-IoU, recall and velocity estimation.
An Integrated Methodology for Rule Extraction from ELM-Based Vacuum Tank Degasser Multiclassifier for Decision-Making

The present work proposes an integrated methodology for rule extraction in a vacuum tank degasser (VTD) for decision-making purposes. An extreme learning machine (ELM) algorithm is established for a three-class classification problem according to an end temperature of liquid steel that is higher than its operating restriction, within the operation restriction and lower than the operating restriction. Based on these black-box model results, an integrated three-step approach for rule extraction is constructed to interpret the understandability of the proposed ELM classifier. First, the irrelevant attributes are pruned without decreasing the classification accuracy. Second, fuzzy rules are generated in the form of discrete input attributes and the target classification. Last but not the least, the rules are refined by generating rules with continuous attributes. The novelty of the proposed rule extraction approach lies in the generation of rules using the discrete and continuous attributes at different stages. The proposed method is analyzed and validated on actual production data derived from a No.2 steelmaking workshop in Baosteel. The experimental results revealed that the extracted rules are effective for the VTD system in classifying the end temperature of liquid steel into high, normal, and low ranges. In addition, much fewer input attributes are needed to implement the rules for the manufacturing process of VTD. The extracted rules serve explicit instructions for decision-making for the VTD operators.
Exploring the Distribution Patterns of Flickr Photos

In recent years, volunteered-geographic-information (VGI) image data have served as a data source for various geographic applications, attracting researchers to assess the quality of these images. However, these applications and quality assessments are generally focused on images associated with geolocation through textual annotations, which is only part of valid images to them. In this paper, we explore the distribution pattern for most relevant VGI images of specific landmarks to extend the current quality analysis, and to provide guidance for improving the data-retrieval process of geographic applications. Distribution is explored in terms of two aspects, namely, semantic distribution and spatial distribution. In this paper, the term semantic distribution is used to describe the matching of building-image tags and content with each other. There are three kinds of images (semantic-relevant and content-relevant, semantic-relevant but content-irrelevant, and semantic-irrelevant but content-relevant). Spatial distribution shows how relevant images are distributed around a landmark. The process of this work can be divided into three parts: data filtering, retrieval of relevant landmark images, and distribution analysis. For semantic distribution, statistical results show that an average of 60% of images tagged with the building’s name actually represents the building, while 69% of images depicting the building are not annotated with the building’s name. There was also an observation that for most landmarks, 97% of relevant building images were located within 300 m around the building in terms of spatial distribution.
Lake Wetland Classification Based on an SVM-CNN Composite Classifier and High-resolution Images Using Wudalianchi as an Example

Meng, X.; Zhang, S., and Zang, S., 2019. Lake wetland classification based on an SVM-CNN composite classifier and high-resolution images using Wudalianchi as an example. In: Guido-Aldana, P.A. and Mulahasan, S. (eds.), Advances in Water Resources and Exploration. Journal of Coastal Research, Special Issue No. 93, pp. 153–162. Coconut Creek (Florida), ISSN 0749-0208.This paper constructs a composite classifier based on a convolutional neural network (CNN) and support vector machine (SVM) by using the decision fusion method to study the Wudalianchi Nature Reserve. It also conducts studies on the high-resolution remote sensing image classification of a lake wetland and makes a comparison between the pixel-based SVM method and the context-based CNN method. The experimental results show that the overall accuracy of the SVM-CNN classification method is higher than that of the SVM method, by 9% and 7.75% for the selected two study sites, and higher than the CNN method, by 5.23% and 2.39%. In particular, for the large-area lake wetland, the SVM-CNN classification method provides a higher boundary classification accuracy than the SVM and CNN methods. The research shows that the SVM-CNN composite classifier based on decision fusion theory provides a favorable means for the fine classification of lake wetland identification.
An Image Classification Method Based on Optimized Fuzzy Bag-of-words Model

This paper proposes an image classification method based on fuzzy bag-of-words (FBoW) model and the fuzzy system with positive and negative rules.Firstly, the Gaussian membership function was adopted to construct multiple fuzzy membership histograms for image description, based on the distance between image features and multiple codebooks.Next, the fuzzy system with positive and negative rules was introduced to fuze the image description and image classification into a unified learning framework.After that, the precedent and antecedent parameters of the fuzzy system were learned by particle swarm optimization (PSO) and recursive least squares (RLS) algorithm, such that the parameters can be adjusted constantly in the learning process and that image description can fit in with the image classifier.Finally, the FBoW model was verified through experiment on the standard image dataset PASCAL Visual Object Classes Challenge 2007 (VOC2007).The results show that our method outperformed the classic FBoW model in image classification.
Improved Particle Swarm Medical Image Segmentation Algorithm for Decision Making

Improved particle swarm optimization (PSO) algorithm is proposed for medical image segmentation. The complexity of the proposed algorithm is estimated based on the drift theorem. Computer experiments have shown the linear complexity of the algorithm. Images from the Ossirix image dataset and real medical images were used for testing. Low (polinomial time complexity) allows to use the proposed algorithm for rapid decision-making (medical diagnosis). The population-based image segmentation methods such as PSO are well implemented at distributed computing systems, what allows increasing their efficiency even more.
Gaze Fixation Comparisons Between Amputees and Able-bodied Individuals in Approaching Stairs and Level-ground Transitions: A Pilot Study

This paper aims to investigate the visual strategy of transtibial amputees while they are approaching the transition between level-ground and stairs and compare it with that of able-bodied individuals. To this end, we conducted a pilot study where two transtibial amputee subjects and two able-bodied subjects transitioned from level-ground to stairs and vice versa while wearing eye tracking glasses to record gaze fixations. To investigate how vision functioned to both populations for preparing locomotion on new terrains, gaze fixation behavior before the new terrains were analyzed and compared between two populations across all transition cases in the study. Our results presented that, unlike the able-bodied population, amputees had most of their fixations directed on the transition region prior to new terrains. Furthermore, amputees showed an increased need for visual information during transition regions before navigation on stairs than that before navigation onto level-ground. The insights about amputees' visual behavior gained by the study may lead the future development of technologies related to the intention prediction and the locomotion recognition for amputees.
Forensic Speaker Verification Using Ordinary Least Squares

In Brazil, the recognition of speakers for forensic purposes still relies on a subjectivity-based decision-making process through a results analysis of untrustworthy techniques. Owing to the lack of a voice database, speaker verification is currently applied to samples specifically collected for confrontation. However, speaker comparative analysis via contested discourse requires the collection of an excessive amount of voice samples for a series of individuals. Further, the recognition system must inform who is the most compatible with the contested voice from pre-selected individuals. Accordingly, this paper proposes using a combination of linear predictive coding (LPC) and ordinary least squares (OLS) as a speaker verification tool for forensic analysis. The proposed recognition technique establishes confidence and similarity upon which to base forensic reports, indicating verification of the speaker of the contested discourse. Therefore, in this paper, an accurate, quick, alternative method to help verify the speaker is contributed. After running seven different tests, this study preliminarily achieved a hit rate of 100% considering a limited dataset (Brazilian Portuguese). Furthermore, the developed method extracts a larger number of formants, which are indispensable for statistical comparisons via OLS. The proposed framework is robust at certain levels of noise, for sentences with the suppression of word changes, and with different quality or even meaningful audio time differences.
Domain Adaptation in Children Activity Recognition

Among the major challenges in training predictive models in wireless health, is adapting them to new individuals or groups of people. This is not trivial largely due to possible differences in the distribution of data between a new individual in a real-world deployment and the training data used for building the model. In this study, we aim to tackle this problem by employing recent advancements in deep Domain Adaptation which tries to transfer a model trained on a labeled dataset to a new unlabeled one that follows a different distribution as well. To show the benefits of our approach, we transfer an activity recognition model, trained on a popular adult dataset to children. We show that direct use of the adult model on children loses 25.2% in F1-score against a supervised baseline, while our proposed transfer approach reduces this to 9%.