In this article, analytical results are obtained apparently for the first time in the literature, for the lower and upper bounds of the roots of quadratic equations when two or all three coefficients a, b, c constitut...In this article, analytical results are obtained apparently for the first time in the literature, for the lower and upper bounds of the roots of quadratic equations when two or all three coefficients a, b, c constitute an interval, with a method called the sign-variation analysis. The results are compared with the parametrization technique offered by Elishakoff and Miglis, and with the solution yielded by minimization and maximization commands of the Maple software. Solutions for some interval word problems are also provided to edulcorate the methodology. This article only focuses on the real roots of those quadratic equations, complex solutions being beyond this investigation.展开更多
We study the short-term memory capacity of ancient readers of the original New Testament written in Greek, of its translations to Latin and to modern languages. To model it, we consider the number of words between any...We study the short-term memory capacity of ancient readers of the original New Testament written in Greek, of its translations to Latin and to modern languages. To model it, we consider the number of words between any two contiguous interpunctions I<sub>p</sub>, because this parameter can model how the human mind memorizes “chunks” of information. Since I<sub>P</sub> can be calculated for any alphabetical text, we can perform experiments—otherwise impossible— with ancient readers by studying the literary works they used to read. The “experiments” compare the I<sub>P</sub> of texts of a language/translation to those of another language/translation by measuring the minimum average probability of finding joint readers (those who can read both texts because of similar short-term memory capacity) and by defining an “overlap index”. We also define the population of universal readers, people who can read any New Testament text in any language. Future work is vast, with many research tracks, because alphabetical literatures are very large and allow many experiments, such as comparing authors, translations or even texts written by artificial intelligence tools.展开更多
文摘In this article, analytical results are obtained apparently for the first time in the literature, for the lower and upper bounds of the roots of quadratic equations when two or all three coefficients a, b, c constitute an interval, with a method called the sign-variation analysis. The results are compared with the parametrization technique offered by Elishakoff and Miglis, and with the solution yielded by minimization and maximization commands of the Maple software. Solutions for some interval word problems are also provided to edulcorate the methodology. This article only focuses on the real roots of those quadratic equations, complex solutions being beyond this investigation.
文摘We study the short-term memory capacity of ancient readers of the original New Testament written in Greek, of its translations to Latin and to modern languages. To model it, we consider the number of words between any two contiguous interpunctions I<sub>p</sub>, because this parameter can model how the human mind memorizes “chunks” of information. Since I<sub>P</sub> can be calculated for any alphabetical text, we can perform experiments—otherwise impossible— with ancient readers by studying the literary works they used to read. The “experiments” compare the I<sub>P</sub> of texts of a language/translation to those of another language/translation by measuring the minimum average probability of finding joint readers (those who can read both texts because of similar short-term memory capacity) and by defining an “overlap index”. We also define the population of universal readers, people who can read any New Testament text in any language. Future work is vast, with many research tracks, because alphabetical literatures are very large and allow many experiments, such as comparing authors, translations or even texts written by artificial intelligence tools.
