Tootfinder

"Wir brauchen den Meister, nicht den Lehrling. Einen, der keine Anlaufzeit braucht.“ - https://www.staatsanzeiger.de/nachrichten/politik-und-verwaltung/ein-gut-gelaunter-winfried-kretschmann-uebergibt…

Ein gut gelaunter Winfried Kretschmann übergibt den Stab an Cem Özdemir | Staatsanzeiger BW
Die Grünen wollen in Ludwigsburg ihr Wahlprogramm für die Landtagswahl verabschieden. Ein energiegeladener Winfried Kretschmann haucht der Partei neuen Mut ein, und inszeniert die Staffelübergabe an Cem Özdemir.

Whenever a company releases a fancy new "desktop app" and it's just electron shit, they should pay me 100 bucks.

Whimpering here. I am going through a large envelope of negatives with a few prints. From what I see they go back to the early 60s. Almost no information about when, where or who. For some of them I can make an educated guess based on clothing styles and cars.
A few rants (and a lot of whimpering)
- NEVER CUT NEGATIVES INTO INDIVIDUAL IMAGES
- don't dump multiple rolls of negatives into one sleeve.
- when there is writing they used pen and that fades over the d…

whenever i try to look at groningen, apple maps crashes 🤔

I have a sweater that I love, even though it's shorter than ideal. Whenever I wear it, I feel like Jean-Luc Picard.

Linus Torvalds:
> This is the special easter release of linux, more mundanely called 1.3.84
Winfried Truemper:
> Umh, oh. What do you mean by "special easter release"?. Will it quit
> working today and rise on easter?

Whenever I see the name 'RegioJet' I think it's some new local airline rather than passenger train operator.

On Legendre Cordial Labeling of Some Graphs Under Graph Opearations
Jason Andoyo
https://arxiv.org/abs/2509.11012 https://arxiv.org/pdf/2509.11012

On Legendre Cordial Labeling of Some Graphs Under Graph Opearations
For a simple connected graph $G$ of order $n$, a bijective function $f:V(G)\to\{1,2,\cdots,n\}$ is said to be a Legendre cordial labeling modulo $p$, where $p$ is an odd prime, if the induced function $f_p^*:E(G)\to \{0,1\}$, defined by $f_p^*(uv)=0$ whenever $([f(u)+f(v)]/p)=-1$ or $f(u)+f(v)\equiv 0(\text{mod }p)$, and $f_p^*(uv)=1$ whenever $([f(u)+f(v)]/p)=1$, satisfies the condition $|e_{f_p^*}(0)-e_{f_p^*}(1)|\leq 1$ where $e_{f_p^*}(i)$ is the number of edges with label $i$ ($i…

@… @… Because you’re comparing a base to a max processor?
M5 MAx will (Whenever it shows up…) surely be able to support at least the same amount of memory as your M1 Max?

#FotoDerWoche nochmal aus Esslingen. Ein bisschen kitschig. Dafür ärgere ich mich im Text über die wenig fußgängerfreundliche Verkehrsplanung dort. Schon wieder.
https://blog.till-west…

Photo of the week: Neckar kitsch, Esslingen
Ich gebe zu: nicht ganz ungefiltert. Trotzdem: der Blick von der Pliensau-Brücke auf Neckar, Bahnhof und Weinberg hat was, gerade im Herbst (das Bild entstand Ende Oktober). Und um an mein letztes Foto mit Gejammer über die Verkehrsführung am Bahnhof anzuschließen - die Brücke führt eigentlich zum H