arXiv subjects

Yong Xu

Publications and source records attributed to Yong Xu.

At least 271 records · Page 15Linked to original sources

arXiv2022

Elementary excitations in a spin-orbit-coupled spin-1 Bose-Einstein condensate

While a spin-orbit-coupled spin-1 Bose-Einstein condensate has been experimentally observed, its elementary excitations remain unclear in the stripe phase. Here, we systematically study the elementary excitations in three distinct phases of a spin-orbit-coupled spin-1 Bose-Einstein condensate. We find that the excitation spectrum as well as the corresponding static response function and structure factor depend strongly on spin-orbit coupling parameters such as the quadratic Zeeman field and the Rabi frequency. In the stripe phase, besides two gapless Goldstone modes, we show the existence of roton excitations. Finally, we demonstrate that quantum phase transitions between these different phases including the zero-momentum, plane wave and stripe phases are characterized by the sound velocities and the quantum depletion.

cond-mat.quant-gas↗

arXiv2022

Precise Laplace approximation for mixed rough differential equation

This work focuses on the Laplace approximation for the rough differential equation (RDE) driven by mixed rough path with as . Firstly, based on geometric rough path lifted from mixed fractional Brownian motion (fBm), the Schilder-type large deviation principle (LDP) for the law of the first level path of the solution to the RDE is given. Due to the particularity of mixed rough path, the main difficulty in carrying out the Laplace approximation is to prove the Hilbert-Schmidt property for the Hessian matrix of the Itô map restricted on the Cameron-Martin space of the mixed fBm. To this end, we imbed the Cameron-Martin space into a larger Hilbert space, then the Hessian is computable. Subsequently, the probability representation for the Hessian is shown. Finally, the Laplace approximation is constructed, which asserts the more precise asymptotics in the exponential scale.

math.PR↗

arXiv2022

Interactions between a propagating detonation wave and circular water cloud in hydrogen/air mixture

Interactions between a propagating hydrogen/air detonation wave and circular water cloud are studied. Eulerian Lagrangian method involving two-way gas-droplet coupling is applied. Different droplet (diameter, concentration) and cloud (diameter) properties are considered. Results show that droplet size, concentration and cloud radius have significant effects on peak pressure trajectory of the detonation wave. Three propagation modes are identified: perturbed propagation, leeward re-detonation, and detonation extinction. Leeward re-detonation is analyzed from unsteady evolutions of gas and liquid droplet quantities. The detonation is re-initiated by a local hot spot from shock focusing of upper and lower diffracted detonations. Disintegration of water droplets proceeds when the detonation wave crosses the cloud. In addition, detonation extinction is featured by quickly fading peak pressure trajectories when the detonation wave passes the larger cloud, and no local autoignition occurs in the shock focusing area. Evolutions of thermochemical structures from the shocked area in an extinction process are also studied. The transfer rates of mass, energy and momentum of detonation success and failure are analyzed. Moreover, parametric studies demonstrate that the critical cloud size to quench a detonation decreases when the droplet concentration is increased. However, when the droplet concentration is beyond 0.84 kg/m3, the critical cloud size is negligibly influenced due to small droplets. Two-phase fluid interfacial instability is observed, and the mechanism of cloud evolution is studied with the distributions of droplet, vorticity, density / pressure gradient magnitudes, and gas velocity.

physics.flu-dyn↗

arXiv2022

Multi-Behavior Sequential Recommendation with Temporal Graph Transformer

Modeling time-evolving preferences of users with their sequential item interactions, has attracted increasing attention in many online applications. Hence, sequential recommender systems have been developed to learn the dynamic user interests from the historical interactions for suggesting items. However, the interaction pattern encoding functions in most existing sequential recommender systems have focused on single type of user-item interactions. In many real-life online platforms, user-item interactive behaviors are often multi-typed (e.g., click, add-to-favorite, purchase) with complex cross-type behavior inter-dependencies. Learning from informative representations of users and items based on their multi-typed interaction data, is of great importance to accurately characterize the time-evolving user preference. In this work, we tackle the dynamic user-item relation learning with the awareness of multi-behavior interactive patterns. Towards this end, we propose a new Temporal Graph Transformer (TGT) recommendation framework to jointly capture dynamic short-term and long-range user-item interactive patterns, by exploring the evolving correlations across different types of behaviors. The new TGT method endows the sequential recommendation architecture to distill dedicated knowledge for type-specific behavior relational context and the implicit behavior dependencies. Experiments on the real-world datasets indicate that our method TGT consistently outperforms various state-of-the-art recommendation methods. Our model implementation codes are available at https://github.com/akaxlh/TGT.

cs.IR↗

arXiv2022

Distributed Newton Optimization with Maximized Convergence Rate

The distributed optimization problem is set up in a collection of nodes interconnected via a communication network. The goal is to find the minimizer of a global objective function formed by the addition of partial functions locally known at each node. A number of methods are available for addressing this problem, having different advantages. The goal of this work is to achieve the maximum possible convergence rate. As the first step towards this end, we propose a new method which we show converges faster than other available options. As with most distributed optimization methods, convergence rate depends on a step size parameter. As the second step towards our goal we complement the proposed method with a fully distributed method for estimating the optimal step size that maximizes convergence speed. We provide theoretical guarantees for the convergence of the resulting method in a neighborhood of the solution. Also, for the case in which the global objective function has a single local minimum, we provide a different step size selection criterion together with theoretical guarantees for convergence. We present numerical experiments showing that, when using the same step size, our method converges significantly faster than its rivals. Experiments also show that the distributed step size estimation method achieves an asymptotic convergence rate very close to the theoretical maximum.

math.OC↗

arXiv2022

Ultraviolet Freeze-in with a Time-dependent Inflaton Decay

It is typically assumed that during reheating the inflaton decays with a constant decay width. However, this is not guaranteed and can have a strong impact on the dark matter (DM) genesis. In the context of the ultraviolet (UV) freeze-in mechanism, if the operators connecting the dark and visible sectors are of sufficiently high mass dimension, the bulk of the DM abundance is produced during and not after reheating. We study here the impact of a time-dependent decay width of the inflaton on the DM abundance, emphasizing the differences with respect to the cases where the decay is either instantaneous or constant. We also provide concrete examples for DM production via UV freeze-in, e.g., from 2-to-2 scatterings of standard model particles, or from inflaton scatterings or decays, elucidating how the time-dependence influences the DM yield.

hep-ph↗

arXiv2022

Deniable Steganography

Steganography conceals the secret message into the cover media, generating a stego media which can be transmitted on public channels without drawing suspicion. As its countermeasure, steganalysis mainly aims to detect whether the secret message is hidden in a given media. Although the steganography techniques are improving constantly, the sophisticated steganalysis can always break a known steganographic method to some extent. With a stego media discovered, the adversary could find out the sender or receiver and coerce them to disclose the secret message, which we name as coercive attack in this paper. Inspired by the idea of deniable encryption, we build up the concepts of deniable steganography for the first time and discuss the feasible constructions for it. As an example, we propose a receiver-deniable steganographic scheme to deal with the receiver-side coercive attack using deep neural networks (DNN). Specifically, besides the real secret message, a piece of fake message is also embedded into the cover. On the receiver side, the real message can be extracted with an extraction module; while once the receiver has to surrender a piece of secret message under coercive attack, he can extract the fake message to deceive the adversary with another extraction module. Experiments demonstrate the scalability and sensitivity of the DNN-based receiver-deniable steganographic scheme.

cs.CR↗

arXiv2022

NeuralEcho: A Self-Attentive Recurrent Neural Network For Unified Acoustic Echo Suppression And Speech Enhancement

Acoustic echo cancellation (AEC) plays an important role in the full-duplex speech communication as well as the front-end speech enhancement for recognition in the conditions when the loudspeaker plays back. In this paper, we present an all-deep-learning framework that implicitly estimates the second order statistics of echo/noise and target speech, and jointly solves echo and noise suppression through an attention based recurrent neural network. The proposed model outperforms the state-of-the-art joint echo cancellation and speech enhancement method F-T-LSTM in terms of objective speech quality metrics, speech recognition accuracy and model complexity. We show that this model can work with speaker embedding for better target speech enhancement and furthermore develop a branch for automatic gain control (AGC) task to form an all-in-one front-end speech enhancement system.

eess.AS↗

arXiv2022

Deep-Learning Density Functional Theory Hamiltonian for Efficient ab initio Electronic-Structure Calculation

The marriage of density functional theory (DFT) and deep learning methods has the potential to revolutionize modern computational materials science. Here we develop a deep neural network approach to represent DFT Hamiltonian (DeepH) of crystalline materials, aiming to bypass the computationally demanding self-consistent field iterations of DFT and substantially improve the efficiency of ab initio electronic-structure calculations. A general framework is proposed to deal with the large dimensionality and gauge (or rotation) covariance of DFT Hamiltonian matrix by virtue of locality and is realized by the message passing neural network for deep learning. High accuracy, high efficiency and good transferability of the DeepH method are generally demonstrated for various kinds of material systems and physical properties. The method provides a solution to the accuracy-efficiency dilemma of DFT and opens opportunities to explore large-scale material systems, as evidenced by a promising application to study twisted van der Waals materials.

cond-mat.mtrl-sci↗

arXiv2022

Multi-Modal Transformer for Accelerated MR Imaging

Accelerated multi-modal magnetic resonance (MR) imaging is a new and effective solution for fast MR imaging, providing superior performance in restoring the target modality from its undersampled counterpart with guidance from an auxiliary modality. However, existing works simply combine the auxiliary modality as prior information, lacking in-depth investigations on the potential mechanisms for fusing different modalities. Further, they usually rely on the convolutional neural networks (CNNs), which is limited by the intrinsic locality in capturing the long-distance dependency. To this end, we propose a multi-modal transformer (MTrans), which is capable of transferring multi-scale features from the target modality to the auxiliary modality, for accelerated MR imaging. To capture deep multi-modal information, our MTrans utilizes an improved multi-head attention mechanism, named cross attention module, which absorbs features from the auxiliary modality that contribute to the target modality. Our framework provides three appealing benefits: (i) Our MTrans use an improved transformers for multi-modal MR imaging, affording more global information compared with existing CNN-based methods. (ii) A new cross attention module is proposed to exploit the useful information in each modality at different scales. The small patch in the target modality aims to keep more fine details, the large patch in the auxiliary modality aims to obtain high-level context features from the larger region and supplement the target modality effectively. (iii) We evaluate MTrans with various accelerated multi-modal MR imaging tasks, e.g., MR image reconstruction and super-resolution, where MTrans outperforms state-of-the-art methods on fastMRI and real-world clinical datasets.

eess.IV↗

arXiv2022

Spatial-Temporal Hypergraph Self-Supervised Learning for Crime Prediction

Crime has become a major concern in many cities, which calls for the rising demand for timely predicting citywide crime occurrence. Accurate crime prediction results are vital for the beforehand decision-making of government to alleviate the increasing concern about the public safety. While many efforts have been devoted to proposing various spatial-temporal forecasting techniques to explore dependence across locations and time periods, most of them follow a supervised learning manner, which limits their spatial-temporal representation ability on sparse crime data. Inspired by the recent success in self-supervised learning, this work proposes a Spatial-Temporal Hypergraph Self-Supervised Learning framework (ST-HSL) to tackle the label scarcity issue in crime prediction. Specifically, we propose the cross-region hypergraph structure learning to encode region-wise crime dependency under the entire urban space. Furthermore, we design the dual-stage self-supervised learning paradigm, to not only jointly capture local- and global-level spatial-temporal crime patterns, but also supplement the sparse crime representation by augmenting region self-discrimination. We perform extensive experiments on two real-life crime datasets. Evaluation results show that our ST-HSL significantly outperforms state-of-the-art baselines. Further analysis provides insights into the superiority of our ST-HSL method in the representation of spatial-temporal crime patterns. The implementation code is available at https://github.com/LZH-YS1998/STHSL.

cs.LG↗

arXiv2022

Hypergraph Contrastive Collaborative Filtering

Collaborative Filtering (CF) has emerged as fundamental paradigms for parameterizing users and items into latent representation space, with their correlative patterns from interaction data. Among various CF techniques, the development of GNN-based recommender systems, e.g., PinSage and LightGCN, has offered the state-of-the-art performance. However, two key challenges have not been well explored in existing solutions: i) The over-smoothing effect with deeper graph-based CF architecture, may cause the indistinguishable user representations and degradation of recommendation results. ii) The supervision signals (i.e., user-item interactions) are usually scarce and skewed distributed in reality, which limits the representation power of CF paradigms. To tackle these challenges, we propose a new self-supervised recommendation framework Hypergraph Contrastive Collaborative Filtering (HCCF) to jointly capture local and global collaborative relations with a hypergraph-enhanced cross-view contrastive learning architecture. In particular, the designed hypergraph structure learning enhances the discrimination ability of GNN-based CF paradigm, so as to comprehensively capture the complex high-order dependencies among users. Additionally, our HCCF model effectively integrates the hypergraph structure encoding with self-supervised learning to reinforce the representation quality of recommender systems, based on the hypergraph-enhanced self-discrimination. Extensive experiments on three benchmark datasets demonstrate the superiority of our model over various state-of-the-art recommendation methods, and the robustness against sparse user interaction data. Our model implementation codes are available at https://github.com/akaxlh/HCCF.

cs.IR↗

arXiv2022

Spatial-Temporal Sequential Hypergraph Network for Crime Prediction with Dynamic Multiplex Relation Learning

Crime prediction is crucial for public safety and resource optimization, yet is very challenging due to two aspects: i) the dynamics of criminal patterns across time and space, crime events are distributed unevenly on both spatial and temporal domains; ii) time-evolving dependencies between different types of crimes (e.g., Theft, Robbery, Assault, Damage) which reveal fine-grained semantics of crimes. To tackle these challenges, we propose Spatial-Temporal Sequential Hypergraph Network (ST-SHN) to collectively encode complex crime spatial-temporal patterns as well as the underlying category-wise crime semantic relationships. In specific, to handle spatial-temporal dynamics under the long-range and global context, we design a graph-structured message passing architecture with the integration of the hypergraph learning paradigm. To capture category-wise crime heterogeneous relations in a dynamic environment, we introduce a multi-channel routing mechanism to learn the time-evolving structural dependency across crime types. We conduct extensive experiments on two real-world datasets, showing that our proposed ST-SHN framework can significantly improve the prediction performance as compared to various state-of-the-art baselines. The source code is available at: https://github.com/akaxlh/ST-SHN.

cs.LG↗

arXiv2022

Global-Supervised Contrastive Loss and View-Aware-Based Post-Processing for Vehicle Re-Identification

In this paper, we propose a Global-Supervised Contrastive loss and a view-aware-based post-processing (VABPP) method for the field of vehicle re-identification. The traditional supervised contrastive loss calculates the distances of features within the batch, so it has the local attribute. While the proposed Global-Supervised Contrastive loss has new properties and has good global attributes, the positive and negative features of each anchor in the training process come from the entire training set. The proposed VABPP method is the first time that the view-aware-based method is used as a post-processing method in the field of vehicle re-identification. The advantages of VABPP are that, first, it is only used during testing and does not affect the training process. Second, as a post-processing method, it can be easily integrated into other trained re-id models. We directly apply the view-pair distance scaling coefficient matrix calculated by the model trained in this paper to another trained re-id model, and the VABPP method greatly improves its performance, which verifies the feasibility of the VABPP method.

cs.CV↗

arXiv2022

Fine-Grained Object Classification via Self-Supervised Pose Alignment

Semantic patterns of fine-grained objects are determined by subtle appearance difference of local parts, which thus inspires a number of part-based methods. However, due to uncontrollable object poses in images, distinctive details carried by local regions can be spatially distributed or even self-occluded, leading to a large variation on object representation. For discounting pose variations, this paper proposes to learn a novel graph based object representation to reveal a global configuration of local parts for self-supervised pose alignment across classes, which is employed as an auxiliary feature regularization on a deep representation learning network.Moreover, a coarse-to-fine supervision together with the proposed pose-insensitive constraint on shallow-to-deep sub-networks encourages discriminative features in a curriculum learning manner. We evaluate our method on three popular fine-grained object classification benchmarks, consistently achieving the state-of-the-art performance. Source codes are available at https://github.com/yangxh11/P2P-Net.

cs.CV↗

arXiv2022

Molecular conformer search with low-energy latent space

Identifying low-energy conformers with quantum mechanical accuracy for molecules with many degrees of freedom is challenging. In this work, we use the molecular dihedral angles as features and explore the possibility of performing molecular conformer search in a latent space with a generative model named variational auto-encoder (VAE). We bias the VAE towards low-energy molecular configurations to generate more informative data. In this way, we can effectively build a reliable energy model for the low-energy potential energy surface. After the energy model has been built, we extract local-minimum conformations and refine them with structure optimization. We have tested and benchmarked our low-energy latent-space (LOLS) structure search method on organic molecules with $5-9$ searching dimensions. Our results agree with previous studies.

physics.comp-ph↗

arXiv2022

Stability for nonlinear wave motions damped by time-dependent frictions

We are concerned with the dynamical behavior of solutions to semilinear wave systems with time-varying damping and nonconvex force potential. Our result shows that the dynamical behavior of solution is asymptotically stable without any bifurcation and chaos. And it is a sharp condition on the damping coefficient for the solution to converge to some equilibrium. To illustrate our theoretical results, we provide some numerical simulations for dissipative sine-Gordon equation and dissipative Klein-Gordon equation.

math.AP↗

arXiv2022

Deep multi-modal aggregation network for MR image reconstruction with auxiliary modality

Magnetic resonance (MR) imaging produces detailed images of organs and tissues with better contrast, but it suffers from a long acquisition time, which makes the image quality vulnerable to say motion artifacts. Recently, many approaches have been developed to reconstruct full-sampled images from partially observed measurements to accelerate MR imaging. However, most approaches focused on reconstruction over a single modality, neglecting the discovery of correlation knowledge between the different modalities. Here we propose a Multi-modal Aggregation network for mR Image recOnstruction with auxiliary modality (MARIO), which is capable of discovering complementary representations from a fully sampled auxiliary modality, with which to hierarchically guide the reconstruction of a given target modality. This implies that our method can selectively aggregate multi-modal representations for better reconstruction, yielding comprehensive, multi-scale, multi-modal feature fusion. Extensive experiments on IXI and fastMRI datasets demonstrate the superiority of the proposed approach over state-of-the-art MR image reconstruction methods in removing artifacts.

eess.IV↗