MétaCan
Menu
Back to cohort
Record W2862341302 · doi:10.29375/25392115.3226

Fitts’ Law: On Calculating Throughput and Non-ISO Tasks

2018· article· en· W2862341302 on OpenAlexaff
Maria Francesca Roig-Maimó, I. Scott MacKenzie, Cristina Manresa-Yee, Javier Varona

Bibliographic record

VenueRevista Colombiana de Computación · 2018
Typearticle
Languageen
FieldComputer Science
TopicInteractive and Immersive Displays
Canadian institutionsYork University
FundersAgencia Estatal de Investigación
KeywordsThroughputFitts's lawComputer scienceTask (project management)Sequence (biology)Constant (computer programming)AmplitudeAlgorithmEngineeringTelecommunications

Abstract

fetched live from OpenAlex

We used a target-selection task to evaluate head-tracking as an input method for mobile devices. First, the method of calculating Fitts’ throughput is described by means of a raw data detailed example. Then, the method of calculating throughput is discussed for non-ISO tasks, since the procedure targets were randomly positioned from trial to trial. Due to a non-constant amplitude within each sequence of trials, throughput was calculated using two methods of data aggregation: the first one, by sequence of trials using the mean amplitude, and the second one, by common A-W conditions. For each data set, we used four methods for calculating throughput. The grand mean for throughput (calculated through the division of means and the adjustment for accuracy) was of 0.74 bps, which is 45 % lower than the value obtained using an ISO task. We recommend to calculate throughput using the division of means plus the adjustment for accuracy, and to avoid using the reciprocal slope of the regression model. We present various design recommendations for non-ISO tasks, such as: i) to keep amplitude and constant target within each sequence of trials, and ii) to use strategies to avoid or remove reaction time. Keywords: Fitts’ law, throughput, ISO 9241-411, mobile HCI, head-tracking.

Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.

How this classification was reachedexpand

Full frame machine prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.

metaresearch head score (Codex)0.012
metaresearch head score (Gemma)0.115
Version: metacan-v3-hybrid-931329e0061cValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Bench or experimental · Consensus signal: none
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.012
Threshold uncertainty score0.061

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0120.115
Meta-epidemiology (narrow)0.0010.001
Meta-epidemiology (broad)0.0010.001
Bibliometrics0.0030.002
Science and technology studies0.0010.002
Scholarly communication0.0020.004
Open science0.0020.002
Research integrity0.0010.001
Insufficient payload (model declined to judge)0.0040.001

Machine scores (provisional)

The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.

Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.

Opus teacher head0.014
GPT teacher head0.283
Teacher spread0.269 · how far apart the two teachers sit on this one work
Validation statusscore_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it

Classification

machine, unvalidated

Machine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.

The models applied no category: nothing in the taxonomy fit this work.
Study designBench or experimental
Domainnot available
GenreEmpirical

How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".

Quick stats

Citations2
Published2018
Admission routes1
Has abstractyes

Explore more

Same venueRevista Colombiana de ComputaciónSame topicInteractive and Immersive DisplaysFrench-language works237,207