Integral and Detail ✴️
整体和细节 ✴️
📷 Nikon FE
🎞️ Ilford FP4 Plus 125, expired 1993
If you like my work, buy me a coffee from PayPal #filmphotography
"I think a lot of times I see people talk about this stuff in relation to AI. It's right to talk about it, but I hate when people act like AI is the only tech that has these problems. What you see with AI now is a reflection of the broader tech and internet industry that has grown for the past 20-30 years."
References provided 😔
https://www.tumblr.com/teledyn/808733064965570560/anatomy-of-an-ai-system?source=share
My loose process for evaluating an ACR (VPAT®):
https://adrianroselli.com/2026/01/how-i-evaluate-an-acr-vpat.html
You may have your own thoughts / ideas. Add them to the comments.
I was also torn between the meat grinder and a Plinko metaphor.
It has been an extraordinary 24 hours in global markets
Oil prices have tumbled back from the four-year highs they hit on Monday
after Donald Trump suggested the US-Israel war on Iran could end “very soon”.
This time yesterday, Brent crude, the international benchmark, surged beyond $100 per barrel for the first time since Russia’s invasion of Ukraine in 2022
– triggering stark sell-offs across leading Asian and European stock indices.
Wall Street also started t…
En attendant Godot II 🤡
等待戈多 II 🤡
📷 Nikon FE
🎞️ Ilford FP4 Plus 125, expired 1993
If you like my work, buy me a coffee from PayPal #filmphotography
blackship
― a FreeBSD jail orchestrator with TOML configuration, dependency management, state machine lifecycle control, ZFS integration, VNET, and jailfile templates.
<https://github.com/seuros/blackship> via <
So for many folks - cancelling their Hilton Honors membership was a way to let the chain know that their handling of the situation in Minneapolis was unacceptable.
Nice techdirt article and template for those perhaps looking to do the same https://www.techdirt.com/2026/01/07/dear-h
Fanciful Figurines flip Free Flood-It -- Polynomial-Time Miniature Painting on Co-gem-free Graphs
Christian Rosenke, Mark Scheibner
https://arxiv.org/abs/2602.00690 https://arxiv.org/pdf/2602.00690 https://arxiv.org/html/2602.00690
arXiv:2602.00690v1 Announce Type: new
Abstract: Inspired by the eponymous hobby, we introduce Miniature Painting as the computational problem to paint a given graph $G=(V,E)$ according to a prescribed template $t \colon V \rightarrow C$, which assigns colors $C$ to the vertices of $G$. In this setting, the goal is to realize the template using a shortest possible sequence of brush strokes, where each stroke overwrites a connected vertex subset with a color in $C$. We show that this problem is equivalent to a reversal of the well-studied Free Flood-It game, in which a colored graph is decolored into a single color using as few moves as possible. This equivalence allows known complexity results for Free Flood-It to be transferred directly to Miniature Painting, including NP-hardness under severe structural restrictions, such as when $G$ is a grid, a tree, or a split graph. Our main contribution is a polynomial-time algorithm for Miniature Painting on graphs that are free of induced co-gems, a graph class that strictly generalizes cographs. As a direct consequence, Free Flood-It is also polynomial-time solvable on co-gem-free graphs, independent of the initial coloring.
toXiv_bot_toot