Tootfinder

Decoding TCP SYN for Stronger Network Security
https://www.netscout.com/blog/asert/decoding-tcp-syn-stronger-network-security
A brief look at TCP SYNs observed by low impact honeypots. I mainly sought evidence for source address spoofing and a…

Decoding TCP SYN for Stronger Network Security | NETSCOUT
Analyzing transmission control protocol (TCP) SYN segments, the initial step in th

Asana names LaunchDarkly CEO Dan Rogers as its new CEO starting on July 21, replacing co-founder Dustin Moskovitz, who is retiring and will remain board chair (Jordan Novet/CNBC)
https://www.cnbc.com/2025/06/25/asana-ceo-dan-rogers-replace-dustin…

Asana picks Dan Rogers, formerly of ServiceNow, to replace CEO Dustin Moskovitz
Dustin Moskovitz, the largest individual owner of Asana stock, will stick around as the software company's board chair.

Eigenvalue bounds for distance-edge colorings
Aida Abiad, Luuk Reijnders
https://arxiv.org/abs/2506.20976 https://arxiv.org/pdf/2506.…

Eigenvalue bounds for distance-edge colorings
For a fixed positive integer $t$, we consider the graph colouring problem in which edges at distance at most $t$ are given distinct colours. We obtain sharp lower bounds for the distance-$t$ chromatic index, the least number of colours necessary for such a colouring. Our bounds are of algebraic nature; they depend on the eigenvalues of the line graph and on a polynomial which can be found using integer linear programming methods. We show several graph classes that attain equality for our bounds…

Deciding Robust Instances of an Escape Problem for Dynamical Systems in Euclidean Space
Eike Neumann
https://arxiv.org/abs/2506.21481 https://

Deciding Robust Instances of an Escape Problem for Dynamical Systems in Euclidean Space
We study the problem of deciding whether a point escapes a closed subset of $\mathbb{R}^d$ under the iteration of a continuous map $f \colon \mathbb{R}^d \to \mathbb{R}^d$ in the bit-model of real computation. We give a sound partial decision method for this problem which is complete in the sense that its halting set contains the halting set of all sound partial decision methods for the problem. Equivalently, our decision method terminates on all problem instances whose answer is robust under a…

Equivalence of Landscape and Erosion Distances for Persistence Diagrams
Cagatay Ayhan, Tom Needham
https://arxiv.org/abs/2506.21488 https://

Equivalence of Landscape and Erosion Distances for Persistence Diagrams
This paper establishes connections between three of the most prominent metrics used in the analysis of persistence diagrams in topological data analysis: the bottleneck distance, Patel's erosion distance, and Bubenik's landscape distance. Our main result shows that the erosion and landscape distances are equal, thereby bridging the former's natural category-theoretic interpretation with the latter's computationally convenient structure. The proof utilizes the category with a flow framework of d…

Nach schonungsloser Hirnvernichtung
Probiert' es Uwe mit der Dichtung,
Doch die Dichtung wollte nicht
Und so blieb Uwe nicht ganz dicht.

Quantum Wasserstein distances for quantum permutation groups
Anshu, David Jekel, Therese Basa Landry
https://arxiv.org/abs/2505.19269 https://

Quantum Wasserstein distances for quantum permutation groups
We seek an analog for the quantum permutation group $S_n^+$ of the normalized Hamming distance for permutations. We define three distances on the tracial state space of $C(S_n^+)$ that generalize the $L^1$-Wasserstein distance of probability measures on $S_n$ equipped with the normalized Hamming metric, for which we demonstrate basic metric properties, subadditivity under convolution, and density of the Lipschitz elements in the $\mathrm{C}^{\ast}$-algebra.

Learning-Based Distance Estimation for 360{\deg} Single-Sensor Setups
Yitong Quan, Benjamin Kiefer, Martin Messmer, Andreas Zell
https://arxiv.org/abs/2506.20586

Learning-Based Distance Estimation for 360° Single-Sensor Setups
Accurate distance estimation is a fundamental challenge in robotic perception, particularly in omnidirectional imaging, where traditional geometric methods struggle with lens distortions and environmental variability. In this work, we propose a neural network-based approach for monocular distance estimation using a single 360° fisheye lens camera. Unlike classical trigonometric techniques that rely on precise lens calibration, our method directly learns and infers the distance of objects from …

#TIL: Zeugma. n. The use of a word to modify or govern two or more words usually in such a manner that it applies to each word in a different sense.
#English #vocabulary

In the distant hills
Someone longingly admires
The distant valleys.
#dailyhaikuprompt - hills
#haiku
#poem