waashk/acm huggingface dataset:
development of a windowing manager for a single process on a large screen (abstract only)  current technology provides multi-windowing capabilities for several microcomputer systems. each window is a subset of the information presented for display by a process which is executing concurrently with other processes on the micro or on an up-line host. window sizes are necessarily small since several windows are in contention for space on the limited area provided by a standard sized screen. currently available gas panels provide several times more area for character display than was previously possible. a screen manager for the ibm 3290 gas panel allows a single process to simultaneously display multiple windows on this large capacity terminal. display principles and disciplines and management standards were developed. a prototype screen manager, being implemented to demonstrate the feasibility of the formulated protocol, should inspire and facilitate additional research in this area.  mark williard leroy roquemore
presenting information in sound  in the past few years, the increase in interactive use of computers has led to an emphasis on human factors and the ways in which digital information can best be presented to users. computer graphics has been at the forefront of this growth involving vision as an active aid in interpreting data. bar charts, psuedo-color image processing, and 3-dimensional figures are but a few means of providing the viewer with data information.  as the use of computers increases, the need for a variety of alternatives of interacting with computers also increases. computer-generated sound is one capability not being fully utilized in the computer/human interface. just as an x-y plot reveals relationships in data, sounds might also reveal relationships in data. this report focuses on the potential for using computer generated sounds to present data information. the first section addresses multivariate data problems which might be aided by sound output. the second describes experiments performed to determine whether listeners can discriminate among data sets based on sound. the final section discusses ongoing work and future directions.  sara bly
eno: synthesizing structured sound spaces  eno is an audio server designed to make it easy for applications in the unix environment to incorporate non-speech audio cues. at the physical level, eno manages a shared resource, namely the audio hardware. at the logical level, it manages a sound space that is shared by various client applications. instead of dealing with sound in terms of its physical description (i.e., sampled sounds), eno allows sounds to be presented and controlled in terms of higher- level descriptions of sources, interactions, attributes, and sound space. using this structure, eno can facilitate the creation of consistent, rich systems of audio cues. in this paper, we discuss the justification, design, and implementation of eno.  michel beaudouin-lafon william w. gaver
response to "remarks on two new theorems of date and fagin"  in [df92], we present simple conditions, which we now describe, for guaranteeing higher normal forms for relational databases. a key is simple if it consists of a single attribute. we show in [df92] that if a relation schema is in third normal form (3nf) and every key is simple, then it is in projection-join normal form (sometimes called fifth normal form), the ultimate normal form with respect to projections and joins. we also show in [df92] that if a relation schema is in boyce-codd normal form (bcnf) and some key is simple, then it is in fourth normal form (4nf). these results give the database designer simple sufficient conditions, defined in terms of functional dependencies alone, that guarantee that the schema being designed is automatically in higher normal forms.  c. j. date ronald fagin
server selection on the world wide web  significant efforts are being made to digitize rare and valuable library materials, with the goal of providing patrons and historians digital facsimiles that capture the "look and feel" of the original materials. this is often done by digitally photographing the materials and making high resolution 2d images available. the underlying assumption is that the objects are flat. however, older materials may not be flat in practice, being warped and crinkled due to decay, neglect, accident and the passing of time. in such cases, 2d imaging is insufficient to capture the "look and feel" of the original. for these materials, 3d acquisition is necessary to create a realistic facsimile. this paper outlines a technique for capturing an accurate 3d representation of library materials which can be integrated directly into current digitization setups. this will allow digitization efforts to provide patrons with more realistic digital facsimile of library materials.  nick craswell peter bailey david hawking
obsolescent materialized views in query processing of enterprise information systems  in recent years, query processing has become more complex as data sources are frequently replicated and data are periodically processed and embedded within several data sources simultaneously. these trends have necessitated the optimization of techniques for query processing in order to exploit these new alternatives. accordingly, this paper introduces an improved query optimization technique, which is capable of assessing query plans that use both current and obsolescent data. in particular, we provide a cost model by which the trade-offs of using obsolescent materialized views can be evaluated and we also discuss the method's applicability to contemporary query optimization techniques.  avigdor gal
alexandria digital library  the goal of the alexandria digital library project is to develop a distributed system that provides a comprehensive range of library services for collections of spatially indexed and graphical information. while such collections include digitized maps and images as important special components, the alexandria digital library will involve a very wide range of graphical materials and will include textual materials. users of the alexandria digital library will range from school children to academic researchers to members of the general public. they will be able to retrieve materials from the library on the basis of information content as well by reference to spatial location.  terence r. smith james frew
on the expressive power of datalog: tools and a case study  we study here the language datalog( ), which is the query language obtained from datalog by allowing equalities and inequalities in the bodies of the rules. we view datalog( ) as a fragment of an infinitary logic lω and show that lω can be characterized in terms of certain two-person pebble games. this characterization provides us with tools for investigating the expressive power of datalog( ). as a case study, we classify the expressibility of fixed subgraph homeomorphism queries on directed graphs. fortune et al. [fhw80] classified the computational complexity of these queries by establishing two dichotomies, which are proper only if p np. without using any complexity- theoretic assumptions, we show here that the two dichotomies are indeed proper in terms of expressibility in datalog( ).  phokion g. kolaitis moshe y. vardi
context interchange: overcoming the challenges of large-scale interoperable database systems in a dynamic environment  research in database interoperability has primarily focused on circumventing schematic and semantic incompatibility arising from autonomy of the underlying databases. we argue that, while existing integration strategies might provide satisfactory support for small or static systems, their inadequacies rapidly become evident in large-scale interoperable database systems operating in a dynamic environment. this paper highlights the problem of receiver heterogeneity, scalability, and evolution which have received little attention in the literature, provides an overview of the context interchange approach to interoperability, illustrates why this is able to better circumvent the problems identified, and forges the connections to other works by suggesting how the context interchange framework differs from other integration approaches in the literature.  cheng hian goh stuart e. madnick michael d. siegel
responding to subtle, fleeting changes in the user's internal state  in human-to-human interaction, people sometimes are able to pick up and respond sensitively to the other's internal state as it shifts moment by moment over the course of an exchange. to find out whether such an ability is worthwhile for computer human interfaces, we built a semi-automated tutoring- type spoken dialog system. the system inferred information about the user's \scare{ephemeral emotions}, such as confidence, confusion, pleasure, and dependency, from the prosody of his utterances and the context. it used this information to select the most appropriate acknowledgement form at each moment. in doing so the system was following some of the basic social conventions for real-time interaction. users rated the system with this ability more highly than a version without.  wataru tsukahara nigel ward
"let's see your search-tool!" - collaborative use of tailored artifacts in groupware  groupware applications should be tailorable to fit the requirements of dynamically evolving and differentiated fields of application. to encourage individual and collaborative tailoring activities, applications should be tailorable on different levels of complexity. a search tool has been developed which offers different levels of tailoring complexity by means of hierarchically organized component languages. users can create alternative search tools and compound components by themselves. search tool alternatives and compound components can also be shared among the users. when introducing this tool into an organization of the political administration, it turned out that the users had considerable problems in understanding the functioning of artifacts created by someone else. to ease cooperative tailoring activities, we have implemented features, which allow users to structure, describe, and explore shared components and search tool alternatives. also we provided means to store and exchange examples for components' use.  volker wulf
xlibris: an automated library research assistant  while recent work has focused on providing tools and infrastructure for users to access electronic information over the internet, the relationship between the physical world and information available online has been relatively unexplored. information about a user's location, and the objects she interacts with, can be sufficient to recognize enough of the user's task to drive retrieval of online information relevant to the task at hand. the xlibris system automatically retrieves, aggregates, and delivers information about books to users as they are checked out of the library, using information about the books themselves and the user's task. xlibris locates books in the dewey decimal subject hierarchy to automatically search for the most relevant information about the book for the user, tailoring both the sources queried and the information returned based on the book's position in the hierarchy.  andrew crossen jay budzik mason warner larry birnbaum kristian j. hammond
speech patterns in video-mediated conversations  this paper reports on the first of a series of analyses aimed at comparing same room and video- mediated conversations for multiparty meetings. this study compared patterns of spontaneous speech for same room versus two video- mediated conversations. one video system used a single camera, monitor and speaker, and a picture-in- a-picture device to display multiple people on one screen. the other system used multiple cameras, monitors, and speakers in order to support directional gaze cues and selective listening. differences were found between same room and video-mediated conversations in terms of floor control and amount of simultaneous speech. while no differences were found between the video systems in terms of objective speech measures, other important differences are suggested and discussed.  abigail j. sellen
multiversion divergence control of time fuzziness  epsilon serializability (esr) has been proposed to manage and control inconsistency in extending the classic transaction processing. esr increases system concurrency by tolerating a bounded amount of inconsistency. in this paper, we present multiversion divergence control (mvdc) algorithms that support esr with not only value but also time fuzziness in multiversion databases. unlike value fuzziness, accumulating time fuzziness is semantically different. a simple summation of the length of two time intervals may either underestimate the total time fuzziness, resulting in incorrect execution, or overestimate the total time fuzziness, unnecessarily degrading the effectiveness of mvesr. we present a new operation, called timeunion, to accurately accumulate the total time fuzziness. because of the accurate control of time and value fuzziness by the mvdc algorithm, mvesr is very suitable for the use of multiversion databases for real-time applications that may tolerate a limited degree of data inconsistency but prefer more data recency.  calton pu miu k. tsang kun-lung wu philip s. yu
redundancy in spatial databases  spatial objects other than points and boxes can be stored in spatial indexes, but the techniques usually require the use of approximations that can be arbitrarily bad. this leads to poor performance and highly inaccurate responses to spatial queries. the situation can be improved by storing some objects in the index redundantly. most spatial indexes permit no flexibility in adjusting the amount of redundancy. spatial indexes based on z-order permit this flexibility. accuracy of the query response increases with redundancy, (there is a "diminishing return" effect). search time, as measured by disk accesses first decreases and then increases with redundancy. there is, therefore, an optimal amount of redundancy (for a given data set). the optimal use of redundancy for z-order is explored through analysis of the z-order search algorithm and through experiments.  j. a. orenstein
formal model of correctness without serializabilty  in the classical approach to transaction processing, a concurrent execution is considered to be correct if it is equivalent to a non-concurrent schedule. this notion of correctness is called serializability. serializability has proven to be a highly useful concept for transaction systems for data- processing style applications. recent interest in applying database concepts to applications in computer-aided design, office information systems, etc. has resulted in transactions of relatively long duration. for such transactions, there are serious consequences to requiring serializability as the notion of correctness. specifically, such systems either impose long- duration waits or require the abortion of long transactions. in this paper, we define a transaction model that allows for several alternative notions of correctness without the requirement of serializability. after introducing the model, we investigate classes of schedules for transactions. we show that these classes are richer than analogous classes under the classical model. finally, we show the potential practicality of our model by describing protocols that permit a transaction manager to allow correct non-serializable executions  h. k. korth g. speegle
classification and regression: money *can* grow on trees  with over 800 million pages covering most areas of human endeavor, the world- wide web is a fertile ground for data mining research to make a difference to the effectiveness of information search. today, web surfers access the web through two dominant interfaces clicking on hyperlinks and searching via keyword queries this process is often tentative and unsatisfactory better support is needed for expressing one's information need and dealing with a search result in more structured ways than available now. data mining and machine learning have significant roles to play towards this end.  in this paper we will survey recent advances in learning and mining problems related to hypertext in general and the web in particular. we will review the continuum of supervised to semi-supervised to unsupervised learning problems, highlight the specific challenges which distinguish data mining in the hypertext domain from data mining in the context of data warehouses, and summarize the key areas of recent and ongoing research.  johannes gehrke wie-yin loh raghu ramakrishnan
latent semantic indexing is an optimal special case of multidimensional scaling  latent semantic indexing (lsi) is a technique for representing documents, queries, and terms as vectors in a multidimensional real-valued space. the representtions are approximations to the original term space encoding, and are found using the matrix technique of singular value decomposition. in comparison multidimensional scaling (mds) is a class of data analysis techniques for representing data points as points in a multidimensional real- valued space. the objects are represented so that inter- point similarities in the space match inter-object similarity information provided by the researcher. we illustrate how the document representations given by lsi are equivalent to the optimal representations found when solving a particular mds problem in which the given inter-object similarity information is provided by the inner product similarities between the documents themselves. we further analyze a more general mds problem in which the interdocument similarity information, although still in inner product form is arbitrary with respect to the vector space encoding of the documents.  brian t. bartell garrison w. cottrell richard k. belew
rapid ethnography: time deepening strategies for hci field research  field research methods are useful in the many aspects of human- computer interaction research, including gathering user requirements, understanding and developing user models, and new product evaluation and iterative design. due to increasingly short product realization cycles, there has been growing interestth in more time efficient methods, including rapid prototyping methods and various usability inspection techniques. this paper will introduce "rapid ethnography," which is a collection of field methods intended to provide a reasonable understanding of users and their activities given significant time pressures and limited time in the field.. the core elements include limiting or constraining the research focus and scope, using key informants, capturing rich field data by using multiple observers and interactive observation techniques, and collaborative qualitative data analysis. a short case study illustrating the important characteristics of rapid ethnography will also be presented.  david r. millen
issues in design data management (panel session)  design data management is an emerging sub-discipline of database systems that is concerned with the management of data quite unlike that found in conventional banking, personnel, or order-entry data- bases. they contain information describing the design of complicated "engineered" objects, such as ships, buildings, mechanical devices, and integrated circuits. these objects are designed by teams of engineers who need concurrent, yet controlled access to the data. very often the view of an object as seen by one group will be different from that of others (e.g., the plumber's view of a building is very different from the electrician's view).  the members of the panel include mr. steven hoffman, calma corporation, mr. douglas gilbert, sperry-univac, and dr. roger haskin, ibm. after a brief presentation by each panelist describing his experience with design data and his assessment of how it should be managed, the panel will discuss the following questions. audience participation is invited, of course.  randy h. kat
a usage based analysis of corr  based on an empirical analysis of author usage of corr, and of its predecessor in the los alamos eprint archives, it is shown that corr has not yet been able to match the early growth of the los alamos physics archives. some of the reasons are implicit in halpern s paper,and we explore them further here. in particular,we refer to the need to promote corr more effectively for its intended community computer scientists in universities, industrial research labs and in government. we take up some points of detail on this new world of open archiving concerning centralversus distributed self- archiving,publication, the restructuring of the journal publishers review and copyright.  les carr steve hitchcock wendy hall stevan harnad
information systems research at rwth aachen  with about 8.000 researchers and 40.000 students, rwth aachen is the largest technical university in europe. the science and engineering departments and their industrial collaborators offer a lot of challenges for database research.  the chair informatik v (information systems) focuses on the theoretical analysis, prototypical development, and practical evaluation of meta information systems. meta information systems, also called repositories, document and coordinate the distributed processes of producing, integrating, operating, and evolving database-intensive applications.  our research approaches these problems from a technological and from an application perspective.  on the one hand, we pursue theory and system aspects of the integration of deductive and object-oriented technologies. one outcome of this work is a deductive object manager called conceptbase which has been developed over the past eight years and is currently used by many research groups and industrial teams throughout the world.  on the other hand, a wide range of application-driven projects aims at building a sound basis of empirical knowledge about the demands on meta information systems, and about the quality of proposed solutions. they address application domains as diverse as requirements engineering, telecommunications, cooperative engineering, organization-wide quality management, evolution of chemical production processes, and medical knowledge management. they share the vision of supporting wide-area distributed cooperation not just by low-level interoperation technology but by exploiting conceptual product and process modeling.  under the direction of m. jarke, informatik v comprises three research groups with a total of twenty senior researchers and doctoral students: distributed information systems (leader: dr. manfred jeusfeld), process information systems (dr. klaus pohl), and knowledge-based systems (prof. wolfgang nejdl). database-related activities also exist in the software engineering and applied mathematics groups.  matthias jarke
topical locality in the web  _most web pages are linked to others with related content_. this idea, combined with another that says that _text in, and possibly around, html anchors describe the pages to which they point_, is the foundation for a usable world-wide web. in this paper, we examine to what extent these ideas hold by empirically testing whether topical locality mirrors spatial locality of pages on the web. in particular, we find that the likelihood of linked pages having similar textual content to be high; the similarity of sibling pages increases when the links from the parent are close together; titles, descriptions, and anchor text represent at least part of the target page; and that anchor text may be a useful discriminator among unseen child pages. these results show the foundations necessary for the success of many web systems, including search engines, focused crawlers, linkage analyzers, and intelligent web agents.  brian d. davison