Zobrazeno 1 - 10
of 359
pro vyhledávání: '"Stefano Gabriele"'
Autor:
Katia Librandi, Serena Grimaldi, Silvia Catalano, Francesco Moro, Stefano Gabriele Vallero, Marco Spada, Francesco Porta
Publikováno v:
Frontiers in Pediatrics, Vol 11 (2023)
BackgroundTuberous sclerosis complex (TSC) is a rare multisystemic disorder. This genetically determined disease is characterized by highly variable clinical expression, including epilepsy as a common feature. Seizures can also occur as a manifestati
Externí odkaz:
https://doaj.org/article/722d5794c95c4aeaa969a7e4bafad5b0
Autor:
Stefano Gabriele Vallero, Luca Bertero, Giovanni Morana, Paola Sciortino, Daniele Bertin, Anna Mussano, Federica Silvia Ricci, Paola Peretta, Franca Fagioli
Publikováno v:
Frontiers in Oncology, Vol 12 (2023)
The 2021 World Health Organization Classification of Tumors of the Central Nervous System, Fifth Edition (WHO-CNS5), has strengthened the concept of tumor grade as a combination of histologic features and molecular alterations. The WHO-CNS5 tumor typ
Externí odkaz:
https://doaj.org/article/e5e35665c53044f9aaaa7ec0b825ee94
Publikováno v:
Applied Mechanics, Vol 2, Iss 3, Pp 630-649 (2021)
In this work, an equivalent continuum of a barrel gridshell is introduced. Constitutive identification procedures based on periodic homogenization are provided in the literature for this purpose, based on a flat Representative Element Volume (REV), n
Externí odkaz:
https://doaj.org/article/d077c46b4ada49a2aa8fe0cb8fdb31ce
In this paper we consider a colouring version of the general position problem. The \emph{$\gp $-chromatic number} is the smallest number of colours needed to colour $V(G)$ such that each colour class has the no-three-in-line property. We determine bo
Externí odkaz:
http://arxiv.org/abs/2408.13494
Visibility problems have been investigated for a long time under different assumptions as they pose challenging combinatorial problems and are connected to robot navigation problems. The mutual-visibility problem in a graph $G$ of $n$ vertices asks t
Externí odkaz:
http://arxiv.org/abs/2407.00409
For a set of robots (or agents) moving in a graph, two properties are highly desirable: confidentiality (i.e., a message between two agents must not pass through any intermediate agent) and efficiency (i.e., messages are delivered through shortest pa
Externí odkaz:
http://arxiv.org/abs/2405.13615
Autor:
Paolo Piras, Ivan Colorado-Cervantes, Paola Nardinocchi, Stefano Gabriele, Valerio Varano, Giuseppe Esposito, Luciano Teresi, Concetta Torromeo, Paolo Emilio Puddu
Publikováno v:
Journal of Cardiovascular Development and Disease, Vol 9, Iss 11, p 393 (2022)
The directions of primary strain lines of local deformation in Epicardial and Endocardial layers have been the subject of debate in recent years. Different methods led to different conclusions and a complete assessment of strain direction patterns in
Externí odkaz:
https://doaj.org/article/c3980ff1a94a4736a3c4e543ad903b11
Publikováno v:
Mathematics, Vol 10, Iss 9, p 1562 (2022)
In shape analysis, the interpolation of shapes’ trajectories is often performed by means of geodesics in an appropriate Riemannian Shape Space. Over the past several decades, different metrics and shape spaces have been proposed, including Kendall
Externí odkaz:
https://doaj.org/article/ccda4443c5d141a7aa55baa64f7b5a41
Autor:
Fabrizio Ricci, Carlo De Innocentiis, Elvira Verrengia, Laura Ceriello, Cesare Mantini, Carla Pietrangelo, Flaviano Irsuti, Stefano Gabriele, Alberto D'Alleva, Mohammed Y. Khanji, Nay Aung, Giulia Renda, Matteo Cameli, Steffen E. Petersen, Ernesto Di Cesare, Sabina Gallina
Publikováno v:
Frontiers in Cardiovascular Medicine, Vol 7 (2020)
The burden of pregnancy-related heart disease has dramatically increased over the last decades due to the increasing age at first pregnancy and higher prevalence of cardiovascular risk factors such as diabetes, hypertension, and obesity. Pregnancy is
Externí odkaz:
https://doaj.org/article/353a725ff0aa4246800dab063b004795
The mutual-visibility problem in a graph $G$ asks for the cardinality of a largest set of vertices $S\subseteq V(G)$ so that for any two vertices $x,y\in S$ there is a shortest $x,y$-path $P$ so that all internal vertices of $P$ are not in $S$. This
Externí odkaz:
http://arxiv.org/abs/2401.02373