Peter Parente
Abstract
The purpose of the Clique project is to explore a new way of adapting applications with graphical user interfaces (GUIs) for use in audio. Existing adaptation methods retain the components and metaphors of visual interfaces in the audio displays they produce. Clique, on the other hand, presents the user with a conversational audio display based on the tasks supported by programs, not their visual representations. The user interacts solely with this audio display while Clique takes charge of inspecting and controlling the underlying programs via their GUIs. In effect, the graphical nature of program interfaces is hidden from the listening user who is free to concentrate on his or her tasks in audio. We hypothesize that audio displays produced in this manner will prove more effective and satisfying for common tasks than current solutions.
- A. Edwards. "Evaluation of Outspoken software for blind users." Technical report. University of York, Department of Computer Science. 1991.Google Scholar
- K. Barnicle. "Usability testing with screen reading technology in a Windows environment." in Proceedings of the 2000 conference on Universal Usability. pp. 102--109. 2000. Google ScholarDigital Library
- E. Mynatt. "Transforming graphical interfaces into auditory interfaces for blind users." Human-Computer Interaction. 12. pp 7--45. 1997. Google ScholarDigital Library
- C. Frauenberger, R. Höldrich, and A. de Campo. "A generic, semantically based design approach for spatial auditory computer displays." in Proceedings of the international conference on Auditory Display. 2004.Google Scholar
- P. Martin, et al. "SpeechActs: A spoken language framework." IEEE Computer. vol. 29(7). pp.33--40. 1996. Google ScholarDigital Library
- E. Ly and C. Schmandt. "Chatter: A conversational learning speech interface." in Symposium on Multi-Media Multi-Modal Systems. 1994.Google Scholar
Index Terms
- Clique: a conversant, task-based audio display for GUI applications
Recommendations
Clique-transversal sets and clique-coloring in planar graphs
Let G=(V,E) be a graph. A clique-transversal setD is a subset of vertices of G such that D meets all cliques of G, where a clique is defined as a complete subgraph maximal under inclusion and having at least two vertices. The clique-transversal number, ...
On maximizing clique, clique-Helly and hereditary clique-Helly induced subgraphs
Clique-Helly and hereditary clique-Helly graphs are polynomial-time recognizable. Recently, we presented a proof that the clique graph recognition problem is NP-complete [L. Alcon, L. Faria, C.M.H. de Figueiredo, M. Gutierrez, Clique graph recognition ...
Comments