Yansheng Liu, Jinbo Wen, Kun Zhu, Hui Li, Yang Zhang, Jiawen Kang
原文摘要
In Low-Altitude Economy Networks (LAENets), Unmanned Aerial Vehicles (UAVs) transmit task-related information to the Base Station (BS) under stringent low-probability-of-detection constraints. These constraints limit transmission resources, hindering reliable information delivery through conventional bit-level communication. Semantic Communication (SemCom) addresses this challenge by prioritizing task-relevant information over bit-level accuracy. However, semantic abstraction must balance information loss and redundancy to preserve task reliability and transmission efficiency. Moreover, the BS cannot directly observe or reliably verify UAVs' semantic processing capabilities and abstraction-dependent transmission costs, leading to information asymmetry. We propose an incentive-aware semantic abstraction framework for covert communications in LAENets. Specifically, we adjust UAV-side semantic abstraction levels to provide differentiated covert semantic services under fixed-dimensional transmission payloads. To address information asymmetry, we develop a contract-theoretic model and adopt Prospect Theory (PT) to capture risk-sensitive semantic abstraction decisions under uncertainty. We further design a Regularized Diffusion-based Soft Actor-Critic (RDSAC) algorithm for optimal contract design under PT, incorporating diffusion entropy and action entropy regularization. Numerical results validate the proposed framework and show that RDSAC improves average rewards by 6.77% over SAC and 31.78% over proximal policy optimization.
Jiawen Kang, Jinchao Li, Mingyu Cui, Junan Li, Xixin Wu, Helen Meng
原文摘要
Verbal memory retrieval carries rich diagnostic information for Alzheimer's disease through the order, hesitation, and categorical organization of recalled words, yet computational modeling of this retrieval process remains largely unexplored. A key challenge is that timing and hierarchical structure are diagnostically entangled: the diagnostic meaning of retrieval timing depends on its hierarchical context. We propose TrajLift, a spectral framework that models verbal recall as timed trajectories on a hierarchical graph. Our central mechanism is latency-modulated heat diffusion on the semantic hierarchy, a unified operator that lifts each recalled word into a representation of both multi-scale hierarchical structure and continuous retrieval timing. Formal analysis shows that the resulting representation is first-order separable into structural and temporal components with spectral selectivity across hierarchical levels. On synthetic benchmarks requiring structure-time interaction, TrajLift stays near-perfect on deep hierarchies where all baselines fail. On real-world clinical data, we show that TrajLift outperforms diverse baselines by jointly modeling timing and semantic structure, with gains that grow as retrieval timing becomes more informative.