This paper presents a priority-aware admission-control architecture built around two trust mechanisms: a lightweight router that assigns each request a priority level grounded in verifiable evidence rather than a model confidence, and a deterministic safety gate that rejects unsafe outputs regardless of which model checkpoint produced them.
Abstract
Mission-critical mobile networks, including UAV-based disaster-response systems, must keep delivering usable and trustworthy inference under the exact conditions that make inference harder: constrained edge compute, degraded backhaul, and requests arriving in bursts rather than at a steady rate. A system that allocates compute uniformly has no way to fail gracefully once a burst exceeds its budget, dropping high-urgency requests along with low-urgency ones. In this paper, we present a priority-aware admission-control architecture built around two trust mechanisms: a lightweight router that assigns each request a priority level grounded in verifiable evidence rather than a model confidence, and a deterministic safety gate that rejects unsafe outputs regardless of which model checkpoint produced them. Low- and medium-priority requests are served by a baseline checkpoint, and a confidence-gated escalation path that reserves a more capable checkpoint for requests that need it. Both mechanisms are designed as auditable security controls rather than opaque model judgments: the router functions as a content-based access-control decision, and the safety gate as a policy-enforcement point that cannot be bypassed by manipulating the model confidence. We evaluate this policy end-to-end. The priority queue degrades gracefully, exactly as designed, under a simulated burst load. The router and confidence gate that feed it, however, correctly protect only 46.58% of genuinely high-priority requests, and a policy-optimization stage did not measurably improve the underlying checkpoint. Ultimately, a safety mechanism is only as trustworthy as the evidence behind it.
This publication proposes a definition and a classification of agile software development approaches and analyses ten software development methods that can be characterized as being "agile" against the defined criterion.
P. Abrahamsson, O. Salo, Jussi Ronkainen et al.· arXiv.org· 727 citations· ⚡54
The study shows that agile practices improve both informal and formal communication, but indicates that, in larger development situations involving multiple external stakeholders, a mismatch of adequate communication mechanisms can sometimes even hinder the communication.
M. Pikkarainen, Jukka Haikara, O. Salo et al.· Empirical Software Engineeri...· 401 citations· ⚡48
The results indicate that software engineering work practices are chosen opportunistically, adapted and configured to provide value under the constrains imposed by the startup context.
Nicolò Paternoster, Carmine Giardino, M. Unterkalmsteiner et al.· Information and Software Tec...· 394 citations· ⚡54
The perception of the impact of agile methods is predominantly positive, and several challenge areas were discovered, but based on this study, agile methods are here to stay.
M. Laanti, O. Salo, P. Abrahamsson· Information and Software Tec...· 260 citations· ⚡20
Related blog posts
Microsoft Research Blog· microsoft.comOct 29, 2026
Host Sowbhagya Suresh shares some of the latest news and cutting-edge research from across Microsoft—from understanding the challenges facing coding agents to uncovering how people use AI at work and improving extended-range weather forecasting. The post Microsoft Research Focus – Edition #97 appeared first on Microsoft Research.
MIT News · Artificial Intelligence· news.mit.eduOct 28, 2026
Professor Paris Smaragdis develops computers with superhuman hearing for applications like speech recognition, music understanding, and environmental monitoring.
For decades, a fundamental question about the difficulty of computing in high-dimensional spaces has resisted proof. New research resolves this question, removing a major theoretical obstacle to understanding the efficiency of randomized algorithms used across science and computing. The Kannan–Lovász–Simonovits (KLS) conjecture was proposed in 1995. It asks whether, for a broad class of high-dimensional […] The post Solving a 31-year-old grand challenge in mathematics – the KLS conjecture appear…
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.