ABSTRACT
We present Confluence, an enhancement to a desktop file search tool called Confluence which extracts conceptual relationships between files by their temporal access patterns in the file system. A limitation of a purely file-based approach is that as file operations are increasingly abstracted by applications, their correlation to a user's activity weakens and thereby reduces the applicability of their temporal patterns. To deal with this problem, we augment the file event stream with a stream of window focus events from the UI layer. We present 3 algorithms that analyze this new stream, extracting the user's task information which informs the existing Confluence algorithms. We present results and conclusions from a preliminary user study on Confluence.
- S. Dumais, E. Cutrell, J. Cadiz, G. Jancke, R. Sarin, and D. C. Robbins. Stuff I've seen: a system for personal information retrieval and re-use. In Proc. of SIGIR '03, pages 72--79, New York, NY, USA, 2003. ACM Press. Google ScholarDigital Library
- D. Karger, K. Bakshi, D. Huynh, D. Quan, and V. Sinha. Haystack: A General Purpose Information Management Tool for End Users of Semistructured Data. In CIDR '05, pages 13--26, 2005.Google Scholar
- C. A. N. Soules and G. R. Ganger. Connections: using context to enhance file search. In Proc. of SOSP '05, pages 119--132, New York, NY, USA, 2005. ACM Press. Google ScholarDigital Library
Index Terms
- Confluence: enhancing contextual desktop search
Recommendations
Confluence Framework: Proving Confluence with CONFident
Logic-Based Program Synthesis and TransformationAbstractThis paper describes CONFident, a tool which is able to automatically prove and disprove confluence of variants of rewrite systems: term rewriting systems, conditional term rewriting systems (using join, oriented, or semi-equational semantics), ...
Abstract Relations Between Restricted Termination And Confluence Properties Of Rewrite Systems
We investigate restricted termination and confluence properties of term rewriting systems, in particular weak termination, weak innermost termination, (strong) innermost termination, (strong) termination, and their interrelations. New criteria are ...
Conditions for confluence of innermost terminating term rewriting systems
This paper presents a counterexample for the open conjecture whether innermost joinability of all critical pairs ensures confluence of innermost terminating term rewriting systems. We then show that innermost joinability of all normalized instances of ...
Comments