arXiv subjects

Xiaobin Li

Publications and source records attributed to Xiaobin Li.

34 records · Page 2Linked to original sources

arXiv2026

SagnacAssisted Enhanced OTDR for Distributed Acoustic Sensing: A Standardized Benchmark and Engineering Evaluation Framework

Phase-sensitive optical time-domain reflectometry ($ϕ$-OTDR) is widely used in large-scale distributed acoustic sensing (DAS) because it provides distributed spatiotemporal monitoring over long sensing distances. Its field performance can still deteriorate because of polarization-induced fading (PIF), local signal degradation, and strong environmental interference. This study develops a Sagnac-assisted enhanced $ϕ$-OTDR sensing architecture and a standardized benchmark framework for engineering-oriented DAS event recognition. The Sagnac interferometer provides a continuous phase response that supplements fading-prone observations in the $ϕ$-OTDR channel, and heterogeneous signal alignment is achieved using a cross-correlation procedure implemented on an FPGA platform. The benchmark protocol compares conventional feature-engineering methods, probabilistic shallow classifiers, single-branch deep models, and dual-branch fusion models under consistent data partitioning, preprocessing, and metric definitions. Experiments on a 10-km sensing fiber with six representative acoustic event classes show that the dual-branch fusion model provides the most favorable trade-off among the evaluated methods, reaching 89.79\% accuracy, 89.83\% macro-F1, and a nuisance alarm rate of 5.00\% on the balanced test set. The results also show that channel grouping strongly affects dual-branch evaluation, indicating that deployment-oriented conclusions should be based on accuracy, macro-F1, nuisance alarm rate, false negative rate, and latency rather than accuracy alone. This work provides a physically motivated enhancement strategy for $ϕ$-OTDR-based DAS and a reproducible benchmark protocol for future fusion-oriented sensing research. The implementation and scripts for reproducing the DAS event-recognition experiments are publicly available at https://github.com/wawa-abc/das.

cs.SD↗

arXiv2026

Coordinated optimization of departure sequencing and section-track allocation in railway short-term concentrated departure scenarios based on qubo and hybrid quantum algorithms

This study examines the coordinated optimization of departure sequencing and section-track allocation in railway short-term concentrated departure scenarios. A quadratic unconstrained binary optimization (QUBO) model is formulated to represent departure-position assignment and section-track selection within a unified binary framework. Because the quality of a dispatching scheme depends on time-dependent operational interactions that cannot be fully captured by a static combinatorial model, a simulation-based evaluation layer is introduced to assess section occupation, intermediate-station waiting, platform-capacity pressure, running-time fluctuations, and delay propagation. Within this layered framework, conventional heuristics, quantum-inspired algorithms, and hybrid algorithms are compared on the same decision structure. The results show that the QUBO model can generate feasible candidate schemes after decoding, while the simulation layer clearly differentiates the operational performance of the competing algorithms under both normal and disturbed conditions. In the tested scenarios, QPSO-QAOA performs best under normal conditions, and the quantum-enhanced methods reduce comprehensive cost by 4.28\%--26.26\% and total delay by 4.37\%--24.25\% on average under dynamic conditions relative to their conventional counterparts. These findings suggest that the integration of QUBO-based modeling and simulation-based evaluation provides a useful methodological framework for railway short-term concentrated departure scheduling, although validation with real operational data remains necessary.

quant-ph↗

arXiv2026

Machine Learning methods for event classification and vertex reconstruction of the 12C + 12C reaction with the MATE-TPC

In modern nuclear physics experiments, identifying events of interest is challenging for nuclear reaction studies with the active target Time Projection Chamber (TPC). In this work, machine learning techniques are employed to analyze the complex data of the 12C + 12C fusion reaction from a TPC named MATE (multi-purpose active-target time projection chamber for nuclear experiments). Specifically, we successfully applied Residual Neural Network (ResNet-50, ResNet-34 and ResNet-18) and Visual Geometry Group (VGG-19) to classify elastic scattering and fusion reaction events from the 12C + 12C reaction. The classification results of the four models are nearly identical, with accuracies of approximately 97% for the simulated data and 90% for the experimental data. Moreover, these approaches successfully identify some events that are misclassified by traditional methods. These models are also applied to classify events from different fusion reaction channels, with classification accuracies of approximately 95% on simulated data. In addition, a Convolutional Neural Network (CNN) model is developed to reconstruct the reaction vertex, providing an alternative strategy for vertex reconstruction. These results indicate that machine learning techniques can effectively classify reaction events from different channels and reconstruct the reaction vertex, thereby paving the way for future analyses of complex nuclear reaction data.

cs.LG↗

arXiv2026

On the role of inertia and self-sustaining mechanism in two-dimensional elasto-inertial turbulence

Elasto-inertial turbulence (EIT) is primarily driven by polymer elasticity, yet the modulating role of fluid inertia is non-negligible and remains largely unexplored. To investigate the effect of inertia, we perform direct numerical simulations of two-dimensional EIT in channel flow over a wide range of Reynolds numbers ($Re$). We show that increasing inertia promotes both the enhancement of dynamic amplitudes and the wallward migration of core structures. Specifically, inertia intensifies the turbulent fluctuations, facilitates the fragmentation of large-scale structures, and amplifies statistical quantities such as the root-mean-square of velocity fluctuations and polymer extension. The peak location of nonlinear elastic shear stress follows a scaling law $y^+ \propto Re_τ^{1/2}$, closely resembling that of Reynolds shear stress in Newtonian turbulence, indicating a change of the momentum transfer mechanism. Meanwhile, the peak location of energy conversion between elastic and turbulent kinetic energies exhibits a $y^+ \propto Re_τ^{0.1}$ scaling law migration, remaining mostly confined to the near-wall region. Remarkably, despite the inertial modulation, the probability density functions (PDFs) of velocity and elastic stress fluctuations extracted at the energy-conversion peak collapse convincingly over the range of $Re$ investigated. This reveals a robust statistical self-similarity across a wide range of inertia magnitude. Furthermore, the PDFs of wall-normal velocity and elastic stress fluctuations exhibit pronounced exponential heavy tails.

physics.flu-dyn↗

arXiv2026

Understanding and Improving UMAP with Geometric and Topological Priors: The JORC-UMAP Algorithm

Nonlinear dimensionality reduction techniques, particularly UMAP, are widely used for visualizing high-dimensional data. However, UMAP's local Euclidean distance assumption often fails to capture intrinsic manifold geometry, leading to topological tearing and structural collapse. We identify UMAP's sensitivity to the k-nearest neighbor graph as a key cause. To address this, we introduce Ollivier-Ricci curvature as a geometric prior, reinforcing edges at geometric bottlenecks and reducing redundant links. Since curvature estimation is noise-sensitive, we also incorporate a topological prior using Jaccard similarity to ensure neighborhood consistency. The resulting method, JORC-UMAP, better distinguishes true manifold structure from spurious connections. Experiments on synthetic and real-world datasets show that JORC-UMAP reduces tearing and collapse more effectively than standard UMAP and other DR methods, as measured by SVM accuracy and triplet preservation scores, while maintaining computational efficiency. This work offers a geometry-aware enhancement to UMAP for more faithful data visualization.

cs.LG↗

arXiv2025

Topological Vertex for Symmetric matter

We propose a novel topological vertex formalism for 5d $\mathcal{N}=1$ SU($N$) gauge theory with a hypermultiplet in the symmetric tensor representation, whose Type IIB brane construction involves an NS5-brane attached to an O7$^+$-plane. Inspired by the identification $\mathrm{O7}^+\sim \mathbb{Z}_2 + 4 \mathrm{D7}$, we introduce two new types of vertices: the $\mathbb{Z}_2$-vertex, which implements the $\mathbb{Z}_2$ orbifold action, and the FD-vertex, which encodes the monodromy cut induced by the O7$^+$-plane. This formalism generalizes the framework presented in arXiv:2412.19655 and establishes a systematic method for computing partition functions for 5-brane configurations that incorporate an O7$^+$-plane. The resulting partition functions are expressed as sums over Young diagrams, providing a powerful computational tool for studying such gauge theories.

hep-th↗

arXiv2025

Energy-conserving Kansa methods for Hamiltonian wave equations

We introduce a fast, constrained meshfree solver designed specifically to inherit energy conservation (EC) in second-order time-dependent Hamiltonian wave equations. For discretization, we adopt the Kansa method, also known as the kernel-based collocation method, combined with time-stepping. This approach ensures that the critical structural feature of energy conservation is maintained over time by embedding a quadratic constraint into the definition of the numerical solution. To address the computational challenges posed by the nonlinearity in the Hamiltonian wave equations and the EC constraint, we propose a fast iterative solver based on the Newton method with successive linearization. This novel solver significantly accelerates the computation, making the method highly effective for practical applications. Numerical comparisons with the traditional secant methods highlight the competitive performance of our scheme. These results demonstrate that our method not only conserves the energy but also offers a promising new direction for solving Hamiltonian wave equations more efficiently. While we focus on the Kansa method and corresponding convergence theories in this study, the proposed solver is based solely on linear algebra techniques and has the potential to be applied to EC constrained optimization problems arising from other PDE discretization methods.

math.NA↗

arXiv2025

O-vertex, O7$^+$-plane, and Topological Vertex

We revisit the instanton partition function for 5d $\mathcal{N}=1$ SO($N$) gauge theories compactified on S$^1$, computed from the topological vertex formalism with the O-vertex based on a 5-brane web diagram with an O5-plane. We introduce an identity that enables us to rewrite the unrefined partition function into a new expression in terms of the Nekrasov factors summed over Young diagrams, which can be interpreted as the freezing of an O7-plane. Based on this, we propose topological vertex formalism with an O7$^+$-plane.

hep-th↗

arXiv2025

Deep learning velocity filtering for seismic data

Seismic velocity filtering is a critical technique in seismic exploration, designed to enhance the quality of effective signals by suppressing or eliminating interference waves. Traditional transform-domain methods, such as frequency-wavenumber (f-k) filtering and Radon transform filtering, often introduce aliasing and artifacts, while time-domain filtering algorithms may oversmooth effective signals. Although deep learning-based velocity filtering has yet to be directly applied in practical seismic processing, studies have demonstrated its potential in specific tasks, such as linear noise attenuation and VSP wavefield separation. However, the limited functionality of existing models poses challenges in addressing diverse velocity filtering tasks. To tackle this issue, We develop a deep learning velocity filtering algorithm based on upgoing and downgoing wave separation. By employing linear transformation, problems associated with arbitrary velocity differences are transformed in terms of upgoing and downgoing wave separation tasks. A diverse training dataset was constructed, comprising 31 theoretical velocity models, over 200 forward modeling simulations, and 46 field seismic datasets. The model trained on this dataset, combined with the proposed linear transformation strategy, achieves results comparable to traditional f-k and Radon filtering while also supporting tasks such as median filtering through manual wavefield picking. Applications in VSP upgoing and downgoing wavefield separation, distributed acoustic sensor (DAS) VSP P- and S-wave separation, post-stack migration arc noise mitigation, DAS common mode noise attenuation, and pre-stack CDP gather optimization demonstrate the method's versatility and practicality. This approach offers a novel and effective solution for almost all velocity filtering tasks in seismic data processing.

physics.geo-ph↗

arXiv2025

Anomalous Reynolds stress and dynamic mechanisms in two-dimensional elasto-inertial turbulence of viscoelastic channel flow

Elasto-inertial turbulence (EIT) has been demonstrated to be able to sustain in two-dimensional (2D) channel flow; however the systematic investigations on 2D EIT remain scare. This study addresses this gap by examining the statistical characteristics and dynamic mechanisms of 2D EIT, while exploring its similarities to and differences from three-dimensional (3D) EIT. We demonstrate that the influence of elasticity on the statistical properties of 2D EIT follows distinct trends compared to those observed in 3D EIT and drag-reducing turbulence (DRT). These differences can be attributed to variations in the underlying dynamical processes. As nonlinear elasticity increases, the dominant dynamic evolution in 3D flows involves the gradual suppression of inertial turbulence (IT). In contrast, 2D flows exhibit a progressive enhancement of EIT. More strikingly, we identify an anomalous Reynolds stress in 2D EIT that contributes negatively to flow resistance, a behavior opposite to that of IT. Quadrant analysis of velocity fluctuations reveals the predominance of motions in the first and third quadrants. These motions are closely associated with polymer sheet-like extension structures, which are inclined from the near-wall region toward the channel center along the streamwise direction. Finally, we present the dynamical budget of 2D EIT, which shows significant similarities to that of 3D EIT, thereby providing compelling evidence for the objective existence of the 2D nature of EIT.

physics.flu-dyn↗

arXiv2024

DECN: Evolution Inspired Deep Convolution Network for Black-box Optimization

Evolutionary algorithms (EAs) have emerged as a powerful framework for optimization, especially for black-box optimization. Existing evolutionary algorithms struggle to comprehend and effectively utilize task-specific information for adjusting their optimization strategies, leading to subpar performance on target tasks. Moreover, optimization strategies devised by experts tend to be highly biased. These challenges significantly impede the progress of the field of evolutionary computation. Therefore, this paper first introduces the concept of Automated EA: Automated EA exploits structure in the problem of interest to automatically generate update rules (optimization strategies) for generating and selecting potential solutions so that it can move a random population near the optimal solution. However, current EAs cannot achieve this goal due to the poor representation of the optimization strategy and the weak interaction between the optimization strategy and the target task. We design a deep evolutionary convolution network (DECN) to realize the move from hand-designed EAs to automated EAs without manual interventions. DECN has high adaptability to the target task and can obtain better solutions with less computational cost. DECN is also able to effectively utilize the low-fidelity information of the target task to form an efficient optimization strategy. The experiments on nine synthetics and two real-world cases show the advantages of learned optimization strategies over the state-of-the-art human-designed and meta-learning EA baselines. In addition, due to the tensorization of the operations, DECN is friendly to the acceleration provided by GPUs and runs 102 times faster than EA.

cs.NE↗

arXiv2024

Freezing and BPS jumping

We report a novel BPS jumping phenomenon of 5d $\mathcal{N}=1$ supersymmetric gauge theories whose brane configuration is equipped with an O$7$-plane. The study of the relation between O$7{}^+$-plane and O$7{}^-$-plane reveals that such BPS jumps take place when the Higgsing is triggered near the O7-plane upon a particular parameter tuning of the theories. We propose two types of gauge theories whose BPS spectra jump. One is the SU($2N+8$) gauge theory with a symmetric hypermultiplet converted to the SU($2N$) gauge theory with an antisymmetric hypermultiplet. The other is pure SO($2N+8$) gauge theory jumping to pure Sp($N$) gauge theory. We explicitly confirm our proposal through the (un)refined instanton partition functions. Furthermore, we discuss feasible generalizations involving an O$p$-plane for supersymmetric gauge theories of eight supercharges in four and three dimensions ($p=6, 5$ respectively).

hep-th↗

arXiv2023

B2Opt: Learning to Optimize Black-box Optimization with Little Budget

The core challenge of high-dimensional and expensive black-box optimization (BBO) is how to obtain better performance faster with little function evaluation cost. The essence of the problem is how to design an efficient optimization strategy tailored to the target task. This paper designs a powerful optimization framework to automatically learn the optimization strategies from the target or cheap surrogate task without human intervention. However, current methods are weak for this due to poor representation of optimization strategy. To achieve this, 1) drawing on the mechanism of genetic algorithm, we propose a deep neural network framework called B2Opt, which has a stronger representation of optimization strategies based on survival of the fittest; 2) B2Opt can utilize the cheap surrogate functions of the target task to guide the design of the efficient optimization strategies. Compared to the state-of-the-art BBO baselines, B2Opt can achieve multiple orders of magnitude performance improvement with less function evaluation cost. We validate our proposal on high-dimensional synthetic functions and two real-world applications. We also find that deep B2Opt performs better than shallow ones.

cs.LG↗

arXiv2021

Thermodynamic limit of Nekrasov partition function for 5-brane web with O5-plane

In this paper, we study 5d $\mathcal{N}=1$ $Sp(N)$ gauge theory with $N_f ( \leq 2N + 3 )$ flavors based on 5-brane web diagram with $O5$-plane. On the one hand, we discuss Seiberg-Witten curve based on the dual graph of the 5-brane web with $O5$-plane. On the other hand, we compute the Nekrasov partition function based on the topological vertex formalism with $O5$-plane. Rewriting it in terms of profile functions, we obtain the saddle point equation for the profile function after taking thermodynamic limit. By introducing the resolvent, we derive the Seiberg-Witten curve and its boundary conditions as well as its relation to the prepotential in terms of the cycle integrals. They coincide with those directly obtained from the dual graph of the 5-brane web with $O5$-plane. This agreement gives further evidence for mirror symmetry which relates Nekrasov partition function with Seiberg-Witten curve in the case with orientifold plane and shed light on the non-toric Calabi-Yau 3-folds including D-type singularities.

hep-th↗

arXiv2020

Robustness-aware 2-bit quantization with real-time performance for neural network

Quantized neural network (NN) with a reduced bit precision is an effective solution to reduces the computational and memory resource requirements and plays a vital role in machine learning. However, it is still challenging to avoid the significant accuracy degradation due to its numerical approximation and lower redundancy. In this paper, a novel robustness-aware 2-bit quantization scheme is proposed for NN base on binary NN and generative adversarial network(GAN), witch improves the performance by enriching the information of binary NN, efficiently extract the structural information and considering the robustness of the quantized NN. Specifically, using shift addition operation to replace the multiply-accumulate in the quantization process witch can effectively speed the NN. Meanwhile, a structural loss between the original NN and quantized NN is proposed to such that the structural information of data is preserved after quantization. The structural information learned from NN not only plays an important role in improving the performance but also allows for further fine tuning of the quantization network by applying the Lipschitz constraint to the structural loss. In addition, we also for the first time take the robustness of the quantized NN into consideration and propose a non-sensitive perturbation loss function by introducing an extraneous term of spectral norm. The experiments are conducted on CIFAR-10 and ImageNet datasets with popular NN( such as MoblieNetV2, SqueezeNet, ResNet20, etc). The experimental results show that the proposed algorithm is more competitive under 2-bit-precision than the state-of-the-art quantization methods. Meanwhile, the experimental results also demonstrate that the proposed method is robust under the FGSM adversarial samples attack.

cs.LG↗

arXiv2014

Multiple Hybrid Phase Transition: Bootstrap Percolation on Complex Networks with Communities

Bootstrap percolation is a well-known model to study the spreading of rumors, new products or innovations on social networks. The empirical studies show that community structure is ubiquitous among various social networks. Thus, studying the bootstrap percolation on the complex networks with communities can bring us new and important insights of the spreading dynamics on social networks. It attracts a lot of scientists' attentions recently. In this letter, we study the bootstrap percolation on Erdős-Rényi networks with communities and observed second order, hybrid (both second and first order) and multiple hybrid phase transitions, which is rare in natural system. Moreover, we have analytically solved this system and obtained the phase diagram, which is further justified well by the corresponding simulations.

physics.soc-ph↗