waashk/acm huggingface dataset:
a probabilistic relational algebra for the integration of information retrieval and database systems  we present a probabilistic relational algebra (pra) which is a generalization of standard relational algebra. in pra, tuples are assigned probabilistic weights giving the probability that a tuple belongs to a relation. based on intensional semantics, the tuple weights of the result of a pra expression always conform to the underlying probabilistic model. we also show for which expressions extensional semantics yields the same results. furthermore, we discuss complexity issues and indicate possibilities for optimization. with regard to databases, the approach allows for representing imprecise attribute values, whereas for information retrieval, probabilistic document indexing and probabilistic search term weighting can be modeled. we introduce the concept of vague predicates which yield probabilistic weights instead of boolean values, thus allowing for queries with vague selection conditions. with these features, pra implements uncertainty and vagueness in combination with the relational model.  norbert fuhr thomas rölleke
a design system approach to data integrity  due to the nature of chip design, the very large-scale integrated (vlsi) design data base is constantly changing. the changes may be caused by logical or physical design activities. in either case, there is a need to make sure that no matter what happens, the data base remains valid. this paper discusses a system which uses an automated data integrity technique (audit) to eliminate errors prior to hardware build.  william a. noon ken n. robbins m. ted roberts
a case study for evaluating interface design through communicability  communicability evaluation is a method based on semiotic engineering that aims at assessing how designers communicate to users their design intents and chosen interactive principles, and thus complements traditional usability evaluation methods.  in this paper, we present a case study in which we evaluate how communicablity tagging of an application changes along users learning curves. our main goal was to have indications of how communicability evaluation along a learning period helps provide valuable information about interface designs, and identify communicative and interactive problems, as users become more proficient in the application.  raquel o. prates simone d. j. barbosa clarisse s. de souza
a simple database language for personal computers  a simple database language for personal computers has been implemented by selecting a subset of the ans mumps language and enhancing it so as to meet the requirements of microcomputer end-users who are unfamiliar with computers. this database language is named micro mumps. its database is based on a modified prefix b-tree having parameters for adjusting its data organization according to the requirements of space and time efficiency. experience with micro mumps has demonstrated a remarkable reduction in programming time.  tan watanabe tsuneharu ohsawa takaji suzuki
consistency of models  the topic of this session is the consistency of models. (i believe that consistency and integrity are substantially the same.) a model basically contains:  \\- states consisting of entities and various relationships between them,  \\- operations (functions) for examining states, and  \\- operations (procedures) for changing states.  the topic will be discussed in terms of the following, rather controversial issues:  1\\. kinds of consistency  2\\. specifying consistency  3\\. detecting inconsistency  4\\. living with inconsistency  5\\. concurrency and consistency  6\\. recovery from failure  7\\. exploiting constraint knowledge  for each issue i will present my own view, and i encourage alternative views to be expressed.
efficient and effective metasearch for text databases incorporating linkages among documents  linkages among documents have a significant impact on the importance of documents, as it can be argued that important documents are pointed to by many documents or by other important documents. metasearch engines can be used to facilitate ordinary users for retrieving information from multiple local sources (text databases). there is a search engine associated with each database. in a large-scale metasearch engine, the contents of each local database is represented by a representative. each user query is evaluated against he set of representatives of all databases in order to determine the appropriate databases (search engines) to search (invoke) in previous word, the linkage information between documents has not been utilized in determining the appropriate databases to search. in this paper, such information is employed to determine the degree of relevance of a document with respect to a given query. specifically, the importance (rank) of each document as determined by the linkages is integrated in each database representative to facilitate the selection of databases for each given query. we establish a necessary and sufficient condition to rank databases optimally, while incorporating the linkage information. a method is provided to estimate the desired quantities stated in the necessary and sufficient condition. the estimation method runs in time linearly proportional to the number of query terms. experimental results are provided to demonstrate the high retrieval effectiveness of the method.  clement yu weiyi meng wensheng wu king- lup liu
an interaction engine for rich hypertexts  in semantically rich hypertexts it is attractive to enable presentation of a network of nodes and link at different levels of abstraction. it is also important that the user can interact with the hypertext using a command repertoire that reflects the chosen abstraction level. based on a characterization of rich hypertext we introduce the concept of an interaction engine that governs the separation between internal hypertext representation and external screen presentation. this separation is the key principle of the hyperpro system. the hyperpro interaction engine is based on simple rules for presentation, interpretation of events, and menu set up. much of the power of the interaction engine framework comes from the organization of these rules relative to the type of hierarchy of nodes and links, and relative to a hierarchy of so-called interaction schemes. the primary application domain discussed in the paper is program development and program documentation.  kasper Østerbye kurt nørmark
communication-efficient distributed mining of association rules  mining for associations between items in large transactional databases is a central problem in the field of knowledge discovery. when the database is partitioned among several share-nothing machines, the problem can be addressed using distributed data mining algorithms. one such algorithm, called cd, was proposed by agrawal and shafer in [1] and was later enhanced by the fdm algorithm of cheung, han et al. [5].  the main problem with these algorithms is that they do not scale well with the number of partitions. they are thus impractical for use in modern distributed environments such as peer-to-peer systems, in which hundreds or thousands of computers may interact. in this paper we present a set of new algorithms that solve the distributed association rule mining problem using far less communication. in addition to being very efficient, the new algorithms are also extremely robust. unlike existing algorithms, they continue to be efficient even when the data is skewed or the partition sizes are imbalanced. we present both experimental and theoretical results concerning the behavior of these algorithms and explain how they can be implemented in different settings.  assaf schuster ran wolff
the effect of vdu text-presentation rate on reading comprehension and reading speed  the effect of video display unit presentation rate on reading performance was investigated. reading material was presented at one of the following presentation-rates: 15, 30, 120, 960 cps, or "instant". in the instant condition, the full text appeared simultaneously on the screen. in the other conditions, text appeared one character at a time starting in the upper left corner of the screen, from left to right and top to bottom. reading comprehension was highest under the 30 cps and instant presentation conditions. total time to perform the reading task was equivalent for all conditions except the 15 cps rate which required a longer time to complete the task. in terms of comprehension and time to perform the task, a slow rate of 15 cps, contrary to previous recommendations, is not desirable for novice computer users.  jo w. tombaugh michael d. arkin richard f. dillion
tpc-d - the challenges, issues and results  this paper covers what we at ncr have learned about the tpc-d benchmark as we executed and published our first set of volume points for the teradata database. areas where customers should read the full disclosure report carefully are pointed out as well as the weaknesses in the benchmark relative to real customer applications. the key execution and optimization elements of the teradata database and the 5100 worldmark platform that contribute to our published results are discussed.  ramesh bhashyam
an experimental vehicle for the user/filing-system interface  achieving maximum benefits from the automation of office functions will require that every member of the office staff use the automated system. as a result, an office information system (ois) must be able to support interaction across a user community with a wide range of characteristics. despite the relative importance of the filing system to an ois, there is little knowledge regarding the best filing system structures for particular classes of users. this is at least partially due to the difficulties of conducting experiments. this paper describes a design for a prototype system to ease experimentation. the system provides for relatively easy changes of both filing system and user interface characteristics, and for transportability among different host systems.  ronald danielson philippe rolander
incremental computation of complex object queries the need for incremental algorithms for evaluating database queries is well known, but constructing algorithms that work on object-oriented databases (oodbs) has been difficult. the reason is that oodb query languages involve complex data types including composite objects and nested collections. as a result, existing algorithms have limitations in that the kinds of database updates are restricted, the operations found in many query languages are not supported, or the algorithms are too complex to be described precisely. we present an incremental computation algorithm that can handle any kind of database updates, can accept any expressions in complex query languages such as oql, and can be described precisely. by translating primitive values and records into collections, we can reduce all query expressions comprehension. this makes the problems with incremental computation less complicated and thus allows us to decribe of two parts: one is to maintain the consistency in each comprehension occurrence and the other is to update the value of an entire expression. the algorithm is so flexible that we can use strict updates, lazy updates, and their combinations. by comparing the performance of applications built with our mechanism and that of equivalent hand written update programs, we show that our incremental algorithm can be iplemented efficiently. hiroaki nakamura
bridging the paper and electronic worlds: the paper user interface  since its invention millenia ago, paper has served as one of our primary communications media. its inherent physical properties make it easy to use, transport, and store, and cheap to manufacture. despite these advantages, paper remains a second class citizen in the electronic world. in this paper, we present a new technology for bridging the paper and the electronic worlds. in this new technology, the user interface moves beyond the workstation and onto paper itself. we describe paper user interface technology and its implementation in a particular system called xax.  walter johnson herbert jellinek leigh klotz ramana rao stuart k. card
crim: curricular resources in interactive multimedia  the crim project addresses the need for curricular guidelines and educational resources for the interactive multimedia area. a digital library / repository allows educators to submit knowledge modules that will be reviewed and made available for use by teachers or students. recommendations are given for courses and topics, and a process is outlined to reach consensus and improve education. this efforts is connected with the computer science teaching center, http://www.cstc.org/.  edward a. fox rachelle s. heller anna long david watkins
architecture of a microcomputer based dss generator  a decision support system (dss) is an interactive computer-based system used to support decision makers in their decision making activities. normally, it is easier and quicker to build such systems using dss generators (software packages) with related hardware.  this paper describes the design and implementation of an experimental microcomputer-based dss generator regimes. the system design is conceptually an extension of sprague's model for organising decision support capabilities. the system is one of the first examples of an integrated dss generator software implemented in basic on a personal computer providing multiple user interfaces, graphics, data base management and modelling capabilities.  k. b. c. saxena d. v. gulati m. kaul
designing and integrating user interfaces of geographic database applications  in this paper, we investigate the problem of designing graphical geographic database user interfaces (gduis) and of integrating them into a database management system (dbms). geographic applications may vary widely but they all have common aspects due to the spatial component of their data: geographic data are not standard and they require appropriate tools for (i) editing them (i.e., display and modify) and (ii) querying them. the conceptual problems encountered in designing gduis are partly due to the merger of two independent fields, geographic dbmss on the one hand, and graphical user interfaces (guis) on the other hand. although these areas have evolved considerably during the past ten years, only little effort has been made to understand the problems of connecting them in order to efficiently manipulate geographic data on a display. this issue raises the general problem of coupling a dbms with specialized modules (in particular, the problem of strong vs. weak integration), and more generally the role of a dbms in a specific application. after giving the functionalities that a gdui should provide, we study the possible conceptual integrations between a gui and a dbms. finally, a map editing model as well as a general and modular gdui architecture are presented.  agnès voisard
computing covers for embedded functional dependencies  this paper deals with the problem of computing covers for the functional dependencies embedded in a subset of a given relation schema. we show how this problem can be simplified and present a new and efficient algorithm "reduction. by resolution" (rbr) for its solution. though the problem of computing covers for embedded dependencies is inherently exponential, our algorithm behaves polynomially for several classes of inputs. rbr can be used for the solution of some related problems in the theory of database design, such as deciding whether a given database scheme is in boyce-codd normal form or decomposing a scheme into boyce-codd normal form.  g. gottlob
piloting electronic mail in today's office environment  this paper is a review of the experiences of the authors with electronic mail and is based upon their use of two different electronic mail systems. the first part of the paper contains a review of the attributes of the commercial systems currently available. the second part of the paper is a review of the use of two different electronic mail systems. user response to the electronic mail systems tested is considered to be the key measurement in system acceptability and utilization. the users' expectations, attitudes and responses to the systems are examined. the final part of the paper is a recommendation of how to introduce a pilot electronic mail system into a technically oriented organization.  bonnie a. callender e. david callender
application of aboutness to functional benchmarking in information retrieval experimental approaches are widely employed to benchmark the performance of an information retrieval (ir) system. measurements in terms of recall and precision are computed as performance indicators. although they are good at assessing the retrieval effectiveness of an ir system, they fail to explore deeper aspects such as its underlying functionality and explain why the system shows such performance. recently, inductive (i.e., theoretical) evaluation of ir systems has been proposed to circumvent the controversies of the experimental methods. several studies have adopted the inductive approach, but they mostly focus on theoretical modeling of ir properties by using some metalogic. in this article, we propose to use inductive evaluation for functional benchmarking of ir models as a complement of the traditional experiment-based performance benchmarking. we define a functional benchmark suite in two stages: the evaluation criteria based on the notion of "aboutness," and the formal evaluation methodology using the criteria. the proposed benchmark has been successfully applied to evaluate various well- known classical and logic-based ir models. the functional benchmarking results allow us to compare and analyze the functionality of the different ir models. kam-fai wong dawei song peter bruza chun-hung cheng
ubiquitous, self-tuning, scalable servers  hardware developments allow wonderful reliability and essentially limitless capabilities in storage, networks, memory, and processing power. costs have dropped dramatically. pcs are becoming ubiquitous.  the features and scalability of dbms software have advanced to the point where most commercial systems can solve virtually all oltp and dss requirements.  the internet and application software packages allow rapid deployment and facilitate a broad range of solutions.  peter spiro
an object-oriented data model for the research laboratory  this paper presents work in-progress on an object-oriented data model for representing the semantics of the research laboratory. the laboratory computing environment (lce) is an application development software tool designed to improve productivity in the implementation of research laboratory computing systems. the core of the lce is an object-oriented database management system. we describe the complex requirements of laboratory application environments and present motivation for using the object-oriented approach.  the lce concept is the result of several years of experience in developing custom laboratory systems. one of the principal difficulties in developing scientific applications is the need to integrate many different software tools in order to represent the numerous abstract data types which are required even in simple applications. an object-oriented data management system, at the outset, appeared most likely to meet the need for tight integration of complex data types.  p. kachhwaha r. hogan
anchored conversations: chatting in the context of a document  this paper describes an application-independent tool called anchored conversations that brings together text-based conversations and documents. the design of anchored conversations is based on our observations of the use of documents and text chats in collaborative settings. we observed that chat spaces support work conversations, but they do not allow the close integration of conversations with work documents that can be seen when people are working together face-to-face. anchored conversations directly addresses this problem by allowing text chats to be anchored into documents. anchored conversations also facilitates document sharing; accepting an invitation to an anchored conversation results in the document being automatically uploaded. in addition, anchored conversations provides support for review, catch-up and asynchronous communications through a database. in this paper we describe motivating fieldwork, the design of anchored conversations, a scenario of use, and some preliminary results from a user study.  elizabeth f. churchill jonathan trevor sara bly les nelson davor cubranic
domino: databases for moving objects tracking  consider a database that represents information about moving objects and their location. for example, for a database representing the location of taxi-cabs a typical query may be: retrieve the free cabs that are currently within 1 mile of 33 n. michigan ave., chicago (to pick-up a customer); or for a trucking company database a typical query may be: retrieve the trucks that are currently within 1 mile of truck abt312 (which needs assistance); or for a database representing the current location of objects in a battlefield a typical query may be: retrieve the friendly helicopters that are in a given region, or, retrieve the friendly helicopters that are expected to enter the region within the next 10 minutes. the queries may originate from the moving objects, or from stationary users. we will refer to applications with the above characteristics as moving-objects-database (mod) applications, and to queries as the ones mentioned above as mod queries.  in the military mod applications arise in the context of the digital battlefield (see [1]), and in the civilian industry they arise in transportation systems. for example, omnitracs developed by qualcomm (see[2]) is a commercial system used by the transportation industry, which enables mod functionality. it provides location management by connecting vehicles (e.g. trucks), via satellites, to company databases. the vehicles are equipped with a global positioning system (gps), and they automatically and periodically report their location.  ouri wolfson prasad sistla bo xu jutai zhou sam chamberlain
hypertext and higher education: a reality check  this panel discussion will examine the extent to which today's hypermedia systems are actually used and usable in higher education instruction and research. the panel will seek to foster dialog between hypermedia systems developers, corpus authors, and faculty users. a series of questions will be addressed by the panel and audience, including:  how are hypermedia corpuses actually used in classes? how well do today's systems meet the exploratory learning goals so often described as being at the heart of the hypermedia movement? what kinds of assignments make sense pedagogically? are there system features which tend to discourage or prevent such uses?  what are the difficulties involved in administering a course using hypertext? are there unusual logistical problems? how does one monitor or manage the annotation and expansion of the corpus during the semester?  are today's hypermedia environments, tools, and practices proving to be useful for the faculty researcher? the student researcher? for faculty considering a hypertext to organize data, is periodic porting to new hardware and software a safe bet? or does the faculty member risk marooning two years of work inside an obsolete system?  what are the prospects for published hypertext corpuses? what system features are likely to affect the economics of publication and distribution? what are the special problems in creating hypertext materials that can be used on other campuses and in other courses?  s. c. erhmann s. erde k. morrell r. f. e. weissman