Zobrazeno 1 - 10
of 3 556
pro vyhledávání: '"P, Gut"'
Autor:
Gut, Christian, Goldman, Alfredo
Aristotle vs. Ringelmann was a discussion between two distinct research teams from the ETH Z\"urich who argued whether the productivity of Open Source software projects scales sublinear or superlinear with regard to its team size. This discussion evo
Externí odkaz:
http://arxiv.org/abs/2408.04782
Autor:
Schürch, Manuel, Boos, Laura, Heinzelmann-Schwarz, Viola, Gut, Gabriele, Krauthammer, Michael, Wicki, Andreas, Consortium, Tumor Profiler
AI-driven precision oncology has the transformative potential to reshape cancer treatment by leveraging the power of AI models to analyze the interaction between complex patient characteristics and their corresponding treatment outcomes. New technolo
Externí odkaz:
http://arxiv.org/abs/2402.12190
A digraph $H$ is called ubiquitous if every digraph that contains arbitrarily many vertex-disjoint copies of $H$ also contains infinitely many vertex-disjoint copies of $H$. We study oriented double rays, that is, digraphs $H$ whose underlying undire
Externí odkaz:
http://arxiv.org/abs/2310.09857
Autor:
Direkci, Su, Winkler, Klemens, Gut, Corentin, Hammerer, Klemens, Aspelmeyer, Markus, Chen, Yanbei
Probing quantum entanglement with macroscopic objects allows us to test quantum mechanics in new regimes. One way to realize such behavior is to couple a macroscopic mechanical oscillator to a continuous light field via radiation pressure. In view of
Externí odkaz:
http://arxiv.org/abs/2309.12532
Autor:
Bowler, Nathan, Gut, Florian
We investigate a game played between two players, Maker and Breaker, on a countably infinite complete graph where the vertices are the rational numbers. The players alternately claim unclaimed edges. It is Maker's goal to have after countably many tu
Externí odkaz:
http://arxiv.org/abs/2309.05526
Autor:
Bowler, Nathan, Gut, Florian
We investigate a two player game called the $K^4$-building game: two players alternately claim edges of an infinite complete graph. Each player's aim is to claim all six edges on some vertex set of size four for themself. The first player to accompli
Externí odkaz:
http://arxiv.org/abs/2309.02132
Bidirected graphs are a generalisation of directed graphs that arises in the study of undirected graphs with perfect matchings. Menger's famous theorem - the minimum size of a set separating two vertex sets $X$ and $Y$ is the same as the maximum numb
Externí odkaz:
http://arxiv.org/abs/2306.01921
Autor:
Bowler, Nathan, Gut, Florian, Hatzel, Meike, Kawarabayashi, Ken-ichi, Muzi, Irene, Reich, Florian
We introduce torsoids, a canonical structure in matching covered graphs, corresponding to the bricks and braces of the graph. This allows a more fine-grained understanding of the structure of finite and infinite directed graphs with respect to their
Externí odkaz:
http://arxiv.org/abs/2305.09192
Publikováno v:
Scientific Reports, Vol 14, Iss 1, Pp 1-11 (2024)
Abstract Robust solid-core silica particles with submicrometer size and anthracene-containing mesoporous shell were obtained and studied as model water-dispersable photoreactors. An anthracene derivative containing a triethoxysilyl group was synthesi
Externí odkaz:
https://doaj.org/article/c71b0b6dc8db46d6818366b958c15c2f
Autor:
Gut Windarsih, Tri Handayani, Indira Riastiwi, Aryani Leksonowati, Titien Ngatinem Praptosuwiryo, Fajaruddin Ahmad, Yuyu Suryasari Poerba, Witjaksono
Publikováno v:
Forest Science and Technology, Vol 20, Iss 2, Pp 142-154 (2024)
Teak, known for its high-quality timber and economic value, holds significant potential as the major component of an agroforestry system to combat climate change and support sustainable development goals. The challenge of slow teak growth can be addr
Externí odkaz:
https://doaj.org/article/7f2911011d0f40aa9c37f7fedb324519