Tootfinder

Not upgrading all the SQS code using boto.sqs.Message to boto3 has finally bitten me on the ass as boto just doesn't work on Python 3.12 which is what I'm moving to.
And I'm moving it because 3.7 has become the 2.7 of Python 3. Whilst I originally targeted 3.9 that is slipping away too.
There is a lot of SQS going on, not just pipelining but logging. The logging is kind of Schroedinger logging as I don't bother with it unless I need to.

Schwarzmarkthändler wollen mit Bots an Tickets kommen
Umgangssprachlich ist von "Ticket-Scalping" die Rede. Eventim-Chef Schulenberg berichtet, Kaufversuche von Computerprogrammen gebe es bei allen Veranstaltungen.

This story seems to be slipping between the cracks.
Apparently the Air Force has decided to undertake the conversion of that bribe 747 to FFOTUS - an amount that will probably well exceed a $billion or far more - under cover of a classified project to do something else.
This is a clear violation of the US Anti-deficiency act. It is theft of taxpayer money. And it violates the requirement that money only be spent after appropriation by Congress.
i have not seen any journal…

What Will It Cost to Renovate Trump’s ‘Free’ Air Force One? Don’t Ask.
To hide the cost of renovating the plane Qatar donated to President Trump, the Air Force appears to have tucked it inside an over-budget, behind-schedule nuclear modernization program.

Automated Catamorphism Synthesis for Solving Constrained Horn Clauses over Algebraic Data Types
Hiroyuki Katsura, Naoki Kobayashi, Ken Sakayori, Ryosuke Sato
https://arxiv.org/abs/2507.20726

Automated Catamorphism Synthesis for Solving Constrained Horn Clauses over Algebraic Data Types
We propose a novel approach to satisfiability checking of Constrained Horn Clauses (CHCs) over Algebraic Data Types (ADTs). CHC-based automated verification has gained considerable attention in recent years, leading to the development of various CHC solvers. However, existing solvers for CHCs over ADTs are not fully satisfactory, due to their limited ability to find and express models involving inductively defined functions/predicates (e.g., those about the sum of list elements). To address thi…

The Augmented Mixing Method: Computing High-Accuracy Primal-Dual Solutions to Large-Scale SDPs via Column Updates
Daniel Brosch, Jan Schwiddessen, Angelika Wiegele
https://arxiv.org/abs/2507.20386

The Augmented Mixing Method: Computing High-Accuracy Primal-Dual Solutions to Large-Scale SDPs via Column Updates
The Burer-Monteiro factorization has become a powerful tool for solving large-scale semidefinite programs (SDPs), enabling recently developed low-rank solvers to tackle problems previously beyond reach. However, existing methods are typically designed to prioritize scalability over solution accuracy. We introduce the Augmented Mixing Method, a new algorithm that combines the Burer-Monteiro factorization with an inexact augmented Lagrangian framework and a block coordinate descent scheme. Our me…

Inverse scattering transform via affine map: applications to high-speed nonlinear optical communications
Ilia Kuk, Ildar R. Gabitov
https://arxiv.org/abs/2507.20470 https://

Inverse scattering transform via affine map: applications to high-speed nonlinear optical communications
This work present an affine map approximation for solving the inverse scattering problem related to the nonlinear Schrödinger model of signal propagation in high-speed coherent optical communication. Numerical simulations indicate that accurate recovery of the transmitted bit sequence can be achieved using only the continuous part of the Lax spectrum at the fiber output, thereby allowing the discrete (soliton) spectrum to be disregarded. We observed that the numerically evaluated rank of the r…

FHSTP@EXIST 2025 Benchmark: Sexism Detection with Transparent Speech Concept Bottleneck Models
Roberto Labadie-Tamayo, Adrian Jaques B\"ock, Djordje Slijep\v{c}evi\'c, Xihui Chen, Andreas Babic, Matthias Zeppelzauer
https://arxiv.org/abs/2507.20924

FHSTP@EXIST 2025 Benchmark: Sexism Detection with Transparent Speech Concept Bottleneck Models
Sexism has become widespread on social media and in online conversation. To help address this issue, the fifth Sexism Identification in Social Networks (EXIST) challenge is initiated at CLEF 2025. Among this year's international benchmarks, we concentrate on solving the first task aiming to identify and classify sexism in social media textual posts. In this paper, we describe our solutions and report results for three subtasks: Subtask 1.1 - Sexism Identification in Tweets, Subtask 1.2 - Source…

KOALA: a Configurable Tool for Collecting IDE Data When Solving Programming Tasks
Daniil Karol, Elizaveta Artser, Ilya Vlasov, Yaroslav Golubev, Hieke Keuning, Anastasiia Birillo
https://arxiv.org/abs/2506.21266

KOALA: a Configurable Tool for Collecting IDE Data When Solving Programming Tasks
Collecting data of students solving programming tasks is incredibly valuable for researchers and educators. It allows verifying that the students correctly apply the features and concepts they are taught, or finding students' misconceptions. However, existing data collection tools have limitations, e.g., no control over the granularity of the collected code, not collecting the specific events of the programming environment used, and overall being hard to configure. To overcome these limitatio…

Fundamental diagram constrained dynamic optimal transport via proximal splitting methods
Anqi Dong, Karl Henrik Johansson, Johan Karlsson
https://arxiv.org/abs/2507.20717 https:…

Fundamental diagram constrained dynamic optimal transport via proximal splitting methods
Optimal transport has recently been brought forward as a tool for modeling and efficiently solving a variety of flow problems, such as origin-destination problems and multi-commodity flow problems. Although the framework has shown to be effective for many large scale flow problems, the formulations typically lack dynamic properties used in common traffic models, such as the Lighthill-Whitham-Richards model. In this work, we propose an optimal transport framework that includes dynamic constraint…

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

Pareto Fronts for Compositionally Solving String Diagrams of Parity Games
Open parity games are proposed as a compositional extension of parity games with algebraic operations, forming string diagrams of parity games. A potential application of string diagrams of parity games is to describe a large parity game with a given compositional structure and solve it efficiently as a divide-and-conquer algorithm by exploiting its compositional structure. Building on our recent progress in open Markov decision processes, we introduce Pareto fronts of open parity games, offeri…