Tootfinder

Swarm-in-Blocks: Simplifying Drone Swarm Programming with Block-Based Language
Agnes Bressan de Almeida, Joao Aires Correa Fernandes Marsicano
https://arxiv.org/abs/2508.11498 h…

Swarm-in-Blocks: Simplifying Drone Swarm Programming with Block-Based Language
Swarm in Blocks, originally developed for CopterHack 2022, is a high-level interface that simplifies drone swarm programming using a block-based language. Building on the Clover platform, this tool enables users to create functionalities like loops and conditional structures by assembling code blocks. In 2023, we introduced Swarm in Blocks 2.0, further refining the platform to address the complexities of swarm management in a user-friendly way. As drone swarm applications grow in areas like del…

CLMTracing: Black-box User-level Watermarking for Code Language Model Tracing
Boyu Zhang, Ping He, Tianyu Du, Xuhong Zhang, Lei Yun, Kingsum Chow, Jianwei Yin
https://arxiv.org/abs/2509.13982

CLMTracing: Black-box User-level Watermarking for Code Language Model Tracing
With the widespread adoption of open-source code language models (code LMs), intellectual property (IP) protection has become an increasingly critical concern. While current watermarking techniques have the potential to identify the code LM to protect its IP, they have limitations when facing the more practical and complex demand, i.e., offering the individual user-level tracing in the black-box setting. This work presents CLMTracing, a black-box code LM watermarking framework employing the rul…

Multi-Sensory Cognitive Computing for Learning Population-level Brain Connectivity
Mayssa Soussia, Mohamed Ali Mahjoub, Islem Rekik
https://arxiv.org/abs/2508.11436 https://

Multi-Sensory Cognitive Computing for Learning Population-level Brain Connectivity
The generation of connectional brain templates (CBTs) has recently garnered significant attention for its potential to identify unique connectivity patterns shared across individuals. However, existing methods for CBT learning such as conventional machine learning and graph neural networks (GNNs) are hindered by several limitations. These include: (i) poor interpretability due to their black-box nature, (ii) high computational cost, and (iii) an exclusive focus on structure and topology, overlo…

Interesting… but why is this at the browser level instead of OS level? 🤔 #Chrome…

Fighting Unwanted Notifications with Machine Learning in Chrome
Notifications in Chrome are a useful feature to keep up with updates from your favorite sites. However, we know that some notifications may...

from my link log —
Behind the scenes of Bun npm package install.
https://bun.com/blog/behind-the-scenes-of-bun-install
saved 2025-09-11

Behind The Scenes of Bun Install
Learn how Bun is able to cut install times by up to 25×. Bun skips Node.js's overhead with direct system calls, cache-friendly data layouts, OS-level copy-on-write, and full-core parallelism.

"25 Jahre united-domains: Die 25 beliebtesten Top und die exotischsten #TLDs" https://www.united-domains.de/blog/25-jahre-united-domains-25-top-und-flop-tlds/…

Critical Non-Abelian Vortex String and 2D N=2 Black Hole
E. Ievlev, A. Marshakov, G. Sumbatian, A. Yung
https://arxiv.org/abs/2508.12972 https://arxiv.org/…

Critical Non-Abelian Vortex String and 2D N=2 Black Hole
It has been shown that the non-Abelian vortex string in 4D $\mathcal{N}=2$ SQCD with the U(2) gauge group and $N_f=4$ flavors becomes a critical superstring. Its 10D target space is a product of the flat 4D space and an internal noncompact Calabi-Yau threefold, namely, the conifold. It was also shown that the Coulomb branch of the associated string sigma model, which opens up at strong coupling, can be described by $\mathcal{N}=2$ Liouville theory. We continue here the study of the recently pro…

Yeah, I knew some lovely people who worked at Twitter too. And did you know they once had unfettered API access and anyone could create their own client? Some of us loved that so much we built things that helped legitimise them as an open platform. And then one day they just switched that off.
Legitimacy is gold to venture-capital-funded startups. They need people with it to convince everyday folks that this latest iteration of the same old rug pull is different. Until they’ve grown s…

Cory Doctorow (@pluralistic@mamot.fr)
Attached: 1 image I can't wait to use Bluesky, but I will not be joining Bluesky. As much as I trust and respect the Bluesky executives and board members I am acquainted with, I believe the service itself is insufficiently enshittification-resistant to trust: https://pluralistic.net/2024/12/14/fire-exits/#graceful-failure-modes If you'd like an essay-formatted version of this thread to read or share, here's a link to it on pluralistic.net, my surveillance-free, ad-free, tracker-free blog: h…

Dyadically resolving trinomials for fast modular arithmetic
Robert Dougherty-Bliss, Mits Kobayashi, Natalya Ter-Saakov, Eugene Zima
https://arxiv.org/abs/2508.11043 https://

Dyadically resolving trinomials for fast modular arithmetic
Residue number systems based on pairwise relatively prime moduli are a powerful tool for accelerating integer computations via the Chinese Remainder Theorem. We study a structured family of moduli of the form $2^n - 2^k + 1$, originally proposed for their efficient arithmetic and bit-level properties. These trinomial moduli support fast modular operations and exhibit scalable modular inverses. We investigate the problem of constructing large sets of pairwise relatively prime trinomial moduli …

Liouville Quantum Duality and Random Planar Maps
Bertrand Duplantier, Emmanuel Guitter
https://arxiv.org/abs/2507.12203 https://arxiv…

Liouville Quantum Duality and Random Planar Maps
We consider models of block-weighted random planar maps in which possibly decorated maps are decomposed canonically into blocks, each block receiving the weight $u$. These maps present a transition at some critical value $u=u_{cr}$ above which the maps degenerate into Brownian trees. We show that the enumerative properties and critical exponents of the maps at $u=u_{cr}$ and those for $u