Tootfinder

GARD: Gamma-based Anatomical Restoration and Denoising for Retinal OCT
Botond Fazekas, Thomas Pinetz, Guilherme Aresta, Taha Emre, Hrvoje Bogunovic
https://arxiv.org/abs/2509.10341

GARD: Gamma-based Anatomical Restoration and Denoising for Retinal OCT
Optical Coherence Tomography (OCT) is a vital imaging modality for diagnosing and monitoring retinal diseases. However, OCT images are inherently degraded by speckle noise, which obscures fine details and hinders accurate interpretation. While numerous denoising methods exist, many struggle to balance noise reduction with the preservation of crucial anatomical structures. This paper introduces GARD (Gamma-based Anatomical Restoration and Denoising), a novel deep learning approach for OCT image …

Spent a few hours cleaning out the fridge on my M1 Mac Mini today. It’s now in an ok state and can resume its local server role. But man, there’s zero joy in using macOS anymore. Just paper cut after paper cut. Or should I say joy in using OS X? I guess that’s when it actually was nice to use. Even with the limitations, iOS feels less claustrophobic – perhaps because it never had the freedom to begin with, so you don’t run into all the restrictions in the same way. I got the Mac because it w…

Half the paper is dried and being pressed flat and the rest needs another day to dry. I was hoping to get another batch done but work keeps getting in the way. 🙄
#diy #maker #paper

"Smart glasses offering a combination of sensory substitution based 'raw' vision and AI-based scene description and OCR appears to be technically and economically the most feasible and sustainable way toward meeting expectations, needs and interests of many blind people." https://www.artificialvision…

Bounded Memory in Distributed Networks
Ran Ben Basat, Keren Censor-Hillel, Yi-Jun Chang, Wenchen Han, Dean Leitersdorf, Gregory Schwartzman
https://arxiv.org/abs/2506.11644

Bounded Memory in Distributed Networks
The recent advent of programmable switches makes distributed algorithms readily deployable in real-world datacenter networks. However, there are still gaps between theory and practice that prevent the smooth adaptation of CONGEST algorithms to these environments. In this paper, we focus on the memory restrictions that arise in real-world deployments. We introduce the $μ$-CONGEST model where on top of the bandwidth restriction, the memory of nodes is also limited to $μ$ words, in line with rea…

PermRust: A Token-based Permission System for Rust
Lukas Gehring, Sebastian Rehms, Florian Tschorsch
https://arxiv.org/abs/2506.11701 https://

PermRust: A Token-based Permission System for Rust
Permission systems which restrict access to system resources are a well-established technology in operating systems, especially for smartphones. However, as such systems are implemented in the operating system they can at most manage access on the process-level. Since moderns software often (re)uses code from third-parties libraries, a permission system for libraries can be desirable to enhance security. In this short-paper, we adapt concepts from capability systems building a novel theoretical…

Knapsack and Shortest Path Problems Generalizations From A Quantum-Inspired Tensor Network Perspective
Sergio Mu\~niz Subi\~nas, Jorge Mart\'inez Mart\'in, Alejandro Mata Ali, Javier Sedano, \'Angel Miguel Garc\'ia-Vico
https://arxiv.org/abs/2506.11711

Knapsack and Shortest Path Problems Generalizations From A Quantum-Inspired Tensor Network Perspective
In this paper, we present two tensor network quantum-inspired algorithms to solve the knapsack and the shortest path problems, and enables to solve some of its variations. These methods provide an exact equation which returns the optimal solution of the problems. As in other tensor network algorithms for combinatorial optimization problems, the method is based on imaginary time evolution and the implementation of restrictions in the tensor network. In addition, we introduce the use of symmetrie…

RefModel: Detecting Refactorings using Foundation Models
Pedro Sim\~oes, Rohit Gheyi, Rian Melo, Jonhnanthan Oliveira, M\'arcio Ribeiro, Wesley K. G. Assun\c{c}\~ao
https://arxiv.org/abs/2507.11346

RefModel: Detecting Refactorings using Foundation Models
Refactoring is a common software engineering practice that improves code quality without altering program behavior. Although tools like ReExtractor+, RefactoringMiner, and RefDiff have been developed to detect refactorings automatically, they rely on complex rule definitions and static analysis, making them difficult to extend and generalize to other programming languages. In this paper, we investigate the viability of using foundation models for refactoring detection, implemented in a tool nam…

Surfaces with Klein bottle topology occur in fusion reactor fields
Christopher Berg Smiet
https://arxiv.org/abs/2506.11883 https://ar…

Surfaces with Klein bottle topology occur in fusion reactor fields
Magnetic confinement fusion devices, such as tokamaks and stellarators, are designed such that magnetic field lines lie in magnetic surfaces that form a foliation of nested genus-1 tori. The Poincaré-Hopf index theorem implies that only surfaces with genus 1 allow for vector fields that lie tangent to the surface and are are smooth and nowhere-vanishing. It is often implicitly assumed that magnetic surfaces are always toroidal. This paper we show that surfaces with the topology of an immersed …

Perfect Matchings in Random Sparsifications of Dense Hypergraphs
Jie Han, Jingwen Zhao
https://arxiv.org/abs/2507.11359 https://arxiv…

Perfect Matchings in Random Sparsifications of Dense Hypergraphs
The decision problem of perfect matchings in uniform hypergraphs is famously an NP-complete problem. It has been shown by Keevash--Knox--Mycroft [STOC, 2013] that for every $\varepsilon>0$, such decision problem restricted to $k$-uniform hypergraphs $H$ satisfying that every $(k-1)$-set of vertices is in at least $(1/k+\varepsilon)|H|$ edges is tractable, and the quantity $1/k$ is best possible. In this paper we study the existence of perfect matchings in the random $p$-sparsification…