Nov 2026· IEEE Internet of Things Journal· Vol 13, pp. 51613-51624· 0 citations· 53 references
TL;DR
A structure-aware universal adversarial perturbation (SA-UAP) that leverages the spectral properties of the exposed linear operators in the edge-side subnetwork and is optimized to align with dominant singular directions of the accessible layers, thereby maximizing perturbation amplification through the front-end feature extractor.
Abstract
Split computing has emerged as a practical architecture for deploying deep neural networks (DNNs) in resource-constrained Internet of Things (IoT) systems, where early network layers run on edge devices, and the remaining layers execute on edge servers or in the cloud. While this architecture improves efficiency and reduces latency, it also exposes the device-side subnetwork, creating potential security risks. In this article, we investigate whether partial exposure of early-layer parameters can be exploited to construct effective adversarial attacks against the full split-deployed model. We propose a structure-aware universal adversarial perturbation (SA-UAP) that leverages the spectral properties of the exposed linear operators in the edge-side subnetwork. In particular, the perturbation is optimized to align with dominant singular directions of the accessible layers, thereby maximizing perturbation amplification through the front-end feature extractor. Unlike conventional adversarial attack methods, the proposed approach requires neither full-model access nor repeated interaction with the cloud-side model, making it particularly suitable for realistic IoT split-deployment scenarios. Extensive experiments on CIFAR-10 and ImageNet with multiple backbone architectures demonstrate that the proposed attack significantly degrades classification accuracy and outperforms existing data-free and spectral baselines. These results reveal that the exposed prefix of split-deployed models contains exploitable spectral vulnerabilities, highlighting an important security consideration for edge–cloud collaborative intelligence.
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.