跳到正文
研踪PaperTrail

论文库

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

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

全站更新概况

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

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

统计口径与数据新鲜度

统计 2026-11-21 22:13 — 2026-11-22 22:13(北京时间) · 点击数字查看对应简报;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(北京时间)
新论文 · v1arXiv:2611.24269

Keeping Up with the Kernel: Can LLMs Adapt Linux Drivers to Interface Changes?

Xinrui Yang, Jiawen Liu, Arina Kharlamova, Humaid Alqasimi, Tianyi Zhang, Alnoor Ismail, Youcheng Sun, Chun Jason Xue

原文摘要

We analyze collateral evolution in Linux, the coordinated updates that drivers require when the kernel interfaces they depend on change, over the 20 years since it was first studied, covering releases from v3.0 to v7.2. Since v2.6.13, the number of driver files and support libraries has grown about eightfold, a single change to the most widely used library can now reach about 5.3k driver files, and such changes arrive either in bursts or spread over many releases. We introduce CoEvoBench, a benchmark that asks models to adapt an old driver module to a target kernel and evaluates the result against the developer's reference patch. The benchmark contains 316 manually confirmed tasks from 202 mainline commits and 268 modules, spanning kernel releases v6.19 to v7.2. It distinguishes 134 build-breaking tasks, where the old driver fails to compile, from 182 build-compatible tasks, where the old usage still builds. Using CoEvoAgent, we evaluate Direct, SmPL, and mini-SWE-agent with DeepSeek Flash, and compare Direct with Claude Sonnet 5.5 and GPT-6.1 Sol. With DeepSeek, default Direct generation achieves strict reference agreement on 41.0% of build-breaking tasks but only 3.3% of build-compatible tasks.

cs.SE · cs.OS

版本更新 · v5arXiv:2507.23325

DualTopo: Spatio-Temporal Lane Graph Generation with Dual Latent World Models and Parallel Query Supervision

Yiming Yang, Hongbin Lin, Yueru Luo, Suzhong Fu, Chao Zheng, Xinrui Yan, Kun Tang, Chen Lv 等 10 位作者

原文摘要

Lane topology reasoning constructs a spatiotemporal road graph G = (V, E) in bird's-eye view (BEV), providing structured road representations for planning-oriented autonomous driving. Stream-based methods propagate temporal cues at both the query and BEV levels, yet suffer from two critical limitations: (1) initialized queries receive insufficient supervision, as temporal queries dominate Hungarian matching and leave them undertrained; and (2) temporal propagation is weakened by BEV boundary information loss during feature warping. Since initialized queries serve as propagation anchors, particularly at the first frame, these deficiencies compound across frames and degrade graph generation quality. We propose DualTopo, a spatio-temporal lane graph generation framework with dual latent world models and dual parallel decoder pathways. The dual-pathway decoder supervises temporal and initialized queries concurrently, ensuring initialized queries are well-trained and serve as reliable anchors. Dual latent world models conditioned on ego-motion propagate latent state representations from past observations to the present, substantially improving spatiotemporal graph generation. Extensive experiments on OpenLane-V2 demonstrate leading lane detection accuracy and competitive topology graph prediction. Code is available at https://github.com/YimingYang23/DualTopo.

cs.CV