Reviewerly/exHarmony huggingface dataset:
Quantum Metrology for Non-Markovian Processes

Quantum metrology is a rapidly developing branch of quantum technologies. While various theories have been established on quantum metrology for Markovian processes, i.e., quantum channel estimation, quantum metrology for non-Markovian processes is much less explored. In this Letter, we establish a general framework of non-Markovian quantum metrology. For any parametrized non-Markovian process on a finite-dimensional system, we derive a formula for the maximal amount of quantum Fisher information that can be extracted from it by an optimally controlled probe state. In addition, we design an algorithm that evaluates this quantum Fisher information via semidefinite programming. We apply our framework to noisy frequency estimation, where we find that the optimal performance of quantum metrology is better in the non-Markovian scenario than in the Markovian scenario and explore the possibility of efficient sensing via simple variational circuits.
Identity Inference on Blockchain Using Graph Neural Network

The anonymity of blockchain has accelerated the growth of illegal activities and criminal behaviors on cryptocurrency platforms. Although decentralization is one of the typical characteristics of blockchain, we urgently call for effective regulation to detect these illegal behaviors to ensure the safety and stability of user transactions. Identity inference, which aims to make a preliminary inference about account identity, plays a significant role in blockchain security. As a common tool, graph mining technique can effectively represent the interactive information between accounts and be used for identity inference. However, existing methods cannot balance scalability and end-to-end architecture, resulting high computational consumption and weak feature representation. In this paper, we present a novel approach to analyze user’s behavior from the perspective of the transaction subgraph, which naturally transforms the identity inference task into a graph classification pattern and effectively avoids computation in large-scale graph. Furthermore, we propose a generic end-to-end graph neural network model, named \(\text {I}^2 \text {BGNN}\), which can accept subgraph as input and learn a function mapping the transaction subgraph pattern to account identity, achieving de-anonymization. Extensive experiments on EOSG and ETHG datasets demonstrate that the proposed method achieve the state-of-the-art performance in identity inference.
Towards security recommendations for public-key infrastructures for production environments in the post-quantum era

Abstract Quantum computing technologies pose a significant threat to the currently employed public-key cryptography protocols. In this paper, we discuss the impact of the quantum threat on public key infrastructures (PKIs), which are used as a part of security systems for protecting production environments. We analyze security issues of existing models with a focus on requirements for a fast transition to post-quantum solutions. Although our primary focus is on the attacks with quantum computing, we also discuss some security issues that are not directly related to the used cryptographic algorithms but are essential for the overall security of the PKI. We attempt to provide a set of security recommendations regarding the PKI from the viewpoints of attacks with quantum computers.
A Computer Science-Oriented Approach to Introduce Quantum Computing to a New Audience

Contribution: In this study, an alternative educational approach for introducing quantum computing to a wider audience is highlighted. The proposed methodology considers quantum computing as a generalized probability theory rather than a field emanating from physics and utilizes quantum programming as an educational tool to reinforce the learning process. Background: Quantum computing is a topic mainly rooted in physics, and it has been gaining rapid popularity in recent years. A need for extending the educational reach to groups outside of physics has also been becoming a necessity. Intended outcomes: This study aims to inform academics and organizations interested in introducing quantum computing to a diverse group of participants on an educational approach. It is intended that the proposed methodology would facilitate people from diverse backgrounds to enter the field Application design: The introductory quantum physics content is bypassed and the quantum computing concepts are introduced through linear algebra instead. Quantum programming tasks are prepared in line with the content. Pre/post-test design method and Likert scale satisfaction surveys are utilized to measure knowledge acquisition and to evaluate the perception of the learning process by the participants. Findings: Conducted pre/post-test design survey shows that there is a statistically significant increase in the basic knowledge levels of the participants on quantum computing concepts. Furthermore, no significant difference in the gain scores is observed between the participants from different STEM-related educational backgrounds. The majority of the participants were satisfied and provided positive feedback.
Multi-Modal Sarcasm Detection and Humor Classification in Code-Mixed Conversations

Sarcasm detection and humor classification are inherently subtle problems, primarily due to their dependence on the contextual and non-verbal information. Furthermore, existing studies in these two topics are usually constrained in non-English languages such as Hindi, due to the unavailability of qualitative annotated datasets. In this work, we make two major contributions considering the above limitations: (1) we develop a Hindi-English code-mixed dataset, MaSaC, for the multi-modal sarcasm detection and humor classification in conversational dialog, which to our knowledge is the first dataset of its kind; (2) we propose MSH-COMICS, a novel attention-rich neural architecture for the utterance classification. We learn efficient utterance representation utilizing a hierarchical attention mechanism that attends to a small portion of the input sentence at a time. Further, we incorporate dialog-level contextual attention mechanism to leverage the dialog history for the multi-modal classification. We perform extensive experiments for both the tasks by varying multi-modal inputs and various submodules of MSH-COMICS. We also conduct comparative analysis against existing approaches. We observe that MSH-COMICS attains superior performance over the existing models by > 1 F1-score point for the sarcasm detection and 10 F1-score points in humor classification. We diagnose our model and perform thorough analysis of the results to understand the superiority and pitfalls.
Quantum Nondemolition Dispersive Readout of a Superconducting Artificial Atom Using Large Photon Numbers

Reading out the state of superconducting artificial atoms typically relies on dispersive coupling to a readout resonator. For a given system noise temperature, increasing the circulating photon number $\bar{n}$ in the resonator enables a shorter measurement time and is therefore expected to reduce readout errors caused by spontaneous atom transitions. However, increasing $\bar{n}$ is generally observed to also increase these transition rates. Here we present a fluxonium artificial atom in which we measure an overall flat dependence of the transition rates between its first two states as a function of $\bar{n}$, up to $\bar{n}\approx200$. Despite the fact that we observe the expected decrease of the dispersive shift with increasing readout power, the signal-to-noise ratio continuously improves with increasing $\bar{n}$. Even without the use of a parametric amplifier, at $\bar{n}=74$, we measure fidelities of 99% and 93% for feedback-assisted ground and excited state preparation, respectively.
Improving Event Causality Identification via Self-Supervised Representation Learning on External Causal Statement

Current models for event causality identification (ECI) mainly adopt a supervised framework, which heavily rely on labeled data for training.Unfortunately, the scale of current annotated datasets is relatively limited, which cannot provide sufficient support for models to capture useful indicators from causal statements, especially for handing those new, unseen cases.To alleviate this problem, we propose a novel approach, shortly named CauSeRL, which leverages external causal statements for event causality identification.First of all, we design a self-supervised framework to learn context-specific causal patterns from external causal statements.Then, we adopt a contrastive transfer strategy to incorporate the learned context-specific causal patterns into the target ECI model.Experimental results show that our method significantly outperforms previous methods on EventSto-ryLine and Causal-TimeBank (+2.0 and +3.4 points on F1 value respectively).
Issues in the left periphery of Old French and Old English

Topicalization in Old English and Old French is a poorly studied field. This chapter aims to identify and compare their different strategies for topicalization. We find that both Old English and Old French have evidence for high and low topics, which we argue are Hanging Topics and Left Dislocated Topics. In the case of Old English, we find evidence that both kinds of topics have been derived by movement into the left periphery. Old French displays a hybrid system where Hanging Topics have been base generated, while Left Dislocated Topics have been moved. Applying a Force-Fin-V2 analysis, we find that even in a Force-V2 language there may be Left Dislocated Topics. We propose that the Force-Fin-V2 model be refined, so that moved Left Dislocated Topics block further movement of the finite verb to Force, so that even in a Force-V2 language, the finite verb will be in Fin in the presence of moved Left Dislocated Topics.
Part-Guided Relational Transformers for Fine-Grained Visual Recognition

Fine-grained visual recognition is to classify objects with visually similar appearances into subcategories, which has made great progress with the development of deep CNNs. However, handling subtle differences between different subcategories still remains a challenge. In this paper, we propose to solve this issue in one unified framework from two aspects, i.e., constructing feature-level interrelationships, and capturing part-level discriminative features. This framework, namely PArt-guided Relational Transformers (PART), is proposed to learn the discriminative part features with an automatic part discovery module, and to explore the intrinsic correlations with a feature transformation module by adapting the Transformer models from the field of natural language processing. The part discovery module efficiently discovers the discriminative regions which are highly-corresponded to the gradient descent procedure. Then the second feature transformation module builds correlations within the global embedding and multiple part embedding, enhancing spatial interactions among semantic pixels. Moreover, our proposed approach does not rely on additional part branches in the inference time and reaches state-of-the-art performance on 3 widely-used fine-grained object recognition benchmarks. Experimental results and explainable visualizations demonstrate the effectiveness of our proposed approach.
Evaluating Mixed-initiative Conversational Search Systems via User Simulation

Clarifying the underlying user information need by asking clarifying questions is an important feature of modern conversational search system. However, evaluation of such systems through answering prompted clarifying questions requires significant human effort, which can be time-consuming and expensive. In this paper, we propose a conversational User Simulator, called USi, for automatic evaluation of such conversational search systems. Given a description of an information need, USi is capable of automatically answering clarifying questions about the topic throughout the search session. Through a set of experiments, including automated natural language generation metrics and crowdsourcing studies, we show that responses generated by USi are both inline with the underlying information need and comparable to human-generated answers. Moreover, we make the first steps towards multi-turn interactions, where conversational search systems asks multiple questions to the (simulated) user with a goal of clarifying the user need. To this end, we expand on currently available datasets for studying clarifying questions, i.e., Qulac and ClariQ, by performing a crowdsourcing-based multi-turn data acquisition. We show that our generative, GPT2-based model, is capable of providing accurate and natural answers to unseen clarifying questions in the single-turn setting and discuss capabilities of our model in the multi-turn setting. We provide the code, data, and the pre-trained model to be used for further research on the topic.
FBI: Internet Crime Report 2020

The FBI's Internet Crime Complaint Centre (IC3) is the primary point of contact for individuals and organisations in the US that have fallen victim to any form of Internet-based crime. Its data, therefore, is a reasonable proxy for trends in cybercrime.
Multipurpose medical image watermarking for effective security solutions

Digital medical images contain important information regarding patient’s health and very useful for diagnosis. Even a small change in medical images (especially in the region of interest (ROI)) can mislead the doctors/practitioners for deciding further treatment. Therefore, the protection of the images against intentional/unintentional tampering, forgery, filtering, compression and other common signal processing attacks are mandatory. This manuscript presents a multipurpose medical image watermarking scheme to offer copyright/ownership protection, tamper detection/localization (for ROI (region of interest) and different segments of RONI (region of non-interest)), and self-recovery of the ROI with 100% reversibility. Initially, the recovery information of the host image’s ROI is compressed using LZW (Lempel-Ziv-Welch) algorithm. Afterwards, the robust watermark is embedded into the host image using a transform domain based embedding mechanism. Further, the 256-bit hash keys are generated using SHA-256 algorithm for the ROI and eight RONI regions (i.e. RONI-1 to RONI-8) of the robust watermarked image. The compressed recovery data and hash keys are combined and then embedded into the segmented RONI region of the robust watermarked image using an LSB replacement based fragile watermarking approach. Experimental results show high imperceptibility, high robustness, perfect tamper detection, significant tamper localization, and perfect recovery of the ROI (100% reversibility). The scheme doesn’t need original host or watermark information for the extraction process due to the blind nature. The relative analysis demonstrates the superiority of the proposed scheme over existing schemes.
Neural Natural Language Generation: A Survey on Multilinguality, Multimodality, Controllability and Learning

Developing artificial learning systems that can understand and generate natural language has been one of the long-standing goals of artificial intelligence. Recent decades have witnessed an impressive progress on both of these problems, giving rise to a new family of approaches. Especially, the advances in deep learning over the past couple of years have led to neural approaches to natural language generation (NLG). These methods combine generative language learning techniques with neural-networks based frameworks. With a wide range of applications in natural language processing, neural NLG (NNLG) is a new and fast growing field of research. In this state-of-the-art report, we investigate the recent developments and applications of NNLG in its full extent from a multidimensional view, covering critical perspectives such as multimodality, multilinguality, controllability and learning strategies. We summarize the fundamental building blocks of NNLG approaches from these aspects and provide detailed reviews of commonly used preprocessing steps and basic neural architectures. This report also focuses on the seminal applications of these NNLG models such as machine translation, description generation, automatic speech recognition, abstractive summarization, text simplification, question answering and generation, and dialogue generation. Finally, we conclude with a thorough discussion of the described frameworks by pointing out some open research directions.
Assessment of Electronic Health Record for Cancer Research and Patient Care Through a Scoping Review of Cancer Natural Language Processing

The advancement of natural language processing (NLP) has promoted the use of detailed textual data in electronic health records (EHRs) to support cancer research and to facilitate patient care. In this review, we aim to assess EHR for cancer research and patient care by using the Minimal Common Oncology Data Elements (mCODE), which is a community-driven effort to define a minimal set of data elements for cancer research and practice. Specifically, we aim to assess the alignment of NLP-extracted data elements with mCODE and review existing NLP methodologies for extracting said data elements.Published literature studies were searched to retrieve cancer-related NLP articles that were written in English and published between January 2010 and September 2020 from main literature databases. After the retrieval, articles with EHRs as the data source were manually identified. A charting form was developed for relevant study analysis and used to categorize data including four main topics: metadata, EHR data and targeted cancer types, NLP methodology, and oncology data elements and standards.A total of 123 publications were selected finally and included in our analysis. We found that cancer research and patient care require some data elements beyond mCODE as expected. Transparency and reproductivity are not sufficient in NLP methods, and inconsistency in NLP evaluation exists.We conducted a comprehensive review of cancer NLP for research and patient care using EHRs data. Issues and barriers for wide adoption of cancer NLP were identified and discussed.
Dynamical photon–photon interaction mediated by a quantum emitter

Single photons constitute a main platform in quantum science and technology: they carry quantum information over extended distances in the future quantum internet and can be manipulated in advanced photonic circuits enabling scalable photonic quantum computing. The main challenge in quantum photonics is how to generate advanced entangled resource states and efficient light-matter interfaces. Here we utilize the efficient and coherent coupling of a single quantum emitter to a nanophotonic waveguide for realizing quantum nonlinear interaction between single-photon wavepackets. This inherently multimode quantum system constitutes a new research frontier in quantum optics. We demonstrate control of a photon with another photon and experimentally unravel the dynamical response of two-photon interactions mediated by a quantum emitter, and show that the induced quantum correlations are controlled by the pulse duration. The work will open new avenues for tailoring complex photonic quantum resource states.
Dynamic Scene Graph Generation via Anticipatory Pre-training

Humans can not only see the collection of objects in visual scenes, but also identify the relationship between objects. The visual relationship in the scene can be abstracted into the semantic representation of a triple (subject, predicate, object) and thus results in a scene graph, which can convey a lot of information for visual understanding. Due to the motion of objects, the visual relationship between two objects in videos may vary, which makes the task of dynamically generating scene graphs from videos more complicated and challenging than the conventional image-based static scene graph generation. Inspired by the ability of humans to infer the visual relationship, we propose a novel anticipatory pre-training paradigm based on Transformer to explicitly model the temporal correlation of visual relationships in different frames to improve dynamic scene graph generation. In pre-training stage, the model predicts the visual relationships of current frame based on the previous frames by extracting intra-frame spatial information with a spatial encoder and inter-frame temporal correlations with a progressive temporal encoder. In the fine-tuning stage, we reuse the spatial encoder and the progressive temporal encoder while the information of the current frame is combined for predicting the visual relationship. Extensive experiments demonstrate that our method achieves state-of-the-art performance on Action Genome dataset.
Compact optical convolution processing unit based on multimode interference

Convolutional neural networks are an important category of deep learning, currently facing the limitations of electrical frequency and memory access time in massive data processing. Optical computing has been demonstrated to enable significant improvements in terms of processing speeds and energy efficiency. However, most present optical computing schemes are hardly scalable since the number of optical elements typically increases quadratically with the computational matrix size. Here, a compact on-chip optical convolutional processing unit is fabricated on a low-loss silicon nitride platform to demonstrate its capability for large-scale integration. Three 2 × 2 correlated real-valued kernels are made of two multimode interference cells and four phase shifters to perform parallel convolution operations. Although the convolution kernels are interrelated, ten-class classification of handwritten digits from the MNIST database is experimentally demonstrated. The linear scalability of the proposed design with respect to computational size translates into a solid potential for large-scale integration.
Predicting Army Combat Outcomes in StarCraft

Smart decision making at the tactical level is important for Artificial Intelligence (AI) agents to perform well in the domain of real-time strategy (RTS) games. This paper presents a Bayesian model that can be used to predict the outcomes of isolated battles, as well as predict what units are needed to defeat a given army. Model parameters are learned from simulated battles, in order to minimize the dependency on player skill. We apply our model to the game of StarCraft, with the end-goal of using the predictor as a module for making high-level combat decisions, and show that the model is capable of making accurate predictions.
HA-CCN: Hierarchical Attention-Based Crowd Counting Network

Single image-based crowd counting has recently witnessed increased focus, but many leading methods are far from optimal, especially in highly congested scenes. In this paper, we present the Hierarchical Attention-based Crowd Counting Network (HA-CCN) that employs attention mechanisms at various levels to selectively enhance the features of the network. The proposed method, which is based on the VGG16 network, consists of a spatial attention module (SAM) and a set of global attention modules (GAM). SAM enhances low-level features in the network by infusing spatial segmentation information, whereas the GAM focuses on enhancing channel-wise information in the higher level layers. The proposed method is a single-step training framework, simple to implement and achieves the state-of-the-art results on different datasets. Furthermore, we extend the proposed counting network by introducing a novel set-up to adapt the network to different scenes and datasets via weak supervision using image-level labels. This new set up reduces the burden of acquiring labor intensive point-wise annotations for new datasets while improving the cross-dataset performance.