Search arXiv⌕ Search

arXiv subjects

Peng Zhang

Publications and source records attributed to Peng Zhang.

At least 595 records · Page 33Linked to original sources

Learning Multiple Explainable and Generalizable Cues for Face Anti-spoofing

Although previous CNN based face anti-spoofing methods have achieved promising performance under intra-dataset testing, they suffer from poor generalization under cross-dataset testing. The main reason is that they learn the network with only binary supervision, which may learn arbitrary cues overfitting on the training dataset. To make the learned feature explainable and more generalizable, some researchers introduce facial depth and reflection map as the auxiliary supervision. However, many other generalizable cues are unexplored for face anti-spoofing, which limits their performance under cross-dataset testing. To this end, we propose a novel framework to learn multiple explainable and generalizable cues (MEGC) for face anti-spoofing. Specifically, inspired by the process of human decision, four mainly used cues by humans are introduced as auxiliary supervision including the boundary of spoof medium, moiré pattern, reflection artifacts and facial depth in addition to the binary supervision. To avoid extra labelling cost, corresponding synthetic methods are proposed to generate these auxiliary supervision maps. Extensive experiments on public datasets validate the effectiveness of these cues, and state-of-the-art performances are achieved by our proposed method.

cs.CV↗

Tuning the entanglement growth in matrix-product-state evolution of quantum systems by nonunitary similarity transformations

The possibility of using similarity transformations to alter dynamical entanglement growth in matrix-product-state simulations of quantum systems is explored. By appropriately choosing the similarity transformation, the entanglement growth rate is suppressed, improving the efficiency of numerical simulations of quantum systems. The transformation can be applied to general quantum-many-body systems.

quant-ph↗

Universal energy-dependent pseudopotential for the two-body problem of confined ultracold atoms

The two-body scattering amplitude and energy spectrum of confined ultracold atoms are of fundamental importance for studies of ultracold atom physics. For many systems, one can efficiently calculate these quantities via the zero-range Huang-Yang pseudopotential (HYP), in which the interatomic interaction is characterized by the scattering length $a$. Furthermore, when the scattering length is dependent on the kinetic energy $\varepsilon_{\rm r}$ of two-atom relative motion, the results are applicable for a broad energy region. However, when the free Hamiltonian of atomic internal state does not commute with the inter-atomic interaction, or the center-of-mass (c.m.) motion is coupled to the relative motion, the generalization of this technique is still lacking. We solve this problem and construct a reasonable energy-dependent multi-channel HYP, which is characterized by a "scattering length operator" ${\hat a}_{\rm eff}$. Here ${\hat a}_{\rm eff}$ is an operator for atomic internal states and c.m. motion, and depends on both the total two-atom energy and the external field as well as the trapping parameter. The effects from the internal-state or c.m.-relative motion coupling can be self-consistently taken into account by ${\hat a}_{\rm eff}$. We further show a method based on the quantum defect theory, with which ${\hat a}_{\rm eff}$ can be analytically derived for systems with van der Waals inter-atomic interaction. To demonstrate our method, we calculate the spectrum of two ultracold fermionic alkaline-earth-like atoms confined in an optical lattice. By comparing our results with the recent experimental measurements for two Yb173 atoms and two Yb171 atoms, we calibrate the scattering lengths $a_{\pm}$ with respect to anti-symmetric and symmetric nuclear-spin states to be $a_{+}=2012(19)a_{0}$ and $a_{-}=193(4)a_{0}$ for Yb173, and $a_{+}=232(3)a_{0}$ and $a_{-}=372(1)a_{0}$ for Yb171.

cond-mat.quant-gas↗

Hardness Results for Laplacians of Simplicial Complexes via Sparse-Linear Equation Complete Gadgets

We study linear equations in combinatorial Laplacians of $k$-dimensional simplicial complexes ($k$-complexes), a natural generalization of graph Laplacians. Combinatorial Laplacians play a crucial role in homology and are a central tool in topology. Beyond this, they have various applications in data analysis and physical modeling problems. It is known that nearly-linear time solvers exist for graph Laplacians. However, nearly-linear time solvers for combinatorial Laplacians are only known for restricted classes of complexes. This paper shows that linear equations in combinatorial Laplacians of 2-complexes are as hard to solve as general linear equations. More precisely, for any constant $c \geq 1$, if we can solve linear equations in combinatorial Laplacians of 2-complexes up to high accuracy in time $\tilde{O}((\# \text{ of nonzero coefficients})^c)$, then we can solve general linear equations with polynomially bounded integer coefficients and condition numbers up to high accuracy in time $\tilde{O}((\# \text{ of nonzero coefficients})^c)$. We prove this by a nearly-linear time reduction from general linear equations to combinatorial Laplacians of 2-complexes. Our reduction preserves the sparsity of the problem instances up to poly-logarithmic factors.

cs.CC↗

Two-Commodity Flow is Equivalent to Linear Programming under Nearly-Linear Time Reductions

We give a nearly-linear time reduction that encodes any linear program as a 2-commodity flow problem with only a small blow-up in size. Under mild assumptions similar to those employed by modern fast solvers for linear programs, our reduction causes only a polylogarithmic multiplicative increase in the size of the program and runs in nearly-linear time. Our reduction applies to high-accuracy approximation algorithms and exact algorithms. Given an approximate solution to the 2-commodity flow problem, we can extract a solution to the linear program in linear time with only a polynomial factor increase in the error. This implies that any algorithm that solves the 2-commodity flow problem can solve linear programs in essentially the same time. Given a directed graph with edge capacities and two source-sink pairs, the goal of the 2-commodity flow problem is to maximize the sum of the flows routed between the two source-sink pairs subject to edge capacities and flow conservation. A 2-commodity flow can be directly written as a linear program, and thus we establish a nearly-tight equivalence between these two classes of problems. Our proof follows the outline of Itai's polynomial-time reduction of a linear program to a 2-commodity flow problem (JACM'78). Itai's reduction shows that exactly solving 2-commodity flow and exactly solving linear programming are polynomial-time equivalent. We improve Itai's reduction to nearly preserve the problem representation size in each step. In addition, we establish an error bound for approximately solving each intermediate problem in the reduction, and show that the accumulated error is polynomially bounded. We remark that our reduction does not run in strongly polynomial time and that it is open whether 2-commodity flow and linear programming are equivalent in strongly polynomial time.

cs.CC↗

Vortex Interaction in Triple Flickering Buoyant Diffusion Flames

Triple flickering buoyant diffusion flames as a nonlinear dynamical system of coupled oscillators were computationally investigated. The four distinct dynamical modes (in-phase, death, rotation, and partial in-phase) observed in the previous candle-flame experiments were computationally reproduced for jet diffusion flames of methane. The four modes were interpreted from the perspective of vortex interaction and particularly of vorticity reconnection and vortex-induced flow. Specifically, the in-phase mode is caused by the periodic shedding of the trefoil vortex formed by the reconnection of three toroidal vortices; the death mode is due to the suppression of vortex shedding at small Reynolds numbers; the rotation mode appears as three toroidal vortices alternatively shed off with a constant phase difference; the partial in-phase model is caused by the vorticity reconnection of two toroidal vortices leaving another one shedding off in anti-phase.

physics.flu-dyn↗

Dynamical Mode Recognition of Triple Flickering Buoyant Diffusion Flames: from Physical Space to Phase Space and to Wasserstein Space

Triple flickering buoyant diffusion flames in an isosceles triangle arrangement were experimentally studied as a nonlinear dynamical system of coupled oscillators. The objective of the study is two-fold: to establish a well-controlled gas-fuel diffusion flame experiment that can remedy the deficiencies of previous candle-flame experiments, and to develop an objective methodology for dynamical mode recognition that is based on the Wasserstein distance between distribution functions of phase points and can be readily generalized to larger dynamical system consisting of more than three flames. By using the present experiment and methodology, we recognized seven distinct stable dynamical modes, such as in-phase mode, flickering death mode, partial flickering death mode, partial in-phase mode, rotation mode, partial decoupled mode, and decoupled mode. These results generalize the literature results for triple flickering flame system in a straight-line and equal-lateral triangle arrangement. The identification or discrimination of two dynamical modes can be quantified as the small or large Wasserstein distance, respectively.

physics.flu-dyn↗

CODE: Contrastive Pre-training with Adversarial Fine-tuning for Zero-shot Expert Linking

Expert finding, a popular service provided by many online websites such as Expertise Finder, LinkedIn, and AMiner, is beneficial to seeking candidate qualifications, consultants, and collaborators. However, its quality is suffered from lack of ample sources of expert information. This paper employs AMiner as the basis with an aim at linking any external experts to the counterparts on AMiner. As it is infeasible to acquire sufficient linkages from arbitrary external sources, we explore the problem of zero-shot expert linking. In this paper, we propose CODE, which first pre-trains an expert linking model by contrastive learning on AMiner such that it can capture the representation and matching patterns of experts without supervised signals, then it is fine-tuned between AMiner and external sources to enhance the models transferability in an adversarial manner. For evaluation, we first design two intrinsic tasks, author identification and paper clustering, to validate the representation and matching capability endowed by contrastive learning. Then the final external expert linking performance on two genres of external sources also implies the superiority of the adversarial fine-tuning method. Additionally, we show the online deployment of CODE, and continuously improve its online performance via active learning.

cs.IR↗

An Intelligent Self-driving Truck System For Highway Transportation

Recently, there have been many advances in autonomous driving society, attracting a lot of attention from academia and industry. However, existing works mainly focus on cars, extra development is still required for self-driving truck algorithms and models. In this paper, we introduce an intelligent self-driving truck system. Our presented system consists of three main components, 1) a realistic traffic simulation module for generating realistic traffic flow in testing scenarios, 2) a high-fidelity truck model which is designed and evaluated for mimicking real truck response in real-world deployment, 3) an intelligent planning module with learning-based decision making algorithm and multi-mode trajectory planner, taking into account the truck's constraints, road slope changes, and the surrounding traffic flow. We provide quantitative evaluations for each component individually to demonstrate the fidelity and performance of each part. We also deploy our proposed system on a real truck and conduct real world experiments which shows our system's capacity of mitigating sim-to-real gap. Our code is available at https://github.com/InceptioResearch/IITS

cs.RO↗

MSHT: Multi-stage Hybrid Transformer for the ROSE Image Analysis of Pancreatic Cancer

Pancreatic cancer is one of the most malignant cancers in the world, which deteriorates rapidly with very high mortality. The rapid on-site evaluation (ROSE) technique innovates the workflow by immediately analyzing the fast stained cytopathological images with on-site pathologists, which enables faster diagnosis in this time-pressured process. However, the wider expansion of ROSE diagnosis has been hindered by the lack of experienced pathologists. To overcome this problem, we propose a hybrid high-performance deep learning model to enable the automated workflow, thus freeing the occupation of the valuable time of pathologists. By firstly introducing the Transformer block into this field with our particular multi-stage hybrid design, the spatial features generated by the convolutional neural network (CNN) significantly enhance the Transformer global modeling. Turning multi-stage spatial features as global attention guidance, this design combines the robustness from the inductive bias of CNN with the sophisticated global modeling power of Transformer. A dataset of 4240 ROSE images is collected to evaluate the method in this unexplored field. The proposed multi-stage hybrid Transformer (MSHT) achieves 95.68% in classification accuracy, which is distinctively higher than the state-of-the-art models. Facing the need for interpretability, MSHT outperforms its counterparts with more accurate attention regions. The results demonstrate that the MSHT can distinguish cancer samples accurately at an unprecedented image scale, laying the foundation for deploying automatic decision systems and enabling the expansion of ROSE in clinical practice. The code and records are available at: https://github.com/sagizty/Multi-Stage-Hybrid-Transformer.

eess.IV↗

Dark Matter Search Results from the PandaX-4T Commissioning Run

We report the first dark matter search results using the commissioning data from PandaX-4T. Using a time projection chamber with 3.7-tonne of liquid xenon target and an exposure of 0.63 tonne$\cdot$year, 1058 candidate events are identified within an approximate nuclear recoil energy window between 5 and 100 keV. No significant excess over background is observed. Our data set a stringent limit to the dark matter-nucleon spin-independent interactions, with a lowest excluded cross section (90% C.L.) of $3.8\times10^{-47} $cm$^2$ at a dark matter mass of 30 GeV/$c^2$.

hep-ex↗

Mesoscopic Transport of Quantum Anomalous Hall Effect in Sub-Micron Size Regime

The quantum anomalous Hall (QAH) effect has been demonstrated in two-dimensional topological insulator systems incorporated with ferromagnetism. However, a comprehensive understanding of mesoscopic transport in sub-micron QAH devices has yet been established. Here we fabricated miniaturized QAH devices with channel widths down to 600 nm, where the QAH features are still preserved. A back-scattering channel is formed in narrow QAH devices through percolative hopping between 2D compressible puddles. Large resistance fluctuations are observed in narrow devices near the coercive field, which is associated with collective interference between intersecting paths along domain walls when the device geometry is smaller than the phase coherence length $L_ϕ$. Through measurement of size-dependent breakdown current, we confirmed that the chiral edge states are confined at the physical boundary with its width on the order of Fermi wavelength.

cond-mat.mes-hall↗

Automated assessment of disease severity of COVID-19 using artificial intelligence with synthetic chest CT

Background: Triage of patients is important to control the pandemic of coronavirus disease 2019 (COVID-19), especially during the peak of the pandemic when clinical resources become extremely limited. Purpose: To develop a method that automatically segments and quantifies lung and pneumonia lesions with synthetic chest CT and assess disease severity in COVID-19 patients. Materials and Methods: In this study, we incorporated data augmentation to generate synthetic chest CT images using public available datasets (285 datasets from "Lung Nodule Analysis 2016"). The synthetic images and masks were used to train a 2D U-net neural network and tested on 203 COVID-19 datasets to generate lung and lesion segmentations. Disease severity scores (DL: damage load; DS: damage score) were calculated based on the segmentations. Correlations between DL/DS and clinical lab tests were evaluated using Pearson's method. A p-value < 0.05 was considered as statistical significant. Results: Automatic lung and lesion segmentations were compared with manual annotations. For lung segmentation, the median values of dice similarity coefficient, Jaccard index and average surface distance, were 98.56%, 97.15% and 0.49 mm, respectively. The same metrics for lesion segmentation were 76.95%, 62.54% and 2.36 mm, respectively. Significant (p << 0.05) correlations were found between DL/DS and percentage lymphocytes tests, with r-values of -0.561 and -0.501, respectively. Conclusion: An AI system that based on thoracic radiographic and data augmentation was proposed to segment lung and lesions in COVID-19 patients. Correlations between imaging findings and clinical lab tests suggested the value of this system as a potential tool to assess disease severity of COVID-19.

eess.IV↗

The In-Flight Realtime Trigger and Localization Software of GECAM

Realtime trigger and localization of bursts are the key functions of GECAM, which is an all-sky gamma-ray monitor launched in Dec 10, 2020. We developed a multifunctional trigger and localization software operating on the CPU of the GECAM electronic box (EBOX). This onboard software has the following features: high trigger efficiency for real celestial bursts with a suppression of false triggers caused by charged particle bursts and background fluctuation, dedicated localization algorithm optimized for short and long bursts respetively, short time latency of the trigger information which is downlinked throught the BeiDou satellite navigation System (BDS). This paper presents the detailed design and deveopment of this trigger and localization software system of GECAM, including the main functions, general design, workflow and algorithms, as well as the verification and demonstration of this software, including the on-ground trigger tests with simulated gamma-ray bursts made by a dedicated X-ray tube and the in-flight performance to real gamma-ray bursts and magnetar bursts.

astro-ph.IM↗

The design and implementation of GECAM satellite payload performance monitoring software

Background The Gravitational wave high-energy Electromagnetic Counterpart All-sky Monitor (GECAM) is primarily designed to spot gamma-ray bursts corresponding to gravitational waves. In order to achieve stable observations from various astronomical phenomena, the payload performance need to be monitored during the in-orbit operation. Method This article describes the design and implementation of GECAM satellite payload performance monitoring (GPPM) software. The software extracts the payload status and telescope observations (light curves, energy spectrums, characteristic peak fitting of energy spectrums, etc) from the payload data. Considering the large amount of payload status parameters in the engineering data, we have designed a method of parameter processing based on the configuration tables. This method can deal with the frequent changes of the data formats and facilitate program maintenance. Payload status and performance are monitored through defined thresholds and monitoring reports. The entire software is implemented in python language and the huge amount of observation data is stored in MongoDB. Conclusion The design and implementation of GPPM software have been completed, tested with ground and in-orbit payload data. The software can monitor the performance of GECAM payload effectively. The overall design of the software and the data processing method can be applied to other satellites.

astro-ph.IM↗

Light yield and field dependence measurement in PandaX-II dual-phase xenon detector

The dual-phase xenon time projection chamber (TPC) is one of the most sensitive detector technology for dark matter direct search, where the energy deposition of incoming particle can be converted into photons and electrons through xenon excitation and ionization. The detector response to signal energy deposition varies significantly with the electric field in liquid xenon. We study the detector's light yield and its dependence on the electric field in the PandaX-II dual-phase detector containing 580~kg liquid xenon in the sensitive volume. From our measurements, the light yield at electric fields from 0~V/cm to 317~V/cm is obtained for energy depositions up to 236~keV.

physics.ins-det↗

Residual Matrix Product State for Machine Learning

Tensor network, which originates from quantum physics, is emerging as an efficient tool for classical and quantum machine learning. Nevertheless, there still exists a considerable accuracy gap between tensor network and the sophisticated neural network models for classical machine learning. In this work, we combine the ideas of matrix product state (MPS), the simplest tensor network structure, and residual neural network and propose the residual matrix product state (ResMPS). The ResMPS can be treated as a network where its layers map the "hidden" features to the outputs (e.g., classifications), and the variational parameters of the layers are the functions of the features of the samples (e.g., pixels of images). This is different from neural network, where the layers map feed-forwardly the features to the output. The ResMPS can equip with the non-linear activations and dropout layers, and outperforms the state-of-the-art tensor network models in terms of efficiency, stability, and expression power. Besides, ResMPS is interpretable from the perspective of polynomial expansion, where the factorization and exponential machines naturally emerge. Our work contributes to connecting and hybridizing neural and tensor networks, which is crucial to further enhance our understand of the working mechanisms and improve the performance of both models.

cs.LG↗

Improved Efficiency of Open Quantum System Simulations Using Matrix Products States in the Interaction Picture

Modeling open quantum systems -- quantum systems coupled to a bath -- is of value in condensed matter theory, cavity quantum electrodynamics, nanosciences and biophysics. The real-time simulation of open quantum systems was advanced significantly by the recent development of chain mapping techniques and the use of matrix product states that exploit the intrinsic entanglement structure in open quantum systems. The computational cost of simulating open quantum systems, however, remains high when the bath is excited to high-lying quantum states. We develop an approach to reduce the computational costs in such cases. The interaction representation for the open quantum system is used to distribute excitations among the bath degrees of freedom so that the occupation of each bath oscillator is ensured to be low. The interaction picture also causes the matrix dimensions to be much smaller in a matrix product state of a chain-mapped open quantum system than in the Schrödinger picture. Using the interaction representation accelerates the calculations by 1-2 orders of magnitude over existing matrix-product-state method. In the regime of strong system-bath coupling and high temperatures, the speedup can be as large as 3 orders of magnitude. The approach developed here is especially promising to simulate the dynamics of open quantum systems in the high-temperature and strong-coupling regimes.

quant-ph↗