Search

Bayesian methods are used to constrain the density dependence of the QCD Equation of State (EoS) for dense nuclear matter using the data of mean transverse kinetic energy and elliptic flow of protons from heavy ion collisions (HIC), in the beam energy range $\sqrt{s_{\mathrm{NN}}}=2-10 GeV$. The analysis yields tight constraints on the density dependent EoS up to 4 times the nuclear saturation density. The extracted EoS yields good agreement with other observables measured in HIC experiments and constraints from astrophysical observations both of which were not used in the inference. The sensitivity of inference to the choice of observables is also discussed., Comment: Replaced with the published version

The robustness of recommender systems under node injection attacks has garnered significant attention. Recently, GraphRfi, a GNN-based recommender system, was proposed and shown to effectively mitigate the impact of injected fake users. However, we demonstrate that GraphRfi remains vulnerable to attacks due to the supervised nature of its fraudster detection component, where obtaining clean labels is challenging in practice. In particular, we propose a powerful poisoning attack, MetaC, against both GNN-based and MF-based recommender systems. Furthermore, we analyze why GraphRfi fails under such an attack. Then, based on our insights obtained from vulnerability analysis, we design an adaptive fraudster detection module that explicitly considers label uncertainty. This module can serve as a plug-in for different recommender systems, resulting in a robust framework named PDR. Comprehensive experiments show that our defense approach outperforms other benchmark methods under attacks. Overall, our research presents an effective framework for integrating fraudster detection into recommendation systems to achieve adversarial robustness.

As an alternative but unified and more fundamental description for quantum physics, Feynman path integrals generalize the classical action principle to a probabilistic perspective, under which the physical observables' estimation translates into a weighted sum over all possible paths. The underlying difficulty is to tackle the whole path manifold from finite samples that can effectively represent the Feynman propagator dictated probability distribution. Modern generative models in machine learning can handle learning and representing probability distribution with high computational efficiency. In this study, we propose a Fourier-flow generative model to simulate the Feynman propagator and generate paths for quantum systems. As demonstration, we validate the path generator on the harmonic and anharmonic oscillators. The latter is a double-well system without analytic solutions. To preserve the periodic condition for the system, the Fourier transformation is introduced into the flow model to approach a Matsubara representation. With this novel development, the ground-state wave function and low-lying energy levels are estimated accurately. Our method offers a new avenue to investigate quantum systems with machine learning assisted Feynman Path integral solving.

Graph Neural Networks (GNNs) are vulnerable to data poisoning attacks, which will generate a poisoned graph as the input to the GNN models. We present FocusedCleaner as a poisoned graph sanitizer to effectively identify the poison injected by attackers. Specifically, FocusedCleaner provides a sanitation framework consisting of two modules: bi-level structural learning and victim node detection. In particular, the structural learning module will reverse the attack process to steadily sanitize the graph while the detection module provides ``the focus" -- a narrowed and more accurate search region -- to structural learning. These two modules will operate in iterations and reinforce each other to sanitize a poisoned graph step by step. As an important application, we show that the adversarial robustness of GNNs trained over the sanitized graph for the node classification task is significantly improved. Extensive experiments demonstrate that FocusedCleaner outperforms the state-of-the-art baselines both on poisoned graph sanitation and improving robustness.

Neutron star observables like masses, radii, and tidal deformability are direct probes to the dense matter equation of state~(EoS). A novel deep learning method that optimizes an EoS in the automatic differentiation framework of solving inverse problems is presented. The trained neural network EoS yields narrow bands for the relationship between the pressure and speed of sound as a function of the mass density. The results are consistent with those obtained from conventional approaches and the observational bound on the tidal deformability inferred from the gravitational wave event, GW170817., Comment: 7 pages, 5 figures

Multiple line outages that occur together show a variety of spatial patterns in the power transmission network. Some of these spatial patterns form network contingency motifs, which we define as the patterns of multiple outages that occur much more frequently than multiple outages chosen randomly from the network. We show that choosing N-k contingencies from these commonly occurring contingency motifs accounts for most of the probability of multiple initiating line outages. This result is demonstrated using historical outage data for two transmission systems. It enables N-k contingency lists that are much more efficient in accounting for the likely multiple initiating outages than exhaustive listing or random selection. The N-k contingency lists constructed from motifs can improve risk estimation in cascading outage simulations and help to confirm utility contingency selection.

We present lattice QCD calculations of valence parton distribution function (PDF) of pion employing next-to-next-leading-order (NNLO) perturbative QCD matching. Our calculations are based on three gauge ensembles of 2+1 flavor highly improved staggered quarks and Wilson--Clover valance quarks, corresponding to pion mass $m_\pi=140$~MeV at a lattice spacing $a=0.076$~fm and $m_\pi=300$~MeV at $a=0.04, 0.06$~fm. This enables us to present, for the first time, continuum-extrapolated lattice QCD results for NNLO valence PDF of the pion at the physical point. Applying leading-twist expansion for renormalization group invariant (RGI) ratios of bi-local pion matrix elements with NNLO Wilson coefficients we extract $2^{\mathrm{nd}}$, $4^{\mathrm{th}}$ and $6^{\mathrm{th}}$ Mellin moments of the PDF. We reconstruct the Bjorken-$x$ dependence of the NNLO PDF from real-space RGI ratios using a deep neural network (DNN) as well as from momentum-space matrix elements renormalized using a hybrid-scheme. All our results are in broad agreement with the results of global fits to the experimental data carried out by the xFitter and JAM collaborations., Comment: 25 pages, 29 figures, version published in PRD

Signed social networks are widely used to model the trust relationships among online users in security-sensitive systems such as cryptocurrency trading platforms, where trust prediction plays a critical role. In this paper, we investigate how attackers could mislead trust prediction by secretly manipulating signed networks. To this end, we first design effective poisoning attacks against representative trust prediction models. The attacks are formulated as hard bi-level optimization problems, for which we propose several efficient approximation solutions. However, the resulting basic attacks would severely change the structural semantics (in particular, both local and global balance properties) of a signed network, which makes the attacks prone to be detected by the powerful attack detectors we designed. Given this, we further refine the basic attacks by integrating some conflicting metrics as penalty terms into the objective function. The refined attacks become secrecy-aware, i.e., they can successfully evade attack detectors with high probability while sacrificing little attack performance. We conduct comprehensive experiments to demonstrate that the basic attacks can severely disrupt trust prediction but could be easily detected, and the refined attacks perform almost equally well while evading detection. Overall, our results significantly advance the knowledge in designing more practical attacks, reflecting more realistic threats to current trust prediction models. Moreover, the results also provide valuable insights and guidance for building up robust trust prediction systems.

The success of graph neural networks stimulates the prosperity of graph mining and the corresponding downstream tasks including graph anomaly detection (GAD). However, it has been explored that those graph mining methods are vulnerable to structural manipulations on relational data. That is, the attacker can maliciously perturb the graph structures to assist the target nodes to evade anomaly detection. In this paper, we explore the structural vulnerability of two typical GAD systems: unsupervised FeXtra-based GAD and supervised GCN-based GAD. Specifically, structural poisoning attacks against GAD are formulated as complex bi-level optimization problems. Our first major contribution is then to transform the bi-level problem into one-level leveraging different regression methods. Furthermore, we propose a new way of utilizing gradient information to optimize the one-level optimization problem in the discrete domain. Comprehensive experiments demonstrate the effectiveness of our proposed attack algorithm BinarizedAttack., Comment: arXiv admin note: substantial text overlap with arXiv:2106.09989

Gaussian boson sampling is originally proposed to show quantum advantage with quantum linear optical elements. Recently, several experimental breakthroughs based on Gaussian boson sampling pointing to quantum computing supremacy have been presented. However, due to technical limitations, the outcomes of Gaussian boson sampling devices are influenced severely by photon loss. Here, we present an efficient and practical method to reduce the negative effect caused by photon loss. With no hardware modifications, our method takes the data post-selection process that discards low-quality data according to our criterion to improve the performance of the final computational results, say part is better than whole. As an example, we show that the post-selection method can turn a GBS experiment that would otherwise fail in a ``non-classical test" into one that can pass that test. Besides improving the robustness of computation results of current GBS devices, this photon loss mitigation method may also benefit the further development of GBS-based quantum algorithms.

The detection and rapid characterisation of earthquake parameters such as magnitude are of prime importance in seismology, particularly in applications such as Earthquake Early Warning (EEW). Traditionally, algorithms such as STA/LTA are used for event detection, while frequency or amplitude domain parameters calculated from 1-3 seconds of first P-arrival data are sometimes used to provide a first estimate of (body wave) magnitude. Owing to extensive involvement of human experts in parameter determination, these approaches are often found to be insufficient. Moreover, these methods are sensitive to the signal to noise ratio and may often lead to false or missed alarms depending on the choice of parameters. We, therefore, propose a multitasking deep learning model the Convolutional Recurrent model for Earthquake Identification and Magnitude Estimation (CREIME) that: (i) detects the first earthquake signal, from background seismic noise, (ii) determines first P arrival time as well as (iii) estimates the magnitude using the raw 3-component waveform data from a single station as model input. Considering, speed is of essence in EEW, we use up to two seconds of P-wave information which, to the best of our knowledge, is a significantly smaller data window (5 second window with up to of P wave data) compared to the previous studies. To examine the robustness of CREIME we test it on two independent datasets and find that it achieves an average accuracy of 98 percent for event vs noise discrimination and is able to estimate first P arrival time and local magnitude with average root mean squared errors of 0.13 seconds and 0.65 units, respectively. We also compare CREIME architecture with architectures of other baseline models, by training them on the same data, and also with traditional algorithms such as STA/LTA, and show that our architecture outperforms these methods.

Reliable earthquake detection and seismic phase classification is often challenging especially in the circumstances of low magnitude events or poor signal-to-noise ratio. With improved seismometers and better global coverage, a sharp increase in the volume of recorded seismic data is witnessed. This makes the handling of the seismic data rather daunting based on traditional approaches and therefore fuels the need for a more robust and reliable method. In this study, we investigate two deep learningbased models, termed 1D ResidualNeuralNetwork (ResNet) and multi-branch ResNet, for tackling the problem of seismic signal detection and phase identification, especially the later can be used in the case where multiple classes is organized in the hierarchical format. These methods are trained and tested on the dataset of the Southern California Seismic Network. Results demonstrate that the proposed methods can achieve robust performance for the detection of seismic signals, and the identification of seismic phases, even when the seismic events are of small magnitude and are masked by noise. Compared with previously proposed deep learning methods, the introduced frameworks achieve 4% improvement in earthquake monitoring, and a slight enhancement in seismic phase classification.

With the rapid development of smart manufacturing, data-driven machinery health management has received a growing attention. As one of the most popular methods in machinery health management, deep learning (DL) has achieved remarkable successes. However, due to the issues of limited samples and poor separability of different cavitation states of acoustic signals, which greatly hinder the eventual performance of DL modes for cavitation intensity recognition and cavitation detection. In this work, a novel multi-task learning framework for simultaneous cavitation detection and cavitation intensity recognition framework using 1-D double hierarchical residual networks (1-D DHRN) is proposed for analyzing valves acoustic signals. Firstly, a data augmentation method based on sliding window with fast Fourier transform (Swin-FFT) is developed to alleviate the small-sample issue confronted in this study. Secondly, a 1-D double hierarchical residual block (1-D DHRB) is constructed to capture sensitive features from the frequency domain acoustic signals of valve. Then, a new structure of 1-D DHRN is proposed. Finally, the devised 1-D DHRN is evaluated on two datasets of valve acoustic signals without noise (Dataset 1 and Dataset 2) and one dataset of valve acoustic signals with realistic surrounding noise (Dataset 3) provided by SAMSON AG (Frankfurt). Our method has achieved state-of-the-art results. The prediction accurcies of 1-D DHRN for cavitation intensitys recognition are as high as 93.75%, 94.31% and 100%, which indicates that 1-D DHRN outperforms other DL models and conventional methods. At the same time, the testing accuracies of 1-D DHRN for cavitation detection are as high as 97.02%, 97.64% and 100%. In addition, 1-D DHRN has also been tested for different frequencies of samples and shows excellent results for frequency of samples that mobile phones can accommodate., Comment: arXiv admin note: text overlap with arXiv:2202.13226

With the rapid development of smart manufacturing, data-driven machinery health management has been of growing attention. In situations where some classes are more difficult to be distinguished compared to others and where classes might be organised in a hierarchy of categories, current DL methods can not work well. In this study, a novel hierarchical cavitation intensity recognition framework using Sub-Main Transfer Network, termed SMTNet, is proposed to classify acoustic signals of valve cavitation. SMTNet model outputs multiple predictions ordered from coarse to fine along a network corresponding to a hierarchy of target cavitation states. Firstly, a data augmentation method based on Sliding Window with Fast Fourier Transform (Swin-FFT) is developed to solve few-shot problem. Secondly, a 1-D double hierarchical residual block (1-D DHRB) is presented to capture sensitive features of the frequency domain valve acoustic signals. Thirdly, hierarchical multi-label tree is proposed to assist the embedding of the semantic structure of target cavitation states into SMTNet. Fourthly, experience filtering mechanism is proposed to fully learn a prior knowledge of cavitation detection model. Finally, SMTNet has been evaluated on two cavitation datasets without noise (Dataset 1 and Dataset 2), and one cavitation dataset with real noise (Dataset 3) provided by SAMSON AG (Frankfurt). The prediction accurcies of SMTNet for cavitation intensity recognition are as high as 95.32%, 97.16% and 100%, respectively. At the same time, the testing accuracies of SMTNet for cavitation detection are as high as 97.02%, 97.64% and 100%. In addition, SMTNet has also been tested for different frequencies of samples and has achieved excellent results of the highest frequency of samples of mobile phones., Comment: we need update this paper