Tootfinder

Extremely hot day in the Netherlands again, especially in the South. In over a century of records until 2019, no station in the country had ever reached a temperature of 39°C.
Today was the third time the city of Maastricht saw it happen, and this was by far the earliest in summer for any station.
#heatwave

Anzahl der #Balkonkraftwerke in #Deutschland mit Stand vom 03.07.2025.
Der aktuelle Höchststand liegt bei 1014651 registrierten Anlagen.
Unplausible Inbetriebnahmedaten von 1900 bis 2015 wurden durch das Registrierungsdatum der

Time For 9 o'clock #HashTagGames hosted by @…
Let's play!
#MovieCharactersGraduationAdvice

John Willis interviewed me for his Profound podcast series...
This post provides links to more information on what we discussed in the podcast.
...
Bill Hunter (my father): Quality In The Community One City’s Experience (Madison) – Quality Comes to City Hall (Madison) – Managing Our Way to Economic Success
...
Design of Experiments
...
PDSA improvement cycle: Keys to the Effective Use of the PDSA Improvement Cycle...

Revisiting Bourgain's probabilistic construction of solutions to the 2-$d$ cubic NLS
Tadahiro Oh, Yuzhao Wang
https://arxiv.org/abs/2505.24271 https://…

Revisiting Bourgain's probabilistic construction of solutions to the 2-$d$ cubic NLS
In a seminal paper (1996), Bourgain proved invariance of the Gibbs measure for the defocusing cubic nonlinear Schrödinger equation on the two-dimensional torus by constructing local-in-time solutions in a probabilistic manner. In this note, we revisit and streamline his argument, using the random tensor estimate developed by Deng, Nahmod, and Yue (2022).

Lazy B-Trees
Casper Moldrup Rysgaard, Sebastian Wild
https://arxiv.org/abs/2507.00277 https://arxiv.org/pdf/2507.00277

Lazy B-Trees
Lazy search trees (Sandlund & Wild FOCS 2020, Sandlund & Zhang SODA 2022) are sorted dictionaries whose update and query performance smoothly interpolates between that of efficient priority queues and binary search trees - automatically, depending on actual use; no adjustments are necessary to the data structure to realize the cost savings. In this paper, we design lazy B-trees, a variant of lazy search trees suitable for external memory that generalizes the speedup of B-trees over binary searc…