Tootfinder

#CostaRica : TSE hace llamado a ser miembro suplente en mesas de votación
https://www.diarioextra.com/noticia/tse-ha

Bitkom-Befragte sind überzeugt: KI kann den eigenen Chef ersetzen
KI-Weiterbildungen in Unternehmen spielen einer Bitkom-Umfrage zufolge bei vielen Beschäftigten noch keine große Rolle. Der Bitkom fordert Schulungen.

1936
Trump maakt zichzelf voorzitter van werkgroep Olympische Spelen in Los Angeles | Het Parool
https://www.parool.nl/wereld/trump-maakt-zichzelf-voorzitter-van-werkgroep-olympische-spelen-in-los-angeles~bb22be08/…

#Waldameisen spielen eine wichtige Rolle im #Ökosystem des #Nadelwald​es. 🐜 Sie bauen ihre Hügel aus abgefallenen Nadeln und nutzen ein weitverzweigtes Gangsystem unterirdisch. Arbeiterinne…

Waldameisen und ihre Rolle im Ökosystem des Nadelwaldes
Lerne, wie Waldameisen ihre Hügel bauen, sich ernähren und welche Rolle sie im Nadelwald spielen.Ich will hier einen Blick auf die Ameisen werfen und was die so alles im Wald treiben.

$h$-Trigonometric B-splines
Fatma Z\"urnac{\i}-Yeti\c{s}, Ron Goldman, Plamen Simeonov
https://arxiv.org/abs/2508.04582 https://arxiv.org/pdf/2508.045…

$h$-Trigonometric B-splines
We introduce discrete analogues of the exponential, sine, and cosine functions. Then using a discrete trigonometric version of a non-polynomial divided difference, we define discrete analogues of the trigonometric B-splines. We derive a two-term recurrence relation, a two-term formula for the discrete derivative, and two variants of the Marsden identity for these discrete trigonometric B-splines. Since the classical exponential, sine, and cosine functions are limiting cases of their discrete an…

Raiders OTAs: One Player Who Will Surprise Many This Season https://www.si.com/nfl/raiders/las-vegas-divine-deablo-robert-spillane-devin-white-elandon-roberts

Pipelines supplying Russian military explode in Far East near Vladivostok, intelligence source says
https://kyivindependent.com/pipelines-supplying-russian-military-explode-in-far-east-near-vladivostok-06-2025/

Counting Distinct Square Substrings in Sublinear Time
Panagiotis Charalampopoulos, Manal Mohamed, Jakub Radoszewski, Wojciech Rytter, Tomasz Wale\'n, Wiktor Zuba
https://arxiv.org/abs/2508.03930

Counting Distinct Square Substrings in Sublinear Time
We show that the number of distinct squares in a packed string of length $n$ over an alphabet of size $σ$ can be computed in $O(n/\log_σn)$ time in the word-RAM model. This paper is the first to introduce a sublinear-time algorithm for counting squares in the packed setting. The packed representation of a string of length $n$ over an alphabet of size $σ$ is given as a sequence of $O(n/\log_σn)$ machine words in the word-RAM model (a machine word consists of $ω\ge \log_2 n$ bits). Previousl…

#Wordle 1,448 4/6*
⬜⬜🟩⬜🟨 <1% of 206,400 (26)
⬜⬜🟩🟨🟨 11% of 193 (5)
🟨🟨🟩⬜🟩 34% of 145 (1)
🟩🟩🟩🟩🟩
WordleBot
Skill 86/99
Luck 57/99
Spelling of the answer looked wrong, but felt like it was the answer so I let wordle decide on the spelling.
I was pretty certain my 2nd guess wasn't the answer, but I liked the letters used, so I went with it anyway.