<?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">sibsutis</journal-id><journal-title-group><journal-title xml:lang="ru">Вестник СибГУТИ</journal-title><trans-title-group xml:lang="en"><trans-title>The Herald of the Siberian State University of Telecommunications and Information Science</trans-title></trans-title-group></journal-title-group><issn pub-type="ppub">1998-6920</issn><publisher><publisher-name>СибГУТИ</publisher-name></publisher></journal-meta><article-meta><article-id custom-type="elpub" pub-id-type="custom">sibsutis-250</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>Статьи</subject></subj-group></article-categories><title-group><article-title>Алгоритм построения алфавитного меню полиномиальной сложности</article-title><trans-title-group xml:lang="en"><trans-title>Alphabetical menu construction algorithm of polynomial complexity</trans-title></trans-title-group></title-group><contrib-group><contrib contrib-type="author" corresp="yes"><name-alternatives><name name-style="eastern" xml:lang="ru"><surname>Нечта</surname><given-names>И. В.</given-names></name><name name-style="western" xml:lang="en"><surname>Nechta</surname><given-names>I. ..</given-names></name></name-alternatives><email xlink:type="simple">tal200@lenta.ru</email><xref ref-type="aff" rid="aff-1"/></contrib></contrib-group><aff xml:lang="ru" id="aff-1"><institution>СибГУТИ</institution><country>Russian Federation</country></aff><pub-date pub-type="collection"><year>2017</year></pub-date><pub-date pub-type="epub"><day>24</day><month>10</month><year>2022</year></pub-date><volume>0</volume><issue>1</issue><fpage>90</fpage><lpage>95</lpage><permissions><copyright-statement>Copyright &amp;#x00A9; Нечта И.В., 2022</copyright-statement><copyright-year>2022</copyright-year><copyright-holder xml:lang="ru">Нечта И.В.</copyright-holder><copyright-holder xml:lang="en">Nechta I...</copyright-holder><license xml:lang="ru" license-type="creative-commons-attribution" xlink:href="https://creativecommons.org/licenses/by/4.0/" xlink:type="simple"><license-p>Данная работа распространяется под лицензией Creative Commons Attribution 4.0.</license-p></license><license xml:lang="en" 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://vestnik.sibsutis.ru/jour/article/view/250">https://vestnik.sibsutis.ru/jour/article/view/250</self-uri><abstract><p>В настоящей работе предложен алгоритм автоматического построения алфавитного меню, имеющий квадратичную трудоемкость. Указанный алгоритм позволяет использовать ограничения, накладываемые на ширину уровней меню. В работе также представлены результаты экспериментальных исследований времени работы пользователя с меню до оптимизации и после. Показано, что оптимизация становится эффективной при размере меню 700 и более элементов.</p></abstract><trans-abstract xml:lang="en"><p>In this paper, we propose an algorithm for automatic construction of alphabetical menu with polynomial-quadratic complexity. This algorithm allows us to use restrictions on the width of the menu levels. The results of experimental research of user working time with the menu before and after optimization are presented. It is shown that our optimization becomes effective when the size of the menu items equals 700 or larger.</p></trans-abstract><kwd-group xml:lang="ru"><kwd>оптимизация меню</kwd><kwd>закон Хика</kwd><kwd>оптимизация интерфейса</kwd></kwd-group><kwd-group xml:lang="en"><kwd>menu optimization</kwd><kwd>Hick's law</kwd><kwd>interface optimization</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">Leonard J. A. Tactual choice reactions: I // Quarterly Journal of Experimental Psychology. 1959. V. 11, № 2. P. 76-83.</mixed-citation><mixed-citation xml:lang="en">Leonard J. A. Tactual choice reactions: I // Quarterly Journal of Experimental Psychology. 1959. V. 11, № 2. P. 76-83.</mixed-citation></citation-alternatives></ref><ref id="cit2"><label>2</label><citation-alternatives><mixed-citation xml:lang="ru">Dassonville P., Lewis S. M., Foster H. E., Ashe J. Choice and stimulus-response compatibility affect duration of response selection // Cognitive Brain Research. 1999. V. 7, № 3. P. 235-240.</mixed-citation><mixed-citation xml:lang="en">Dassonville P., Lewis S. M., Foster H. E., Ashe J. Choice and stimulus-response compatibility affect duration of response selection // Cognitive Brain Research. 1999. V. 7, № 3. P. 235-240.</mixed-citation></citation-alternatives></ref><ref id="cit3"><label>3</label><citation-alternatives><mixed-citation xml:lang="ru">Hick W. E. On the rate of gain of information // Quarterly Journal of Experimental Psychology. 1952. V. 4. P. 11-26.</mixed-citation><mixed-citation xml:lang="en">Hick W. E. On the rate of gain of information // Quarterly Journal of Experimental Psychology. 1952. V. 4. P. 11-26.</mixed-citation></citation-alternatives></ref><ref id="cit4"><label>4</label><citation-alternatives><mixed-citation xml:lang="ru">Fitts P. M. The information capacity of the human motor system in controlling the amplitude of movement // Journal of Experimental Psychology. 1954. V. 47 (6). P. 381-391.</mixed-citation><mixed-citation xml:lang="en">Fitts P. M. The information capacity of the human motor system in controlling the amplitude of movement // Journal of Experimental Psychology. 1954. V. 47 (6). P. 381-391.</mixed-citation></citation-alternatives></ref><ref id="cit5"><label>5</label><citation-alternatives><mixed-citation xml:lang="ru">Witten I. H., Cleary J. G., Greenberg S. On frequency-based menu-splitting algorithms // International Journal of Man-Machine Studies. 1984. V. 21, № 2. P. 135-148.</mixed-citation><mixed-citation xml:lang="en">Witten I. H., Cleary J. G., Greenberg S. On frequency-based menu-splitting algorithms // International Journal of Man-Machine Studies. 1984. V. 21, № 2. P. 135-148.</mixed-citation></citation-alternatives></ref><ref id="cit6"><label>6</label><citation-alternatives><mixed-citation xml:lang="ru">Нечта И. В., Рябко Б. Я., Савина Н. Н. Применение алфавитного кодирования для оптимизации интерфейса // Computational technologies. 2015. T. 20, № 5. C. 97-104.</mixed-citation><mixed-citation xml:lang="en">Нечта И. В., Рябко Б. Я., Савина Н. Н. Применение алфавитного кодирования для оптимизации интерфейса // Computational technologies. 2015. T. 20, № 5. C. 97-104.</mixed-citation></citation-alternatives></ref><ref id="cit7"><label>7</label><citation-alternatives><mixed-citation xml:lang="ru">Нечта И. В. Построение меню при помощи алфавитного кода // Вестник СибГУТИ. 2015. № 4. C. 40-46.</mixed-citation><mixed-citation xml:lang="en">Нечта И. В. Построение меню при помощи алфавитного кода // Вестник СибГУТИ. 2015. № 4. C. 40-46.</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>
