Tootfinder

Foxconn reports Q3 revenue of $66.3B, in line with estimates, net profit up 17% YoY to $1.86B, vs. $1.63B exp., says it expects significant YoY growth in Q4 (CNBC)
https://www.cnbc.com/2025/11/12/foxconn-hon-hai-third-quarter…

Nvidia supplier Foxconn third-quarter profit beats expectations, rising 17% on AI demand
Foxconn, the world's largest contract electronics maker, reported Wednesday that its third-quarter profit jumped 17% from a year earlier.

Space Complexity Dichotomies for Subgraph Finding Problems in the Streaming Model
Yu-Sheng Shih, Meng-Tsung Tsai, Yen-Chu Tsai, Ying-Sian Wu
https://arxiv.org/abs/2602.08002 https://arxiv.org/pdf/2602.08002 https://arxiv.org/html/2602.08002
arXiv:2602.08002v1 Announce Type: new
Abstract: We study the space complexity of four variants of the standard subgraph finding problem in the streaming model. Specifically, given an $n$-vertex input graph and a fixed-size pattern graph, we consider two settings: undirected simple graphs, denoted by $G$ and $H$, and oriented graphs, denoted by $\vec{G}$ and $\vec{H}$. Depending on the setting, the task is to decide whether $G$ contains $H$ as a subgraph or as an induced subgraph, or whether $\vec{G}$ contains $\vec{H}$ as a subgraph or as an induced subgraph. Let Sub$(H)$, IndSub$(H)$, Sub$(\vec{H})$, and IndSub$(\vec{H})$ denote these four variants, respectively.
An oriented graph is well-oriented if it admits a bipartition in which every arc is oriented from one part to the other, and a vertex is non-well-oriented if both its in-degree and out-degree are non-zero. For each variant, we obtain a complete dichotomy theorem, briefly summarized as follows.
(1) Sub$(H)$ can be solved by an $\tilde{O}(1)$-pass $n^{2-\Omega(1)}$-space algorithm if and only if $H$ is bipartite.
(2) IndSub$(H)$ can be solved by an $\tilde{O}(1)$-pass $n^{2-\Omega(1)}$-space algorithm if and only if $H \in \{P_3, P_4, co\mbox{-}P_3\}$.
(3) Sub$(\vec{H})$ can be solved by a single-pass $n^{2-\Omega(1)}$-space algorithm if and only if every connected component of $\vec H$ is either a well-oriented bipartite graph or a tree containing at most one non-well-oriented vertex.
(4) IndSub$(\vec{H})$ can be solved by an $\tilde{O}(1)$-pass $n^{2-\Omega(1)}$-space algorithm if and only if the underlying undirected simple graph $H$ is a $co\mbox{-}P_3$.
toXiv_bot_toot

Blocked by yet another dude I proved wrong with #Mathematics 🙄 and a self-proclaimed "Mathematician" no less. It's incredible how people can't deal with finding out they were wrong... just learn from it and move on, seriously. It's not that hard!
BTW here is the proof he couldn't handle

Es stimmt einfach, was man sagt: die #Grüne|n sind wie eine Banane: Erst grün, dann gelb, dann schwarz.
Bürgerrechtspartei my ass... #Palantir
http…

Netanyahu Joins Germany's AfD, Far-right Europeans in Backing Orbšn as Hungary Campaign Begins (Zen Reading/Haaretz)
https://www.haaretz.com/israel-news/2026-01-11/ty-article/.premium/netanyahu-joins-germanys-afd-far-right-europeans-in-backing-orban-as-campaign-begins/0000019b-ae1f-da2a-abdf-ee3f5b0c0000
http://www.memeorandum.com/260111/p44#a260111p44

Hoe dat gaat werken?
Niet.
Maar misschien dat Evilgoz-1 het nog net langer volhoudt dan Wilders-1.
Minderheidskabinet in de maak, maar hoe dat gaat werken is nog onduidelijk https://nos.nl/l/2597638

Minderheidskabinet in de maak, maar hoe dat gaat werken is nog onduidelijk
Een minderheid betekent dat zo'n kabinet voor elk voorstel en elke begroting zijn best moet doen om andere partijen te overtuigen.

Oh. Parece que morreu o John Varley.
Um autor de FC americano de segunda linha com alguns livros publicados em Portugal. Toda a série Gaea (uma trilogia que a Europa-América publicou em 6 volumes) é muito boa.
https://fed.brid.gy/r/https://bsky.app

Jesse Sheidlower (@jessesword.com)
RIP John Varley. We have a lot of quotations from him in the Historical #Dictionary of #ScienceFiction, and he is credited as being the originator of four terms: cryosuspension, cyborg (v.), cyborged, and nearside (n.): https://sfdictionary.com/author/59/john-varley?firstquotes=1 [contains quote post or other embedded content]

#bedfellows The US sided with Saudi Arabia, Russia and Iran to block part of a UN report about the dire state of the planet "because it called for phasing out fossil fuels, switching to clean energy and reducing plastics."

U.S. Helped to Weaken Report at U.N. Environment Talks, Participants Say
American officials joined Russia, Saudi Arabia and Iran in objecting to language on fossils fuels, biodiversity and plastics in a report that was three years in the making.

POSTDOCTORAL POSITION> University of Toronto, Department for the Study of Religion & The Robert H.N. Ho Family Foundation Centre for Buddhist Studies https://networks.h-net.org/group/announcements/20140643/postdoct…

🇺🇦 #NowPlaying on BBCRadio3's #ClassicalLive
Ralph Vaughan Williams, Leonor Bonilla, Damišn del Castillo, Coro de Radio Televisión Española, Orquesta Sinfónica de Radio Televisión Española & Christoph König:
🎵 Symphony No.1, 'A Sea Symphony'
#RalphVaughanWilliams

Most of the math I know beyond "business calculus" is math I picked up in grad school (economics) or taught myself later. I'm constantly reminded there are gaps in my knowledge. For example, trigonometry doesn't come up much in economics or statistics. (1/n)
#math #learning

“In Trump’s war on global justice, court staff and U.N. face terrorist‑grade sanctions … Trump’s sanctions on U.N. expert Francesca Albanese and the International Criminal Court froze assets and disrupted war crimes investigations.”
https://www.reut…

Nexperia's former CEO Frans Scheper says Wingtech, which bought the Dutch chipmaker in 2019, quickly plotted to send Nexperia's research and IP to China (New York Times)
https://www.nytimes.com/2025/12/10/world/a

Chip Company Plotted to Send Technology to China, Ex-C.E.O. Says
The former chief executive of Nexperia, a Dutch chipmaker, said Dutch officials had known for years that the company’s Chinese owner sought to move its technology to China.

aktuelles #Wetter #Behrendorf #Wische 12-12-2025 03:55
Temperatur: (min: 1,7C) 1,7C (max: 4,5C)
Feuchte: 99%
Luftdruck: 1022,1 hPa (gleichbleibend)
Windrichtung: N/A Grad
Wi…

OK, der Zahnarzt hat sich von seiner Frau getrennt und da musste der Name der Praxis geändert werden. Zeit also, die sogenannte professionelle Zahnreinigung um 25% teuerer zu machen, aber außerdem muss ich alle Einwilligungen nochmal unterschreiben und werde begrüßt mit „Ich bräuchte dann nochmal ein paar Unterschriften“.
🧵über individuelle vs. globale “Problemlösung” 1/n

Le fisc, en voulant cacher aux tribunaux qu’il n’appliquait pas correctement le bouclier voté par le peuple, s’est donc retrouvé avec des grosses fortunes taxées Š… zéro.
Que savait Broulis? Il se comprenait comme expert en fisc, donc il serait incompréhensible s'il n'avait pas une compréhension profonde de la mécanique du système
https://www.letemps.ch/suisse/vaud/scandale-du-bouclier-fiscal-pascal-broulis-pouvait-il-vraiment-ignorer-les-irregularites-avant-2019

Une mise en examen d'un des éducateurs de la secte OKC et une instruction qui n'en finit pas, voilŠ le destin funeste des victimes d'OKC. Elles ont besoin d'aide pour que la justice française leur accorde la priorité!
https://chardonsbleus.org/une-enquete-

Une enquête révèle les dérives du bouddhisme tibétain
1) Le centre de la communauté OKC de Castellane (Alpes-de-Haute-Provence).2) Ricardo Mendes, porte-parole des victimes, devant la Cour d’appel de Liège, en ...

The year starts with a new competition case re. public EV charging prices in Italy. The competition authority has decided to conduct a further investigation into A2A Mobility, as prices charged to others were higher than in their own app.
https://www.agcm.it/pubblicazioni/bolletti<…

Replaced article(s) found for physics.atom-ph. https://arxiv.org/list/physics.atom-ph/new
[1/1]:
- Demonstration and frequency noise characterization of a 17 $\mu$m quantum cascade laser
M Manceau, T E Wall, H Philip, A N Baranov, Olivier Lopez, M R Tarbutt, R Teissier, B …

The Communication Complexity of Combinatorial Auctions with Additional Succinct Bidders
Frederick V. Qiu, S. Matthew Weinberg, Qianfan Zhang
https://arxiv.org/abs/2512.06585 https://arxiv.org/pdf/2512.06585 https://arxiv.org/html/2512.06585
arXiv:2512.06585v1 Announce Type: new
Abstract: We study the communication complexity of welfare maximization in combinatorial auctions with bidders from either a standard valuation class (which require exponential communication to explicitly state, such as subadditive or XOS), or arbitrary succinct valuations (which can be fully described in polynomial communication, such as single-minded). Although succinct valuations can be efficiently communicated, we show that additional succinct bidders have a nontrivial impact on communication complexity of classical combinatorial auctions. Specifically, let $n$ be the number of subadditive/XOS bidders. We show that for SA $\cup$ SC (the union of subadditive and succinct valuations): (1) There is a polynomial communication $3$-approximation algorithm; (2) As $n \to \infty$, there is a matching $3$-hardness of approximation, which (a) is larger than the optimal approximation ratio of $2$ for SA, and (b) holds even for SA $\cup$ SM (the union of subadditive and single-minded valuations); and (3) For all $n \geq 3$, there is a constant separation between the optimal approximation ratios for SA $\cup$ SM and SA (and therefore between SA $\cup$ SC and SA as well). Similarly, we show that for XOS $\cup$ SC: (1) There is a polynomial communication $2$-approximation algorithm; (2) As $n \to \infty$, there is a matching $2$-hardness of approximation, which (a) is larger than the optimal approximation ratio of $e/(e-1)$ for XOS, and (b) holds even for XOS $\cup$ SM; and (3) For all $n \geq 2$, there is a constant separation between the optimal approximation ratios for XOS $\cup$ SM and XOS (and therefore between XOS $\cup$ SC and XOS as well).
toXiv_bot_toot

Local Computation Algorithms for (Minimum) Spanning Trees on Expander Graphs
Pan Peng, Yuyang Wang
https://arxiv.org/abs/2602.07394 https://arxiv.org/pdf/2602.07394 https://arxiv.org/html/2602.07394
arXiv:2602.07394v1 Announce Type: new
Abstract: We study \emph{local computation algorithms (LCAs)} for constructing spanning trees. In this setting, the goal is to locally determine, for each edge $ e \in E $, whether it belongs to a spanning tree $ T $ of the input graph $ G $, where $ T $ is defined implicitly by $ G $ and the randomness of the algorithm. It is known that LCAs for spanning trees do not exist in general graphs, even for simple graph families. We identify a natural and well-studied class of graphs -- \emph{expander graphs} -- that do admit \emph{sublinear-time} LCAs for spanning trees. This is perhaps surprising, as previous work on expanders only succeeded in designing LCAs for \emph{sparse spanning subgraphs}, rather than full spanning trees. We design an LCA with probe complexity $ O\left(\sqrt{n}\left(\frac{\log^2 n}{\phi^2} d\right)\right)$ for graphs with conductance at least $ \phi $ and maximum degree at most $ d $ (not necessarily constant), which is nearly optimal when $\phi$ and $d$ are constants, since $\Omega(\sqrt{n})$ probes are necessary even for expanders. Next, we show that for the natural class of \emph{\ER graphs} $ G(n, p) $ with $ np = n^{\delta} $ for any constant $ \delta > 0 $ (which are expanders with high probability), the $ \sqrt{n} $ lower bound can be bypassed. Specifically, we give an \emph{average-case} LCA for such graphs with probe complexity $ \tilde{O}(\sqrt{n^{1 - \delta}})$.
Finally, we extend our techniques to design LCAs for the \emph{minimum spanning tree (MST)} problem on weighted expander graphs. Specifically, given a $d$-regular unweighted graph $\bar{G}$ with sufficiently strong expansion, we consider the weighted graph $G$ obtained by assigning to each edge an independent and uniform random weight from $\{1,\ldots,W\}$, where $W = O(d)$. We show that there exists an LCA that is consistent with an exact MST of $G$, with probe complexity $\tilde{O}(\sqrt{n}d^2)$.
toXiv_bot_toot

Very funny, #Sun: many of the small groups on the disk have flared in recent days - (1)4298 on the far right in this SDO HMI view https://jsoc1.stanford.edu/data/hmi/images/latest/HMI_latest_Int_4096x4096.gif from today just this morning with an X1.1: https://www.facebook.com/photo/?fbid=1260371819450012 - but the big ones 4294 (center) and 4296 (left) that had received a lot of media hype and even press releases like https://www.dlr.de/de/aktuelles/nachrichten/2025/erhoehtes-sonnensturm-risiko-dlr-beobachtet-weltraumwetter-in-echtzeit have remained completely quiet during their march over the solar disk which is coming to an end soon.

Neither #Affinity nor #Darktable seemingly support 1D LUTs, which would have been too easy and useful for my #DigitalNegative preparation tool... Instead they both insist on using only 3D LUT…

Seahawks clinch No. 1 seed, first NFC West title since 2020 with win over 49ers https://www.nfl.com/news/seahawks-clinch-no-1-seed-first-nfc-west-title-since-2020-with-win-over-49ers

La valse annuelle des bonnes surprises des comptes publics commence: Une nouvelle fois, les comptes de l’Etat de Genève seront meilleurs que prévu. Le Temps a appris qu’au lieu d’un déficit de 255,7 millions de francs, c’est un excédent d’environ 50 millions de francs que le canton a enregistré en 2025. https://www.letemps.ch/suisse/geneve/une-nouvelle-fois-les-comptes-de-l-etat-de-geneve-seront-meilleurs-que-prevus

This has allowed me to make clear something that's been at the back of my mind. Something that is at the heart of so much blind stupidity in big tech.
It's the assumption that we will change one thing and all else will be the same.
In this case, we will fire lots and lots of employees all over the world and we will make lots of profit. We're smart enough to make the AI, and we're dumb enough to think that there will only be one consequence. 1/n

Mondelēz: Sugarcoated Suffering #environment

Oreo: Defend Human Rights!
Tell Oreo-maker Mondelēz International to protect rainforests and defend human rights!

We have no clear understanding of what leverage Putin may have gained over senior levels of the U.S. government,
whether to extract state secrets or to shape decision-making
and be used for leverage on the global stage
https://mstdn.social/@NTOY/116010660849818682

A very tedious but fruitful activity for investing/trading: going back in time for a company of your choice and following stock price with replay feature in parallel with reading SEC filings and using google search tools to go back in time for the ticker and see what hits come up. 1/n

aktuelles #Wetter #Behrendorf #Wische 12-12-2025 04:55
Temperatur: (min: 1,4C) 1,5C (max: 4,5C)
Feuchte: 99%
Luftdruck: 1022,0 hPa (gleichbleibend)
Windrichtung: N/A Grad
Wi…

Ahora que a Trump le faltan dos gintonics para publicar que van a montar una operación Condor pero en Europa, ahora que se sabe que las redes sociales comerciales sólo sirven para guiar a la gente a las filias de los propietarios (muy cercanas al punto 1) y que las tecnológicas de EEUU no dudaršn en pasarse por el forro su acuerdo de licencia cuando les convenga (ver lo de Google cerrando el correo al fiscal del TPI que investigaba los crímenes de Israel para ponerle palos en las ruedas) ¿qu…

I decided it was time for another go at explaining Special Relativity.
I remain annoyed at how few people really get it, even amongst avid SF consumers, who have gotten entirely too accustomed to generations of SF writers papering over the FTL issues with technobabble, 'cause we need that galactic empire, don'tcha know.
The idea is to do this with basic geometry you knew or could have learned about in 6th grade plus a bit of algebra (up to Pythagorean Theorem, which I *d…

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

POSTDOCTORAL POSITION> University of Toronto, Department for the Study of Religion & The Robert H.N. Ho Family Foundation Centre for Buddhist Studies
https://ift.tt/0GzPZnT
Slave subjectivities in the Iberian Worlds (15th- 20th centuries) Date: October 31,…
via Input 4 RELCFP

Exceptional rains in Spain, roads, railways cut.
MAPA | Qué carreteras estšn afectadas por la borrasca Leonardo: consulta el mapa de la DGT en directo

MAPA | Qué carreteras están afectadas por la borrasca Leonardo: consulta el mapa de la DGT en directo
Hay más de un centenar de carreteras cortadas por inundaciones y desprendimientos, la mayoría localizadas en Andalucía

A cold beam of BaOH molecules using a water-vapour seeded neon gas
Ties Hendrik Fikkers, Nithesh Balasubramanian, Joost W. F. van Hofslot, Maarten C. Mooij, Hendrick L. Bethlem, Steven Hoekstra
https://arxiv.org/abs/2512.08402 https://arxiv.org/pdf/2512.08402 https://arxiv.org/html/2512.08402
arXiv:2512.08402v1 Announce Type: new
Abstract: In this paper we report on the production and characterization of a cold beam of BaOH molecules using a cryogenic buffer-gas beam source. BaOH is a highly suitable molecule for studies of the violation of fundamental symmetries, such as the search for the electron's electric dipole moment. BaOH molecules are synthesised inside the cold source through laser ablation of a barium metal target while water vapor is seeded into the neon buffer gas. The BaOH flux is significantly enhanced ($\sim$11 times) when laser-exciting the barium atoms inside the buffer-gas cell on the $^1\mathrm S_0 - ^3\mathrm P_1$ transition. A similar enhancement has been reported for other alkaline-earth(-like) monohydroxides. For typical source conditions, the molecular beam has an average velocity of $\approx180$ m/s and an intensity of $\sim 10^{9}$ molecules s$^{-1}$ in $N=1$, which is comparable to that of cryogenic BaF beams.
toXiv_bot_toot

Barry N. often writes about faith, but not the way you might think.
#faith

En el enlace siguiente podršn encontrar los títulos de las choras generadas por su servidor, lista en constante actualización
https://docs.google.com/spreadsheets/d/14qq_PdNtaPIJQgJunnmln9RSak2tnuk2-LqJjSQN0fg/edit?pli=1&gid=0…

Op BS brengt Micheal Persson even z'n column van 25 januari '25 in herinnering.
Grote vraag is wat we in de tussentijd gedaan hebben.
T meest springt wel in t ook de NLse kroonjuwelen van de overheid (data) in de Amerikaanse cloud gestald. 🙈
Maar vooral dat project 2025 en de gevolgen vooral compleet genegeerd zijn.
commentaar 25-1-25:
We zullen de VS moeten wantrouwen, is de les van een week Trump-II
https://www.volkskrant.nl/columns-opinie/we-zullen-de-vs-moeten-wantrouwen-is-de-les-van-een-week-trump-ii~bb8f275d/
(Via @mickpersson.bsky.social — Bluesky
https://bsky.app/profile/mickpersson.bsky.social/post/3m7bbbng3yc22 )

RIVM update rioolwaarden en percentage positief.
Met vandaag een, zeg maar, 'kerstopleving'.
Het gewogen gemiddelde is gestegen van zo'n 345 tot 460.
Er zitten 9 nieuwe dagen in de data: 24/12 t/m 1/1, met 60%-5% van de meetstations (verre van compleet dus, nog een feestdagen-effect?). De laatste 2 dagen zijn juist weer lager maar dat betreft nog maar heel weinig meetstations.
#qp2t

aktuelles #Wetter #Behrendorf #Wische 11-02-2026 09:25
Temperatur: (min: 1,7C) 2,9C (max: 3,0C)
Feuchte: 99%
Luftdruck: 985,1 hPa (gleichbleibend)
Windrichtung: N/A Grad
Win…

On Zero-Dimensional Glicci Monomial Ideals
Benjamin Mudrak
https://arxiv.org/abs/2602.03703 https://arxiv.org/pdf/2602.03703 https://arxiv.org/html/2602.03703
arXiv:2602.03703v1 Announce Type: new
Abstract: Consider the polynomial ring $R_n = k[x_1,...,x_n]$, where $k$ is a field. Let $m = (x_1,...,x_n)$ and $I$ be an $m$-primary monomial ideal in $R$. We consider the problem of determining whether such ideals are in the Gorenstein liasion class of a complete intersection (glicci). We prove that all $m$-primary monomial ideals in $k[x,y,z]$ with at most eight generators are homogeneously glicci. We also construct a large class of $m$-primary monomial ideals in $R_n$ for any $n$ with any number of minimal generators that are homogeneously glicci but not in the complete intersection liaison class of a complete intersection (licci). All Gorenstein links used are constructed explicitly and every second step links to another $m$-primary monomial ideal.
toXiv_bot_toot

MAHA Activists Urge Trump to Fire His E.P.A. Administrator (Maxine Joselow/New York Times)
https://www.nytimes.com/2025/12/05/climate/maha-lee-zeldin-pesticides.html?unlocked_article_code=1.6U8.N_hL.CQ4L0iljb5Vk&smid=url-share
http://www.memeorandum.com/251205/p101#a251205p101

What actually is the mastodon upgrade path across minor releases, like v4.3.18 -> v4.5.6? The release notes generally mention only upgrades from the most recent patch release in the same minor (vA.B.n-1 -> vA.B.n). Are huge jumps safe, assuming the new minimum requirements are met? Are backwards-time forward-version (eg v4.3.18 -> v4.4.0) upgrades invalid? Are all intervening database migrations handled automatically at service startup? Any gotchas?
#mastoadmin #fediadmin

POSTDOCTORAL POSITION> University of Toronto, Department for the Study of Religion & The Robert H.N. Ho Family Foundation Centre for Buddhist Studies https://networks.h-net.org/group/announcements/20140643/postdoct…

Probado el roscón de reyes de Mercadona, el ranking personal de este año queda así:
1 - El Corte Inglés
2 - Lidl
3 - DIA.
El premio panettone, un año mšs, se lo lleva el de Carrour (el del envoltorio de celofšn); mención especial el de Lidl Deluxe con naranja confitada.
#roscondereyes #panettone

Viking, n.:
1. Daring Scandinavian seafarers, explorers, adventurers,
entrepreneurs world-famous for their aggressive, nautical import
business, highly leveraged takeovers and blue eyes.
2. Bloodthirsty sea pirates who ravaged northern Europe beginning
in the 9th century.
Hagar's note: The first definition is much preferred; the second is used
only by malcontents, the envious, and disgruntled owners of waterfront
property.

I generally hate buying new computing devices and try to make them last as long as possible. I bought a used/refurb iPad 5th Gen in 2022 for $199 and got 2 years of solid use before I upgraded to a 6th Gen in 2024 (for $170) so I could use an Apple Pencil.
I then put the old 5th Gen on my trainer bike as a video player and it still works great.
But sadly, two years in the 6th Gen now has dead spots on the screen. I may need to replace it.
1/n

Worked on some more #Gentoo global #jobserver goodies today.
Firstly, Portage jobserver support patch: #PyTest jobs will also be counted towards total job count.
Again, it's not a perfect solution, but it works reasonably. The plugin still starts -n jobs as specified by the arguments, but it acquired job tokens prior to executing every test, therefore delaying actual testing until tokens are available. It doesn't seem to cause noticeable overhead either.

The two core parties for a new Dutch government coalition - CDA and @… - have agreed on an agenda; they will now invite other parties to join in.
Some of their points on energy and climate in this thread!
1/n

Die Koalition verspricht Verbenner sollten „hocheffizient“ werden. Ja, im letzten Jahrtausend hatten wir das 3-Liter-Auto, und hätte sich das damals durchgesetzt, und hätten wir inzwischen das 1-Liter-Auto, dann hätten wir heute noch ein klein wenig mehr CO₂-Butget und würden das mit dem 1,5°-Ziel noch schaffen – wenn wir jetzt von diesen effizienteren Verbrennern auf E-Mobilität und einen entsprechenden Ausbau des ÖP(N)V setzten. Aber damals war das 3-Liter-Auto „was für diese grünen Spinne…

aktuelles #Wetter #Behrendorf #Wische 11-02-2026 21:35
Temperatur: (min: 1,7C) 3,2C (max: 6,3C)
Feuchte: 99%
Luftdruck: 983,1 hPa (gleichbleibend)
Windrichtung: N/A Grad
Win…

Optical clocks with accuracy validated at the 19th digit
K. J. Arnold, M. D. K. Lee, Zhao Qi, Qichen Qin, Zhang Zhao, N. Jayjong, M. D. Barrett
https://arxiv.org/abs/2512.07346 https://arxiv.org/pdf/2512.07346 https://arxiv.org/html/2512.07346
arXiv:2512.07346v1 Announce Type: new
Abstract: We report a comprehensive evaluation of all known sources of systematic uncertainty for two independent $^{176}$Lu$^ $ single-ion optical references, finding total systematic uncertainty of $1.1\times10^{-19}$ and $1.4\times10^{-19}$ for the two individual systems and $9.6\times10^{-20}$ for the difference. Through direct comparison via correlation spectroscopy, we demonstrate a relative frequency agreement of $-2.4\pm(5.7)_\mathrm{stat}\pm(1.0)_\mathrm{sys}\times10^{-19}$, where `stat' and `sys' indicate the statistical and systematic uncertainty, respectively. The comparison uncertainty is statistically limited after approximately 200 hours of averaging with a measurement instability of $4.8\times10^{-16}(\tau/\mathrm{s})^{-1/2}$.
toXiv_bot_toot

Now that the Super Bowl is over, here's what to know about the 2026 NFL Draft

https://www.cbssports.com/nfl/draft/news/nfl-draft-2026-where-to-watch-date-tim…

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

aktuelles #Wetter #Behrendorf #Wische 11-02-2026 08:10
Temperatur: (min: 1,7C) 2,1C (max: 2,2C)
Feuchte: 99%
Luftdruck: 985,1 hPa (langsam fallend)
Windrichtung: N/A Grad
Wi…

Replaced article(s) found for cs.GT. https://arxiv.org/list/cs.GT/new
[1/1]:
- Cumulative Games: Who is the current player?
Urban Larsson, Reshef Meir, Yair Zick
https://arxiv.org/abs/2005.06326
- Contest Design with Threshold Objectives
Edith Elkind, Abheek Ghosh, Paul W. Goldberg
https://arxiv.org/abs/2109.03179
- Deep Learning Meets Mechanism Design: Key Results and Some Novel Applications
V. Udaya Sankar, Vishisht Srihari Rao, Y. Narahari
https://arxiv.org/abs/2401.05683 https://mastoxiv.page/@arXiv_csGT_bot/111741115483021453
- Charting the Shapes of Stories with Game Theory
Daskalakis, Gemp, Jiang, Leme, Papadimitriou, Piliouras
https://arxiv.org/abs/2412.05747 https://mastoxiv.page/@arXiv_csGT_bot/113627246220336424
- Computing Evolutionarily Stable Strategies in Multiplayer Games
Sam Ganzfried
https://arxiv.org/abs/2511.20859 https://mastoxiv.page/@arXiv_csGT_bot/115620508246637361
- Autodeleveraging: Impossibilities and Optimization
Tarun Chitra
https://arxiv.org/abs/2512.01112 https://mastoxiv.page/@arXiv_csGT_bot/115649040881525135
- Static Pricing Guarantees for Queueing Systems
Jacob Bergquist, Adam N. Elmachtoub
https://arxiv.org/abs/2305.09168 https://mastoxiv.page/@arXiv_csDS_bot/110382625621173269
- Game of arrivals at a two queue network with heterogeneous customer routes
Agniv Bandyopadhyay, Sandeep Juneja
https://arxiv.org/abs/2310.18149 https://mastoxiv.page/@arXiv_csPF_bot/111322112226936579
- Characterization of Priority-Neutral Matching Lattices
Clayton Thomas
https://arxiv.org/abs/2404.02142 https://mastoxiv.page/@arXiv_econTH_bot/112205968984928881
- Seven kinds of equivalent models for generalized coalition logics
Zixuan Chen, Fengkui Ju
https://arxiv.org/abs/2501.05466 https://mastoxiv.page/@arXiv_csLO_bot/113819715349259373
- Matching Markets Meet LLMs: Algorithmic Reasoning with Ranked Preferences
Hadi Hosseini, Samarth Khanna, Ronak Singh
https://arxiv.org/abs/2506.04478 https://mastoxiv.page/@arXiv_csAI_bot/114635186215388479
toXiv_bot_toot

The US *loves* soldiers and veterans! Virtuous! Service! 🇺🇲🦅
The US *hates* homeless people. Lazy! Dirty! Want a handout!
But... ~1 in every 20 US homeless folk is a Black or hispanic veteran. 🤷🏿‍♂️
-- @…

mekka okereke :verified: (@mekkaokereke@hachyderm.io)
Attached: 2 images Happy #BlackHistoryMonth ! Still not talking about Black History. Still talking about white US History. The US *loves* soldiers and veterans! Virtuous! Service! 🇺🇲🦅 The US *hates* homeless people. Lazy! Dirty! Want a handout! But... ~1 in every 20 US homeless folk is a Black or hispanic veteran. 🤷🏿‍♂️ In the USA, the phrase "support our troops!" is a euphemism that does mean military jingoism, but doesn't mean supporting all of our troops. 1/N #B…

Une mise en examen d'un des éducateurs de la secte OKC et une instruction qui n'en finit pas, voilŠ le destin funeste des victimes d'OKC. Elles ont besoin d'aide pour que la justice française leur accorde la priorité!
https://chardonsbleus.org/une-enquete-

Une enquête révèle les dérives du bouddhisme tibétain
1) Le centre de la communauté OKC de Castellane (Alpes-de-Haute-Provence).2) Ricardo Mendes, porte-parole des victimes, devant la Cour d’appel de Liège, en ...

A polynomial-time algorithm for recognizing high-bandwidth graphs
Luis M. B. Varona
https://arxiv.org/abs/2602.01755 https://arxiv.org/pdf/2602.01755 https://arxiv.org/html/2602.01755
arXiv:2602.01755v1 Announce Type: new
Abstract: An unweighted, undirected graph $G$ on $n$ nodes is said to have \emph{bandwidth} at most $k$ if its nodes can be labelled from $0$ to $n - 1$ such that no two adjacent nodes have labels that differ by more than $k$. It is known that one can decide whether the bandwidth of $G$ is at most $k$ in $O(n^k)$ time and $O(n^k)$ space using dynamic programming techniques. For small $k$ close to $0$, this approach is effectively polynomial, but as $k$ scales with $n$, it becomes superexponential, requiring up to $O(n^{n - 1})$ time (where $n - 1$ is the maximum possible bandwidth). In this paper, we reformulate the problem in terms of bipartite matching for sufficiently large $k \ge \lfloor (n - 1)/2 \rfloor$, allowing us to use Hall's marriage theorem to develop an algorithm that runs in $O(n^{n - k 1})$ time and $O(n)$ auxiliary space (beyond storage of the input graph). This yields polynomial complexity for large $k$ close to $n - 1$, demonstrating that the bandwidth recognition problem is solvable in polynomial time whenever either $k$ or $n - k$ remains small.
toXiv_bot_toot

As in Britain, Ireland is losing its pubs.
Un mundo en peligro de extinción: por qué estšn desapareciendo los pubs irlandeses
https://www.eldiario.es/internacional/problemas-soledad-cohesion-social-desaparec…

"Problemas de soledad y cohesión social": por qué están desapareciendo los clásicos pubs irlandeses
Desde 2005, Irlanda ha perdido una cuarta parte de sus pubs, más de 2.100, lo que supone una media de 112 cierres al año

New York becomes the first US state to require retailers to disclose use of algorithmic pricing tied to personal data; 10 states are considering similar bills (Tim Balk/New York Times)
https://www.nytimes.com/2025/11/29/nyregio

N.Y. Law Could Set Stage for A.I. Regulation’s Next ‘Big Battleground’
The new law seeks to prevent retailers from ripping off consumers by using artificial intelligence and their personal data to charge them higher prices.

Netanyahu's Pardon Request Borrows From Trump's Playbook (David M. Halbfinger/New York Times)
https://www.nytimes.com/2025/12/01/world/middleeast/netanyahu-pardon-corruption-israel-trump.html?unlocked_article_code=1.5U8.r8Nu.n_OJUthMrAAx&smid=url-share
http://www.memeorandum.com/251201/p51#a251201p51

aktuelles #Wetter #Behrendorf #Wische 12-11-2025 03:55
Temperatur: (min: 4,6C) 5,1C (max: 6,3C)
Feuchte: 99%
Luftdruck: 1015,1 hPa (gleichbleibend)
Windrichtung: N/A Grad
Wi…

What's at stake in the NFL playoff race in Week 18? Both No. 1 seeds, 4 division titles and more https://www.nfl.com/news/what-s-at-stake-in-the-nfl-playoff-race-in-week-18-both-no-1-seeds-4-division-titles-and-more<…

Une mise en examen d'un des éducateurs de la secte OKC et une instruction qui n'en finit pas, voilŠ le destin funeste des victimes d'OKC. Elles ont besoin d'aide pour que la justice française leur accorde la priorité!
https://chardonsbleus.org/une-enquete-

Une enquête révèle les dérives du bouddhisme tibétain
1) Le centre de la communauté OKC de Castellane (Alpes-de-Haute-Provence).2) Ricardo Mendes, porte-parole des victimes, devant la Cour d’appel de Liège, en ...

aktuelles #Wetter #Behrendorf #Wische 12-11-2025 19:50
Temperatur: (min: 4,1C) 7,9C (max: 11,8C)
Feuchte: 96%
Luftdruck: 1011,1 hPa (gleichbleibend)
Windrichtung: N/A Grad
W…

Venezuela’s mission to the U.N. has requested an emergency Security Council meeting
and has asked the Council to condemn the U.S. military strikes against the country.
Venezuela’s ambassador, Samuel Reinaldo Moncada Acosta, said in a letter to the Council’s president:
“The United States of America always uses lies to fabricate wars.
It is an international tyranny imposed with the propaganda of death:
the recent past confirms this.”
Russia and China, allie…

Venezuela Live Updates: Trump Says U.S. Will ‘Run' Country After Capture of Maduro
President Trump offered few details about how the United States would oversee Venezuela and for how long, but said its oil industry would “make a lot of money” under U.S. leadership. President Nicolás Maduro and his wife were being taken to New York to stand trial on drug and weapons charges.

In diplomatieke kringen is sprake geweest van een deal waarbij Rusland zijn gang kon gaan in Oekraine en de VS in Venezuela.
Stukje uit het verhoor van Fiona Hill in het impeachment proces in Trumps eerste termijn.
Bron: https://www.pbs.org/newshour/poli…

Robust Multiagent Collaboration Through Weighted Max-Min T-Joins
Sharareh Alipour
https://arxiv.org/abs/2602.07720 https://arxiv.org/pdf/2602.07720 https://arxiv.org/html/2602.07720
arXiv:2602.07720v1 Announce Type: new
Abstract: Many multiagent tasks -- such as reviewer assignment, coalition formation, or fair resource allocation -- require selecting a group of agents such that collaboration remains effective even in the worst case. The \emph{weighted max-min $T$-join problem} formalizes this challenge by seeking a subset of vertices whose minimum-weight matching is maximized, thereby ensuring robust outcomes against unfavorable pairings.
We advance the study of this problem in several directions. First, we design an algorithm that computes an upper bound for the \emph{weighted max-min $2k$-matching problem}, where the chosen set must contain exactly $2k$ vertices. Building on this bound, we develop a general algorithm with a \emph{$2 \ln n$-approximation guarantee} that runs in $O(n^4)$ time. Second, using ear decompositions, we propose another upper bound for the weighted max-min $T$-join cost. We also show that the problem can be solved exactly when edge weights belong to $\{1,2\}$.
Finally, we evaluate our methods on real collaboration datasets. Experiments show that the lower bounds from our approximation algorithm and the upper bounds from the ear decomposition method are consistently close, yielding empirically small constant-factor approximations. Overall, our results highlight both the theoretical significance and practical value of weighted max-min $T$-joins as a framework for fair and robust group formation in multiagent systems.
toXiv_bot_toot

aktuelles #Wetter #Behrendorf #Wische 11-02-2026 16:35
Temperatur: (min: 1,7C) 4,5C (max: 6,3C)
Feuchte: 99%
Luftdruck: 983,9 hPa (gleichbleibend)
Windrichtung: N/A Grad
Win…

Mamdani Will Be First N.Y.C. Mayor to Use the Quran at His Swearing-In (Maya King/New York Times)
https://www.nytimes.com/2025/12/31/nyregion/mamdani-quran-inauguration-muslim.html?unlocked_article_code=1.A1A.TAVi.04iy6ZCx-4sW&smid=url-share
http://www.memeorandum.com/251231/p45#a251231p45

aktuelles #Wetter #Behrendorf #Wische 11-02-2026 15:35
Temperatur: (min: 1,7C) 5,1C (max: 6,3C)
Feuchte: 99%
Luftdruck: 983,9 hPa (gleichbleibend)
Windrichtung: N/A Grad
Win…

Donald Trump has set free a private equity executive
who had served less than two weeks of a seven-year sentence
for his role in what prosecutors described as a $1.6 billion scheme
that defrauded thousands of victims.
David Gentile, 59, a onetime resident of Nassau County, N.Y.,
had reported to prison on Nov. 14, and was released on Wednesday, according to Bureau of Prisons records and a White House official who was not authorized to discuss the matter.
Mr…

Trump Frees Fraudster Just Days Into Seven-Year Prison Sentence
David Gentile had been found guilty for his role in what prosecutors described as a $1.6 billion scheme that defrauded thousands of investors.

Replaced article(s) found for cs.DS. https://arxiv.org/list/cs.DS/new
[1/1]:
- Language Generation in the Limit: Noise, Loss, and Feedback
Yannan Bai, Debmalya Panigrahi, Ian Zhang
https://arxiv.org/abs/2507.15319 https://mastoxiv.page/@arXiv_csDS_bot/114896208560390692
- Online Firefighting on Cactus Graphs
Max Hugen, Bob Krekelberg, Alison Hsiang-Hsuan Liu
https://arxiv.org/abs/2509.22277 https://mastoxiv.page/@arXiv_csDS_bot/115286656155128312
- Improved Extended Regular Expression Matching
Philip Bille, Inge Li G{\o}rtz, Rikke Schjeldrup Jessen
https://arxiv.org/abs/2510.09311 https://mastoxiv.page/@arXiv_csDS_bot/115365884736976741
- Robust Algorithms for Finding Cliques in Random Intersection Graphs via Sum-of-Squares
Andreas G\"obel, Janosch Ruff, Leon Schiller
https://arxiv.org/abs/2511.20376 https://mastoxiv.page/@arXiv_csDS_bot/115614988823215273
- Analysis of Shuffling Beyond Pure Local Differential Privacy
Shun Takagi, Seng Pei Liew
https://arxiv.org/abs/2601.19154 https://mastoxiv.page/@arXiv_csDS_bot/115971701218309765
- Exact (n 2) Comparison Complexity for the N-Repeated Element Problem
Andrew Au
https://arxiv.org/abs/2601.21202 https://mastoxiv.page/@arXiv_csDS_bot/115982906572495225
- A Multi-Token Coordinate Descent Method for Semi-Decentralized Vertical Federated Learning
Pedro Valdeira, Yuejie Chi, Cl\'audia Soares, Jo\~ao Xavier
https://arxiv.org/abs/2309.09977
- Optimal Sequential Flows
Hugo Gimbert, Corto Mascle, Patrick Totzke
https://arxiv.org/abs/2511.13806 https://mastoxiv.page/@arXiv_mathOC_bot/115575399809016779
toXiv_bot_toot

aktuelles #Wetter #Behrendorf #Wische 11-02-2026 22:05
Temperatur: (min: 1,7C) 3,2C (max: 6,3C)
Feuchte: 99%
Luftdruck: 983,2 hPa (gleichbleibend)
Windrichtung: N/A Grad
Win…

aktuelles #Wetter #Behrendorf #Wische 11-02-2026 20:35
Temperatur: (min: 1,7C) 3,4C (max: 6,3C)
Feuchte: 99%
Luftdruck: 983,2 hPa (gleichbleibend)
Windrichtung: N/A Grad
Win…

Fast Makespan Minimization via Short ILPs
Danny Hermelin, Dvir Shabtay
https://arxiv.org/abs/2602.06514 https://arxiv.org/pdf/2602.06514 https://arxiv.org/html/2602.06514
arXiv:2602.06514v1 Announce Type: new
Abstract: Short integer linear programs are programs with a relatively small number of constraints. We show how recent improvements on the running-times of solvers for such programs can be used to obtain fast pseudo-polynomial time algorithms for makespan minimization on a fixed number of parallel machines, and other related variants. The running times of our algorithms are all of the form $\widetilde{O}(p^{O(1)}_{\max} n)$ or $\widetilde{O}(p^{O(1)}_{\max} \cdot n)$, where $p_{\max}$ is the maximum processing time in the input. These improve upon the time complexity of previously known algorithms for moderate values of $p_{\max}$.
toXiv_bot_toot

Trump Administration Fires 8 Immigration Judges in New York (Ana Ley/New York Times)
https://www.nytimes.com/2025/12/01/nyregion/immigration-judges-fired-trump.html?unlocked_article_code=1.5k8.cz07.P2jT4VQ8igrf&smid=nytcore-ios-share
http://www.memeorandum.com/251201/p126#a251201p126

aktuelles #Wetter #Behrendorf #Wische 11-02-2026 19:35
Temperatur: (min: 1,7C) 3,7C (max: 6,3C)
Feuchte: 99%
Luftdruck: 983,7 hPa (gleichbleibend)
Windrichtung: N/A Grad
Win…

aktuelles #Wetter #Behrendorf #Wische 11-02-2026 18:35
Temperatur: (min: 1,7C) 3,6C (max: 6,3C)
Feuchte: 99%
Luftdruck: 983,8 hPa (gleichbleibend)
Windrichtung: N/A Grad
Win…

aktuelles #Wetter #Behrendorf #Wische 11-02-2026 17:35
Temperatur: (min: 1,7C) 4,1C (max: 6,3C)
Feuchte: 99%
Luftdruck: 983,8 hPa (gleichbleibend)
Windrichtung: N/A Grad
Win…

The Transgender Cancer Patient and What She Heard on Tape (Joseph Goldstein/New York Times)
https://www.nytimes.com/2025/12/01/nyregion/transgender-patient-records-during-cancer-surgery.html?unlocked_article_code=1.5U8.bIpx.mBjIl4L_T9IG&smid=url-share
http://www.memeorandum.com/251201/p108#a251201p108

aktuelles #Wetter #Behrendorf #Wische 11-02-2026 22:55
Temperatur: (min: 1,7C) 3,0C (max: 6,3C)
Feuchte: 99%
Luftdruck: 983,0 hPa (gleichbleibend)
Windrichtung: N/A Grad
Win…

aktuelles #Wetter #Behrendorf #Wische 11-02-2026 14:35
Temperatur: (min: 1,7C) 5,8C (max: 6,3C)
Feuchte: 97%
Luftdruck: 983,8 hPa (langsam fallend)
Windrichtung: N/A Grad
Wi…

aktuelles #Wetter #Behrendorf #Wische 11-02-2026 10:35
Temperatur: (min: 1,7C) 4,3C (max: 4,4C)
Feuchte: 99%
Luftdruck: 984,8 hPa (langsam fallend)
Windrichtung: N/A Grad
Wi…

aktuelles #Wetter #Behrendorf #Wische 11-02-2026 08:30
Temperatur: (min: 1,7C) 2,2C (max: 2,2C)
Feuchte: 99%
Luftdruck: 985,3 hPa (langsam fallend)
Windrichtung: N/A Grad
Wi…

aktuelles #Wetter #Behrendorf #Wische 11-02-2026 08:00
Temperatur: (min: 1,7C) 2,1C (max: 2,2C)
Feuchte: 99%
Luftdruck: 985,2 hPa (langsam fallend)
Windrichtung: N/A Grad
Wi…

aktuelles #Wetter #Behrendorf #Wische 11-02-2026 23:25
Temperatur: (min: 1,7C) 2,9C (max: 6,3C)
Feuchte: 99%
Luftdruck: 982,5 hPa (langsam fallend)
Windrichtung: N/A Grad
Wi…

aktuelles #Wetter #Behrendorf #Wische 11-02-2026 22:35
Temperatur: (min: 1,7C) 3,0C (max: 6,3C)
Feuchte: 99%
Luftdruck: 982,9 hPa (langsam fallend)
Windrichtung: N/A Grad
Wi…

aktuelles #Wetter #Behrendorf #Wische 12-12-2025 06:55
Temperatur: (min: 0,8C) 1,4C (max: 4,5C)
Feuchte: 99%
Luftdruck: 1022,2 hPa (gleichbleibend)
Windrichtung: N/A Grad
Wi…

aktuelles #Wetter #Behrendorf #Wische 12-12-2025 05:55
Temperatur: (min: 0,8C) 1,0C (max: 4,5C)
Feuchte: 99%
Luftdruck: 1021,9 hPa (gleichbleibend)
Windrichtung: N/A Grad
Wi…

aktuelles #Wetter #Behrendorf #Wische 12-12-2025 19:55
Temperatur: (min: -0,1C) 3,8C (max: 6,3C)
Feuchte: 99%
Luftdruck: 1024,1 hPa (gleichbleibend)
Windrichtung: N/A Grad
W…

aktuelles #Wetter #Behrendorf #Wische 11-12-2025 20:15
Temperatur: (min: 6,2C) 6,2C (max: 10,7C)
Feuchte: 96%
Luftdruck: 1021,1 hPa (gleichbleibend)
Windrichtung: N/A Grad
W…

aktuelles #Wetter #Behrendorf #Wische 12-12-2025 18:55
Temperatur: (min: -0,1C) 3,7C (max: 6,3C)
Feuchte: 99%
Luftdruck: 1024,1 hPa (langsam steigend)
Windrichtung: N/A Grad

aktuelles #Wetter #Behrendorf #Wische 12-01-2026 00:10
Temperatur: (min: -13,3C) -12,8C (max: -12,7C)
Feuchte: 94%
Luftdruck: 1023,1 hPa (langsam fallend)
Windrichtung: N/A Grad<…