Gianfranco D’Atri

Prof. Gianfranco D’Atri


Research Focus & Metrics

Academic Career Length

7Years (2020-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
29 August 2020 in Soft Computing
Verified
Journal Article
Open access
PDF file
Fabio CaldarolaFabio Caldarola
Fabio Caldarola
GDGianfranco D’Atri
Gianfranco D’Atri
Mario MaioloMario Maiolo
Mario Maiolo
GPGiuseppe Pirillo
Giuseppe Pirillo
Fibonacci numbers are the basis of a new geometric construction that leads to the definition of a family $$\{C_n:n\in \mathbb {N}\}$$ { C n : n ∈ N } of octagons that come very close to the regular octagon. Such octagons, in some previous articles, have been given the name of Carboncettus octagons for historical reasons. Going further, in this paper we want to introduce and investigate some algebraic constructs that arise from the family $$\{C_n:n\in \mathbb {N}\}$$ { C n : n ∈ N } and therefore from Fibonacci numbers: From each Carboncettus octagon $$C_n$$ C n , it is possible to obtain an infinite (right) word $$W_n$$ W n on the binary alphabet $$\{0,1\}$$ { 0 , 1 } , which we will call the nth Carboncettus word. The main theorem shows that all the Carboncettus words thus defined are Sturmian words except in the case $$n=5$$ n = 5 . The fifth Carboncettus word $$W_5$$ W 5 is in fact the only word of the family to be purely periodic: It has period 17 and periodic factor 000 100 100 010 010 01. Finally, we also define a further word $$W_{\infty }$$ W ∞ named the Carboncettus limit word and, as second main result, we prove that the limit of the sequence of Carboncettus words is $$W_{\infty }$$ W ∞ itself.

23 August 2022 in Mathematics
Verified
Journal Article
Open access
PDF file
Fabio CaldarolaFabio Caldarola
Fabio Caldarola
GDGianfranco D’Atri
Gianfranco D’Atri
EZEnrico Zanardo
Enrico Zanardo
To protect participants’ confidentiality, blockchains can be outfitted with anonymization methods. Observations of the underlying network traffic can identify the author of a transaction request, although these mechanisms often only consider the abstraction layer of blockchains. Previous systems either give topological confidentiality that may be compromised by an attacker in control of a large number of nodes, or provide strong cryptographic confidentiality but are so inefficient as to be practically unusable. In addition, there is no flexible mechanism to swap confidentiality for efficiency in order to accommodate practical demands. We propose a novel approach, the neural fairness protocol, which is a blockchain-based distributed ledger secured using neural networks and machine learning algorithms, enabling permissionless participation in the process of transition validation while concurrently providing strong assurance about the correct functioning of the entire network. Using cryptography and a custom implementation of elliptic curves, the protocol is designed to ensure the confidentiality of each transaction phase and peer-to-peer data exchange.

17 January 2022 in International Electronic Journal of Algebra
Verified
Journal Article
Closed access
PDF file
ALAntonino Leonardis
Antonino Leonardis
GDGianfranco D’Atri
Gianfranco D’Atri
Fabio CaldarolaFabio Caldarola
Fabio Caldarola
Literature considers under the name "unimaginable numbers" any positive integer going beyond any physical application. One of the most known methodologies to conceive such numbers is using hyper-operations, that is a sequence of binary functions dened recursively starting from the usual chain: addition - multiplication - exponentiation. The most important notations to represent such hyper-operations have been considered by Knuth, Goodstein, Ackermann and Conway as described in this work's introduction. Within this work we will give an axiomatic setup for this topic, and then try to nd on one hand other ways to represent unimaginable numbers, as well as on the other hand applications to computer science, where the algorithmic nature of representations and the increased computation capabilities of computers give the perfect eld to develop further the topic, exploring some possibilities to effectively operate with such big numbers. In particular, we will give some axioms and generalizations for the up-arrow notation and, considering a representation via rooted trees of the hereditary base-n notation, we will determine in some cases an effective bound related to "Goodstein sequences" using Knuths notation. Finally, we will also analyze some methods to compare big numbers, proving specically a theorem about approximation using scientic notation and a theorem on hyperoperation bounds for Steinhaus-Moser notation.