Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

H. Albert Napier

dblp:65/2289 · DBLP profile ↗
← Back
7ranked-venue papers
0as first author
0since 2021 · last 2005
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Human-computer interaction and ubiquitous computing · 4Databases, data management, data science and information retrieval · 2Applied, interdisciplinary, general and emerging computing · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Theoretical computer science
1 paper
Mathematical optimization · 100%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
Performance modeling and evaluation · 100%

Topics — the 3 heaviest of 4, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Mathematical optimization
linear programming
0.011975
A Computational Study of the Effects of Problem Dimensions on Solution Times for Transportation Problems · J. ACM 1975
Mathematical optimization › linear programming
simplex method
0.011975
A Computational Study of the Effects of Problem Dimensions on Solution Times for Transportation Problems · J. ACM 1975
Mathematical optimization › combinatorial optimization › network optimization
transportation problem
0.011975
A Computational Study of the Effects of Problem Dimensions on Solution Times for Transportation Problems · J. ACM 1975

Methods — techniques the papers use, named apart from their topics

random problem generation · 0.0empirical study · 0.0
YearPublicationVenuePosition
2005 Hidden Costs of Graphical User Interfaces: Failure to Make the Transition from Menus and Icon Toolbars to Keyboard Shortcuts
abstract
Graphical interfaces allow users to issue commands using pull-down menus, icon toolbars, and keyboard shortcuts. Menus and icon toolbars are easier to learn, whereas keyboard shortcuts are more efficient. It would seem natural for users to migrate from the use of easy-to-learn menu and icon methods to the more efficient method of keyboard shortcuts as they gain experience. To investigate the extent to which this transition takes place, 251 experienced users of Microsoft Word were given a questionnaire assessing their choice of methods for the most frequently occurring commands. Contrary to our expectations, most experienced users rarely used the efficient keyboard shortcuts, favoring the use of icon toolbars instead. A second study was done to verify that keyboard shortcuts are, indeed, the most efficient method. Six participants performed common commands using menu selection, icon toolbars, and keyboard shortcuts. The keyboard shortcuts were, as expected, the most efficient. These studies show that even experienced users are inefficient in their use of graphical interfaces. One possible way to improve user efficiency is for training programs to provide a roadmap for users to make the transition from using pull-down menus and clicking icon toolbars to issuing keyboard shortcuts.
David M. Lane, H. Albert Napier, S. Camille Peres, Aniko Sandor
Int. J. Hum. Comput. Interact.2
2005 A Process for Anticipating and Executing Icon Selection in Graphical User Interfaces
abstract
This article presents a system for predicting the icon a user will select from an icon toolbar, based on command use frequency and mouse trajectory. The system differs from previous systems in 2 important ways: First, the prediction system does not initiate any action. Instead, it predicts where the mouse is moving and subtly "suggests" a command for the user to verify. Second, the system takes into account the relative likelihood of commands being used when making its predictions. Initial testing suggested that a system that only predicted the most frequently used icon choices was better than one that predicted all choices. A study with 12 test users using a mouse and 10 using a trackpad found substantial benefits of this "limited prediction system." The system resulted in a mean reduction in time to issue a command of 41% for trackpad users and 25% for mouse users. Trackpad users, but not mouse users, preferred the prediction system to the traditional way of pointing. These results suggest that a prediction system such as the one described here has the potential to reduce the time and effort required to issue commands. The utility of the system appears to be especially great in laptops and other devices that use trackpads as their primary pointing devices.
David M. Lane, S. Camille Peres, Aniko Sandor, H. Albert Napier
Int. J. Hum. Comput. Interact.4
1993 Predicting the Skilled Use of Hierarchical Menus With the Keystroke-Level Model
abstract
This article addresses a key question in the application of Card, Moran, and Newell's (1983) keystroke-level model to software in which users specify a command by working through a system of hierarchical menus. For example, to insert a row in Lotus 1-2-3®, the user makes three menu choices: W for worksheet, I for insert, and R for row. In the keystroke-level model, it is assumed that a time-consuming mental operation precedes each command. The question in the application of the keystroke-level model to hierarchical menu systems is whether the keystrokes WIR in the previous example constitute the execution of three commands and thus require three mental operations or whether WIR acts as a single command and requires only one mental operation. Data were collected from four highly experienced Lotus 1-2-3 users as they went about their day-to-day work. Strong evidence that only one mental operation is involved in choosing from a hierarchical menu system was obtained. We hypothesize that the discrepancy of our results from the data of others is due to the fact that our subjects were more experienced. The implications of our findings for the design of menus is discussed.
David M. Lane, H. Albert Napier, Richard R. Batsell, John L. Naman
Hum. Comput. Interact.2
1990 The Predictability of Commands in a Spreadsheet Program
abstract
The ability to predict users' commands in Lotus 1-2-3 was investigated. Keystroke data was collected from four subjects in their normal work environment, with over 2700 commands being analysed. The data was used to construct transitional probability matrices that were then used to predict commands based on their immediate predecessors. Approximately half of the users' commands were correctly predicted in this manner. Also of interest was how often the users' commands would be either the most likely or the second most likely command given the previous commands. When the previous two commands were used to derive two predictions, the probability that the users' next command would be one of the two predicted commands was 0.81. The average probability of command repetition was 0.33. It was concluded that users appear to be extremely predictable in the Lotus 1-2-3 environment, and this predictability could serve as the foundation for an interface that aids the user by providing easy access to the next most likely command to be issued and by adapting the probabilities of command use over time.
Norman S. Guadagno, David M. Lane, Richard R. Batsell, H. Albert Napier
Interact. Comput.4
1985 An empirical study of occupational stress, attitudes and health among information systems personnel
John M. Ivancevich, H. Albert Napier, James C. Wetherbe
Inf. Manag.2
1984 An experiment in applying the adaptive design approach to DSS development
Maryam Alavi, H. Albert Napier
Inf. Manag.2
1975 A Computational Study of the Effects of Problem Dimensions on Solution Times for Transportation Problems
abstract
An in-depth study of the influence of problem structure on the computational efficiency of the primal simplex transportation algorithm is presented.The input for the study included over 1000 randomly generated problems with 185 different combinations of the number of sources, the number of destinations, and the number of variables.Objective function coefficients were generated using three different probability distributions to study the effects of variance and skewness in these parameters.Every problem was solved using three different starting procedures, and the following data were collected for each problem: (1) time required to obtain an optimal solution; (2) time required to obtain an initial basic solution; (3) number of artificial variables in the initial basic solution; (4) number of basis changes; (5) average time to perform a change of basis; (6) average number of basic variables in the "stepping stone path" in each change of basis; (7) average number of variables considered before selecting one to enter the basis.These measures of performance provide numerous insights into the effects of problem parameters on computation time.
G. Terry Ross, Darwin Klingman, H. Albert Napier
J. ACM3