Reviewerly/exHarmony huggingface dataset:
Coherence in cooperative photon emission from indistinguishable quantum emitters

Photon-mediated interactions between atoms can arise via coupling to a common electromagnetic mode or by quantum interference. Here, we probe the role of coherence in cooperative emission arising from two distant but indistinguishable solid-state emitters because of path erasure. The primary signature of cooperative emission, the emergence of "bunching" at zero delay in an intensity correlation experiment, is used to characterize the indistinguishability of the emitters, their dephasing, and the degree of correlation in the joint system that can be coherently controlled. In a stark departure from a pair of uncorrelated emitters, in Hong-Ou-Mandel-type interference measurements, we observe photon statistics from a pair of indistinguishable emitters resembling that of a weak coherent state from an attenuated laser. Our experiments establish techniques to control and characterize cooperative behavior between matter qubits using the full quantum optics toolbox, a key step toward realizing large-scale quantum photonic networks.
RawlsGCN: Towards Rawlsian Difference Principle on Graph Convolutional Network

Graph Convolutional Network (GCN) plays pivotal roles in many real-world applications. Despite the successes of GCN deployment, GCN often exhibits performance disparity with respect to node degrees, resulting in worse predictive accuracy for low-degree nodes. We formulate the problem of mitigating the degree-related performance disparity in GCN from the perspective of the Rawlsian difference principle, which is originated from the theory of distributive justice. Mathematically, we aim to balance the utility between low-degree nodes and high-degree nodes while minimizing the task-specific loss. Specifically, we reveal the root cause of this degree-related unfairness by analyzing the gradients of weight matrices in GCN. Guided by the gradients of weight matrices, we further propose a pre-processing method RawlsGCN-Graph and an in-processing method RawlsGCN-Grad that achieves fair predictive accuracy in low-degree nodes without modification on the GCN architecture or introduction of additional parameters. Extensive experiments on real-world graphs demonstrate the effectiveness of our proposed RawlsGCN methods in significantly reducing degree-related bias while retaining comparable overall performance.
Incorporation of Synthetic Data Generation Techniques within a Controlled Data Processing Workflow in the Health and Wellbeing Domain

To date, the use of synthetic data generation techniques in the health and wellbeing domain has been mainly limited to research activities. Although several open source and commercial packages have been released, they have been oriented to generating synthetic data as a standalone data preparation process and not integrated into a broader analysis or experiment testing workflow. In this context, the VITALISE project is working to harmonize Living Lab research and data capture protocols and to provide controlled processing access to captured data to industrial and scientific communities. In this paper, we present the initial design and implementation of our synthetic data generation approach in the context of VITALISE Living Lab controlled data processing workflow, together with identified challenges and future developments. By uploading data captured from Living Labs, generating synthetic data from them, developing analysis locally with synthetic data, and then executing them remotely with real data, the utility of the proposed workflow has been validated. Results have shown that the presented workflow helps accelerate research on artificial intelligence, ensuring compliance with data protection laws. The presented approach has demonstrated how the adoption of state-of-the-art synthetic data generation techniques can be applied for real-world applications.
Detecting false alarms from automatic static analysis tools

Automatic static analysis tools (ASATs), such as Findbugs, have a high false alarm rate. The large number of false alarms produced poses a barrier to adoption. Researchers have proposed the use of machine learning to prune false alarms and present only actionable warnings to developers. The state-of-the-art study has identified a set of "Golden Features" based on metrics computed over the characteristics and history of the file, code, and warning. Recent studies show that machine learning using these features is extremely effective and that they achieve almost perfect performance. We perform a detailed analysis to better understand the strong performance of the "Golden Features". We found that several studies used an experimental procedure that results in data leakage and data duplication, which are subtle issues with significant implications. Firstly, the ground-truth labels have leaked into features that measure the proportion of actionable warnings in a given context. Secondly, many warnings in the testing dataset appear in the training dataset. Next, we demonstrate limitations in the warning oracle that determines the ground-truth labels, a heuristic comparing warnings in a given revision to a reference revision in the future. We show the choice of reference revision influences the warning distribution. Moreover, the heuristic produces labels that do not agree with human oracles. Hence, the strong performance of these techniques previously seen is overoptimistic of their true performance if adopted in practice. Our results convey several lessons and provide guidelines for evaluating false alarm detectors.
Learning Self-supervised Low-Rank Network for Single-Stage Weakly and Semi-supervised Semantic Segmentation

Semantic segmentation with limited annotations, such as weakly supervised semantic segmentation (WSSS) and semi-supervised semantic segmentation (SSSS), is a challenging task that has attracted much attention recently. Most leading WSSS methods employ a sophisticated multi-stage training strategy to estimate pseudo-labels as precise as possible, but they suffer from high model complexity. In contrast, there exists another research line that trains a single network with image-level labels in one training cycle. However, such a single-stage strategy often performs poorly because of the compounding effect caused by inaccurate pseudo-label estimation. To address this issue, this paper presents a Self-supervised Low-Rank Network (SLRNet) for single-stage WSSS and SSSS. The SLRNet uses cross-view self-supervision, that is, it simultaneously predicts several complementary attentive LR representations from different views of an image to learn precise pseudo-labels. Specifically, we reformulate the LR representation learning as a collective matrix factorization problem and optimize it jointly with the network learning in an end-to-end manner. The resulting LR representation deprecates noisy information while capturing stable semantics across different views, making it robust to the input variations, thereby reducing overfitting to self-supervision errors. The SLRNet can provide a unified single-stage framework for various label-efficient semantic segmentation settings: (1) WSSS with image-level labeled data, (2) SSSS with a few pixel-level labeled data, and (3) SSSS with a few pixel-level labeled data and many image-level labeled data. Extensive experiments on the Pascal VOC 2012, COCO, and L2ID datasets demonstrate that our SLRNet outperforms both state-of-the-art WSSS and SSSS methods with a variety of different settings, proving its good generalizability and efficacy.
Semi-Synchronous Federated Learning for Energy-Efficient Training and Accelerated Convergence in Cross-Silo Settings

There are situations where data relevant to machine learning problems are distributed across multiple locations that cannot share the data due to regulatory, competitiveness, or privacy reasons. Machine learning approaches that require data to be copied to a single location are hampered by the challenges of data sharing. Federated Learning (FL) is a promising approach to learn a joint model over all the available data across silos. In many cases, the sites participating in a federation have different data distributions and computational capabilities. In these heterogeneous environments existing approaches exhibit poor performance: synchronous FL protocols are communication efficient, but have slow learning convergence and high energy cost; conversely, asynchronous FL protocols have faster convergence with lower energy cost, but higher communication. In this work, we introduce a novel energy-efficient Semi-Synchronous Federated Learning protocol that mixes local models periodically with minimal idle time and fast convergence. We show through extensive experiments over established benchmark datasets in the computer-vision domain as well as in real-world biomedical settings that our approach significantly outperforms previous work in data and computationally heterogeneous environments .
A Three-Stage Self-Training Framework for Semi-Supervised Semantic Segmentation

Semantic segmentation has been widely investigated in the community, in which state-of-the-art techniques are based on supervised models. Those models have reported unprecedented performance at the cost of requiring a large set of high quality segmentation masks for training. Obtaining such annotations is highly expensive and time consuming, in particular, in semantic segmentation where pixel-level annotations are required. In this work, we address this problem by proposing a holistic solution framed as a self-training framework for semi-supervised semantic segmentation. The key idea of our technique is the extraction of the pseudo-mask information on unlabelled data whilst enforcing segmentation consistency in a multi-task fashion. We achieve this through a three-stage solution. Firstly, a segmentation network is trained using the labelled data only and rough pseudo-masks are generated for all images. Secondly, we decrease the uncertainty of the pseudo-mask by using a multi-task model that enforces consistency and that exploits the rich statistical information of the data. Finally, the segmentation model is trained by taking into account the information of the higher quality pseudo-masks. We compare our approach against existing semi-supervised semantic segmentation methods and demonstrate state-of-the-art performance with extensive experiments.
Topic Modeling for Interpretable Text Classification From EHRs

The clinical notes in electronic health records have many possibilities for predictive tasks in text classification. The interpretability of these classification models for the clinical domain is critical for decision making. Using topic models for text classification of electronic health records for a predictive task allows for the use of topics as features, thus making the text classification more interpretable. However, selecting the most effective topic model is not trivial. In this work, we propose considerations for selecting a suitable topic model based on the predictive performance and interpretability measure for text classification. We compare 17 different topic models in terms of both interpretability and predictive performance in an inpatient violence prediction task using clinical notes. We find no correlation between interpretability and predictive performance. In addition, our results show that although no model outperforms the other models on both variables, our proposed fuzzy topic modeling algorithm (FLSA-W) performs best in most settings for interpretability, whereas two state-of-the-art methods (ProdLDA and LSI) achieve the best predictive performance.
The Power of Adiabatic Quantum Computation with No Sign Problem

We show a superpolynomial oracle separation between the power of adiabatic quantum computation with no sign problem and the power of classical computation.
Cryptocurrencies: A bibliometric analysis

The purpose of the current paper is to identify influential aspects of published literature and future research questions to set forth future research agenda based on comprehensive literature review using bibliometric and content analysis. The study analyzed 1225 documents from the international Scopus database using bibliometric analysis and content analysis. VOSviewer software is used for bibliometric analysis. The analysis revealed that most of the information was derived from the Finance Research Letters. Moreover, the United Kingdom is the most cited country, while Tianjin University in China has the highest publications affiliations. Furthermore, the analysis shows that the keyword analysis of cryptocurrency literature had four classes of research streams in cryptocurrency, namely, cryptocurrency, Blockchain, Fintech, and currency, representing the most upcoming trends. The present study makes a significant contribution to the literature by providing a framework for future research. The framework provides opportunities to future researchers to explore the web of relations among some identified research streams as future research agenda.
Efficient Path Planning for Mobile Robot Based on Deep Deterministic Policy Gradient

When a traditional Deep Deterministic Policy Gradient (DDPG) algorithm is used in mobile robot path planning, due to the limited observable environment of mobile robots, the training efficiency of the path planning model is low, and the convergence speed is slow. In this paper, Long Short-Term Memory (LSTM) is introduced into the DDPG network, the former and current states of the mobile robot are combined to determine the actions of the robot, and a Batch Norm layer is added after each layer of the Actor network. At the same time, the reward function is optimized to guide the mobile robot to move faster towards the target point. In order to improve the learning efficiency, different normalization methods are used to normalize the distance and angle between the mobile robot and the target point, which are used as the input of the DDPG network model. When the model outputs the next action of the mobile robot, mixed noise composed of Gaussian noise and Ornstein-Uhlenbeck (OU) noise is added. Finally, the simulation environment built by a ROS system and a Gazebo platform is used for experiments. The results show that the proposed algorithm can accelerate the convergence speed of DDPG, improve the generalization ability of the path planning model and improve the efficiency and success rate of mobile robot path planning.
Video Data Retrieval using Image Color Histogram Technique

In this paper, a subspace-based multimedia data-mining framework is proposed for video semantic analysis; specifically Current content management systems support retrieval using low-level features, such as motion, color, and texture. The proposed frameworks achieves full automation via a knowledge-based video indexing and retrieve an appropriate result, and replace a presented object with the retrieval result in real time. Along with this indexing mechanism a histogram-based color descriptors also introduced to reliably capture and represent the color properties of multiple images. Including of this a classification approach is also carried out by the classified associations and by assigning, each of them with a class label, and uses their appearances in the video to construct video indices. Our experimental results demonstrate the performance of the proposed approach.
Abnormal Behavior Detection and Recognition Method Based on Improved ResNet Model

The core technology in an intelligent video surveillance system is that detecting and recognizing abnormal behaviors timely and accurately. The key breakthrough point in recognizing abnormal behaviors is how to obtain the effective features of the picture, so as to solve the problem of recognizing them. In response to this difficulty, this paper introduces an adjustable jump link coefficients model based on the residual network. The effective coefficients for each layer of the network can be set after using this model to further improving the recognition accuracy of abnormal behavior. A convolution kernel of 1×1 size is added to reduce the number of parameters for the purpose of improving the speed of the model in this paper. In order to reduce the noise of the data edge, and at the same time, improve the accuracy of the data and speed up the training, a BN (Batch Normalization) layer is added before the activation function in this network. This paper trains this network model on the public ImageNet dataset, and then uses the transfer learning method to recognize these abnormal behaviors of human in the UTI behavior dataset processed by the YOLO_v3 target detection network. Under the same experimental conditions, compared with the original ResNet-50 model, the improved model in this paper has a 2.8% higher accuracy in recognition of abnormal behaviors on the public UTI dataset.
S2SQL: Injecting Syntax to Question-Schema Interaction Graph Encoder for Text-to-SQL Parsers

The task of converting a natural language question into an executable SQL query, known as text-to-SQL, is an important branch of semantic parsing.The state-of-the-art graph-based encoder has been successfully used in this task but does not model the question syntax well.In this paper, we propose S 2 SQL, injecting Syntax to question-Schema graph encoder for Text-to-SQL parsers, which effectively leverages the syntactic dependency information of questions in text-to-SQL to improve the performance.We also employ the decoupling constraint to induce diverse relational edge embedding, which further improves the network's performance.Experiments on the Spider and robustness setting Spider-Syn demonstrate that the proposed approach outperforms all existing methods when pre-training models are used, resulting in a performance ranks first on the Spider leaderboard.
An efficient medical image encryption scheme for (WBAN) based on adaptive DNA and modern multi chaotic map

Abstract A Wireless Body Area Network (WBAN) is a network of wireless sensor nodes that can be installed inside or outside of the human body. This network is crucial in medical problems. Due to storage, battery power, and computational resource limitations, the security of medical information such as medical photographs or other information is a major concern in (WBAN). This work proposes an image encryption approach that addresses these constraints by utilizing adaptive DNA code bases and a new multi chaotic map architecture. DNA coding is used to enhances computing efficiency and gives great data transfer capabilities and the new multi chaotic map was formed by Combining Henon, Gaussian and Logistic map (HGL) To generate more chaotic pseudo-random sequences. Numerous analyses were conducted to test the proposed scheme, such as brute force, statistical, differential assaults and noise added analysis. Results indicated that this scheme has a strong level of security.
Newton series expansion of bosonic operator functions

We show how series expansions of functions of bosonic number operators are naturally derived from finite-difference calculus. The scheme employs Newton series rather than Taylor series known from differential calculus, and also works in cases where the Taylor expansion fails. For a function of number operators, such an expansion is automatically normal ordered. Applied to the Holstein-Primakoff representation of spins, the scheme yields an exact series expansion with a finite number of terms and, in addition, allows for a systematic expansion of the spin operators that respects the spin commutation relations within a truncated part of the full Hilbert space. Furthermore, the Newton series expansion strongly facilitates the calculation of expectation values with respect to coherent states. As a third example, we show that factorial moments and factorial cumulants arising in the context of photon or electron counting are a natural consequence of Newton series expansions. Finally, we elucidate the connection between normal ordering, Taylor and Newton series by determining a corresponding integral transformation, which is related to the Mellin transform.
QuantumNAT

Parameterized Quantum Circuits (PQC) are promising towards quantum advantage on near-term quantum hardware. However, due to the large quantum noises (errors), the performance of PQC models has a severe degradation on real quantum devices. Take Quantum Neural Network (QNN) as an example, the accuracy gap between noise-free simulation and noisy results on IBMQ-Yorktown for MNIST-4 classification is over 60%. Existing noise mitigation methods are general ones without leveraging unique characteristics of PQC; on the other hand, existing PQC work does not consider noise effect. To this end, we present QuantumNAT, a PQC-specific framework to perform noise-aware optimizations in both training and inference stages to improve robustness. We experimentally observe that the effect of quantum noise to PQC measurement outcome is a linear map from noise-free outcome with a scaling and a shift factor. Motivated by that, we propose post-measurement normalization to mitigate the feature distribution differences between noise-free and noisy scenarios. Furthermore, to improve the robustness against noise, we propose noise injection to the training process by inserting quantum error gates to PQC according to realistic noise models of quantum hardware. Finally, post-measurement quantization is introduced to quantize the measurement outcomes to discrete values, achieving the denoising effect. Extensive experiments on 8 classification tasks using 6 quantum devices demonstrate that QuantumNAT improves accuracy by up to 43%, and achieves over 94% 2-class, 80% 4-class, and 34% 10-class classification accuracy measured on real quantum computers. The code for construction and noise-aware training of PQC is available in the TorchQuantum library.
ReFRS: Resource-efficient Federated Recommender System for Dynamic and Diversified User Preferences

Owing to its nature of scalability and privacy by design, federated learning (FL) has received increasing interest in decentralized deep learning. FL has also facilitated recent research on upscaling and privatizing personalized recommendation services, using on-device data to learn recommender models locally. These models are then aggregated globally to obtain a more performant model while maintaining data privacy. Typically, federated recommender systems (FRSs) do not take into account the lack of resources and data availability at the end-devices. In addition, they assume that the interaction data between users and items is i.i.d. and stationary across end-devices (i.e., users), and that all local recommender models can be directly averaged without considering the user’s behavioral diversity. However, in real scenarios, recommendations have to be made on end-devices with sparse interaction data and limited resources. Furthermore, users’ preferences are heterogeneous and they frequently visit new items. This makes their personal preferences highly skewed, and the straightforwardly aggregated model is thus ill-posed for such non-i.i.d. data. In this article, we propose Resource Efficient Federated Recommender System (ReFRS) to enable decentralized recommendation with dynamic and diversified user preferences. On the device side, ReFRS consists of a lightweight self-supervised local model built upon the variational autoencoder for learning a user’s temporal preference from a sequence of interacted items. On the server side, ReFRS utilizes a scalable semantic sampler to adaptively perform model aggregation within each identified cluster of similar users. The clustering module operates in an asynchronous and dynamic manner to support efficient global model update and cope with shifting user interests. As a result, ReFRS achieves superior performance in terms of both accuracy and scalability, as demonstrated by comparative experiments on real datasets.