Athanasios Rafail Mamatsis

Mr. Athanasios Rafail Mamatsis

School of Electrical and Computer Engineering, National Technical University of Athens
orcid

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
14 December 2020 in Algorithms
Verified
Journal Article
Open access
PDF file
EKE Koukoutsis
E Koukoutsis
CPC Papaodysseus
C Papaodysseus
GEORGIOS TSAVDARIDISGEORGIOS TSAVDARIDIS
GEORGIOS TSAVDARIDIS
Nikolaos KaradimasNikolaos Karadimas
Nikolaos Karadimas
ABA Ballis
A Ballis
AMAthanasios Rafail Mamatsis
Athanasios Rafail Mamatsis
Recently, very large-scale decision support systems (DSSs) have been developed, which tackle very complex problems, associated with very extensive and polymorphic information, which probably is geographically highly dispersed. The management, updating, modification and upgrading of the data and program core of such an information system is, as a rule, a very difficult task, which encompasses many hazards and risks. The purpose of the present work was (a) to list the more significant of these hazards and risks and (b) to introduce a new general methodology for designing decision support (DS) systems that are robust and circumvent these risks. The core of this new approach was the introduction of a meta-database, called teleological, on the base of which management, updating, modification, reduction, growth and upgrading of the system may be safely and efficiently achieved. The very same teleological meta-database can be used for the construction of a sound decision support system, incorporating elements of a previous one at a future stage

15 August 2021 in Informatics
Verified
Journal Article
Open access
PDF file
CCConstantinos Chalatsis
Constantinos Chalatsis
CPConstantin Papaodysseus
Constantin Papaodysseus
DADimitris Arabadjis
Dimitris Arabadjis
AMAthanasios Rafail Mamatsis
Athanasios Rafail Mamatsis
Nikolaos KaradimasNikolaos Karadimas
Nikolaos Karadimas
A first aim of the present work is the determination of the actual sources of the “finite precision error” generation and accumulation in two important algorithms: Bernoulli’s map and the folded Baker’s map. These two computational schemes attract the attention of a growing number of researchers, in connection with a wide range of applications. However, both Bernoulli’s and Baker’s maps, when implemented in a contemporary computing machine, suffer from a very serious numerical error due to the finite word length. This error, causally, causes a failure of these two algorithms after a relatively very small number of iterations. In the present manuscript, novel methods for eliminating this numerical error are presented. In fact, the introduced approach succeeds in executing the Bernoulli’s map and the folded Baker’s map in a computing machine for many hundreds of thousands of iterations, offering results practically free of finite precision error. These successful techniques are based on the determination and understanding of the substantial sources of finite precision (round-off) error, which is generated and accumulated in these two important chaotic maps.

21 February 2021
Verified
Book Chapter
Closed access
PDF file
DADimitris Arabadjis
Dimitris Arabadjis
CPConstantin Papaodysseus
Constantin Papaodysseus
AMAthanasios Rafail Mamatsis
Athanasios Rafail Mamatsis
EMEirini Mamatsi
Eirini Mamatsi

25 May 2021 in Mathematics
Verified
Journal Article
Open access
PDF file
CPConstantin Papaodysseus
Constantin Papaodysseus
DADimitris Arabadjis
Dimitris Arabadjis
FGFotios Giannopoulos
Fotios Giannopoulos
AMAthanasios Rafail Mamatsis
Athanasios Rafail Mamatsis
CCConstantinos Chalatsis
Constantinos Chalatsis
In the present paper, a novel approach is introduced for the study, estimation and exact tracking of the finite precision error generated and accumulated during any number of multiplications. It is shown that, as a rule, this operation is very “toxic”, in the sense that it may force the finite precision error accumulation to grow arbitrarily large, under specific conditions that are fully described here. First, an ensemble of definitions of general applicability is given for the rigorous determination of the number of erroneous digits accumulated in any quantity of an arbitrary algorithm. Next, the exact number of erroneous digits produced in a single multiplication is given as a function of the involved operands, together with formulae offering the corresponding probabilities. In case the statistical properties of these operands are known, exact evaluation of the aforementioned probabilities takes place. Subsequently, the statistical properties of the accumulated finite precision error during any number of successive multiplications are explicitly analyzed. A method for exact tracking of this accumulated error is presented, together with associated theorems. Moreover, numerous dedicated experiments are developed and the corresponding results that fully support the theoretical analysis are given. Eventually, a number of important, probable and possible applications is proposed, where all of them are based on the methodology and the results introduced in the present work. The proposed methodology is expandable, so as to tackle the round-off error analysis in all arithmetic operations.

15 June 2022 in Journal of Cultural Heritage
Verified
Journal Article
Closed access
CPConstantin Papaodysseus
Constantin Papaodysseus
EME. Mamatsi
E. Mamatsi
AMAthanasios Rafail Mamatsis
Athanasios Rafail Mamatsis
CBC. Blackwell
C. Blackwell
DADimitris Arabadjis
Dimitris Arabadjis
AHA. Harami
A. Harami