The results show that classical matrix factorizations are well suited to deliver stable exact solutions to linear systems and modern probabilistic and tensor-based methods are necessary to obtain scalability in modern applications.
Fang-Yue Sun· Theoretical and Natural Scie...· 0 citations
Abstract EN This document, produced with the assistance of ChatGPT o3 and GPT-5 Thinking, is released under the Apache 2.0 license. It is a voluntary defensive publication (prior art) and therefore enters the prior art upon release under the applicable patent statutes: EPC Art. 54(2) (European Patent Convention), Frenc...
Xavier Pillet· Zenodo (CERN European Organi...· 0 citations
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
Reach audiences
Advertise in front of researchers, engineers, and readers.
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
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
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…
MIT News · Artificial Intelligence· news.mit.eduOct 15, 2026
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· microsoft.comOct 15, 2026
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.
MIT News · Artificial Intelligence· news.mit.eduOct 8, 2026