Complexity in Human-Computer Interfaces: Information-Theoretic Approaches and Beyond

A special issue of Mathematics (ISSN 2227-7390). This special issue belongs to the section "Mathematics and Computer Science".

Deadline for manuscript submissions: closed (30 November 2023) | Viewed by 1681

Special Issue Editor


E-Mail Website
Guest Editor
Faculty of Automation and Computer Engineering, Novosibirsk State Technical University, Novosibirsk, Russia
Interests: human-computer interaction; universal design; usability engineering; visual perception; web user interfaces; user behavior models; accessibility; knowledge engineering; machine learning
Special Issues, Collections and Topics in MDPI journals

Special Issue Information

Dear Colleagues,

Evaluation and testing of user interfaces (UIs) is one of the most labor-intensive and subjective stages in software engineering today. Complexity, which is an intensively developed topic in Mathematics, remains quite an elusive attribute in human–computer interaction (HCI).

The straightforward information-theoretic approach and the respective complexity metrics, such as the ones based on Hick–Hyman law, lack the ability to describe the integral nature of human perception. Hence, Gestalt principles describing grouping were proposed as an alternative, and the algorithmic theory of information was then put forward to unite the two approaches. Hence, the state-of-the-art metrics of visual complexity are based on compression algorithms (e.g., JPEG), but these have certain limitations with respect to HCI. Particularly, they do not reflect user-specific aspects, such as familiarity with the stimuli, nor are they relevant for describing tasks and the actual interaction with a computer system. Meanwhile, complexity is known to affect many other qualities of UI, and its automated evaluation is seen as highly desirable.

By initiating this Special Issue, we seek to promote further exploration on this topic. Both theoretic contributions and papers that describe concrete software implementations of algorithms quantifying aspects of UI complexity are welcome.

Prof. Dr. Maxim Bakaev
Guest Editor

Manuscript Submission Information

Manuscripts should be submitted online at www.mdpi.com by registering and logging in to this website. Once you are registered, click here to go to the submission form. Manuscripts can be submitted until the deadline. All submissions that pass pre-check are peer-reviewed. Accepted papers will be published continuously in the journal (as soon as accepted) and will be listed together on the special issue website. Research articles, review articles as well as short communications are invited. For planned papers, a title and short abstract (about 100 words) can be sent to the Editorial Office for announcement on this website.

Submitted manuscripts should not have been published previously, nor be under consideration for publication elsewhere (except conference proceedings papers). All manuscripts are thoroughly refereed through a single-blind peer-review process. A guide for authors and other relevant information for submission of manuscripts is available on the Instructions for Authors page. Mathematics is an international peer-reviewed open access semimonthly journal published by MDPI.

Please visit the Instructions for Authors page before submitting a manuscript. The Article Processing Charge (APC) for publication in this open access journal is 2600 CHF (Swiss Francs). Submitted papers should be well formatted and use good English. Authors may use MDPI's English editing service prior to publication or during author revisions.

Keywords

  • user interfaces
  • visual perception
  • information processing
  • model human processor
  • Gestalt principles
  • familiarity
  • pattern recognition
  • Hick–Hyman law
  • Solomonoff–Kolmogorov–Chaitin complexity
  • algorithmic entropy

Published Papers (1 paper)

Order results
Result details
Select all
Export citation of selected articles as:

Research

32 pages, 1040 KiB  
Article
Stability of Traveling Fronts in a Neural Field Model
by Dominick Macaluso and Yixin Guo
Mathematics 2023, 11(9), 2202; https://doi.org/10.3390/math11092202 - 07 May 2023
Viewed by 1004
Abstract
We investigate the stability of traveling front solutions in the neural field model. This model has been studied intensively regarding propagating patterns with saturating Heaviside gain for neuron firing activity. Previous work has shown the existence of traveling fronts in the neural field [...] Read more.
We investigate the stability of traveling front solutions in the neural field model. This model has been studied intensively regarding propagating patterns with saturating Heaviside gain for neuron firing activity. Previous work has shown the existence of traveling fronts in the neural field model in a more complex setting, using a nonsaturating piecewise linear gain. We aimed to study the stability of traveling fronts in the neural field model utilizing the Evans function. We attained the Evans function of traveling fronts using an integration of analytical derivations and a computational approach for the neural field model, with previously uninvestigated piecewise linear gain. Using this approach, we are able to identify both stable and unstable traveling fronts in the neural field model. Full article
Show Figures

Figure 1

Back to TopTop