waashk/acm huggingface dataset:
natural language navigation in multimedia archives: an integrated approach  the paper presents the design and prototypical implementation of an integrated retrieval system (hpqs) which provides natural language access to multimedia documents in restricted topic areas. it supports new flexible ways of querying by combining a semantically rich retrieval model based on fuzzy set theory with domain-specific methods for document analysis which can be applied online (i.e. the search criteria are not restricted to combinations of anticipated descriptors). emphasis is put on the retrieval methodology and on the interplay of the system components: because of its provision of computationally demanding direct search methods, it is crucial to the system that all components cooperate to ensure acceptable response times.  ingo glöckner alois knoll
automated assistance for the telemeeting lifecycle  we analyse eighteen months of national and international deployment of a prototype telemeeting system supporting synchronous remote meetings which make extensive use of shared documents as well as video and audio conferencing. logistics of a telemeeting include scheduling people and equipment, document format conversion, pre-sending documents, training, equipment and call setup, and meeting followup. the logistics burden is much larger than expected and can be a barrier to adoption of telemeeting technology. using a process model that recognises moving between solo and group, asynchronous and synchronous work modes, the paper explores the amenability of individual logistics tasks to automated assistance, proposes a framework for such assistance, and develops a set of design principles.  neil w. bergmann j. craig mudge
on rules, procedure, caching and views in data base systems  this paper demonstrates that a simple rule system can be constructed that supports a more powerful view system than available in current commercial systems. not only can views be specified by using rules but also special semantics for resolving ambiguous view updates are simply additional rules. moreover, procedural data types as proposed in postgres are also efficiently simulated by the same rules system. lastly, caching of the action part of certain rules is a possible performance enhancement and can be applied to materialize views as well as to cache procedural data items. hence, we conclude that a rule system is a fundamental concept in a next generation dbms, and it subsumes both views and procedures as special cases.  michael stonebraker anant jhingran jeffrey goh spyros potamianos
determining view dependencies using tableaux  a relational database models some part of the real world by a set of relations and a set of constraints. the constraints model properties of the stored information and must be maintained true at all times. for views defined over physically stored (base) relations, this is done by determining whether the view constraints are logical consequences of base relation constraints. a technique for determining such valid view constraints is presented in this paper. a generalization of the tableau chase is used. the idea of the method is to generate a tableau for the expression whose summary violates the test constraints in a "canonical" way. the chase then tries to remove this violation.  it is also shown how this method has applications to schema design. relations not in normal form or having other deficiencies can be replaced by normal form projections without losing the ability to represent all constraint information.  anthony klug rod price
join synopses for approximate query answering  in large data warehousing environments, it is often advantageous to provide fast, approximate answers to complex aggregate queries based on statistical summaries of the full data. in this paper, we demonstrate the difficulty of providing good approximate answers for join-queries using only statistics (in particular, samples) from the base relations. we propose join synopses as an effective solution for this problem and show how precomputing just one join synopsis for each relation suffices to significantly improve the quality of approximate answers for arbitrary queries with foreign key joins. we present optimal strategies for allocating the available space among the various join synopses when the query work load is known and identify heuristics for the common case when the work load is not known. we also present efficient algorithms for incrementally maintaining join synopses in the presence of updates to the base relations. our extensive set of experiments on the tpc-d benchmark database show the effectiveness of join synopses and various other techniques proposed in this paper.  swarup acharya phillip b. gibbons viswanath poosala sridhar ramaswamy
form management  this paper consists of three interrelated parts. in the first part forms are intoduced as an abstraction and generalization of business paper forms. a set of facilities for the manipulation of forms and their contents is outlined. forms can be created, stored, found, viewed in different media, mailed, and located by office workers. data on forms can also be processed in a completely integrated way. the facilities are discussed both abstractly and in relation to a prototype system. in the second part a facility is outlined for the specification and implementation of automatic form procedures. these procedures specify actions on forms which are triggered automatically when certain preconditions are met. the preconditions, actions, and specification method are based on forms. the discussion is centered on our implementation of such a specification framework. finally, in the third part, techniques for the analysis of office flow are specified. an algorithm is outlined for the categorization of forms into classes depending on the local routing and actions on the forms. in this way, we can obtain the paths that forms take and analyze the system for correctness and loading characteristics.  d. tsichritzis
office automation: the science that supports it (panel discussion)  many discoveries and developments in science and technology over the last few years have made office automation possible. national productivity and well being depend upon technology transfer, and this requires people who combine an appreciation of industrial and social needs with a knowledge of discoveries that can help.  the design and evolution of equipment, materials and systems architecture used in office automation are supported by many disciplines - the traditional branches of physical science and engineering, mathematics and human factors, computer science and other subjects too.  in this session, the panel members will explain in popular terms some of the scientific advances used in office automation and related activities.  michael p. barnett robert a myers clarence a. ellis
beyond intratransaction association analysis: mining multidimensional intertransaction association rules  in this paper, we extend the scope of mining association rules from traditional single-dimensional intratransaction associations, to multidimensional intertransaction associations. intratransaction associations are the associations among items with the same transaction, where the notion of the transaction could be the items bought by the same customer, the events happened on the same day, and so on. however, an intertransaction association describes the association relationships among different transactions, such as "if(company) a's stock goes up on day 1, b's stock will go down on day 2, but go up on day 4." in this case, whether we treat company or day as the unit of transaction, the associated items belong to different transactions. moreover, such an intertransaction association can be extended to associate multiple contextual properties in the same rule, so that multidimensional intertransaction associations can be defined and discovered. a two-dimensional intertransaction association rule example is "after mcdonald and burger king open branches, kfc will open a branch two months later and one mile away," which involves two dimensions: time and space. mining intertransaction associations poses more challenges on efficient processing than mining intratransaction associations. interestingly, intratransaction association can be treated as a special case of intertransaction association from both a conceptual and algorithmic point of view. in this study, we introduce the notion of multidimensional intertransaction association rules, study their measurements---support and confidence---and develop algorithms for mining intertransaction associations by extension of apriori. we overview our experience using the algorithms on both real-life and synthetic data sets. further extensions of multidimensional intertransaction association rules and potential applications are also discussed.  hongjun lu ling feng jiawei han
on the nature and fuction of explanation in intelligent information retrieval  we discuss the complexity of explanation activity in human-human goal-directed dialogue, and suggest that this complexity ought to be taken account of in the design of explanation in human-computer interaction. we propose a general model of clarity in human-computer systems, of which explanation is one component. on the bases of: this model; of a model of human-intermediary interaction in the document retrieval situation as one of cooperative model- building for the purpose of developing an appropriate search formulation; and, on the results of empirical observation of human user-human intermediary interaction in information systems, we propose a model for explanation by the computer intermediary in information retrieval.  n. j. belkin
a new method for similarity indexing of market basket data  in recent years, many data mining methods have been proposed for finding useful and structured information from market basket data. the association rule model was recently proposed in order to discover useful patterns and dependencies in such data. this paper discusses a method for indexing market basket data efficiently for similarity search. the technique is likely to be very useful in applications which utilize the similarity in customer buying behavior in order to make peer recommendations. we propose an index called the signature table, which is very flexible in supporting a wide range of similarity functions. the construction of the index structure is independent of the similarity function, which can be specified at query time. the resulting similarity search algorithm shows excellent scalability with increasing memory availability and database size.  charu c. aggarwal joel l. wolf philip s. yu
programming and enjoying music with your eyes closed  design and user evaluation of a multimodal interaction style for music programming is described. user requirements were _instant usability_ and _optional use of a visual display_. the interaction style consists of a visual roller metaphor. user control of the rollers proceeds by manipulating a force feedback trackball. tactual and auditory cues strengthen the roller impression and support use without a visual display. the evaluation investigated task performance and procedural learning when performing music programming tasks with and without a visual display. no procedural instructions were provided. tasks could be completed successfully with and without a visual display, though programming without a display needed more time to complete. prior experience with a visual display did not improve performance without a visual display. when working without a display, procedures have to be acquired and remembered explicitly, as more procedures were remembered after working without a visual display. it is demonstrated that multimodality provides new ways to interact with music.  steffen pauws don bouwhuis berry eggen
creating the invisible interface: (invited talk)  for thirty years, most interface design, and most computer design, has been headed down the path of the "dramatic" machine. its highest ideal is to make a computer so exciting, so wonderful so interesting, that we never want to be without it. a less-traveled path i call the "invisible"; its highest ideal is to make a computer so imbedded, so fitting, so natural, that we use it without even thinking about it. (i have also called this notion "ubiquitous computing.") i believe that in the next twenty years the second path will come to dominate. but this will not be easy; very little of our current systems infrastructure will survive. we have been building versions of the infrastructure-to-come at parc for the past four years, in the form of inch-, foot-, and yard-sized computers we call tabs, pads, and boards. in this talk i will describe the humanistic origins of the "invisible" ideal in post- modernist thought. i will then describe some of our prototypes, how they succeed and fail to be invisible, and what we have learned. i will illustrate new systems issues that user interface designers will face when creating invisibility. and i will indicate some new directions we are now exploring, including the famous "dangling string" display.  mark weiser
modeling shared information spaces (sis)  many companies experience that their corporate intranet is getting complex and poorly manageable. we believe that developing a model for the website, or shared information space will make the management easier and provide solutions that support collaboration and knowledge sharing within the enterprise. the present paper proposes a meta model defining the conceptual building blocks of an information space. the meta model takes knowledge as well as information sharing into account by letting ontologies represent problem domains important to the enterprise, and be used as means of imposing structure on available information. to support the different needs of the employees the ability to interact with the information space through different perspectives is essential. an example of how the meta model can be deployed to support contextual retrieval of information in a workflow management application is described.  marit kjøsnes natvig oddrun ohren
system integration in multidatabases  \\--- this paper presents an exploratory approach to the development of a tool for integrating existing databases. the intent is to meet specific requirements and to achieve flexibility through the creation of an "open" system. the methodology assumes an integration model which captures the essential characteristics of a distributed system within a knowledge base. the model and the underlying knowledge base may be used to represent the distributed environment and to define requirements for the shared use of heterogeneous databases. an interactive method is proposed which allows the user to proceed in an iterative fashion in specifying system attributes and resolving design conflicts. the project is at present in the definition phase; current work is aimed at the identification of generic multidatabase services, and their abstraction in a form amenable for storage in the knowledge base.  p. bodorik j. s. riordon
i3: intelligent, interactive investigation of olap data cubes  the goal of the i3(eye cube) project is to enhance multidimensional database products with a suite of advanced operators to automate data analysis tasks that are currently handled through manual exploration. most olap products are rather simplistic and rely heavily on the user's intuition to manually drive the discovery process. such ad hoc user-driven exploration gets tedious and error-prone as data dimensionality and size increases. we first investigated how and why analysts currently explore the data cube and then automated them using advanced operators that can be invoked interactively like existing simple operators.  our proposed suite of extensions appear in the form of a toolkit attached with a olap product. at this demo we will present three such operators: diff, relax and inform with illustrations from real-life datasets.  sunita sarawagi gayatri sathe
a generalized constraint and exception handler for an object-oriented cad-dbms  a generalized constraint and exception handler for object-oriented cad databases is presented. the main features of the constraint and exception handler are: dynamic definition of new constraints without recompilation of the schema, deferred constraint checking, and homogeneous handling of constraints and their exceptions. in the paper we analyze first the constraints typically encountered in a cad environment, discuss the problems of dynamic constraint definition and deferred evaluation and, based on that discussion, present design and implementation issues of the constraint handler which is currently being implemented.  a. p. buchmann r. s. carrera m. a. vazquez-galindo
local and global structuring of computer mediated communication: developing linguistic perspectives on cscw in cosmos  this paper is concerned with the development of a language/action perspective in the cosmos project. we emphasize the importance of seeing cooperative work in terms of participants' communicative actions. in contrast to some explorations of speech act theory, we argue that communicative actions should be seen as essentially embedded in dialogical contexts. in particular, we attempt to show the relevance of concepts derived from the analysis of actually occurring conversations, for computer mediated communication in general and cooperative work in particular. we distinguish between local and global structuring of communication and argue that many group working situations combine both sorts. these observations have influenced our work in the cosmos project on the design of a structure definition language (sdl) by means of which users can configure their computer mediated communication environment. we describe sdl and show how its interpretation is influenced by our conversation analytic approach. we illustrate our arguments with an example of cooperative document preparation.  john bowers john churcher
sibyl: a tool for managing group design rationale  we describe sibyl, a system that supports group decision making by representing and managing the qualitative aspects of decision making processes: such as the alternatives, the goals to be satisfied, and the arguments evaluating the alternatives with respect to these goals. we use an example session with sibyl to illustrate the language, called drl, that sibyl uses for representing these qualitative aspects, and the set of services that sibyl provides using this language. we also compare sibyl to other systems with similar objectives and discuss the additional benefits that sibyl provides. in particular, we compare sibyl to gibis, a well-known "tool for exploratory policy discussion", and claim that sibyl is mainly a knowledge- based system which uses a semi-formal representation, whereas gibis is mainly a hypertext system with semantic types. we conclude with a design heuristic, drawn from our experience with sibyl, for systems whose goal includes eliciting knowledge from people.  jintae lee
xml with data values: typechecking revisited  we investigate the _type checking_ problem for xml queries: statically verifying that every answer to a query conforms to a given output dtd, for inputs satisfying a given input dtd. this problem had been studied by a subset of the authors in a simplified framework that captured the structure of xml documents but ignored data values. we revisit here the type checking problem in the more realistic case when data values are present in documents and tested by queries. in this extended framework, type checking quickly becomes undecidable. however, it remains decidable for large classes of queries and dtds of practical interest. the main contribution of the present paper is to trace a fairly tight boundary of decidability for type checking with data values. the complexity of type checking in the decidable cases is also considered.  noga alon tova milo frank neven dan suciu victor vianu
the design of postgres  this paper presents the preliminary design of a new database management system, called postgres, that is the successor to the ingres relational database system. the main design goals of the new system are to  provide better support for complex objects,  provide user extendibility for data types, operators and access methods,  provide facilities for active databases (i.e., alerters and triggers) and inferencing including forward- and backward- chaining,  simplify the dbms code for crash recovery,  produce a design that can take advantage of optical disks, workstations composed of multiple tightly-coupled processors, and custom designed vlsi chips, and  make as few changes as possible (preferably none) to the relational model.  the paper describes the query language, programming language interface, system architecture, query processing strategy, and storage system for the new system.  michael stonebraker lawrence a. rowe
learning probabilistic models of the web (poster session)  in the world wide web, myriads of hyperlinks connect documents and pages to create an unprecedented, highly complex graph structure - the web graph. this paper presents a novel approach to learning probabilistic models of the web, which can be used to make reliable predictions about connectivity and information content of web documents. the proposed method is a probabilistic dimension reduction technique which recasts and unites latent semantic analysis and kleinberg's hubs-and-authorities algorithm in a statistical setting.  this meant to be a first step towards the development of a statistical foundation for web---related information technologies. although this paper does not focus on a particular application, a variety of algorithms operating in the web/internet environment can take advantage of the presented techniques, including search engines, web crawlers, and information agent systems.  thomas hofmann
a simple analysis of exclusive and shared lock contention in a database system  we consider a probabilistic model of locking in a database system in which an arriving transaction is blocked and lost when its lock requests conflict with the locks held by currently executing transactions. both exclusive and shared locks are considered. we derive a simple asymptotic expression for the probability of blocking which is exact to order 1/n where n is the number of lockable items in the database. this expression reduces to one recently derived by mitra and weinberger for the special case where all locks are exclusive.  stephen s. lavenberg
multi-join on parallel processors  the paper describes a preliminary evaluation of some multi-join strategies and their performances on parallel hardware. the hardware used was a sequent (under unix) with 11 usable processors, each with shared and private primary memory. a multi-join was broken down into a series of single joins which were then allocated to clusters, each cluster being a collection of parallel processors. the results of single joins, which were studied by both binary search and hash-merge techniques, were then further processed as necessary.  the evaluation was conducted varying a number of parameters, such as cluster size, tuple size and cardinality. the comparative results were plotted. the study highlights the importance of a number of factors that influence the performance of a multi-join operation.  s. m. deen d. n. p. kannangara m. c. taylor