waashk/acm huggingface dataset:
a forum for supporting interactive presentations to distributed audiences  computer technology is available to build video-based tools for supporting presentations to distributed audiences, but it is unclear how such an environment affects participants' ability to interact and to learn. we built and tested a tool called forum that broadcasts live audio, video and slides from a speaker, and enables audiences to interact with the speaker and other audience members in a variety of ways. the challenge was to enable effective interactions while overcoming obstacles introduced by the distributed nature of the environment, the large size of the group, and the asymmetric roles of the participants. forum was most successful in enabling effective presentations in cases when the topic sparked a great deal of audience participation or when the purpose of the talk was mostly informational and did not require a great deal of interaction. we are exploring ways to enhance forum to expand the effectiveness of this technology.  ellen a. isaacs trevor morris thomas k. rodriguez
new paradigms in information visualization (poster session)  _we present three new visualization front-ends that aid navigation through the set of documents returned by a search engine (hit documents). we cluster the hit documents to visually group these documents and label the groups with related words. the different front-ends cater for different user needs, but all can browse cluster information as well as drilling up or down in one or more clusters and refining the search using one or more of the suggested related keywords._  peter au matthew carey shalini sewraz yike guo stefan m. ruger
an architecture for transforming graphical interfaces  while graphical user interfaces have gained much popularity in recent years, there are situations when the need to use existing applications in a nonvisual modality is clear. examples of such situations include the use of applications on hand- held devices with limited screen space (or even no screen space, as in the case of telephones), or users with visual impairments.  we have developed an architecture capable of transforming the graphical interfaces of existing applications into powerful intuitive nonvisual interfaces. our system, called mercator, provides new input and output techniques for working in the nonvisual domain. navigation is accomplished by traversing a hierarchical tree representation of the interface structure. output is primarily auditory, although other output modalities (such as tactile) can be used as well. the mouse, an inherently visually-oriented device, is replaced by keyboard and voice interaction.  our system is currently in its third major revision. we have gained insight into both the nonvisual interfaces presented by our system and the architecture necessary to construct such interfaces. this architecture uses several novel techniques to efficiently and flexibly map graphical interfaces into new modalities.  w. keith edwards elizabeth d. mynatt
why object-oriented databases can succeed where others have failed  why are database systems an infrequent component of cad systems? most cad systems perform their own data management on top of the os file system. those that are built atop relational databases use them almost exclusively for selection, sometimes for projection, but perform joins in the private program memory of the design tools. cad systems are using a dbms as an index package \---to support associative access---when they are using one at all. the ubiquitous reason for foregoing the rest of the data manipulation capabilities is "performance! commercial database systems aren't fast enough to support simulators and interactive design tools." the following paragraphs give my opinion on what conventional database systems are too slow at, why they are slow at it, and why object-oriented database systems could be faster at it.  david maier
query processing in a heterogeneous retrieval network  the concept of a large-scale information retrieval network incorporating heterogeneous retrieval systems and users is introduced, and the necessary components for enabling term-based searching of any database by untrained end- users are outlined. we define a normal form for expression of queries, show that such queries can be automatically produced, if necessary, from a natural- language request for information, and give algorithms for translating such queries, with little or no loss of expressiveness, into equivalent queries on both boolean and term-vector type retrieval systems. we conclude with a proposal for extending this approach to arbitrary database models.  p. simpson
a unified analysis of batched searching of sequential and tree-structured files  a direct and unified approach is used to analyze the efficiency of batched searching of sequential and tree-structured files. the analysis is applicable to arbitrary search distributions, and closed-form expressions are obtained for the expected batched searching cost and savings. in particular, we consider a search distribution satisfying zipf's law for sequential files and four types of uniform (random) search distribution for sequential and tree- structured files. these results unify and extend earlier research on batched searching and estimating block accesses for database systems.  sheau-dong lang james r. driscoll jiann h. jou
electronic mail usage analysis  an electronic mail system (ems) has been in operation within digital equipment corporation now for several years. the function of the system is to help serve the internal communication needs of this geographically distributed corporation. in particular, the system was intended to increase the effectiveness of managers, although secretaries, engineers, and other employees also use the system. as the mail system grew from a pilot operation to a global communications utility, the system's managers continued to receive a wide range of informal feedback concerning users' perceptions and utilization of the system.  in order to assess reliably how users were reacting to this new communication mode, usage aspects of the electronic mail system were investigated by a random survey of the user population and by an analysis of ems learning behavior. the survey portion of the study will be discussed in this paper.  harry m. hersh
cost-based query optimization for metadata repositories query optimization strategies for repository systems must take into account the rich and often unpredictable structure of metadata, as well as supporting complex analysis of relationships between those structures. this paper describes rationale, design, and system integration of a cost-based query optimizer offered in conceptbase, a metadata manager that supports these capabilities by a deductive object-oriented data model. in contrast to most implemented dbms, the optimizer is not based on the concept of join selectivity, but on detailed distribution information about object and literal fan-out, with heavy exploitation of materialized views and end-biased histograms. experiences from two real-world applications in software configuration management and cooperative design demonstrate the practical advantages but also point to some lessons for further improvement. martin staudt rene soiron christoph quix matthias jarke
implementing the spirit of sql-99  this paper describes the current informix ids/ud release (9.2 or centaur) and compares and contrasts its functionality with the features of the sql-99 language standard. informix and illustra have been shipping dbmss implementing the spirit of the sql-99 standard for five years. in this paper, we review our experience working with ordbms technology, and argue that while sql-99 is a huge improvement over sql-92, substantial further work is necessary to make object-relational dbmss truly useful. specifically, we describe several interesting pieces of functionality unique to ids/ud, and several dilemmas our customers have encountered that the standard does not address.  paul brown
extended tasks elicit complex eye movement patterns  visual perception is an inherently complex task, yet the bulk of studies in the past were undertaken with subjects performing relatively simple tasks under reduced laboratory conditions. in the research reported here, we examined subjects' oculomotor performance as they performed two complex, extended tasks. in the first task, subjects built a model rocket from a kit. in the second task, a wearable eyetracker was used to monitor subjects as they walked to a restroom, washed their hands, and returned to the starting point. for the purposes of analysis, both tasks can be broken down into smaller sub- tasks that are performed in sequence. differences in eye movement patterns and high-level strategies were observed in the model building and hand-washing tasks. fixation durations recorded in the model building tasks were significantly shorter than those reported in simpler tasks. performance in the hand-washing task revealed _look-ahead_ eye movements made to objects well in advance of a subject's interaction with the object. often occurring in the middle of another task, they provide overlapping temporal information about the environment, providing a mechanism to produce our conscious visual experience.  jeff b. pelz roxanne canosa jason babcock
magic is relevant  we define the magic-sets transformation for traditional relational systems (with duplicates, aggregation and grouping), as well as for relational systems extended with recursion. we compare the magic- sets rewriting to traditional optimization techniques for nonrecursive queries, and use performance experiments to argue that the magic-sets transformation is often a better optimization technique.  i. s. mumick s. j. finkelstein hamid pirahesh raghu ramakrishnan
the effect of communication modality on cooperation in online environments  one of the most robust findings in the sociological literature is the positive effect of communication on cooperation and trust. when individuals are able to communicate, cooperation increases significantly. how does the choice of communication modality influence this effect? we adapt the social dilemma research paradigm to quantitatively analyze different modes of communication. using this method, we compare four forms of communication: no communication, text-chat, text-to-speech, and voice. we found statistically significant differences between different forms of communication, with the voice condition resulting in the highest levels of cooperation. our results highlight the importance of striving towards the use of more immediate forms of communication in online environments, especially where trust and cooperation are essential. in addition, our research demonstrates the applicability of the social dilemma paradigm in testing the extent to which communication modalities promote the development of trust and cooperation.  carlos jensen shelly d. farnham steven m. drucker peter kollock
a pilot card-based hypermedia integrated with a layered architecture-based oodb and an object-forwarding mail system  the goal of our project is to develop a pilotcard-based hypermedia which allows users to create the connecting network of links through the use of an electronic mail system. based on the goal, we developed an underlying object- oriented database management system with a layered architecture to combine personal work environments and a team cooperative work environment effectively. this integration provides the basis of groupware applications.  satoshi ichimura yutaka matsushita
the relation of agenda creation and use to group support system experience the meeting agenda is often recommended as a critical element for conducting successful meetings. however, assertions about the value of meeting agendas are rarely explained or empirically tested. this study surveyed 238 group facilitators, including 113 who reported facilitating at least one meeting using group support systems (gss), to examine their views on the use of agendas in meetings.analyses are based on overall responses by group facilitators and by responses of the subset of facilitators who have used gss. in addition, correlation analyses between the amount of gss experience and the responses of the full group of facilitators and the subset with gss experience are reported. frequency of agenda use and of evaluation of the "goodness of the agenda" both correlated with gss experience. pre-meeting sessions with the group sponsors correlated significantly with gss experience as did the frequency of varying from the agenda. finally, quality of meeting deliverables, satisfaction with outcomes, and satisfaction with process were viewed as most important benefits of using an agenda; but they did not correlate with gss experience. meeting efficiency as a benefit of agenda use was negatively correlated with gss experience. the implications of these findings for gss facilitation and for future research are discussed. fred niederman roger j. volkema
non-isomorphic 3d rotational techniques  this paper demonstrates how non-isomorphic rotational mappings and interaction techniques can be designed and used to build effective spatial 3d user interfaces. in this paper, we develop a mathematical framework allowing us to design non-isomorphic 3d rotational mappings and techniques, investigate their usability properties, and evaluate their user performance characteristics. the results suggest that non-isomorphic rotational mappings can be an effective tool in building high- quality manipulation dialogs in 3d interfaces, allowing our subjects to accomplish experimental tasks 13% faster without a statistically detectable loss in accuracy. the current paper will help interface designers to use non- isomorphic rotational mappings effectively.  ivan poupyrev suzanne weghorst sidney fels
intelligent integration of information  this paper describes and classifies methods to transform data to information in a three-layer, mediated architecture. the layers can be characterized from the top down as information-consuming applications, mediators which perform intelligent integration of information (i3), and data, knowledge and simulation resources.  the objective of modules in the i3 architecture is to provide end users' apoplications with information obtained through selection, abstraction, fusion, caching, extrapolation, and pruning of data. the data is obtained from many diverse and heterogeneous sources. the i3 objective requires the establishment of a consensual information system architecture, so that many participants and technologies can contribute. an attempt to provide such a range of services within a single, tightly integrated system is unlikely to survive technological or environmental change.  this paper focuses on the computational models needed to support the mediating functions in this architecture and introduces initial applicatiions. the architecture has been motivated in [wied:92c].  gio wiederhold
aries/csa: a method for database recovery in client-server architectures  this paper presents an algorithm, called aries/csa (algorithm for recovery and isolation exploiting semantics for client-server architectures), for performing recovery correctly in client-server (cs) architectures. in cs, the server manages the disk version of the database. the clients, after obtaining database pages from the server, cache them in their buffer pools. clients perform their updates on the cached pages and produce log records. the log records are buffered locally in virtual storage and later sent to the single log at the server. aries/csa supports a write-ahead logging (wal), fine- granularity (e.g., record) locking, partial rollbacks and flexible buffer management policies like steal and no-force. it does not require that the clocks on the clients and the server be synchronized. checkpointing by the server and the clients allows for flexible and easier recovery.  c. mohan inderpal narang
video based human animation technique  human animation is a challenging domain in computer animation. to aim at many shortcomings in conventional techniques, this paper proposes a new video based human animation technique. given a clip of video, firstly human joints are tracked with the support of kalman filter and morph-block based match in the image sequence. then corresponding sequence of three-dimension (3d) human motion skeleton is constructed under the perspective projection using camera calibration and human anatomy knowledge. finally a motion library is established automatically by annotating multiform motion attributes, which can be browsed and queried by the animator. this approach has the characteristic of rich source material, low computing cost, efficient production, and realistic animation result. we demonstrate it on several video clips of people doing full body movements, and visualize the results by re-animating a 3d human skeleton model.  xiaoming liu yueting zhuang yunhe pan
efficient mining of association rules in text databases  in this paper, we propose two new algorithms for mining association rules between words in text databases. the characteristics of text databases are quite different from those of retail transaction databases, and existing mining algorithms cannot handle text databases efficiently because of the large number of itemsets (i.e., words) that need to be counted. two well-known mining algorithms, apriori algorithm and direct hashing and pruning (dhp) algorithm, are evaluated in the context of mining text databases, and are compared with the new proposed algorithms named multipass-apriori (m-apriori) and multipass-dhp (m-dhp). it has been shown that the proposed algorithms have better performance for large text databases.  john d. holt soon m. chung
using active server pages and simulation techniques to create virtual m&amp;m;'s  the m&amp;m; problem is an excellent example of a nontrivial yet simple method for summarizing sampled data that are then used in making decisions. simulating the creation of virtual m&amp;m;'s that can be copied and pasted into a spreadsheet as the raw data for the m&amp;m; problem provides a way for students to get a unique sample of m&amp;m;'s, thus modeling how, in an information systems environment, sampled raw data can often be captured electronically rather than being entered by hand as would be the case with a physical package of m&amp;m;'s. previously presented using client-side javascript, this paper presents a solution to the same problem using server- side active server pages, thus avoiding compatibility problems of client-side scripting. the paper serves as a short introduction to both programming in active server pages and to simulating discrete events.  robin m. snyder
a model of mental model construction  learning to control a computer system from limited experience with it seems to require constructing a mental model adequate to indicate the causal connections between user actions, system responses, and user goals. while many kinds of knowledge could be used in building such a model, a small number of simple, low-level heuristics is adequate to interpret some common computer interaction patterns. designing interactions so that they fall within the scope of these heuristics may lead to easier mastery by learners.  c. lewis
security problems on inference control for sum, max, and min queriesthe basic inference problem is defined as follows: for a finite set _x_ ={_x_i, Â... , _xn_}, we wish to infer properties of elements of _x_ on thebasis of sets of "queries" regarding subsets of _x_. by restricting thesequeries to statistical queries, the statistical database (sdb) securityproblem is obtained. the security problem for the sdb is to limit the use ofthe sdb so that only statistical information is available and no sequence ofqueries is sufficient to infer protected information about any individual.when such information is obtained the sdb is said to be compromised. in thispaper, two applications concerning the security of the sdb are considered:  * _on-line application_. the queries are answered one by one in sequence and it is necessary to determine whether the sdb is compromised if a new query is answered.  * _off-line application_. all queries are available at the same time and it is necessary to determine the maximum subset of queries to be answered without compromising the sdb.the complexity of these two applications, when the set of queries consists of(a) a single type of sum query, (b) a single type of max/min query, (c) mixedtypes of max and min queries, (d) mixed types of sum and max/min queries, and(e) mixed types of sum, max, and min queries, is studied. efficient algorithmsare designed for some of these situations while others are shown to be np-hard.francis chin
a threshold mechanism for distributed query processing  a strategy to process a distributed query is formed using estimates for partial results sizes and delays/costs associated with the network data transfer and cpu processing. to guard against inaccurate estimates the strategy execution is monitored and if estimates are observed to be "inaccurate" the strategy is corrected. this paper presents and compares two methods which can be used to decide whether or not to correct a strategy. in the reformulation method a new strategy is formulated after executing each relational operation. the thresholds method is based on the fact that some partial results formed by the strategy's execution are more "critical" than others. the query processing strategy is represented as a network of activities and the critical path method method is used to determine threshold values for partial results. if a partial result is delayed beyond its threshold value the strategy is corrected. the reformulation and thresholds methods are evaluated on a test-bed of queries for a modeled application of a ddb.  p. bodorik j. s. riordon
conversational hypertext: information access through natural language dialogues with computers  one need not create a natural language understanding system in order to create a hypertext data base that can be traversed with unconstrained natural language. the task is simplified because the computer creates a constrained context, imposes a non-negotiable topic, and elicits simple questions. two small hypertext data bases describing the authors' organization and the terms and rules of baseball were implemented on an ibm pc. when ten untrained people were allowed to search through these data bases, 59 per cent of their queries were answered correctly by the first data base and 64 per cent by the second.  t. whalen a. patrick
graphlog: a visual formalism for real life recursion  we present a query language called graphlog, based on a graph representation of both data and queries. queries are graph patterns. edges in queries represent edges or paths in the database. regular expressions are used to qualify these paths. we characterize the expressive power of the language and show that it is equivalent to stratified linear datalog, first order logic with transitive closure, and non-deterministic logarithmic space (assuming ordering on the domain). the fact that the latter three classes coincide was not previously known. we show how graphlog can be extended to incorporate aggregates and path summarization, and describe briefly our current prototype implementation.  mariano p. consens alberto o. mendelzon