Tootfinder

https://www.crikey.com.au/2025/07/17/clive-palmer-united-australia-party-trumpet-of-patriots-data-breach-documents/
I don’t know enough about Australian politics but it sounds like the country’s version of the MAG…

Clive Palmer’s political parties suffer data breach affecting ‘all emails … documents and records’
Identical statements from both parties say a ransomware attack has obtained ‘email address, phone number, identity records, banking records, employment history, documents (including those provided subject to confidentiality arrangements)'.

ChatGPT Agent uses a virtual browser to do tasks such as filling online forms and calling public APIs, and generates downloadable PowerPoint and Excel files (Reece Rogers/Wired)
https://www.wired.com/story/openai-chatgpt-agent-launch/

OpenAI’s New ChatGPT Agent Tries to Do It All
It’s a PowerPoint generator! It’s a date-night planner! It’s … another agent from OpenAI.

"Upcycling solar glass waste to use in solid-state lithium batteries"
#Glass #Batteries #Energy

Upcycling solar glass waste to use in solid-state lithium batteries
Nanyang Technological University researchers have milled solar panel glass waste for use in cathodes used in solid state lithium metal batteries. When used as a functional filler in solid polymer electrolyte (SPE) material, the resulting battery performance was maintained over 80 charge cycles with an 8.3 % improvement over the reference device.

Approximate polymorphisms of predicates
Yaroslav Alekseev, Yuval Filmus
https://arxiv.org/abs/2506.12155 https://arxiv.org/pdf/2506.1…

Approximate polymorphisms of predicates
A generalized polymorphism of a predicate $P \subseteq \{0,1\}^m$ is a tuple of functions $f_1,\dots,f_m\colon \{0,1\}^n \to \{0,1\}$ satisfying the following property: If $x^{(1)},\dots,x^{(m)} \in \{0,1\}^n$ are such that $(x^{(1)}_i,\dots,x^{(m)}_i) \in P$ for all $i$, then also $(f_1(x^{(1)}),\dots,f_m(x^{(m)})) \in P$. We show that if $f_1,\dots,f_m$ satisfy this property for most $x^{(1)},\dots,x^{(m)}$ (as measured with respect to an arbitrary full support distribution $μ$ on $P$), th…

Just a little PSA to any trail bikers in the UK who find the https://stegra.io app interesting...
Many of the byways that they are highlighting on the map are actually illegal to ride - they are closed with a TRO. It seems Stegra didn’t take this into account at all 🤦‍♀️

Trump Has a Nasty Secret Nickname for Stephen Miller, Biographer Reveals (Ewan Palmer/The Daily Beast)
https://www.thedailybeast.com/donald-trump-has-a-secret-insulting-nickname-for-stephen-miller-biographer/
http://www.memeorandum.com/250618/p23#a250618p23

FloGAN: Scenario-Based Urban Mobility Flow Generation via Conditional GANs and Dynamic Region Decoupling
Seanglidet Yean, Jiazu Zhou, Bu-Sung Lee, Markus Schl\"apfer
https://arxiv.org/abs/2507.12053

FloGAN: Scenario-Based Urban Mobility Flow Generation via Conditional GANs and Dynamic Region Decoupling
The mobility patterns of people in cities evolve alongside changes in land use and population. This makes it crucial for urban planners to simulate and analyze human mobility patterns for purposes such as transportation optimization and sustainable urban development. Existing generative models borrowed from machine learning rely heavily on historical trajectories and often overlook evolving factors like changes in population density and land use. Mechanistic approaches incorporate population de…

"Ein weiterer Fokus liegt auf einer digitalen Identität für alle"
Wer hätte das gedacht. Der #CDU wird es bei Digitalisierung mehr um Kontrolle des Bürgers als Dienstleistung für uns gehen.
http…

ReLCP: Scalable Complementarity-Based Collision Resolution for Smooth Rigid Bodies
Bryce Palmer, Hasan Metin Aktulga, Tong Gao
https://arxiv.org/abs/2506.14097

ReLCP: Scalable Complementarity-Based Collision Resolution for Smooth Rigid Bodies
We present a complementarity-based collision resolution algorithm for smooth, non-spherical, rigid bodies. Unlike discrete surface representation approaches, which approximate surfaces using discrete elements (e.g., tessellations or sub-spheres) with constraints between nearby faces, edges, nodes, or sub-objects, our algorithm solves a recursively generated linear complementarity problem (ReLCP) to adaptively identify potential collision locations during the collision resolution procedure. Desp…

Planar Tur\'an number of quasi-double stars
Huiqing Liu, Tian Xie, Qin Zhao
https://arxiv.org/abs/2507.11860 https://arxiv.org/pd…

Planar Turán number of quasi-double stars
Given a graph H, we call a graph $\textit{H-free}$ if it does not contain H as a subgraph. The planar Turán number of a graph H, denoted by $ex_{\mathcal{P}}(n, H)$, is the maximum number of edges in a planar H-free graph on n vertices. A (h,k)-quasi-double star $W_{h,k}$, obtained from a path $P_3=v_1v_2v_3$ by adding h leaves and k leaves to the vertices $v_1$ and $v_3$, respectively, is a subclass of caterpillars. In this paper, we study $ex_{\mathcal{P}}(n,W_{h,k})$ for all $1\le h\le 2\le…