Tootfinder

🇺🇦 #NowPlaying on KEXP's #Expansions
Speedy J:
🎵 303 Template Refract
#SpeedyJ
https://speedyj.bandcamp.com/track/303-template-refract
https://open.spotify.com/track/5TSlEN5TKuaunrY5YVUz0x

A template for data analysis projects structured as R packages (or not) https://github.com/Pakillo/template by @…

GitHub - Pakillo/template: A template for data analysis projects structured as R packages (or not)
A template for data analysis projects structured as R packages (or not) - Pakillo/template

How India's ambitions to build and export a sovereign AI template are colliding with structural constraints, including a dependence on foreign AI infrastructure (Saritha Rai/Bloomberg)

Updated my post on evaluating ACRs to add a note about ‘N/A’ entries in a WCAG VPAT:
https://adrianroselli.com/2026/01/how-i-evaluate-an-acr-vpat.html#Update01
In short: not allowed; ask vendor for clarity.

How I Evaluate an ACR (VPAT®)
ACRs are Accessibility Conformance Reports, which are the output of a VPAT, or Voluntary Product Accessibility Template maintained by ITIC, or the Information Technology Industry Council (which is why VPAT often has a ® symbol hanging off it). An organization may fill out the template to indicate how or if…

🇺🇦 #NowPlaying on KEXP's #Expansions
Speedy J:
🎵 303 Template Refract
#SpeedyJ
https://speedyj.bandcamp.com/track/303-template-refract
https://open.spotify.com/track/5TSlEN5TKuaunrY5YVUz0x

My first attempt at a template rejection message for #AI generated papers where the introduction and text are mostly unedited with typical OK sounding but essentially meaningless phrases. "Undigested results" submitted straight to the journal as @… would maybe say.
Still very uneasy about all editorial decisions in this new time...

Does anyone here have tried Zine (static site generator)?
I would like to port a recursive template I had on Hugo but I'm puzzled.
#ssg

Idea for MS, make a template starting like this in the marketing dep "Microsoft has confirmed a new known issue affecting... [fill in the latest fuck-up]

Once foundation model providers start trying to turn a profit, the vast majority of "AI powered" products will be swiftly replaced by a plain ol' template library.
#LLM #AI

Some incredible shots in this year's International Aerial Photographer contest:
https://www.internationalaerialphotographer.com/
Awards book (preliminary):

➡️ Make a README
#bookmarks

Make a README
Learn how to make a great README for your programming project, and use the editable template to get started.

#today I have the #journal's template .tex building in my usual harness, so I am nearly started on that new paper - a whole week left to write it all!

Pro Se Guide for Motion to Change Hearing to WebEx
https://nipnlg.org/work/resources/pro-se-guide-motion-change-hearing-webex
The regime keeps arresting people that follow legal immigration processes, they have been racially profiling and abduct an…

@… @… @… Well, you CAN use a full template for Typst as well. However, unless you want to…

@… @… @… Well, you CAN use a full template for Typst as well. However, unless you want to…

I went to the English Market in Cork City, therein to the cheesemonger where I learned the word "hectogram," and sagely ordered a /hectogram/ of the Fourme d'Ambert. This was met by a "sorry, a what?" from the lass behind the counter.
It's over for us.

Generalized Constraint Projection: Four-Dimensional Type Inference for Dynamic Languages
Qunhui Zhang
https://arxiv.org/abs/2607.19693 https://arxiv.org/pdf/2607.19693 https://arxiv.org/html/2607.19693
arXiv:2607.19693v1 Announce Type: new
Abstract: Type inference for dynamically typed languages must reconcile four distinct sources of evidence for function parameters: internal assignments, explicit declarations, contextual requirements, and structural operations. Existing systems often merge these sources into one constraint set, causing spurious conflicts or requiring redundant annotations. We present Generalized Constraint Projection (GCP), a zero-annotation inference framework that stores the four sources in separate monotone slots on a stable definition-time template and checks each call in a fresh projection session. Ordinary calls verify concrete arguments and specialize return types without modifying the template, while currying produces residual projected functions. GCP uses Outline Equational Matching (OEM), a structural compatibility preorder with an open bidirectional delegation protocol, and future this, a receiver-preserving extension for subtype-refining fluent APIs. On the strict success fragment of a finite-height type preorder, we prove monotonicity, local and global convergence in $O(Nh_T)$ effective updates, conditional projection-obligation soundness, projection termination, multi-module convergence, and order independence under fair monotone iteration. For the pure, recursion-free core Outline0, we additionally prove big-step evaluation definedness, type preservation, runtime receiver retention, and projection-evaluation coherence. We instantiate GCP in the Outline dynamic language as a typed substrate for ontology worlds and apply it to unannotated Python source to recover PEP 484 annotations for downstream compilation.
toXiv_bot_toot

I've added a "contributing" file to #Gemato:
#Gentoo infrastructure and mirrored to GitHub or Codeberg.

Portable surrogate-free 4D MRI from standard fast multi-slice 2D MRI via implicit neural representations
Muheng Li, Xinyang Wu, Xia Li, Orso Pusterla, Philippe C. Cattin, Sairos Safai, Antony J. Lomax, Ye Zhang
https://arxiv.org/abs/2607.17906 https://arxiv.org/pdf/2607.17906 https://arxiv.org/html/2607.17906
arXiv:2607.17906v1 Announce Type: new
Abstract: Four-dimensional MRI (4D MRI) characterizes respiratory organ motion, yet existing reconstruction pipelines are tightly coupled to specific acquisition platforms (e.g., non-Cartesian trajectories with self-gating, vendor-specific navigators, or external respiratory hardware), limiting broad adoption across diverse clinical and research settings, including low-field, open-bore, and non-supine imaging. We present SIMPLE-4D (Surrogate-free, IMplicit, PortabLE 4D MRI), a software-first portable workflow that operates entirely on reconstructed slices from standard fast multi-slice 2D MRI and requires no pulse-sequence modification, no non-Cartesian trajectory, no navigator, and no external hardware. SIMPLE-4D combines an acquisition-agnostic front end consuming standard 2D protocols, a surrogate-free variational motion encoder that extracts a compact motion code directly from each 2D slice, and a physics-aware continuous spatio-temporal reconstruction based on a hash-encoded implicit neural representation (INR) with a SIREN deformation network producing bidirectional cycle-consistent DVFs and motion-dependent Gauss-Legendre thick-slice quadrature. Bidirectionality yields a complete inter-frame motion model by composition, supporting downstream tasks such as dose accumulation without retraining. We validate the identical pipeline on two contrasting datasets: a 1.5 T clinical bSSFP dataset (5 volunteers, 3 sessions each) and a 0.5 T open-bore HASTE dataset (5 volunteers, supine and upright). To our knowledge, this is the first per-frame 4D volumetric respiratory MRI reconstruction on a weight-bearing upright open-bore low-field scanner from reconstructed 2D Cartesian slices alone. On low-field data the INR template additionally acts as an implicit denoiser, yielding 132% SNR. Systematic ablations isolate each component's contribution.
toXiv_bot_toot

Weakly Non-Negative Supermartingales for Omega-Regular Verification
Toru Takisaka, Hongjie Qing, Libo Zhang
https://arxiv.org/abs/2607.17798 https://arxiv.org/pdf/2607.17798 https://arxiv.org/html/2607.17798
arXiv:2607.17798v1 Announce Type: new
Abstract: Martingale-based methods are central to probabilistic program verification, but strong global non-negativity requirements can exclude simple certificates from tractable template classes. Relaxing this requirement enlarges the search space for automated synthesis, but naive relaxations are unsound in the probabilistic setting. We introduce lazy Streett supermartingales and their lexicographic extension, showing that weak non-negativity can nevertheless be used soundly to certify almost-sure satisfaction of $\omega$-regular properties with polynomial templates under a broad class of sampling distributions, including all bounded-support distributions. This extends prior weakly non-negative methods from termination to general $\omega$-regular verification. We further give a compositional account of lexicographic certificates in terms of one-dimensional ones. Experiments on 170 polynomial probabilistic-program benchmarks show increases of 20.0-23.5 percentage points in verification success over the strongly non-negative baseline.
toXiv_bot_toot