SearcharxivSearch

arXiv subjects

Yuqing Zheng

Publications and source records attributed to Yuqing Zheng.

6 recordsLinked to original sources

AgentVNE: LLM-Augmented Graph Reinforcement Learning for Affinity-Aware Multi-Agent Placement in Edge Agentic AI

The Internet of Agents is propelling edge computing toward agentic AI and edge general intelligence (EGI). However, deploying multi-agent service (MAS) on resource-constrained edge infrastructure presents severe challenges. MAS service workflows are driven by complex cross-node interactions, dynamic memory accumulation, and collaborative tool usage. Exhibiting chain-like topological dependencies and strict affinity constraints, these workflows demand real-time responsiveness that exceeds the capabilities of traditional VNE algorithms designed for static resources. To address this, we propose AgentVNE, a cloud-edge collaborative framework utilizing a dual-layer architecture. First, AgentVNE employs a large language model (LLM) to identify implicit semantic constraints and generate affinity-based resource augmentation to resolve physical dependency issues. Second, it constructs a resource similarity-aware neural network, utilizing a pre-training and PPO fine-tuning strategy to precisely capture topological similarities between dynamic workflows and heterogeneous networks. By coupling semantic perception with topological reasoning, this mechanism effectively bridges the gap between dynamic service requirements and physical infrastructure. Simulation results demonstrate that AgentVNE reduces workflow communication latency to less than 40% of baselines and improves the service acceptance rate by approximately 5%-10% under high-load scenarios. Ultimately, this work provides a foundational solution for the semantic-aware deployment of agentic AI.

cs.NI

Exploring the Potential of Quantum Approximate Optimization Algorithm in Tackling the Perfect Domination Problem

Perfect Domination Problem (PDP), a canonical challenge in combinatorial optimization, finds critical applications in real-world systems such as error-correcting codes, wireless communication networks, and social networks. Decades of research have firmly established its NP-completeness across numerous graph classes. Motivated by rapid advances in quantum computing, significant effort has recently been directed toward quantum algorithms for NP-complete problems, most notably the Quantum Approximate Optimization Algorithm (QAOA). Nonetheless, the applicability and efficacy of quantum approaches to the PDP remain entirely unexplored. This paper initiates the first systematic investigation of the PDP via QAOA. We evaluate solution quality on three benchmark instances of 6, 7, and 8 vertices using 15-18 qubits on a quantum simulator, examining more than 400 distinct parameter configurations. Experimental results confirm the algorithm's effectiveness and expose discernible trends in parameter selection. These outcomes substantiate QAOA's viability for the PDP and mark a seminal step toward situating this classical problem within the quantum-computing paradigm.

quant-ph

Scalable Near-Field Localization Based on Partitioned Large-Scale Antenna Array

This paper studies a passive localization system, where an extremely large-scale antenna array (ELAA) is deployed at the base station (BS) to locate a user equipment (UE) residing in its near-field (Fresnel) region. We propose a novel algorithm, named array partitioning-based location estimation (APLE), for scalable near-field localization. The APLE algorithm is developed based on the basic assumption that, by partitioning the ELAA into multiple subarrays, the UE can be approximated as in the far-field region of each subarray. We establish a Bayeian inference framework based on the geometric constraints between the UE location and the angles of arrivals (AoAs) at different subarrays. Then, the APLE algorithm is designed based on the message-passing principle for the localization of the UE. APLE exhibits linear computational complexity with the number of BS antennas, leading to a significant reduction in complexity compared to existing methods. We further propose an enhanced APLE (E-APLE) algorithm that refines the location estimate obtained from APLE by following the maximum likelihood principle. The E-APLE algorithm achieves superior localization accuracy compared to APLE while maintaining a linear complexity with the number of BS antennas. Numerical results demonstrate that the proposed APLE and E-APLE algorithms outperform the existing baselines in terms of localization accuracy.

eess.SP

Scalable Near-Field Localization Based on Partitioned Large-Scale Antenna Array

This paper studies a passive localization system, where an extremely large-scale antenna array (ELAA) is deployed at the base station (BS) to locate a user equipment (UE) residing in its near-field (Fresnel) region. We propose a novel algorithm, named array partitioning-based location estimation (APLE), for scalable near-field localization. The APLE algorithm is developed based on the basic assumption that, by partitioning the ELAA into multiple subarrays, the UE can be approximated as in the far-field region of each subarray. We establish a Bayeian inference framework based on the geometric constraints between the UE location and the angles of arrivals (AoAs) at different subarrays. Then, the APLE algorithm is designed based on the message-passing principle for the localization of the UE. APLE exhibits linear computational complexity with the number of BS antennas, leading to a significant reduction in complexity compared to existing methods. We further propose an enhanced APLE (E-APLE) algorithm that refines the location estimate obtained from APLE by following the maximum likelihood principle. The E-APLE algorithm achieves superior localization accuracy compared to APLE while maintaining a linear complexity with the number of BS antennas. Numerical results demonstrate that the proposed APLE and E-APLE algorithms outperform the existing baselines in terms of localization accuracy.

eess.SP

Gas Column Density Distribution of Molecular Clouds in the Third Quadrant of the Milky Way

We have obtained column density maps for an unbiased sample of 120 molecular clouds in the third quadrant of the Milky Way mid-plane (b$\le |5|^{\circ}$) within the galactic longitude range from 195$^{\circ}$ to 225$^{\circ}$, using the high sensitivity $^{12}$CO and $^{13}$CO ($J=1-0$) data from the Milky Way Imaging Scroll Painting (MWISP) project. The probability density functions of the molecular hydrogen column density of the clouds, N-PDFs, are fitted with both log-normal (LN) function and log-normal plus power-law (LN+PL) function. The molecular clouds are classified into three categories according to their shapes of N-PDFs, i.e., LN, LN+PL, and UN (unclear), respectively. About 72\% of the molecular clouds fall into the LN category, while 18\% and 10\% into the LN+PL and UN categories, respectively. A power-law scaling relation, $σ_s\propto N_{H_2}^{0.44}$, exists between the width of the N-PDF, $σ_s$, and the average column density, $N_{H_2}$, of the molecular clouds. However, $σ_s$ shows no correlation with the mass of the clouds. A correlation is found between the dispersion of normalized column density, $σ_{N/\rm }$, and the sonic Mach number, $\mathcal{M}$, of molecular clouds. Overall, as predicted by numerical simulations, the N-PDFs of the molecular clouds with active star formation activity tend to have N-PDFs with power-law high-density tails.

astro-ph.GA

Symmetry properties and widths of the filamentary structures in the Orion A giant molecular cloud

We identify 225 filaments from an H$_2$ column density map constructed using simultaneous $^{12}$CO, $^{13}$CO, and C$^{18}$O (J=1-0) observations carried out as a part of the MWISP project. We select 46 long filaments with lengths above 1.2 pc to analyze the filament column density profiles. We divide the selected filaments into 397 segments and calculate the column density profiles for each segment. The symmetries of the profiles are investigated. The proportion of intrinsically asymmetrical segments is 65.3$\%$, and that of intrinsically symmetrical ones is 21.4$\%$. The typical full width at half maximum (FWHM) of the intrinsically symmetrical filament segments is $\sim$ 0.67 pc with the Plummer-like fitting, and $\sim$ 0.50 pc with the Gaussian fitting, respectively. The median FWHM widths derived from the second-moment method for intrinsically symmetrical and asymmetrical profiles are $\sim$ 0.44 and 0.46 pc, respectively. Close association exists between the filamentary structures and the YSOs in the region.

astro-ph.GA