🇺🇦 #NowPlaying on KEXP's #Continent
Godfrey Odili:
🎵 Let’s Do More Music
#GodfreyOdili
https://soundwayrecords.bandcamp.com/track/lets-do-more-music
https://open.spotify.com/track/3ktXGNqCckPDZUrqmnOY6S
🇺🇦 Auf radioeins läuft...
Milliarden:
🎵 Schall & Rauch
#NowPlaying #Milliarden
https://open.spotify.com/track/4qpnA8vGSq9DbRlPOGYeb4
from my link log —
GitOpper: GitOps without Kubernetes.
https://github.com/miekg/gitopper
saved 2022-11-19 https://dotat.at/:/B85HT.html
When I click "reject all non-essential cookies", that does not mean "ask me again next time." The cookie that tells you to piss off and not track me *is* essential, and if you're deliberately not saving that part to try and trick me into clicking "accept" next time, you're at minimum an asshole, and at worst violating the GDPR.
#Rant
I see that the European Commission is adopting that well-tested method for "simplification", called "let's rewrite all basic definitions in the law from scratch and throw 10 years of court rulings out of the window, so we can start anew!".
https://…
Perfect Network Resilience in Polynomial Time
Matthias Bentert, Stefan Schmid
https://arxiv.org/abs/2602.03827 https://arxiv.org/pdf/2602.03827 https://arxiv.org/html/2602.03827
arXiv:2602.03827v1 Announce Type: new
Abstract: Modern communication networks support local fast rerouting mechanisms to quickly react to link failures: nodes store a set of conditional rerouting rules which define how to forward an incoming packet in case of incident link failures. The rerouting decisions at any node $v$ must rely solely on local information available at $v$: the link from which a packet arrived at $v$, the target of the packet, and the incident link failures at $v$. Ideally, such rerouting mechanisms provide perfect resilience: any packet is routed from its source to its target as long as the two are connected in the underlying graph after the link failures. Already in their seminal paper at ACM PODC '12, Feigenbaum, Godfrey, Panda, Schapira, Shenker, and Singla showed that perfect resilience cannot always be achieved. While the design of local rerouting algorithms has received much attention since then, we still lack a detailed understanding of when perfect resilience is achievable.
This paper closes this gap and presents a complete characterization of when perfect resilience can be achieved. This characterization also allows us to design an $O(n)$-time algorithm to decide whether a given instance is perfectly resilient and an $O(nm)$-time algorithm to compute perfectly resilient rerouting rules whenever it is. Our algorithm is also attractive for the simple structure of the rerouting rules it uses, known as skipping in the literature: alternative links are chosen according to an ordered priority list (per in-port), where failed links are simply skipped. Intriguingly, our result also implies that in the context of perfect resilience, skipping rerouting rules are as powerful as more general rerouting rules. This partially answers a long-standing open question by Chiesa, Nikolaevskiy, Mitrovic, Gurtov, Madry, Schapira, and Shenker [IEEE/ACM Transactions on Networking, 2017] in the affirmative.
toXiv_bot_toot
"Nederland heeft 190.000 kilo goud liggen in de kluis van de Amerikaanse centrale bank in New York. En daar blijft het voorlopig. "We twijfelen niet aan de bestaande afspraken met de VS", zegt de DNB-woordvoerder. "
Hoe erg is je cognitieve dissonantie dan ?
Dat Trump en consorten ooit zullen toestaan dat we het terughalen?
🇺🇦 #NowPlaying on #BBC6Music's #LaurenLaverne
Amyl and the Sniffers:
🎵 Hertz
#AmylandtheSniffers
https://amylandthesniffers.bandcamp.com/track/hertz
https://open.spotify.com/track/1GTPRD8z9c7kVDqwGbn52f
🇺🇦 Auf radioeins läuft...
Godford:
🎵 The Beast
#NowPlaying #Godford
https://godford.bandcamp.com/track/the-beast
https://open.spotify.com/track/0UiKfFGwVPf4ViApUorBkx