Tootfinder

Zum Gebotstermin 1. Dezember 2025 wurden mehr als doppelt so viele Gebote für PV-Freiflächenanlagen eingereicht wie in der Vorrunde.
Die Ausschreibung über 2.328 Megawatt war deutlich überzeichnet, 262 Projekte mit 2.341 Megawatt erhielten einen Zuschlag.
Der durchschnittliche Zuschlagswert lag bei 5,00 Cent pro Kilowattstunde. Viele Vorhaben entstehen an #Autobahnen,

The amount of disinformation, deep fakes, and other misdirection I hear about from friends and relatives that they get from traditional social media is insane.
They have to tell me about it because I am almost always completely unaware, even though I am “on the Internet” just as much if not more than them.
This is a deep advantage of using Mastodon/the Fediverse right now. And it is not because fake stuff doesn’t exist here.
It is just not automatically sent to me by every owner, bot, and user. And if it is, it is generally swatted down hard.
#fediverse #mastodon #realInformation

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

A look at the US DOJ's December lawsuit alleging a smuggling ring illegally exported or tried to export at least $160M in advanced Nvidia AI chips to China (Eliot Chen/The Wire China)
https://www.thewirechina.com/2026/03/01/chasing-the-chip-smugg…

Chasing the Chip Smugglers - The Wire China
The exposure of a U.S.-based operation that smuggled Nvidia’s AI chips to China raises questions about the role of major companies and the authorities charged with enforcing export controls.

On the 26th day of December I add a 26th item to the collection of advent calendars:
https://adrianroselli.com/2025/12/web-design-dev-advent-calendars-for-2025.html

Web Design / Dev Advent Calendars for 2025
The advent calendar I wanted to use for the photo hasn’t arrived yet, so enjoy this box of tree. Web developers around the world have for years given a nod to Saturnalia solstice Isaac Newton’s birthday Yule wassailing mummering end of Gregorian calendar year Christmas with advent calendars covering web-related…

One excavator,
10,000 bodies,
a sea of rubble:
inside Gaza’s effort to retrieve and bury its dead
Under the relative calm of a ceasefire,
Civil Defense crews in Gaza are undertaking the monumental feat of recovering thousands of bodies still trapped under the rubble.
The level of decomposition in the bodies is very high,
which makes it difficult for families to identify them.
The lack of tools and technology for advanced DNA testing has also …

One excavator, 10,000 bodies, a sea of rubble: inside Gaza’s effort to retrieve and bury its dead
Under the relative calm of a ceasefire, Civil Defense crews in Gaza are undertaking the monumental feat of recovering thousands of bodies still trapped under the rubble.

The state department has barred five Europeans from the US, accusing them of leading efforts to pressure tech firms to censor or suppress American viewpoints
“These radical activists and weaponized NGOs have advanced censorship crackdowns by foreign states – in each case targeting American speakers and American companies,” Rubio said in an announcement.
Neben Thierry Breton trifft das u.a. Josephine Ballon und Anna-Lena von Hodenberg von @…

Es spricht absolut nichts dagegen, einen Kalender mit 341 Türchen für die Zeit bis zum nächsten 1. Dezember anzulegen.
Einen Adventsabwesenheitskalender.
#GoForIt

A Novel Explicit Filter for the Approximate Deconvolution in Large-Eddy Simulation on General Unstructured Grids: A posteriori tests on highly stretched grids
Mohammad Bagher Molaei, Ehsan Amani, Morteza Ghorbani
https://arxiv.org/abs/2602.21166 https://arxiv.org/pdf/2602.21166 https://arxiv.org/html/2602.21166
arXiv:2602.21166v1 Announce Type: new
Abstract: Explicit filters play a pivotal role in the scale separation and numerical stability of advanced Large Eddy Simulation (LES) closures, such as dynamic eddy-viscosity or Approximate Deconvolution (AD) methods. In the present study, it is demonstrated that the performance of commonly used explicit filters applicable to general unstructured grids highly depends on the grid configuration, specifically the cell aspect ratio, which can result in poor filter spectral properties, ultimately leading to large errors and even solution divergence. This study introduces a novel, efficient explicit filter for general unstructured grids, addressing this shortcoming through a combination of a face-averaging technique and recursive filtering. The filter parameters are then determined through a constrained multi-objective optimization, ensuring desirable spectral properties, including high-wavenumber attenuation, filter-width precision, filter stability and positivity, and minimized dispersion and commutation errors. The AD-LES of turbulent channel flow benchmarks using the new filter demonstrate a noticeable improvement in turbulent flow predictions on highly stretched boundary-layer-type grids, particularly in reducing the log-layer mean velocity profile mismatch, compared to simulations using conventional filters. The analyses show that this enhancement is mainly attributed to the sufficient level of attenuation near the Nyquist wavenumber achieved by the new filter in all spatial directions across various grid configurations, among others. The new filter was also successfully tested on unstructured prism grids for the 3D Taylor-Green vortex benchmark.
toXiv_bot_toot