跳到正文
研踪PaperTrail

论文库

检索计算机领域论文,按研究方向、作者或关键词筛选。

部分采集异常
正在读取账号与研究记录…

全站更新概况

+0新增论文
+0其中 AI 相关
+0已有论文修订
+91新增 AI 导读

arXiv 最近完成扫描:2026-11-22 21:02 · 全站最近入库:2026-11-21 12:19各信源进度 →

统计口径与数据新鲜度

统计 2026-11-21 21:37 — 2026-11-22 21:37(北京时间) · 点击数字查看对应简报;AI 相关包含在新增论文内。

最近完成检查:2026-11-22 21:02最近发现新增版本:2026-11-21 12:19库内论文最新更新时间:2026-11-20 02:59

每分钟刷新已保存的数据。空检查不代表采集异常;新收录可能包含历史论文。AI 导读按新增版本计数。

29,158 已收录论文24,181 AI 相关8,992 有修订112 HF 社区发现

浏览论文库

时间范围跟随排序:版本更新、本站收录或首次发表。最新收录可能包含历史论文。部分信源异常,查看状态 →

找到 2 篇论文 · 按版本更新时间排序上轮扫描起点 2026-11-22 21:00(北京时间)
版本更新 · v2arXiv:2603.01478

Contract-Theoretic Semantic Abstraction for Covert Communication in LAENets

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.

cs.NI

新论文 · v1arXiv:2611.12197

TrajLift: Lifting Memory Recall Trajectories with Latency-Modulated Heat Diffusion

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.

cs.CL · cs.AI · q-bio.NC