Tootfinder

The international courier DHL on Friday joined other European mail carriers that have put temporary restrictions on sending packages to the United States
-- because of Trump’s executive order that eliminates an exemption on duties on cheap imported goods.
The temporary halt by DHL’s German parcel service, and its domestic mail service, Deutsche Post, covers commercial shipments originating in Germany to consumers in the United States.
The company will continue to send privat…

Fearing Customs Chaos, DHL Joins Others in Suspending U.S. Shipments
The halt by one of the world’s largest couriers comes after President Trump eliminated an exemption on tariffs levied on imported goods valued under $800.

Risikomanagement und Resilienz in der IT-Sicherheit: IT-Sicherheitstag Dortmund
Am 16. September bietet die eintägige Konferenz an der FH Dortmund wieder spannende Inhalte für Forschung und Wirtschaft: Von Hacking bis LLM-Angriffen.

Russia resumes stolen grain shipments from occupied Ukrainian territories to Syria: https://benborges.xyz/2025/08/19/russia-resumes-stolen-grain-shipments.html

A result on spanning trees with bounded total excess
Sizhong Zhou
https://arxiv.org/abs/2507.15139 https://arxiv.org/pdf/2507.15139…

A result on spanning trees with bounded total excess
Let $G$ be a connected graph and $T$ a spanning tree of $G$. Let $ρ(G)$ denote the adjacency spectral radius of $G$. The $k$-excess of a vertex $v$ in $T$ is defined as $\max\{0,d_T(v)-k\}$. The total $k$-excess $\mbox{te}(T,k)$ is defined by $\mbox{te}(T,k)=\sum\limits_{v\in V(T)}{\max\{0,d_T(v)-k\}}$. A tree $T$ is said to be a $k$-tree if $d_T(v)\leq k$ for any $v\in V(T)$, that is to say, the maximum degree of a $k$-tree is at most $k$. In fact, $T$ is a spanning $k$-tree if and only if $\…

Woohoo I just paid $4326 in tariffs on a $14k product shipment. That won't affect our margin at all 🤬🤬🤬

Innerhalb weniger Tage im August 2025 haben #Waldbrände in #Spanien die höchsten jährlichen #Feueremissionen seit Beginn der

FAMST: Fast Approximate Minimum Spanning Tree Construction for Large-Scale and High-Dimensional Data
Mahmood K. M. Almansoori, Miklos Telek
https://arxiv.org/abs/2507.14261

FAMST: Fast Approximate Minimum Spanning Tree Construction for Large-Scale and High-Dimensional Data
We present Fast Approximate Minimum Spanning Tree (FAMST), a novel algorithm that addresses the computational challenges of constructing Minimum Spanning Trees (MSTs) for large-scale and high-dimensional datasets. FAMST utilizes a three-phase approach: Approximate Nearest Neighbor (ANN) graph construction, ANN inter-component connection, and iterative edge refinement. For a dataset of $n$ points in a $d$-dimensional space, FAMST achieves $\mathcal{O}(dn \log n)$ time complexity and $\mathcal{O}…

Submanifolds with boundary in sub-Riemannian Heisenberg Groups
Marco Di Marco, Davide Vittone
https://arxiv.org/abs/2508.15634 https://arxiv.org/pdf/2508.1…

Submanifolds with boundary in sub-Riemannian Heisenberg Groups
We discuss the notion of submanifolds with boundary with intrinsic $C^1$ regularity in sub-Riemannian Heisenberg groups and we provide some examples. Eventually, we present a Stokes' Theorem for such submanifolds involving the integration of Rumin's differential forms in Heisenberg groups.

heise | Smarte KI-Brille für Sportler: Oakley Meta Vanguard im Test
Die Oakley Meta Vanguard soll KI-Brillen unter Sportlern etablieren – mit spannenden Kamera-Funktionen sowie der Integration von Garmin und Strava.

Calibrated submanifolds with flat normal bundles
W. Jacob Ogden
https://arxiv.org/abs/2508.14406 https://arxiv.org/pdf/2508.14406

Calibrated submanifolds with flat normal bundles
We show that submanifolds of Euclidean space which are calibrated by a constant-coefficient differential form and have flat normal bundles are planes. In fact, in a Riemannian manifold equipped with a parallel calibration, a calibrated submanifold subject to the condition that all shape operators commute is totally geodesic.