waashk/acm huggingface dataset:
the open video project: research-oriented digital video repository  a future with widespread access to large digital libraries of video is nearing reality. anticipating this future, a great deal of research is focused on methods of browsing and retrieving digital video, developing algorithms for creating surrogates for video content, and creating interfaces that display result sets from multimedia queries. research in these areas requires that each investigator acquire and digitize video for their studies since the multimedia information retrieval community does not yet have a standard collection of video to be used for research purposes. the primary goal of the open video project is to create and maintain a shared digital video repository and test collection to meet these research needs.  gary geisler gary marchionini
browsing digital video  video in digital format played on programmable devices presents opportunities for significantly enhancing the user's viewing experience. for example, time compression and pause removal can shorten the viewing time for a video, textual and visual indices can allow personalized navigation through the content, and random-access digital storage allows instantaneous seeks into the content. to understand user behavior when such capabilities are available, we built a software video browsing application that combines many such features. we present results from a user study where users browsed video in six different categories: classroom lectures, conference presentations, entertainment shows, news, sports, and travel. our results show that the most frequently used features were time compression, pause removal, and navigation using shot boundaries. also, the behavior was different depending on the content type, and we present a classification. finally, the users found the browser to be very useful. two main reasons were: i) the ability to save time and ii) the feeling of control over what content they watched.  francis c. li anoop gupta elizabeth sanocki li-wei he yong rui
reliable distributed database systems (abstract only)  we are investigating the problem of ensuring global consistency in the context of distributed database systems. our current research effort concentrates on theoretical study of reliability mechanisms such as algorithm design and performance characterization. in addition, we are building a testbed for evaluating different reliability mechanisms through detailed simulation and actual experimentation.  replication is the key factor in improving the availability of distributed database systems. a major restriction in using replication is that replicated copies must behave like a single copy. we have developed algorithms for replication control using tokens [2, 5]. the next step of our research in this direction would be to evaluate different partial operation policies which are critical in maintaining the correctness and achieving the high availability of distributed database systems. two alternatives are possible when a partition occurs: pessimistic and optimistic. neither of the two alternatives is superior to the other. higher availability achieved by an optimistic approach may be penalized during recovery from partition failures, by backing out committed transactions which violate consistency constraints.  even if the replication and concurrency control mechanisms are correct and maintain the consistency of the database, the failures of hardware and/or software at the processing site and communication network may destroy the consistency of the database. in order to cope with failures, distributed database systems must provide recovery mechanisms. the goal of checkpointing is to save database states on a separate secure device so that the database can be recovered when errors and failures occur. a checkpointing mechanism which does not interfere with the transaction processing in distributed environment is highly desirable for many applications, where restricting transaction activity during checkpointing is not feasible. our earlier research has resulted in the development of a non- intrusive checkpointing algorithm, along with associated recovery mechanisms [1, 3]. the desirable properties of non-interference and global consistency not only make the checkpointing and recovery more complicated in distributed database systems, but also increase the workload of the system. currently, we are investigating the practicality of non-interfering checkpointing and fully decentralized checkpointing in distributed database systems [4, 6].  sang hyuk son
query containment for data integration systems  the problem of query containment is fundamental to many aspects of database systems, including query optimization, determining independence of queries from updates, and rewriting queries using views. in the data integration framework, however, the standard notion of query containment does not suffice. we define relative containment, which formalizes the notion of query containment relative to the sources available to the integration system. first we provide optimal bounds for relative containment for several important classes of datalog queries, including the common case of conjunctive queries. next we provide bounds for the case when sources enforce access restrictions in the form of binding pattern constraints. surprisingly, we show that relative containment for conjunctive queries is still decidable in this case, even though it is known that finding all answers to such queries may require a recursive datalog program over the sources. finally, we provide tight bounds for variants of relative containment when the queries and source descriptions may contain comparison predicates.  todd millstein alon levy marc friedman
content awareness in a file system interface: implementing the "pile" metaphor for organizing information  the pile is a new element of the desktop user interface metaphor, designed to support the casual organization of documents. an interface design based on the pile concept suggested uses of content awareness for describing, organizing, and filing textual documents. we describe a prototype implementation of these capabilities, and give a detailed example of how they might appear to the user. we believe the system demonstrates how content awareness can be not only used in a computer filing system, but made an integral part of the user's experience.  daniel e. rose richard mander tim oren dulce b. ponceleon gitt salomon yin yin wong
emancipating instances from the tyranny of classes in information modeling  database design commonly assumes, explicitly or implicitly, that instances must belong to classes. this can be termed the assumption of inherent classification. we argue that the extent and complexity of problems in schema integration, schema evolution, and interoperability are, to a large degree, consequences of inherent classification. furthermore, we make the case that the assumption of inherent classification violates philosophical and cognitive guidelines on classification and is, therefore, inappropriate in view of the role of data modeling in representing knowledge about application domains.  as an alternative, we propose a layered approach to modeling in which information about instances is separated from any particular classification. two data modeling layers are proposed: (1) an instance model consisting of an instance base (i.e., information about instances and properties) and operations to populate, use, and maintain it; and (2) a class model consisting of a class base (i.e., information about classes defined in terms of properties) and operations to populate, use, and maintain it. the two- layered model provides class independence. this is analogous to the arguments of data independence offered by the relational model in comparison to hierarchical and network models. we show that a two- layered approach yields several advantages. in particular, schema integration is shown to be partially an artifact of inherent classification that can be greatly simplified in designing a database based on a layered model; schema evolution is supported without the complexity of operations currently required by class-based models; and the difficulties associated with interoperability among heterogeneous databases are reduced because there is no need to agree on the semantics of classes among independent databases. we conclude by considering the adequacy of a two-layered approach, outlining possible implementation strategies, and drawing attention to some practical considerations.  jeffrey parsons yair wand
some dynamical properties of sequentially acquired information (abstract only)0  in this paper we obtain two closely related theorems that essentially say that no matter what information metric is used, on the average the value of the accumulated information at stopping time is bounded by a multiple of the expected stopping time. these results are also independent of the particular stopping strategy employed although they do require that the expected stopping time be finite. these results, along with a general type of stopping strategy based on incremental information, are given. later we apply our general theorem to a specific stopping strategy associated with the gis model. although we concentrate on the problem of stopping, the information function on which this stopping decision is based can also be used to choose the coa for the next cycle of the feedback loop. we apply our results to an estimation problem involving the well known shannon-weiner measure of information. since our theorems require that the expected stopping times be finite, sometime is devoted to a discussion of necessary and sufficient conditions for finite expected stopping times.  richard a. aló robert kleyle andre de korvin
a generic late-join service for distributed interactive media  in this paper we present a generic late-join service for distributed interactive media, i.e, networked media which involve user interactions. examples for distributed interactive media are shared whiteboards, networked computer games and distributed virtual environments. the generic late-join service allows a latecomer to join an ongoing session. this requires that the shared state of the medium is transmitted from the old participants of the session to the latecomer in an efficient and scalable way. in order to be generic and useful for a broad range of distributed interactive media, we have implemented the late-join service based on the real time application level protocol for distributed interactive media (rtp/i). all applications which employ this protocol can also use the generic late-join service. furthermore the late-join service can be adapted to the specific needs of a given application by specifying policies for the late-join process. applications which do use a different application level protocol than rtp/i may still use the concepts presented in this work. however, they will not be able to profit from our rtp/i based implementation.  jurgen vogel martin mauve werner geyer volker hilt christoph kuhmunch
distributed transactions in practice  the concept of transactions and its application has found wide and often indiscriminate usage. in large enterprises, the model for distributed database applications has moved away from the client-server model to a multi-tier model with large database application software forming the middle tier. the software philosophy of "buy and not build" in large enterprises has had a major influence by extending functional requirements such as transactions and data consistency throughout the multiple tiers. in this article, we will discuss the effects of applying traditional transaction management techniques to multi-tier architectures in distributed environments. we will show the performance costs associated with distributed transactions and discuss ways by which enterprises really manage their distributed data to circumvent this performance hit. our intent is to share our experience as an industrial customer with the database research and vendor community to create more usable and scalable designs.  prabhu ram lyman do pamela drew
evaluating evaluation measure stability  this paper presents a novel way of examining the accuracy of the evaluation measures commonly used in information retrieval experiments. it validates several of the rules-of-thumb experimenters use, such as the number of queries needed for a good experiment is at least 25 and 50 is better, while challenging other beliefs, such as the common evaluation measures are equally reliable. as an example, we show that precision at 30 documents has about twice the average error rate as average precision has. these results can help information retrieval researchers design experiments that provide a desired level of confidence in their results. in particular, we suggest researchers using web measures such as precision at 10 documents will need to use many more than 50 queries or will have to require two methods to have a very large difference in evaluation scores before concluding that the two methods are actually different.  chris buckley ellen m. voorhees
applying distortion-oriented displays to groupware  real time groupware systems are now moving away from strict view-sharing and towards relaxed "what-you-see-is-what-i-see" interfaces, where distributed participants in a real time session can view different parts of a shared visual workspace. as with strict view-sharing, people using relaxed- wysiwis require a sense of workspace awareness---the up-to-the-minute knowledge aobut another person's interactions with the shared workspace. the problem is deciding how to provide a user with an appropriate level of awareness of what other participants are doing when they are working in different areas of the workspace. in this video, we illustrate distortion oriented displays as a novel way of providing this awareness. these displays, which employ magnification lenses and fisheye view techniques, show global context and local detail within a single window, both peripheral and detailed awareness of other participants' actions. three prototypes are presented as examples of groupware distortion-oriented displays. the head-up lens uses a see-through lens to show full-sized local detail in the foreground, and a miniature overview showing global context in the background. the offset lens employs a magnifying lens to show detail over a miniature overview. the fisheye text viewer provides people with detail of what everyone is doing through multiple focal points, one for each participant.  saul greenberg carl gutwin andrew cockburn
capturing and playing multimedia events with streams  streams is a prototype application designed and implemented at bellcore to support the recording and playback of technical presentations, training sessions, and meetings. during playback streams lets users make choices about how the recorded information is to be presented. to further aid users, streams incorporates powerful searching techniques for locating information in audio and video streams. key features of streams include storing information as separate, single-medium streams correlated with each other by time, and using digital storage to allow rapid search and random access. we describe our capture techniques, prototype streams playback system and report initial results.  g. cruz r. hill
interoperability using appc  the complex and competitive business world of today needs to access data for various operations from different systems placed at different geographical locations. in order to fulfil this need, one should have a reliable distributed computing environment. various components of that environment may be supplied by different vendors. this means that the computing environment not only needs to be distributed but also requires interoperability. today, interoperability is no more just an idea but a reality. there is also a growing need to support interactions among various systems in a dialog mode. integrating distributed systems can only help to achieve the goal of developing a reliable distributed computing environment. in this paper, a conceptual framework for an architecture is described in conjunction with advanced program-to-program communications lu 6.2 protocol to handle that challenge. this architecture discusses the required contracting services for integrating distributed systems. this contracting service has three major components: the contract interaction services, the contract support services, and the communications infrastructure services.  debajyoti mukhopadhyay
extended algebra and calculus for nested relational databases  relaxing the assumption that relations are always in first-normal- form (1nf) necessitates a reexamination of the fundamentals of relational database theory. in this paper we take a first step towards unifying the various theories of 1nf databases. we start by determining an appropriate model to couch our formalisms in. we then define an extended relational calculus as the theoretical basis for our 1nf database query language. we define a minimal extended relational algebra and prove its equivalence to the 1nf relational calculus. we define a class of 1nf relations with certain "good" properties and extend our algebra operators to work within this domain. we prove certain desirable equivalences that hold only if we restrict our language to this domain.  mark a. roth herry f. korth abraham silberschatz
communicating with sound (panel session  the communicating with sound panel for chi '85 will focus on ways of expanding the user interface by using sound as a significant means of output. as a user's communication from the computer has progressed from large (and often smeary) printout to a teletypewriter and, finally, to the multi-window workstation displays of today, the emphasis has remained primarily on visual output. although many user terminals and workstations have the capability of generating sound, that capability is rarely used for more than audio cues (indicating status such as an error condition or task completion) and simple musical tunes. research shows that sounds convey meaningful information to users. with examples of such research, the panel members will demonstrate a variety of uses of sound output, discuss issues raised by the work, and suggest further directions. the intent of the panel is to stimulate thinking about expanding the user interface and to discuss areas for future research.  in the statements that follow, each panelist will describe his or her own work, including the data and audio dimensions used, the value of the research, remaining issues to be addressed, and suggestions for future research and application. a list of references is included for those who wish further reading.  william buxton sara a. bly steven p. frysinger david lunney douglass l. mansur joseph j. mezrich robert c. morrison
materialized view selection and maintenance using multi-query optimization  materialized views have been found to be very effective at speeding up queries, and are increasingly being supported by commercial databases and data warehouse systems. however, whereas the amount of data entering a warehouse and the number of materialized views are rapidly increasing, the time window available for maintaining materialized views is shrinking. these trends necessitate efficient techniques for the maintenance of materialized views.  in this paper, we show how to find an efficient plan for the maintenance of a _set of materialized views_, by exploiting common subexpressions between different view maintenance expressions. in particular, we show how to efficiently select (a) expressions and indices that can be effectively shared, by _transient materialization_; (b) additional expressions and indices for _permanent materialization_; and (c) the best maintenance plan --- _incremental_ or _recomputation_ \\--- for each view. these three decisions are highly interdependent, and the choice of one affects the choice of the others. we develop a framework that cleanly integrates the various choices in a systematic and efficient manner. our evaluations show that many-fold improvement in view maintenance time can be achieved using our techniques. our algorithms can also be used to efficiently select materialized views to speed up workloads containing queries and updates.  hoshi mistry prasan roy s. sudarshan krithi ramamritham
reduced mvds and minimal covers  multivalued dependencies (mvds) are data dependencies that appear frequently in the "real world" and play an important role in designing relational database schemes. given a set of mvds to constrain a database scheme, it is desirable to obtain an equivalent set of mvds that do not have any redundancies. in this paper we define such a set of mvds, called reduced mvds, and present an algorithm to obtain reduced mvds. we also define a minimal cover of a set of mvds, which is a set of reduced mvds, and give an efficient method to find such a minimal cover. the significance and properties of reduced mvds are also discussed in the context of database design (e.g., 4nf decomposition) and conflict-free mvds.  z. meral ozsoyoglu li-yan yuan
u2rs: an upgradable universal relation system  the two proposed advantages of the universal relation model are that it can deal with the logical navigation problem and the database structure upgrading problem [maier 1984]. most previous research has concentrated on the first advantage, to relieve the end-user from logical navigation through the underlying structures. however, the second proposed advantage, database structure upgrading, has not been fully discussed. this is the topic of this paper. an upgradable universal relational system (u2rs), which is able to deal with the database structure upgrading problem, is presented. the procedures for verifying and executing database system upgrading operations are described, various anticipated situations when upgrading an existing universal relation database system are classified, and conditions for determining whether a given system will be upgradable for a given upgrading operation are examined.  t. c. ting lee a. becker z. q. tan
putting the feel in look and feel  haptic devices are now commercially available and thus touch has become a potentially realistic solution to a variety of interaction design challenges. we report on an investigation of the use of touch as a way of reducing visual overload in the conventional desktop. in a two-phase study, we investigated the use of the phantom haptic device as a means of interacting with a conventional graphical user interface. the first experiment compared the effects of four different haptic augmentations on usability in a simple targeting task. the second experiment involved a more ecologically-oriented searching and scrolling task. results indicated that the haptic effects did not improve users performance in terms of task completion time. however, the number of errors made was significantly reduced. subjective workload measures showed that participants perceived many aspects of workload as significantly less with haptics. the results are described and the implications for the use of haptics in user interface design are discussed.  ian oakley marilyn rose mcgee stephen brewster philip gray
coming to the wrong decision quickly: why awareness tools must be matched with appropriate tasks  this paper presents an awareness tool designed to help distributed, asynchronous groups solve problems quickly. using a lab study, it was found that groups that used the awareness tool tended to converge and agree upon a solution more quickly. however, it was also found that individuals who did not use the awareness tool got closer to the correct solution. implications for the design of awareness tools are discussed, with particular attention paid to the importance of matching the features of an awareness tool with a workgroup's tasks and goals.  alberto espinosa jonathan cadiz luis rico-gutierrez robert kraut william scherlis glenn lautenbacher