Tootfinder

Kuku Sebsibe is one of Ethiopia’s premier singers. She has performed with all the top bands of the 70s and 80s including Walias, Roha and Ibex, and is still performing today.
https://amf.didiermary.fr/kuku-sebsibe/
Available for the first time on record, these selections …

Kuku Sebsibe - African Music Forum
Kuku Sebsibe - One of Ethiopia's premier singers. She has performed with all the top bands of the 70s and 80s including Walias, Roha, Ibex...

Patriots' longtime staffer says he will take specific Spygate details 'to the grave'

https://www.cbssports.com/nfl/news/patriot

Patriots' longtime staffer says he will take specific Spygate details 'to the grave'
We may never know the full details behind the Patriots' scandal

Schnellerer Speicher für PCs: DDR5-8800 ist jetzt spezifiziert
DDR5-8800 löst DDR5-6400 als schnellste JEDEC-Spezifikation für PC-Arbeitsspeicher ab. Offiziell gibt es aber nur lasche Timings.
https…

Validating Traces of Distributed Programs Against TLA Specifications
Horatiu Cirstea, Markus A. Kuppe, Benjamin Loillier, Stephan Merz
https://arxiv.org/abs/2404.16075

Validating Traces of Distributed Programs Against TLA+ Specifications
TLA+ is a formal language for specifying systems, including distributed algorithms, that is supported by powerful verification tools. In this work we present a framework for relating traces of distributed programs to high-level specifications written inTLA+. The problem is reduced to a constrained model checking problem, realized using the TLC model checker. Our framework consists of an API for instrumenting Java programs in order to record traces of executions, of a collection of TLA+ operator…

This https://arxiv.org/abs/2401.08807 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_csSE_…

SpecGen: Automated Generation of Formal Program Specifications via Large Language Models
Formal program specifications play a crucial role in various stages of software development. However, manually crafting formal program specifications is rather difficult, making the job time-consuming and labor-intensive. It is even more challenging to write specifications that correctly and comprehensively describe the semantics of complex programs. To reduce the burden on software developers, automated specification generation methods have emerged. However, existing methods usually rely on pr…

“Whether a president should have criminal immunity in some specific circumstances is an abstract question for another day, because efforts to stay in office and use the levers of the presidency are certainly not those specific circumstances. The appeals have delayed matters long enough at the expense of the right of the American people to a fair and speedy trial.”

The Public Has a Right to Trump's Speedy Trial
No good legal reason exists to delay Donald Trump’s January 6 trial any further.

New scattered subspaces in higher dimensions
D. Bartoli, A. Giannoni, G. Marino
https://arxiv.org/abs/2402.15223 https://arxiv.org/pd…

New scattered subspaces in higher dimensions
Over the past few decades, there has been extensive research on scattered subspaces, partly because of their link to MRD codes. These subspaces can be characterized using linearized polynomials over finite fields. Within this context, scattered sequences extend the concept of scattered polynomials and can be viewed as geometric equivalents of exceptional MRD codes. Up to now, only scattered sequences of orders one and two have been developed. However, this paper presents an infinite series of e…

#ActivityPub specs a universe with only the questions that don't have answers

Limits of Rauzy graphs of languages with subexponential complexity
Paul-Henry Leemann, Tatiana Nagnibeda, Alexandra Skripchenko, Georgii Veprev
https://arxiv.org/abs/2402.15877

Limits of Rauzy graphs of languages with subexponential complexity
To a subshift over a finite alphabet, one can naturally associate an infinite family of finite graphs, called its Rauzy graphs. We show that for a subshift of subexponential complexity the Rauzy graphs converge to the line $\mathbf{Z}$ in the sense of Benjamini-Schramm convergence if and only if its complexity function $p(n)$ is unbounded and satisfies $\lim_n\frac{p(n+1)}{p(n)} = 1$. We then apply this criterion to many examples of well-studied dynamical systems. If the subshift is moreover un…

An interview with Adobe executives about training Firefly on content licensed specifically for AI training, the decision not to scrape the internet, and more (Melissa Heikkilä/MIT Technology Review)
https://www.technologyreview.com/2024/03/2

How Adobe’s bet on non-exploitative AI is paying off
The company says it’s proof that quality AI models don’t have to include controversial copyrighted content.