waashk/acm huggingface dataset:
design alternatives for user interface management sytems based on experience with cousin  user interface management systems (uimss) provide user interfaces to application systems based on an abstract definition of the interface required. this approach can provide higher-quality interfaces at a lower construction cost. in this paper we consider three design choices for uimss which critically affect the quality of the user interfaces built with a uims, and the cost of constructing the interfaces. the choices are examined in terms of a general model of a uims. they concern the sharing of control between the uims and the applications it provides interfaces to, the level of abstraction in the definition of the information exchanged between user and application, and the level of abstraction in the definition of the sequencing of the dialogue. for each choice, we argue for a specific alternative. we go on to present cousin, a uims that provides graphical interfaces for a variety of applications based on highly abstracted interface definitions. cousin's design corresponds to the alternatives we argued for in two out of three cases, and partially satisfies the third. an interface developed through, and run by cousin is described in some detail.  philip j. hayes pedro a. szekely richard a. lerner
selection from alphabetic and numeric menu trees using a touch screen: breadth, depth, and width  goal items were selected by a series of touch-menu choices among sequentially subdivided ranges of integers or alphabetically ordered words. the number of alternatives at each step, b, was varied, and, inversely, the size of the target area for the touch. mean response time for each screen was well described by t = k+& lt;italic>clogb, in agreement with the hick-hyman and fitts' laws for decision and movement components in series. it is shown that this function favors breadth over depth in menus, whereas others might not. speculations are offered as to when various functions could be expected.  t. k. landauer d. w. nachbar
a relation-based language interpreter for a content addressable file store  the combination of the content addressable file store (cafs®; cafs is a registered trademark of international computers limited) and an extension of relational analysis is described. this combination allows a simple and compact implementation of a database query and update language (fidl). the language has one of the important properties of a "natural" language interface by using a "world model" derived from the relational analysis. the interpreter (flin) takes full advantage of the cafs by employing a unique database storage technique which results in a fast response to both queries and updates.  t. r. addis
aggregation everywhere: data reduction and transformation in the phoenix data warehouse  this paper describes the phoenix system, which loads a data warehouse and then reports against it. between the raw atomic data of the source system and the business measures presented to users there are many computing environments. aggregation occurs everywhere: initial bucketing by the natural keys on the mainframe, loading the fact table using a mapping table, maintaining aggregate tables and reporting tables in the data base, in the gui, in sql queries issued on behalf of client tools by the web server, and inside the client tools themselves. producing the desired business measures required writing a complex sql query, and post-processing an excel pivot table.  steven tolkin
a cross-media adaptation strategy for multimedia presentations  adaptation techniques for multimedia presentations are mainly concerned with switching between different qualities of single media elements to reduce the data volume and by this to adapt to limited presentation resources. this kind of adaptation, however, is limited to an inherent lower bound, i.e., the lowest acceptable technical quality of the respective media type. to overcome this limitation, we propose cross- media adaptation in which the presentation alternatives can be media elements of different media type, even different fragments. thereby, the alternatives can extremely vary in media type and data volume and this enormously widens the possibilities to efficiently adapt to the current presentation resources. however, the adapted presentation must still convey the same content as the original one, hence, the substitution of media elements and fragments must preserve the presentation semantics. therefore, our cross-media adaptation strategy provides models for the automatic augmentation of multimedia documents by semantically equivalent presentation alternatives. additionally, during presentation, substitution models enforce a semantically correct information flow in case of dynamic adaptation to varying presentation resources. the cross-media adaptation strategy allows for flexible reuse of multimedia content in many different environments and, at the same time, maintains a semantically correct information flow of the presentation.  susanne boll wolfgang klas jochen wandel
a prefetching scheme based on the analysis of user access patterns in news-on- demand system  the nod article makes a difference to vod data in terms of media type, size, creation interval and user interactivity. because of these intrinsic characteristics, user access patterns of the nod article can be different from that of vod data. in this paper, we analyze the log file of one electronic newspaper to show the short-term popularity and long-term popularity patterns. based on these patterns, we propose llbf (largest life- cycle based frequency) prefetching scheme that uses the two popularity patterns to cache a set of popular articles. in simulation, we show that the proposed llbf prefetching scheme increases hit ratio, and reduces the number of replacements more than other replacement algorithms as a small number of articles such as headline news is prefetched in main memory.  tae-uk choi young-ju kim ki-dong chung
reliability mechanisms for sdd-1: a system for distributed databases  this paper presents the reliability mechanisms of sdd-1, a prototype distributed database system being developed by the computer corporation of america. reliability algorithms in sdd-1 center around the concept of the reliable network (relnet). the relnet is a communications medium incorporating facilities for site status monitoring, event timestamping, multiply buffered message delivery, and the atomic control of distributed transactions.  this paper is one of a series of companion papers on sdd-1 [3, 4, 6, 13].  micael hammer david shipman
multiparty videoconferencing at virtual social distance: majic design  this paper describes the design and implementation of majic, a multi- party videoconferencing system that projects life-size video images of participants onto a large curved screen as if users in various locations are attending a meeting together and sitting around a table. majic also supports multiple eye contact among the participants and awareness of the direction of the participants' gaze. hence, users can carry on a discussion in a manner comparable to face-to-face meetings. we made video-tape recordings of about twenty visitors who used the prototype of majic at the nikkei collaboration fair in tokyo. our initial observations based on this experiment are also reported in this paper.  ken-ichi okada fumihiko maeda yusuke ichikawaa yutaka matsushita
dimensionality reduction for similarity searching in dynamic databases  databases are increasingly being used to store multi-media objects such as maps, images, audio and video. storage and retrieval of these objects is accomplished using multi-dimensional index structures such as r*-trees and ss- trees. as dimensionality increases, query performance in these index structures degrades. this phenomenon, generally referred to as the dimensionality curse, can be circumvented by reducing the dimensionality of the data. such a reduction is however accompanied by a loss of precision of query results. current techniques such as qbic use svd transform-based dimensionality reduction to ensure high query precision. the drawback of this approach is that svd is expensive to compute, and therefore not readily applicable to dynamic databases. in this paper, we propose novel techniques for performing svd-based dimensionality reduction in dynamic databases. when the data distribution changes considerably so as to degrade query precision, we recompute the svd transform and incorporate it in the existing index structure. for recomputing the svd-transform, we propose a novel technique that uses aggregate data from the existing index rather than the entire data. this technique reduces the svd-computation time without compromising query precision. we then explore efficient ways to incorporate the recomputed svd- transform in the existing index structure without degrading subsequent query response times. these techniques reduce the computation time by a factor of 20 in experiments on color and texture image vectors. the error due to approximate computation of svd is less than 10%.  k. v. ravi kanth divyakant agrawal ambuj singh
ir evaluation methods for retrieving highly relevant documents  this paper proposes evaluation methods based on the use of non-dichotomous relevance judgements in ir experiments. it is argued that evaluation methods should credit ir methods for their ability to retrieve highly relevant documents. this is desirable from the user point of view in modern large ir environments. the proposed methods are (1) a novel application of p-r curves and average precision computations based on separate recall bases for documents of different degrees of relevance, and (2) two novel measures computing the cumulative gain the user obtains by examining the retrieval result up to a given ranked position. we then demonstrate the use of these evaluation methods in a case study on the effectiveness of query types, based on combinations of query structures and expansion, in retrieving documents of various degrees of relevance. the test was run with a best match retrieval system (in-query1) in a text database consisting of newspaper articles. the results indicate that the tested strong query structures are most effective in retrieving highly relevant documents. the differences between the query types are practically essential and statistically significant. more generally, the novel evaluation methods and the case demonstrate that non-dichotomous relevance assessments are applicable in ir experiments, may reveal interesting phenomena, and allow harder testing of ir methods.  kalervo jarvelin jaana kekalainen
design of an external schema facility to define and process recursive structures  the role of the external schema is to support user views of data and thus to provide programmers with easier data access. this author believes that an external schema facility is best based on hierarchies, both simple and recursive. after a brief introduction to an external schema facility to support simple hierarchical user views, the requirements for a facility for recursive hierarchies are listed and the necessary extensions to the external schema definition language are offered.  functions that must be provided for generality in definition are node specification and node control. tree traversal functions must be provided for processing. definitions of each and examples of use are presented.  eric k. clemons
advances in information retrieval(acm 82 panel session)  in conventional information retrieval boolean combinations of index terms are used to formulate the users' information request. boolean queries are difficult to generate and the retrieved items are not presented to the user in any useful order. a new flexible retrieval system is described which makes it possible to relax the strict conditions of boolean query logic thereby retrieving useful items that are rejected in a conventional retrieval situation. the query structure inherent in the boolean system is preserved, while at the same time weighted terms may be incorporated into both queries and stored documents; the retrieved output can also be ranked in strict similarity order with the user queries. a conventional retrieval system can be modified to make use of the flexible metric system. laboratory tests indicate that the extended system produces better retrieval output than conventional boolean or vector processing systems.  donald h. kraft
a statistical approach to incomplete information in database systems  there are numerous situations in which a database cannot provide a precise answer to some of the questions that are posed. sources of imprecision vary and include examples such as recording errors, incompatible scaling, and obsolete data. in many such situations, considerable prior information concerning the imprecision exists and can be exploited to provide valuable information for queries to which no exact answer can be given. the objective of this paper is to provide a framework for doing so.  eugene wong
role-based security, object oriented databases and separation of duty  in this paper we combined concepts of role-based protection and object oriented (o-o) databases to specify and enforce separation of duty as required for commercial database integrity [5, 23, 24]. roles essentially partition database information into access contexts. methods (from the o-o world) associated with a database object, also partition the object interface to provide windowed access to object information. by specifying that all database information is held in database objects and authorizing methods to roles, we achieve object interface distribution across roles. for processing in the commercial world we can design objects and distribute their associated methods to different roles. by authorizing different users to the different roles, we can enforce both the order of execution on the objects and separation of duty constraints on method execution.  matunda nyanchama sylvia osborn
query size estimation by adaptive sampling (extended abstract)  we present an adaptive, random sampling algorithm for estimating the size of general queries. the algorithm can be used for any query q over a database d such that 1) for some n, the answer to q can be partitioned into n disjoint subsets q1, q2, …, qn, and 2) for 1 ≤ i ≤ n, the size of qi is bounded by some function b(d, q), and 3) there is some algorithm by which we can compute the size of qi, where i is chosen randomly. we consider the performance of the algorithm on three special cases of the algorithm: join queries, transitive closure queries, and general recursive datalog queries.  richard j. lipton jeffrey f. naughton
active memory for text information retrieval  a symbolic associative processor (sap), capable of supporting parallel keyword match and record match functions, is proposed to select and streamline textual data for information retrieval. consequently, high volume text data could be analysed on-the-fly before being channelled to cpu, and thus, cushion the impact of von neumann bottleneck commonly experienced in applications requiring high i/o bandwidth. this paper identifies some of the system requirements to support text information retrieval using sap with the aid of simplified examples.  y. h. ng s. p.v. barros
pardes: a data-driven oriented active database model  most active database models adopted an event-driven approach in which whenever a given event occurs the database triggers some actions. many derivations are data-driven by nature, deriving the values of data-elements as a function of the values of other derived data-elements. the handling of such rules by current active databases suffers from semantic and pragmatic fallacies. this paper explores these fallacies and reports about the pardes language and supporting architecture, aiming at the support of data-driven rules, in an active database framework.  opher etzion
high tech or high touch (panel session): automation and human mediation in libraries  there are those who now think that traditional library services, such as cataloging and reference, will no longer be needed in the future, or at least will be fully automated. others are equally adamant that human intervention is not only important but essential. underlying such positions are a host of assumptions - about the continued existence and place of paper, the role of human intelligence and interpretation, the nature of research, and the significance of the human element. this panel brings together experts in libraries and digital technology to uncover such issues and assumptions and to discuss and debate the place of people and machines in cataloging and reference work.  david levy william arms oren etzioni diane nester barbara tillett
wsq/dsq: a practical approach for combined querying of databases and the web  we present wsq/dsq (pronounced "wisk-disk"), a new approach for combining the query facilities of traditional databases with existing search engines on the web. wsq, for _web-supported (database) queries_, leverages results from web searches to enhance sql queries over a relational database. dsq, for _database-supported (web) queries_, uses information stored in the database to enhance and explain web searches. this paper focuses primarily on wsq, describing a simple, low-overhead way to support wsq in a relational dbms, and demonstrating the utility of wsq with a number of interesting queries and results. the queries supported by wsq are enabled by two _virtual tables_, whose tuples represent web search results generated dynamically during query execution. wsq query execution may involve many high- latency calls to one or more search engines, during which the query processor is idle. we present a lightweight technique called _asynchronous iteration_ that can be integrated easily into a standard sequential query processor to enable concurrency between query processing and multiple web search requests. asynchronous iteration has broader applications than wsq alone, and it opens up many interesting query optimization issues. we have developed a prototype implementation of wsq by extending a dbms with virtual tables and asynchronous iteration; performance results are reported.  roy goldman jennifer widom
integrated data capture and analysis tools for research and testing on graphical user interfaces  our on-line data capture and analysis tools include an event capture program, event data filtering programs, a multimedia data analyzer, and a retrospective verbal protocal recorder for use with the multimedia data analyzer. off-line observation logging is also supported. additional plans for development include the integration of an online time- synchronized observation logger, and time-synchronized eyetracking data recording. the tool set provides an integrated multi-source data collection, processing, and analysis system for: 1) comparing and evaluating software applications and prototypes; 2) evaluating software documentation and instructional materials; and 3) evaluating on-line training. the tools currently run on macintosh computers and under microsoft windows. plans are to port the tools to run under presentation manager and motif.  monty l. hammontree jeffrey j. hendrickson billy w. hensley
the document management component of a multimedia data model  we describe estrella a multimedia object oriented data model developed by matra. this model is based upon objects, classes (organized in a lattice) and functions (allow to dynamically implement operations on data and new data types). the valid states of the data base are described by a set of integrity constraints. we propose a document model capable to manage structured documents and to index them with a superimposed codes method. we present as well the associated data manipulation language with a navigational interface and content search operators  c. damier b. defude
a multiparadigmatic environment for interacting with databases we present a prototype system to be used for visually accessing heterogeneous databases. the basic idea is to provide the user with several visual representations of data as well as multiple interaction mechanisms for both querying databases and visualizing the query results. since some visual representations better fit certain user classes, the system adapts to the user's needs by switching to the most appropriate visual representation and interaction mechanism, according to a suitable user model. the data and query representations are consistent in every paradigm. such a notion of consistency stems from formal basis, i.e. a twofold data/representation model, namely the graph model, and a set of basic graphical primitives. this formal approach allows the user to switch from one interaction paradigm to another, always saving the query state. t. catarci m. f. costabile a. massari l. saladini g. santucci
cscw overview (tutorial session)(abstract only)  goals and content: to provide an organized and entertaining overview of the world fo cscw for newcomers to the field. we will offer a framework for understanding cscw as a research domain, a management opportunity, and a business challenge. we will analyze some of the great successes and great disasters in cscw.  we will provide an overview of the cscw conference, incuding sunday's tutorial program, and will suggest how to learn more about cscw. we will conclude with refreshments and an opportunity to meet many of the conference participants.  jonathan grudin steven e. poltrock john patterson
dynamic wais book: an electronic book to publish and consult information distributed across a wide-area network  the aim of this paper is to present the results of a research in the design and development of a "network user interface" application which provides capabilities to locally organise information resulting from searches conducted on a collection of data distributed across a wide area network. a strong requirement which had to be satisfied was to define a model for the user interface characterised by easy and intuitive use- ability in order to provide a system that could be easily used by people not necessarily expert in computing systems.  s. bizzozero a. rana
interactive internet search: keyword, directory and query reformulation mechanisms compared  this article compares search effectiveness when using query-based internet search (via the google search engine), directory- based search (via yahoo) and phrase-based query reformulation assisted search (via the hyperindex browser) by means of a controlled, user-based experimental study. the focus was to evaluate aspects of the search process. cognitive load was measured using a secondary digit-monitoring task to quantify the effort of the user in various search states; independent relevance judgements were employed to gauge the quality of the documents accessed during the search process. time was monitored in various search states. results indicated the directory-based search does not offer increased relevance over the query-based search (with or without query formulation assistance), and also takes longer. query reformulation does significantly improve the relevance of the documents through which the user must trawl versus standard query-based internet search. however, the improvement in document relevance comes at the cost of increased search time and increased cognitive load.  peter bruza robert mcarthur simon dennis