跳到正文
研踪PaperTrail

论文库

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

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

全站更新概况

+979新增论文
+781其中 AI 相关
+119已有论文修订
+95新增 AI 导读

arXiv 最近完成扫描:2026-11-20 08:48 · 全站最近入库:2026-11-20 19:58各信源进度 →

统计口径与数据新鲜度

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

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

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

28,961 已收录论文24,030 AI 相关8,912 有修订112 HF 社区发现

浏览论文库

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

找到 2 篇论文 · 按版本更新时间排序上轮扫描起点 2026-11-20 08:46(北京时间)
新论文 · v1arXiv:2611.10708

Distributed Intelligent Ad Hoc Routing Agents for Communication at Protests During Internet Shutdowns

Matthew Schmidheiser, Milena Radenkovic

原文摘要

Governments around the world are increasingly using internet shutdowns to block digital communication. Internet shutdowns are particularly dangerous during political protests, as they inhibit protesters' ability to organize and communicate critical, potentially life-saving information and may be used to prevent awareness of state-based violence. Recent prior works have explored secure, private messaging systems for use during political protests and internet shutdowns but have encountered long delivery delays or low delivery rates under challenging conditions. In this work, we explore the use of distributed, adaptive, social- and congestion-aware heuristics and efficient communication patterns to create an intelligent ad hoc routing protocol in which network agents learn and leverage the network social environment and monitor and respond to dynamic network congestion behaviour to route messages in a time- and resource-efficient manner. Through this exploration, we contribute an intelligent algorithm and protocol which overall achieves comparable or higher delivery rates relative to the leading dynamic clique routing protocol which it extends while also transmitting messages through notably fewer carriers and, when network devices have larger amounts of buffer storage, transmitting fewer message-related packets. We additionally contribute a further understanding of routing limitations and challenges and conceptualizations of extensions of intelligent dynamic clique routing to overcome them.

cs.NI

新论文 · v1arXiv:2610.37933

NLP-based Message Prioritisation for Opportunistic Routing: A Case Study of Nepal Earthquake Emergency Communication

Yihang Cao, Milena Radenkovic

原文摘要

This dissertation investigates whether Natural Language Processing (NLP) based semantic message prioritisation can improve the treatment of urgent disaster messages in opportunistic emergency communication, using the 2015 Nepal earthquake as a case study. TF IDF with Logistic Regression and BERT are used to classify social media messages into nine humanitarian categories, which are mapped to four routing priorities from P1 to P4. These priorities are integrated into the ONE simulator within a controlled Kathmandu earthquake scenario using a modified Binary Spray and Wait router. BERT achieves higher priority accuracy and P1 recall than Logistic Regression, while reducing under prioritisation and severe priority errors. However, improved NLP performance does not produce uniform network gains. P1 delivery probability remains high and similar across routing conditions, and no consistent latency reduction is observed. The clearest difference appears under buffer pressure, where the BERT condition shows fewer observed ground truth P1 buffer losses than Logistic Regression. The results indicate that semantic prioritisation is most valuable when limited transmission and storage resources are contested, although it cannot overcome mobility and contact constraints in opportunistic networks.

cs.NI · cs.AI