Zobrazeno 1 - 10
of 1 034
pro vyhledávání: '"A. Berardini"'
Autor:
V. Parisi, R. Baldassarre, V. Ferrara, R. Ditaranto, F. Barlocco, R. Lillo, F. Re, G. Marchi, C. Chiti, F. Di Nicola, C. Catalano, L. Barile, M. A. Schiavo, A. Ponziani, G. Saturi, A. G. Caponetti, A. Berardini, M. Graziosi, F. Pasquale, I. Salamon, M. Ferracin, E. Nardi, I. Capelli, D. Girelli, J. R. Gimeno Blanes, M. Biffi, N. Galiè, I. Olivotto, F. Graziani, E. Biagini
Publikováno v:
Frontiers in Cardiovascular Medicine, Vol 10 (2023)
BackgroundElectrocardiogram (ECG) has proven to be useful for early detection of cardiac involvement in Anderson-Fabry disease (AFD); however, little evidence is available on the association between ECG alterations and the progression of the disease.
Externí odkaz:
https://doaj.org/article/0241850bfd9049889039bb4c3205d153
Autor:
Cacciatore, Alessandro, Morelli, Valerio, Paganica, Federica, Frontoni, Emanuele, Migliorelli, Lucia, Berardini, Daniele
Deep learning has long been dominated by multi-layer perceptrons (MLPs), which have demonstrated superiority over other optimizable models in various domains. Recently, a new alternative to MLPs has emerged - Kolmogorov-Arnold Networks (KAN)- which a
Externí odkaz:
http://arxiv.org/abs/2409.13550
We characterise abelian surfaces defined over finite fields containing no curves of genus less than or equal to $3$. Firstly, we complete and expand the characterisation of isogeny classes of abelian surfaces with no curves of genus up to $2$ initiat
Externí odkaz:
http://arxiv.org/abs/2408.02493
Autor:
Berardini, Elena, Caruso, Xavier
We introduce the sum-rank metric analogue of Reed-Muller codes, which we called linearized Reed-Muller codes, using multivariate Ore polynomials. We study the parameters of these codes, compute their dimension and give a lower bound for their minimum
Externí odkaz:
http://arxiv.org/abs/2405.09944
Publikováno v:
Designs, Codes and Cryptography (2024)
We investigate CSS and CSS-T quantum error-correcting codes from the point of view of their existence, rarity, and performance. We give a lower bound on the number of pairs of linear codes that give rise to a CSS code with good correction capability,
Externí odkaz:
http://arxiv.org/abs/2310.16504
Autor:
Migliorelli, Lucia, Berardini, Daniele, Cela, Kevin, Coccia, Michela, Villani, Laura, Frontoni, Emanuele, Moccia, Sara
Background and objectives: Patients suffering from neurological diseases may develop dysarthria, a motor speech disorder affecting the execution of speech. Close and quantitative monitoring of dysarthria evolution is crucial for enabling clinicians t
Externí odkaz:
http://arxiv.org/abs/2309.09038
Autor:
Clarke, Jennifer L., Cooper, Laurel D., Poelchau, Monica F., Berardini, Tanya Z., Elser, Justin, Farmer, Andrew D., Ficklin, Stephen, Kumari, Sunita, Laporte, Marie-Angélique, Nelson, Rex T., Sadohara, Rie, Selby, Peter, Thessen, Anne E., Whitehead, Brandon, Sen, Taner Z.
Over the last several decades, there has been rapid growth in the number and scope of agricultural genetics, genomics and breeding (GGB) databases and resources. The AgBioData Consortium (https://www.agbiodata.org/) currently represents 44 databases
Externí odkaz:
http://arxiv.org/abs/2307.08958
Autor:
Berardini, Elena, Caruso, Xavier
Publikováno v:
IEEE Transactions on Information Theory, vol. 70, no. 5, pp. 3345-3356, May 2024
We introduce the first geometric construction of codes in the sum-rank metric, which we called linearized Algebraic Geometry codes, using quotients of the ring of Ore polynomials with coefficients in the function field of an algebraic curve. We study
Externí odkaz:
http://arxiv.org/abs/2303.08903
Autor:
Gonçalves, Carolina, Lopes, João M., Moccia, Sara, Berardini, Daniele, Migliorelli, Lucia, Santos, Cristina P.
Gait disabilities are among the most frequent worldwide. Their treatment relies on rehabilitation therapies, in which smart walkers are being introduced to empower the user's recovery and autonomy, while reducing the clinicians effort. For that, thes
Externí odkaz:
http://arxiv.org/abs/2301.05575
Publikováno v:
ACM Communications in Computer Algebra, Volume 57, Issue 4 (December 2023), 200 - 229
In 1874 Brill and Noether designed a seminal geometric method for computing bases of Riemann-Roch spaces. From then, their method has led to several algorithms, some of them being implemented in computer algebra systems. The usual proofs often rely o
Externí odkaz:
http://arxiv.org/abs/2208.12725