arXiv subjects

Ming Xiao

Publications and source records attributed to Ming Xiao.

At least 73 records · Page 4Linked to original sources

arXiv2025

Monitoring AGNs with H$β$ Asymmetry. V. Long-term Variation and Evolution of the Broad H$β$ Emission-Line Profiles

The physical origins of the diverse emission-line asymmetries observed in the spectra of active galactic nuclei (AGNs) remain incompletely understood. Monitoring the temporal variations of line profiles offers a promising approach to investigating the underlying physics. In this study, we present an analysis of the broad H$β$ emission line profiles of eight AGNs observed from the end of 2016 to May 2023 as part of the reverberation mapping campaign titled "Monitoring AGNs with H$β$ Asymmetry" (MAHA), utilizing data obtained from the Wyoming Infrared Observatory (WIRO) 2.3-meter telescope. We measure the temporal variations of line asymmetry, width, and central velocity shift for the eight objects. Our findings reveal that the variation in asymmetry is positively correlated with H$β$ flux in five of the eight objects, while the remaining objects exhibit negative or complex correlations. Furthermore, we observe anti-correlations between line width and H$β$ flux for most objects, indicating the presence of the "breathing" phenomenon in their H$β$ emission lines. In contrast, two objects demonstrate an "anti-breathing" phenomenon or complex behavior. We discuss the physical origins of the temporal variations in line profiles and propose the possibility of decomposing the variations in H$β$ asymmetry and width into components: one that corresponds to short-term variations in H$β$ flux and another that reflects long-term variations in continuum light curves, perhaps driven by radiation pressure.

astro-ph.GA↗

arXiv2025

Supplementary File: Coded Cooperative Networks for Semi-Decentralized Federated Learning

To enhance straggler resilience in federated learning (FL) systems, a semi-decentralized approach has been recently proposed, enabling collaboration between clients. Unlike the existing semi-decentralized schemes, which adaptively adjust the collaboration weight according to the network topology, this letter proposes a deterministic coded network that leverages wireless diversity for semi-decentralized FL without requiring prior information about the entire network. Furthermore, the theoretical analyses of the outage and the convergence rate of the proposed scheme are provided. Finally, the superiority of our proposed method over benchmark methods is demonstrated through comprehensive simulations.

cs.IT↗

arXiv2025

Fluid Antenna Array Enhanced Over-the-Air Computation

Over-the-air computation (AirComp) has emerged as a promising technology for fast wireless data aggregation by harnessing the superposition property of wireless multiple-access channels. This paper investigates a fluid antenna (FA) array-enhanced AirComp system, employing the new degrees of freedom achieved by antenna movements. Specifically, we jointly optimize the transceiver design and antenna position vector (APV) to minimize the mean squared error (MSE) between target and estimated function values. To tackle the resulting highly non-convex problem, we adopt an alternating optimization technique to decompose it into three subproblems. These subproblems are then iteratively solved until convergence, leading to a locally optimal solution. Numerical results show that FA arrays with the proposed transceiver and APV design significantly outperform the traditional fixed-position antenna arrays in terms of MSE.

cs.IT↗

arXiv2024

Accelerating Energy-Efficient Federated Learning in Cell-Free Networks with Adaptive Quantization

Federated Learning (FL) enables clients to share learning parameters instead of local data, reducing communication overhead. Traditional wireless networks face latency challenges with FL. In contrast, Cell-Free Massive MIMO (CFmMIMO) can serve multiple clients on shared resources, boosting spectral efficiency and reducing latency for large-scale FL. However, clients' communication resource limitations can hinder the completion of the FL training. To address this challenge, we propose an energy-efficient, low-latency FL framework featuring optimized uplink power allocation for seamless client-server collaboration. Our framework employs an adaptive quantization scheme, dynamically adjusting bit allocation for local gradient updates to reduce communication costs. We formulate a joint optimization problem covering FL model updates, local iterations, and power allocation, solved using sequential quadratic programming (SQP) to balance energy and latency. Additionally, clients use the AdaDelta method for local FL model updates, enhancing local model convergence compared to standard SGD, and we provide a comprehensive analysis of FL convergence with AdaDelta local updates. Numerical results show that, within the same energy and latency budgets, our power allocation scheme outperforms the Dinkelbach and max-sum rate methods by increasing the test accuracy up to $7$\% and $19$\%, respectively. Moreover, for the three power allocation methods, our proposed quantization scheme outperforms AQUILA and LAQ by increasing test accuracy by up to $36$\% and $35$\%, respectively.

cs.LG↗

arXiv2024

Defending Against Network Attacks for Secure AI Agent Migration in Vehicular Metaverses

Vehicular metaverses, blending traditional vehicular networks with metaverse technology, are expected to revolutionize fields such as autonomous driving. As virtual intelligent assistants in vehicular metaverses, Artificial Intelligence (AI) agents powered by large language models can create immersive 3D virtual spaces for passengers to enjoy on-broad vehicular applications and services. To provide users with seamless and engaging virtual interactions, resource-limited vehicles offload AI agents to RoadSide Units (RSUs) with adequate communication and computational capabilities. Due to the mobility of vehicles and the limited coverage of RSUs, AI agents need to migrate from one RSU to another RSU. However, potential network attacks pose significant challenges to ensuring reliable and efficient AI agent migration. In this paper, we first explore specific network attacks including traffic-based attacks (i.e., DDoS attacks) and infrastructure-based attacks (i.e., malicious RSU attacks). Then, we model the AI agent migration process as a Partially Observable Markov Decision Process (POMDP) and apply multi-agent proximal policy optimization algorithms to mitigate DDoS attacks. In addition, we propose a trust assessment mechanism to counter malicious RSU attacks. Numerical results validate that the proposed solutions effectively defend against these network attacks and reduce the total latency of AI agent migration by approximately 43.3%.

cs.NI↗

arXiv2024

Projection Method for Steady states of Cahn-Hilliard Equation with the Dynamic Boundary Condition

The Cahn-Hilliard equation is a fundamental model that describes phase separation processes of two-phase flows or binary mixtures. In recent years, the dynamic boundary conditions for the Cahn-Hilliard equation have been proposed and analyzed. Our first goal in this article is to present a projection method to locate the steady state of the CH equation with dynamic boundary conditions. The main feature of this method is that it only uses the variational derivative in the metric $L^2$ and not that in the metric $H^{-1}$, thus significantly reducing the computational cost. In addition, the projected dynamics fulfill the important physical properties: mass conservation and energy dissipation. In the temporal construction of the numerical schemes, the convex splitting method is used to ensure a large time step size. Numerical experiments for the two-dimensional Ginzburg-Landau free energy, where the surface potential is the double well potential or the moving contact line potential, are conducted to demonstrate the effectiveness of this projection method.

math.DS↗

arXiv2024

An order analysis of hyperfinite Borel equivalence relations

In this paper we first consider hyperfinite Borel equivalence relations with a pair of Borel $\mathbb{Z}$-orderings. We define a notion of compatibility between such pairs, and prove a dichotomy theorem which characterizes exactly when a pair of Borel $\mathbb{Z}$-orderings are compatible with each other. We show that, if a pair of Borel $\mathbb{Z}$-orderings are incompatible, then a canonical incompatible pair of Borel $\mathbb{Z}$-orderings of $E_0$ can be Borel embedded into the given pair. We then consider hyperfinite-over-finite equivalence relations, which are countable Borel equivalence relations admitting Borel $\mathbb{Z}^2$-orderings. We show that if a hyperfinite-over-hyperfinite equivalence relation $E$ admits a Borel $\mathbb{Z}^2$-ordering which is self-compatible, then $E$ is hyperfinite.

math.LO↗

arXiv2024

Large Language Model Based Multi-Objective Optimization for Integrated Sensing and Communications in UAV Networks

This letter investigates an unmanned aerial vehicle (UAV) network with integrated sensing and communication (ISAC) systems, where multiple UAVs simultaneously sense the locations of ground users and provide communication services with radars. To find the trade-off between communication and sensing (C\&S) in the system, we formulate a multi-objective optimization problem (MOP) to maximize the total network utility and the localization Cramér-Rao bounds (CRB) of ground users, which jointly optimizes the deployment and power control of UAVs. Inspired by the huge potential of large language models (LLM) for prediction and inference, we propose an LLM-enabled decomposition-based multi-objective evolutionary algorithm (LEDMA) for solving the highly non-convex MOP. We first adopt a decomposition-based scheme to decompose the MOP into a series of optimization sub-problems. We second integrate LLMs as black-box search operators with MOP-specifically designed prompt engineering into the framework of MOEA to solve optimization sub-problems simultaneously. Numerical results demonstrate that the proposed LEDMA can find the clear trade-off between C\&S and outperforms baseline MOEAs in terms of obtained Pareto fronts and convergence.

cs.IT↗

arXiv2024

Sensing-Communication-Computing-Control Closed-Loop Optimization for 6G Unmanned Robotic Systems

Rapid advancements in field robots have brought a new kind of cyber physical system (CPS)--unmanned robotic system--under the spotlight. In the upcoming sixth-generation (6G) era, these systems hold great potential to replace humans in hazardous tasks. This paper investigates an unmanned robotic system comprising a multi-functional unmanned aerial vehicle (UAV), sensors, and actuators. The UAV carries communication and computing modules, acting as an edge information hub (EIH) that transfers and processes information. During the task execution, the EIH gathers sensing data, calculates control commands, and transmits commands to actuators--leading to reflex-arc-like sensing-communication-computing-control ($\mathbf{SC}^3$) loops. Unlike existing studies that design $\mathbf{SC}^3$ loop components separately, we take each $\mathbf{SC}^3$ loop as an integrated structure and propose a goal-oriented closed-loop optimization scheme. This scheme jointly optimizes uplink and downlink (UL&DL) communication and computing within and across the $\mathbf{SC}^3$ loops to minimize the total linear quadratic regulator (LQR) cost. We derive optimal closed-form solutions for intra-loop allocation and propose an efficient iterative algorithm for inter-loop optimization. Under the condition of adequate CPU frequency availability, we derive an approximate closed-form solution for inter-loop bandwidth allocation. Simulation results demonstrate that the proposed scheme achieves a two-tier task-level balance within and across $\mathbf{SC}^3$ loops.

eess.SY↗

arXiv2024

Optimizing Radio Access Technology Selection and Precoding in CV-Aided ISAC Systems

Integrated Sensing and Communication (ISAC) systems promise to revolutionize wireless networks by concurrently supporting high-resolution sensing and high-performance communication. This paper presents a novel radio access technology (RAT) selection framework that capitalizes on vision sensing from base station (BS) cameras to optimize both communication and perception capabilities within the ISAC system. Our framework strategically employs two distinct RATs, LTE and millimeter wave (mmWave), to enhance system performance. We propose a vision-based user localization method that employs a 3D detection technique to capture the spatial distribution of users within the surrounding environment. This is followed by geometric calculations to accurately determine the state of mmWave communication links between the BS and individual users. Additionally, we integrate the SlowFast model to recognize user activities, facilitating adaptive transmission rate allocation based on observed behaviors. We develop a Deep Deterministic Policy Gradient (DDPG)-based algorithm, utilizing the joint distribution of users and their activities, designed to maximize the total transmission rate for all users through joint RAT selection and precoding optimization, while adhering to constraints on sensing mutual information and minimum transmission rates. Numerical simulation results demonstrate the effectiveness of the proposed framework in dynamically adjusting resource allocation, ensuring high-quality communication under challenging conditions.

eess.SP↗

arXiv2024

Optimizing Resource Allocation for Multi-modal Semantic Communication in Mobile AIGC Networks: A Diffusion-based Game Approach

Mobile Artificial Intelligence-Generated Content (AIGC) networks enable massive users to obtain customized content generation services. However, users still need to download a large number of AIGC outputs from mobile AIGC service providers, which strains communication resources and increases the risk of transmission failures. Fortunately, Semantic Communication (SemCom) can improve transmission efficiency and reliability through semantic information processing. Moreover, recent advances in Generative Artificial Intelligence (GAI) further enhanced the effectiveness of SemCom through its powerful generative capabilities. However, how to strike a balance between high-quality content generation and the size of semantic information transmitted is a major challenge. In this paper, we propose a Generative Diffusion Model (GDM)-based multi-modal SemCom (GM-SemCom) framework. The framework improves the accuracy of information reconstruction by integrating GDMs and multi-modal semantic information and also adopts a controllable extraction module for efficient and controllable problems of unstable data recovery and slow decoding speed in GAI-enabled SemCom. Then, we introduce a novel metric called Age of Semantic Information (AoSI) based on the concept of Age of Information (AoI) to quantify the freshness of semantic information. To address the resource trading problem within the framework, we propose a Stackelberg game model, which integrates the AoSI with psychological factors to provide a comprehensive measure of user utility. Furthermore, we propose a GDM-based algorithm to solve the game under incomplete information. Compared with the traditional deep reinforcement learning algorithms, numerical results demonstrate that the proposed algorithm converges faster and is closer to the Stackelberg equilibrium.

cs.NI↗

arXiv2024

Borel Order Dimension

We introduce and study a notion of Borel order dimension for Borel quasi orders. It will be shown that this notion is closely related to the notion of Borel dichromatic number for simple directed graphs. We prove a dichotomy, which generalizes the ${\GGG}_{0}$-dichotomy, for the Borel dichromatic number of Borel simple directed graphs. By applying this dichotomy to Borel quasi orders, another dichotomy that characterizes the Borel quasi orders of uncountable Borel dimension is proved. We obtain further structural information about the Borel quasi orders of countable Borel dimension by showing that they are all Borel linearizable. We then investigate the locally countable Borel quasi orders in more detail, paying special attention to the Turing degrees, and produce models of set theory where the continuum is arbitrarily large and all locally countable Borel quasi orders are of Borel dimension less than the continuum. Combining our results here with earlier work shows that the Borel order dimension of the Turing degrees is usually strictly larger than its classical order dimension.

math.LO↗

arXiv2024

Broad-line Region of the Quasar PG 2130+099. II. Doubling the Size Over Four Years?

Over the past three decades, multiple reverberation mapping (RM) campaigns conducted for the quasar PG 2130+099 have exhibited inconsistent findings with time delays ranging from $\sim$10 to $\sim$200 days. To achieve a comprehensive understanding of the geometry and dynamics of the broad-line region (BLR) in PG 2130+099, we continued an ongoing high-cadence RM monitoring campaign using the Calar Alto Observatory 2.2m optical telescope for an extra four years from 2019 to 2022. We measured the time lags of several broad emission lines (including He II, He I, H$β$, and Fe II) with respect to the 5100 Å continuum, and their time lags continuously vary through the years. Especially, the H$β$ time lags exhibited approximately a factor of two increase in the last two years. Additionally, the velocity-resolved time delays of the broad H$β$ emission line reveal a back-and-forth change between signs of virial motion and inflow in the BLR. The combination of negligible ($\sim$10%) continuum change and substantial time-lag variation (over two times) results in significant scatter in the intrinsic $R_{\rm Hβ}-L_{\rm 5100}$ relationship for PG 2130+099. Taking into account the consistent changes in the continuum variability time scale and the size of the BLR, we tentatively propose that the changes in the measurement of the BLR size may be affected by 'geometric dilution'.

astro-ph.GA↗

arXiv2024

GNSS Interference Classification Using Federated Reservoir Computing

The expanding use of Unmanned Aerial Vehicles (UAVs) in vital areas like traffic management, surveillance, and environmental monitoring highlights the need for robust communication and navigation systems. Particularly vulnerable are Global Navigation Satellite Systems (GNSS), which face a spectrum of interference and jamming threats that can significantly undermine their performance. While traditional deep learning approaches are adept at mitigating these issues, they often fall short for UAV applications due to significant computational demands and the complexities of managing large, centralized datasets. In response, this paper introduces Federated Reservoir Computing (FedRC) as a potent and efficient solution tailored to enhance interference classification in GNSS systems used by UAVs. Our experimental results demonstrate that FedRC not only achieves faster convergence but also sustains lower loss levels than traditional models, highlighting its exceptional adaptability and operational efficiency.

eess.SP↗

arXiv2024

Guiding IoT-Based Healthcare Alert Systems with Large Language Models

Healthcare alert systems (HAS) are undergoing rapid evolution, propelled by advancements in artificial intelligence (AI), Internet of Things (IoT) technologies, and increasing health consciousness. Despite significant progress, a fundamental challenge remains: balancing the accuracy of personalized health alerts with stringent privacy protection in HAS environments constrained by resources. To address this issue, we introduce a uniform framework, LLM-HAS, which incorporates Large Language Models (LLM) into HAS to significantly boost the accuracy, ensure user privacy, and enhance personalized health service, while also improving the subjective quality of experience (QoE) for users. Our innovative framework leverages a Mixture of Experts (MoE) approach, augmented with LLM, to analyze users' personalized preferences and potential health risks from additional textual job descriptions. This analysis guides the selection of specialized Deep Reinforcement Learning (DDPG) experts, tasked with making precise health alerts. Moreover, LLM-HAS can process Conversational User Feedback, which not only allows fine-tuning of DDPG but also deepen user engagement, thereby enhancing both the accuracy and personalization of health management strategies. Simulation results validate the effectiveness of the LLM-HAS framework, highlighting its potential as a groundbreaking approach for employing generative AI (GAI) to provide highly accurate and reliable alerts.

cs.CY↗

arXiv2024

Towards Quantum Federated Learning

Quantum Federated Learning (QFL) is an emerging interdisciplinary field that merges the principles of Quantum Computing (QC) and Federated Learning (FL), with the goal of leveraging quantum technologies to enhance privacy, security, and efficiency in the learning process. Currently, there is no comprehensive survey for this interdisciplinary field. This review offers a thorough, holistic examination of QFL. We aim to provide a comprehensive understanding of the principles, techniques, and emerging applications of QFL. We discuss the current state of research in this rapidly evolving field, identify challenges and opportunities associated with integrating these technologies, and outline future directions and open research questions. We propose a unique taxonomy of QFL techniques, categorized according to their characteristics and the quantum techniques employed. As the field of QFL continues to progress, we can anticipate further breakthroughs and applications across various industries, driving innovation and addressing challenges related to data privacy, security, and resource optimization. This review serves as a first-of-its-kind comprehensive guide for researchers and practitioners interested in understanding and advancing the field of QFL.

cs.LG↗

arXiv2024

Supplementary File: Cooperative Gradient Coding for Semi-Decentralized Federated Learning

Stragglers' effects are known to degrade FL performance. In this paper, we investigate federated learning (FL) over wireless networks in the presence of communication stragglers, where the power-constrained clients collaboratively train a global model by iteratively optimizing a local objective function with their local datasets and transmitting local model updates to the central parameter server (PS) through fading channels. To tackle communication stragglers without dataset sharing or prior information about the network at PS, we propose cooperative gradient coding (CoGC) for semi-decentralized FL to enable the exact global model recovery at PS. Furthermore, we conduct a thorough theoretical analysis of the proposed approach. Namely, an outage analysis of the proposed approach is provided, followed by a convergence analysis based on the failure probability of the global model recovery at PS. Nevertheless, simulation results reveal the superiority of the proposed approach in the presence of stragglers under imbalanced data distribution.

eess.SP↗

arXiv2024

RadioGAT: A Joint Model-based and Data-driven Framework for Multi-band Radiomap Reconstruction via Graph Attention Networks

Multi-band radiomap reconstruction (MB-RMR) is a key component in wireless communications for tasks such as spectrum management and network planning. However, traditional machine-learning-based MB-RMR methods, which rely heavily on simulated data or complete structured ground truth, face significant deployment challenges. These challenges stem from the differences between simulated and actual data, as well as the scarcity of real-world measurements. To address these challenges, our study presents RadioGAT, a novel framework based on Graph Attention Network (GAT) tailored for MB-RMR within a single area, eliminating the need for multi-region datasets. RadioGAT innovatively merges model-based spatial-spectral correlation encoding with data-driven radiomap generalization, thus minimizing the reliance on extensive data sources. The framework begins by transforming sparse multi-band data into a graph structure through an innovative encoding strategy that leverages radio propagation models to capture the spatial-spectral correlation inherent in the data. This graph-based representation not only simplifies data handling but also enables tailored label sampling during training, significantly enhancing the framework's adaptability for deployment. Subsequently, The GAT is employed to generalize the radiomap information across various frequency bands. Extensive experiments using raytracing datasets based on real-world environments have demonstrated RadioGAT's enhanced accuracy in supervised learning settings and its robustness in semi-supervised scenarios. These results underscore RadioGAT's effectiveness and practicality for MB-RMR in environments with limited data availability.

eess.SP↗