<?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Publishing DTD v1.3 20210610//EN" "JATS-journalpublishing1-3.dtd">
<article article-type="research-article" dtd-version="1.3" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xml:lang="ru"><front><journal-meta><journal-id journal-id-type="publisher-id">mais</journal-id><journal-title-group><journal-title xml:lang="ru">Моделирование и анализ информационных систем</journal-title><trans-title-group xml:lang="en"><trans-title>Modeling and Analysis of Information Systems</trans-title></trans-title-group></journal-title-group><issn pub-type="ppub">1818-1015</issn><issn pub-type="epub">2313-5417</issn><publisher><publisher-name>Yaroslavl State University</publisher-name></publisher></journal-meta><article-meta><article-id pub-id-type="doi">10.18255/1818-1015-2020-1-40-47</article-id><article-id custom-type="elpub" pub-id-type="custom">mais-1286</article-id><article-categories><subj-group subj-group-type="heading"><subject>Research Article</subject></subj-group><subj-group subj-group-type="section-heading" xml:lang="ru"><subject>Theory of Computing</subject></subj-group></article-categories><title-group><article-title>Об одном разбиении отрезка, применяемом для оценки энтропии</article-title><trans-title-group xml:lang="en"><trans-title>On a Segment Partition for Entropy Estimation</trans-title></trans-title-group></title-group><contrib-group><contrib contrib-type="author" corresp="yes"><contrib-id contrib-id-type="orcid">https://orcid.org/0000-0002-3094-4390</contrib-id><name-alternatives><name name-style="eastern" xml:lang="ru"><surname>Тимофеев</surname><given-names>Евгений Александрович</given-names></name><name name-style="western" xml:lang="en"><surname>Timofeev</surname><given-names>Evgeniy Alexandrovich</given-names></name></name-alternatives><bio xml:lang="ru"><p>доктор. физ.-мат. наук., профессор кафедры теоретической информатики</p></bio><bio xml:lang="en"><p>Sc.D., professor</p></bio><email xlink:type="simple">timofeevEA@gmail.com</email><xref ref-type="aff" rid="aff-1"/></contrib></contrib-group><aff-alternatives id="aff-1"><aff xml:lang="ru">Ярославский государственный университет им. П. Г. Демидова<country>Россия</country></aff><aff xml:lang="en">P. G. Demidov Yaroslavl State University<country>Russian Federation</country></aff></aff-alternatives><pub-date pub-type="collection"><year>2020</year></pub-date><pub-date pub-type="epub"><day>19</day><month>03</month><year>2020</year></pub-date><volume>27</volume><issue>1</issue><fpage>40</fpage><lpage>47</lpage><permissions><copyright-statement>Copyright &amp;#x00A9; Тимофеев Е.А., 2020</copyright-statement><copyright-year>2020</copyright-year><copyright-holder xml:lang="ru">Тимофеев Е.А.</copyright-holder><copyright-holder xml:lang="en">Timofeev E.A.</copyright-holder><license license-type="creative-commons-attribution" xlink:href="https://creativecommons.org/licenses/by/4.0/" xlink:type="simple"><license-p>This work is licensed under a Creative Commons Attribution 4.0 License.</license-p></license></permissions><self-uri xlink:href="https://www.mais-journal.ru/jour/article/view/1286">https://www.mais-journal.ru/jour/article/view/1286</self-uri><abstract><p>В работе изучается разбиение отрезка, которое строится по следующему правилу:\(\begin{array}{l}Q_1 =\{0,q^2,q,1\}.  \\Q_{n+1}' = qQ_n \cap q^2Q_n, \ \Q_{n+1}'' = q^2+qQ_n \cap qQ_n, \ \Q_{n+1}'''= q^2+qQ_n \cap q+q^2Q_n,  \\Q_{n+1} = Q_{n+1}'\cup Q_{n+1}'' \cup Q_{n+1}''',  \end{array}\)где \(q^2+q=1\).Введем последовательность  чисел \(d= 1,2,1,0,1,2,1,0,1,0,1,2,1,0,1,2,1,\dots\), положив\(\begin{array}{l}  d_1=1, \ d_2=2,\ d_4 =0; \\ d[2F_{2n}+1 : 2F_{2n+1}+1] = d[1:2F_{2n-1}+1];\\ \quad  n = 0,1,2,\dots;\\d[2F_{2n+1}+2 : 2F_{2n+1}+2F_{2n-2}] = d[2F_{2n-1}+2:2F_{2n}];\\d[2F_{2n+1}+2F_{2n-2}+1 : 2F_{2n+1}+2F_{2n-1}+1] = d[1:2F_{2n-3}+1];\\d[2F_{2n+1}+2F_{2n-1}+2 : 2F_{2n+2}] = d[2F_{2n-1}+2:2F_{2n}];\\ \quad n = 1,2,3,\dots;\\  \end{array}\)где \(F_n\) - числа Фибоначчи (\(F_{-1} = 0, F_0=F_1=1\)).Основной результат работы.\({\bf Теорема.}\\Q_n' = 1 - Q_n''' =\left \{ \sum_{i=1}^k q^{n+d_i}, \ k=0,1,\dots, m_n\right\},\\Q_n'' = 1 - Q_n'' = \left\{q^2 + \sum_{i=m_n}^k  q^{n+d_i}, \ k=m_n-1,m_n,\dots, m_{n+1} \right\},\)где \(m_{2n} = 2F_{2n-2}, \ m_{2n+1} = 2F_{2n-1}+1\).</p></abstract><trans-abstract xml:lang="en"><p>Let \(Q_n\) be a partition of the interval \([0,1]\) defines as\(\begin{array}{l}Q_1 =\{0,q^2,q,1\}.  \\Q_{n+1}' = qQ_n \cap q^2Q_n, \ \Q_{n+1}'' = q^2+qQ_n \cap qQ_n, \ \Q_{n+1}'''= q^2+qQ_n \cap q+q^2Q_n,  \\Q_{n+1} = Q_{n+1}'\cup Q_{n+1}'' \cup Q_{n+1}''',  \end{array}\)where \(q^2+q=1\).The sequence  \(d= 1,2,1,0,1,2,1,0,1,0,1,2,1,0,1,2,1,\dots\) defines as follows.\(\begin{array}{l}  d_1=1, \ d_2=2,\ d_4 =0; d[2F_{2n}+1 : 2F_{2n+1}+1] = d[1:2F_{2n-1}+1];\\ \quad  n = 0,1,2,\dots;\\d[2F_{2n+1}+2 : 2F_{2n+1}+2F_{2n-2}] = d[2F_{2n-1}+2:2F_{2n}];\\d[2F_{2n+1}+2F_{2n-2}+1 : 2F_{2n+1}+2F_{2n-1}+1] = d[1:2F_{2n-3}+1];\\d[2F_{2n+1}+2F_{2n-1}+2 : 2F_{2n+2}] = d[2F_{2n-1}+2:2F_{2n}];\\ \quad n = 1,2,3,\dots;\\  \end{array}\)where \(F_n\) are Fibonacci numbers (\(F_{-1} = 0, F_0=F_1=1\)).The main result of this paper.\({\bf Theorem.}\\Q_n' = 1 - Q_n''' =\left \{ \sum_{i=1}^k q^{n+d_i}, \ k=0,1,\dots, m_n\right\},\\Q_n'' = 1 - Q_n'' = \left\{q^2 + \sum_{i=m_n}^k  q^{n+d_i}, \ k=m_n-1,m_n,\dots, m_{n+1} \right\},\\\)where \(m_{2n} = 2F_{2n-2}, \ m_{2n+1} = 2F_{2n-1}+1\).</p></trans-abstract><kwd-group xml:lang="ru"><kwd>мера</kwd><kwd>метрика</kwd><kwd>энтропия</kwd><kwd>оценка</kwd><kwd>несмещенность</kwd><kwd>самоподобие</kwd><kwd>мера Бернулли</kwd></kwd-group><kwd-group xml:lang="en"><kwd>measure</kwd><kwd>metric</kwd><kwd>entropy</kwd><kwd>estimation</kwd><kwd>unbiased</kwd><kwd>self-similarity</kwd><kwd>Bernoulli measure</kwd></kwd-group></article-meta></front><back><ref-list><title>References</title><ref id="cit1"><label>1</label><citation-alternatives><mixed-citation xml:lang="ru">E. Timofeev, “Existence of an unbiased consistent entropy estimator for the special Bernoulli measure”, Modeling and Analysis of Information Systems, vol. 26, no. 2, pp. 267–278, 2019.</mixed-citation><mixed-citation xml:lang="en">E. Timofeev, “Existence of an unbiased consistent entropy estimator for the special Bernoulli measure”, Modeling and Analysis of Information Systems, vol. 26, no. 2, pp. 267–278, 2019.</mixed-citation></citation-alternatives></ref></ref-list><fn-group><fn fn-type="conflict"><p>The authors declare that there are no conflicts of interest present.</p></fn></fn-group></back></article>
