waashk/acm huggingface dataset:
creation and performance analysis of user representations in collaborative virtual environments  in distributed collaborative virtual environments, participants are often embodied or represented in some form within a virtual world. the representations take many different forms and are often driven by limitations in the available technology. desktop web based environments typically use textual or two dimensional representations, while high end environments use motion trackers to embody a participant and their actions in an avatar or human form. this paper describes this wide range of virtual user representations and their creation and performance issues investigated as part of the human-computer symbiotes project within darpa's intelligent collaboration and visualization (ic&amp;v;) program.  kevin martin
automatic structure visualization for video editing  we developed intelligent functions for the automatic description of video structure, and visualization methods for temporal-spatial video structures obtained by these functions as well as for the functions. the functions offer descriptions of cut separations, motion of the camera and filmed objects, tracts and contour lines of objects, existence of objects, and periods of existence. furthermore, identical objects are automatically linked. thus the visualization methods supported by object-links allow users to freely browse and directly manipulate the structure including descriptions and raw video data.  hirotada ueda takafumi miyatake shigeo sumino akio nagasaka
updating relational databases through weak instance interfaces  the problem of updating databases through interfaces based on the weak instance model is studied, thus extending previous proposals that considered them only from the query point of view. insertions and deletions of tuples are considered.  as a preliminary tool, a lattice on states is defined, based on the information content of the various states.  potential results of an insertion are states that contain at least the information in the original state and that in the new tuple. sometimes there is no potential result, and in the other cases there may be many of them. we argue that the insertion is deterministic if the state that contains the information common to all the potential results (the greatest lower bound, in the lattice framework) is a potential result itself. effective characterizations for the various cases exist.  a symmetric approach is followed for deletions, with fewer cases, since there are always potential results; determinism is characterized as a consequence.  paola atzeni riccardo torlone
concept based query expansion  query expansion methods have been studied for a long time - with debatable success in many instances. in this paper we present a probabilistic query expansion model based on a similarity thesaurus which was constructed automatically. a similarity thesaurus reflects domain knowledge about the particular collection from which it is constructed. we address the two important issues with query expansion: the selection and the weighting of additional search terms. in contrast to earlier methods, our queries are expanded by adding those terms that are most similar to the concept of the query, rather than selecting terms that are similar to the query terms. our experiments show that this kind of query expansion results in a notable improvement in the retrieval effectiveness when measured using both recall- precision and usefulness.  yonggang qiu hans-peter frei
human computer interaction group, university of york, u.k. (lab review)  staff in the departments of computer science and psychology at the university of york have been cooperating in interdisciplinary research since 1983\. the mainstream of york's approach is to apply theory developed in these parent disciplines to hci design. our goal is to integrate formal and empirical methods. by formal methods we mean mathematical models that are capable of capturing properties of a user interface. by empirical methods we mean the observation and measurement of user behaviour. integration of these two approaches is achieved by an iterative design process in which formal models are successively refined by testing their predictions against the results of user trials.  michael harrison andrew monk
extended object oriented model to design relational databases (abstract)  the recent trend in designing relational databases systems has been toward using object oriented model in high level. the next step is to convert the high level model into the relational diagrams from which relational are extracted. finally the relations are examined to make it sure that they are fully normalized. in the current object oriented model a number of important concepts of the relational data bases such as generalization, subset hierarchy, the relation of a record type to itself..etc either can not be represented or it hard to represent them. in this presentation the object oriented model is extended to have a better representation of the concepts such as optional or mandatory relationship, aggregation objects, association objects, generalization, subset hierarchy and others.  asad khailany wafa khorshid
comparing interfaces based on what users watch and do  with the development of novel interfaces controlled through multiple modalities, new approaches are needed to analyze the process of interaction with such interfaces and evaluate them at a fine grain of detail. in order to evaluate the usability and usefulness of such interfaces, one needs tools to collect and analyze richly detailed data pertaining to both the process and outcomes of user interaction. eye tracking is a technology that can provide detailed data on the allocation and shifts of users' visual attention across interface entities. eye movement data, when combined with data from other input modalities (such as spoken commands, haptic actions with the keyboard and the mouse, etc.), results in just such a rich data on set. however, integrating, analyzing and visualizing multimodal data on user interactions remains a difficult task. in this paper we report on a first step toward developing a suite of tools to facilitate this task. we designed and implemented an eye tracking analysis system that generates combined gaze and action visualizations from eye movement data and interaction logs. this new visualization allows an experimenter to see the visual attention shifts of users interleaved with their actions on each screen of a multi-screen interface. a pilot experiment on comparing two interfaces --- a traditional interface and a speech-controlled one --- to an educational multimedia application was carried out to test the utility of our tool.  eric c. crowe n. hari narayanan
an evaluation of query processing strategies using the tipster collection  the tipster collection is unusual because of both its size and detail. in particular, it describes a set of information needs, as opposed to traditional queries. these detailed representations of information need are an opportunity for research on different methods of formulating queries. this paper describes several methods of constructing queries for the inquery information retrieval system, and then evaluates those methods on the tipster document collection. both adhoc and routing query processing methods are evaluated.  james p. callan w. bruce croft
database description with sdm: a semantic database model  sdm is a high-level semantics-based database description and structuring formalism (database model) for databases. this database model is designed to capture more of the meaning of an application environment than is possible with contemporary database models. an sdm specification describes a database in terms of the kinds of entities that exist in the application environment, the classifications and groupings of those entities, and the structural interconnections among them. sdm provides a collection of high-level modeling primitives to capture the semantics of an application environment. by accommodating derived information in a database structural specification, sdm allows the same information to be viewed in several ways; this makes it possible to directly accommodate the variety of needs and processing requirements typically present in database applications. the design of the present sdm is based on our experience in using a preliminary version of it.  sdm is designed to enhance the effectiveness and usability of database systems. an sdm database description can serve as a formal specification and documentation tool for a database; it can provide a basis for supporting a variety of powerful user interface facilities, it can serve as a conceptual database model in the database design process; and, it can be used as the database model for a new kind of database management system.  michael hammer dennis mc leod
graphical styles for building interfaces by demonstration  conventional interface builders allow the user interface designer to select widgets such as menus, buttons and scroll bars, and lay them out using a mouse. although these are conceptually simple to use, in practice there are a number of problems. first, a typical widget will have dozens of properties which the designer might change. insuring that these properties are consistent across multiple widgets in a dialog box and multiple dialog boxes in an application can be very difficult. second, if the designer wants to change the properties, each widget must be edited individually. third, getting the widgets laid out appropriately in a dialog box can be tedious. grids and alignment commands are not sufficient. this paper describes graphical tabs and graphical styles in the gild interface builder which solve all of these problems. a "graphical tab" is an absolute position in a window. a "graphical style" incorporates both property and layout information, and can be defined by example, named, applied to other widgets, edited, saved to a file, and read from a file. if a graphical style is edited, then all widgets defined using that style are modified. in addition, because appropriate styles are inferred, they do not have to be explicitly applied.  osamu hashimoto brad a. myers
fact: a learning based web query processing system  though the query is posted in key words, the returned results contain exactly the information that the user is querying for, which may not be explicitly specified in the input query.  the required information is often not contained in the web pages whose urls are returned by a search engine. fact is capable of navigating in the neighborhood of these pages to find those that really contain the queried segments.  the system does not require a prior knowledge about users such as user profiles [1] or preprocessing of web pages such as wrapper generation [2].  a prototype system has been implemented using the approach. it learns and applies two types of knowledge, navigation knowledge for following hyperlinks and classification knowledge for queried segment identification. for learning, it supports three training strategies, namely sequential training, random training and interleaved training. yahoo! is currently the external search engine. the urls of web pages returned by the external search engine are used in processing.  a set of experiments that are designed to evaluate the system, and compare different implementations, such as knowledge representations and training strategies.  songting chen yanlei diao hongjun lu zengping tian
quorum consensus in nested-transaction systems  gifford's quorum consensus algorithm for data replication is studied in the context of nested transactions and transaction failures (aborts), and a fully developed reconfiguration strategy is presented. a formal description of the algorithm is presented using the input/output automaton model for nested- transaction systems due to lynch and merritt. in this description, the algorithm itself is described in terms of nested transactions. the formal description is used to construct a complete proof of correctness that uses standard assertional techniques, is based on a natural correctness condition, and takes advantage of modularity that arises from describing the algorithm as nested transactions. the proof is accomplished hierarchically, showing that a fully replicated reconfigurable system "simulates" an intermediate replicated system, and that the intermediate system simulates an unreplicated system. the presentation and proof treat issues of data replication entirely separately from issues of concurrency control and recovery.  kenneth j. goldman nancy lynch
an exploratory evaluation of three interfaces for browsing large hierarchical tables of contents  three different interfaces were used to browse a large (1296 items) table of contents. a fully expanded stable interface, expand/contract interface, and multipane interface were studied in a between- groups experiment with 41 novice participants. nine timed fact retrieval tasks were performed; each task is analyzed and discussed separately. we found that both the expand/contract and multipane interfaces produced significantly faster times than the stable interface for many tasks using this large hierarchy; other advantages of the expand/contract and multipane interfaces over the stable interface are discussed. the animation characteristics of the expand/contract interface appear to play a major role. refinements to the multipane and expand/contract interfaces are suggested. a predictive model for measuring navigation effort of each interface is presented.  richard chimera ben shneiderman
incremental view maintenance in object-oriented databases a database management system should support views to facilitate filtering of information in order to have only necessary and required information available to users with minimal delay. although a lot of research efforts concentrated on views within the conventional relational model, much more effort is required when object-oriented models are considered. however, supporting views is only a step forward in achieving the purpose that requires improving the performance of the system by considering incremental maintenance of views instead of recomputing a view from scratch each time it is accessedin this paper, we introduce a model that facilitates incremental maintenance of single-class- based object-oriented views by employing the deferred update mode that has proved to be more suitable for object-oriented databases in general. for that purpose, we categorize classes into base and brother classes corresponding to classes originally present in the database and those introduced as views, respectively. to each class, we add a modification list that keeps related modifications during different intervals. an interval starts with the creation or update of a view and ends with the creation or update of another view. a modification list is empty as long as no views depend on its class. further, we introduce some algorithms that locate modifications done on related classes while trying to compute a given view incrementally. finally, we give a theoretical justification showing that, in general, the introduced algorithms perform much better than doing computation from scratch each time a view is accessed. reda alhajj faruk polat
developing recommendation services for a digital library with uncertain and changing data  in developing recommendation services for a new digital library called ilumina (www.ilumina-project.org), we are faced with several challenges related to the nature of the data we have available. the availability and consistency of data associated with ilumina is likely to be highly variable. any recommendation strategy we develop must be able to cope with this fact, while also being robust enough to adapt to additional types of data available over time as the digital library develops. in this paper we describe the challenges we are faced with in developing a system that can provide our users with good, consistent recommendations under changing and uncertain conditions.  gary geisler david mcarthur sarah giersch
discovering quasi-equivalence relationships from database systems  association rule mining has recently attracted strong attention and proven to be a highly successful technique for extracting useful information from very large databases. in this paper, we explore a generalized affinity- based association mining which discovers quasi-equivalent media objects in a distributed information-providing environment consisting of a network of heterogeneous databases which could be relational databases, hierarchical databases, object-oriented databases, multimedia databases, etc. online databases, consisting of millions of media objects, have been used in business management, government administration, scientific and engineering data management, and many other applications owing to the recent advances in high- speed communication networks and large-capacity storage devices. because of the navigational characteristic, queries in such an information-providing environment tend to traverse equivalent media objects residing in different databases for the related data records. as the number of databases increases, query processing efficiency depends heavily on the capability to discover the equivalence relationships of the media objects from the network of databases. theoretical terms along with an empirical study of real databases are presented.  mei-ling shyu shu-ching chen r. l. kashyap
the retrieval power of nfql  forms are common and well understood in our modern society, especially in the office. they organize and structure communication according to well established and long standing convention. the natural forms query language (nfql) takes advantage of these features to provide a "natural" communication language between computers and humans. various facets of nfql have been discussed elsewhere. in this paper we explore the retrieval power of nfql. we explain why basic nfql forms (which are essentially ordinary business forms) do not by themselves have enough retrieval power to be relationally complete. we then explain how to augment the notation to increase the retrieval power, and we provide an inductive proof to show that nfql, as augmented, is relationally complete. because additional notation may negatively effect usability, we discuss the pragmatics of adding new features. we explain how these features can be improved notationally, and argue that, with the improvements, we maintain the objective of being able to interpret standard forms, while increasing their retrieval power.  y. k. ng d. w. embley
design rules based on analyses of human error  by analyzing the classes of errors that people make with systems, it is possible to develop principles of system design that minimize both the occurrence of error and the effects. this paper demonstrates some of these principles through the analysis of one class of errors: slips of action. slips are defined to be situations in which the user's intention was proper, but the results did not conform to that intention. many properties of existing systems are conducive to slips; from the classification of these errors, some procedures to minimize the occurrence of slips are developed.  donald a. norman
a pegging method for decomposing relations in databases  the anomalies in normal forms generally can be reduced by decomposing relations. unfortunately many current decomposition procedures fail to give lossless decomposition and still preserve all functional dependencies. a pegging method is proposed to solve this decomposition problem. pegging is also helpful in decomposing relations that have the characteristics of "three- decomposability" and some fifth normal form relations.  c. alec chang michael s. leonard h. brian hwarng tzong-huie shiau
satellite: a visualization and navigation tool for hypermedia  satellite is a visualization and navigation tool for a hypermedia system. it is based on the concept of affinity between objects; that is, a relationship with an associated intensity. the user is presented with a two dimensional map that provides a view of the hypermedia environment where objects lying close together have a greater affinity than those lying further apart. the system provides different views by allowing modification of the underlying measure of affinity. the system is also able to track dynamically the evolution of the objects' relationships.  based on the affinity concept, we develop new dynamic presentation techniques that do not depend on the explicit display of links between the nodes of the graph. the dynamic layout algorithm that we present at the end of the paper is based on these techniques and it allows for the display of rapidly changing relationships between objects.  x. pintado d. tsichritzis
different cultures meet (panel session): lessons learned in global digital library development  this panel is organized to share the experience gained and lessons lea rned in developing cutting-edge technology applications and digital libraries when different cultures meet together. "culture"? interpreted in different ways and different context. this include the interdisciplinary collaboration among professionals from different fields with their own cultures -- such as library/information science, computer science, humanities, social sciences, science and technology, etc; to more globally as experienced in major international collaborative projects involving r&amp;d; professionals from two or more different cultures -- the east and the west, or the north and the south.  the moderator will share her own personal perspective on the true meaning of global and interdisciplinary collaboration, drawing upon experiences gained in conducting numerous technology related r&amp;d; activities throughout the years, starting from her award winning multimedia project on the first emperor of china1 and his 7000 magnificent terracotta warriors and horses, supported by the national endowment for the humanities in the mid-1980s to her recent (since may 2000) and challenging nsfs international digital library project (idlp) called chinese memory net (cmnet): us-sino collaborative research toward global digital library, culminating the community building experiences at nit conferences with many participants of jcdl from over 15 countries at the nit 2001 in beijing, china during may 29-31, 2001.  cmnets us affiliates include academic researchers from several universities, including drexel university, kent state university, syracuse university, university of kentucky, and university of wisconsin-milwaukee. its collaborators in beijing include peking university and tsinghua university, in shanghai include the shanghai jiaotong university, and in taipei including national taiwan university, national tsinghua university, and the academia sinica. several collaborato  ching chen wen gao hsueh-hua chen li-zhu zhou von-wun soo
spire: a progressive content-based spatial image retrieval engine  in this demo, we will show the implementation of a content-based spatial image retrieval engine (spire) for multimodal unstructured data. this architecture provides a framework for retrieving multi-modal data including image, image sequence, time series and parametric data from large archives. dramatic speedup (from a factor of 4 to 35) has been achieved for many search operations such as template matching, texture feature extraction. this framework has been applied and validated in solar flares and petroleum exploration in which spatial and spatial-temporal phenomena are located.  chung-sheng li lawrence d. bergman yuan-chi chang vittorio castelli john r. smith