Tootfinder

Ich bin ja gleich mehrfach nicht die Zielgruppe: Aber bei $500/Monat für AI-unterstütztes Matching muss man wohl sehr ähhh verzweifelt sein …
Grindr trials premium $500 per month plan to become 'AI-first' app https://www.thepinknews.com/2026/02/09/gri

Approximate Cartesian Tree Matching with Substitutions
Panagiotis Charalampopoulos, Jonas Ellert, Manal Mohamed
https://arxiv.org/abs/2602.08570 https://arxiv.org/pdf/2602.08570 https://arxiv.org/html/2602.08570
arXiv:2602.08570v1 Announce Type: new
Abstract: The Cartesian tree of a sequence captures the relative order of the sequence's elements. In recent years, Cartesian tree matching has attracted considerable attention, particularly due to its applications in time series analysis. Consider a text $T$ of length $n$ and a pattern $P$ of length $m$. In the exact Cartesian tree matching problem, the task is to find all length-$m$ fragments of $T$ whose Cartesian tree coincides with the Cartesian tree $CT(P)$ of the pattern. Although the exact version of the problem can be solved in linear time [Park et al., TCS 2020], it remains rather restrictive; for example, it is not robust to outliers in the pattern.
To overcome this limitation, we consider the approximate setting, where the goal is to identify all fragments of $T$ that are close to some string whose Cartesian tree matches $CT(P)$. In this work, we quantify closeness via the widely used Hamming distance metric. For a given integer parameter $k>0$, we present an algorithm that computes all fragments of $T$ that are at Hamming distance at most $k$ from a string whose Cartesian tree matches $CT(P)$. Our algorithm runs in time $\mathcal O(n \sqrt{m} \cdot k^{2.5})$ for $k \leq m^{1/5}$ and in time $\mathcal O(nk^5)$ for $k \geq m^{1/5}$, thereby improving upon the state-of-the-art $\mathcal O(nmk)$-time algorithm of Kim and Han [TCS 2025] in the regime $k = o(m^{1/4})$.
On the way to our solution, we develop a toolbox of independent interest. First, we introduce a new notion of periodicity in Cartesian trees. Then, we lift multiple well-known combinatorial and algorithmic results for string matching and periodicity in strings to Cartesian tree matching and periodicity in Cartesian trees.
toXiv_bot_toot

📰 Forschung kann Leben retten oder verlängern – durch Warnungen vor #Risiken und Fortschritte in #Klimaanpassung, #Energiewende und

KlimaCrew
Ich informiere über Zukunftsthemen, um Menschen vor Risiken zu warnen und Fortschritte sichtbar zu machen.

°laces

Vanhat metsät sitovat hiiltä ja ylläpitävät hiilivarastoja https://www.sttinfo.fi/tiedote/71936708/vanhat-metsat-sitovat-hiilta-ja-yllapitavat-hiilivarastoja?lang=fi

Vanhat metsät sitovat hiiltä ja ylläpitävät hiilivarastoja | Suomen ympäristökeskus
Luonnontilaisten, ikärakenteeltaan vanhojen metsien hiilensidontakyvystä on saatu uutta tutkimustietoa. Havainnot osoittavat, että vanhoilla metsillä on tärkeä rooli ilmastonmuutoksen hillinnässä. Lisäksi ne ovat merkittäviä luonnon monimuotoisuuden turvaajia.

🎁 Shipping damage, measured in real time: How wireless origami cushioning could improve logistics
https://techxplore.com/news/2026-02-shipping-real-wireless-origami-cushioning.html

Shipping damage, measured in real time: How wireless origami cushioning could improve logistics
Origami, the traditional Japanese art of paper folding, has received considerable attention in engineering. By applying paper-folding principles, researchers have created compact structures that are flexible, lightweight, and reconfigurable across aerospace, medicine, and robotics.

📰 Forschung kann Leben retten oder verlängern – durch Warnungen vor #Risiken und Fortschritte in #Klimaanpassung, #Energiewende und

KlimaCrew
Ich informiere über Zukunftsthemen, um Menschen vor Risiken zu warnen und Fortschritte sichtbar zu machen.

Recently I've traveled next to a person who were apparently studying pseudomedicine while discussing with a friend. She was studying, or rather memorizing, some utter bullshit. She already started practicing too, though she wasn't planning to use homeopathy, because she was afraid to. She complained that her boyfriend (?) didn't take all the supplements she's prescribing him. In her own health problems she stopped taking real medicine already. She also discussed their common friends, making comments related to their Chinese zodiac horoscopes.
No, I'm not going to have an open mind in these matters. And I'm definitely going to speak up when I see that some asshole scammers are making money by creating pseudouniversities and teaching people bullshit.

Neighborhood-Aware Graph Labeling Problem
Mohammad Shahverdikondori, Sepehr Elahi, Patrick Thiran, Negar Kiyavash
https://arxiv.org/abs/2602.08098 https://arxiv.org/pdf/2602.08098 https://arxiv.org/html/2602.08098
arXiv:2602.08098v1 Announce Type: new
Abstract: Motivated by optimization oracles in bandits with network interference, we study the Neighborhood-Aware Graph Labeling (NAGL) problem. Given a graph $G = (V,E)$, a label set of size $L$, and local reward functions $f_v$ accessed via evaluation oracles, the objective is to assign labels to maximize $\sum_{v \in V} f_v(x_{N[v]})$, where each term depends on the closed neighborhood of $v$. Two vertices co-occur in some neighborhood term exactly when their distance in $G$ is at most $2$, so the dependency graph is the squared graph $G^2$ and $\mathrm{tw}(G^2)$ governs exact algorithms and matching fine-grained lower bounds. Accordingly, we show that this dependence is inherent: NAGL is NP-hard even on star graphs with binary labels and, assuming SETH, admits no $(L-\varepsilon)^{\mathrm{tw}(G^2)}\cdot n^{O(1)}$-time algorithm for any $\varepsilon>0$. We match this with an exact dynamic program on a tree decomposition of $G^2$ running in $O\!\left(n\cdot \mathrm{tw}(G^2)\cdot L^{\mathrm{tw}(G^2) 1}\right)$ time. For approximation, unless $\mathsf{P}=\mathsf{NP}$, for every $\varepsilon>0$ there is no polynomial-time $n^{1-\varepsilon}$-approximation on general graphs even under the promise $\mathrm{OPT}>0$; without the promise $\mathrm{OPT}>0$, no finite multiplicative approximation ratio is possible. In the nonnegative-reward regime, we give polynomial-time approximation algorithms for NAGL in two settings: (i) given a proper $q$-coloring of $G^2$, we obtain a $1/q$-approximation; and (ii) on planar graphs of bounded maximum degree, we develop a Baker-type polynomial-time approximation scheme (PTAS), which becomes an efficient PTAS (EPTAS) when $L$ is constant.
toXiv_bot_toot