跳到正文
研踪PaperTrail

论文库

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

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

全站更新概况

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

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

统计口径与数据新鲜度

统计 2026-11-17 22:42 — 2026-11-18 22:42(北京时间) · 点击数字查看对应简报;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.13942

Data4Cyber: Labeled Cyber-Physical Datasets for Distribution-Grid Management Systems Under Representative OT Attacks

Ömer Sen, Lennart Bader, Marawan Emara, Martin Serror, Benedikt Schwalm, Junichi Tsurumi, Tatsumi Oba, Tomohiro Izawa 等 9 位作者

原文摘要

Cyberattacks against power systems increasingly exploit industrial communication and control dependencies arising from distributed energy resources (DER), remote management, and market-based incentives. Progress on intrusion detection is constrained by a lack of public datasets that align operational technology (OT) network telemetry with physical measurements and control context. Data4Cyber is a labeled cyber-physical dataset recorded in a laboratory distribution management system (DMS) for self-consumption optimization with photovoltaic generation, battery storage, controllable loads, and substation metering. It captures synchronized process measurements, controller context, price incentives, and packet captures (Modbus/TCP and MQTT) across one benign baseline and six attack scenarios spanning protocol-semantic Modbus manipulation, man-in-the-middle (MitM) false-data injection, and MQTT price manipulation. Its fixed 1 s time base, phase-resolved labels, and state-oriented representation support temporally blocked stateful-detector evaluation. Baseline results show that high recall alone is insufficient: several detectors achieve sensitivity through alarm saturation. Context-driven attacks require process-aware interpretation rather than single-channel thresholding.

cs.CR

新论文 · v1arXiv:2611.02969

Revisiting (Bijective) Burrows-Wheeler Transform Space-Time Trade-Off Constructions

Dominik Köppl, Tomohiro I

原文摘要

The bijective Burrows-Wheeler transform (BBWT) replaces the delimiter of the ordinary BWT by a Lyndon factorization and sorts factor conjugates in $ω$-order. It admits quadratic-time constant-workspace algorithms and linear-time linear-space algorithms. We extend the small-space BWT trade-off of Crochemore et al. [JDA,'15] to the BBWT and accelerate both constructions. For $τ\in [3..n]$, let $σ_τ\le\min(σ,τ+1)$ be the maximum construction-batch alphabet size. We construct either transform in $ O\!\left( \frac{n^2}τ \frac{\logτ}{\log\logτ} \right) $ time and $O(τσ_τ)$ additional space, assuming $τσ_τ=O(n)$. This improves the transferred $O((n^2/τ)\logτ)$ bound by a $\log\logτ$ factor. If $σ_τ\in w^{O(1)}$, where $w\inΩ(\log n)$ is the word size, the time improves to $ O\!\left( \frac{n^2}τ + \frac{n\logτ}{\log\logτ} \right). $ For inversion, the same bounds hold with the global alphabet size $σ$ in place of $σ_τ$.

cs.DS