Zobrazeno 1 - 10
of 11 144
pro vyhledávání: '"A. Gerke"'
Cracks are among the earliest indicators of deterioration in concrete structures. Early automatic detection of these cracks can significantly extend the lifespan of critical infrastructures, such as bridges, buildings, and tunnels, while simultaneous
Externí odkaz:
http://arxiv.org/abs/2411.04620
Room temperature ionic liquids show great promise as electrolytes in various technological applications, such as energy storage or electrotunable lubrication. These applications are particularly intriguing due to the specific behavior of ionic liquid
Externí odkaz:
http://arxiv.org/abs/2410.08721
Autor:
Maboudi, Mehdi, Backhaus, Jan, Ghassoun, Yahya, Khedar, Yogesh, Lowke, Dirk, Mai, Inka, Riedel, Bjoern, Bestmann, Ulf, Gerke, Markus
Accurate and efficient structural health monitoring of infrastructure objects such as bridges is a vital task, as many existing constructions have already reached or are approaching their planned service life. In this contribution, we address the que
Externí odkaz:
http://arxiv.org/abs/2410.18984
An oriented graph is called $k$-anti-traceable if the subdigraph induced by every subset with $k$ vertices has a hamiltonian anti-directed path. In this paper, we consider an anti-traceability conjecture. In particular, we confirm this conjecture hol
Externí odkaz:
http://arxiv.org/abs/2403.19312
The interfacial nature of the electric double layer (EDL) assumes that electrode surface morphology significantly impacts the EDL properties. Since molecular-scale roughness modifies the structure of EDL, it is expected to disturb the overscreening e
Externí odkaz:
http://arxiv.org/abs/2401.13458
A bisection in a graph is a cut in which the number of vertices in the two parts differ by at most 1. In this paper, we give lower bounds for the maximum weight of bisections of edge-weighted graphs with bounded maximum degree. Our results improve a
Externí odkaz:
http://arxiv.org/abs/2401.10074
For a vertex $x$ of a digraph, $d^+(x)$ ($d^-(x)$, resp.) is the number of vertices at distance 1 from (to, resp.) $x$ and $d^{++}(x)$ is the number of vertices at distance 2 from $x$. In 1995, Seymour conjectured that for any oriented graph $D$ ther
Externí odkaz:
http://arxiv.org/abs/2306.03493
Structures are abundant in both natural and human-made environments and usually studied in the form of images or scattering patterns. To characterize structures a huge variety of descriptors is available spanning from porosity to radial and correlati
Externí odkaz:
http://arxiv.org/abs/2305.13870
We obtain lower and upper bounds for the maximum weight of a directed cut in the classes of weighted digraphs and weighted acyclic digraphs as well as in some of their subclasses. We compare our results with those obtained for the maximum size of a d
Externí odkaz:
http://arxiv.org/abs/2304.10202
This paper introduces a collection of four data sets, similar to Anscombe's Quartet, that aim to highlight the challenges involved when estimating causal effects. Each of the four data sets is generated based on a distinct causal mechanism: the first
Externí odkaz:
http://arxiv.org/abs/2304.02683