arXiv subjects

Ping Zhang

Publications and source records attributed to Ping Zhang.

At least 217 records · Page 12Linked to original sources

arXiv2024

Topology-aware Preemptive Scheduling for Co-located LLM Workloads

Hosting diverse large language model workloads in a unified resource pool through co-location is cost-effective. For example, long-running chat services generally follow diurnal traffic patterns, which inspire co-location of batch jobs to fulfill resource valleys between successive peaks, and thus to saturate resource allocation in cluster-wide scope. These heterogeneous workloads often have different business priorities, and therefore preemption can be leveraged for resource elasticity. However, workloads often have distinct topology preferences as well. The resources released by lower-priority instances may fail to meet the requirements of high-priority online services which are usually latency-sensitive. The root cause behind such mis-match is a lack of topology awareness of resource scheduler, especially during preemption. To bridge this gap, we develop a fine-grained topology-aware method for preemptive scheduling of hybrid workloads. The method ensures that the resources freed by preempted tasks adhere to the topological affinity needs of high-priority preemptors in a guaranteed or best-effort manner. This dynamic alignment significantly increases the efficiency of preemption and improves overall scheduled performance for LLM workloads by $55\%$.

cs.DC↗

arXiv2024

10 GHz Robust polarization modulation towards high-speed satellite-based quantum communication

In practical satellite-based quantum key distribution (QKD) systems, the preparation and transmission of polarization-encoding photons suffer from complex environmental effects and high channel-loss. Consequently, the hinge to enhancing the secure key rate (SKR) lies in achieving robust, low-error and high-speed polarization modulation. Although the schemes that realize self-compensation exhibit remarkable robustness. Their modulation speed is constrained to approximately 2 GHz to avoid the interaction between the electrical signal and the reverse optical pulses. Here we utilize the non-reciprocity of the lithium niobate modulators and eliminate the modulation on the reverse optical pulses. As this characteristic is widely available in the radio-frequency band, the modulation speed is no longer limited by the self-compensating optics and can be further increased. The measured average intrinsic QBER of the different polarization states at 10 GHz system repetition frequency is as low as 0.53% over 10 min without any compensation. And the experiment simulation shows that the proposed scheme extends the transmission distance to more than 350 km. Our work can be be efficient performed to the high-speed and high-loss satellite-based quantum communication scenario.

quant-ph↗

arXiv2024

WDMoE: Wireless Distributed Mixture of Experts for Large Language Models

Large Language Models (LLMs) have achieved significant success in various natural language processing tasks, but the role of wireless networks in supporting LLMs has not been thoroughly explored. In this paper, we propose a wireless distributed Mixture of Experts (WDMoE) architecture to enable collaborative deployment of LLMs across edge servers at the base station (BS) and mobile devices in wireless networks. Specifically, we decompose the MoE layer in LLMs by placing the gating network and the preceding neural network layer at BS, while distributing the expert networks among the devices. This deployment leverages the parallel inference capabilities of expert networks on mobile devices, effectively utilizing the limited computing and caching resources of these devices. Accordingly, we develop a performance metric for WDMoE-based LLMs, which accounts for both model capability and latency. To minimize the latency while maintaining accuracy, we jointly optimize expert selection and bandwidth allocation based on the performance metric. Moreover, we build a hardware testbed using NVIDIA Jetson kits to validate the effectiveness of WDMoE. Both theoretical simulations and practical hardware experiments demonstrate that the proposed method can significantly reduce the latency without compromising LLM performance.

cs.LG↗

arXiv2024

Semantic Feature Decomposition based Semantic Communication System of Images with Large-scale Visual Generation Models

The end-to-end image communication system has been widely studied in the academic community. The escalating demands on image communication systems in terms of data volume, environmental complexity, and task precision require enhanced communication efficiency, anti-noise ability and semantic fidelity. Therefore, we proposed a novel paradigm based on Semantic Feature Decomposition (SeFD) for the integration of semantic communication and large-scale visual generation models to achieve high-performance, highly interpretable and controllable image communication. According to this paradigm, a Texture-Color based Semantic Communication system of Images TCSCI is proposed. TCSCI decomposing the images into their natural language description (text), texture and color semantic features at the transmitter. During the transmission, features are transmitted over the wireless channel, and at the receiver, a large-scale visual generation model is utilized to restore the image through received features. TCSCI can achieve extremely compressed, highly noise-resistant, and visually similar image semantic communication, while ensuring the interpretability and editability of the transmission process. The experiments demonstrate that the TCSCI outperforms traditional image communication systems and existing semantic communication systems under extreme compression with good anti-noise performance and interpretability.

cs.CV↗

arXiv2024

Receiver Selection and Transmit Beamforming for Multi-static Integrated Sensing and Communications

Next-generation wireless networks are expected to develop a novel paradigm of integrated sensing and communications (ISAC) to enable both the high-accuracy sensing and high-speed communications. However, conventional mono-static ISAC systems, which simultaneously transmit and receive at the same equipment, may suffer from severe self-interference, and thus significantly degrade the system performance.To address this issue, this paper studies a multi-static ISAC system for cooperative target localization and communications, where the transmitter transmits ISAC signal to multiple receivers (REs) deployed at different positions. We derive the closed-form Cramér-Rao bound (CRB) on the joint estimations of both the transmission delay and Doppler shift for cooperative target localization, and the CRB minimization problem is formulated by considering the cooperative cost and communication rate requirements for the REs. To solve this problem, we first decouple it into two subproblems for RE selection and transmit beamforming, respectively. Then, a minimax linkage-based method is proposed to solve the RE selection subproblem, and a successive convex approximation algorithm is adopted to deal with the transmit beamforming subproblem with non-convex constraints. Finally, numerical results validate our analysis and reveal that our proposed multi-static ISAC scheme achieves better ISAC performance than the conventional mono-static ones when the number of cooperative REs is large.

eess.SP↗

arXiv2024

Teach Multimodal LLMs to Comprehend Electrocardiographic Images

The electrocardiogram (ECG) is an essential non-invasive diagnostic tool for assessing cardiac conditions. Existing automatic interpretation methods suffer from limited generalizability, focusing on a narrow range of cardiac conditions, and typically depend on raw physiological signals, which may not be readily available in resource-limited settings where only printed or digital ECG images are accessible. Recent advancements in multimodal large language models (MLLMs) present promising opportunities for addressing these challenges. However, the application of MLLMs to ECG image interpretation remains challenging due to the lack of instruction tuning datasets and well-established ECG image benchmarks for quantitative evaluation. To address these challenges, we introduce ECGInstruct, a comprehensive ECG image instruction tuning dataset of over one million samples, covering a wide range of ECG-related tasks from diverse data sources. Using ECGInstruct, we develop PULSE, an MLLM tailored for ECG image comprehension. In addition, we curate ECGBench, a new evaluation benchmark covering four key ECG image interpretation tasks across nine different datasets. Our experiments show that PULSE sets a new state-of-the-art, outperforming general MLLMs with an average accuracy improvement of 15% to 30%. This work highlights the potential of PULSE to enhance ECG interpretation in clinical practice.

eess.IV↗

arXiv2024

Interfacial fatigue fracture of pressure sensitive adhesives

Pressure sensitive adhesives (PSAs) are viscoelastic polymers that can form fast and robust adhesion with various adherends under fingertip pressure. The rapidly expanding application domain of PSAs, such as healthcare, wearable electronics, and flexible displays, requires PSAs to sustain prolonged loads throughout their lifetime, calling for fundamental studies on their fatigue behaviors. However, fatigue of PSAs has remained poorly investigated. Here we study interfacial fatigue fracture of PSAs, focusing on the cyclic interfacial crack propagation due to the gradual rupture of noncovalent bonds between a PSA and an adherend. We fabricate a model PSA made of a hysteresis-free poly(butyl acrylate) bulk elastomer dip-coated with a viscoelastic poly(butyl acrylate-co-isobornyl acrylate) sticky surface, both crosslinked by poly(ethylene glycol) diacrylate. We adhere the fabricated PSA to a polyester strip to form a bilayer. The bilayer is covered by another polyester film as an inextensible backing layer. Using cyclic and monotonic peeling tests, we characterize the interfacial fatigue and fracture behaviors of the bilayer. From the experimental data, we obtain the interfacial fatigue threshold (4.6 J/m2) under cyclic peeling, the slow crack threshold (33.9 J/m2) under monotonic peeling, and the adhesion toughness (~ 400 J/m2) at a finite peeling speed. We develop a modified Lake-Thomas model to describe the interfacial fatigue threshold due to noncovalent bond breaking. The theoretical prediction (2.6 J/m2) agrees well with the experimental measurement (4.6 J/m2). Finally, we discuss possible additional dissipation mechanisms involved in the larger slow crack threshold and much larger adhesion toughness. It is hoped that this study will provide new fundamental knowledge for fracture mechanics of PSAs, as well as guidance for future tough and durable PSAs.

cond-mat.soft↗

arXiv2024

Fine-Tuning is Fine, if Calibrated

Fine-tuning is arguably the most straightforward way to tailor a pre-trained model (e.g., a foundation model) to downstream applications, but it also comes with the risk of losing valuable knowledge the model had learned in pre-training. For example, fine-tuning a pre-trained classifier capable of recognizing a large number of classes to master a subset of classes at hand is shown to drastically degrade the model's accuracy in the other classes it had previously learned. As such, it is hard to further use the fine-tuned model when it encounters classes beyond the fine-tuning data. In this paper, we systematically dissect the issue, aiming to answer the fundamental question, "What has been damaged in the fine-tuned model?" To our surprise, we find that the fine-tuned model neither forgets the relationship among the other classes nor degrades the features to recognize these classes. Instead, the fine-tuned model often produces more discriminative features for these other classes, even if they were missing during fine-tuning! {What really hurts the accuracy is the discrepant logit scales between the fine-tuning classes and the other classes}, implying that a simple post-processing calibration would bring back the pre-trained model's capability and at the same time unveil the feature improvement over all classes. We conduct an extensive empirical study to demonstrate the robustness of our findings and provide preliminary explanations underlying them, suggesting new directions for future theoretical analysis. Our code is available at https://github.com/OSU-MLB/Fine-Tuning-Is-Fine-If-Calibrated.

cs.LG↗

arXiv2024

Global refined Fujita-Kato solution of 3-D inhomogeneous incompressible Navier-Stokes equations with large density

We investigate the global unique Fujita-Kato solution to the 3-D inhomogeneous incompressible Navier-Stokes equations with initial velocity $u_0$ being sufficiently small in critical spaces and with initial density being bounded from above and below. We first prove the global existence of Fujita-Kato solution to the system if we assume in addition that the initial velocity is in the critical Sobolev space. While under the additional assumptions that the initial velocity is in the critical Besov space and initial density is in a critical Besov space, we prove that the solutions are controlled by the norm of the initial data. Our results not only improve the smallness condition in the previous references for the initial velocity concerning the global Fujita-Kato solution of the system but also improve the exponential-in-time growth estimate for the solution in the paper [Abidi-Gui-Zhang, ARMA 2012] to be the uniform-in-time estimate.

math.AP↗

arXiv2024

Self-supervised inter-intra period-aware ECG representation learning for detecting atrial fibrillation

Atrial fibrillation is a commonly encountered clinical arrhythmia associated with stroke and increased mortality. Since professional medical knowledge is required for annotation, exploiting a large corpus of ECGs to develop accurate supervised learning-based atrial fibrillation algorithms remains challenging. Self-supervised learning (SSL) is a promising recipe for generalized ECG representation learning, eliminating the dependence on expensive labeling. However, without well-designed incorporations of knowledge related to atrial fibrillation, existing SSL approaches typically suffer from unsatisfactory capture of robust ECG representations. In this paper, we propose an inter-intra period-aware ECG representation learning approach. Considering ECGs of atrial fibrillation patients exhibit the irregularity in RR intervals and the absence of P-waves, we develop specific pre-training tasks for interperiod and intraperiod representations, aiming to learn the single-period stable morphology representation while retaining crucial interperiod features. After further fine-tuning, our approach demonstrates remarkable AUC performances on the BTCH dataset, \textit{i.e.}, 0.953/0.996 for paroxysmal/persistent atrial fibrillation detection. On commonly used benchmarks of CinC2017 and CPSC2021, the generalization capability and effectiveness of our methodology are substantiated with competitive results.

q-bio.QM↗

arXiv2024

Enhancing heat transfer in X-ray tube by van der heterostructures-based thermionic emission

Van der Waals (vdW) heterostructures have attracted much attention due to their distinctive optical, electrical, and thermal properties, demonstrating promising potential in areas such as photocatalysis, ultrafast photonics, and free electron radiation devices. Particularly, they are promising platforms for studying thermionic emission. Here, we illustrate that using vdW heterostructure-based thermionic emission can enhance heat transfer in vacuum devices. As a proof of concept, we demonstrate that this approach offers a promising solution to the long-standing overheating issue in X-ray tubes. Specifically, we show that the saturated target temperature of a 2000 W X-ray tube can be reduced from around 1200 celsius to 490 celsius. Additionally, our study demonstrates that by reducing the height of the Schottky barrier formed in the vdW heterostructures, the thermionic cooling performance can be enhanced. Our findings pave the way for the development of high-power X-ray tubes.

physics.app-ph↗

arXiv2024

MOC-RVQ: Multilevel Codebook-Assisted Digital Generative Semantic Communication

Vector quantization-based image semantic communication systems have successfully boosted transmission efficiency, but face challenges with conflicting requirements between codebook design and digital constellation modulation. Traditional codebooks need wide index ranges, while modulation favors few discrete states. To address this, we propose a multilevel generative semantic communication system with a two-stage training framework. In the first stage, we train a high-quality codebook, using a multi-head octonary codebook (MOC) to compress the index range. In addition, a residual vector quantization (RVQ) mechanism is also integrated for effective multilevel communication. In the second stage, a noise reduction block (NRB) based on Swin Transformer is introduced, coupled with the multilevel codebook from the first stage, serving as a high-quality semantic knowledge base (SKB) for generative feature restoration. Finally, to simulate modern image transmission scenarios, we employ a diverse collection of high-resolution 2K images as the test set. The experimental results consistently demonstrate the superior performance of MOC-RVQ over conventional methods such as BPG or JPEG. Additionally, MOC-RVQ achieves comparable performance to an analog JSCC scheme, while needing only one-sixth of the channel bandwidth ratio (CBR) and being directly compatible with digital transmission systems.

cs.CV↗

arXiv2024

Wireless Environment Information Sensing, Feature, Semantic, and Knowledge: Four Steps Towards 6G AI-Enabled Air Interface

The air interface technology plays a crucial role in optimizing the communication quality for users. To address the challenges brought by the radio channel variations to air interface design, this article proposes a framework of wireless environment information-aided 6G AI-enabled air interface (WEI-6G AI$^{2}$), which actively acquires real-time environment details to facilitate channel fading prediction and communication technology optimization. Specifically, we first outline the role of WEI in supporting the 6G AI$^{2}$ in scenario adaptability, real-time inference, and proactive action. Then, WEI is delineated into four progressive steps: raw sensing data, features obtained by data dimensionality reduction, semantics tailored to tasks, and knowledge that quantifies the environmental impact on the channel. To validate the availability and compare the effect of different types of WEI, a path loss prediction use case is designed. The results demonstrate that leveraging environment knowledge requires only 2.2 ms of model inference time, which can effectively support real-time design for future 6G AI$^{2}$. Additionally, WEI can reduce the pilot overhead by 25\%. Finally, several open issues are pointed out, including multi-modal sensing data synchronization and information extraction method construction.

eess.SP↗

arXiv2024

Joint Source-Channel Coding: Fundamentals and Recent Progress in Practical Designs

Semantic- and task-oriented communication has emerged as a promising approach to reducing the latency and bandwidth requirements of next-generation mobile networks by transmitting only the most relevant information needed to complete a specific task at the receiver. This is particularly advantageous for machine-oriented communication of high data rate content, such as images and videos, where the goal is rapid and accurate inference, rather than perfect signal reconstruction. While semantic- and task-oriented compression can be implemented in conventional communication systems, joint source-channel coding (JSCC) offers an alternative end-to-end approach by optimizing compression and channel coding together, or even directly mapping the source signal to the modulated waveform. Although all digital communication systems today rely on separation, thanks to its modularity, JSCC is known to achieve higher performance in finite blocklength scenarios, and to avoid cliff and the levelling-off effects in time-varying channel scenarios. This article provides an overview of the information theoretic foundations of JSCC, surveys practical JSCC designs over the decades, and discusses the reasons for their limited adoption in practical systems. We then examine the recent resurgence of JSCC, driven by the integration of deep learning techniques, particularly through DeepJSCC, highlighting its many surprising advantages in various scenarios. Finally, we discuss why it may be time to reconsider today's strictly separate architectures, and reintroduce JSCC to enable high-fidelity, low-latency communications in critical applications such as autonomous driving, drone surveillance, or wearable systems.

cs.IT↗

arXiv2024

MambaJSCC: Adaptive Deep Joint Source-Channel Coding with Generalized State Space Model

Lightweight and efficient neural network models for deep joint source-channel coding (JSCC) are crucial for semantic communications. In this paper, we propose a novel JSCC architecture, named MambaJSCC, that achieves state-of-the-art performance with low computational and parameter overhead. MambaJSCC utilizes the visual state space model with channel adaptation (VSSM-CA) blocks as its backbone for transmitting images over wireless channels, where the VSSM-CA primarily consists of the generalized state space models (GSSM) and the zero-parameter, zero-computational channel adaptation method (CSI-ReST). We design the GSSM module, leveraging reversible matrix transformations to express generalized scan expanding operations, and theoretically prove that two GSSM modules can effectively capture global information. We discover that GSSM inherently possesses the ability to adapt to channels, a form of endogenous intelligence. Based on this, we design the CSI-ReST method, which injects channel state information (CSI) into the initial state of GSSM to utilize its native response, and into the residual state to mitigate CSI forgetting, enabling effective channel adaptation without introducing additional computational and parameter overhead. Experimental results show that MambaJSCC not only outperforms existing JSCC methods (e.g., SwinJSCC) across various scenarios but also significantly reduces parameter size, computational overhead, and inference delay.

cs.IT↗

arXiv2024

Clutter Suppression, Time-Frequency Synchronization, and Sensing Parameter Association in Asynchronous Perceptive Vehicular Networks

Significant challenges remain for realizing precise positioning and velocity estimation in perceptive vehicular networks (PVN) enabled by the emerging integrated sensing and communication technology. First, complicated wireless propagation environment generates undesired clutter, which degrades the vehicular sensing performance and increases the computational complexity. Second, in practical PVN, multiple types of parameters individually estimated are not well associated with specific vehicles, which may cause error propagation in multiple-vehicle positioning. Third, radio transceivers in a PVN are naturally asynchronous, which causes strong range and velocity ambiguity. To overcome these challenges, 1) we introduce a moving target indication based joint clutter suppression and sensing algorithm, and analyze its clutter-suppression performance and the Cramer-Rao lower bound of the paired range-velocity estimation upon using the proposed clutter suppression algorithm; 2) we design algorithms for associating individual direction-of-arrival estimates with the paired range-velocity estimates based on "domain transformation"; 3) we propose the first viable carrier frequency offset (CFO) and time offset (TO) estimation algorithm that supports passive vehicular sensing in non-line-of-sight environments. This algorithm treats the delay-Doppler spectrum of the signals reflected by static objects as an environment-specific "fingerprint spectrum", which is shown to exhibit a circular shift property upon changing the CFO and/or TO. Then, the CFO and TO are efficiently estimated by acquiring the number of circular shifts, and we also analyse the mean squared error performance of the proposed time-frequency synchronization algorithm. Simulation results demonstrate the performance advantages of our algorithms under diverse configurations, while corroborating the theoretical analysis.

eess.SP↗

arXiv2024

Global derivation of the 1D Vlasov-Poisson equation from quantum many-body dynamics with screened Coulomb potential

We study the 1D quantum many-body dynamics with a screened Coulomb potential in the mean-field setting. Combining the quantum mean-field, semiclassical, and Debye length limits, we prove the global derivation of the 1D Vlasov-Poisson equation. We tackle the difficulties brought by the pure state data, whose Wigner transforms converge to Wigner measures. We find new weighted uniform estimates around which we build the proof. As a result, we obtain, globally, stronger limits, and hence the global existence of solutions to the 1D Vlasov-Poisson equation subject to such Wigner measure data, which satisfy conservation laws of mass, momentum, and energy, despite being measure solutions. This happens to solve the 1D case of an open problem regarding the conservation law of the Vlasov-Poisson equation raised in [18] by Diperna and Lions.

math.AP↗

arXiv2024

Stochastic Geometry Based Modelling and Analysis of Uplink Cooperative Satellite-Aerial-Terrestrial Networks for Nomadic Communications with Weak Satellite Coverage

Cooperative satellite-aerial-terrestrial networks (CSATNs), where unmanned aerial vehicles (UAVs) are utilized as nomadic aerial relays (A), are highly valuable for many important applications, such as post-disaster urban reconstruction. In this scenario, direct communication between terrestrial terminals (T) and satellites (S) is often unavailable due to poor propagation conditions for satellite signals, and users tend to congregate in regions of finite size. There is a current dearth in the open literature regarding the uplink performance analysis of CSATN operating under the above constraints, and the few contributions on the uplink model terrestrial terminals by a Poisson point process (PPP) relying on the unrealistic assumption of an infinite area. This paper aims to fill the above research gap. First, we propose a stochastic geometry based innovative model to characterize the impact of the finite-size distribution region of terrestrial terminals in the CSATN by jointly using a binomial point process (BPP) and a type-II Mat{é}rn hard-core point process (MHCPP). Then, we analyze the relationship between the spatial distribution of the coverage areas of aerial nodes and the finite-size distribution region of terrestrial terminals, thereby deriving the distance distribution of the T-A links. Furthermore, we consider the stochastic nature of the spatial distributions of terrestrial terminals and UAVs, and conduct a thorough analysis of the coverage probability and average ergodic rate of the T-A links under Nakagami fading and the A-S links under shadowed-Rician fading. Finally, the accuracy of our theoretical derivations are confirmed by Monte Carlo simulations. Our research offers fundamental insights into the system-level performance optimization for the realistic CSATNs involving nomadic aerial relays and terrestrial terminals confined in a finite-size region.

cs.NI↗