arXiv subjects

Zhao Li

Publications and source records attributed to Zhao Li.

At least 37 records · Page 2Linked to original sources

arXiv2025

DispatchMAS: Fusing taxonomy and artificial intelligence agents for emergency medical services

Objective: Emergency medical dispatch (EMD) is a high-stakes process challenged by caller distress, ambiguity, and cognitive load. Large Language Models (LLMs) and Multi-Agent Systems (MAS) offer opportunities to augment dispatchers. This study aimed to develop and evaluate a taxonomy-grounded, LLM-powered multi-agent system for simulating realistic EMD scenarios. Methods: We constructed a clinical taxonomy (32 chief complaints, 6 caller identities from MIMIC-III) and a six-phase call protocol. Using this framework, we developed an AutoGen-based MAS with Caller and Dispatcher Agents. The system grounds interactions in a fact commons to ensure clinical plausibility and mitigate misinformation. We used a hybrid evaluation framework: four physicians assessed 100 simulated cases for "Guidance Efficacy" and "Dispatch Effectiveness," supplemented by automated linguistic analysis (sentiment, readability, politeness). Results: Human evaluation, with substantial inter-rater agreement (Gwe's AC1 > 0.70), confirmed the system's high performance. It demonstrated excellent Dispatch Effectiveness (e.g., 94 % contacting the correct potential other agents) and Guidance Efficacy (advice provided in 91 % of cases), both rated highly by physicians. Algorithmic metrics corroborated these findings, indicating a predominantly neutral affective profile (73.7 % neutral sentiment; 90.4 % neutral emotion), high readability (Flesch 80.9), and a consistently polite style (60.0 % polite; 0 % impolite). Conclusion: Our taxonomy-grounded MAS simulates diverse, clinically plausible dispatch scenarios with high fidelity. Findings support its use for dispatcher training, protocol evaluation, and as a foundation for real-time decision support. This work outlines a pathway for safely integrating advanced AI agents into emergency response workflows.

cs.CL↗

arXiv2025

Ontology-Enhanced Knowledge Graph Completion using Large Language Models

Large Language Models (LLMs) have been extensively adopted in Knowledge Graph Completion (KGC), showcasing significant research advancements. However, as black-box models driven by deep neural architectures, current LLM-based KGC methods rely on implicit knowledge representation with parallel propagation of erroneous knowledge, thereby hindering their ability to produce conclusive and decisive reasoning outcomes. We aim to integrate neural-perceptual structural information with ontological knowledge, leveraging the powerful capabilities of LLMs to achieve a deeper understanding of the intrinsic logic of the knowledge. We propose an ontology enhanced KGC method using LLMs -- OL-KGC. It first leverages neural perceptual mechanisms to effectively embed structural information into the textual space, and then uses an automated extraction algorithm to retrieve ontological knowledge from the knowledge graphs (KGs) that needs to be completed, which is further transformed into a textual format comprehensible to LLMs for providing logic guidance. We conducted extensive experiments on three widely-used benchmarks -- FB15K-237, UMLS and WN18RR. The experimental results demonstrate that OL-KGC significantly outperforms existing mainstream KGC methods across multiple evaluation metrics, achieving state-of-the-art performance.

cs.CL↗

arXiv2025

New Physics Search at the CEPC: a General Perspective

The Circular Electron-Positron Collider (CEPC), a proposed next-generation Higgs factory, provides new opportunities to explore physics beyond the Standard Model (SM). With its clean electron-positron collision environment and the ability to collect large samples of Higgs, W, and Z bosons, the CEPC enables precision measurements and searches for new physics. This white paper outlines the CEPC's discovery potential, including studies of exotic decays of the Higgs, Z, and top quarks, dark matter and dark sector phenomena, long-lived particles, supersymmetry, and neutrino-related signatures. Advanced detector technologies and reconstruction techniques, such as one-to-one correspondence reconstruction and jet origin identification, significantly improve sensitivity to rare and weakly interacting processes. The CEPC is particularly well suited to probe the electroweak phase transition and test models of electroweak baryogenesis and dark sector interactions. In addition, global fit analyses highlight the CEPC's complementary role in constraining a wide range of new physics scenarios. These features position the CEPC as a powerful tool for exploring the next frontier in fundamental particle physics in the post-Higgs discovery era.

hep-ex↗

arXiv2025

Gravitational Waveform and Polarization from Binary Black Hole Inspiral in Dynamical Chern-Simons Gravity: From Generation to Propagation

We calculate the gravitational waveform radiated from spinning black holes (BHs) binary in dynamical Chern-Simons (dCS) gravity. The equation of motion (EOM) of the spinining binary BHs is derived based on the modified Mathisson-Papapetrou-Dixon equation for the spin-aligned circular orbits. The leading-order effects induced by the dCS theory contains spin-spin interaction and monopole-quadrupole interaction, which influence both the EOM of the binary system and corresponding gravitational waveform at the second post-Newtonian (PN) order (i.e., 2PN order). After reporting the waveforms, we investigate the polarization modes of gravitational waves (GWs) in dCS theory. None of the extra modes appears in this theory up to the considered PN order. Moreover, since the time scale of the binary merger is much smaller than that of the cosmological expansion, the parity-violating effect of the dCS theory does not appear in the process of GW generation. However, during the process of GW propagation, amplitude birefringence, a typical parity-violating effect, makes plus and cross modes convert to each other, which modifies the gravitational waveform at 1.5PN order.

gr-qc↗

arXiv2025

A generalized statistical model for fits to parton distributions

Parton distribution functions (PDFs) form an essential part of particle physics calculations. Currently, the most precise predictions for these non-perturbative functions are generated through fits to global data. A problem that several PDF fitting groups encounter is the presence of tension in data sets that appear to pull the fits in different directions. In other words, the best fit depends on the choice of data set. Several methods to capture the uncertainty in PDFs in presence of seemingly inconsistent fits have been proposed and are currently in use. These methods are important to ensure that uncertainty in PDFs are not underestimated. Here we propose a novel method for estimating the uncertainty by introducing a generalized statistical model based on Bayesian Hierarchical models which is implemented via the Gaussian Mixture Model (GMM). The methodology is inspired by unsupervised machine learning techniques and is closely related to the statistical methods of Ensemble learning and Bayesian model averaging. Using a toy model of PDFs, we demonstrate how the GMM can be used to faithfully reconstruct the likelihood associated with PDF fits, which can in turn be used to accurately determine the uncertainty on PDFs, especially in the presence of tension in the fitted data sets. We further show how this statistical model reduces to the usual chi-squared likelihood function for a consistent data set and provide measures to optimize the number of Gaussians in the GMM.

hep-ph↗

arXiv2025

Flavor Physics at the CEPC: a General Perspective

We discuss the landscape of flavor physics at the Circular Electron-Positron Collider (CEPC), based on the nominal luminosity outlined in its Technical Design Report. The CEPC is designed to operate in multiple modes to address a variety of tasks. At the $Z$ pole, the expected production of 4 Tera $Z$ bosons will provide unique and highly precise measurements of $Z$ boson couplings, while the substantial number of boosted heavy-flavored quarks and leptons produced in clean $Z$ decays will facilitate investigations into their flavor physics with unprecedented precision. We investigate the prospects of measuring various physics benchmarks and discuss their implications for particle theories and phenomenological models. Our studies indicate that, with its highlighted advantages and anticipated excellent detector performance, the CEPC can explore beauty and $τ$ physics in ways that are superior to or complementary with the Belle II and Large-Hadron-Collider-beauty experiments, potentially enabling the detection of new physics at energy scales of 10 TeV and above. This potential also extends to the observation of yet-to-be-discovered rare and exotic processes, as well as testing fundamental principles such as lepton flavor universality, lepton and baryon number conservation, etc., making the CEPC a vibrant platform for flavor physics research. The $WW$ threshold scan, Higgs-factory operation and top-pair productions of the CEPC further enhance its merits in this regard, especially for measuring the Cabibbo-Kobayashi-Maskawa matrix elements, and Flavor-Changing-Neutral-Current physics of Higgs boson and top quarks. We outline the requirements for detector performance and considerations for future development to achieve the anticipated scientific goals.

hep-ex↗

arXiv2025

Assessing Color Vision Test in Large Vision-language Models

With the widespread adoption of large vision-language models, the capacity for color vision in these models is crucial. However, the color vision abilities of large visual-language models have not yet been thoroughly explored. To address this gap, we define a color vision testing task for large vision-language models and construct a dataset \footnote{Anonymous Github Showing some of the data https://anonymous.4open.science/r/color-vision-test-dataset-3BCD} that covers multiple categories of test questions and tasks of varying difficulty levels. Furthermore, we analyze the types of errors made by large vision-language models and propose fine-tuning strategies to enhance their performance in color vision tests.

cs.CV↗

arXiv2025

Global Optimization of Multi-Flyby Trajectories for Multi-Orbital-Plane Constellations Inspection

The rapid expansion of mega-constellations in low Earth orbits has posed significant challenges to space traffic management, necessitating periodic inspections of satellites to ensure the sustainability of the space environment when economically feasible. This study addresses the orbital design challenge associated with inspecting numerous satellites distributed across multiple orbital planes through flybys by proposing an innovative orbital-plane-based inspection strategy. The proposed methodology reformulates the multi-satellite flyby problem into a multi-rendezvous trajectory planning problem by proposing an analytical approach to determine a maneuver-free inspection orbit that enables flyby of all satellites within a specific orbital plane. Additionally, a three-layer global optimization framework is developed to tackle this problem. The first layer establishes an approximate cost evaluation model for orbital plane visitation sequences, utilizing a genetic algorithm to identify the optimal sequence from a vast array of candidate planes, thereby maximizing inspection targets while minimizing fuel consumption. The second layer constructs a mixed-integer programming model to locally refine the rendezvous epochs and orbital parameters of each inspection orbit to reduce the total velocity increment. The third layer accurately computes the optimal impulsive maneuvers and trajectories between inspection orbits. In contrast to traditional low-Earth orbit rendezvous optimization frameworks, the proposed framework fully leverages the adjustable freedom in inclination and right ascension of the ascending node (RAAN) of inspection orbits, significantly reducing the total velocity increment. Simulation results demonstrate that the proposed method can effectively address the trajectory optimization problem associated with constellation inspection for tens of thousands of satellites.

eess.SY↗

arXiv2025

ConvD: Attention Enhanced Dynamic Convolutional Embeddings for Knowledge Graph Completion

Knowledge graphs often suffer from incompleteness issues, which can be alleviated through information completion. However, current state-of-the-art deep knowledge convolutional embedding models rely on external convolution kernels and conventional convolution processes, which limits the feature interaction capability of the model. This paper introduces a novel dynamic convolutional embedding model, ConvD, which directly reshapes relation embeddings into multiple internal convolution kernels. This approach effectively enhances the feature interactions between relation embeddings and entity embeddings. Simultaneously, we incorporate a priori knowledge-optimized attention mechanism that assigns different contribution weight coefficients to the multiple relation convolution kernels in dynamic convolution, further boosting the expressive power of the model. Extensive experiments on various datasets show that our proposed model consistently outperforms the state-of-the-art baseline methods, with average improvements ranging from 3.28% to 14.69% across all model evaluation metrics, while the number of parameters is reduced by 50.66% to 85.40% compared to other state-of-the-art models.

cs.CL↗

arXiv2025

Forecast Analysis of Astrophysical Stochastic Gravitational Wave Background beyond general relativity: A Case Study on Brans-Dicke Gravity

Scalar-tensor gravity, exemplified by Brans-Dicke (BD) gravity, introduces additional scalar polarization modes that contribute scalar radiation alongside tensor modes. We conduct a comprehensive analysis of how gravitational wave generation and propagation effects under Brans-Dicke gravity are encoded into the astrophysical stochastic gravitational wave background (AGWB). We perform end-to-end analyses of realistic populations of simulated coalescing binary systems to generate AGWB mock data with third-generation gravitational wave detectors and conducted a complete Bayesian analysis for the first time. We find the uncertainties in the population properties of binary black holes (BBH) significantly affect the ability to constrain BD gravity. Furthermore, we explore the detectability of potential scalar backgrounds that originates from binary neutron star (BNS) and neutron-star-black-hole (NSBH) mergers, with NSBH systems expected to modify the spectral index of the scalar background and introduce oscillatory behavior. We show that the observations of the AGWB enable the separation of mixed tensor and scalar polarization modes with comparable sensitivity to each mode. However, the scalar background is expected to remain substantially weaker than the tensor background, even in scenarios where BD gravity exhibits significant deviations from general relativity (GR), resulting only upper limits can be placed on the scalar background. We conclude that for ambiguous populations, employing waveform matching with individual sources provides a more robust approach to constrain BD gravity.

gr-qc↗

arXiv2025

KG-BiLM: Knowledge Graph Embedding via Bidirectional Language Models

Recent advances in knowledge representation learning (KRL) highlight the urgent necessity to unify symbolic knowledge graphs (KGs) with language models (LMs) for richer semantic understanding. However, existing approaches typically prioritize either graph structure or textual semantics, leaving a gap: a unified framework that simultaneously captures global KG connectivity, nuanced linguistic context, and discriminative reasoning semantics. To bridge this gap, we introduce KG-BiLM, a bidirectional LM framework that fuses structural cues from KGs with the semantic expressiveness of generative transformers. KG-BiLM incorporates three key components: (i) Bidirectional Knowledge Attention, which removes the causal mask to enable full interaction among all tokens and entities; (ii) Knowledge-Masked Prediction, which encourages the model to leverage both local semantic contexts and global graph connectivity; and (iii) Contrastive Graph Semantic Aggregation, which preserves KG structure via contrastive alignment of sampled sub-graph representations. Extensive experiments on standard benchmarks demonstrate that KG-BiLM outperforms strong baselines in link prediction, especially on large-scale graphs with complex multi-hop relations - validating its effectiveness in unifying structural information and textual semantics.

cs.CL↗

arXiv2025

T2S: High-resolution Time Series Generation with Text-to-Series Diffusion Models

Text-to-Time Series generation holds significant potential to address challenges such as data sparsity, imbalance, and limited availability of multimodal time series datasets across domains. While diffusion models have achieved remarkable success in Text-to-X (e.g., vision and audio data) generation, their use in time series generation remains in its nascent stages. Existing approaches face two critical limitations: (1) the lack of systematic exploration of general-proposed time series captions, which are often domain-specific and struggle with generalization; and (2) the inability to generate time series of arbitrary lengths, limiting their applicability to real-world scenarios. In this work, we first categorize time series captions into three levels: point-level, fragment-level, and instance-level. Additionally, we introduce a new fragment-level dataset containing over 600,000 high-resolution time series-text pairs. Second, we propose Text-to-Series (T2S), a diffusion-based framework that bridges the gap between natural language and time series in a domain-agnostic manner. T2S employs a length-adaptive variational autoencoder to encode time series of varying lengths into consistent latent embeddings. On top of that, T2S effectively aligns textual representations with latent embeddings by utilizing Flow Matching and employing Diffusion Transformer as the denoiser. We train T2S in an interleaved paradigm across multiple lengths, allowing it to generate sequences of any desired length. Extensive evaluations demonstrate that T2S achieves state-of-the-art performance across 13 datasets spanning 12 domains.

cs.LG↗

arXiv2025

Large Language Model Enhanced Knowledge Representation Learning: A Survey

Knowledge Representation Learning (KRL) is crucial for enabling applications of symbolic knowledge from Knowledge Graphs (KGs) to downstream tasks by projecting knowledge facts into vector spaces. Despite their effectiveness in modeling KG structural information, KRL methods are suffering from the sparseness of KGs. The rise of Large Language Models (LLMs) built on the Transformer architecture presents promising opportunities for enhancing KRL by incorporating textual information to address information sparsity in KGs. LLM-enhanced KRL methods, including three key approaches, encoder-based methods that leverage detailed contextual information, encoder-decoder-based methods that utilize a unified Seq2Seq model for comprehensive encoding and decoding, and decoder-based methods that utilize extensive knowledge from large corpora, have significantly advanced the effectiveness and generalization of KRL in addressing a wide range of downstream tasks. This work provides a broad overview of downstream tasks while simultaneously identifying emerging research directions in these evolving domains.

cs.CL↗

arXiv2025

EasyRobust: A Comprehensive and Easy-to-use Toolkit for Robust and Generalized Vision

Deep neural networks (DNNs) has shown great promise in computer vision tasks. However, machine vision achieved by DNNs cannot be as robust as human perception. Adversarial attacks and data distribution shifts have been known as two major scenarios which degrade machine performance and obstacle the wide deployment of machines "in the wild". In order to break these obstructions and facilitate the research of model robustness, we develop EasyRobust, a comprehensive and easy-to-use toolkit for training, evaluation and analysis of robust vision models. EasyRobust targets at two types of robustness: 1) Adversarial robustness enables the model to defense against malicious inputs crafted by worst-case perturbations, also known as adversarial examples; 2) Non-adversarial robustness enhances the model performance on natural test images with corruptions or distribution shifts. Thorough benchmarks on image classification enable EasyRobust to provide an accurate robustness evaluation on vision models. We wish our EasyRobust can help for training practically-robust models and promote academic and industrial progress in closing the gap between human and machine vision. Codes and models of EasyRobust have been open-sourced in https://github.com/alibaba/easyrobust.

cs.CV↗

arXiv2025

A complete waveform comparison of post-Newtonian and numerical relativity in eccentric orbits

This study presents a thorough comparative analysis between post-Newtonian (PN) and numerically relativistic (NR) waveforms in eccentric orbits, covering nonspinning and spin-aligned configurations. The comparison examines frequency, amplitude, and phase characteristics of various harmonic modes, such as 22, 21, 33, 32, 44, 43, and 55 modes. The study utilizes eccentric PN waveforms based on 3PN quasi-Keplerian parameterization with 3PN radiative reaction, surpassing Newtonian quadrupole moment with higher-order moments. NR waveforms from RIT and SXS catalogs span mass ratios from 1/4 to 1, eccentricities up to 0.45, and durations exceeding $17000M$ across nonspinning and spin-aligned configurations. Focusing on the 22 mode, frequency comparisons between quadrupole and higher-order moments of $Ψ_4^{22}$ and $h^{22}$ were conducted. Amplitude comparisons revealed superior accuracy in quadrupole moments of $Ψ_4^{22}$. Analysis of total 180 sets of eccentric waveforms showed increasing fitting residuals with rising eccentricity, correlating with smaller mass ratios. Comparisons of initial eccentricity from PN fitting, 3PN quasi-Keplerian parameterization, and RIT/SXS catalogs revealed alignment discrepancies. Frequency, phase, and amplitude comparisons of 22 modes showed consistent inspiral behavior between PN and NR, with divergences near merger for nonspinning PN and pre-200M for spin-aligned PN.

gr-qc↗

arXiv2025

Transformer-based Graph Neural Networks for Battery Range Prediction in AIoT Battery-Swap Services

The concept of the sharing economy has gained broad recognition, and within this context, Sharing E-Bike Battery (SEB) have emerged as a focal point of societal interest. Despite the popularity, a notable discrepancy remains between user expectations regarding the remaining battery range of SEBs and the reality, leading to a pronounced inclination among users to find an available SEB during emergency situations. In response to this challenge, the integration of Artificial Intelligence of Things (AIoT) and battery-swap services has surfaced as a viable solution. In this paper, we propose a novel structural Transformer-based model, referred to as the SEB-Transformer, designed specifically for predicting the battery range of SEBs. The scenario is conceptualized as a dynamic heterogeneous graph that encapsulates the interactions between users and bicycles, providing a comprehensive framework for analysis. Furthermore, we incorporate the graph structure into the SEB-Transformer to facilitate the estimation of the remaining e-bike battery range, in conjunction with mean structural similarity, enhancing the prediction accuracy. By employing the predictions made by our model, we are able to dynamically adjust the optimal cycling routes for users in real-time, while also considering the strategic locations of charging stations, thereby optimizing the user experience. Empirically our results on real-world datasets demonstrate the superiority of our model against nine competitive baselines. These innovations, powered by AIoT, not only bridge the gap between user expectations and the physical limitations of battery range but also significantly improve the operational efficiency and sustainability of SEB services. Through these advancements, the shared electric bicycle ecosystem is evolving, making strides towards a more reliable, user-friendly, and sustainable mode of transportation.

cs.LG↗

arXiv2025

Schwarzschild Lensing From Geodesic Deviation

We revisit the gravitational lensing of light or gravitational waves by Schwarzschild black hole in geometric optics. Instead of a single massless particle, we investigate the collective behavior of a congruence of light/gravitational rays, described by the geodesic deviation equation (GDE). By projecting on the Newman-Penrose tetrad, GDE is decoupled, and we find an analytical Dyson-like series solution in the weak deflection and thin lens limits. Based on such a solution, we study the evolution of cross-sectional area and axis ratio. Finally, we reproduce the magnification and axis ratio of the lensing images up to the second order of weak deflection approximation and improve some missing corrections in previous works.

gr-qc↗

arXiv2024

Research on reinforcement learning based warehouse robot navigation algorithm in complex warehouse layout

In this paper, how to efficiently find the optimal path in complex warehouse layout and make real-time decision is a key problem. This paper proposes a new method of Proximal Policy Optimization (PPO) and Dijkstra's algorithm, Proximal policy-Dijkstra (PP-D). PP-D method realizes efficient strategy learning and real-time decision making through PPO, and uses Dijkstra algorithm to plan the global optimal path, thus ensuring high navigation accuracy and significantly improving the efficiency of path planning. Specifically, PPO enables robots to quickly adapt and optimize action strategies in dynamic environments through its stable policy updating mechanism. Dijkstra's algorithm ensures global optimal path planning in static environment. Finally, through the comparison experiment and analysis of the proposed framework with the traditional algorithm, the results show that the PP-D method has significant advantages in improving the accuracy of navigation prediction and enhancing the robustness of the system. Especially in complex warehouse layout, PP-D method can find the optimal path more accurately and reduce collision and stagnation. This proves the reliability and effectiveness of the robot in the study of complex warehouse layout navigation algorithm.

cs.RO↗