SearcharxivSearch

arXiv subjects

Hong Gao

Publications and source records attributed to Hong Gao.

At least 19 recordsLinked to original sources

Unexpected Collisional Rotational Excitation via Long-Range Capture and Orbiting

Collisional rotational excitation is a fundamental process in many gaseous environments. The textbook hard-sphere model stipulates that high rotational excitation results from head-on collisions, leading primarily to backward scattering, whereas long-range glancing collisions in the forward direction are inefficient for rotational energy transfer. Here, we report rotational state resolved product imaging for a system with strong attractive interaction, the charge-transfer collision between spin-orbit selected Ar+(2P3/2) ions and para/ortho-H2 molecules. Surprisingly, the H2+ products are rotationally excited and dominated by forward scattering, in sharp contrast to conventional wisdom. Quantum dynamical calculations on a first-principles diabatic potential energy matrix reproduce the observations. Trajectory surface hopping analysis further reveals that rotational excitation occurs mostly with large impact parameters, and the captured complex undergoes orbiting motion owing to the strong attractive interaction between the two collision partners before they break up. This novel mechanism should be general for collisional systems featuring strong attractive interactions, which undermine the hard-sphere assumption.

physics.chem-ph

SqLinear: Balanced Square Partitioning Makes Linear Interaction Sufficient for Large-Scale Traffic Forecasting

Traffic prediction is a core task in intelligent transportation systems and urban-scale decision making. Despite the effectiveness of mainstream neural network-based methods, their deployment in real-world settings with thousands of traffic sensors is severely jeopardized by their poor computational scalability. To address this, the community has attempted to incorporate spatial database partitioning techniques to improve model scalability. However, these approaches rely on handcrafted geometric heuristics and often produce irregular or imbalanced data partitions, leading to boundary fragmentation, excessive padding overheads, and degraded model accuracy. In this paper, we propose SqLinear, an efficient and effective architecture for large-scale traffic prediction. First, we design Square Partition, a geometry-adaptive algorithm that partitions massive traffic sensors into balanced, non-overlapping, and compact spatial regions. Unlike existing heuristic-based designs, Square Partition is theoretically grounded and provides provable guarantees on partition utilization and split balance, establishing a high-quality foundation for downstream spatio-temporal modeling. Next, we propose a Hierarchical Linear Interaction (HLI) module that abandons the costly attention mechanisms commonly used in Transformer-based spatio-temporal models. HLI efficiently propagates global inter-region dependencies and refines them at the node level through a lightweight linear interaction scheme, enabling effective spatio-temporal modeling with linear computational complexity. Extensive experiments on four large-scale traffic datasets and 11 baselines show that SqLinear reduces MAE by 2.30% on average under the standard setting and by up to 6.78% under extreme scalability settings, while reducing training runtime by 13.27%--30.84% in spatial- and horizon-scaling scenarios.

cs.LG

Optical hopfions with arbitrary two winding numbers

Hopfions, as three-dimensional topologically nontrivial structures described by poloidal and toroidal winding numbers, hold promise as robust information carriers in spintronics, functional materials, and optical communications. Although they have been experimentally realized in various physical systems, such realizations have been restricted to low orders, with the winding numbers lacking tunability. Here, using optical fields as our platform, we outline how to make tunable hopfions in any order with any winding number. We use tailored superpositions of Laguerre-Gaussian modes in free-space as our construction, achieving effective control for arbitrary-order poloidal and toroidal winding numbers, which we demonstrate up to orders 5 and 3, respectively, for a new state-of-the-art. The resulting torus-knot structures are visualized experimentally via polarization filaments, confirming the designed topological textures. Our work reports an exotic optical topologies observed in free space, provides a systematic route hopfions of any order, with implications for topological photonics, optical communications, and analogies in magnetic and condensed-matter systems.

physics.optics

2D or 3D: Who Governs Salience in VLA Models? -- Tri-Stage Token Pruning Framework with Modality Salience Awareness

Vision-Language-Action (VLA) models have emerged as the mainstream of embodied intelligence. Recent VLA models have expanded their input modalities from 2D-only to 2D+3D paradigms, forming multi-visual-modal VLA (MVLA) models. Despite achieving improved spatial perception, MVLA faces a greater acceleration demand due to the increased number of input tokens caused by modal expansion. Token pruning is an effective optimization methods tailored to MVLA models. However, existing token pruning schemes are designed for 2D-only VLA models, ignoring 2D/3D modality salience differences. In this paper, we follow the application process of multi-modal data in MVLA models and develop a tri-stage analysis to capture the discrepancy and dynamics of 2D/3D modality salience. Based on these, we propose a corresponding tri-stage token pruning framework for MVLA models to achieve optimal 2D/3D token selection and efficient pruning. Experiments show that our framework achieves up to a 2.55x inference speedup with minimal accuracy loss, while only costing 5.8% overhead. Our Code is coming soon.

cs.MM

MCPAgentBench: A Real-world Task Benchmark for Evaluating LLM Agent MCP Tool Use

Large Language Models (LLMs) are increasingly serving as autonomous agents, and their utilization of external tools via the Model Context Protocol (MCP) is considered a future trend. Current MCP evaluation sets suffer from issues such as reliance on external MCP services and a lack of difficulty awareness. To address these limitations, we propose MCPAgentBench, a benchmark based on real-world MCP definitions designed to evaluate the tool-use capabilities of agents. We construct a dataset containing authentic tasks and simulated MCP tools. The evaluation employs a dynamic sandbox environment that presents agents with candidate tool lists containing distractors, thereby testing their tool selection and discrimination abilities. Furthermore, we introduce comprehensive metrics to measure both task completion rates and execution efficiency. Experiments conducted on various latest mainstream Large Language Models reveal significant performance differences in handling complex, multi-step tool invocations. All code is open-source at Github.

cs.AI

Storage and retrieval of optical skyrmions with topological characteristics

Optical skyrmions are topological structures of light whose defining property, the skyrmion number, is robust against perturbations. This makes them attractive for applications in quantum information storage, where resilience to decoherence is paramount. However, their preservation during coherent storage remains unexplored. We report the first experimental demonstration of storing and retrieving optical skyrmions in a cold $^{87}$Rb vapor using a dual-path electromagnetically induced transparency memory. Crucially, we show that the skyrmion number remains invariant for storage times up to several microseconds, even when subjected to imbalanced loss between the two paths and substantial perturbations in control beam power. Our work demonstrates the survival of a non-trivial topological invariant in a quantum memory, marking a significant step towards topologically protected photonic technologies.

quant-ph

OmniGround: A Comprehensive Spatio-Temporal Grounding Benchmark for Real-World Complex Scenarios

Spatio-Temporal Video Grounding (STVG) aims to localize target objects in videos based on natural language descriptions. Despite recent advances in Multimodal Large Language Models, a significant gap remains between current models and real-world demands involving diverse objects and complex queries. We attribute this to limited benchmark scope, causing models to exhibit category bias, oversimplified reasoning, and poor linguistic robustness. To address these limitations, we introduce OmniGround, a comprehensive benchmark with 3,475 videos spanning 81 categories and complex real-world queries. We propose the Forward-Backward-Refinement annotation pipeline that combines multi-directional tracking with intelligent error correction for high-quality labels. We further introduce DeepSTG, a systematic evaluation framework quantifying dataset quality across four complementary dimensions beyond superficial statistics. Evaluations reveal performance average drop of 10.4% on complex real-world scenes, particularly with small/occluded objects and intricate spatial relations. Motivated by these, we propose PG-TAF, a training-free two-stage framework decomposing STVG into high-level temporal grounding and fine-grained spatio-temporal propagation. Experiments demonstrate PG-TAF achieves 25.6% and 35.6% improvements in m\_tIoU and m\_vIoU on OmniGround with consistent gains across four benchmarks.

cs.CV

Agentic Video Intelligence: A Flexible Framework for Advanced Video Exploration and Understanding

Video understanding requires not only visual recognition but also complex reasoning. While Vision-Language Models (VLMs) demonstrate impressive capabilities, they typically process videos largely in a single-pass manner with limited support for evidence revisit and iterative refinement. While recently emerging agent-based methods enable long-horizon reasoning, they either depend heavily on expensive proprietary models or require extensive agentic RL training. To overcome these limitations, we propose Agentic Video Intelligence (AVI), a flexible and training-free framework that can mirror human video comprehension through system-level design and optimization. AVI introduces three key innovations: (1) a human-inspired three-phase reasoning process (Retrieve-Perceive-Review) that ensures both sufficient global exploration and focused local analysis, (2) a structured video knowledge base organized through entity graphs, along with multi-granularity integrated tools, constituting the agent's interaction environment, and (3) an open-source model ensemble combining reasoning LLMs with lightweight base CV models and VLM, eliminating dependence on proprietary APIs or RL training. Experiments on LVBench, VideoMME-Long, LongVideoBench, and Charades-STA demonstrate that AVI achieves competitive performance while offering superior interpretability.

cs.CV

ARSP: Automated Repair of Verilog Designs via Semantic Partitioning

Debugging functional Verilog bugs consumes a significant portion of front-end design time. While Large Language Models (LLMs) have demonstrated great potential in mitigating this effort, existing LLM-based automated debugging methods underperform on industrial-scale modules. A major reason for this is bug signal dilution in long contexts, where a few bug-relevant tokens are overwhelmed by hundreds of unrelated lines, diffusing the model's attention. To address this issue, we introduce ARSP, a two-stage system that mitigates dilution via semantics-guided fragmentation. A Partition LLM splits a module into semantically tight fragments; a Repair LLM patches each fragment; edits are merged without altering unrelated logic. A synthetic data framework generates fragment-level training pairs spanning bug types, design styles, and scales to supervise both models. Experiments show that ARSP achieves 77.92% pass@1 and 83.88% pass@5, outperforming mainstream commercial LLMs including Claude-3.7 and SOTA automated Verilog debugging tools Strider and MEIC. Also, semantic partitioning improves pass@1 by 11.6% and pass@5 by 10.2% over whole-module debugging, validating the effectiveness of fragment-level scope reduction in LLM-based Verilog debugging.

cs.SE

APVR: Hour-Level Long Video Understanding with Adaptive Pivot Visual Information Retrieval

Current multimodal large language models (MLLMs) struggle with hour-level video understanding, facing significant challenges not only in modeling the substantial information volume of long videos but also in overcoming the memory wall and resource constraints during both training and inference. Although recent training-free approaches have alleviated resource demands by compressing visual features, their reliance on incomplete visual information limits the performance potential. To address these limitations, we propose Adaptive Pivot Visual information Retrieval (APVR), a training-free framework that hierarchically retrieves and retains sufficient and important visual information. It breakthroughs the memory wall limitation via two complementary components: Pivot Frame Retrieval employs query expansion and iterative spatio-semantic confidence scoring to identify relevant video frames, and Pivot Token Retrieval performs query-aware attention-driven token selection within up to 1024 pivot frames. This dual granularity approach enables the processing of hour-long videos while maintaining semantic fidelity. Experimental validations on three different baseline MLLMs demonstrate significant performance improvements up to 9.5\%, 4.6\% and 9.7\% on LongVideoBench, VideoMME and MLVU, respectively. APVR achieves state-of-the-art results for both training-free and training-based approaches.

cs.CV

Examining the Role of LLM-Driven Interactions on Attention and Cognitive Engagement in Virtual Classrooms

Transforming educational technologies through the integration of large language models (LLMs) and virtual reality (VR) offers the potential for immersive and interactive learning experiences. However, the effects of LLMs on user engagement and attention in educational environments remain open questions. In this study, we utilized a fully LLM-driven virtual learning environment, where peers and teachers were LLM-driven, to examine how students behaved in such settings. Specifically, we investigate how peer question-asking behaviors influenced student engagement, attention, cognitive load, and learning outcomes and found that, in conditions where LLM-driven peer learners asked questions, students exhibited more targeted visual scanpaths, with their attention directed toward the learning content, particularly in complex subjects. Our results suggest that peer questions did not introduce extraneous cognitive load directly, as the cognitive load is strongly correlated with increased attention to the learning material. Considering these findings, we provide design recommendations for optimizing VR learning spaces.

cs.HC

Tailoring ultra-high-order optical skyrmions

Skyrmions, as quasiparticles with topological spin textures, has recently garnered great attention for both condensed matter and structured wave communities, promising next-generation large-density robust information technologies. However, a big challenge to this end is that the generation of high-order skyrmions is elusive in any physical systems. Here, we propose the method to create and control ultra-high-order skyrmions (skyrmion number up to $400^{th}$) in a structured light system. We also experimentally control the topological state transition between bimeron and skyrmion, arbitrarily tailor the transverse size of an arbitrary-order skyrmionic beam independent of topological number, and ensure the topological stability upon propagation. Our work offers solutions for topologically resilient communication and memory with much enhanced information capacity.

physics.optics

NTIRE 2025 Challenge on Short-form UGC Video Quality Assessment and Enhancement: Methods and Results

This paper presents a review for the NTIRE 2025 Challenge on Short-form UGC Video Quality Assessment and Enhancement. The challenge comprises two tracks: (i) Efficient Video Quality Assessment (KVQ), and (ii) Diffusion-based Image Super-Resolution (KwaiSR). Track 1 aims to advance the development of lightweight and efficient video quality assessment (VQA) models, with an emphasis on eliminating reliance on model ensembles, redundant weights, and other computationally expensive components in the previous IQA/VQA competitions. Track 2 introduces a new short-form UGC dataset tailored for single image super-resolution, i.e., the KwaiSR dataset. It consists of 1,800 synthetically generated S-UGC image pairs and 1,900 real-world S-UGC images, which are split into training, validation, and test sets using a ratio of 8:1:1. The primary objective of the challenge is to drive research that benefits the user experience of short-form UGC platforms such as Kwai and TikTok. This challenge attracted 266 participants and received 18 valid final submissions with corresponding fact sheets, significantly contributing to the progress of short-form UGC VQA and image superresolution. The project is publicly available at https://github.com/lixinustc/KVQE- ChallengeCVPR-NTIRE2025.

eess.IV

NTIRE 2025 Challenge on Cross-Domain Few-Shot Object Detection: Methods and Results

Cross-Domain Few-Shot Object Detection (CD-FSOD) poses significant challenges to existing object detection and few-shot detection models when applied across domains. In conjunction with NTIRE 2025, we organized the 1st CD-FSOD Challenge, aiming to advance the performance of current object detectors on entirely novel target domains with only limited labeled data. The challenge attracted 152 registered participants, received submissions from 42 teams, and concluded with 13 teams making valid final submissions. Participants approached the task from diverse perspectives, proposing novel models that achieved new state-of-the-art (SOTA) results under both open-source and closed-source settings. In this report, we present an overview of the 1st NTIRE 2025 CD-FSOD Challenge, highlighting the proposed solutions and summarizing the results submitted by the participants.

cs.CV

Observation of non-Hermitian bulk-boundary correspondence in non-chiral non-unitary quantum dynamics of single photons

The breakdown of conventional bulk-boundary correspondence, a cornerstone of topological physics, is one of counter-intuitive phenomena in non-Hermitian systems, that is deeply rooted in symmetry. In particular, preserved chiral symmetry is one of the key ingredients, which plays a pivotal role in determining non-Hermitian topology. Nevertheless, chiral symmetry breaking in non-Hermitian systems disrupts topological protection, modifies topological invariants, and substantially reshapes spectral and edge-state behavior. The corresponding fundamentally important bulk-boundary correspondence thus needs to be drastically reconstructed. However, it has so far eluded experimental efforts. Here, we theoretically predict and experimentally demonstrate the bulk-boundary correspondence of a one-dimensional (1D) non-Hermitian system with chiral symmetry breaking in discrete-time non-chiral non-unitary quantum walks of single photons. Through constructing a domain-wall configuration, we experimentally observe the photon localization at the interface of domain-wall structure, clearly indicating the presence of the topological edge mode. The appearance of that matches excellently with the prediction of our introduced non-chiral non-Bloch topological invariants pair. Our work thus unequivocally builds the non-Hermitian bulk-boundary correspondence as a general principle for studying topological physics in non-Hermitian systems with chiral symmetry breaking.

cond-mat.mes-hall

Efficient multiplexed quantum memory with high dimensional orbital angular momentum states in cold atoms

Quantum memory plays a pivotal role in the construction of quantum repeaters, which are essential devices for establishing long-distance quantum communications and large-scale quantum networks. To boost information capacity and signal processing speed, the implementation of high-efficiency multiplexed quantum memories is essential for the development of multiplexed quantum repeaters. In this work, we experimentally demonstrate an efficient multiplexed quantum memory by consolidating photons carrying high-dimensional orbital angular momentum (OAM) state from 4 individual channels into an elongated cold $^{87}$Rb atomic ensemble. Benefiting from the cold atomic ensemble with high optical depth, we obtain a storage efficiency exceeding 70% for the 4-channel multiplexed beam. The storage fidelities surpass 83% when all channels are operated in a 4-dimensional Hilbert space, which is far above the classical benchmark and validates the quantum functionality of our memory system. The achieved high-efficiency OAM multiplexed quantum memory opens up an avenue for efficient quantum information processing over multiple parallel channels, promising significant advances in the field of quantum communication and networking.

quant-ph

Quantum delayed "choice" based on vectorially structured photon

Whether a photon exhibits wavelike or particlelike behaviour depends on the observation method, as clearly demonstrated by Wheeler's delayed choice (DC) experiments. A key aspect of such experiments is the random determination of the observation device's status, typically controlled by a random number generator or a quantum-controlling apparatus. Here, we propose a novel version of the quantum delayed choice (QDC) experiment by tailoring the quantum state of the single photon into an arbitrary polarization superposition. In this experiment, the "choice" can be considered as being made by the photon's state itself at the moment of observation, thereby violating classical causality. Additionally, we observe the morphing behaviour of the single photon between wavelike and particlelike characteristics, which challenges the classical picture of waves and particles. Utilizing the quantum state of the photon rather than the quantum-controlling devices not only facilitates the implementation of the QDC experiment but also helps deepen the understanding of Bohr's complementarity principle.

quant-ph

Outer Independent Roman Domination Number of Cartesian Product of Paths and Cycles

Given a graph $G$ with vertex set $V$, an outer independent Roman dominating function (OIRDF) is a function $f$ from $V(G)$ to $\{0, 1, 2\}$ for which every vertex with label $0$ under $f$ is adjacent to at least a vertex with label $2$ but not adjacent to another vertex with label $0$. The weight of an OIRDF $f$ is the sum of vertex function values all over the graph, and the minimum of an OIRDF is the outer independent Roman domination number of $G$, denoted as $\gamma_{oiR}(G)$. In this paper, we focus on the outer independent Roman domination number of the Cartesian product of paths and cycles $P_{n}\Box C_{m}$. We determine the exact values of $\gamma_{oiR}(P_n\Box C_m)$ for $n=1,2,3$ and $\gamma_{oiR}(P_n\Box C_3)$ and present an upper bound of $\gamma_{oiR}(P_n\Box C_m)$ for $n\ge 4, m\ge 4$.

math.CO