waashk/acm huggingface dataset:
presenting to local and remote audiences: design and use of the telep system  the current generation of desktop computers and networks are bringing streaming audio and video into widespread use. a small investment allows presentations or lectures to be multicast, enabling passive viewing from offices or rooms. we surveyed experienced viewers of multicast presentations and designed a lightweight system that creates greater awareness in the presentation room of remote viewers and allows remote viewers to interact with each other and the speaker. we report on the design, use, and modification of the system, and discuss design tradeoffs.  gavin jancke jonathan grudin anoop gupta
individual characteristics associated with world wide web use: an empirical study of playfulness and motivation this study examines the influence of the individual characteristic of playfulness on the use of the world wide web (www). previous research suggests that microcomputer playfulness has an effect on computer usage in general, and we found support for a similar relationship in www use. two samples of students were surveyed in this study; one consisting of undergraduate students and the other comprised of graduate students. our findings also suggest that both intrinsic and extrinsic factors affect www use differentially for entertainment purposes and for course work purposes. our study confirms previous research in that we found that ability to use the computer has a positive effect on www usage. maryanne atkinson christine kydd
a new approach to text searching  we introduce a family of simple and fast algorithms for solving the classical string matching problem, string matching with don't care symbols and complement symbols, and multiple patterns. in addition we solve the same problems allowing up to k mismatches. among the features of these algorithms are that they are real time algorithms, they don't need to buffer the input, and they are suitable to be implemented in hardware.  r. a. baeza-yates g. h. gonnet
the jungle database search engine  information spread in in databases cannot be found by current search engines. a database search engine is capable to access and advertise database on the www. jungle is a database search engine prototype developed at aalborg university. operating through jdbc connections to remote databases, jungle extracts and indexes database data and meta-data, building a data store of database information. this information is used to evaluate and optimize queries in the aqua query language. aqua is a natural and intuitive database query language that helps users to search for information without knowing how that information is structured. this paper gives an overview of aqua and describes the implementation of jungle.  michael böhlen linas bukauskas curtis dyreson
designing presentations for on-demand viewing  increasingly often, presentations are given before a live audience, while simultaneously being viewed remotely and recorded for subsequent viewing on- demand over the web. how should video presentations be designed for web access? how is video accessed and used online? does optimal design for live and on-demand audiences conflict? we examined detailed behavior patterns of more than 9000 on-demand users of a large corpus of professionally prepared presentations. we find that as many people access these talks on-demand as attend live. online access patterns differ markedly from live attendance. people watch less overall and skip to different parts of a talk. speakers designing presentations for viewing on-demand should emphasize key points early in the talk and early within each slide, use slide titles that reveal the talk structure and are meaningful outside the flow of the talk. in some cases the recommendations conflict with optimal design for live audiences. the results also provide guidance in developing tools for on-demand multimedia authoring and use.  liwei he jonathan grudin anoop gupta
empirical bayes screening for multi-item associations this paper considers the framework of the so-called "market basket problem", in which a database of transactions is mined for the occurrence of unusually frequent item sets. in our case, "unusually frequent" involves estimates of the frequency of each item set divided by a baseline frequency computed as if items occurred independently. the focus is on obtaining reliable estimates of this measure of interestingness for all item sets, even item sets with relatively low frequencies. for example, in a medical database of patient histories, unusual item sets including the item "patient death" (or other serious adverse event) might hopefully be flagged with as few as 5 or 10 occurrences of the item set, it being unacceptable to require that item sets occur in as many as 0.1% of millions of patient reports before the data mining algorithm detects a signal. similar considerations apply in fraud detection applications. thus we abandon the requirement that interesting item sets must contain a relatively large fixed minimal support, and adopt a criterion based on the results of fitting an empirical bayes model to the item set counts. the model allows us to define a 95% bayesian lower confidence limit for the "interestingness" measure of every item set, whereupon the item sets can be ranked according to their empirical bayes confidence limits. for item sets of size _j_ > 2, we also distinguish between multi-item associations that can be explained by the observed _j_(_j_-1)/2 pairwise associations, and item sets that are significantly more frequent than their pairwise associations would suggest. such item sets can uncover complex or synergistic mechanisms generating multi- item associations. this methodology has been applied within the u.s. food and drug administration (fda) to databases of adverse drug reaction reports and within at&amp;t; to customer international calling histories. we also present graphical techniques for exploring and understanding the modeling results. william dumouchel daryl pregibon
a hybrid indoor navigation system  we describe a hybrid building navigation system consisting of stationary information booths and a mobile communication infrastructure feeding small portable devices. the graphical presentations for both the booths and the mobile devices are generated from a common source and for the common task of way finding, but they use different techniques to convey possibly different subsets of the relevant information. the form of the presentations is depending on technical limitations of the output media, accuracy of location information, and cognitive restrictions of the user. we analyze what information needs to be conveyed, how limited resources influence the presentation of this information, and argue, that by generating all different presentations in a common framework, a consistent appearance across devices can be achieved and that the different device classes can complement each other in facilitating the navigation task.  andreas butz jörg baus antonio kruger marco lohse
linking and messaging from real paper in the paper pda  it is well known that paper is a very fluid, natural, and easy to use medium for manipulating some kinds of information. it is familiar, portable, flexible, inexpensive, and offers good readability properties. paper also has well known limitations when compared with electronic media. work in hybrid paper electronic interfaces seeks to bring electronic capabilities to real paper in order to obtain the best properties of each. this paper describes a hybrid paper electronic system --- the paper pda \\--- which is designed to allow electronic capabilities to be employed within a conventional paper notebook, calendar, or organizer. the paper pda is based on a simple observation: a paper notebook can be synchronized with a body of electronic information much like an electronic pda can be synchronized with information hosted on a personal computer. this can be accomplished by scanning, recognizing and processing its contents, then printing a new copy. this paper introduces the paper pda concept and considers interaction techniques and applications designed to work within the paper pda. the stickerlink technique supports on-paper hyperlinking using removable paper stickers. two applications are also considered which look at aspects of electronic communications via the paper pda.  jeremy m. heiner scott e. hudson kenichiro tanaka
ramonamap - an example of graphical groupware  ramonamap is an iterative map for database and communication services within our workgroup. resources are represented as icons on the map, which preserves their actual (or implied) physical location and capitalizes on a user's understanding of maps. the map is interactive, giving the user control over the level of detail visible, allowing more information and services to appear than could be placed on a static map. the interactivity also allows users to change the map and add icon annotations. since the map is continuously derived from an on-line database, changes and annotations are immediately shared by all users. as the database contains a wealth of information about the group, it also serves as a source for static maps for other purposes.  joel f. bartlett
searching the web (keynote address): can you find what you want?  the world wide web has revolutionized communication and information distribution, storage, and access. its impact has been felt everywhere - e.g. science and technology, commerce and business, education, government, religion, law, entertainment, health care. even so, there are many ways the web can be improved. we discuss what the web consists of and how it has changed, what is the size of the web, and what is covered. results for the publicly indexable web show that the web though terabytes in size and growing is still less than large commercial databases and the library of congress. though the web started out as an academic-government endeavor, it is now primarily commerce. furthermore, the major web search engines cover only a fraction of the publicly indexable web and appear to base their indexing strategy on the popularity of information. since current search on the web is primarily done with the search engines, what would be the economic, political and scientific implications of these results?  c. lee giles
event-entity-relationship modeling in data warehouse environments  we use the event-entity-relationship model (ever) to illustrate the use of entity-based modeling languages for conceptual schema design in data warehouse environments. ever is a general-purpose information modeling language that supports the specification of both general schema structures and multi- dimensional schemes that are customized to serve specific information needs. ever is based on an event concept that is very well suited for multi- dimensional modeling because measurement data often represent events in multi- dimensional databases.  lars bækgaard
real time groupware as a distributed system: concurrency control and its effect on the interface  this paper exposes the concurrency control problem in groupware when it is implemented as a distributed system. traditional concurrency control methods cannot be applied directly to groupware because system interactions include people as well as computers. methods, such as locking, serialization, and their degree of optimism, are shown to have quite different impacts on the interface and how operations are displayed and perceived by group members. the paper considers both human and technical considerations that designers should ponder before choosing a particular concurrency control method. it also reviews our work-in-progress designing and implementing a library of concurrency schemes in groupkit, a groupware toolkit.  saul greenberg david marwood
a data model for flexible hypertext database systems  hypertext and other page-oriented databases cannot be schematized in the same manner as record-oriented databases. as a result, most hypertext databases implicitly employ a data model based on a simple, unrestricted graph. this paper presents a hypergraph model for maintaining page-oriented databases in such a way that some of the functionality traditionally provided by database schemes can be available to hypertext databases. in particular, the model formalizes identification of commonality in the structure, set-at-a-time database access, and definition of user-specific views. an efficient implementation of the model is also discussed.  frank wm. tompa
a case for dynamic view management materialized aggregate views represent a set of redundant entities in a data warehouse that are frequently used to accelerate on-line analytical processing (olap). due to the complex structure of the data warehouse and the different profiles of the users who submit queries, there is need for tools that will automate and ease the view selection and management processes. in this article we present dynamat, a system that manages dynamic collections of materialized aggregate views in a data warehouse. at query time, dynamat utilizes a dedicated disk space for storing computed aggregates that are further engaged for answering new queries. queries are executed independently or can be bundled within a multiquery expression. in the latter case, we present an execution mechanism that exploits dependencies among the queries and the materialized set to further optimize their execution. during updates, dynamat reconciles the current materialized view selection and refreshes the most beneficial subset of it within a given maintenance window. we show how to derive an efficient update plan with respect to the available maintenance window, the different update policies for the views and the dependencies that exist among them. yannis kotidis nick roussopoulos
performances of clustering policies in object bases  in this paper, we address the problem of clustering graphs in object-oriented databases. unlike previous studies which focused only on a workload consisting of a single operation, this study tackles the problem when the workload is a set of operations (method and queries) that occur with a certain probability. thus, the goal is to minimize the expected cost of an operation in the workload, while maintaining a similarly low cost for each individual operation class.  to this end, we present a new clustering policy based on the nearest-neighbor graph partitioning algorithm. we then demonstrate that this policy provides considerable gains when compared to a suite of well-known clustering policies proposed in the literature. our results are based on two widely referenced object-oriented database benchmarks; namely, the tektronix hypermodel and oo7.  adel shrufi
exploratory mining via constrained frequent set queries  although there have been many studies on data mining, to date there have been few research prototypes or commercial systems supporting comprehensive query- driven mining, which encourages interactive exploration of the data. our thesis is that constraint constructs and the optimization they induce play a pivotal role in mining queries, thus substantially enhancing the usefulness and performance of the mining system. this is based on the analogy of declarative query languages like sql and query optimization which have made relational databases so successful. to this end, our proposed demo is not yet another data mining system, but of a new paradigm in data mining - mining with constraints, as the important first step towards supporting ad-hoc mining in dbms.  in this demo, we will show a prototype exploratory mining system that implements constraint-based mining query optimization methods proposed in [5]. we will demonstrate how a user can interact with the system for exploratory data mining and how efficiently the system may execute optimized data mining queries. the prototype system will include all the constraint pushing techniques for mining association rules outlined in [5], and will include additional capabilities for mining other kinds of rules for which the computation of constrained frequent sets forms the core first step.  raymond ng laks v. s. lakshmanan jiawei han teresa mah
flexible queries over semistructured data  flexible queries facilitate, in a novel way, easy and concise querying of databases that have varying structures. two different semantics, flexible and semiflexible, are introduced and investigated. the complexity of evaluating queries under the two semantics is analyzed. query evaluation is polynomial in the size of the query, the database and the result in the following two cases. first, a semiflexible dag query and a tree database. second, a flexible tree query and a database that is any graph. query containment and equivalence are also investigated. for the flexible semantics, query equivalence is always polynomial. for the semiflexible semantics, query equivalence is polynomial for dag queries and exponential when the queries have cycles. under the semiflexible and flexible semantics, two databases could be equivalent even when they are not isomorphic. database equivalence is formally defined and characterized. the complexity of deciding equivalences among databases is analyzed. the implications of database equivalence on query evaluation are explained.  yaron kanza yehoshua sagiv
evaluating the user interface: the candid camera approach  in the development of a new interactive graphics application, considerable effort was spent on designing a user interface which would be easy to use. when a portion of the application was completed, typical potential users were brought in to help evaluate the interface. they were given a sample task and a short introduction to the application; then their efforts to complete the task were observed and videotaped.  this method of evaluating the user interface provided the development staff with quite a bit of valuable information. changes were made, and more testing was done, including using some subjects for a second time.  this paper describes how this evaluation method was used for two purposes: to point out problem areas in the interface, and to verify that changes made have improved the user interface.  michelle a. lund
re-evaluating indexing schemes for nested objects  performance is a major issue in the acceptance of object-oriented database management systems (oodbms). the nested index and path index schemes have been criticized for their heavy costs and poor handling of update operations. this paper re- evaluates three index schemes (nested index, path index, and multi- index) applicable to queries on nested attributes. among these, we found that a multi-index scheme is best supported in the object-oriented or extended relational dbms environment. multi-index schemes not only provide a better balance between retrieval and update costs than do the nested or path indices, but they also scale well for update when the number of indices increases. in this paper, we propose a multi-index design that reuses the single-table index structures already present in a dbms. our performance study extends previous models by permitting attributes to be multi-valued as well as single-valued. we also suggest that a combination of nested index and multi-index schemes offers a feasible solution to the support of queries on nested objects.  yin-he jiang xiangning liu bharat bhargava
dtd inference for views of xml data  we study the inference of data type definitions (dtds) for views of xml data, using an abstraction that focuses on document content structure. the views are defined by a query language that produces a list of documents selected from one or more input sources. the selection conditions involve vertical and horizontal navigation, thus querying explicitly the order present in input documents. we point several strong limitations in the descriptive ability of current dtds and the need for extending them with (i) a subtyping mechanism and (ii) a more powerful specification mechanism than regular languages, such as context-free languages. with these extensions, we show that one can always infer tight dtds, that precisely characterize a selection view on sources satisfying given dtds. we also show important special cases where one can infer a tight dtd without requiring extension (ii). finally we consider related problems such as verifying conformance of a view definition with a predefined dtd. extensions to more powerful views that construct complex documents are also briefly discussed.  yannis papakonstantinou victor vianu
insite: introduction to a generic paradigm for interpreting user-web space interaction  insite is a heuristic-based implementation to provide consistent tracking, analysis and visualization of users' interactions with a generic web site. our research has immediate applicability in such disparate fields as business, e-commerce, distance education, entertainment and management for capturing individual and collective profiles of customers, learners and employees. insite can identify trends and changes in user(s) behavior (interests) by monitoring their online interactions. it has a three- tier architecture for tracking, analysis and visualization. first, a remote agent transparently tracks user-navigation-paths within a site. second, a unique connectivity matrix (cm) model (a set of connectivity matrices) represents each path (and cluster of paths). third, the user-web site interaction, thus translated to a finite number of cm-models, is readily visualized by graphically representing the member matrices of the models. each member matrix of a representative cm- model captures a single navigational attribute. our dimensionally static approach to path and cluster representation by the connectivity matrices can reduce the complexity of analysis by several orders. consequently, we employ a new paradigm for dynamic clustering that leverages on the unique cm-model of representation.  adil faisal cyrus shahabi margaret mclaughlin frederick betz
the use of scenarios in human-computer interaction research: turbocharging the tortoise of cumulative science  a scenario is an idealised but detailed description of a specific instance of human-computer interaction (hci). a set of scenarios can be used as a "filter bank" to weed out theories whose scope is too narrow for them to apply to many real hci situations. by helping redress the balance between generality and accuracy in theories derived from cognitive psychology, this use of scenarios (1) allows the researcher to build on empirical findings already established while avoiding the tar-pits associated with the experimental methodology, (2) enables the researcher to consider a range of phenomena in a single study, thereby directly addressing the question of the scope of the theory, and (3) ensures that the resulting theory will be applicable in hci contexts.  richard m. young phil barnard