Reviewerly/exHarmony huggingface dataset:
Principal Component Adversarial Example

Despite having achieved excellent performance on various tasks, deep neural networks have been shown to be susceptible to adversarial examples, i.e., visual inputs crafted with structural imperceptible noise. To explain this phenomenon, previous works implicate the weak capability of the classification models and the difficulty of the classification tasks. These explanations appear to account for some of the empirical observations but lack deep insight into the intrinsic nature of adversarial examples, such as the generation method and transferability. Furthermore, previous works generate adversarial examples completely rely on a specific classifier (model). Consequently, the attack ability of adversarial examples is strongly dependent on the specific classifier. More importantly, adversarial examples cannot be generated without a trained classifier. In this paper, we raise a question: what is the real cause of the generation of adversarial examples? To answer this question, we propose a new concept, called the adversarial region, which explains the existence of adversarial examples as perturbations perpendicular to the tangent plane of the data manifold. This view yields a clear explanation of the transfer property across different models of adversarial examples. Moreover, with the notion of the adversarial region, we propose a novel target-free method to generate adversarial examples via principal component analysis. We verify our adversarial region hypothesis on a synthetic dataset and demonstrate through extensive experiments on real datasets that the adversarial examples generated by our method have competitive or even strong transferability compared with model-dependent adversarial example generating methods. Moreover, our experiment shows that the proposed method is more robust to defensive methods than previous methods.
LiveGraph

The specific characteristics of graph workloads make it hard to design a one-size-fits-all graph storage system. Systems that support transactional updates use data structures with poor data locality, which limits the efficiency of analytical workloads or even simple edge scans. Other systems run graph analytics workloads efficiently, but cannot properly support transactions. This paper presents LiveGraph, a graph storage system that outperforms both the best graph transactional systems and the best systems for real-time graph analytics on fresh data. LiveGraph does that by ensuring that adjacency list scans, a key operation in graph workloads, are purely sequential: they never require random accesses even in presence of concurrent transactions. This is achieved by combining a novel graph-aware data structure, the Transactional Edge Log (TEL), together with a concurrency control mechanism that leverages TEL's data layout. Our evaluation shows that LiveGraph significantly outperforms state-of-the-art (graph) database solutions on both transactional and real-time analytical workloads.
Machine learning meets quantum foundations: A brief survey

The goal of machine learning is to facilitate a computer to execute a specific task without explicit instruction by an external party. Quantum foundations seek to explain the conceptual and mathematical edifice of quantum theory. Recently, ideas from machine learning have successfully been applied to different problems in quantum foundations. Here, the authors compile the representative works done so far at the interface of machine learning and quantum foundations. The authors conclude the survey with potential future directions.
A Theoretical Model for Block Propagation Analysis in Bitcoin Network

Blockchains are currently gaining attention as a newly emerging technology in both academia and industry, capable of impacting a variety of domains beyond cryptocurrencies. Performance modeling can be used to provide us with a deeper understanding of the behavior and dynamics within blockchain peer-to-peer networks. Blockchain system architects can leverage network models to properly tune their system and to reduce design costs significantly. In this article, we focus on the original and well-established Bitcoin blockchain network. In particular, we propose a random graph model for performance modeling and analysis of the inventory-based protocol for block dissemination. This model addresses the impact of key blockchain parameters on the overall performance of Bitcoin. We derive some explicit and closed-form equations for block propagation delay and traffic overhead in the Bitcoin network. We also adapt our model to study the impact of deploying a relay network and investigate the effect of the relay network size on the network performance and decentralization. We implement our model using the popular network simulator OMNet++. We validate the accuracy of our theoretical model and its implementation with our dataset mined from the Bitcoin network. Our results show the tradeoff between the default number of connections per node, network bandwidth, and block size in order to compute the optimal block propagation delay over the network. Additionally, we found that bigger relay networks can jeopardize the decentralization of the Bitcoin network.
Investigating the Investment Behaviors in Cryptocurrency

This article investigates the socio-demographic characteristics that individual cryptocurrency investors exhibit and the factors that go into their investment decisions in different Initial Coin Offerings (ICOs). We conducted a web-based revealed preference survey among Australian and Chinese blockchain and cryptocurrency followers, and applied a Multinomial Logit model to inferentially analyze the characteristics of cryptocurrency investors and the determinants of their choice of investment in “cryptocurrency coins” versus other types of ICO tokens. The results showed differences in the determinant of these two choices among Australian and Chinese cryptocurrency folks. The significant factors of these two choices included age, gender, education, occupation, and investment experience, and they aligned well with the behavioral literature. Furthermore, in addition to differences in how they ranked the attributes of ICOs, there was further variance between how Chinese and Australian investors ranked deterrence factors and investment strategies. <b>TOPICS:</b>Currency, emerging markets, in markets <b>Key Findings</b> • The significant factors of the choice of investment in cryptocurrency include age, gender, education, occupation, and previous investment experience. • Chinese and Australian investors rank the ICO attributes differently. • The deterrence factors and investment strategies vary between Chinese and Australians investors.
Versatile multipartite Einstein-Podolsky-Rosen steering via a quantum frequency comb

This work demonstrates multipartite EPR steering with a multimode quantum resource, based on parametric down conversion from an optical frequency comb. It shows how mode shaping at the receiver side enhances the steerability, without changing the optical circuit
Performance evaluation of adiabatic quantum computation via quantum speed limits and possible applications to many-body systems

The quantum speed limit specifies a universal bound of the fidelity between the initial state and the time-evolved state. We apply this method to find a bound of the fidelity between the adiabatic state and the time-evolved state. The bound is characterized by the counterdiabatic Hamiltonian and can be used to evaluate the worst case performance of the adiabatic quantum computation. The result is improved by imposing additional conditions and we examine several models to find a tight bound. We also derive a different type of quantum speed limits that is meaningful even when we take the thermodynamic limit. By using solvable spin models, we study how the performance and the bound are affected by phase transitions.
Practical Framework for Conditional Non-Gaussian Quantum State Preparation

We develop a general formalism, based on the Wigner function representation of continuous-variable quantum states, to describe the action of an arbitrary conditional operation on a multimode Gaussian state. We apply this formalism to several examples, thus showing its potential as an elegant analytical tool for simulating quantum optics experiments. Furthermore, we also use it to prove that EPR steering is a necessary requirement to remotely prepare a Wigner-negative state.
Optimizing High-Efficiency Quantum Memory with Quantum Machine Learning for Near-Term Quantum Devices

Abstract Quantum memories are a fundamental of any global-scale quantum Internet, high-performance quantum networking and near-term quantum computers. A main problem of quantum memories is the low retrieval efficiency of the quantum systems from the quantum registers of the quantum memory. Here, we define a novel quantum memory called high-retrieval-efficiency (HRE) quantum memory for near-term quantum devices. An HRE quantum memory unit integrates local unitary operations on its hardware level for the optimization of the readout procedure and utilizes the advanced techniques of quantum machine learning. We define the integrated unitary operations of an HRE quantum memory, prove the learning procedure, and evaluate the achievable output signal-to-noise ratio values. We prove that the local unitaries of an HRE quantum memory achieve the optimization of the readout procedure in an unsupervised manner without the use of any labeled data or training sequences. We show that the readout procedure of an HRE quantum memory is realized in a completely blind manner without any information about the input quantum system or about the unknown quantum operation of the quantum register. We evaluate the retrieval efficiency of an HRE quantum memory and the output SNR (signal-to-noise ratio). The results are particularly convenient for gate-model quantum computers and the near-term quantum devices of the quantum Internet.
Deterministic Distribution of Multipartite Entanglement and Steering in a Quantum Network by Separable States

As two valuable quantum resources, Einstein-Podolsky-Rosen entanglement and steering play important roles in quantum-enhanced communication protocols. Distributing such quantum resources among multiple remote users in a network is a crucial precondition underlying various quantum tasks. We experimentally demonstrate the deterministic distribution of two- and three-mode Gaussian entanglement and steering by transmitting separable states in a network consisting of a quantum server and multiple users. In our experiment, entangled states are not prepared solely by the quantum server, but are created among independent users during the distribution process. More specifically, the quantum server prepares separable squeezed states and applies classical displacements on them before spreading out, and users simply perform local beam-splitter operations and homodyne measurements after they receive separable states. We show that the distributed Gaussian entanglement and steerability are robust against channel loss. Furthermore, one-way Gaussian steering is achieved among users that is useful for further directional or highly asymmetric quantum information processing.
Proof-of-principle experimental demonstration of twin-field quantum key distribution over optical channels with asymmetric losses

Abstract Twin-field (TF) quantum key distribution (QKD) is highly attractive because it can beat the fundamental limit of secret key rate for point-to-point QKD without quantum repeaters. Many theoretical and experimental studies have shown the superiority of TFQKD in long-distance communication. All previous experimental implementations of TFQKD have been done over optical channels with symmetric losses. But in reality, especially in a network setting, the distances between users and the middle node could be very different. In this paper, we perform a proof-of-principle experimental demonstration of TFQKD over optical channels with asymmetric losses. We compare two compensation strategies, that are (1) applying asymmetric signal intensities and (2) adding extra losses, and verify that strategy (1) provides much better key rate. Moreover, the higher the loss, the more key rate enhancement it can achieve. By applying asymmetric signal intensities, TFQKD with asymmetric channel losses not only surpasses the fundamental limit of key rate of point-to-point QKD for 50 dB overall loss, but also has key rate as high as 2.918 × 10 −6 for 56 dB overall loss. Whereas no keys are obtained with strategy (2) for 56 dB loss. The increased key rate and enlarged distance coverage of TFQKD with asymmetric channel losses guarantee its superiority in long-distance quantum networks.
An interpretable deep-learning model for early prediction of sepsis in the emergency department

<h2>Summary</h2> Sepsis is a life-threatening condition with high mortality rates and expensive treatment costs. Early prediction of sepsis improves survival in septic patients. In this paper, we report our top-performing method in the 2019 DII National Data Science Challenge to predict onset of sepsis 4 h before its diagnosis on electronic health records of over 100,000 unique patients in emergency departments. A long short-term memory (LSTM)-based model with event embedding and time encoding is leveraged to model clinical time series and boost prediction performance. Attention mechanism and global max pooling techniques are utilized to enable interpretation for the deep-learning model. Our model achieved an average area under the curve of 0.892 and was selected as one of the winners of the challenge for both prediction accuracy and clinical interpretability. This study paves the way for future intelligent clinical decision support, helping to deliver early, life-saving care to the bedside of septic patients.
<scp>SCJADE</scp>: Yet Another State‐of‐the‐Art Differential Evolution Algorithm

Differential evolution algorithms have become one of the most competitive evolutionary algorithms, among which a chaotic differential evolution (CJADE) is a recently proposed state‐of‐the‐art variant. But CJADE still suffers from the premature convergence problem. This paper further improves CJADE by innovatively incorporating a success‐intensity‐based roulette wheel selection method into it. The resultant algorithm called SCJADE shows its superiority over its peer in terms of solution quality and convergence speed on IEEE CEC2017 optimization test suit. © 2021 Institute of Electrical Engineers of Japan. Published by Wiley Periodicals LLC.
Multi-channel attention-fusion neural network for brain age estimation: Accuracy, generality, and interpretation with 16,705 healthy MRIs across lifespan

Brain age estimated by machine learning from T1-weighted magnetic resonance images (T1w MRIs) can reveal how brain disorders alter brain aging and can help in the early detection of such disorders. A fundamental step is to build an accurate age estimator from healthy brain MRIs. We focus on this step, and propose a framework to improve the accuracy, generality, and interpretation of age estimation in healthy brain MRIs. For accuracy, we used one of the largest sample sizes (N = 16,705). For each subject, our proposed algorithm first explicitly splits the T1w image, which has been commonly treated as a single-channel 3D image in other studies, into two 3D image channels representing contrast and morphometry information. We further proposed a “fusion-with-attention” deep learning convolutional neural network (FiA-Net) to learn how to best fuse the contrast and morphometry image channels. FiA-Net recognizes varying contributions across image channels at different brain anatomy and different feature layers. In contrast, multi-channel fusion does not exist for brain age estimation, and is mostly attention-free in other medical image analysis tasks (e.g., image synthesis, or segmentation), where treating channels equally may not be optimal. For generality, we used lifespan data 0–97 years of age for real-world utility; and we thoroughly tested FiA-Net for multi-site and multi-scanner generality by two phases of cross-validations in discovery and replication data, compared to most other studies with only one phase of cross-validation. For interpretation, we directly measured each artificial neuron’s correlation with the chronological age, compared to other studies looking at the saliency of features where salient features may or may not predict age. Overall, FiA-Net achieved a mean absolute error (MAE) of 3.00 years and Pearson correlation r=0.9840 with known chronological ages in healthy brain MRIs 0–97 years of age, comparing favorably with state-of-the-art algorithms and studies for accuracy and generality across sites and datasets. We also provided interpretations on how different artificial neurons and real neuroanatomy contribute to the age estimation.
CoMB-Deep: Composite Deep Learning-Based Pipeline for Classifying Childhood Medulloblastoma and Its Classes

Childhood medulloblastoma (MB) is a threatening malignant tumor affecting children all over the globe. It is believed to be the foremost common pediatric brain tumor causing death. Early and accurate classification of childhood MB and its classes are of great importance to help doctors choose the suitable treatment and observation plan, avoid tumor progression, and lower death rates. The current gold standard for diagnosing MB is the histopathology of biopsy samples. However, manual analysis of such images is complicated, costly, time-consuming, and highly dependent on the expertise and skills of pathologists, which might cause inaccurate results. This study aims to introduce a reliable computer-assisted pipeline called CoMB-Deep to automatically classify MB and its classes with high accuracy from histopathological images. This key challenge of the study is the lack of childhood MB datasets, especially its four categories (defined by the WHO) and the inadequate related studies. All relevant works were based on either deep learning (DL) or textural analysis feature extractions. Also, such studies employed distinct features to accomplish the classification procedure. Besides, most of them only extracted spatial features. Nevertheless, CoMB-Deep blends the advantages of textural analysis feature extraction techniques and DL approaches. The CoMB-Deep consists of a composite of DL techniques. Initially, it extracts deep spatial features from 10 convolutional neural networks (CNNs). It then performs a feature fusion step using discrete wavelet transform (DWT), a texture analysis method capable of reducing the dimension of fused features. Next, the CoMB-Deep explores the best combination of fused features, enhancing the performance of the classification process using two search strategies. Afterward, it employs two feature selection techniques on the fused feature sets selected in the previous step. A bi-directional long-short term memory (Bi-LSTM) network; a DL-based approach that is utilized for the classification phase. CoMB-Deep maintains two classification categories: binary category for distinguishing between the abnormal and normal cases and multi-class category to identify the subclasses of MB. The results of the CoMB-Deep for both classification categories prove that it is reliable. The results also indicate that the feature sets selected using both search strategies have enhanced the performance of Bi-LSTM compared to individual spatial deep features. CoMB-Deep is compared to related studies to verify its competitiveness, and this comparison confirmed its robustness and outperformance. Hence, CoMB-Deep can help pathologists perform accurate diagnoses, reduce misdiagnosis risks that could occur with manual diagnosis, accelerate the classification procedure, and decrease diagnosis costs.
Quantum technologies in the telecommunications industry

Abstract Quantum based technologies have been fundamental in our world. After producing the laser and the transistor, the devices that have shaped our modern information society, the possibilities enabled by the ability to create and manipulate individual quantum states opens the door to a second quantum revolution. In this paper we explore the possibilities that these new technologies bring to the Telecommunications industry.
Industry 5.0: Ethereum blockchain technology based DApp smart contract

&lt;abstract&gt; &lt;p&gt;The use of advanced technologies has increased drastically to maintain any sensitive records related to education, health, or finance. It helps to protect the data from unauthorized access by attackers. However, all the existing advanced technologies face some issues because of their uncertainties. These technologies have some lapses to provide privacy, attack-free, transparency, reliability, and flexibility. These characteristics are essential while managing any sensitive data like educational certificates or medical certificates. Hence, we designed an Industry 5.0 based blockchain application to manage medical certificates using Remix Ethereum blockchain in this paper. This application also employs a distributed application (DApp) that uses a test RPC-based Ethereum blockchain and user expert system as a knowledge agent. The main strength of this work is the maintenance of existing certificates over a blockchain with the creation of new certificates that use logistic Map encryption cipher on existing medical certificates while uploading into the blockchain. This application helps to quickly analyze the birth, death, and sick rate as per certain features like location and year.&lt;/p&gt; &lt;/abstract&gt;
Multiple spatial frames for immersive working memory

As we move around, relevant information that disappears from sight can still be held in working memory to serve upcoming behaviour. How we maintain and select visual information as we move through the environment remains poorly understood because most laboratory tasks of working memory rely on removing visual material while participants remain still. We used virtual reality to study visual working memory following self-movement in immersive environments. Directional biases in gaze revealed the recruitment of more than one spatial frame for maintaining and selecting memoranda following self-movement. The findings bring the important realization that multiple spatial frames support working memory in natural behaviour. The results also illustrate how virtual reality can be a critical experimental tool to characterize this core memory system.
Quantum algorithmic measurement

There has been recent promising experimental and theoretical evidence that quantum computational tools might enhance the precision and efficiency of physical experiments. However, a systematic treatment and comprehensive framework are missing. Here we initiate the systematic study of experimental quantum physics from the perspective of computational complexity. To this end, we define the framework of quantum algorithmic measurements (QUALMs), a hybrid of black box quantum algorithms and interactive protocols. We use the QUALM framework to study two important experimental problems in quantum many-body physics: determining whether a system's Hamiltonian is time-independent or time-dependent, and determining the symmetry class of the dynamics of the system. We study abstractions of these problems and show for both cases that if the experimentalist can use her experimental samples coherently (in both space and time), a provable exponential speedup is achieved compared to the standard situation in which each experimental sample is accessed separately. Our work suggests that quantum computers can provide a new type of exponential advantage: exponential savings in resources in quantum experiments.