Alphabetical menu construction algorithm of polynomial complexity
Abstract
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.
References
1. Leonard J. A. Tactual choice reactions: I // Quarterly Journal of Experimental Psychology. 1959. V. 11, № 2. P. 76-83.
2. 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.
3. Hick W. E. On the rate of gain of information // Quarterly Journal of Experimental Psychology. 1952. V. 4. P. 11-26.
4. 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.
5. 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.
6. Нечта И. В., Рябко Б. Я., Савина Н. Н. Применение алфавитного кодирования для оптимизации интерфейса // Computational technologies. 2015. T. 20, № 5. C. 97-104.
7. Нечта И. В. Построение меню при помощи алфавитного кода // Вестник СибГУТИ. 2015. № 4. C. 40-46.
Review
For citations:
Nechta I... Alphabetical menu construction algorithm of polynomial complexity. The Herald of the Siberian State University of Telecommunications and Information Science. 2017;(1):90-95. (In Russ.)
Views:
771
Email this article 
