@paun@digitalcourage.social2026-02-01 10:03:35
#Taiwan’s first Indigenous Defence #Submarine (IDS), Hai Kun (SS-711), also known as #Narwhal, successfully completed its first submerged sea trials on January 29, 2026.
@floheinstein@chaos.social2026-03-02 06:46:43
@kubikpixel@chaos.social2026-04-02 06:05:09
Email obfuscation: What works in 2026?
Here are some of the best techniques for keeping email addresses hidden from spammers—along with the statistics on how likely they are to be broken.
📧 https://spencermortensen.com/articles/email-obfuscation/
@jake4480@c.im2026-04-02 17:43:08
Title track 'Rio' was actually the seventh single from Duran Duran's 1982 sophomore album of same name. The single hit Australia and the UK in 1982, but it took until this week in 1983 for it to release in the U.S.
It's only one of the best songs and videos EVER
https://www.youtube.com/watch?v=nTizYn3-QN0
@nemorosa@mastodon.nu2026-03-03 14:35:43
Den spanar efter mina krokusar också, det odjuret.
@jamesthebard@social.linux.pizza2026-02-02 19:38:21
Finished prepping the NESessity NES mainboard for the new front loader mechanism. I got lazy when I installed all the components on the NESessity board and maybe didn't clean the flux off as well as I should have. However, since I've gotten open the NES up, figured I'd do a proper 99% isopropyl alcohol bath and a good scrub. The board is looking great, now to wait for the cartridge slot to come in and get it buttoned up again.
@frankel@mastodon.top2026-01-30 09:09:33
The $200K #Developer Dream Is Over — Here's the Reality in 2026
https://medium.com/@sovannaro/the-200k-developer-dream-is-over-heres-the-…
@krone@frawas.de2026-03-02 23:43:26
Üble Schiri-Schelte - „Wo ist der Blödmann?“ Bayer-Boss sorgt für Wirbel #News #Nachrichten
@v_i_o_l_a@openbiblio.social2026-02-01 20:13:41
"Send It Away, or Put It On Display? How librarians and research computing staff can collaborate across language barriers"
#RDM
@arXiv_csDS_bot@mastoxiv.page2026-02-03 07:46:26
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