waashk/acm huggingface dataset:
selected papers from the sixth international conference on information systems  there are a number of alternative tools and methods for building and designing information systems for organizational use. each tool or design alternative has its advocates. benefits and advantages are proposed or claimed; little empirical evidence is presented.  the two selected papers from the 1985 international conference on information systems (indianapolis, december 15-18) present empirical laboratory experiments to provide evidence as to tools and design alternatives. the first paper by dickson, desanctis, and mcbride describes three experiments to compare traditional tabular presentation with graphic presentation. the experiments are designed to build cumulative research results around the issue of the task the reader of the information is to perform upon receiving the information. the second paper by vessey and weber provides experimental evidence comparing methods for documenting a problem: decision tree, decision table, and structured english. the three methods are frequently presented as alternatives; the experiments compare them.  two studies do not settle an issue as complex as comparison of alternative tools and methods: they begin to provide the evidence needed. they also illustrate one well- established research approach---the laboratory experiment. the advantage of laboratory experiments is the control that can be obtained; field studies and experience of practitioners can be understood more fully in the context of such laboratory results.  gordon b. davis
a dynamic framework for object projection views  user views in a relational database obtained through a single projection ("projection views") are considered in a new framework. specifically, such views, where each tuple in the view represents an object ("object-projection views"), are studied using the dynamic relational model, which captures the evolution of the database through consecutive updates. attribute sets that yield object- projection views are characterized using the static and dynamic functional dependencies satisfied by the database. object-projection views are then described using the static and dynamic functional dependencies "inherited" from the original database. finally, the impact of dynamic constraints on the view update problem is studied in a limited context. this paper demonstrates that new, useful information about views can be obtained by looking at the evolution of the database as captured by the dynamic relational model.  victor vianu
teaching software psychology experimentation through team projects  this paper describes an undergraduate human factors course which emphasizes psychologically oriented experimentation on the human use of computers. the reductionist principles of the scientific method are emphasized throughout the course: lucid statement of testable hypotheses, alteration of independent variables, measurement of dependent variables, selection and assignment of subjects, control for biasing, and statistical testing. term- length team projects are highly motivating for students and have led to worthwhile research contributions.  ben shneiderman
schema analysis for database restructuring  the problem of generalized restructuring of databases has been addressed with two limitations: first, it is assumed that the restructuring user is able to describe the source and target databases in terms of the implicit data model of a particular methodology; second, the restructuring user is faced with the task of judging the scope and applicability of the defined types of restructuring to his database implementation and then of actually specifying his restructuring needs by translating them into the restructuring operations on a foreign data model. a certain amount of analysis of the logical and physical structure of databases must be performed, and the basic ingredients for such an analysis are developed here. the distinction between hierarchical and nonhierarchical data relationships is discussed, and a classification for database schemata is proposed. examples are given to illustrate how these schemata arise in the conventional hierarchical and network systems. application of the schema analysis methodology to restructuring specification is also discussed. an example is presented to illustrate the different implications of restructuring three seemingly identical database structures.  shamkant b. navathe
gesturecam (video program) (abstract only): a video communication system to support spatial workspace collaboration  in this paper, the collaboration in the real three-dimensional environment is defined as spatial workspace collaboration, and an experimental system, gesturecam, is presented which supports spatial workspace collaboration via a video-mediated communication. the gesturecam system has an ability to look around a remote site, an ability of remote pointing, and an ability to support gaze awareness, all of which are the essential system requirements for spatial workspace collaboration. the gesturecam consists of an actuator with three degrees of freedom and a video camera mounted on the actuator. the actuators can be controlled by a master-slave method, by a touch-sensitive crt, or by a gyro sensor. also, a laser pointer is mounted on an actuator to assist remote pointing. the experiments with human subjects are also shown in the video.  hideaki kuzuoka gen ishimoda yushi nishimura yoshihiro nakada
demonstration of hierarchical document clustering of digital library retrieval results  as digital libraries grow in size, querying their contents will become as frustrating as querying the web is now. one remedy is to hierarchically cluster the results that are returned by searching a digital library. we demonstrate the clustering of search results from carnegie mellons informedia database, a large video library that supports indexing and retrieval with automatically generated descriptors.  c. r. palmer j. pesenti r. e. valdes-perez m. g. christel a. g. hauptmann d. ng h. d. wactlar
ready for prime time: pre-generation of web pages in tiscover  in large data- and access-intensive web sites, efficient and reliable access is hard to achieve. this situation gets even worse for web sites providing precise structured query facilities and requiring topicality of the presented information even in face of a highly dynamic content. the achievement of these partly conflicting goals is strongly influenced by the approach chosen for page generation, ranging from composing a web page upon a user's request to its generation in advance. the official austrian web-based tourism information and booking system tiscover tries to reconcile these goals by employing a hybrid approach of page generation. in tiscover, web pages are not only generated on request in order to support precise structured queries on the content managed by a database system. rather, the whole web site is also pre- generated out of the extremely dynamic content and synchronized with the database on the basis of metadata. thus, topicality of information is guaranteed, while ensuring efficient and reliable access. this paper discusses the hybrid approach as realized in tiscover, focussing in particular on the concepts used for pre-generation.1  birgit pröll heinrich starck werner retschitzegger harald sighart
tree queries: a simple class of relational queries  one can partition the class of relational database schemas into tree schemas and cyclic schemas. (these are called acyclic hypergraphs and cyclic hypergraphs elsewhere in the literature.) this partition has interesting implications in query processing, dependency theory, and graph theory.  the tree/cyclic partitioning of database schemas originated with a similar partition of equijoin queries. given an arbitrary equijoin query one can obtain an equivalent query that calculates the natural join of all relations in (an efficiently) derived database; such a query is called a natural join (nj) query. if the derived database is a tree schema the original query is said to be a tree query, and otherwise a cyclic query.  in this paper we analyze query processing consequences of the tree/cyclic partitioning. we are able to argue, qualitatively, that queries which imply a tree schema are easier to process than those implying a cyclic schema. our results also extend the study of the semijoin operator.  nathan goodman oded shmueli
an algorithm for concurrency control and recovery in replicated distributed databases  in a one-copy distributed database, each data item is stored at exactly one site. in a replicated database, some data items may be stored at multiple sites. the main motivation is improved reliability: by storing important data at multiple sites, the dbs can operate even though some sites have failed.  this paper describes an algorithm for handling replicated data, which allows users to operate on data so long as one copy is "available." a copy is "available" when (i) its site is up, and (ii) the copy is not out-of-date because of an earlier crash.  the algorithm handles clean, detectable site failures, but not byzantine failures or network partitions.  philip a. bernstein nathan goodman
decompositions and functional dependencies in relations  a general study is made of two basic integrity constraints on relations: functional and multivalued dependencies. the latter are studied via an equivalent concept: decompositions. a model is constructed for any possible combination of functional dependencies and decompositions. the model embodies some decompositions as unions of relations having different schemata of functional dependencies. this suggests a new, stronger integrity constraint, the degenerate decomposition. more generally, the theory demonstrates the importance of using the union operation in database design and of allowing different schemata on the operands of a union. techniques based on the union lead to a method for solving the problem of membership of a decomposition in the closure of a given set of functional dependencies and decompositions. the concept of antiroot is introduced as a tool for describing families of decompositions, and its fundamental importance for database design is indicated.  w. w. armstrong c. deobel
automatic chunk detection in human-computer interaction  this paper describes an algorithm to detect user's mental chunks by analysis of pause lengths in goal-directed human-computer interaction. identifying and characterizing users' chunks can help in gauging the users' level of expertise. the algorithm described in this paper works with information collected by an automatic logging mechanism. therefore, it is applicable to situations in which no human intervention is required to perform the analysis, such as adaptive interfaces. an empirical study was conducted to validate the algorithm, showing that mental chunks and their characteristics can indeed be inferred from analysis of human-computer interaction logs. users performing a variety of goal-directed tasks were monitored. using an automated logging tool, every command invoked, every operation performed with the input devices, as well as all system responses were recorded. analysis of the interaction logs was performed by a program that implements a chunk detection algorithm that looks at command sequences and timings. the results support the hypothesis that a significant number of user mental chunks can be detected by our algorithm.  paulo j. santos albert n. badre
using latent semantic indexing for information filtering  latent semantic indexing (lsi) is an information retrieval method that organizes information into a semantic structure that takes advantage of some of the implicit higher-order associations of words with text objects. the resulting structure reflects the major associative patterns in the data while ignoring some of the smaller variations that may be due to idiosyncrasies in the word usage of individual documents. this permits retrieval based on the "latent" semantic content of the documents rather than just on keyword matches. this paper evaluates using lsi for filtering information such as netnews articles based on a model of user preferences for articles. users judged articles on how interesting they were and based on these judgements, lsi predicted whether new articles would be judged interesting. lsi improved prediction performance over keyword matching an average of 13% and showed a 26% improvement in precision over presenting articles in the order received. the results indicate that user preferences for articles tend to cluster based on the semantic similarities between articles.  p. w. foltz
a concurrency control theory for nested transactions (preliminary report)  concurrency control is the activity of synchronizing transactions that access shared data. a concurrency control algorithm is regarded as correct if it ensures that any interleaved execution of transactions is equivalent to a serial one. such executions are called serializable. serializability theory provides a method for modelling and analyzing the correctness of concurrency control algorithms [bsw, pa].  the concept of nested transaction has recently received much attention [gr], [mo]. in a nested transaction model, each transaction can invoke sub- transactions, which can invoke sub- subtransactions, and so on. the natural modelling concept is the tree log. the leaves of a tree log are atomic operations executed by the underlying system. internal nodes are operations (as seen by their parents) implemented as transactions (as seen by their children). nodes are related by a partial order <, where x c. beeri p. a. bernstein n. goodman m. y. lai d. e. shasha
parallelism in relational data base systems: architectural issues and design approaches  with current systems, some important complex queries may take days to complete because of: (1) the volume of data to be processed, (2) limited aggregate resources. introducing parallelism addresses the first problem. cheaper, but powerful computing resources solve the second problem. according to a survey by brodie,1 only 10% of computerized data is in data bases. this is an argument for both more variety and volume of data to be moved into data base systems. we conjecture that the primary reasons for this low percentage are that data base management systems (dbmss) still need to provide far greater functionality and improved performance compared to a combination of application programs and file systems. this paper addresses the issues and solutions relating to intraquery parallelism in a relational dbms supporting sql. instead of focussing only on a few algorithms for a subset of the problems, we provide a broad framework for the study of the numerous issues that need to be addressed in supporting parallelism efficiently and flexibly. we also discuss the impact that parallelization of complex queries has on short transactions which have stringent response time constraints. the pros and cons of the shared nothing, shared disks and shared everything architectures for parallelism are enumerated. the impact of parallelism on a number of components of an industrial-strength dbms are pointed out. the different stages of query processing during which parallelism may be gainfully employed are identified. the interactions between parallelism and the traditional systems' pipelining technique are analyzed. finally, the performance implications of parallelizing a specific complex query are studied. this gives us a range of sample points for different parameters of a parallel system architecture, namely, i/o and communication bandwidth as a function of aggregate mips.  hamid pirahesh c. mohan josephine cheng t. s. liu pat selinger
a visual calendar for scheduling group meetings  scheduling group meetings requires access to participants' calendars, typically located in scattered pockets or desks. placing participants' calendars on-line and using a rule-based scheduler to find a time slot would alleviate the problem to some extent, but it often is difficult to trust the results, because correct scheduling rules are elusive, varying with the participants and the agenda of a particular meeting. what's needed is a comprehensive scheduling system that summarizes the available information for quick, flexible, and reliable scheduling. we have developed a prototype of a priority-based, graphical scheduling system called visual scheduler (vs).  a controlled experiment comparing automatic scheduling with vs to manual scheduling demonstrated the former to be faster and less error prone. a field study conducted over six weeks at the unc-ch computer science department showed vs to be a generally useful system and provided valuable feedback on ways to enhance the functionality of the system to increase its value as a groupwork tool. in particular, users found priority-based time-slots and access to scheduling decision reasoning advantageous. vs has been in use by more than 75 faculty, staff, and graduate students since fall 1987.  david beard murugappan palaniappan alan humm david banks anil nair yen-ping shan
jotmail: a voicemail interface that enables you to see what was said  voicemail is a pervasive, but under-researched tool for workplace communication. despite potential advantages of voicemail over email, current phone-based voicemail uis are highly problematic for users. we present a novel, web-based, voicemail interface, jotmail. the design was based on data from several studies of voicemail tasks and user strategies. the gui has two main elements: (a) _personal annotations_ that serve as a visual analogue to underlying speech; (b) automatically derived message header information. we evaluated jotmail in an 8-week field trial, where people used it as their only means for accessing voicemail. jotmail was successful in supporting most key voicemail tasks, although users' electronic annotation and archiving behaviors were different from our initial predictions. our results argue for the utility of a combination of annotation based indexing and automatically derived information, as a general technique for accessing speech archives.  steve whittaker richard davis julia hirschberg urs muller
performance evaluation of functional disk system with nonuniform data distribution  in this paper, we analyze the performance of a functional disk system with relational database engine (fds-rii) for a nonuniform data distribution. fds- rii is a relational storage system, designed to accelerate relational algebraic operations, which employs a hash-based algorithm to process relational operations. basically, in the hash-based algorithm, a relation is first partitioned into several clusters by a split function. then each cluster is staged onto the main memory and, further, a hash function is applied to each cluster to perform a relational operation. thus, the nonuniformity of split and hash functions is considered to be resulting from a nonuniform data distribution on the hash-based algorithm. we clarify the effect of nonuniformity of the hash and split functions on the join performance. it is possible to attenuate the effect of the hash function nonuniformity by increasing the number of processors and processing the buckets in parallel. furthermore, in order to tackle the nonuniformity of split function, we introduce the combined hash algorithm. this algorithm combines the grace hash algorithm with the nested loop algorithm in order to handle the overflown bucket efficiently. using the combined hash algorithm, we find that the execution time of the nonuniform data distribution is almost equal to that of the uniform data distribution. thus we can get sufficiently high performance on fds-rii also for nonuniformly distributed data.  masaru kitsuregawa miyuki nakano lilian harada mikio takagi
pricing considerations in video-on-demand systems (poster session)  video-on-demand (vod) has been an active area of research for the past few years in the multimedia research community. however, there have not been many significant commercial deployments of vod owing to the inadequacy of _per user_ bandwidth and the lack of a good business model.1 significant research efforts have been directed towards reduction of network bandwidth requirements, improvement of server utilization, and minimization of start-up latency. in this paper, we investigate another aspect of vod systems which has been largely neglected by the research community, namely, pricing models for vod systems. we believe that the price charged to a user for an on-demand video stream should influence the rate of user arrivals into the vod system and in turn should depend upon quality-of-service (qos) factors such as initial start-up latency. we briefly describe some simple pricing models and analyze the tradeoffs involved in such scenarios from a profit maximization point of view. we further explore secondary content insertion (ad-insertion) which was proposed elsewhere [1] not only as a technique for reducing the resource requirements at the server and the network, but also as a means of subsidizing vod content to the end user. we treat the rate of ad insertion as another qos factor and demonstrate how it can influence the price of movie delivery.  prithwish basu thomas d. c. little
computing for users with special needs and models of computer-human interaction  models of human-computer interaction (hci) can provide a degree of theoretical unity for diverse work in computing for users with special needs. example adaptations for special users are described in the context of both implementation-oriented and linguistic models of hci. it is suggested that the language of hci be used to define standards for special adaptations. this would enhance reusability, modifiability, and compatibility of adaptations, inspire new innovations, and make it easier for developers of standard interfaces to incorporate adaptations. the creation of user models for subgroups of users with special needs would support semantic and conceptual adaptations.  william w. mcmillan
a history and evaluation of system r  system r, an experimental database system, was constructed to demonstrate that the usability advantages of the relational data model can be realized in a system with the complete function and high performance required for everyday production use. this paper describes the three principal phases of the system r project and discusses some of the lessons learned from system r about the design of relational systems and database systems in general.  donald d. chamberlin morton m. astrahan michael w. blasgen james n. gray w. frank king bruce g. lindsay raymond lorie james w. mehl thomas g. price franco putzolu patricia griffiths selinger mario schkolnick donald r. slutz irving l. traiger
cscw, groupware and workflow (tutorial session)(abstract only): experiences, state of art and future trends  goals and content: this tutorial draws on the experiences of the participants and instructors with groupware and workflow technologies, and with cscw issues and methods, to construct an informed picture of what is happening and possible.  to lectures and video-taped illustrations of commercial systems and research prototypes we have added structured subgroup activity by participants. we cover the multi-disciplinary nature of cscw; emerging groupware products and research that support communication, collaboration, and coordination; and behavioral, social, and organizational challenges to developing, acquiring, or using these technologies, and approaches that can lead to success.  steven e. poltrock jonathan grudin