Tootfinder

The mastermind behind an extensive cyber-fraud empire, Vincent Chen Zhi, has been deported from Cambodia to China.
Cambodian tycoon Vincent Chen deported to China amid $10bn fraud and money laundering allegations | The Standard
https://www.thestandard.com.hk/china-news/article…

Cambodian tycoon Vincent Chen deported to China amid $10bn fraud and money laundering allegations
Vincent Chen Zhi, the founder and chairman of the Cambodian Prince Group, has been deported to China following his arrest in Cambodia amid serious allegations of large-scale fraud and money laundering, among other transnational crimes that involved more than US$10 billion.

Report suggests datacentre firms embrace flexible connection agreements, allowing grid operators to temporarily curtail their loads during peak demand or emergencies.
https://www.computing.co.uk/news/2025/datacentres-hoarding-power-capacity-ai-demand

Datacentres accused of hoarding power capacity as AI demand surges
Report suggests datacentre firms embrace flexible connection agreements, allowing grid operators to temporarily curtail their loads during peak demand or emergencies.

Towards Efficient Data Structures for Approximate Search with Range Queries
Ladan Kian, Dariusz R. Kowalski
https://arxiv.org/abs/2602.06860 https://arxiv.org/pdf/2602.06860 https://arxiv.org/html/2602.06860
arXiv:2602.06860v1 Announce Type: new
Abstract: Range queries are simple and popular types of queries used in data retrieval. However, extracting exact and complete information using range queries is costly. As a remedy, some previous work proposed a faster principle, {\em approximate} search with range queries, also called single range cover (SRC) search. It can, however, produce some false positives. In this work we introduce a new SRC search structure, a $c$-DAG (Directed Acyclic Graph), which provably decreases the average number of false positives by logarithmic factor while keeping asymptotically same time and memory complexities as a classic tree structure. A $c$-DAG is a tunable augmentation of the 1D-Tree with denser overlapping branches ($c \geq 3$ children per node). We perform a competitive analysis of a $c$-DAG with respect to 1D-Tree and derive an additive constant time overhead and a multiplicative logarithmic improvement of the false positives ratio, on average. We also provide a generic framework to extend our results to empirical distributions of queries, and demonstrate its effectiveness for Gowalla dataset. Finally, we quantify and discuss security and privacy aspects of SRC search on $c$-DAG vs 1D-Tree, mainly mitigation of structural leakage, which makes $c$-DAG a good data structure candidate for deployment in privacy-preserving systems (e.g., searchable encryption) and multimedia retrieval.
toXiv_bot_toot

Researchers at the University of Pennsylvania and University of Michigan have created
the world’s smallest fully programmable, autonomous robots:
-- microscopic swimming machines that can independently sense and respond to their surroundings,
operate for months
and cost just a penny each.
Barely visible to the naked eye,
each robot measures about 200 by 300 by 50 micrometers,
smaller than a grain of salt.
Operating at the scale of many biologi…

Penn and Michigan Create World’s Smallest Programmable, Autonomous Robots
Smaller than a grain of salt, the robots can navigate their environment, measure temperatures and respond autonomously using tiny onboard computers.

Reflecting on Marcus Aurelius, it's evident that prioritizing others' opinions over self-love can erode our confidence. Let's shift focus to our inner voice and embrace our true selves, building self-worth in personal and professional life. 💪 #SelfLove #Authenticity #Inspiration

"Seafloor survey in Cambodia finds simple anti-trawling blocks help seagrass recover"
#Cambodia #Environment #Oceans

Seafloor survey in Cambodia finds simple anti-trawling blocks help seagrass recover
A recent study provides the first detailed map of Cambodia’s coastal seafloor habitats and finds that simple, low-cost anti-trawling structures are helping seagrass meadows recover and support small-scale fishers in the Kep Marine Fisheries Management Area in the Gulf of Thailand. The study was published in Frontiers in Marine Science by researchers from Marine Conservation […]

SpaceX and Tesla are feeling the gravitational pull toward xAI, as Elon Musk looks to use his empire to fund xAI's ravenous appetite for cash and compute (Bloomberg)

On Dynamic Programming Theory for Leader-Follower Stochastic Games
Jilles Steeve Dibangoye, Thibaut Le Marre, Ocan Sankur, Fran\c{c}ois Schwarzentruber
https://arxiv.org/abs/2512.05667 https://arxiv.org/pdf/2512.05667 https://arxiv.org/html/2512.05667
arXiv:2512.05667v1 Announce Type: new
Abstract: Leader-follower general-sum stochastic games (LF-GSSGs) model sequential decision-making under asymmetric commitment, where a leader commits to a policy and a follower best responds, yielding a strong Stackelberg equilibrium (SSE) with leader-favourable tie-breaking. This paper introduces a dynamic programming (DP) framework that applies Bellman recursion over credible sets-state abstractions formally representing all rational follower best responses under partial leader commitments-to compute SSEs. We first prove that any LF-GSSG admits a lossless reduction to a Markov decision process (MDP) over credible sets. We further establish that synthesising an optimal memoryless deterministic leader policy is NP-hard, motivating the development of {\epsilon}-optimal DP algorithms with provable guarantees on leader exploitability. Experiments on standard mixed-motive benchmarks-including security games, resource allocation, and adversarial planning-demonstrate empirical gains in leader value and runtime scalability over state-of-the-art methods.
toXiv_bot_toot

Posing as an ideological compatriot, John Williams had penetrated the top ranks of two of the most prominent right-wing militias in the country.
He’d slept in the home of the man who claims to be the new head of the Oath Keepers,
rifling through his files in the middle of the night.
He’d devised elaborate ruses to gather evidence of militias’ ties to high-ranking law enforcement officials.
He’d uncovered secret operations like the surveillance of a young journalist…

The Militia and the Mole
Outraged by the Jan. 6 Capitol riot, a wilderness survival trainer spent years undercover climbing the ranks of right-wing militias. He didn’t tell police or the FBI. He didn’t tell family or friends. The one person he told was a ProPublica reporter.

Here is my round up of the best #PositiveNews that I shared in 2025 about the #Environment and #Climate

The Top Environmental Headlines From 2025
The media has an important role to play in combatting climate doom. Unlike our usual schedule, this blog is showcasing a curated selection of 2025's positivity. We hope this yearly news round up of positive environmental and climate change news, has sparked joy and shown that progress is being made.