waashk/acm huggingface dataset:
what makes web sites credible?: a report on a large quantitative study  the credibility of web sites is becoming an increasingly important area to understand. to expand knowledge in this domain, we conducted an online study that investigated how different elements of web sites affect people's perception of credibility. over 1400 people participated in this study, both from the u.s. and europe, evaluating 51 different web site elements. the data showed which elements boost and which elements hurt perceptions of web credibility. through analysis we found these elements fell into one of seven factors. in order of impact, the five types of elements that increased credibility perceptions were "real-world feel", "ease of use", "expertise", "trustworthiness", and "tailoring". the two types of elements that hurt credibility were "commercial implications" ;and "amateurism". this large-scale study lays the groundwork for further research into the elements that affect web credibility. the results also suggest implications for designing credible web sites.  b. j. fogg jonathan marshall othman laraki alex osipovich chris varma nicholas fang jyoti paul akshay rangnekar john shon preeti swani marissa treinen
collaborative design with use case scenarios  digital libraries, particularly those with a community-based governanc e structure, are best designed in a collaborative setting. in this paper, we compare our experience using two design methods: a task-centered method that draws upon a group's strength for eliciting and formulating tasks, and a use case method that tends to require a focus on defining an explicit process for tasks. we discuss how these methods did and did not work well in a collaborative setting.  lynne davis melissa dawe
realizing a temporal complex-object data model  support for temporal data continues to be a requirement posed by many applications such as vlsi design and cad, but also in conventional applications like banking and sales. furthermore, the strong demand for complex-object support is known as an inherent fact in design applications, and also emerges for advance "conventional" applications. thus, new advanced database management systems should include both features, i.e. should support temporal complex-objects. in this paper, we present such a temporal complex- object data model. the central notion of our temporal complex-object data model is a time slice, representing one state of a complex object. we explain the mapping of time slices onto the complex objects supported by the mad model (which we use for an example of a non-temporal complex-object data model) as well as the transformation process of operations on temporal complex-objects into mad model operations. thereby, the basic properties of the mad model are a prerequisite for our approach. for example, time slices can only be directly stored, if non-disjunct (i.e. over-lapping) complex objects are easily handled in the underlying complex-object data model.  wolfgang käfer harald schöning
designing and implementing collaborative applications (tutorial session)(abstract only)  goals and content: this tutorial will address the design and implementation of collaborative applications. the design space will be described using the dimensions of session management, coupling, user awareness, and undo/redo.  we will examine tools for building collaborative applications including shared window systems, toolkits, and object-oriented frameworks. then we will examine the implementation space of collaborative applications using the dimensions of layering, replication, distribution, concurrency, collaboration awareness, and algorithms for supporting consistency. at the end of the tutorial, the audience will be able to understand the motivation for collaborative applications, summarize important parts of the collaboration design and implementation space, and identify and compare collaborative architectures and tools.  prasun dewan
collaborative document production using quilt  quilt is a computer-based tool for collaborative document production. it provides annotation, messaging, computer conferencing, and notification facilities to support communication and information sharing among the collaborators on a document. views of a document tailored to individual collaborators or to other of the document's users are provided by quilt based on the user's position in a permission hierarchy that reflects an extensible set of social roles and communication types. this paper illustrates how quilt could be used by collaborators to produce a document.  mary d. p. leland robert s. fish robert e. kraut
defining the ergonomic buzzwords  current software and computer systems are being advertised and sold today as friendly systems that are easy to use. most also claim to be easy to learn as well. but what is it that makes a system friendly, easy to use, or easy to learn? is it sufficient to enshrine a group of interactive features in a video box connected to a single user microcomputer? if a system is easy to use does that make it friendly? or does easy to learn mean that it is easy to use? does your friendly, easy-going personal computer salesman differentiate between these terms!  although the physical aspects of human factors have been studied for several decades and have an established scientific base, there is very little published material on the software aspects of ergonomics that is based upon well controlled experimental investigation. however, there is a fair amount of literature in which individuals describe their experiences in various ad hoc situations. the similarities among these experiences has resulted in a fair amount of "folklore" which may be beneficially applied. the terms: easy to learn, easy to use, and friendly are defined below according to this experiential base.  jon a. meads
collaborative wearable systems research and evaluation (video program)(abstract only)  an interdisciplimary research group at carnegie mellon university (cmu) is investigating the design and usefulness of mobile cscw systems for the support of distributed diagnosis, repair, and redesign of large vehicles, such as aircraft and trains. these systems incorporate diagnostic aids, on-line maintenance manuals, schematic drawings, and telecommunications that allow workers to access both stored information and interactive help from remote experts. this videotape illustrates the problem area and some wearable computer prototypes. it describes some of the field work we have done documenting the value of collaboration when workers are diagnosing and repairing complex equipment. our laboratory experiments investigate whether wireless video capabilities are useful. one prototype incorporates both shared computer-based information (an on-line repair manual) and a shared view of the non-computerized work space (a video feed from a head-mounted camera). experiments so far show that commumication with a remote expert improves the speed and quality of repairs, but that shared video does not. video does, however, affect how collaborators coordinate their behavior, for example by allowing a pair to be less verbally explicit. the videotape illustrates how a collaborative pair can exploit both shared data sources to communicate more effectively.  jane siegel robert e. kraut mark d. miller david j. kaplan malcolm bauer
building a distributed full-text index for the web we identify crucial design issues in building a distributed inverted index for a large collection of web pages. we introduce a novel pipelining technique for structuring the core index-building system that substantially reduces the index construction time. we also propose a storage scheme for creating and managing inverted files using an embedded database system. we suggest and compare different strategies for collecting global statistics from distributed inverted indexes. finally, we present performance results from experiments on a testbed distributed web indexing system that we have implemented.
people-oriented computer systems, revisited(acm 82 panel session)  this panel will look at the importance of the interaction process and the user interface in the design, development and use of computer systems. it is a follow-up to a panel session titled "people-oriented computer systems; when, and how?" which was presented at acm 78 [1]. the panelists will look at questions raised in 1978 and review what has been done in the intervening four years. and they will look at one of the most important happenings of the past four years --- the widespread introduction of the personal computer into the office, the lab, and the schools, and how it has affected the design of all computer systems, small and large. new computers, new users, new ways of designing computer systems for people?  lorraine borman
finding usability problems through heuristic evaluation  usability specialists were better than non-specialists at performing heuristic evaluation, and "double experts" with specific expertise in the kind of interface being evaluated performed even better. major usability problems have a higher probability than minor problems of being found in a heuristic evaluation, but more minor problems are found in absolute numbers. usability heuristics relating to exits and user errors were more difficult to apply than the rest, and additional measures should be taken to find problems relating to these heuristics. usability problems that relate to missing interface elements that ought to be introduced were more difficult to find by heuristic evaluation in interfaces implemented as paper prototypes but were as easy as other problems to find in running systems.  jakob nielsen
automatic text representation, classification and labeling in european law  the huge text archives and retrieval systems of legal information have not achieved yet the representation in the well-known subject-oriented structure of legal commentaries. content-based classification and text analysis remains a high priority research topic. in the joint konterm, som and labelsom projects, learning techniques of neural networks are used to achieve similar high compression rates of classification and analysis like in manual legal indexing. the produced maps of legal text corpora cluster related documents in units that are described with automatically selected descriptors. extensive tests with text corpora in european case law have shown the feasibility of this approach. classification and labeling proved very helpful for legal research. the _growing hierarchical self-organizing map_ represents very interesting generalities and specialties of legal text corpora. the segmentation into document parts improved very much the quality of labeling. the next challenge would be a change from _tf_ × _idf_ vector representation to a modified vector representation taking into account thesauri or ontologies considering learned properties of legal text corpora.  erich schweighofer andreas rauber michael dittenbach
prefer: a system for the efficient execution of multi-parametric ranked queries  users often need to optimize the selection of objects by appropriately weighting the importance of multiple object attributes. such optimization problems appear often in operations' research and applied mathematics as well as everyday life; e.g., a buyer may select a home as a weighted function of a number of attributes like its distance from office, its price, its area, etc.  we capture such queries in our definition of preference queries that use a weight function over a relation's attributes to derive a score for each tuple. database systems cannot efficiently produce the top results of a preference query because they need to evaluate the weight function over all tuples of the relation. prefer answers preference queries efficiently by using materialized views that have been pre- processed and stored.  we first show how the result of a preference query can be produced in a pipelined fashion using a materialized view. then we show that excellent performance can be delivered given a reasonable number of materialized views and we provide an algorithm that selects a number of views to precompute and materialize given space constraints.  we have implemented the algorithms proposed in this paper in a prototype system called prefer, which operates on top of a commercial database management system. we present the results of a performance comparison, comparing our algorithms with prior approaches using synthetic datasets. our results indicate that the proposed algorithms are superior in performance compared to other approaches, both in preprocessing (preparation of materialized views) as well as execution time.  vagelis hristidis nick koudas yannis papakonstantinou
quality of service transferred to information retrieval: the adaptive information retrieval system  users often quit an information retrieval system (ir system) very frustrated, because they cannot find the information matching their information needs. we have identified the following two main reasons: too high expectations and wrong use of the system. our approach which addresses both issues is based on the transfer of the concept of quality of service to ir systems: the user first negotiates the retrieval success rates with the ir system, so he knows what to expect from the system in advance. second, by dynamic adaptation to the retrieval context, the ir system tries to improve the user's queries and thereby tries to exploit the underlying information source as best as possible.  claudia rolker ralf kramer
stepwise specification of dynamic database behaviour  this paper presents a methodology for the stepwise specification of dynamic database behaviour. a conceptual schema is described in three levels: data, objects and transactions. to determine which sequences of database states are "admissible", integrity constraints on objects are given in temporal logic. transactions are specified by pre/postconditions to produce "executable" state sequences. in order to guarantee that executable state sequences already become admissible, integrity constraints are completely transformed into additional pre/postconditions. we introduce general rules for these transformations. thus, schema specifications can be refined and simplified systematically.  udo w. lipeck
a graphical model of procedures for an automated manager's assistant  a model of office procedures based upon directed graphs is introduced. this model is being used as a basis for work on an office assistant which integrates office procedures performed by individuals and by the assistant. it also provides a framework for an interface to an on-line database system. this paper introduces the basic features of the model, including a set of primitive actions which determine the semantics for the office procedures within the model.  michael bauer sylvia osborn
multi-level recovery  multi-level transactions have received considerable attention as a framework for high-performance concurrency control methods. an inherent property of multi-level transactions is the need for compensating actions, since state- based recovery methods do no longer work correctly for transaction undo. the resulting requirement of operation logging adds to the complexity of crash recovery. in addition, multi-level recovery algorithms have to take into account that high-level actions are not necessarily atomic, e.g., if multiple pages are updated in a single action.  in this paper, we present a recovery algorithm for multi-level transactions. unlike typical commercial database systems, we have striven for simplicity rather than employing special tricks. it is important to note, though, that simplicity is not achieved at the expense of performance. we show how a high- performance multi-level recovery algorithm can be systematically developed based on few fundamental principles. the presented algorithm has been implemented in the dasdbs database kernel system.  gerhard weikum christof hasse peter broessler peter muth
efficient concurrency control in multidimensional access methods  the importance of multidimensional index structures to numerous emerging database applications is well established. however, before these index structures can be supported as access methods (ams) in a "commercial- strength" database management system (dbms), efficient techniques to provide transactional access to data via the index structure must be developed. concurrent accesses to data via index structures introduce the problem of protecting ranges specified in the retrieval from phantom insertions and deletions (the phantom problem). this paper presents a dynamic granular locking approach to phantom protection in generalized search trees(gists), an index structure supporting an extensible set of queries and data types. the granular locking technique offers a high degree of concurrency and has a low lock overhead. our experiments show that the granular locking technique (1) scales well under various system loads and (2) similar to the b-tree case, provides a significantly more efficient implementation compared to predicate locking for multidimensional ams as well. since a wide variety of multidimensional index structures can be implemented using gist, the developed algorithms provide a general solution to concurrency control in multidimensional ams. to the best of our knowledge, this paper provides the first such solution based on granular locking.  kaushik chakrabarti sharad mehrotra
serializability with constraints  this paper deals with the serializability theory for single-version and multiversion database systems. we first introduce the concept of disjoint- interval topological sort (dits, for short) of an arc- labeled directed acyclic graph. it is shown that a history is serializable if and only if its transaction io graph has a dits. we then define several subclasses of serializable histories, based on the constraints imposed by write-write, write-read, read-write, or read-read conflicts, and investigate inclusion relationships among them. in terms of dits, we give a sufficient condition for a class of serializable histories to be polynomially recognizable, which is then used to show that a new class of histories, named wrw, can be recognized in polynomial time. we also present np-completeness results for the problem of testing membership in some other classes.  in the second half of this paper, we extend these results to multiversion database systems. the inclusion relationships among multiversion classes defined by constraints, such as write-write and write- read, are investigated. one such class coincides with class dmvsr, introduced by papadimitriou and kanellakis, and gives a simple characterization of this class. it is shown that for most constraints, multiversion classes properly contain the corresponding single-version classes. complexity results for the membership testing are also discussed.  toshihide ibaraki tiko kameda toshimi minoura
issues and approaches for migration/cohabitation between legacy and new systems  corporate subject data bases (csdb) are being introduced to reduce data redundancy, maintain the integrity of the data, provide a uniform data access interface, and have data readily available to make business decisions. during the transition phase, there is a need to maintain legacy systems (ls), csdb, and to synchronize between them. choosing the right granularity for migration of data and functionality is essential to the success of the migration strategy. technologies being used to support the transition to csdb include relational systems supporting stored procedures, remote procedures, expert systems, object-oriented approach, reengineering tools, and data transition tools. for our customer csdb to be deployed in 1993, cleanup of data occurs during initial load of the csdb. nightly updates are needed during the transition phase to account for operations executed through ls. there is a lack of an integrated set of tools to help in the transition phase.  rodolphe nassif don mitchusson
office automation and the management of change  a period of change in an organization puts our management talents and skills to a true test. when the change is the introduction of new technology or equipment into an existing operation, we need to pay special attention to the way in which we manage the introduction, implementation, training, and feedback of the new system, to ensure that the staff is motivated and informed, positive and cooperative. this paper describes the introduction of information processing systems into the operation of an organization and the special management skills that were brought to bear in introducing and implementing the new technology successfully.  of all the things we at xerox computer services learned during the implementation of information processing systems throughout the company, three words stand out: effective management, and communications. these are the critical elements in the introduction of new systems and procedures, and, if used properly, they can lead to a slow, smooth, well-thought-out, and exciting new operation in technology.  ann w. luke
an automated office communications study in an operational setting  in recent years there has been a proliferation of electronic office products developed under the umbrella label of "office of the future". the justification for office automation has been the promise of increased office productivity and significant cost-benefits to the user. in most cases these systems have been driven by the rapid evolution of technological advances in the computer industry. as a result, these technologically leading edge solutions often must then search for a set of office problems to solve.  the present study evolved out of the identification of one such set of office problems. office communications have increasingly been identified as a major source of inefficiency and frustration.  the purpose of the present study was to investigate ways of solving the variety of problems associated with the use of the telephone. the telephone has been labelled as probably the most intrusive device on work flow in the office (bair, farber, & uhlig, 1980). typically office principals, particularly those without a personal secretary, don't have any means of screening themselves from telephone interruptions. unsuccessful attempts to call someone are another source of inefficiency.  randall r. harris
an information-theoretic approach to automatic query expansion  techniques for automatic query expansion from top retrieved documents have shown promise for improving retrieval effectiveness on large collections; however, they often rely on an empirical ground, and there is a shortage of cross-system comparisons. using ideas from information theory, we present a computationally simple and theoretically justified method for assigning scores to candidate expansion terms. such scores are used to select and weight expansion terms within rocchio's framework for query reweigthing. we compare ranking with information-theoretic query expansion versus ranking with other query expansion techniques, showing that the former achieves better retrieval effectiveness on several performance measures. we also discuss the effect on retrieval effectiveness of the main parameters involved in automatic query expansion, such as data sparseness, query difficulty, number of selected documents, and number of selected terms, pointing out interesting relationships.  claudio carpineto renato de mori giovanni romano brigitte bigi