Zobrazeno 1 - 10
of 2 863
pro vyhledávání: '"Bonamy, A"'
Autor:
Nguyen, Thuy, Bonamy, Daniel
Fracture toughness is the material property characterizing resistance to failure. Predicting its value from the solid structure at the atomistic scale remains elusive, even in the simplest situations of brittle fracture. We report here numerical simu
Externí odkaz:
http://arxiv.org/abs/2410.21839
Autor:
Entezarjou, Artin, Bonamy, Anna-Karin Edstedt, Benjaminsson, Simon, Herman, Pawel, Midlöv, Patrik
Publikováno v:
JMIR Medical Informatics, Vol 8, Iss 9, p e18930 (2020)
BackgroundSmartphones have made it possible for patients to digitally report symptoms before physical primary care visits. Using machine learning (ML), these data offer an opportunity to support decisions about the appropriate level of care (triage).
Externí odkaz:
https://doaj.org/article/64ef7d9c3b2d4b3399cef21965650e69
Autor:
Montellà, Eduard Puig, Chauchat, Julien, Bonamy, Cyrille, Weij, Dave, Keetels, Geert, Hsu, Tian-Jian
In submerged sandy slopes, soil is frequently eroded as a combination of two main mechanisms: breaching, which refers to the retrogressive failure of a steep slope forming a turbidity current, and, instantaneous sliding wedges, known as shear failure
Externí odkaz:
http://arxiv.org/abs/2304.09338
Autor:
Christelle Glangetas, Adriane Guillaumin, Elodie Ladevèze, Anaelle Braine, Manon Gauthier, Léa Bonamy, Evelyne Doudnikoff, Thibault Dhellemmes, Marc Landry, Erwan Bézard, Stephanie Caille, Anne Taupignon, Jérôme Baufreton, François Georges
Publikováno v:
Nature Communications, Vol 15, Iss 1, Pp 1-18 (2024)
Abstract The Insula functions as a multisensory relay involved in socio-emotional processing with projections to sensory, cognitive, emotional, and motivational regions. Notably, the interhemispheric projection from the Insula to the contralateral In
Externí odkaz:
https://doaj.org/article/53d5277cc2504f09b9310215a9aa1c2c
We show that the edges of any planar graph of maximum degree at most $9$ can be partitioned into $4$ linear forests and a matching. Combined with known results, this implies that the edges of any planar graph $G$ of odd maximum degree $\Delta\ge 9$ c
Externí odkaz:
http://arxiv.org/abs/2302.13312
Publikováno v:
Advances in Combinatorics 2023:6, 7pp
Recently, Letzter proved that any graph of order $n$ contains a collection $\mathcal{P}$ of $O(n\log^\star n)$ paths with the following property: for all distinct edges $e$ and $f$ there exists a path in $\mathcal{P}$ which contains $e$ but not $f$.
Externí odkaz:
http://arxiv.org/abs/2301.08707
Autor:
Montiel, Antoine, Nguyen, Thuy, Rountree, Cindy, Geertsen, Valérie, Guenoun, Patrick, Bonamy, Daniel
We examine how disordering joint position influences the linear elastic behavior of lattice materials via numerical simulations in two-dimensional beam networks. Three distinct initial crystalline geometries are selected as representative of mechanic
Externí odkaz:
http://arxiv.org/abs/2206.06845
Autor:
Bonamy, Marthe, Bonnet, Édouard, Déprés, Hugues, Esperet, Louis, Geniet, Colin, Hilaire, Claire, Thomassé, Stéphan, Wesolek, Alexandra
Publikováno v:
Journal of Combinatorial Theory, Series B 167 (2024), 215-249
A graph is $\mathcal{O}_k$-free if it does not contain $k$ pairwise vertex-disjoint and non-adjacent cycles. We prove that "sparse" (here, not containing large complete bipartite graphs as subgraphs) $\mathcal{O}_k$-free graphs have treewidth (even,
Externí odkaz:
http://arxiv.org/abs/2206.00594
We consider Kempe changes on the $k$-colorings of a graph on $n$ vertices. If the graph is $(k-1)$-degenerate, then all its $k$-colorings are equivalent up to Kempe changes. However, the sequence between two $k$-colorings that arises from the proof m
Externí odkaz:
http://arxiv.org/abs/2112.02313
Autor:
Bonamy, Marthe, Bonnet, Édouard, Bousquet, Nicolas, Charbit, Pierre, Giannopoulos, Panos, Kim, Eun Jung, Rzążewski, Paweł, Sikora, Florian, Thomassé, Stéphan
Publikováno v:
J. ACM 68(2): 9:1-9:38 (2021)
A (unit) disk graph is the intersection graph of closed (unit) disks in the plane. Almost three decades ago, an elegant polynomial-time algorithm was found for \textsc{Maximum Clique} on unit disk graphs [Clark, Colbourn, Johnson; Discrete Mathematic
Externí odkaz:
http://arxiv.org/abs/2110.15419