Tootfinder

DJI Osmo Action 6: Actionkamera mit variabler Blende
Die Actioncam DJI Osmo Action 6 kommt mit einem 1/1,1-Zoll-Quadratsensor, der hohe Bildqualität verspricht. Die Blende lässt sich von f/2,0 – f/4,0 variieren.
https:/…

Unser zweierlei Maß bei #Enteignung:
Super böse, wenn damit sichere Radwege gebaut werden. Privateigentum ist dann ein hohes Gut.
Super toll, wenn man damit auf der grünen Wiese Neubaugebiete erschließen will.
Im Ort Rastorf beschließt der Rat aus zwei lokalen Listen und CDU einstimmig bei einer Enthaltung ein Enteignungsverfahren, um ein Neubaugebiet zu erschließen, obwohl di…

Enteignung in Rastorf? „Selbst wenn ich 80.000 Euro bekäme, ich wäre nicht käuflich“
Silke Wilde soll ihr Grundstück verkaufen. Die Rastorferin besitzt 267 Quadratmeter auf dem Düsternbrook, über den die Gemeinde ein Baugebiet erschließen möchte. Doch Silke Wilde wehrt sich wie eine Löwin – auch gegen eine mögliche Enteignung.

London is establishing itself as a center for quantitative finance; filings show trading firms XTX, Qube, and Quadrature each made £1B revenue in the past year (Financial Times)
https://www.ft.com/content/8a6502c3-f244-4b61-880b-b20cf03299cc

Heuristic Bundle Upper Bound Based Polyhedral Bundle Method for Semidefinite Programming
Zilong Cui, Ran Gu
https://arxiv.org/abs/2510.12374 https://arxiv.…

Heuristic Bundle Upper Bound Based Polyhedral Bundle Method for Semidefinite Programming
Semidefinite programming (SDP) is a fundamental class of convex optimization problems with diverse applications in mathematics, engineering, machine learning, and related disciplines. This paper investigates the application of the polyhedral bundle method to standard SDPs. The basic idea of this method is to approximate semidefinite constraints using linear constraints, and thereby transform the SDP problem into a series of quadratic programming subproblems. However, the number of linear constr…

Monte Carlo quasi-interpolation of spherical data
Zhengjie Sun, Mengyuan Lv, Xingping Sun
https://arxiv.org/abs/2510.12027 https://arxiv.org/pdf/2510.12027…

Monte Carlo quasi-interpolation of spherical data
We establish a deterministic and stochastic spherical quasi-interpolation framework featuring scaled zonal kernels derived from radial basis functions on the ambient Euclidean space. The method incorporates both quasi-Monte Carlo and Monte Carlo quadrature rules to construct easily computable quasi-interpolants, which provide efficient approximation to Sobolev-space functions for both clean and noisy data. To enhance the approximation power and robustness of our quasi-interpolants, we develop a…

The Constant Speed Schedule for Adiabatic State Preparation: Towards Quadratic Speedup without Prior Spectral Knowledge
Mancheon Han, Hyowon Park, Sangkook Choi
https://arxiv.org/abs/2510.01923

The Constant Speed Schedule for Adiabatic State Preparation: Towards Quadratic Speedup without Prior Spectral Knowledge
The efficiency of adiabatic quantum evolution is governed by the adiabatic evolution time, \(T\), which depends on the minimum energy gap, \(Δ\). For a generic schedule, \(T\) typically scales as \(Δ^{-2}\), whereas the rigorous lower bound is \(\mathcal{O}(Δ^{-1})\). This indicates the potential for a quadratic speedup through the adiabatic schedule construction. Here, we introduce the constant speed schedule, which traverses the adiabatic path of the eigenstate at a uniform rate. We first …

Mit dem neuen #Solarthermiepark Au setzt #Tübingen ein starkes Zeichen für die #Wärmewende.
Auf 23.200 Quadratmetern erzeugt die Anlage jährlich rund 6 Millionen kWh

Sonne ab sofort Partnerin der Tübinger Wärmewende: Stadtwerke weihen Solarthermie-Park Au ein
Drittgrößte Anlage Deutschlands auf 23.000 Quadratmetern | Die Stadtwerke Tübingen (swt) haben jetzt eine der denkbar energiegeladensten Partnerinnen an ihrer Seite: Die Sonne. Sie sorgt ab sofort jährlich für sechs Millionen Kilowattstunden klimafreundliche Fernwärme. Die erzeugte Wärme kann viele Haushalte versorgen, die an das Fernwärmenetz angeschlossen sind. Die erste Solarthermie-Freiflächenanlage der swt ist gleichzeitig ein wichtiger Baustein für die Fernwärmetransformat…

Quadratic equations of tangent varieties via four-way tensors of linear forms
Junho Choe
https://arxiv.org/abs/2510.01908 https://arxiv.org/pdf/2510.01908

Quadratic equations of tangent varieties via four-way tensors of linear forms
In the present paper we construct quadratic equations and linear syzygies for tangent varieties using 4-way tensors of linear forms and generalize this method to higher secant varieties of higher osculating varieties. Such equations extend the classical determinantal ones of higher secant varieties and span all the equations of the same degree for smooth projective curves completely embedded by sufficiently positive line bundles, proving a variant of the Eisenbud-Koh-Stillman conjecture on dete…

ClustViT: Clustering-based Token Merging for Semantic Segmentation
Fabio Montello, Ronja G\"uldenring, Lazaros Nalpantidis
https://arxiv.org/abs/2510.01948 https://

ClustViT: Clustering-based Token Merging for Semantic Segmentation
Vision Transformers can achieve high accuracy and strong generalization across various contexts, but their practical applicability on real-world robotic systems is limited due to their quadratic attention complexity. Recent works have focused on dynamically merging tokens according to the image complexity. Token merging works well for classification but is less suited to dense prediction. We propose ClustViT, where we expand upon the Vision Transformer (ViT) backbone and address semantic segmen…

A Sequential Quadratic Programming Perspective on Optimal Control
Abhijeet, Suman Chakravorty
https://arxiv.org/abs/2510.03475 https://arxiv.org/pdf/2510.0…

A Sequential Quadratic Programming Perspective on Optimal Control
This paper offers a unified perspective on different approaches to the solution of optimal control problems through the lens of constrained sequential quadratic programming. In particular, it allows us to find the relationships between Newton's method, the iterative LQR (iLQR), and Differential Dynamic Programming (DDP) approaches to solve the problem. It is shown that the iLQR is a principled SQP approach, rather than simply an approximation of DDP by neglecting the Hessian terms, to solve opt…