Tootfinder

Anzahl der errichteten #Balkonkraftwerke pro Jahr in #Deutschland mit Stand vom 25.06.2025.
Unplausible Inbetriebnahmedaten von 1900 bis 2015 wurden durch das Registrierungsdatum der #Steckersolaranlage

Quasi-periodic oscillations and reflection feature evolution in 4U 1630-47 observed with Insight-HXMT
Jiashi Chen, Wei Wang
https://arxiv.org/abs/2506.19285

Quasi-periodic oscillations and reflection feature evolution in 4U 1630-47 observed with Insight-HXMT
The Galactic black hole (BH) X-ray binary 4U 1630-47 went into a new outburst in 2021 after $\sim$ 600 days from its 2020 outburst. We perform a detailed analysis of quasi-periodic oscillations and spectral evolutions during its 2021 outburst based on \textit{Insight}-HXMT observations. The main science aims to study the reflection features evolution of this accreting black hole using the observations of detecting quasi-periodic oscillations (QPOs) and quasi-regular modulations (QRMs). The QPOs…

Multi-GPU Acceleration of PALABOS Fluid Solver using C Standard Parallelism
Jonas Latt, Christophe Coreixas
https://arxiv.org/abs/2506.09242 https://

Multi-GPU Acceleration of PALABOS Fluid Solver using C++ Standard Parallelism
This article presents the principles, software architecture, and performance analysis of the GPU port of the lattice Boltzmann software library Palabos (J. Latt et al., "Palabos: Parallel lattice Boltzmann solver", Comput. Math. Appl. 81, 334-350, (2021)). A hybrid CPU-GPU execution model is adopted, in which numerical components are selectively assigned to either the CPU or the GPU, depending on considerations of performance or convenience. This design enables a progressive porting strategy, a…

Complementary Time-Space Tradeoff for Self-Stabilizing Leader Election: Polynomial States Meet Sublinear Time
Yuichi Sudo
https://arxiv.org/abs/2505.23649 …

Complementary Time-Space Tradeoff for Self-Stabilizing Leader Election: Polynomial States Meet Sublinear Time
We study the self-stabilizing leader election (SS-LE) problem in the population protocol model, assuming exact knowledge of the population size $n$. Burman, Chen, Chen, Doty, Nowak, Severson, and Xu (PODC 2021) showed that this problem can be solved in $O(n)$ expected time with $O(n)$ states. Recently, Gąsieniec, Grodzicki, and Stachowiak (PODC 2025) proved that $n+O(\log n)$ states suffice to achieve $O(n \log n)$ time both in expectation and with high probability (w.h.p.). If substantially m…