Tootfinder

🇺🇦 #NowPlaying on KEXP's #MiddayShow
Sufjan Stevens:
🎵 Jacksonville
#SufjanStevens
https://music.sufjan.com/track/jacksonville
https://open.spotify.com/track/7iYaPj3pAQ3UJrSmYZChYY

Spagnola: Previous success doesn’t mean squat https://www.dallascowboys.com/news/spagnola-previous-success-doesn-t-mean-squat

unicodelang: Languages spoken by country (2015)
A bipartite network of languages and the countries in which they are spoken, as estimated by Unicode. Edges are weighted by the proportion of the given country's population that is literate in a particular language.
This network has 868 nodes and 1255 edges.
Tags: Informational, Relatedness, Weighted

Speaking mildly ill of the dead is now punishable by deportation
https://www.dailykos.com/stories/2025/9/12/2343050/-Speaking-mildly-ill-of-the-dead-is-now-punishable-by-deportation

Une étude récente vient de confirmer que l'interdiction en Allemagne du recours Š du personnel sous-traitant dans les abattoirs a conduit Š des améliorations substantielles des conditions de travail.
https://www.socialeurope.eu/germanys-su…

Sufficient minimum degree conditions for the existence of highly connected or edge-connected subgraphs
Maximilian Krone
https://arxiv.org/abs/2508.07997 https://

Sufficient minimum degree conditions for the existence of highly connected or edge-connected subgraphs
Mader conjectured that an average degree of at least $3k-1$ is sufficient for the existence of a $(k+1)$-connected subgraph. The following minimum degree version holds: Every graph with minimum degree at least $3k-1$ has a $(k+1)$-connected subgraph on more than $2k$ vertices. Moreover, for triangle-free graphs, already an average degree of at least $2k$ is sufficient for a $(k+1)$-connected subgraph (which has at least $2(k+1)$ vertices). For edge-connectedness (in simple graphs), we prove t…

Zum #SchiffsSamstag dieses Mal die niederländische Brigg MERCEDES.

DiTalker: A Unified DiT-based Framework for High-Quality and Speaking Styles Controllable Portrait Animation
He Feng, Yongjia Ma, Donglin Di, Lei Fan, Tonghua Su, Xiangqian Wu
https://arxiv.org/abs/2508.06511

DiTalker: A Unified DiT-based Framework for High-Quality and Speaking Styles Controllable Portrait Animation
Portrait animation aims to synthesize talking videos from a static reference face, conditioned on audio and style frame cues (e.g., emotion and head poses), while ensuring precise lip synchronization and faithful reproduction of speaking styles. Existing diffusion-based portrait animation methods primarily focus on lip synchronization or static emotion transformation, often overlooking dynamic styles such as head movements. Moreover, most of these methods rely on a dual U-Net architecture, whic…

Geometry-Aware Spiking Graph Neural Network
Bowen Zhang, Genan Dai, Hu Huang, Long Lan
https://arxiv.org/abs/2508.06793 https://arxiv.org/pdf/2508.06793

Geometry-Aware Spiking Graph Neural Network
Graph Neural Networks (GNNs) have demonstrated impressive capabilities in modeling graph-structured data, while Spiking Neural Networks (SNNs) offer high energy efficiency through sparse, event-driven computation. However, existing spiking GNNs predominantly operate in Euclidean space and rely on fixed geometric assumptions, limiting their capacity to model complex graph structures such as hierarchies and cycles. To overcome these limitations, we propose \method{}, a novel Geometry-Aware Spikin…

🇺🇦 #NowPlaying on KEXP's #VarietyMix
Spacemen 3:
🎵 Feel So Good
#Spacemen3
https://s3firerecords.bandcamp.com/track/feel-so-good
https://open.spotify.com/track/2Qy26OdjqaPIVWh6wlmKyP