Tootfinder

Le Dalai-Lama et son manque de discernement : En 1998, il était au courant des procédures juridiques contre la OKC. Découvrez plus d'informations ici :
https://okcinfo.chardonsbleus.org/2021/individus/…

fab interview with @… guitarist dm hotep about building the wildly cool/expansive ghost horizons project around marshall allen & collaborators. https://pos…

Resonances: A Conversation with DM Hotep on Marshall Allen’s Ghost Horizons - PostGenre
In a 2021 interview, Henry Threadgill noted his belief that “[Marshall Allen] should have the highest award that can be bestowed on any artist for performing one-nighters at age 97. They should make up an award for such a person… he’s going unrecognized. It is a travesty. Can you imagine doing one-nighters at 97 years

Zohran Mamdani received 545,334 votes in RCV tally. That's 135% of Eric Adams' 2021 primary vote.
Mamdani's proven primary voters would make a 48% share of those who turned out in the 2021 general election.
https://enr.boenyc.gov/rcv/026916_1.html

Mildly interesting: Der #Gasspeicher #Rehden ist wieder leer. Zuletzt passierte das 2021/2022 unter Gazprom und quasi-Russischer Kontrolle. Aktuell gäbe es Angebot, Preise sind etwa auf Vorjahresniveau. Wäre interessant zu wissen, warum der aktuelle Betreiber den Sommer nicht fürs Nachf…

Counting distinct (non-)crossing substrings
Haruki Umezaki, Hiroki Shibata, Dominik K\"oppl, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai
https://arxiv.org/abs/2506.22728

Counting distinct (non-)crossing substrings
Let $w$ be a string of length $n$. The problem of counting factors crossing a position - Problem 64 from the textbook ``125 Problems in Text Algorithms'' [Crochemore, Leqroc, and Rytter, 2021], asks to count the number $\mathcal{C}(w,k)$ (resp. $\mathcal{N}(w,k)$) of distinct substrings in $w$ that have occurrences containing (resp. not containing) a position $k$ in $w$. The solutions provided in their textbook compute $\mathcal{C}(w,k)$ and $\mathcal{N}(w,k)$ in $O(n)$ time for a single positi…

Browns' Myles Garrett wants to add Steelers' Aaron Rodgers to his Halloween graveyard https://www.nytimes.com/athletic/6416668/2025/06/10/myles-garrett-aaron-rodgers-browns-steelers/

Byron Allen settles with McDonald's over his $10B 2021 lawsuit accusing the fast food chain of racial stereotyping in its ads budget; terms were not disclosed (Jonathan Stempel/Reuters)
https://www.reuters.com/sus…

Refuting Perfect Matchings in Spectral Expanders is Hard
Ari Biswas, Rajko Nenadov
https://arxiv.org/abs/2506.07700 https://arxiv.org…

Refuting Perfect Matchings in Spectral Expanders is Hard
This work studies the complexity of refuting the existence of a perfect matching in spectral expanders with an odd number of vertices, in the Polynomial Calculus (PC) and Sum of Squares (SoS) proof system. Austrin and Risse [SODA, 2021] showed that refuting perfect matchings in sparse $d$-regular \emph{random} graphs, in the above proof systems, with high probability requires proofs with degree $Ω(n/\log n)$. We extend their result by showing the same lower bound holds for \emph{all} $d$-regul…

This https://arxiv.org/abs/2501.13881 has been replaced.
link: https://scholar.google.com/scholar?q=a

The machine learning platform for developers of large systems
The machine learning system in the form of Retrieval Augmented Generation (RAG) has developed steadily since about 2021. RAG could be observed as a version of the knowledge transfer. In the studied case, the large computing systems are observed as the application point of RAG, which includes large language model (LLM), as a partner for the developing team. Such an approach has advantages during the development process and further in exploitation time.