Nov 2026· IEEE Internet of Things Journal· Vol 13, pp. 51453-51467· 0 citations· 40 references
Abstract
Sensor-based human activity recognition (HAR) on edge platforms requires reducing inference-time computation while preserving recognition quality. Existing approaches, such as early exiting or explicit multibranch routing, may introduce architectural complexity or additional decision overhead. We propose a compute-aware polynomial attention drop-in replacement (PADRe) architecture that adaptively regulates per-sample computation within a shared backbone through prefix-based execution of polynomial transformations. The proposed method maintains a unified sequential path and controls the computation executed within each block according to the input, rather than changing network depth or selecting separate branches. A lightweight degree gate estimates input-dependent computation demand from a global feature descriptor. During training, the model transitions from soft routing for stable optimization to hard prefix execution aligned with inference. Each PADRe block reuses intermediate outputs to progressively construct higher order representations while avoiding unnecessary computation. Experiments on UCI-HAR, WISDM, PAMAP2, and MHEALTH show that the proposed method approaches the recognition performance of fixed maximum-degree execution while reducing average executed floating-point operations (FLOPs) and measured inference latency by approximately 19.6% and 28.5%, respectively. Matched-budget comparisons with fixed-degree variants support the effectiveness of input-adaptive execution, while controlled corruption experiments indicate relatively stable behavior under moderate signal degradation. On-device evaluation on a Raspberry Pi 4B demonstrated feasibility on a relatively high-end edge platform. Overall, the proposed framework provides a competitive recognition–computation tradeoff through input-adaptive compute control within a shared sequential backbone.
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.