Selexels: a Conceptual Framework for Pointing Devices with Low Expressiveness

As human–computer interaction extends beyond the desktop, the need emerges for new input devices and interaction techniques. However, many novel interaction techniques must be prototyped in a proof-of-concept form, and can suffer from low expressiveness: their ability to convey the intended meaning is limited. We present a new conceptual framework based on selexels that allows application designers to match the expressiveness of the user interface to that of the input device. This allows the user interface to provide a fluid user experience despite the limitations of the input device. A user study validates the framework, shows that selexel-based pointing tasks can be modeled using Fitts’ Law, and provides insights for structuring evaluations of prototype input devices.

[1]  Matthias Jarke,et al.  Business process oriented information management: conceptual models at work , 1995, COCS '95.

[2]  Matthias Jarke,et al.  Requirements analysis from multiple perspectives: experiences with conceptual modeling technology , 1996, Proceedings of the Second International Conference on Requirements Engineering.

[3]  Benedikt Bollig,et al.  Local Parallel Model Checking for the Alternation-Free µ-Calculus , 2002, SPIN.

[4]  Tovi Grossman,et al.  The bubble cursor: enhancing target acquisition by dynamic resizing of the cursor's activation area , 2005, CHI.

[5]  Matthias Nicola,et al.  Design and Evaluation of Wireless Health Care Information Systems in Developing Countries , 1998 .

[6]  Patrick Shicheng Chen,et al.  On Inference Rules of Logic-Based Information Retrieval Systems , 1994, Inf. Process. Manag..

[7]  Berthold Vöcking,et al.  A Counterexample to the Fully Mixed Nash Equilibrium Conjecture , 2005 .

[8]  Christian Prehofer,et al.  Higher-order narrowing with definitional trees , 1999, Journal of Functional Programming.

[9]  J. J. Ruzz,et al.  A VHDL Speci cation of a Shared Memory Parallel Machine for Babel , 1998 .

[10]  Reidar Conradi,et al.  Version models for software configuration management , 1998, CSUR.

[11]  Martin Lefering Development of Incremental Integration Tools Using Formal Specifications , 1994 .

[12]  Markus Mohnen Efficient Compile-Time Garbage Collection for Arbitrary Data Structures , 1995, PLILP.

[13]  Martin Grohe,et al.  An existential locality theorem , 2004, Ann. Pure Appl. Log..

[14]  Mesut Gunes,et al.  From Simulations to Testbeds — Architecture of the Hybrid MCG-Mesh Testbed , 2006 .

[15]  P. Fitts The information capacity of the human motor system in controlling the amplitude of movement. , 1954, Journal of experimental psychology.

[16]  Bernhard Steffen,et al.  The Interprocedural Coincidence Theorem , 1992, CC.

[17]  Manfred Nagl,et al.  A universal component for the administration in distributed and integrated development environments , 1994 .

[18]  Matthias Jarke,et al.  Cooperative Information Systems: A Manifesto * , 1997 .

[19]  Thierry Cachat The Power of One-Letter Rational Languages , 2001, Developments in Language Theory.

[20]  Allen Newell,et al.  The psychology of human-computer interaction , 1983 .

[21]  Kenton O'Hara,et al.  Public and Situated Displays: Social and Interactional Aspects of Shared Display Technologies , 2004 .

[22]  Krzysztof Z. Gajos,et al.  SUPPLE: automatically generating user interfaces , 2004, IUI '04.

[23]  Markus Mohnen,et al.  An open framework for data-flow analysis in Java: extended abstract , 2002, PPPJ/IRE.

[24]  Manfred Nagl,et al.  On Integration Mechanisms within a Graph-based Software Development Environment , 1987, WG.

[25]  Stefan Gruner Einige Anmerkungen zur graphgrammatischen Spezifikation von Integrationswerkzeugen nach Westfechtel, Janning, Lefering und Schürr , 1998 .

[26]  Marcin Jurdzinski,et al.  A Discrete Strategy Improvement Algorithm for Solving Parity Games , 2000, CAV.

[27]  Matthias Jarke,et al.  Exploring the Semantic Structure of Technical Document Collections: A Cooperative Systems Approach , 2000, CoopIS.

[28]  Jürgen Giesl,et al.  Transformation techniques for context-sensitive rewrite systems , 2004, J. Funct. Program..

[29]  Christof Löding,et al.  Solving the Sabotage Game Is PSPACE-Hard , 2003, MFCS.

[30]  I. Scott MacKenzie,et al.  Fitts' Law as a Research and Design Tool in Human-Computer Interaction , 1992, Hum. Comput. Interact..

[31]  Andreas J. Winter,et al.  Modules and Updatable Graph Views for PROgrammed Graph REwriting Systems , 1997 .

[32]  Fundamenta Informaticae,et al.  The Sigma-Semantics : A Comprehensive Semantics for Functional Programs , .

[33]  Paul Kabbash,et al.  The “prince” technique: Fitts' law and selection using area cursors , 1995, CHI '95.

[34]  Andy Schürr PROGRESS: A VHL-Language Based on Graph Grammars , 1990, Graph-Grammars and Their Application to Computer Science.

[35]  Felix C. Freiling,et al.  Botnet Tracking: Exploring a Root-Cause Methodology to Prevent Distributed Denial-of-Service Attacks , 2005, ESORICS.

[36]  Torsten Kuhlen,et al.  Utilizing optical sensors from mice for new input devices , 2006 .

[37]  Stefan Gruner Schemakorrespondenzaxiome unterstützen die paargrammatische Spezifikation inkrementeller Integrationswerkzeuge , 1997 .

[38]  Franz Josef Och,et al.  Statistical machine translation: from single word models to alignment templates , 2002 .

[39]  Jock D. Mackinlay,et al.  A morphological analysis of the design space of input devices , 1991, TOIS.

[40]  Rance Cleaveland,et al.  The concurrency workbench: a semantics-based tool for the verification of concurrent systems , 1993, TOPL.

[41]  Zinaida Benenson,et al.  Tampering with Motes: Real-World Physical Attacks on Wireless Sensor Networks , 2006, SPC.

[42]  Felix C. Freiling,et al.  Optimal Randomized Fair Exchange with Secret Shared Coins , 2005, OPODIS.

[43]  H. Zelaznik,et al.  Motor-output variability: a theory for the accuracy of rapid motor acts. , 1979, Psychological review.

[44]  P. Rossmanith,et al.  A New Satisabilit y Algorithm With Applications To Max-Cut , 2005 .

[45]  David E. Meyer,et al.  Speed—Accuracy Tradeoffs in Aimed Movements: Toward a Theory of Rapid Voluntary Action , 2018, Attention and Performance XIII.

[46]  Thorsten Holz,et al.  A Pointillist Approach for Comparing Honeypots , 2005, DIMVA.

[47]  Christof Löding,et al.  Unranked Tree Automata with Sibling Equalities and Disequalities , 2007, ICALP.

[48]  U. Quernheim Satellite communication protocols-a performance comparison considering on-board processing , 1988, 8th European Conference on Electrotechnics, Conference Proceedings on Area Communication.

[49]  Matthias Jarke,et al.  The software information base: A server for reuse , 2005, The VLDB Journal.

[50]  Stefan Kahrs Polymorphic Type Checking by Interpretation of Code , 1992 .

[51]  Jürgen Giesl,et al.  Termination of term rewriting using dependency pairs , 2000, Theor. Comput. Sci..

[52]  Thomas Noll,et al.  Optimization of Straight-Line Code Revisited , 2006, Softwaretechnik-Trends.

[53]  Thomas Noll,et al.  Algebraic Correctness Proofs for Compiling Recursive Function Definitions with Strictness Information , 2006, Acta Informatica.

[54]  Christof Löding,et al.  Transforming structures by set interpretations , 2007, Log. Methods Comput. Sci..

[55]  C. Lewerentz,et al.  Integrated Project Team Management in a Software Development Environment , 1988 .

[56]  Jay Banerjee,et al.  Queries in object-oriented databases , 1988, Proceedings. Fourth International Conference on Data Engineering.

[57]  Manfred A. Jeusfeld,et al.  An Executable Meta Model for Re-Engineering of Database Schemas , 1994, Int. J. Cooperative Inf. Syst..

[58]  Rudolf Mathar,et al.  Analyzing a distributed slot assignment protocol by Markov chains , 1992, [1992 Proceedings] Vehicular Technology Society 42nd VTS Conference - Frontiers of Technology.

[59]  Matthias Jarke,et al.  Incremental Maintenance of Externally Materialized Views , 1996, VLDB.

[60]  Mary Czerwinski,et al.  Large display research overview , 2006, Color Imaging Conference.

[61]  Werner Hans,et al.  Full Indexing for Lazy Narrowing , 1993 .

[62]  Guido Moerkotte,et al.  Nested Queries in Object Bases , 1993, DBPL.

[63]  Rudolf Mathar,et al.  Analyzing routing strategy NFP in multihop packet radio networks on a line , 1995, IEEE Trans. Commun..

[64]  Janis A. Bubenko,et al.  Requirements Engineering: An Integrated View of Representation, Process, and Domain , 1993, ESEC.

[65]  Andy Schürr Logic Based Programmed Structure Rewriting Systems 1 , 1996 .

[66]  Guido Moerkotte,et al.  Efficient Evaluation of Aggregates on Bulk Types , 1995, DBPL.

[67]  Matthias Jarke,et al.  Quality Information Systems: Repository Support for Evolving Process Models , 1992 .

[68]  Matthias Jarke,et al.  Sharing Processes: Team Coordination in Design Repositories , 1992, Int. J. Cooperative Inf. Syst..

[69]  U. Naumann,et al.  Intraprocedural Adjoint Code Generated by the Differentiation-Enabled NAGWare Fortran Compiler , 2006 .

[70]  RWTHAachen,LehrstuhlfurInformatikII Ahornstrae55,W-5100Aachen,Germany , .

[71]  Felix C. Freiling,et al.  Efficient Reductions for Wait-Free Termination Detection in Faulty Distributed Systems , 2005 .

[72]  Benedikt Bollig,et al.  Message-passing automata are expressively equivalent to EMSO logic , 2006, Theor. Comput. Sci..

[73]  Felix C. Freiling,et al.  Revisiting Failure Detection and Consensus in Omission Failure Environments , 2005, ICTAC.

[74]  Uwe Naumann,et al.  Tangent-Linear Models by Augmented LL-Parsers , 2006, ICCSA.

[75]  Kai Jakobs,et al.  Timer Handling in High-Performance Transport Systems , 1993, Integrated Broadband Communications.

[76]  M. Papazoglou,et al.  Information Brokering: Design, Search and Transformation , 1996 .

[77]  Patrick Baudisch,et al.  Snap-and-go: helping users align objects without the modality of traditional snapping , 2005, CHI.

[78]  Jürgen Giesl,et al.  Deciding Inductive Validity of Equations , 2003, CADE.

[79]  Guido Moerkotte,et al.  Query Optimization Techniques Exploiting Class Hierarchies , 1995 .

[80]  Nathan R. Tallent,et al.  ADJOINT CODE BY SOURCE TRANSFORMATION WITH OPENAD/F , 2006 .

[81]  U. Naumann Syntax-Directed Derivative Code (Part II: Intraprocedural Adjoint Code) , 2005 .

[82]  Bernhard Steffen,et al.  Pushdown Processes: Parallel Composition and Model Checking , 1994, CONCUR.

[83]  Manfred A. Jeusfeld,et al.  Query Optimization in Deductive Object Bases , 1991, Query Processing for Advanced Database Systems, Dagstuhl.

[84]  Victor Ok Li PERFORMANCE MODELS OF DISTRIBUTED DATABASES. , 1981 .

[85]  George Horatiu Botorog High level parallel programming and the efficient implementation of numerical algorithms , 1998 .

[86]  Otto Spaniol,et al.  File transfer in high-speed token ring networks: performance evaluation by approximate analysis and simulation , 1988, IEEE J. Sel. Areas Commun..

[87]  Bernhard Steffen,et al.  An Elementary Bisimulation Decision Procedure for Arbitrary Context-Free Processes , 1995, MFCS.

[88]  Bernhard Westfechtel,et al.  Feedback handling in dynamic task nets , 1997, Proceedings 12th IEEE International Conference Automated Software Engineering.

[89]  U. Naumann,et al.  Toward Low Static Memory Jacobian Accumulation , 2006 .

[90]  Renaud Blanch,et al.  Semantic pointing: improving target acquisition with control-display ratio adaptation , 2004, CHI.

[91]  Joost-Pieter Katoen,et al.  Counterexamples in Probabilistic Model Checking , 2007, TACAS.

[92]  Wolfgang Thomas,et al.  AMORE: A System for Computing Automata, MOnoids, and Regular Expressions , 1989, STACS.

[93]  Stefan Richter,et al.  A Faster Algorithm for the Steiner Tree Problem , 2006, STACS.

[94]  Roland Baumann Client / Server Distribution in a Structure-Oriented Database Management System , 1997 .

[95]  Jürgen Giesl,et al.  Proving and Disproving Termination of Higher-Order Functions , 2005, FroCoS.

[96]  Matthias Jarke,et al.  ConceptBase - A Deductive Object Base Manager , 1994 .

[97]  Bernhard Steffen,et al.  Compositional Minimization of Finite State Systems , 1990, CAV.

[98]  Jürgen Giesl,et al.  Innermost Termination of Context-Sensitive Rewriting , 2002, Developments in Language Theory.

[99]  Berthold Vöcking,et al.  Decision-making based on approximate and smoothed Pareto curves , 2007, Theor. Comput. Sci..

[100]  Markus Mohnen Interfaces with default implementations in Java , 2002, PPPJ/IRE.

[101]  Matthias Jarke,et al.  Intelligent Networks as a Data Intensive Application (INDIA) , 1994, ADB.

[102]  Berthold Vöcking,et al.  Adaptive routing with stale information , 2005, PODC '05.

[103]  Danilo Beuche,et al.  Report of the GI Work Group "Requirements Management Tools for Product Line Engineering" , 2006 .

[104]  Guido Moerkotte,et al.  Partition-Based Clustering in Object Bases: From Theory to Practice , 1993, FODO.

[105]  Pär J. Ågerfalk,et al.  The Language Action Perspective on Communication Modelling , 1999 .

[106]  U. Naumann Syntax-Directed Derivative Code (Part I: Tangent-Linear Code) , 2005 .

[107]  Jürgen Giesl,et al.  Size-Change Termination for Term Rewriting , 2003, RTA.

[108]  Ludwig Staiger,et al.  Valuations and Unambiguity of Languages, with Applications to Fractal Geometry , 1994, ICALP.

[109]  Werner Hans,et al.  A Complete Indexing Scheme for WAM-based Abstract Machines , 1992, PLILP.

[110]  Benedikt Bollig,et al.  Replaying Play In and Play Out: Synthesis of Design Models from Scenarios by Learning , 2007, TACAS.

[111]  K. Jacobs OSI-an appropriate basis for group communication? , 1989, IEEE International Conference on Communications, World Prosperity Through Communications,.

[112]  Michael Rohs,et al.  Sweep and point and shoot: phonecam-based interactions for large public displays , 2005, CHI Extended Abstracts.

[113]  Yuxiao Hu,et al.  Optimal vertex elimination in single-expression-use graphs , 2008, TOMS.

[114]  J. Klop,et al.  WST ’ 04 7 th International Workshop on Termination , 2004 .

[115]  Krishna Bharat,et al.  Making computers easier for older adults to use: area cursors and sticky icons , 1997, CHI.

[116]  Andy Schürr,et al.  Computing with Graphs and Graph Rewriting , 1999 .

[117]  Stackbased ReductionGuido Hogen,et al.  Parallel Functional Implementations: Graphbased vs. Stackbased Reduction , 1995 .

[118]  Gottfried Vossen,et al.  SUXESS: Towards a Sound Unification of Extensions of the Relational Data Model , 1991, Data Knowl. Eng..

[119]  Matthias Jarke,et al.  Workflow support for failure management in federated organizations , 1998, Proceedings of the Thirty-First Hawaii International Conference on System Sciences.

[120]  Matthias Jarke,et al.  Three Aspects of Intelligent Cooperation in the Quality Cycle , 1993, Int. J. Cooperative Inf. Syst..

[121]  Markus Mohnen,et al.  Optimising the memory management of higher order functional programs , 1997 .

[122]  Thomas Wilke CTL+ is Exponentially more Succinct than CTL , 1999, FSTTCS.

[123]  Jörg Dahmen,et al.  Invariant image object recognition using Gaussian mixture densities , 2001 .

[124]  Felix C. Freiling,et al.  An offensive approach to teaching information security : 'Aachen summer school applied IT security , 2005 .

[125]  Ludwig Staiger,et al.  On Syntactic Congruences for Omega-Languages , 1993, Theor. Comput. Sci..

[126]  S. Gruner Fine-grained and Structure-Oriented Document Integration Tools are Needed for Development Processes , 2007 .

[127]  Werner Damm,et al.  Specifying distributed computer architectures in AADL , 1989, Parallel Comput..

[128]  Matthias Jarke,et al.  Simulating the Impact of Information Flows in Networked Organizations , 1996, ICIS.

[129]  Werner Hans,et al.  On the Interaction of Lazy Evaluation and Backtracking , 1992, PLILP.

[130]  Matthias Jarke,et al.  Conflict analysis across heterogeneous viewpoints: formalization and visualization , 1996, Proceedings of HICSS-29: 29th Hawaii International Conference on System Sciences.