waashk/acm huggingface dataset:
multikey access methods based on term discrimination and signature clustering  in order to improve the two-level signature file method designed by sacks- davis et al. [20], we propose new multikey access methods based on term discrimination and signature clustering. by term discrimination, we create separate, efficient access methods for the terms frequently used in user queries. we in addition cluster similar signatures by means of these terms so that we may achieve good performance on retrieval. meanwhile we provide the space-time analysis of the proposed methods and compare them with the two- level signature file method. we show that the proposed methods achieve 15-30% savings in retrieval time and require 3-9 % more storage overhead.  j. w. chang j. h. lee y. j. lee
how you tell your computer what you mean: ostension in interactive systems  an important part of communication is being able to point to an object without referring to its components or to the area surrounding it. how to do this is the problem of ostension. we observed many ostension errors in novices learning to use a full-screen text editor. specifically, the novices erroneously tried to use keys that are appropriate for pointing when using a typewriter but incorrect in screen editors (e.g., space bar, backspace key, etc.), they frequently missed the location they intended by one character, they inadvertently pointed to the wrong occurrcnce of a string using a find command, they incorrectly specified boundaries by forgetting about "invisible" characters (e.g., formatting characters), and they mistakenly attempted to point to non- typing areas of the screen that were off-limits.  james a. galambos eloise s. wikler john b. black marc m. sebrechts
a reference architecture for multi-author world-wide web servers  designing publicly accessible and distributed information structures and coordinating distributed authors is a major challenge for most organizations. this paper presents a scaleable reference architecture for multi-author world- wide web (w3) servers, one important type of a distributed and publicly accessible information system. we introduce the paradigm of "lean production of information" and discuss some problems of data quality regarding w3-servers. experiences made with a departmental w3-server designed and maintained according to the principles presented are appended as a case study.  louis perrochon
experience with an adaptive indexing scheme  previous work has shown that there is a major vocabulary barrier for new or intermittent users of computer systems. the barrier can be substantially lowered with a rich, empirically defined, frequency weighted index. this paper discusses experience with an adaptive technique for constructing such an index. in addition to being an easy way for system designers to collect the necessary data, an adaptive system has the additional advantage that data is collected from real users in real situations, not in some laboratory approximation. implementation considerations, preliminary results and future theoretical directions are discussed.  george w. furnas
space optimization in deductive databases  in the bottom-up evaluation of logic programs and recursively defined views on databases, all generated facts are usually assumed to be stored until the end of the evaluation. discarding facts during the evaluation, however, can considerably improve the efficiency of the evaluation: the space needed to evaluate the program, the i/o costs, the costs of maintaining and accessing indices, and the cost of eliminating duplicates may all be reduced. given an evaluation method that is sound, complete, and does not repeat derivation steps, we consider how facts can be discarded during the evaluation without compromising these properties. we show that every such space optimization method has certain components, the first to ensure soundness and completeness, the second to avoid redundancy (i.e., repetition of derivations), and the third to reduce "fact lifetimes" (i.e., the time period for which each fact must be retained during evaluation). we present new techniques based on providing bounds on the number of derivations and uses of facts, and using monotonicity constraints for each of the first two components, and provide novel synchronization techniques for the third component of a space optimization method. we describe how techniques for each of the three components can be combined in practice to obtain a space optimization method for a program. our results are also of importance in applications such as sequence querying, and in active databases where triggers are defined over multiple "events."  divesh srivastava s. sudarshan raghu ramakrishnan jeffrey f. naughton
an application oriented approach to view updates  views are an indispensable mechanism for providing flexible database access in a workstation environment. on the other hand, views created from more than one base relation have complex and in some cases contradicting update semantics. in this paper we suggest to distinguish between object types as the units for data manipulation and views as the data structures materializing these objects. hence, the same view can represent different object types, and depending on which of them the user is granted access, we can infer simple and coherent semantics, even for complex view definitions.  johannes klein andreas reuter
architecture of a metasearch engine that supports user information needs  when a query is submitted to a metasearch engine, decisions are made with respect to the underlying search engines to be used, what modifications will be made to the query, and how to score the results. these decisions are typically made by considering only the user's keyword query, neglecting the larger information need. users with specific needs, such as "research papers" or "homepages," are not able to express these needs in a way that affects the decisions made by the metasearch engine. in this paper, we describe a metasearch engine architecture that considers the user's information need for each decision. users with different needs, but the same keyword query, may search different sub-search engines, have different modifications made to their query, and have results ordered differently. our architecture combines several powerful approaches together in a single general purpose metasearch engine.  eric j. glover steve lawrence william p. birmingham c. lee giles
coefficients of combining concept classes in a collection  this report considers combining information to improve retrieval. the vector space model has been extended so different classes of data are associated with distinct concept types and their respective subvectors. two collections with multiple concept types are described, isi-1460 and cacm-3204. experiments indicate that regression methods can help predict relevance, given query- document similarity values for each concept type. after sampling and transformation of data, the coefficient of determination for the best model was .48 (.66) for isi (cacm). average precision for the two collections was 11% (31%) better for probabilistic feedback with all types versus with terms only. these findings may be of particular interest to designers of document retrieval or hypertext systems since the role of links is shown to be especially beneficial.  e. a. fox g. l. nunn w. c. lee
charting the course of a user survey that will rock the boat  what shall we do with the user survey?  what shall we do with the user survey?  what shall we do with the user survey?  early in the morning?  thoughts of an upcoming annual user survey should produce neither shudders nor (worse yet) yawns from your computer center staff. granted, most service organizations toss responsibility for the user survey around like a hot potato because the potential to "get burned" is real. but there are strategies for increasing the likelihood that you'll not just survive the survey experience in an academic computing environment, but actually benefit from it.  whether done poorly or proficiently, the user survey is a monumental task. it's just common sense, therefore, that if having a greater understanding of your services won't make a difference in how you deliver those services or if you don't have any burning questions about services that need answering, then you shouldn't bother with a user survey. you'll be doing both the campus and yourself a favor.  i've put together a list of simple rules for computer user surveys that will hopefully, as the title claims, chart a course that leads to a survey that will produce changes in the way you deliver services. in an attempt to adhere to the nautical theme of the conference, i've couched these user survey rules in terms of safety rules for boating and canoeing that i found in my girl scout handbook (copyright 1955). if that sounds particularly boring to you, consider that most writers couch guidelines for user surveys in the language of statistical inference and hypothesis testing, so anything is an improvement to my way of thinking.  actually, it really took very little imagination on my part to translate the simple girl scout boating rules into guidelines for computer center user surveys. for instance, the gem "stay ashore in bad weather" translate very nicely into this user survey guideline:  "never administer your user survey immediately after a thunderstorm that resulted in a two week power failure in which all systems were down and a massive loss of user files occurred."  sue stager
a sound and sometimes complete query evaluation algorithm for relational databases with null values  a sound and, in certain cases, complete method is described for evaluating queries in relational databases with null values where these nulls represent existing but unknown individuals. the soundness and completeness results are proved relative to a formalization of such databases as suitable theories of first-order logic. because the algorithm conforms to the relational algebra, it may easily be incorporated into existing relational systems.  raymond reiter
sirog: a responsive hypertext manual  power plant operation and control in modern screen-based control rooms takes place using computer displays which are directly coupled to the plant state. however, operators are provided with operational instructions and background information by means of paper manuals or at best hypertext manuals with fixed structure and contents. thus, information presentation is independent of the current situation.  to improve information accessibility we developed a situation-dependent information medium: responsive manuals. a responsive manual consists of a "standard" hypertext-based operational manual and a task description. it monitors the changing situation and based on this is able to point to relevant information.  to show the advantages of the responsive manual approach in the domain of power plant operation we implemented the sirog (situation-related operational guidance) system in close cooperation with siemans. it covers all parts of an operational manual for accidents in a siemans nuclear power plant, and is coupled directly to the plant state. the article discusses the basics of the responsive manuals approach and the role of "responsiveness" in sirog.  lothar simon jochen erdmann
outlier detection for high dimensional data  the outlier detection problem has important applications in the field of fraud detection, network robustness analysis, and intrusion detection. most such applications are high dimensional domains in which the data can contain hundreds of dimensions. many recent algorithms use concepts of proximity in order to find outliers based on their relationship to the rest of the data. however, in high dimensional space, the data is sparse and the notion of proximity fails to retain its meaningfulness. in fact, the sparsity of high dimensional data implies that every point is an almost equally good outlier from the perspective of proximity-based definitions. consequently, for high dimensional data, the notion of finding meaningful outliers becomes substantially more complex and non-obvious. in this paper, we discuss new techniques for outlier detection which find the outliers by studying the behavior of projections from the data set.  charu c. aggarwal philip s. yu
extracting entity profiles from semistructured information spaces  a semistructured information space consists of multiple collections of textual documents containing fielded or tagged sections. the space can be highly heterogeneous, because each collection has its own schema, and there are no enforced keys or formats for data items across collections. thus, structured methods like sql cannot be easily employed, and users often must make do with only full-text search. in this paper, we describe an approach that provides structured querying for particular types of entities, such as companies and people. entity- based retrieval is enabled by normalizing entity references in a heuristic, type-dependent manner. the approach can be used to retrieve documents and can also be used to construct entity profiles --- summaries of commonly sought information about an entity based on the documents' content. the approach requires only a modest amount of meta- information about the source collections, much of which is derived automatically.  robert a. nado scott b. huffman
versioning a full-text information retrieval system  in this paper, we present an approach to the incorporation of object versioning into a distributed full-text information retrieval system. we propose an implementation based on "partially versioned" index sets, arguing that its space overhead and query-time performance make it suitable for full- text ir, with its heavy dependence on inverted indexing. we develop algorithms for computing both historical queries and time range queries and show how these algorithms can be applied to a number of problems in distributed information management, such as data replication, caching, transactional consistency, and hybrid media repositories.  peter g. anick rex a. flynn
storage reclamation in object oriented database systems  when providing data management for nontraditional data, database systems encounter storage reclamation problems similar to those encountered by virtual memory managers. the paging behavior of existing automatic storage reclamation schemes as applied to objects stored in a database management system is one indicator of the performance cost of various features of storage reclamation algorithms. the results of modeling the paging behavior suggest that mark and sweep causes many more input/output operations than copy-compact. a contributing factor to the expense of mark and sweep is that it does not recluster memory as does copy-compact. if memory is not reclustered, the average cost of accessing data can go up tremendously. other algorithms that do not recluster memory also suffer performance problems, namely all reference counting schemes. the main advantage of a reference count scheme is that it does not force a running program to pause for a long period of time while reclamation takes place, it amortizes the cost of reclamation across all accesses. the reclustering of copy-compact and the cost amortization of reference count are combined to great advantage in baker's algorithm. this algorithm proves to be the least prohibitive for operating on disk-based data.  margaret h. butler
working through meetings (tutorial session)(abstract only): a framework for designing meeting support  goals and content: through this tutorial, participants will: understand distinctions among various types of meetings and the role of various types of conversations in successful meetings; understand the importance of partnership for achieving team results in meetings; formulate plans for successful technological support for meetings. participants will experience, through a series of connected exercises, an ad hoc meeting designed to highlight what is important about meetings. out of this experience, various theories that apply to meetings will become relevant. from an integration of experience and theory, we will explore how technology can be used innovatively and effectively to support meetings.  john bennett john karat
a multicast scheme for parallel software-only video effects processing  we have developed a parallel software-only processing system for creating real-time video effects such as titling and compositing (e.g., picture-in- picture) using compressed internet video sources. the system organizes processors into a hierarchy of levels. processes at each level of the hierarchy can exploit different types of parallelism and coordinate the actions of lower levels. to control the effect, control messages must be distributed to processors in the hierarchy while preserving the independence of each level. this requires a control mechanism that supports efficient delivery of messages to groups of processors, tunable reliability semantics, and recoverable state information. we describe a mechanism that meets these requirements that uses ip-multicast, the scalable reliable multicast protocol, and the scalable naming and announcement protocol. we also describe an optimization that provides a flexible framework for linking the control of different aspects of one or more related video effects.  ketan mayer- patel lawrence a. rowe
interpersonal trust and common ground in electronically mediated communication  communication and commerce by web or phone creates benefits and challenges for both buyer and seller. websites provide convenience and visualization; telephones provide voice and real-time interaction. to combine key elements of these experiences, we developed phonechannel. using phonechannel, a pc user while talking on the telephone can display visuals on the other person's television. how do these different media affect the consumer experience? in a recent laboratory study, prospective homebuyers selected houses of interest using web, telephone, or phonechannel. using the telephone or phonechannel led to higher trust; but using web or phonechannel led to higher ratings on convenience, enjoyment, and 'good method' scales.  steve greenspan david goldberg david weimer andrea basso
on hypertext  this panel will employ two different interpretations of the phrase "growing up" to address areas of common interest between hypertext and information retrieval researchers. first, the panelists will question whether or not hypertext is "growing up" as a scientific discipline; they will discuss characteristics that separate hypertext research from other related disciplines. second, the panelists will discuss the problems encountered when a hypertext system "grows up" in size and complexity; they will discuss the very real problems expected when representing and integrating large knowledge bases, accommodating multiple users, and distributing single logical hypertexts across multiple physical sites.  the panelists will not lecture, but they will advance a number of themes including "the myth of modularity" (frisse), "new architectures employing hyperconcept databases" (agosti), "hypertext in software engineering" (bruandet), "automatic hypertext generation" (hahn), and "large-scale hypertexts" (weiss).  m. frisse m. agosti m. f. bruandet u. hahn s. weiss
electronic document addressing: dealing with change  the management of electronic document collections is fundamentally different from the management of paper documents. the ephemeral nature of some electronic documents means that the document address (i.e., reference details of the document) can become incorrect some time after coming into use, resulting in references, such as index entries and hypertext links, failing to correctly address the document they describe. a classic case of invalidated references is on the world wide web---links that point to a named resource fail when the domain name, file name, or any other aspect of the addressed resource is changed, resulting in the well-known error 404. additionally, there are other errors which arise from changes to document collections.  this paper surveys the strategies used both in world wide web software and other hypertext systems for managing the integrity of references and hence the integrity of links. some strategies are preventative, not permitting errors to occur; others are corrective, discovering references errors and sometimes attempting to correct them; while the last strategy is adaptive, because references are calculated on a just-in-time basis, according the current state of the document collection.  helen ashman
performance evaluation of attribute-based tree organization  a modified version of the multiple attribute tree (mat) database organization, which uses a compact directory, is discussed. an efficient algorithm to process the directory for carrying out the node searches is presented. statistical procedures are developed to estimate the number of nodes searched and the number of data blocks retrieved for most general and complex queries. the performance of inverted file and modified mat organizations are compared using six real-life databases and four types of query complexities. careful tradeoffs are established in terms of storage and access times for directory and data, query complexities, and database characteristics.  v. gopalakrishna c. e. veni madhavan
designing and mining multi-terabyte astronomy archives: the sloan digital sky survey  the next-generation astronomy digital archives will cover most of the sky at fine resolution in many wavelengths, from x-rays, through ultraviolet, optical, and infrared. the archives will be stored at diverse geographical locations. one of the first of these projects, the sloan digital sky survey (sdss) is creating a 5-wavelength catalog over 10,000 square degrees of the sky (see http://www.sdss.org/). the 200 million objects in the multi-terabyte database will have mostly numerical attributes in a 100+ dimensional space. points in this space have highly correlated distributions.  the archive will enable astronomers to explore the data interactively. data access will be aided by multidimensional spatial and attribute indices. the data will be partitioned in many ways. small _tag_ objects consisting of the most popular attributes will accelerate frequent searches. splitting the data among multiple servers will allow parallel, scalable i/o and parallel data analysis. hashing techniques will allow efficient clustering, and pair-wise comparison algorithms that should parallelize nicely. randomly sampled subsets will allow de-bugging otherwise large queries at the desktop. central servers will operate a data pump to support sweep searches touching most of the data. the anticipated queries will require special operators related to angular distances and complex similarity tests of object properties, like shapes, colors, velocity vectors, or temporal behaviors. these issues pose interesting data management challenges.  alexander s. szalay peter z. kunszt ani thakar jim gray don slutz robert j. brunner
the impact of electronic mail on managerial and organizational communications  the primary objectives of this study were to determine how an electronic mail system was being used by manager and professionals in a business setting and to describe its cognitive, affective and behavioral impacts. the organizational impacts reported by the respondents were compared with research-based evidence reported by experts in an earlier study by kerr and hiltz. the results showed that electronic mail was used extensively to displace phone calls and memos particularly for "organizing" activities, such as scheduling events, asking questions, and providing feedback. the experiences of the users showed that electronic mail reduced lag times in distributing information, created more flexible working hours, and provided lateral linkages throughout the organization. more pervasive social impacts of electronic mail, such as changes in social structure, expansion in group size, and increase in span of control, were not experienced to a marked degree.  mary sumner