Tootfinder

Apple gets FDA clearance for hypertension alerts on Apple Watch, and plans to roll out the feature to Series 11, 10, and 9, and Watch Ultra 3, and 2 next week (Chance Miller/9to5Mac)
https://9to5mac.com/2025/09/11/apple-watch-hypertension-alerts…

Apple Watch hypertension alerts feature receives FDA clearance - 9to5Mac
When Apple announced the new Apple Watch Series 11 and Apple Watch Ultra 3 this week, it unveiled its latest...

Optimised neural networks for online processing of ATLAS calorimeter data on FPGAs
Georges Aad, Raphael Bertrand, Lauri Laatu, Emmanuel Monnier, Arno Straessner, Nairit Sur, Johann C. Voigt
https://arxiv.org/abs/2510.11469

Optimised neural networks for online processing of ATLAS calorimeter data on FPGAs
A study of neural network architectures for the reconstruction of the energy deposited in the cells of the ATLAS liquid-argon calorimeters under high pile-up conditions expected at the HL-LHC is presented. These networks are designed to run on the FPGA-based readout hardware of the calorimeters under strict size and latency constraints. Several architectures, including Dense, Recurrent (RNN), and Convolutional (CNN) neural networks, are optimised using a Bayesian procedure that balances energy …

'Bombshell!' Ex-clerk to Clarence Thomas sends shockwaves with Supreme Court warning (Travis Gettys/Raw Story)
https://www.rawstory.com/humphreys-executor-trump/
http://www.memeorandum.com/251013/p30#a251013p30

Injective edge-coloring of claw-free graphs with maximum degree 4
Danjun Huang, Yuqian Guo
https://arxiv.org/abs/2509.09407 https://arxiv.org/pdf/2509.0940…

Injective edge-coloring of claw-free graphs with maximum degree 4
An injective $k$-edge-coloring of a graph $G$ is a mapping $ϕ$: $E(G)\rightarrow\{1,2,...,k\}$, such that $ϕ(e)\neϕ(e')$ if edges $e$ and $e'$ are at distance two, or are in a triangle. The smallest integer $k$ such that $G$ has an injective $k$-edge-coloring is called the injective chromatic index of $G$, denoted by $χ_i'(G)$. A graph is called claw-free if it has no induced subgraph isomorphic to the complete bipartite graph $K_{1,3}$. In this paper, we show that $χ_i'(G)\le 13$ for ever…

🇺🇦 #NowPlaying on BBCRadio3's #NightTracks
Aaron Copland, Andreas Ottensamer, Rotterdam Philharmonic Orchestra & Yannick Nézet‐Séguin:
🎵 Clarinet Concerto: 1st mvt 'Slowly And Expressively'
#AaronCopland
https://open.spotify.com/track/4zBBFo3dhhH7U43ha9xH1L

These muffins came out deliciously! I used the gram measurements (not the cup measurements) for the whole wheat flour and almond flour, but volume for everything else. Oh, and I added the optional walnuts (left out the chocolate chips though).
https://colormekevin.com/wfpb-banana-nut-muffi…

WFPB Banana Nut Muffins - ColorMeKevin.com
These muffins are a winner! I made these for a group of omnivores and everyone loved them. If you’re looking for a…

🤔 Who is clearing Indonesia’s forests — and why?
#indonesia

Who is clearing Indonesia’s forests — and why?
JAKARTA — While most tropical countries experienced record-high deforestation rates in 2024, Indonesia’s forest loss is slowing, bucking a global trend. But beneath the headline figures lies a troubling mystery: Nearly half of the forest cleared last year can’t be linked to any identifiable driver, raising red flags about speculative land clearing, regulatory blind spots […]

Noticias musicales que me alegran: Divididos sacan un nuevo disco después de 15 años. No me queda claro cuando se publica, pero haršn un evento de escucha el 12 noviembre en Bs. Aires. El último disco de estudio que lanzaron fue «Amapola del 66», el año 2010, así que sus seguidores estšbamos esperando desde hace rato ya.

New lower bounds on the non-repetitive chromatic number of some graphs
Tianyi Tao, Junchi Zhang, Wentao Zhang, Alex Toole
https://arxiv.org/abs/2510.11263 https://

New lower bounds on the non-repetitive chromatic number of some graphs
A graph \( G \) is said to be (vertex) non-repetitively colored if no simple path in \( G \) has a sequence of vertex colors that forms a repetition. Formally, a coloring \( c: V(G) \to \{1, 2, \dots, k\} \) is non-repetitive if, for every path \(\langle v_1, v_2, \dots, v_{2m} \rangle\) in \( G \), the sequence of colors \( c(v_1), c(v_2), \dots, c(v_{2m}) \) is not of the form \( ww \), where \( w \) is a sequence of \( m \) colors. The minimum number of colors required for such a coloring is…