35,302 research outputs found

    Error by design: Methods for predicting device usability

    Get PDF
    This paper introduces the idea of predicting ‘designer error’ by evaluating devices using Human Error Identification (HEI) techniques. This is demonstrated using Systematic Human Error Reduction and Prediction Approach (SHERPA) and Task Analysis For Error Identification (TAFEI) to evaluate a vending machine. Appraisal criteria which rely upon user opinion, face validity and utilisation are questioned. Instead a quantitative approach, based upon signal detection theory, is recommended. The performance of people using SHERPA and TAFEI are compared with heuristic judgement and each other. The results of these studies show that both SHERPA and TAFEI are better at predicting errors than the heuristic technique. The performance of SHERPA and TAFEI are comparable, giving some confidence in the use of these approaches. It is suggested that using HEI techniques as part of the design and evaluation process could help to make devices easier to use

    Detecting fraud: Utilizing new technology to advance the audit profession

    Get PDF

    Searches

    Get PDF

    Book review: Naming what we know: threshold concepts of writing studies, Linda Adler-Kassner & Elizabeth Wardle (Eds.)

    Get PDF
    Review of 'Naming What We Know: Threshold Concepts of Writing Studies' (2015) Linda Adler-Kassner & Elizabeth Wardle (Eds.), Boulder: UP of Colorado

    Developing and validating theory in ergonomics science

    Get PDF
    This Article does not have an abstract

    Vertex identifying codes for the n-dimensional lattice

    Full text link
    An rr-identifying code on a graph GG is a set C⊂V(G)C\subset V(G) such that for every vertex in V(G)V(G), the intersection of the radius-rr closed neighborhood with CC is nonempty and different. Here, we provide an overview on codes for the nn-dimensional lattice, discussing the case of 1-identifying codes, constructing a sparse code for the 4-dimensional lattice as well as showing that for fixed nn, the minimum density of an rr-identifying code is Θ(1/rn−1)\Theta(1/r^{n-1}).Comment: 10p
    • …
    corecore