Tootfinder

Live-Webinar: Apple‑Gerätemanagement im Unternehmen kompakt erklärt
Apple-Geräte professionell verwalten – von MDM-Grundlagen über Bereitstellungsmodelle wie Declarative Device Management bis zu aktuellen Funktionen und Trends.

It is day 12 of waiting for an #iOS App Store review of an update (the app is already live; they approved our previous version). Not a single bit of feedback in those 12 days.
Did they replace their review staff with poorly-functioning LLMs like the rest of Big Tech?
Seriously, though, is this abnormally-long delay happening to everyone right now?

“Honoring Mobile OS Text Size”
https://adrianroselli.com/2026/02/honoring-mobile-os-text-size.html
Looks at the new HTML thing proposed from CSSWG (yeah, not confusing) and tries to merge Safari’s propriety hack with Google’s CSSWG proposal and Canary impl…

Honoring Mobile OS Text Size
If your users scale the text size in Android or iDeviceOS, that doesn’t always affect the size of text on a web page. It’s a function of browser and authored code, as opposed to a standardized approach. That may be changing. Support The current state of affairs in the three…

Lets be honest, we spend too much time cleaning data. {janitor} can help with that: #rstats #datasciece

Bezos, dem Faschismus ergebener Oligarch in Trumps Wohlwollen, macht die #WashingtonPost zum rechten Propagandamedium.
Sind von den entlassenen Journalist*innen auch welche im Fediverse?
Ist ja vielleicht auch ein Qualitätsmerkmal, wenn man für Trumps Propagandamaschine als ungeeignet erkannt wurde.

»Wie Telegram-Propaganda die Menschen lenken soll
Novaya Gazeta Europe hat Millionen Beiträge russischer Pro-Kreml-Kanäle ausgewertet. Sie zeigt, wie Stimmung unter anderem gegen Migranten gemacht wird«
Wer nutzt noch Telegram? Leider noch zu viele! Abgesehen von deren Datenschutz Vernachlässigung ist es ein Verunsicherungs-Maschine um die Bevölkerung sich gegenseitig aufzuhetzen.
🤨

Unser Fenster nach Russland: Wie Telegram-Propaganda die Menschen lenken soll
Novaya Gazeta Europe hat Millionen Beiträge russischer Pro-Kreml-Kanäle ausgewertet. Sie zeigt, wie Stimmung unter anderem gegen Migranten gemacht wird.

Boltzmann sampling and optimal exact-size sampling for directed acyclic graphs
Wojciech Gabryelski, Zbigniew Go{\l}\c{e}biewski, Martin P\'epin
https://arxiv.org/abs/2602.08471 https://arxiv.org/pdf/2602.08471 https://arxiv.org/html/2602.08471
arXiv:2602.08471v1 Announce Type: new
Abstract: We propose two efficient algorithms for generating uniform random directed acyclic graphs, including an asymptotically optimal exact-size sampler that performs $\frac{n^2}{2} o(n^2)$ operations and requests to a random generator. This was achieved by extending the Boltzmann model for graphical generating functions and by using various decompositions of directed acyclic graphs. The presented samplers improve upon the state-of-the-art algorithms in terms of theoretical complexity and offer a significant speed-up in practice.
toXiv_bot_toot

Submodular Maximization over a Matroid $k$-Intersection: Multiplicative Improvement over Greedy
Moran Feldman, Justin Ward
https://arxiv.org/abs/2602.08473 https://arxiv.org/pdf/2602.08473 https://arxiv.org/html/2602.08473
arXiv:2602.08473v1 Announce Type: new
Abstract: We study the problem of maximizing a non-negative monotone submodular objective $f$ subject to the intersection of $k$ arbitrary matroid constraints. The natural greedy algorithm guarantees $(k 1)$-approximation for this problem, and the state-of-the-art algorithm only improves this approximation ratio to $k$. We give a $\frac{2k\ln2}{1 \ln2} O(\sqrt{k})<0.819k O(\sqrt{k})$ approximation for this problem. Our result is the first multiplicative improvement over the approximation ratio of the greedy algorithm for general $k$. We further show that our algorithm can be used to obtain roughly the same approximation ratio also for the more general problem in which the objective is not guaranteed to be monotone (the sublinear term in the approximation ratio becomes $O(k^{2/3})$ rather than $O(\sqrt{k})$ in this case).
All of our results hold also when the $k$-matroid intersection constraint is replaced with a more general matroid $k$-parity constraint. Furthermore, unlike the case in many of the previous works, our algorithms run in time that is independent of $k$ and polynomial in the size of the ground set. Our algorithms are based on a hybrid greedy local search approach recently introduced by Singer and Thiery (STOC 2025) for the weighted matroid $k$-intersection problem, which is a special case of the problem we consider. Leveraging their approach in the submodular setting requires several non-trivial insights and algorithmic modifications since the marginals of a submodular function $f$, which correspond to the weights in the weighted case, are not independent of the algorithm's internal randomness. In the special weighted case studied by Singer and Thiery, our algorithms reduce to a variant of their algorithm with an improved approximation ratio of $k\ln2 1-\ln2<0.694k 0.307$, compared to an approximation ratio of $\frac{k 1}{2\ln2}\approx0.722k 0.722$ guaranteed by Singer and Thiery.
toXiv_bot_toot