Tootfinder

Identificação profunda com esta imagem neste finalzinho de período rs.

❌Mobile Fortify,
the new app used by Immigration and Customs Enforcement (ICE) to use face recognition technology (FRT) to identify people during street encounters,
is an affront to the rights and dignity of migrants and U.S. citizens alike.
That's why a coalition of privacy, civil liberties and civil rights organizations are
🔥demanding the Department of Homeland Security (DHS)
shut down the use of Mobile Fortify,
release the agency's privacy anal…

Rights Organizations Demand Halt to Mobile Fortify, ICE's Handheld Face Recognition Program
Mobile Fortify, the new app used by Immigration and Customs Enforcement (ICE) to use face recognition technology (FRT) to identify people during street encounters, is an affront to the rights and dignity of migrants and U.S. citizens alike. That's why a coalition of privacy, civil liberties and...

Grr and argh.
The people who make government websites generally tend to do a halfway decent job of meeting the spec, but they really really need to learn to push back when the spec is FUCKING STUPID.
Having just completed my "Annual Filing" with Companies House - and why is that even a thing, we're not posting fucking vellum to Victorian clerks who scurry up ladders to deposit the sacred paperwork in the appropriate filing cabinet any more - I got a new scary emai…

2025 NFL Black Friday bets: Are the Bills still a top discount Super Bowl pick? Could Packers be top prize?

https://www.cbssports.com/nfl/news/2025-nf

Hardness and Tractability of T_{h 1}-Free Edge Deletion
Ajinkya Gaikwad, Soumen Maity, Leeja R
https://arxiv.org/abs/2602.00644 https://arxiv.org/pdf/2602.00644 https://arxiv.org/html/2602.00644
arXiv:2602.00644v1 Announce Type: new
Abstract: We study the parameterized complexity of the T(h 1)-Free Edge Deletion problem. Given a graph G and integers k and h, the task is to delete at most k edges so that every connected component of the resulting graph has size at most h. The problem is NP-complete for every fixed h at least 3, while it is solvable in polynomial time for h at most 2.
Recent work showed strong hardness barriers: the problem is W[1]-hard when parameterized by the solution size together with the size of a feedback edge set, ruling out fixed-parameter tractability for many classical structural parameters. We significantly strengthen these negative results by proving W[1]-hardness when parameterized by the vertex deletion distance to a disjoint union of paths, the vertex deletion distance to a disjoint union of stars, or the twin cover number. These results unify and extend known hardness results for treewidth, pathwidth, and feedback vertex set, and show that several restrictive parameters, including treedepth, cluster vertex deletion number, and modular width, do not yield fixed-parameter tractability when h is unbounded.
On the positive side, we identify parameterizations that restore tractability. We show that the problem is fixed-parameter tractable when parameterized by cluster vertex deletion together with h, and also when parameterized by neighborhood diversity together with h via an integer linear programming formulation. We further present a fixed-parameter tractable bicriteria approximation algorithm parameterized by k. Finally, we show that the problem admits fixed-parameter tractable algorithms on split graphs and interval graphs, and we establish hardness for a directed generalization even on directed acyclic graphs.
toXiv_bot_toot