Skip to content

Category

edge computing

2,653 papers

#edge computing Open access Sep 2026

What must a theory of perturbational complexity explain? Nine preregistration-hardened constraints, six dead hypotheses, and a minimal visibility account

Across five preprints (doi:10.5281/zenodo.22100546, .22100826, .22101059, .22120069, .22133403), we measured how perturbational complexity behaves once its estimator is debiased, what quantity it tracks — the reproducible dimensionality of the evoked response (R-dim) — and how that quantity depends on dynamics, trial c...

Nicolás Federico Galindez · 0 citations
#edge computing Open access Sep 2026

Frustration and holonomy in sheaves of qualia structures: quantitative local-to-global principles for phenomenal unity

In [1] we introduced the frustration f(S)f(S) of a sheaf of pseudometric spaces — the least consistency radius (in the sense of Robinson [3, 4]) achievable by any assignment — and proved metric local-to-global principles: holonomy displacement bounds, exact values on cycles, and rectification on acyclic covers. Prompte...

Otaviano Lucas Duarte Santos · 0 citations
#edge computing Dataset Open access Sep 2026

A Confound-Annotated Curriculum Dataset with Parsed Prerequisite Logic for the Universities of the United Arab Emirates

A machine-readable, course-level corpus of the curricula of the universities of the United Arab Emirates, assembled from their published course catalogs. The corpus comprises twenty-two institutions across 56 catalog editions, 52,802 course records, and 33,945 parsed prerequisite relations, of which 7,030 (20.7%) are d...

Sherzod Turaev, Saja Al-Dabet, Mary John et al. · 0 citations
#edge computing Open access Sep 2026

Cumulative Intraoperative Hypothermic Burden, Transfusion, and Estimated Blood Loss: A Retrospective Cohort Study

Superseded. This record is retired and should not be used or cited. It is replaced by 10.5281/zenodo.22234051, which is the archive accompanying the manuscript. Version v2.0.0 of this record (10.5281/zenodo.22232689) additionally contained files that should not have been distributed and its removal has been requested....

Fabrice Tiku Nyambod · 0 citations
#edge computing Book Open access Sep 2026

TinyHLS, a Python-based Hardware Compiler for 1D and 2D Convolutional Neural Networks

TinyHLS is a Python-based hardware compiler that automatically generates hardware accelerators in the form of hardware description language (HDL) code for Convolutional Neural Networks (CNNs). The description of the CNN architecture as well as the training is done in advance using Python TensorFlow Keras. TinyHLS reduc...

R. Gaede, I. Hoyer, H. Kappert et al. · 0 citations
#edge computing Open access Sep 2026

Reproducibility package — Source-Code Analysis of iFogSim for Simulating Distributed IoT Architectures

Simulation is an indispensable tool for validating distributed IoT architectures before physical deployment, and iFogSim has emerged as one of the most widely adopted platform in the fog and edge computing research community. Yet the experience of using iFogSim for non-canonical, application-specific architectures rema...

Milliam Maxime Zekeng Ndadji · 0 citations
#edge computing Open access Sep 2026

Improved Conservative Scheme for Lenard‐Bernstein Collisions in Gyrokinetic Turbulence Simulations

Turbulence in the edge and scrape‐off layer regions plays a critical role for the performance of future magnetic confinement fusion power plants. Gyrokinetic simulations allow studying this regime with high fidelity. A key aspect in these regions is the high concentration of impurities, which can radiate energy, lead...

A. Sulimro, P. Ulbl, Jordy Trilaksono et al. · 0 citations
#edge computing Open access Sep 2026

Bursty workload-adaptive scheduling with data protections for industrial cloud–edge collaboration

The Zero-Knowledge random range proof based scheduling data protection algorithm (ZKRRP-SDPA) is introduced, which employs an enhanced zero-knowledge range proof for real-valued ranges together with digital signatures, guaranteeing the security of node attribute data against any adversary except the node itself.

Jing Zhan, Xin Liu, Zhi-Qiang Zeng et al. · 0 citations
#edge computing Open access Sep 2026

Gray Langurs Optimizer-Optimized Feature Mode Decomposition for Adaptive Denoising of Multi-Source Monitoring Data from Floating Offshore Wind Turbines

Feature Mode Decomposition (FMD) adaptively decomposes signals into band-limited modes through an adaptive finite impulse response (FIR) filter bank optimized via correlated kurtosis (CK) maximization, yet its denoising performance is highly sensitive to four hyperparameters—the number of decomposition modes nm, the fi...

Xiang Ji, Lei Han, Yan Zhang · 0 citations
#edge computing Open access Sep 2026

Cooperative Computation for Multiuser Task Offloading in Wireless-Powered MEC Systems

This paper investigates joint computing and relaying for multiuser task offloading in a wireless-powered mobile edge computing (MEC) system comprising an energy node (EN), an edge server (ES), and multiple energy-harvesting users. One user is selected as the helper for the remaining task users. Each task user partition...

Yuan Zheng, Feng-Xian Tang, Dongqing Li et al. · 0 citations
#edge computing Sep 2026

Reconfigurable terahertz spatial differentiation via incident angle tuned beam shifts on a Bi2Te3 platform

Optical spatial differentiation offers an ultrafast, low-power route to edge detection by directly processing the optical field and can address the inherent diffraction-limited blurring of terahertz (THz) imaging. However, existing THz edge detection schemes face persistent bottlenecks. Metasurfaces and diffractive dev...

Lv Liu, Jun Li, Jian Shi et al. · 0 citations
#edge computing Open access Sep 2026

Quantum phenomenology from a classical integer automaton: an emergent Schrödinger sector, exact exchange statistics, CHSH violation without randomness, foliation-independent Bell statistics, a selection-rule theorem for ensemble entanglement, a stimulated parametric pair channel with a capacity wall, a surviving isotropy no-go, two engine-measured forced rationals, and obstruction theorems for dynamic geometry

What this is. A single bit-exactly reversible, integer-valued lattice automaton in which a broad range of quantum phenomenology arises as measurable, checksum-reproducible behaviour. Evolution is a permutation of integer microstates, not approximate numerical integration — which is why the gates below can be bit-exact...

Daniel Marko · 0 citations

From tech blogs

See all →
MIT News · Artificial Intelligence Oct 15, 2026

AI model decodes the language cells use to communicate

A new computational approach reveals how cells communicate to assemble into tissues. This could accelerate stem cell engineering, improve disease models, and inform therapies.

Microsoft Research Blog Oct 15, 2026

Proof-based general-purpose computing with Magnetar

Zero-knowledge proofs can verify computing results without rerunning workloads or exposing sensitive data. Magnetar helps bring them into the mainstream with support for standard programming languages, major speed gains, and quantum-resistant security. The post Proof-based general-purpose computing with Magnetar appeared first on Microsoft Research.

Microsoft Research Blog Oct 6, 2026

What AI gets wrong and what failure teaches us

Jennifer Neville did not want to go into computer science—but that’s exactly where she landed. Neville discusses the starts and stops that led to her professional sweet spot and her work identifying “surprising failures” making it hard for AI to handle complexity.  The post What AI gets wrong and what failure teaches us appeared first on Microsoft Research.

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.