Searcharxiv⌕ Search

arXiv subjects

Peng Zhang

Publications and source records attributed to Peng Zhang.

At least 577 records · Page 32Linked to original sources

Laser Manipulation of Spin-Exchange Interaction Between Alkaline-Earth Atoms in $^1$S$_0$ and $^3$P$_2$ States

Ultracold gases of fermionic alkaline-earth (like) atoms are hopeful candidates for the quantum simulation of many-body physics induced by magnetic impurities (e.g., the Kondo physics), because there are spin-exchange interactions (SEIs) between two atoms in the electronic ground ($^1$S$_0$) and metastable ($^3$P) state, respectively. Nevertheless, this SEI cannot be tuned via magnetic Feshbach resonance. In this work we propose three methods to control the SEI between one atom in the $^1$S$_0$ state and another atom in the $^3$P$_2$ states or $^3$P$_2$-$^3$P$_0$ dressed states, with one or two laser beams.These methods are based on the spin-dependent AC-Stark shifts of the $^3$P$_2$ states, or the $^3$P$_2$-$^3$P$_0$ Raman coupling. We show that due to the structure of alkaline-earth (like) atoms, the heating effects induced by the laser beams of our methods are very weak. For instance, for ultracold Yb atoms, AC-Stark-shift difference of variant spin states of the $^3$P$_2(F=3/2)$ level, or the strength of the $^3$P$_2$-$^3$P$_0$ Raman coupling, could be of the order of $(2π)$MHz, while the heating rate (photon scattering rate) is only of the order of Hz. As a result, the Feshbach resonances, with which one can efficiently control the SEI by changing the laser intensity, may be induced by the laser beams with low-enough heating rate, even if the scattering lengths of the bare inter-atomic interaction are so small that being comparable with the length scale associated with the van der Waals interaction.

cond-mat.quant-gas↗

Botnets Breaking Transformers: Localization of Power Botnet Attacks Against the Distribution Grid

Traditional botnet attacks leverage large and distributed numbers of compromised internet-connected devices to target and overwhelm other devices with internet packets. With increasing consumer adoption of high-wattage internet-facing "smart devices", a new "power botnet" attack emerges, where such devices are used to target and overwhelm power grid devices with unusual load demand. We introduce a variant of this attack, the power-botnet weardown-attack, which does not intend to cause blackouts or short-term acute instability, but instead forces expensive mechanical components to activate more frequently, necessitating costly replacements / repairs. Specifically, we target the on-load tap-changer (OLTC) transformer, which uses a mechanical switch that responds to change in load demand. In our analysis and simulations, these attacks can halve the lifespan of an OLTC, or in the most extreme cases, reduce it to $2.5\%$ of its original lifespan. Notably, these power botnets are composed of devices not connected to the internal SCADA systems used to control power grids. This represents a new internet-based cyberattack that targets the power grid from the outside. To help the power system to mitigate these types of botnet attacks, we develop attack-localization strategies. We formulate the problem as a supervised machine learning task to locate the source of power botnet attacks. Within a simulated environment, we generate the training and testing dataset to evaluate several machine learning algorithm based localization methods, including SVM, neural network and decision tree. We show that decision-tree based classification successfully identifies power botnet attacks and locates compromised devices with at least $94\%$ improvement of accuracy over a baseline "most-frequent" classifier.

cs.CR↗

An Audio-Visual Attention Based Multimodal Network for Fake Talking Face Videos Detection

DeepFake based digital facial forgery is threatening the public media security, especially when lip manipulation has been used in talking face generation, the difficulty of fake video detection is further improved. By only changing lip shape to match the given speech, the facial features of identity is hard to be discriminated in such fake talking face videos. Together with the lack of attention on audio stream as the prior knowledge, the detection failure of fake talking face generation also becomes inevitable. Inspired by the decision-making mechanism of human multisensory perception system, which enables the auditory information to enhance post-sensory visual evidence for informed decisions output, in this study, a fake talking face detection framework FTFDNet is proposed by incorporating audio and visual representation to achieve more accurate fake talking face videos detection. Furthermore, an audio-visual attention mechanism (AVAM) is proposed to discover more informative features, which can be seamlessly integrated into any audio-visual CNN architectures by modularization. With the additional AVAM, the proposed FTFDNet is able to achieve a better detection performance on the established dataset (FTFDD). The evaluation of the proposed work has shown an excellent performance on the detection of fake talking face videos, which is able to arrive at a detection rate above 97%.

cs.CV↗

Attention-Based Lip Audio-Visual Synthesis for Talking Face Generation in the Wild

Talking face generation with great practical significance has attracted more attention in recent audio-visual studies. How to achieve accurate lip synchronization is a long-standing challenge to be further investigated. Motivated by xxx, in this paper, an AttnWav2Lip model is proposed by incorporating spatial attention module and channel attention module into lip-syncing strategy. Rather than focusing on the unimportant regions of the face image, the proposed AttnWav2Lip model is able to pay more attention on the lip region reconstruction. To our limited knowledge, this is the first attempt to introduce attention mechanism to the scheme of talking face generation. An extensive experiments have been conducted to evaluate the effectiveness of the proposed model. Compared to the baseline measured by LSE-D and LSE-C metrics, a superior performance has been demonstrated on the benchmark lip synthesis datasets, including LRW, LRS2 and LRS3.

cs.CV↗

Audio-visual speech separation based on joint feature representation with cross-modal attention

Multi-modal based speech separation has exhibited a specific advantage on isolating the target character in multi-talker noisy environments. Unfortunately, most of current separation strategies prefer a straightforward fusion based on feature learning of each single modality, which is far from sufficient consideration of inter-relationships between modalites. Inspired by learning joint feature representations from audio and visual streams with attention mechanism, in this study, a novel cross-modal fusion strategy is proposed to benefit the whole framework with semantic correlations between different modalities. To further improve audio-visual speech separation, the dense optical flow of lip motion is incorporated to strengthen the robustness of visual representation. The evaluation of the proposed work is performed on two public audio-visual speech separation benchmark datasets. The overall improvement of the performance has demonstrated that the additional motion network effectively enhances the visual representation of the combined lip images and audio signal, as well as outperforming the baseline in terms of all metrics with the proposed cross-modal fusion.

cs.SD↗

Three-dimensional Propagation of the Global EUV Wave associated with a solar eruption on 2021 October 28

We present a case study for the global extreme ultraviolet (EUV) wave and its chromospheric counterpart `Moreton-Ramsey wave' associated with the second X-class flare in Solar Cycle 25 and a halo coronal mass ejection (CME). The EUV wave was observed in the H$α$ and EUV passbands with different characteristic temperatures. In the 171 Å and 193/195 Å images, the wave propagates circularly with an initial velocity of 600-720 km s$^{-1}$ and a deceleration of 110-320 m s$^{-2}$. The local coronal plasma is heated from log(T/K)=5.9 to log(T/K)=6.2 during the passage of the wavefront. The H$α$ and 304 Å images also reveal signatures of wave propagation with a velocity of 310-540 km s$^{-1}$. With multi-wavelength and dual-perspective observations, we found that the wavefront likely propagates forwardly inclined to the solar surface with a tilt angle of ~53.2$^{\circ}$. Our results suggest that this EUV wave is a fast-mode magnetohydrodynamic wave or shock driven by the expansion of the associated CME, whose wavefront is likely a dome-shaped structure that could impact the upper chromosphere, transition region and corona.

astro-ph.SR↗

Absolute Zero-Shot Learning

Considering the increasing concerns about data copyright and privacy issues, we present a novel Absolute Zero-Shot Learning (AZSL) paradigm, i.e., training a classifier with zero real data. The key innovation is to involve a teacher model as the data safeguard to guide the AZSL model training without data leaking. The AZSL model consists of a generator and student network, which can achieve date-free knowledge transfer while maintaining the performance of the teacher network. We investigate `black-box' and `white-box' scenarios in AZSL task as different levels of model security. Besides, we also provide discussion of teacher model in both inductive and transductive settings. Despite embarrassingly simple implementations and data-missing disadvantages, our AZSL framework can retain state-of-the-art ZSL and GZSL performance under the `white-box' scenario. Extensive qualitative and quantitative analysis also demonstrates promising results when deploying the model under `black-box' scenario.

cs.CV↗

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↗