Urbanity - Urbana Composita 🌆
城市化 - 建构城市 🌆
📷 Pentax MX
🎞️ Ilford Pan 100
#filmphotography #Photography #blackandwhite
Members of Congress are routinely escorted through airport security,
but the process does not normally result in profanity-laced airport tirades
Police investigation faults Nancy Mace for testy exchanges
https://www.washingtonpost.com/politics/20
🇺🇦 Auf radioeins läuft...
Moscoman & Tom Sanders:
🎵 In Stereo
#NowPlaying #Moscoman #TomSanders
https://moscoman.bandcamp.com/track/in-stereo-feat-tom-sanders
https://open.spotify.com/track/6VBbmDuYFGj4xAxLM79JB7
Digitalisierung klingt einfach. Ist sie aber nicht.
In unserem Podcast #9vor9 diskutieren wir mit Holger Klötzner, Stadtrat für Digitalisierung, und Dennis Schwalbach aus dem IT-Maschinenraum der Stadt Darmstadt über Formulare, Fachverfahren – und die Umlaufmappe 📁.
Was bedeutet digitale Verwaltung wirklich?
Wo hakt es noch?
Reinhören unter
Check out today's Metacurity for the most critical infosec developments you might have missed over the weekend, including
--77,000-plus IP addresses are vulnerable to maximum severity React2Shell flaw,
--NCSC warns prompt injection threats might be forever,
--Apple and Google issue new spyware warnings,
--Apache Tika critical flaw allows XXE injection attacks,
--Japanese high school student accused of using ChatGPT to attack internet cafe chain,
--US is…
"On Tuesday, the Department of Education announced that it had reached a settlement with the state of Missouri to end the Saving on a Valuable Education (SAVE) program, which allowed more than 7 million mostly low-income Americans to reduce their federal student loan payments."
Trump admin blasted for 'unrelenting push to jack up costs' with new 'backroom deal' - Raw Story
https://www.rawstory.com/linda-mcmahon-2674384567/
Fast Makespan Minimization via Short ILPs
Danny Hermelin, Dvir Shabtay
https://arxiv.org/abs/2602.06514 https://arxiv.org/pdf/2602.06514 https://arxiv.org/html/2602.06514
arXiv:2602.06514v1 Announce Type: new
Abstract: Short integer linear programs are programs with a relatively small number of constraints. We show how recent improvements on the running-times of solvers for such programs can be used to obtain fast pseudo-polynomial time algorithms for makespan minimization on a fixed number of parallel machines, and other related variants. The running times of our algorithms are all of the form $\widetilde{O}(p^{O(1)}_{\max} n)$ or $\widetilde{O}(p^{O(1)}_{\max} \cdot n)$, where $p_{\max}$ is the maximum processing time in the input. These improve upon the time complexity of previously known algorithms for moderate values of $p_{\max}$.
toXiv_bot_toot
🇺🇦 Auf radioeins läuft...
Moscoman & SCUDFM:
🎵 Low Blood Sugar
#NowPlaying #Moscoman #SCUDFM
https://moscoman.bandcamp.com/track/low-blood-sugar-feat-scudfm
https://open.spotify.com/track/3LubKLDT9Nu0uwYGLzAIvm
🇺🇦 Auf radioeins läuft...
Moscoman & SCUDFM:
🎵 Low Blood Sugar
#NowPlaying #Moscoman #SCUDFM
https://moscoman.bandcamp.com/track/low-blood-sugar-feat-scudfm
https://open.spotify.com/track/3LubKLDT9Nu0uwYGLzAIvm