Tootfinder

finde man sollte unter der deutschen schuldenuhr noch einen zähler aufhängen der anzeigt wie viel geld jens spahn verpulvert hat
(wenn der betrag zu hoch wird kann man auch auf wissenschaftliche notation ausweichen)

LitterBox : An Extensible Framework for LLM-enhanced Scratch Static Code Analysis
Benedikt Fein, Florian Oberm\"uller, Gordon Fraser
https://arxiv.org/abs/2509.12021 https:…

LitterBox+: An Extensible Framework for LLM-enhanced Scratch Static Code Analysis
Large language models (LLMs) have become an essential tool to support developers using traditional text-based programming languages, but the graphical notation of the block-based Scratch programming environment inhibits the use of LLMs. To overcome this limitation, we propose the LitterBox+ framework that extends the Scratch static code analysis tool LitterBox with the generative abilities of LLMs. By converting block-based code to a textual representation suitable for LLMs, LitterBox+ allows u…

The future is here!
GitHub - ghuntley/cobol-emoji-rpn-calculator: A Emoji Reverse Polish Notation Calculator written in COBOL. https://github.com/ghuntley/cobol-emoji-rpn-calculator

Isn't it weird how when a Federal Crown Corporation - Marine Atlantic - buys a new ship... there is nary a mention that it was built in China (#BCPoli #BCFerries

EinHops: Einsum Notation for Expressive Homomorphic Operations on RNS-CKKS Tensors
Karthik Garimella, Austin Ebel, Brandon Reagen
https://arxiv.org/abs/2507.07972

EinHops: Einsum Notation for Expressive Homomorphic Operations on RNS-CKKS Tensors
Fully Homomorphic Encryption (FHE) is an encryption scheme that allows for computation to be performed directly on encrypted data, effectively closing the loop on secure and outsourced computing. Data is encrypted not only during rest and transit, but also during processing. However, FHE provides a limited instruction set: SIMD addition, SIMD multiplication, and cyclic rotation of 1-D vectors. This restriction makes performing multi-dimensional tensor operations challenging. Practitioners must …

Lazyweb CSS question:
Given a CSS custom property whose value is a list, like this:
--my-list: one, two, three;
Is there a way to access one item in the list, akin to array notation access?

Affordances of Sketched Notations for Multimodal UI Design and Development Tools
Sam H. Ross, Yunseo Lee, Coco K. Lee, Jayne Everson, R. Benjamin Shapiro
https://arxiv.org/abs/2508.09342

Affordances of Sketched Notations for Multimodal UI Design and Development Tools
Multimodal UI design and development tools that interpret sketches or natural language descriptions of UIs inherently have notations: the inputs they can understand. In AI-based systems, notations are implicitly defined by the data used to train these systems. In order to create usable and intuitive notations for interactive design systems, we must regard, design, and evaluate these training datasets as notation specifications. To better understand the design space of notational possibilities f…

Born at PPM site ... =
"parts-per-million – ppm, 10−6"
referenced from https://en.wikipedia.org/w/index.php?title=Parts-per_notation&oldid=1299770504
"Carbon dioxide in the atmosphere of Earth"
There are…

Parts-per notation - Wikipedia

I'm a (mostly) happy user of #Musescore but I'm taking a look to the other notation softwares. Which one do you use or recommend from the other 2 notation softwares still alive today (#finale is dead)?
#SheetMusic

Constructing Optimal Kobon Triangle Arrangements via Table Encoding, SAT Solving, and Heuristic Straightening
Pavlo Savchuk
https://arxiv.org/abs/2507.07951

Constructing Optimal Kobon Triangle Arrangements via Table Encoding, SAT Solving, and Heuristic Straightening
We present new methods and results for constructing optimal Kobon triangle arrangements. First, we introduce a compact table notation for describing arrangements of pseudolines, enabling the representation and analysis of complex cases, including symmetrical arrangements, arrangements with parallel lines, and arrangements with multiple-line intersection points. Building on this, we provide a simple heuristic method and tools for recovering straight-line arrangements from a given table, with the…

from my link log —
Triangle of power notation: exponents roots and logarithms.
https://mathcenter.oxford.emory.edu/site/math108/logs/
saved 2025-03-13

TLB-VFI: Temporal-Aware Latent Brownian Bridge Diffusion for Video Frame Interpolation
Zonglin Lyu, Chen Chen
https://arxiv.org/abs/2507.04984 https://

TLB-VFI: Temporal-Aware Latent Brownian Bridge Diffusion for Video Frame Interpolation
Video Frame Interpolation (VFI) aims to predict the intermediate frame $I_n$ (we use n to denote time in videos to avoid notation overload with the timestep $t$ in diffusion models) based on two consecutive neighboring frames $I_0$ and $I_1$. Recent approaches apply diffusion models (both image-based and video-based) in this task and achieve strong performance. However, image-based diffusion models are unable to extract temporal information and are relatively inefficient compared to non-diffusi…

Phasor notation of Dynamic Mode Decomposition
Karl Lapo, Samuele Mosso, J. Nathan Kutz
https://arxiv.org/abs/2509.03183 https://arxiv.org/pdf/2509.03183

Phasor notation of Dynamic Mode Decomposition
Dynamic Mode Decomposition (DMD) is a powerful, data-driven method for diagnosing complex dynamics. Various DMD algorithms allow one to fit data with a low-rank model that decomposes it into a sum of coherent spatiotemporal patterns. Nominally, each rank of the DMD model is interpreted as a complex, stationary spatial mode modulated by a single set of complex time dynamics (consisting of exponential growth/decay and oscillation), and an amplitude. However, the specifics of how these DMD compone…

a friend let me take a picture of his whiteboard

Phoenix: A Novel Context-Aware Voice-Powered Math Equation Workspace and Editor
Kenneth Ge, Ryan Paul, Priscilla Zhang, JooYoung Seo
https://arxiv.org/abs/2508.07576 https://

Phoenix: A Novel Context-Aware Voice-Powered Math Equation Workspace and Editor
Writing mathematical notation requires substantial effort, diverting cognitive resources from conceptual understanding to documentation mechanics, significantly impacting individuals with fine motor disabilities (FMDs). Current limits of speech-based math technologies rely on precise dictation of math symbols and unintuitive command-based interfaces. We present a novel voice-powered math workspace, applying neuroscience insights to create an intuitive problem-solving environment. To minimize co…

esolangs.org does not have anything called #gravy yet. I'm thinking the Gravy language should be a notation you can "pour on top" of some program in any other language, to make the program better. Sort of like literate programming, but more of a diner aesthetic

Replaced article(s) found for cs.AI. https://arxiv.org/list/cs.AI/new
[1/11]:
- Probability Bracket Notation: Multivariable Systems and Static Bayesian Networks
Xing M. Wang

Imagine a copyist's worst nightmare…
what does it matter if, when you hold the manuscript away from you, it looks messy? All that is important is that everything is there, correct and legible.
#notation
https:…

Concentration Inequalities for Branching Random Walk
Changqing Liu
https://arxiv.org/abs/2509.05860 https://arxiv.org/pdf/2509.05860

Concentration Inequalities for Branching Random Walk
Classical concentration inequalities for random walks are typically derived under independence assumptions or martingale difference conditions. In this paper, we extend concentration inequalities to more general conditions, relaxing the classical assumptions of independence and martingale differences. Specifically, in the notation of calculus, while the condition of independence is $\displaystyle \frac { \partial y } {\partial t}=$ constant and martingale difference condition is $\displaystyle …

Scroll nets
Pablo Donato
https://arxiv.org/abs/2507.19689 https://arxiv.org/pdf/2507.19689

Scroll nets
We introduce a new formalism for representing proofs in propositional logic called "scroll nets". Its fundamental construct is the "scroll", a topological notation for implication proposed by C. S. Peirce at the end of the 19th century as the basis for his diagrammatic system of existential graphs (EGs). Scroll nets are derived from EGs by following the Curry-Howard methodology of internalizing inference rules inside judgments, just as terms in type theory internalize natural deduction rules. W…

Beat and Downbeat Tracking in Performance MIDI Using an End-to-End Transformer Architecture
Sebastian Murgul, Michael Heizmann
https://arxiv.org/abs/2507.00466

Beat and Downbeat Tracking in Performance MIDI Using an End-to-End Transformer Architecture
Beat tracking in musical performance MIDI is a challenging and important task for notation-level music transcription and rhythmical analysis, yet existing methods primarily focus on audio-based approaches. This paper proposes an end-to-end transformer-based model for beat and downbeat tracking in performance MIDI, leveraging an encoder-decoder architecture for sequence-to-sequence translation of MIDI input to beat annotations. Our approach introduces novel data preprocessing techniques, includi…

Towards New Characterizations of Small Circuit Classes via Discrete Ordinary Differential Equations
Melissa Antonelli, Arnaud Durand, Juha Kontinen
https://arxiv.org/abs/2508.19392

Towards New Characterizations of Small Circuit Classes via Discrete Ordinary Differential Equations
Implicit computational complexity is a lively area of theoretical computer science, which aims to provide machine-independent characterizations of relevant complexity classes. % for uniformity with subsequent uses >> 1960s (but feel free to modify it) % One of the seminal works in this field appeared in the 1960s, when Cobham introduced a function algebra closed under bounded recursion on notation to capture polynomial time computable functions ($FP$). Later on, several complexity classes have …

A review of the Markov model of life insurance with a view to surplus
Oytun Ha\c{c}ar{\i}z, Torsten Kleinow, Angus S. Macdonald
https://arxiv.org/abs/2509.00011 https://

A review of the Markov model of life insurance with a view to surplus
We review Markov models of surplus in life insurance based on a counting process following Norberg (1991), uniting probabilistic theory with elements of practice largely drawn from UK experience. First, we organize models systematically based on one and two technical bases, including a suitable descriptive notation. Extending this to three technical bases to accommodate different valuation approaches leads us: (a) to expand the definition of 'technical basis' to include non-contractual cashflow…

Mathematical Analysis 1
Martin Klazar
https://arxiv.org/abs/2508.19405 https://arxiv.org/pdf/2508.19405

Mathematical Analysis 1
Preliminary version of a course in univariate real analysis, with 14 chapters and 1 appendix (Ch1--Ch8 complete at present). 1. Infinite sums. Real numbers; 2. Limits of sequences and subsequences; 3. Arithmetic of limits. AK series; 4. Infinite series. Elementary functions; 5. Limits of functions. Asymptotic notation; 6. Continuous functions; 7. Derivatives; 8. Applications of mean value theorems; 9. Taylor polynomials and series. Real analytic functions; 10. Primitives of uniformly continuous…

Bayesian unanchored additive models for component network meta-analysis
Augustine Wigle, Audrey B\'eliveau
https://arxiv.org/abs/2507.16047 https://

Bayesian unanchored additive models for component network meta-analysis
Component network meta-analysis (CNMA) models are an extension of standard network meta-analysis (NMA) models which account for the use of multicomponent treatments in the network. This article contributes innovatively to several statistical aspects of CNMA. First, by introducing a unified notation, we establish that currently available methods differ in the way they assume additivity, an important distinction that has been overlooked so far in the literature. In particular, one model uses a mo…

Vevo2: Bridging Controllable Speech and Singing Voice Generation via Unified Prosody Learning
Xueyao Zhang, Junan Zhang, Yuancheng Wang, Chaoren Wang, Yuanzhe Chen, Dongya Jia, Zhuo Chen, Zhizheng Wu
https://arxiv.org/abs/2508.16332

Vevo2: Bridging Controllable Speech and Singing Voice Generation via Unified Prosody Learning
Controllable human voice generation, particularly for expressive domains like singing, remains a significant challenge. This paper introduces Vevo2, a unified framework for controllable speech and singing voice generation. To tackle issues like the scarcity of annotated singing data and to enable flexible controllability, Vevo2 introduces two audio tokenizers: (1) a music-notation-free prosody tokenizer that captures prosody and melody from speech, singing, and even instrumental sounds, and (2)…