A New Stylometry Method Basing on the Numerals Statistic
Andrei Viacheslavovich Zenkov,
Larisa Anatolievna Sazanova
Issue:
Volume 3, Issue 2, March 2017
Pages:
16-23
Received:
22 March 2017
Accepted:
25 April 2017
Published:
22 May 2017
Abstract: A new method of statistical analysis of texts is suggested. The frequency distribution of the first significant digits in numerals of connected authorial English-language texts is considered. Benford's law is found to hold approximately for these frequencies with a marked predominance of the digit 1. Deviations from Benford's law are statistically significant author peculiarities that allow, under certain conditions, to consider the problem of authorship and distinguish between texts by different authors. At the end of {1, 2,…, 8, 9} row, the digits distribution is subject to strong fluctuations and thus unrepresentative for our purpose. The approach suggested and the conclusions are backed by the examples of the computer analysis of works by W. M. Thackeray, M. Twain, R. L. Stevenson et al. The results are confirmed on the basis of non-parametric range Mann-Whitney and Kruskal-Wallis tests as well as the parametric Pearson's chi-squared test.
Abstract: A new method of statistical analysis of texts is suggested. The frequency distribution of the first significant digits in numerals of connected authorial English-language texts is considered. Benford's law is found to hold approximately for these frequencies with a marked predominance of the digit 1. Deviations from Benford's law are statistically ...
Show More
Intelligence Classification of the Timetable Problem: A Memetic Approach
Eboka Andrew Okonji,
Yerokun Mary Oluwatoyin,
Okoba Ifeoma Patricia
Issue:
Volume 3, Issue 2, March 2017
Pages:
24-33
Received:
5 April 2017
Accepted:
15 May 2017
Published:
27 July 2017
Abstract: Scheduling tasks persist in our daily functioning and as academia, abounds more in University circle as hard-NP constraint satisfaction tasks. Many studies exist with the objective of resolving the many conflicted constraints that exists in a timetable schedule using various algorithms. Many of such algorithms simply search the domain space for a goal state that satisfies the problem constraints. Our study yields an outcome assignment that provides a complete, feasible and optimal academic schedule that satisfies medium cum hard constraints for the Federal University of Petroleum Resource Effurun in Delta State of Nigeria using memetic algorithm. Results showed that model converges after 4minutes and 29seconds; while its convergence time depends on use of belief space to ensure agents do not violate model bounds, encoding scheme used amongst others. The schedule considers both instructors and students’ preference as medium constraints of high priority.
Abstract: Scheduling tasks persist in our daily functioning and as academia, abounds more in University circle as hard-NP constraint satisfaction tasks. Many studies exist with the objective of resolving the many conflicted constraints that exists in a timetable schedule using various algorithms. Many of such algorithms simply search the domain space for a g...
Show More
