SearcharxivSearch

arXiv subjects

Xiaobin Li

Publications and source records attributed to Xiaobin Li.

At least 19 recordsLinked to original sources

Difference Equations for Local Gromov-Witten Potentials of Threefold Flops

We study the information encoded by difference equations for the local Gromov-Witten theory of contractible rational curves in Calabi-Yau threefolds. Starting from the Bryan-Katz-Leung multiple-cover decomposition, we organize all nonzero primitive degrees on an exceptional ray by a single central-difference operator associated with the greatest common divisor of their support. The resulting equation is governed by explicit Fej\'er-type Laurent kernels. Our main structural result shows that, once the exceptional ray and its lattice normalization are fixed, the full quantum forcing term, its classical specialization at $\lambda=0$, and the local genus-zero Gopakumar-Vafa spectrum mutually determine one another. In particular, the classical forcing already determines every local GV multiplicity through an explicit divisor inversion. Thus the quantum difference equation carries a nontrivial shift profile, but this additional $\lambda$-dependence contains no further information about the genus-zero GV spectrum. For finite support, we further introduce the finest common shift lattice and determine the minimal Laurent-polynomial denominator-clearing operator with respect to divisibility. Its cyclotomic factorization defines a strictly coarser shadow of the local enumerative theory. Explicit length-two, $E_6$, $E_7$, and $E_8$ flop models exhibit three distinct failures of reconstruction: the same Koll\'ar length can give different forcing terms, different GV supports can have the same cyclotomic skeleton, and identical local difference data need not determine the analytic type of the flop. These results give a precise hierarchy of the geometric and enumerative information retained by local Gromov-Witten difference equations.

math.AG

A QUBO-Inspired Computational Framework for Airport Landside Bottleneck Diagnosis and Dynamic Dispatch Optimization

Airport landside traffic centers connect terminal arrivals with taxis, ride-hailing vehicles, private cars, buses, metro services, parking facilities, and terminal-area roadways. Peak arrivals can create coupled congestion across passenger queues, vehicle queues, pickup berths, storage areas, and access roads. This study proposes a QUBO-inspired computational framework for bottleneck diagnosis and dynamic dispatch in this setting. Shanghai Pudong International Airport and Hangzhou Xiaoshan International Airport serve as case airports. A five-minute state model links passenger arrivals, vehicle supply, pickup berth service, vehicle storage, and road capacity. Bottleneck diagnosis uses service intensity, road demand saturation, bottleneck frequency, queue severity, shadow-price leverage, and a composite congestion severity index. Two dispatch schemes are tested under consistent demand inputs: finite-action model predictive control and quadratic-unconstrained-binary-optimization-inspired simulated annealing. In the strong-peak baseline scenario, the QUBO-inspired method reduces the final passenger queue from 3445 to 2477 passengers at Shanghai Pudong and from 2053 to 1482 passengers at Hangzhou Xiaoshan. Case results indicate different dominant bottlenecks. Shanghai Pudong is more affected by road saturation, whereas Hangzhou Xiaoshan is more affected by pickup berth service. Robustness tests under demand, supply, service, road-capacity, modal-share, and random-noise perturbations show retained queue-reduction benefits under the tested uncertainty levels.

cs.AI

Quantum-Inspired Evolutionary Neighborhood Search for Arrival-Departure Track Utilization Adjustment under Short-Term Disturbances

Short-term disturbances at major passenger railway stations alter train arrival and departure times as well as the release sequence of station resources. Effective recovery therefore requires coordinated adjustment of arrival-departure track allocation, station resource occupation, and train retiming. This study represents the station resources involved in train arrival, track occupancy, and departure operations as zone-level resource-occupation intervals. An arrival-departure track allocation adjustment model is formulated. Resource compatibility is imposed as the feasibility condition, while train delays and resource reassignment costs are jointly considered. A quantum-inspired evolutionary algorithm combined with neighborhood search (QEA-NS) is proposed to solve the model. Perturbation instances are constructed using GTFS timetable data from Frankfurt Hauptbahnhof, Germany. QEA-NS is compared with CP-SAT under the same candidate resource set and feasibility criteria. Both methods generate solutions satisfying the modeled resource compatibility constraints. QEA-NS yields a total delay of 388 min, compared with 519 min for CP-SAT, representing a reduction of 25.2\%. The mean delay of delayed trains decreases from 4.99 to 3.73 min, although QEA-NS requires a longer solution time. Across 10 random perturbation instances, QEA-NS achieves lower total delay in every case. Its mean total delay and standard deviation are 390.5 min and 35.945 min, respectively, compared with 673.8 min and 105.739 min for CP-SAT. The results indicate that, under the adopted resource representation and constraints, QEA-NS improves the delay performance of recovery plans. Its computational efficiency, however, requires further improvement.

cs.AI

Thermodynamic limit for SO(2N) gauge theories with spinors/conjugate spinors

In this paper, we investigate five-dimensional $\mathcal{N} = 1$ supersymmetric $SO(2N)$ gauge theories coupled to hypermultiplets in spinor/conjugate spinor representation based on 5-brane web constructions with O5-planes. Based on the topological vertex formalism with O5-plane, we find new expressions for the partition functions for these theories, emphasizing the difference between the case with two spinors and that with one spinor and one conjugate spinor. Through the thermodynamic limit of these partition functions, we derive the Cameral and Seiberg-Witten curves. We show that the difference between the spinor and the conjugate spinor appears as a difference in the boundary conditions of the Seiberg-Witten curves at the orientifold planes.

hep-th

Edge-Constrained UAV Small-Object Detection with P2 Enhancement and Quantum-Inspired Lightweight Structure Search

Unmanned aerial vehicle (UAV) object detection requires compact detectors that retain small-object details under onboard computation and memory constraints. Repeated downsampling inlightweight networks weakens shallow spatial information, while manually adding attention orfusion modules may increase cost without stable gains. This study analyzes YOLOX-Nano underedge-deployment constraints by combining a P2 high-resolution detection branch with a quantum-inspired evolutionary algorithm (QIEA) for lightweight structure screening. The search space isdefined by lightweight priority and task specificity, and the evaluation jointly considers accuracy,floating-point operations (FLOPs), latency, memory consumption, and recall. On VisDrone, theP2 branch increases APamall by 31.10% over the YOLOX-Nano baseline. Compared with NanoDet-Plus with similar model size, YOLOX-Nano+-P2 improves APs0.ss by 17.5% and APamal by 44.9%.The QIEA-selected candidate obtains the highest Recallso, but +P2 remains the strongest AP-oriented variant after full training. Full 100-epoch verification of Random-best, GA-best, andSA/QUBO-best candidates further shows that proxy rankings do not necessarily transfer to finalAPse9s. These results support using P2 as the main small-object enhancement path and QIEA as alightweight tool for candidate screening and accuracy-cost analysis. The source code, configurationfiles, diagnostic scripts, and summarized results are available at https://github.com/Ming23233/UAV-QIEA-Edge-Detection

cs.CV

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

Phase-sensitive optical time-domain reflectometry ($\phi$-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 $\phi$-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 $\phi$-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 $\phi$-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

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

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

McShane-Rivin norm balls and simple-length multiplicities

We use normal-turn estimates to study the global and local geometry of the boundaries of McShane--Rivin norm balls $B_X$ for complete finite-area hyperbolic once-punctured tori $X$. This yields a logarithmic-square bound for the number of integer points on the boundary of each dilated norm ball. Consequently, the number of simple closed geodesics of length exactly $L\geq 2$ is at most $C_X(\log L)^2$. For the modular torus, this gives $$ \#\lambda_M^{-1}(m)\leq C(\log\log(3m))^2 $$ for every Markoff number $m$, improving the previous logarithmic bounds for Markoff fibers. Our second result shows that the boundary $\partial B_X$ is a convex-geometric detector of exponential Diophantine approximation: a rational direction gives genuine corner with exponentially small exterior angle in the hyperbolic length of the corresponding simple closed geodesic, while at an irrational direction $\beta$ the graph-flatness order admits an explicit formula in terms of the exponential rate at which rational directions approach $\beta$ and the $\ell^\infty$-radius of $B_X$ in the projective direction $\beta$. Thus, irrational directions are not uniformly flat to infinite order, correcting the McShane--Rivin local picture. We also determine all possible irrational flatness orders and the size of the corresponding level sets; in particular, every intermediate finite-flatness level determines the marked torus.

math.GT

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_\tau^{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_\tau^{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

Local Regularity Estimation through Sobolev-Scale Norm Profile

We develop a kernel-based approach for estimating the spatially varying Sobolev regularity~$s$ of an unknown $d$-variate function~$f$ from scattered sampling data, which quantifies the degree of local differentiability supported by the data. Relying only on neighborhood data near the point of interest $z\in \Omega_z$, our method constructs a sequence of Sobolev-space reproducing kernel interpolants whose kernel smoothness order is specified by an index~$m > d/2$. The native-space norms of these interpolants are evaluated over a bounded range of~$m$, producing a \emph{Sobolev-scale norm profile}. The elbow of this profile serves as a quantitative probe of the underlying local regularity~$s(\Omega_z)$. In particular, when $m > s(\Omega_z)$, the profile exhibits rapid, near-worst-case growth governed by the classical upper bound associated with the conditioning of the kernel matrix. A band-limited surrogate analysis explains this transition and establishes a lower bound linking native-norm growth to the Sobolev regularity of~$f$. Two complementary strategies are incorporated for further enhancement: (i)~a \emph{stencil-shift} subroutine, which repositions local neighborhoods to avoid crossing discontinuities whenever possible, thereby suppressing artifacts in the norm estimates; and (ii) a \emph{secant-based tail screening strategy} that uses two high-order norm evaluations to identify candidate low-regularity neighborhoods at reduced computational cost. Numerical experiments on synthetic test functions and turbulent-flow data demonstrate recovery of spatially varying regularity, while a surface conservation-law example illustrates the detection of evolving low-regularity regions in time-dependent PDE data.

math.NA

Trajectory-Based RBF Collocation Method via Closest-Point Embedding for Surface Advection-Diffusion Equations

We introduce a Trajectory-Based RBF Collocation (TBRBF) method for solving surface advection-diffusion equations on smooth, compact manifolds. TBRBF decouples advection and diffusion by applying a characteristic treatment with a Kansa-type RBF collocation method for diffusion PDE, which yields an operator-split characteristic (OSC) system comprising a characteristic ODE and a diffusion PDE. We rigorously prove the equivalence between the OSC system and the original surface PDE on manifolds by embedding the latter into a narrow band domain through the closest point mapping and its constant-along-normal extension. Using an intrinsic approach, we construct a time-continuous embedded PDE with push-forward operators in each chart of the atlas and establish its equivalence with the OSC system in the narrow band. Restricting the solution back to the manifold recovers the OSC system on manifolds, ensuring that the method introduces no operator splitting error. After the surface OSC system is obtained, it admits both extrinsic and intrinsic discretizations. Extensive numerical experiments confirm the robust stability and accuracy of the proposed method.

math.NA

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

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

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

ELBO-T2IAlign: A Generic ELBO-Based Method for Calibrating Pixel-level Text-Image Alignment in Diffusion Models

Diffusion models excel at image generation. Recent studies have shown that these models not only generate high-quality images but also encode text-image alignment information through attention maps or loss functions. This information is valuable for various downstream tasks, including segmentation, text-guided image editing, and compositional image generation. However, current methods heavily rely on the assumption of perfect text-image alignment in diffusion models, which is not the case. In this paper, we propose using zero-shot referring image segmentation as a proxy task to evaluate the pixel-level image and class-level text alignment of popular diffusion models. We conduct an in-depth analysis of pixel-text misalignment in diffusion models from the perspective of training data bias. We find that misalignment occurs in images with small-sized, occluded, or rare object classes. Therefore, we propose ELBO-T2IAlign--a simple yet effective method to calibrate pixel-text alignment in diffusion models based on the evidence lower bound (ELBO) of likelihood. ELBO-T2IAlign is training-free and generic: it requires no additional annotations, model retraining, or architectural modifications, and it can be directly applied to different diffusion backbones. Extensive experiments on zero-shot referring image segmentation, text-guided image editing, and compositional image generation verify that the proposed calibration improves pixel-text alignment across complementary downstream tasks.

cs.CV

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

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