Tootfinder

🇺🇦 Auf radioeins läuft...
Madison McFerrin:
🎵 Ain't It Nice
#NowPlaying #MadisonMcFerrin
https://madisonmcferrin.bandcamp.com/track/aint-it-nice
https://open.spotify.com/track/16cf5KXlcTvSpO1TisvQWI

From Data to Diagnosis: A Large, Comprehensive Bone Marrow Dataset and AI Methods for Childhood Leukemia Prediction
Henning H\"ofener (Fraunhofer Institute for Digital Medicine MEVIS, Bremen, Germany), Farina Kock (Fraunhofer Institute for Digital Medicine MEVIS, Bremen, Germany), Martina Pontones (Department of Pediatrics and Adolescent Medicine, University Hospital Erlangen, Erlangen, Germany), Tabita Ghete (Department of Pediatrics and Adolescent Medicine, University Hospital E…

From Data to Diagnosis: A Large, Comprehensive Bone Marrow Dataset and AI Methods for Childhood Leukemia Prediction
Leukemia diagnosis primarily relies on manual microscopic analysis of bone marrow morphology supported by additional laboratory parameters, making it complex and time consuming. While artificial intelligence (AI) solutions have been proposed, most utilize private datasets and only cover parts of the diagnostic pipeline. Therefore, we present a large, high-quality, publicly available leukemia bone marrow dataset spanning the entire diagnostic process, from cell detection to diagnosis. Using this…

Ist medizinische Leistungskürzung bei #Senioren Altersdiskriminierung?
https://www.mdr.de/nachrichten/podcast/beste/audio-senioren-op-leistung-me…

Ist medizinische Leistungskürzung bei Senioren Altersdiskriminierung? | MDR.DE
Der Vorschlag aus dem Klinikkonzern Sana, Menschen über 80 bestimmte Leistungen nur noch eingeschränkt oder gegen Eigenbeteiligung zu ermöglichen, stößt auf Kritik. Das Alter allein dürfe nicht entscheidend sein.

DistillMatch: Leveraging Knowledge Distillation from Vision Foundation Model for Multimodal Image Matching
Meng Yang, Fan Fan, Zizhuo Li, Songchu Deng, Yong Ma, Jiayi Ma
https://arxiv.org/abs/2509.16017

DistillMatch: Leveraging Knowledge Distillation from Vision Foundation Model for Multimodal Image Matching
Multimodal image matching seeks pixel-level correspondences between images of different modalities, crucial for cross-modal perception, fusion and analysis. However, the significant appearance differences between modalities make this task challenging. Due to the scarcity of high-quality annotated datasets, existing deep learning methods that extract modality-common features for matching perform poorly and lack adaptability to diverse scenarios. Vision Foundation Model (VFM), trained on large-sc…

Integral bases, perfect matchings, and the Petersen graph
Ahmad Abdi, Olha Silina
https://arxiv.org/abs/2508.15602 https://arxiv.org/pdf/2508.15602

Integral bases, perfect matchings, and the Petersen graph
Let $G=(V,E)$ be a matching-covered graph, denote by $P$ its perfect matching polytope, and by $L$ the integer lattice generated by the integral points in $P$. In this paper, we give polyhedral proofs for two difficult results established by Lovász (1987), and by Carvalho, Lucchesi, and Murty (2002) in a series of three papers. More specifically, we reprove that $L$ has a lattice basis consisting solely of incidence vectors of some perfect matchings of $G$, $2x\in L$ for all $x\in \mathrm{lin}…

Ist die USA noch eine Demokratie?
Nicht mehr, im Moment, meint Thomas Zimmerer. Seine Argumente kann man hier hören:
https://www.srf.ch/audio/echo-der-zeit/wie-steht-es-um-die-demokratie-in-den-usa?partId=_m0M6ThcQNjCLK…

Wie steht es um die Demokratie in den USA?

visionOS 26 final, Vision-Pro-Projekte, Ray-Ban Display | TNBT-Podcast
Themen in dieser Episode: visionOS 26 für alle, neue Funktionen für Enterprise-VR-Projekte und Metas Ray-Ban Display-Brille mitsamt Armband.

Entropy Bounds for Perfect Matchings in Bipartite Hypergraphs
Tantan Dai, Alexander Divoux, Tom Kelly
https://arxiv.org/abs/2506.17652 https://

Entropy Bounds for Perfect Matchings in Bipartite Hypergraphs
A hypergraph is \textit{bipartite with bipartition} $(A, B)$ if every edge has exactly one vertex in $A$, and a matching in such a hypergraph is \textit{$A$-perfect} if it saturates every vertex in $A$. We prove an upper bound on the number of $A$-perfect matchings in uniform hypergraphs with small maximum codegree. Using this result, we prove that there exist order-$n$ Latin squares with at most $(n/e^{2.117})^n$ transversals when $n$ is odd and $n \equiv 0\pmod 3$. We also show that $k$-unifo…

Global Regulation and Excitation via Attention Tuning for Stereo Matching
Jiahao Li, Xinhong Chen, Zhengmin Jiang, Qian Zhou, Yung-Hui Li, Jianping Wang
https://arxiv.org/abs/2509.15891

Global Regulation and Excitation via Attention Tuning for Stereo Matching
Stereo matching achieves significant progress with iterative algorithms like RAFT-Stereo and IGEV-Stereo. However, these methods struggle in ill-posed regions with occlusions, textureless, or repetitive patterns, due to a lack of global context and geometric information for effective iterative refinement. To enable the existing iterative approaches to incorporate global context, we propose the Global Regulation and Excitation via Attention Tuning (GREAT) framework which encompasses three attent…

Extending edge colorings of distance-2 matchings in the hypercube
P\'al B\"arnkopf
https://arxiv.org/abs/2509.15764 https://arxiv.org/pdf/2509.157…

Extending edge colorings of distance-2 matchings in the hypercube
Casselgren, Markstörm, and Pham conjectured that any precolored distance-2 matching in the $d$-dimensional cube $Q_d$ can be extended to a proper $d$-edge coloring. In this paper, we prove this conjecture and some related theorems. Especially, our result establishes that if $G$ is a bipartite graph, then a precolored distance-2 matching in the Cartesian product $G \square K_{2m}$ can be extended to an edge coloring using at most $Δ(G)+1$ colors. As another generalization, we establish the sam…