Tootfinder

Enhancing eLoran Timing Accuracy via Machine Learning with Meteorological and Terrain Data
Taewon Kang, Seunghyeon Park, Pyo-Woong Son, Jiwon Seo
https://arxiv.org/abs/2506.15235 …

Enhancing eLoran Timing Accuracy via Machine Learning with Meteorological and Terrain Data
The vulnerabilities of global navigation satellite systems (GNSS) to signal interference have increased the demand for complementary positioning, navigation, and timing (PNT) systems. To address this, South Korea has decided to deploy an enhanced long-range navigation (eLoran) system as a complementary PNT solution. Similar to GNSS, eLoran provides highly accurate timing information, which is essential for applications such as telecommunications, financial systems, and power distribution. Howev…

Estlink 2 geht wieder in Betrieb
Ein Ende 2024 beschädigtes Unterseekabel in der Ostsee funktioniert wieder. Der Schaden an der Stromleitung Estlink 2 zwischen Estland und Finnland sei behoben, die Verbindung voll funktionsfähig und seit der Nacht zu Freitag wieder am Strommarkt verfügbar, teilte der estnische Netzbetreiber Elering mit.
Estlink 2 war am ersten Weihnachtsfeiertag 2024 durch einen Sc…
🔗

Stromkabel in der Ostsee: "Estlink 2" ist wieder am Netz
Ende 2024 hatte der Tanker "Eagle S" das Ostseekabel "Estlink 2" beschädigt. Schneller als gedacht konnten die Reparaturen jetzt abgeschlossen werden. Ermittler vermuten weiterhin Sabotage.

Log-concavity of rows of triangular arrays satisfying a certain super-recurrence
Umesh Shankar
https://arxiv.org/abs/2508.12467 https://arxiv.org/pdf/2508.…

Log-concavity of rows of triangular arrays satisfying a certain super-recurrence
Recurrences of the form \begin{equation*} T(n,k) = (αn+βk +γ) \ T(n-1,k) + (α'n+β'k+γ')\ T(n-1,k-1)+δ_{n,0}δ_{k,0}. \end{equation*} show up as the recurrence for many well-studied combinatorial sequences such as the Stirling numbers of first and second kind, the Lah numbers, Eulerian numbers etc. Recently, many of these sequences have received generalisations that obey a recurrence of the form \begin{equation*} T(n,k) = (αn+βk +γ)^l \ T(n-1,k) + (α'n+β'k+γ')^l\ T(n-1,k-1)+δ_{…

“The Ring has passed to the dominion of Men… and Men promptly sold it to Google Ads.”
“There is no evil in the world that cannot be containerized…”
The Council of Elrond, reimagined in /etc/middle-earth.conf
Elrond (Linus Torvalds):
------------------------
“Strangers from distant distros, you have been summoned to answer the threat of the Cloud. Never before has such open source stood together. The time of the monolith is over. The microservice rises.”
Ganda…

On the statistical physics and thermodynamics of polymer networks: a Eulerian theory for entropic elasticity
Siyu Wang, Heng Xiao, Lin Zhan
https://arxiv.org/abs/2507.10974

On the statistical physics and thermodynamics of polymer networks: a Eulerian theory for entropic elasticity
This study presents a Eulerian theory to elucidate the molecular kinematics in polymer networks and their connection to continuum deformation, grounded in fundamental statistical physics and thermodynamics. Three key innovations are incorporated: 1. The network behavior is described through a global thermodynamic equilibrium condition that maximizes the number of accessible microstates for all segments, instead of directly dealing with the well-established single-chain models commonly adopted i…

Numerical investigation on solids settling in a non-Newtonian slurry inside a horizontal flume
Shubham Sharma, Somasekhara Goud Sontti, Wenming Zhang, Petr Nikrityuk, Xuehua Zhang
https://arxiv.org/abs/2507.11657

Numerical investigation on solids settling in a non-Newtonian slurry inside a horizontal flume
Slurry transportation is always crucial for many industrial processes. This study numerically investigates the settling behavior of multisize solid particles in a non-newtonian slurry inside a semicircular open channel (flume). The non-newtonian slurry is modelled using a three-dimensional (3D) unsteady Eulerian-Eulerian (E-E) model coupled with the Hershel-Bulkley (HB) rheological model. A detailed sensitivity analysis of drag models is performed to establish the solid-fluid interaction in the…

ELRUHNA: Elimination Rule-basedHypergraph Alignment
Cameron Ibrahim, S M Ferdous, Ilya Safro, Marco Minutoli, Mahantesh Halappanavar
https://arxiv.org/abs/2506.09866

ELRUHNA: Elimination Rule-basedHypergraph Alignment
Hypergraph alignment is a well-known NP-hard problem with numerous practical applications across domains such as bioinformatics, social network analysis, and computer vision. Despite its computational complexity, practical and scalable solutions are urgently needed to enable pattern discovery and entity correspondence in high-order relational data. The problem remains understudied in contrast to its graph based counterpart. In this paper, we propose ELRUHNA, an elimination rule-based framework …

An efficient and robust high-order compact ALE gas-kinetic scheme for unstructured meshes
Yibo Wang, Xing Ji, Liang Pan
https://arxiv.org/abs/2508.11283 https://

An efficient and robust high-order compact ALE gas-kinetic scheme for unstructured meshes
For the arbitrary-Lagrangian-Eulerian (ALE) calculations, the geometric information needs to be calculated at each time step due to the movement of mesh. To achieve the high-order spatial accuracy, a large number of matrix inversions are needed, which affect the efficiency of computation dramatically. In this paper, an efficient and robust high-order compact ALE gas-kinetic scheme is developed for the compressible moving grids and moving boundary problems. The memory-reduction reconstruction is…

GBEES-GPU: An efficient parallel GPU algorithm for high-dimensional nonlinear uncertainty propagation
Benjamin L. Hanson, Carlos Rubio, Adri\'an Garc\'ia-Guti\'errez, Thomas Bewley
https://arxiv.org/abs/2508.13986

GBEES-GPU: An efficient parallel GPU algorithm for high-dimensional nonlinear uncertainty propagation
Eulerian nonlinear uncertainty propagation methods often suffer from finite domain limitations and computational inefficiencies. A recent approach to this class of algorithm, Grid-based Bayesian Estimation Exploiting Sparsity, addresses the first challenge by dynamically allocating a discretized grid in regions of phase space where probability is non-negligible. However, the design of the original algorithm causes the second challenge to persist in high-dimensional systems. This paper presents …

Study of $p^{k}$-Eulerian polynomials and $p^{k}$-Fibonacci numbers for every odd prime $p$ and $k\geq0$
M. Parvathi, A. Tamilselvi, D. Hepsi
https://arxiv.org/abs/2506.09941

Study of $p^{k}$-Eulerian polynomials and $p^{k}$-Fibonacci numbers for every odd prime $p$ and $k\geq0$
In this paper, we define the notion of descent for the paths in the $p$-Bratteli diagram. This leads to the definition of $p^{k}$-Eulerian polynomials, whose coefficients count the number of paths with a given number of descents. We provide a method for constructing the $p^{k}$-Eulerian polynomials at each vertex. Furthermore, we compute the total number of descents of all paths ending at a given vertex as the corresponding $p^{k}$-Fibonacci numbers. We show that the derivative of the $p^{k}$-E…