Tootfinder

🇺🇦 Auf radioeins läuft...
Sofia Portanet:
🎵 I Trust
#NowPlaying #SofiaPortanet
https://sofiaportanet.bandcamp.com/track/i-trust
https://open.spotify.com/track/2lZCNtNMwJHwzH0isGB2TT

Ich rüste meinen Schnittplatz auf. Kommt unter den Schreibtisch, weil ich die Töne, die da rauskommen, ohnehin nicht hören will. Nicht, dass knackige Bässe nicht geil sein können. Aber bei Interviews und den meisten Atmos ist auf Frequenzen unter 100 Hz meist nur noch akustischer Müll zu hören, die mit ihren Oberwellen den wichtigen Sprachbereich (Grundton der Stimme) verschmutzen. Also: wenn diese Membran künftig vibriert, werde ich handeln.

#Oakland's Rockridge Improvement Club is a cozy bar on a mission to cure #musicians’ #healthcare blues ...
Operated by some local #music

RIC Bar in Rockridge is hosting private shows to cure musicians’ blues
The owner, a member of the band The Lovemakers, teamed up with Sofaburn Inc. an organization that provides health subsidies for fellow musicians.

A New Method of Constructing Hadamard Matrices, Circulant Hadamard Matrices, CZCS, GCS, CCC, and CZCSS
Piyush Priyanshu, Sudhan Majhi, Subhabrata Paul
https://arxiv.org/abs/2510.12315

A New Method of Constructing Hadamard Matrices, Circulant Hadamard Matrices, CZCS, GCS, CCC, and CZCSS
A Hadamard matrix $H$ is a square matrix of order $n$ with entries $\pm 1$, such that $HH^\top=nI_{n}$, where $I_n$ is an identity matrix of order $n$. A circulant Hadamard matrix $H$ is a Hadamard matrix that has rows of entries in cyclic order. There exist only $8$ circulant Hadamard matrices of order 4, and here, we provide a novel construction of all such $8$ circulant Hadamard matrices using a linear operator and generalized Boolean function (GBF). The constructed circulant Hadamard matric…

🇺🇦 #NowPlaying on #BBC6Music's #DreamTime
Bob Marley & The Wailers:
🎵 So Much Trouble In The World
#BobMarley #TheWailers
https://tributetobobmarleyandthewailerswiththeithrees.bandcamp.com/track/so-much-trouble-in-the-world
https://open.spotify.com/track/209SbubR5uKaVzj5SeN42w

End-to-end quantum algorithms for tensor problems
Enrico Fontana, Sivaprasad Omanakuttan, Junhyung Lyle Kim, Joseph Sullivan, Michael Perlin, Ruslan Shaydulin, Shouvanik Chakrabarti
https://arxiv.org/abs/2510.07273

End-to-end quantum algorithms for tensor problems
We present a comprehensive end-to-end quantum algorithm for tensor problems, including tensor PCA and planted kXOR, that achieves potential superquadratic quantum speedups over classical methods. We build upon prior works by Hastings~(\textit{Quantum}, 2020) and Schmidhuber~\textit{et al.}~(\textit{Phys.~Rev.~X.}, 2025), we address key limitations by introducing a native qubit-based encoding for the Kikuchi method, enabling explicit quantum circuit constructions and non-asymptotic resource esti…

Authentication Security of PRF GNSS Ranging
Jason Anderson
https://arxiv.org/abs/2510.02196 https://arxiv.org/pdf/2510.02196…

Authentication Security of PRF GNSS Ranging
This work derives the authentication security of pseudorandom function (PRF) GNSS ranging under multiple GNSS spoofing models, including the Security Code Estimation and Replay (SCER) spoofer. When GNSS ranging codes derive from a PRF utilizing a secret known only to the broadcaster, the spoofer cannot predict the ranging code before broadcast. Therefore, PRF ranging can be used to establish trust in the GNSS pseudoranges and the resulting receiver position, navigation, and timing (PNT) solutio…

On the Modular Chromatic Index of Random Hypergraphs
Gaia Carenini, Samuel Coulomb
https://arxiv.org/abs/2510.04334 https://arxiv.org/pdf/2510.04334…

On the Modular Chromatic Index of Random Hypergraphs
Let $k,r \geq 2$ be two integers. We consider the problem of partitioning the hyperedge set of an $r$-uniform hypergraph $H$ into the minimum number $χ_k'(H)$ of edge-disjoint subhypergraphs in which every vertex has either degree $0$ or degree congruent to $1$ modulo $k$. For a random hypergraph $H$ drawn from the binomial model $\mathbf{H}(n,p,r)$, with edge probability $p \in (C\log(n)/n,1)$ for a large enough constant $C>0$ independent of $n$ and satisfying $n^{r-1}p(1-p)\to\infty$ as $n\t…

🫨 Silent deep bass: Wearable audio you can feel
#audio

Silent deep bass: Wearable audio you can feel
Researchers at University of Tsukuba have developed a portable, silent subwoofer that combines electrical muscle stimulation with low-frequency vibrations. This device enables users to physically feel deep bass in virtual reality (VR) and everyday music. While minimizing noise, it provides an immersive experience and rhythm perception comparable to conventional speakers, opening new possibilities for audio experiences.

🇺🇦 Auf radioeins läuft...
Belau feat. Sophie Barker:
🎵 Essence
#NowPlaying #Belau #SophieBarker
https://belau.bandcamp.com/track/essence-ft-sophie-barker
https://open.spotify.com/track/22x296djf1thxQmxJtZidM