跳到正文
研踪PaperTrail

论文库

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

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

全站更新概况

+1085新增论文
+884其中 AI 相关
+130已有论文修订
+59新增 AI 导读

arXiv 最近完成扫描:2026-11-18 04:28 · 全站最近入库:2026-11-18 19:45各信源进度 →

统计口径与数据新鲜度

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

最近完成检查:2026-11-18 04:28最近发现新增版本:2026-11-18 19:45库内论文最新更新时间:2026-11-18 08:00

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

26,870 已收录论文22,374 AI 相关8,156 有修订112 HF 社区发现

浏览论文库

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

找到 2 篇论文 · 按版本更新时间排序上轮扫描起点 2026-11-18 04:27(北京时间)
新论文 · v1arXiv:2611.20913

Palmprint Decomposer: Interpretable and Editable Factorization via Synthetic Learning and Instance-Wise Refinement

Licheng Yan, Yuqi Wang, Jingtao Wang, Bob Zhang, Andrew Beng Jin Teoh, Lu Leng, Shuyi Li, Ziyuan Yang

原文摘要

Palmprint recognition and synthesis methods focus on extracting discriminative textures or generating images with varied textures and appearances. However, they do not generally provide an explicit image-level representation that separates palmprint texture from its underlying base appearance for independent analysis or controlled editing. We introduce Palmprint Decomposer, an interpretable framework that represents a palmprint through independently editable factors and reconstructs the image through a multiplicative composition model. A color map and a light map characterize the base appearance, while a structure map and a global texture strength parameter describe texture modulation. However, accurate reconstruction alone does not guarantee separation of palmprint texture from base appearance, as fine palmprint textures may leak into the estimated base appearance. To mitigate this ambiguity, we train the decomposer exclusively on synthetic data with direct factor supervision, using asymmetric decoding paths and decomposition constraints to suppress texture leakage. Instance-Wise Refinement further improves real-image reconstruction by directly optimizing the predicted factors for each input without relying on the trained network. Experiments across seven datasets demonstrate high reconstruction fidelity, with the extracted structure maps generally achieving verification performance comparable to the original images. Compared with existing methods, our approach achieves better factor separation while preserving more discriminative palmprint texture information.

cs.CV

新论文 · v1arXiv:2611.01831

MATE: Multi-Agent Traffic Engineering for Topology-Aware Distributed SRv6 Scheduling under Bursty Traffic

Yuang Chen, Shuyi Liu, Chengdi Lu, Fengqian Guo, Hancheng Lu, Chang Wen Chen

原文摘要

As network traffic becomes increasingly dynamic and bursty, conventional centralized traffic engineering (TE) suffers from long control-loop delays caused by network-state aggregation, centralized computation, and policy distribution. In this paper, we propose MATE, a multi-agent TE method for proactive distributed scheduling in hybrid networks with partial deployment of Segment Routing over IPv6 (SRv6). MATE uses historical traffic stability to characterize the burst risk of each traffic demand and path sensitivity to quantify the ability of candidate paths to accommodate additional traffic, thereby enabling differentiated proactive scheduling tailored to heterogeneous traffic characteristics. MATE adopts an offline-centralized training and online-distributed execution architecture. During training, a shared global critic evaluates joint actions under a reward combining maximum link utilization (MLU) with variability-weighted path sensitivity, while counterfactual difference rewards provide agent-specific credit for actor learning. During online execution, edge agents generate traffic-splitting policies from local observations and apply them through SRv6, avoiding centralized optimization in each scheduling interval. Experiments on the China Environment for Network Innovations (CENI) testbed and simulations on the Sanet topology show that MATE outperforms a multi-agent reinforcement learning (MARL) ablation baseline without agent-specific credit assignment, COPE, and TEAL in most evaluated scenarios and approaches centralized FIGRET on measured traffic traces. On CENI-Abilene, MATE achieves MLU within 10% of the linear-programming optimum in up to 90.1% of test instances. MATE also achieves lower median normalized MLU than FIGRET in most tested failure scenarios, with mean neural-inference times of 2.05--3.14~ms.

cs.NI