Scrolling Through Time: Improving Interfaces for Searching and Navigating Continuous Audio Timelines

Existing work has produced a variety of techniques to improve interfaces for navigating an audio timeline. These interfaces typically map user input to either a change in play rate, or playback position. Audio feedback while scrolling at arbitrary rates can be provided by: skipping immediately to the new position in the audio; resampling the audio, which introduces pitch-shifts; timestretching the audio to preserve the pitch; or not at all. We conducted a series of user studies to examine the effects of input and feedback type on targeting performance. Position control was found to be, on average, 15–19% faster than rate control when searching for targets 90 to 100 seconds away in the audio timeline. Time-stretching was found to be the best choice in most scenarios, but skipping, and, for specific user groups, resampling, should be used for precise targeting tasks where the audio play rate falls below one-tenth nominal speed.

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

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

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

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

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

[6]  Andy Schürr,et al.  PROGRES , A Visual Language and Environment for PROgramming with Graph REwriting Systems 1 , 1994 .

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

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

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

[10]  Wolfgang Hürst,et al.  User interfaces for browsing and navigation of continuous multimedia data , 2002, NordiCHI '02.

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

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

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

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

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

[16]  Barry Arons,et al.  SpeechSkimmer: a system for interactively skimming recorded speech , 1997, TCHI.

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

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

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

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

[21]  Tobias Lauer,et al.  Playing speech backwards for classification tasks , 2005, 2005 IEEE International Conference on Multimedia and Expo.

[22]  Elaine Wherry,et al.  Scroll ring performance evaluation , 2003, CHI Extended Abstracts.

[23]  Edward Cutrell,et al.  Quantitative analysis of scrolling techniques , 2002, CHI.

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

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

[26]  Yoshihito Toyama,et al.  4th International Workshop on Reduction Strategies in Rewriting and Programming , 2004 .

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

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

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

[30]  Manfred A. Jeusfeld,et al.  An Executable Meta Model for Re-Engineering of Database Schemas , 1994, ER.

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

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

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

[34]  Bernhard Steffen,et al.  Model Checking for Context-Free Processes , 1992, CONCUR.

[35]  Matthias Jarke,et al.  Distributed Cooperation in Integrated Information Systems , 1993, Int. J. Cooperative Inf. Syst..

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

[37]  Peter Klein Designing Software with Modula–3 , 2007 .

[38]  Axel Röbel,et al.  Transient detection and preservation in the phase vocoder , 2003, ICMC.

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

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

[41]  Albert Zündorf A Heuristic for the Subgraph Isomorphism Problem in Executing PROGRES , 1993 .

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

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

[44]  Andy Schürr,et al.  Introduction to PROGRESS, an Attribute Graph Grammar Based Specification Language , 1990, WG.

[45]  Marc Davis,et al.  Metadata creation system for mobile images , 2004, MobiSys '04.

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

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

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

[49]  Bernhard Steffen,et al.  Generating Data Flow Analysis Algorithms from Modal Specifications , 1993, Sci. Comput. Program..

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

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

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

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

[54]  Henry N. Adorna 3-Party Message Complexity is Better than 2-Party Ones for Proving Lower Bounds on the Size of Minimal Nondeterministic Finite Automata , 2001, DCFS.

[55]  Andy Schürr Logic Based Programmed Structure Rewriting Systems , 1996, Fundam. Informaticae.

[56]  Andy Schürr,et al.  Specification of Graph Translators with Triple Graph Grammars , 1994, WG.

[57]  Bernhard Steffen,et al.  Characteristic Formulae for Processes with Divergence , 1994, Inf. Comput..

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

[59]  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..

[60]  Aaron E. Rosenberg,et al.  SCANMail: a voicemail interface that makes speech browsable, readable and searchable , 2002, CHI.

[61]  Richard Mander,et al.  Working with audio: integrating personal tape recorders and desktop computers , 1992, CHI '92.

[62]  David de Frutos-Escrig,et al.  A Complete Proof System for Timed Observations , 1991, TAPSOFT, Vol.1.

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

[64]  Ludwig Staiger,et al.  Finite Acceptance of Infinite Words , 1997, Theor. Comput. Sci..

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

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

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

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

[69]  Monica M. C. Schraefel,et al.  The radial scroll tool: scrolling support for stylus- or touch-based document navigation , 2004, UIST '04.

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

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

[72]  John F. Hughes,et al.  Navigating documents with the virtual scroll ring , 2004, UIST '04.

[73]  Matthias Jarke,et al.  From Relational to Object-Oriented Integrity Simplification , 1991, DOOD.

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

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

[76]  Michael Portz,et al.  A New Class of Cryptosystems Based on Interconnection Networks , 1991 .

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

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

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

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

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

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

[83]  Thomas Wilke,et al.  CTL+ is Exponentially more Succinct than CTL , 1999, FSTTCS.

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

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

[86]  Werner Verhelst,et al.  An overlap-add technique based on waveform similarity (WSOLA) for high quality time-scale modification of speech , 1993, 1993 IEEE International Conference on Acoustics, Speech, and Signal Processing.

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

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

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

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

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

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

[93]  M. O. Berger,et al.  k-coloring vertices using a neural network with convergence to valid solutions , 1994, Proceedings of 1994 IEEE International Conference on Neural Networks (ICNN'94).

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

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

[96]  Jan O. Borchers,et al.  PhaVoRIT: A Phase Vocoder for Real-Time Interactive Time-Stretching , 2006, ICMC.

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

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

[99]  Rance Cleaveland,et al.  The Concurrency Workbench , 1990, Automatic Verification Methods for Finite State Systems.

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

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

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

[103]  Jan Borchers,et al.  Selexels: a Conceptual Framework for Pointing Devices with Low Expressiveness , 2006 .

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

[105]  Shumin Zhai,et al.  Improving Browsing Performance: A study of four input devices for scrolling and pointing tasks , 1997, INTERACT.

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

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

[108]  Shumin Zhai,et al.  Human Performance in Six Degree of Freedom Input Control , 2002 .

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

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

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

[112]  Rita Loogen,et al.  Dynamic Detection of Determinism in Functional Languages , 1991, Theor. Comput. Sci..

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

[114]  Alexandre Tessier Declarative Debugging in Constraint Logic Programming , 1996, ASIAN.

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

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

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

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

[119]  Tobias Lauer,et al.  Forward and Backward Speech Skimming with the Elastic Audio Slider , 2005, BCS HCI.

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

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

[122]  E. C. Poulton,et al.  Tracking skill and manual control , 1974 .

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

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

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

[126]  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.

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

[128]  Jan Borchers,et al.  DiMaß:: a technique for audio scrubbing and skimming using direct manipulation , 2006, AMCMM '06.

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

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

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

[132]  Jean Laroche,et al.  Improved phase vocoder time-scale modification of audio , 1999, IEEE Trans. Speech Audio Process..

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

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

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

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

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

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

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

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

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

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

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

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