waashk/acm huggingface dataset:
predictive engineering models based on the epic architecture for a multimodal high-performance human-computer interaction task  engineering models of human performance permit some aspects of usability of interface designs to be predicted from an analysis of the task, and thus they can replace to some extent expensive user-testing data. we successfully predicted human performance in telephone operator tasks with engineering models constructed in the epic (executive process-interactive control) architecture for human information processing, which is especially suited for modeling multimodal, complex tasks, and has demonstrated success in other task domains. several models were constructed on an a priori basis to represent different hypotheses about how operators coordinate their activities to produce rapid task performance. the models predicted the total time with useful accuracy and clarified some important properties of the task. the best model was based directly on the goms analysis of the task and made simple assumptions about the operator's task strategy, suggesting that epic models are a feasible approach to predicting performance in multimodal high- performance tasks.  david e. kieras scott d. wood david e. meyer
appropriations and patterns in the use of group support systems this paper describes a macro-level coding scheme to distinguish patterns that occur in groups using a group support system (gss). the coding scheme has roots in adaptive structuration theory (ast) with its emphasis on how technology is appropriated or used, and discourse analysis that requires one consider the context of the larger discussion when analyzing textual data. the macro-level coding scheme revolves around junctures that occur during group meetings such as when a group either chooses to use the gss software or chooses to accomplish some aspect of the task without the software. after identifying a juncture, a brief description is written detailing how group members responded to the opportunity presented by the juncture. qualitative analysis is then used to identify patterns in how the technology is used. application of the coding scheme is demonstrated with data gathered from 17 groups that met three times over a two-week period. katherine m. chudoba
design issues of idict  eye-aware applications have existed for long, but mostly for very special and restricted target populations. we have designed and are currently implementing an eye-aware application, called idict, which is a general-purpose translation aid aimed at mass markets. idict monitors the user's gaze path while s/he is reading text written in a foreign language. when the reader encounters difficulties, idict steps in and provides assistance with the translation. to accomplish this, the system makes use of information obtained from reading research, a language model, and the user profile. this paper describes the idea of the idict application, the design problems and the key solutions for resolving these problems.  aulikki hyrskykari päivi majaranta antti aaltonen kari-jouko räihä
locking without blocking: making lock based concurrent data structure algorithms nonblocking  nonblocking algorithms for concurrent data structures guarantee that a data structure is always accessible. this is in contrast to blocking algorithms in which a slow or halted process can render part or all of the data structure inaccessible to other processes.  this paper proposes a technique that can convert most existing lock-based blocking data structure algorithms into nonblocking algorithms with the same functionality. our instruction-by-instruction transformation can be applied to any algorithm having the following properties:  •interprocess synchronization is established solely through the use of locks.  •there is no possiblity of deadlock (e.g. because of a well-ordering among the lock requests).  in contrast to a previous work, our transformation requires only a constant amount of overhead per operation and, in the absence of failures, it incurs no penalty in the amount of concurrency that was available in the original data structure.  the techniques in this paper may obviate the need for a wholesale reinvention of techniques for nonblocking concurrent data structure algorithms.  john turek dennis shasha sundeep prakash
on random sampling over joins  a major bottleneck in implementing sampling as a primitive relational operation is the inefficiency of sampling the output of a query. it is not even known whether it is possible to generate a sample of a join tree without first evaluating the join tree completely. we undertake a detailed study of this problem and attempt to analyze it in a variety of settings. we present theoretical results explaining the difficulty of this problem and setting limits on the efficiency that can be achieved. based on new insights into the interaction between join and sampling, we develop join sampling techniques for the settings where our negative results do not apply. our new sampling algorithms are significantly more efficient than those known earlier. we present experimental evaluation of our techniques on microsoft's sql server 7.0.  surajit chaudhuri rajeev motwani vivek narasayya
ethnography and systems development (tutorial session)(abstract only): bounding the intersection  goals and content: participants will learn the relevance of ethnographic analysis for capturing social complexity and its relationship to other social investigation methods for systems development in cooperative environments in the morning session. the afternoon session will specify and elaborate the problems inherent in integrating ethnographic methods with systems development. these problems will be highlighted through examination of data from the instructors' own research in air traffic control and retail financial services.  dave randall mark roucefield
independence is good: dependency-based histogram synopses for high-dimensional data  approximating the joint data distribution of a multi-dimensional data set through a compact and accurate histogram synopsis is a fundamental problem arising in numerous practical scenarios, including query optimization and approximate query answering. existing solutions either rely on simplistic independence assumptions or try to directly approximate the full joint data distribution over the complete set of attributes. unfortunately, both approaches are doomed to fail for high-dimensional data sets with complex correlation patterns between attributes. in this paper, we propose a novel approach to histogram-based synopses that employs the solid foundation of statistical interaction models to explicitly identify and exploit the statistical characteristics of the data. abstractly, our key idea is to break the synopsis into (1) a statistical interaction model that accurately captures significant correlation and independence patterns in data, and (2) a collection of histograms on low-dimensional marginals that, based on the model, can provide accurate approximations of the overall joint data distribution. extensive experimental results with several real-life data sets verify the effectiveness of our approach. an important aspect of our general, model-based methodology is that it can be used to enhance the performance of other synopsis techniques that are based on data-space partitioning (e.g., wavelets) by providing an effective tool to deal with the "dimensionality curse".  amol deshpande minos garofalakis rajeev rastogi
semantic multicast: intelligently sharing collaborative sessions  we introduce the concept of semantic multicast to implement a large-scale shared interaction infrastructure providing mechanisms for collecting, indexing, and disseminating the information produced in collaborative sessions. this infrastructure captures the interactions between users (as video, text, audio and other data streams) and promotes a philosophy of filtering, archiving, and correlating collaborative sessions in user and context sensitive groupings. the semantic multicast service efficiently disseminates relevant information to every user engaged in the collaborative session, making the aggregated streams of the collaborative session available to the correct users at the right amount of detail. this contextual focus is accomplished by introducing proxy servers to gather, annotate, and filter the streams appropriate for specific interest groups. users are subscribed to appropriate proxies, based on their profiles, and the collaborative session becomes a multi-level multicast of data from sources through proxies and to user interest groups.  son dao eddie shek asha vellaikal richard r. muntz lixia zhang miodrag potkonjak ouri wolfson
relevance feedback revisited  researchers have found relevance feedback to be effective in interactive information retrieval, although few formal user experiments have been made. in order to run a user experiment on a large document collection, experiments were performed at nist to complete some of the missing links found in using the probabilistic retrieval model. these experiments, using the cranfield 1400 collection, showed the importance of query expansion in addition to query reweighting, and showed that adding as few as 20 well-selected terms could result in performance improvements of over 100%. additionally it was shown that performing multiple iterations of feedback is highly effective.  donna harman
lamp: language for active message protocols  among the most prominent aspects of office automation is the concept of electronic mail. despite the fact that numerous "office of the future&" descriptions seem to focus upon electronic mail as a great opportunity, seldom is it treated as a phenomenon in its own right rather than product. more often it seems to be a technological byproduct, available to counter certain specific business ailments, most notably the inefficiency of transportation of packaged messages. despite the obvious advantages of e-mail, it is not seen as either essential to office of the future as a concept or as theoretically interesting to researchers.  several commentators, however, have pointed out that messaging may be an alternative form of interpersonal communication (see bair [l]), without especially treating messaging as a core concept in office automation.  this paper proposes to open the debate, not into the technical or behavioral feasibility of e-mail or the other messaging manifestations, nor into the economic benefits of implementation, but rather into the foundations of pre- programmed, non-real-time verbal interaction (printed and oral) as a general phenomenon.  paul s. licker
latent semantic indexing model for boolean query formulation (poster session)  a new model named boolean latent semantic indexing model based on the singular value decomposition and boolean query formulation is introduced. while the singular value decomposition alleviates the problems of lexical matching in the traditional information retrieval model, boolean query formulation can help users to make precise representation of their information search needs. retrieval experiments on a number of test collections seem to show that the proposed model achieves substantial performance gains over the latent semantic indexing model.  dae-ho baek heuiseok lim hae-chang rim
intermedia: a case study of the differences between relational and object- oriented database systems  this paper compares two approaches to meeting the data handling requirements of intermedia, a hypermedia system developed at the institute for research in information and scholarship at brown university. intermedia, though written using an object- oriented programming language, relies on a traditional relational database management system for data storage and retrieval. we examine the ramifications of replacing the relational database with an object- oriented database. we begin by describing the important characteristics each database system. we then describe intermedia and give an overview of its architecture and its data handling requirements. we explain why and how we used a relational database management system and the problems that we encountered with this system. we then present the design of an object-oriented database schema for intermedia and compare the relational and object-oriented database management system approaches.  karen e. smith stanley b. zdonik
a "pile" metaphor for supporting casual organization of information  a user study was conducted to investigate how people deal with the flow of information in their workspaces. subjects reported that, in an attempt to quickly and informally manage their information, they created piles of documents. piles were seen as complementary to the folder filing system, which was used for more formal archiving. a new desktop interface element--the pile-- was developed and prototyped through an iterative process. the design includes direct manipulation techniques and support for browsing, and goes beyond physical world functionality by providing system assistance for automatic pile construction and reorganization. preliminary user tests indicate the design is promising and raise issues that will be addressed in future work.  richard mander gitta salomon yin yin wong
a sound and complete query evaluation algorithm for relational databases with null values  reiter has proposed extended relational theory to formulate relational databases with null values and presented a query evaluation algorithm for such databases. however, due to indefinite information brought in by null values, reiter's algorithm is sound but not complete. in this paper, we first propose an extended relation to represent indefinite information in relational databases. then, we define an extended relational algebra for extended relations. based on reiter's extended relational theory, and our extended relations and the extended relational algebra, we present a sound and complete query evaluation algorithm for relational databases with null values  li yan yuan ding-an chiang
on the potential of tolerant region reuse for multimedia applications  the recent years have shown an interesting evolution in the mid-end to low-end embedded domain. portable systems are growing in importance as they improve in storage capacity and in interaction capabilities with general purpose systems. furthermore, media processing is changing the view embedded processors are designed, keeping in mind the emergence of new application domains such as those for pda systems or for the third generation of mobile digital phones (umts).  the performance requirements of these new kind of devices are not those of the general-purpose domain, where traditionally the premium goal is the highest performance. embedded systems must face ever increasing real time requirements as well as power consumption constraints. under this special scenario, instruction/region reuse arises as a promising way of increasing the performance of media embedded processors and, at the same time, reducing the power consumption. furthermore, media and signal processing applications are a suitable target for instruction/region reuse, given the large amount of redundancy found in media data working sets.  in this paper we propose a novel region reuse mechanism that takes advantage of the tolerance of media algorithms to losses in the precision of computation. by identifying regions of code where an input data set is processed into an output data set, we can reuse computational instances using the result of previous ones with a similar input data set (hence the term tolerant reuse). we will show that conventional region reuse is barely able to provide more than a 8% in reduction of executed instructions (even with significantly big tables) in a typical jpeg encoder application. on the other hand, when applying the concept of tolerance, we are able to provide a reduction of more than 25% of the number of executed instructions with tables smaller than 1kb (with only small degradations in the quality of the output image), and up to a 40% of reduction (and no visually perceptible differences) with bigger tables .  carlos Álvarez jesus corbal esther salamí mateo valero
on the semantics of "now" in databases  although "now" is expressed in sql and current_timestamp within queries, this value cannot be stored in the database. how ever, this notion of an ever- increasing current-time value has been reflected in some temporal data models by inclusion of database-resident variables, such as "now" "until-changed, " "**," "@," and "-". time variables are very desirable, but their used also leads to a new type of database, consisting of tuples with variables, termed a variable database.  james clifford curtis dyreson tomás isakowitz christian s. jensen richard t. snodgrass
human performance using computer input devices in the preferred and non- preferred hands  subjects' performance was compared in pointing and dragging tasks using the preferred and non-preferred hands. tasks were tested using three different input devices: a mouse, a trackball, and a tablet-with- stylus. the trackball had the least degradation across hands in performing the tasks, however it remained inferior to both the mouse and stylus. for small distances and small targets, the preferred hand was superior. however, for larger targets and larger distances, both hands performed about the same. the experiment shows that the non-preferred hand is more than a poor approximation of the preferred hand. the hands are complementary, each having its own strength and weakness. one design implication is that the non-preferred hand is well suited for tasks that do not require precise action, such as scrolling.  paul kabbash i. scott mackenzie william buxton
temporal statement modifiers  a wide range of database applications manage time-varying data. many temporal query languages have been proposed, each one the result of many carefully made yet subtly interacting design decisions. in this article we advocate a different approach to articulating a set of requirements, or desiderata, that directly imply the syntactic structure and core semantics of a temporal extension of an (arbitrary) nontemporal query language. these desiderata facilitate transitioning applications from a nontemporal query language and data model, which has received only scant attention thus far.  the paper then introduces the notion of statement modifiers that provide a means of systematically adding temporal support to an existing query language. statement modifiers apply to all query language statements, for example, queries, cursor definitions, integrity constraints, assertions, views, and data manipulation statements. we also provide a way to systematically add temporal support to an existing implementation. the result is a temporal query language syntax, semantics, and implementation that derives from first principles.  we exemplify this approach by extending sql-92 with statement modifiers. this extended language, termed atsql, is formally defined via a denotational- semantics-style mapping of temporal statements to expressions using a combination of temporal and conventional relational algebraic operators.  michael h. böhlen christian s. jensen richard t. snodgrass
spatial management of data  spatial data management is a technique for organizing and retrieving information by positioning it in a graphical data space (gds). this graphical data space is viewed through a color raster-scan display which enables users to traverse the gds surface or zoom into the image to obtain greater detail. in contrast to conventional database management systems, in which users access data by asking questions in a formal query language, a spatial data management system (sdms) presents the information graphically in a form that seems to encourage browsing and to require less prior knowledge of the contents and organization of the database.  this paper presents an overview of the sdms concept and describes its implementation in a prototype system for retrieving information from both a symbolic database management system and an optical videodisk.  christopher f. herot
multimediaminer: a system prototype for multimedia data mining  multimedia data mining is the mining of high-level multimedia information and knowledge from large multimedia databases. a multimedia data mining system prototype, multimediaminer, has been designed and developed. it includes the construction of a multimedia data cube which facilitates multiple dimensional analysis of multimedia data, primarily based on visual content, and the mining of multiple kinds of knowledge, including summarization, comparison, classification, association, and clustering.  osmar r. zaïane jiawei han ze-nian li sonny h. chee jenny y. chiang
schema transformation without database reorganization  we argue for avoiding database reorganizations due to schema modification in object- oriented systems, since these are expensive operations and they conflict with reusing existing software components. we show that data independence, which is a neglected concept in object databases, helps to avoid reorganizations in case of capacity preserving and reducing schema transformations. we informally present a couple of examples to illustrate the idea of a schema transformation methodology that avoids database reorganization.  markus tresch marc h. scholl
a hierarchy-aware approach to faceted classification of objected-oriented components  this article presents a hierarchy-aware classification schema for obje ct- oriented code, where software components are classified according to their behavioral characteristics, such as provided services, employed algorithms, and needed data. in the case of reusable application frameworks, these characteristics are constructured from their model, i.e., from the description of the abstract classes specifying both the framework structure and purpose. in conventional object libraries, the characteristics are extracted semiautomatically from class interfaces. characteristics are term pairs, weighted to represent "how well" they describe component behavior. the set of characteristics associated with a given component forms its software descriptor. a descriptor base is presented where descriptors are organized on the basis of structured relationships, such as similarity and composition. the classification is supported by a thesaurus acting as a language-independent unified lexicon. the descriptor base is conceived for developers who, besides conventionally browsing the descriptors hierarchy, can query the system, specifying a set of desired functionalities and getting a ranked set of adaptable candidates. user feedback is taken into account in order to progressively ameliorate the quality of the descriptors according to the views of the user community. feedback is made dependent of the user typology through a user profile. experimental results in terms of recall and precision of the retrieval mechanism against a sample code base are reported.  e. damiani m. g. fugini c. bellettini
finding replicated web collections  many web documents (such as java faqs) are being replicated on the internet. often entire document collections (such as hyperlinked linux manuals) are being replicated many times. in this paper, we make the case for identifying replicated documents and collections to improve web crawlers, archivers, and ranking functions used in search engines. the paper describes how to efficiently identify replicated documents and hyperlinked document collections. the challenge is to identify these replicas from an input data set of several tens of millions of web pages and several hundreds of gigabytes of textual data. we also present two real-life case studies where we used replication information to improve a crawler and a search engine. we report these results for a data set of 25 million web pages (about 150 gigabytes of html data) crawled from the web.  junghoo cho narayanan shivakumar hector garcia-molina