Tootfinder

heise | Bit-Rauschen: Die CPU-Matrix-Rechenwerke kommen
Prozessoren werden noch komplexer: Außer separaten NPUs bekommen auch ihre CPU- und GPU-Kerne Matrix-Einheiten. Ein Linux-Projekt mit Snapdragon X scheitert.
ht…

Verge Motorcycles bringt erstes E-Motorrad mit Feststoffakku auf den Markt
Der finnische Hersteller Verge Motorcycles stattet seine Elektromotorräder mit Feststoffakkus aus. Die ersten Exemplare sollen in Kürze ausgeliefert werden.

Infection Control Matters
In this podcast series, we discuss new research and issues on the topic of infection prevention and control...
Great Australian Pods Podcast Directory: https://www.greataustralianpods.com/infection-control-matters/

The possible sale of 1,000 metric tons of Nigerien uranium to Russia is alarming France
https://www.lemonde.fr/en/international/article/2025/11/07/the-possible-sale-of-1-000-metric-tons-of-nigerien-uranium-to-russia-is-alarming-france_6747206_4.html

🇺🇦 #NowPlaying on KEXP's #VarietyMix
midori jaeger:
🎵 dark green
#midorijaeger
https://midorijaeger.bandcamp.com/track/dark-green
https://open.spotify.com/track/7Gmy47n0X3rfUI6mzzutzp

The Cowboys Found Out Fast: Tyler Guyton Matters https://insidethestar.com/the-cowboys-found-out-fast-tyler-guyton-matters

New Insights into Involutory and Orthogonal MDS Matrices
Yogesh Kumar, Susanta Samanta, Atul Gaur
https://arxiv.org/abs/2510.05766 https://arxiv.org/pdf/25…

New Insights into Involutory and Orthogonal MDS Matrices
MDS matrices play a critical role in the design of diffusion layers for block ciphers and hash functions due to their optimal branch number. Involutory and orthogonal MDS matrices offer additional benefits by allowing identical or nearly identical circuitry for both encryption and decryption, leading to equivalent implementation costs for both processes. These properties have been further generalized through the notions of semi-involutory and semi-orthogonal matrices. Specifically, we establish…

Factorization of power GCD matrices and power LCM matrices on certain gcd-closed sets
Guangyan Zhu, Yuanyuan Luo, Jixiang Wan
https://arxiv.org/abs/2510.05595 https://

Factorization of power GCD matrices and power LCM matrices on certain gcd-closed sets
For integers $x$ and $y$, $(x, y)$ and $[x, y]$ stand for the greatest common divisor and the least common multiple of $x$ and $y$ respectively. Denote by $|T|$ the number of elements of a finite set $T$. Let $a,b$ and $n$ be positive integers and let $S=\{x_1, \cdots, x_n\}$ be a set of $n$ distinct positive integers. We denote by $(S^a)$ (resp. $[S^a]$) the $n\times n$ matrix having the $a$th power of $(x_i,x_j)$ (resp. $[x_i,x_j]$) as its $(i,j)$-entry. For any $x\in S$, define $G_…

Fair metric distortion for matching with preferences
Jabari Hastings, Prasanna Ramakrishnan
https://arxiv.org/abs/2510.05460 https://arxiv.org/pdf/2510.054…

Fair metric distortion for matching with preferences
We consider the matching problem in the metric distortion framework. There are $n$ agents and $n$ items occupying points in a shared metric space, and the goal is to design a matching mechanism that outputs a low-cost matching between the agents and items, using only agents' ordinal rankings of the candidates by distance. A mechanism has distortion $α$ if it always outputs a matching whose cost is within a factor of $α$ of the optimum, in every instance regardless of the metric space. Typic…