A graph network with a reinforcement learning framework to avoid congestion and schedule tasks with a low makespan in fog–IoT systems and demonstrates the improved ability to ensure reliable and effective fog–cloud allocation in response to dynamically changing workloads.
Vivekananda Potti, M. R. Babu· Future Internet· 0 citations
The edge of a shadow is soft. It is sometimes said that light bends around the obstacle, but in sunlight it is not diffraction that softens the edge. Taking the Sun to be not a point but a disc 0.533139 degrees across, the softness of the edge and the shape of dappled sunlight are counted. No new theorem or law is clai...
Yuuki Yamagishi· Zenodo (CERN European Organi...· 0 citations
A satellite that comes too close to its planet is torn apart by tides. That distance is called the Roche limit and is spoken of as one value. How many distances exist under the same name, by differences in what holds a satellite together, is counted. No new theorem or law is claimed. Scope of this paper (scope note): N...
Yuuki Yamagishi· Zenodo (CERN European Organi...· 0 citations
ACTINV v1.3.1 — release notes ACTINV 1.3.1 is a feature release centred on the measurement-driven product line: assays, facility twins, certified decision loops, and calibrated uncertainty. It also lands the resolved-resonance self-shielding quadrature — SIGMA1-broadened per temperature — plus the chance-constrained de...
Connor A· Zenodo (CERN European Organi...· 0 citations
Reach audiences
Advertise in front of researchers, engineers, and readers.
We study the Temporal Exploration problem, where an agent must visit all vertices of a temporal graph while traversing at most one available edge per time step. Unlike static graphs, which can be explored in linear time, temporal constraints can substantially increase exploration time even when every snapshot of the gr...
Ivan Lahtin, Viktor Zamaraev· Discrete Mathematics· 0 citations
[2026-09-23] Erratum — the logarithm at s = R. This record states that the local expansion at the dominant singularity s = R carries a logarithm arising from a resonance between the exponent −γ and the integer exponents {0, …, 2d−2}. That statement is withdrawn as an unconditional claim. The correct criterion is the on...
Papanokechi· Zenodo (CERN European Organi...· 6 citations
This record contains the preprint "Finite graph certificates for composite terms in rational floor sequences" by Yuri Odagiri, in English (paper-en.pdf) and Japanese (paper-ja.pdf). AbstractFor every real number ξ > 0, we give computer-assisted proofs that ⌊ξ(7/5)ⁿ⌋ is divisible by at least one of 2, 3, 5, 11, 13 for i...
Yuri Odagiri· Zenodo (CERN European Organi...· 0 citations
The research provides a new security situation awareness solution with real-time, privacy and scalability for the Industrial Internet of Things, which has practical application value for collaborative security protection in complex industrial environments.
Hui-Nian He· Discover Internet of Things· 0 citations
📡 Project Metadata & Search Indexing 📄 Technical Description This repository contains the complete open-hardware engineering manifesto and architectural blueprint for CERN Open Hardware Manifesto v11.5: The Unified Solid-State Holographic Interactive Tactical Surface (The Smart Table Architecture), managed under perm...
David Michael Seagal· Zenodo (CERN European Organi...· 0 citations
A dwelling is the smallest object that holds territory, boundary, access, exclusion, ownership, privacy, shelter, safety, services, activity, memory, identity, value, inheritance and permanence at the same moment. This article asks how such an object forms from many simple physical and computational elements, and what...
Gonçalo Melo de Magalhães· Zenodo (CERN European Organi...· 0 citations
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.
MIT News · Artificial Intelligence· news.mit.eduOct 2, 2026