Zobrazeno 1 - 10
of 38 251
pro vyhledávání: '"Probst A"'
Publikováno v:
BIO Web of Conferences, Vol 129, p 17016 (2024)
Externí odkaz:
https://doaj.org/article/483be75cd00b49fa8f9000b38bb21662
Publikováno v:
BIO Web of Conferences, Vol 129, p 18006 (2024)
Externí odkaz:
https://doaj.org/article/88ac68f8489f4b0a8e334fdf69198fc0
In the literature, it has been shown that the evolution of the known explicit 3D surface to the target one can be learned from 2D images using the instantaneous flow field, where the known and target 3D surfaces may largely differ in topology. We are
Externí odkaz:
http://arxiv.org/abs/2411.15018
Waveguide tapers are critical components for leveraging the benefits of both single-mode and wide waveguides. Adiabatic tapers are typically hundreds of microns in length, dramatically limiting density and scalability. We reenvision the taper design
Externí odkaz:
http://arxiv.org/abs/2411.14309
Autor:
Figaredo, Catalina Sobrino, Chelouche, Doron, Haas, Martin, Ramolla, Michael, Kaspi, Shai, Panda, Swayamtrupta, Ochmann, Martin W., Zucker, Shay, Chini, Rolf, Probst, Malte A., Kollatschny, Wolfram, Murphy, Miguel
We present the results of a nearly decade-long photometric reverberation mapping (PRM) survey of the H$\alpha$ emission line in nearby ($0.01\lesssim z \lesssim0.05$) Seyfert-Galaxies using small ($15\,\mathrm{cm}-40\,\mathrm{cm}$) telescopes. Broad-
Externí odkaz:
http://arxiv.org/abs/2411.07847
Expander decompositions have become one of the central frameworks in the design of fast algorithms. For an undirected graph $G=(V,E)$, a near-optimal $\phi$-expander decomposition is a partition $V_1, V_2, \ldots, V_k$ of the vertex set $V$ where eac
Externí odkaz:
http://arxiv.org/abs/2410.13451
Evaluating the output of generative large language models (LLMs) is challenging and difficult to scale. Most evaluations of LLMs focus on tasks such as single-choice question-answering or text classification. These tasks are not suitable for assessin
Externí odkaz:
http://arxiv.org/abs/2408.09831
Autor:
Brand, Jan van den, Chen, Li, Kyng, Rasmus, Liu, Yang P., Meierhans, Simon, Gutenberg, Maximilian Probst, Sachdeva, Sushant
We give the first almost-linear total time algorithm for deciding if a flow of cost at most $F$ still exists in a directed graph, with edge costs and capacities, undergoing decremental updates, i.e., edge deletions, capacity decreases, and cost incre
Externí odkaz:
http://arxiv.org/abs/2407.10830
In this paper, we investigate the question of whether the electrical flow routing is a good oblivious routing scheme on an $m$-edge graph $G = (V, E)$ that is a $\Phi$-expander, i.e. where $\lvert \partial S \rvert \geq \Phi \cdot \mathrm{vol}(S)$ fo
Externí odkaz:
http://arxiv.org/abs/2406.07252
Optimal multi-layer device design requires consideration of fabrication uncertainties associated with inter-layer alignment and conformal layering. We present layer-restricted topology optimization (TO), a novel technique which mitigates the effects
Externí odkaz:
http://arxiv.org/abs/2404.07104