waashk/acm huggingface dataset:
reasoning on gestural interfaces through syndetic modelling] recent advances in user interface development have been mainly driven by technical innovation, based either on new interaction devices and paradigms, or on algorithms for achieving realistic audio/visual effects [connor92] [robertson91a] [robertson91b] [berners92]. in such a rich environment, the user potentially interacts with the computer by addressing concurrently different modalities. while the technology driven approach has made possible the implementation of systems in specific application areas, it largely misses an undelying theory. this makes it difficult to assess whether this technology will be effective for users with the consequence that cognitive ergonomics is becoming an urgent requirement for the design of new interactive systems. attention has been paid to the psychology of terminal users from the very beginning of human-computer interface research [martin73]. however, existing established design techniques do not readily accomodate issues such as concurrency and parallelism, or the potential for the interaction with multiple interface techniques [coutaz93].recently, works have taken place investigating models and techniques for the analysis and design of interactionally rich systems from a variety of disciplinary perspectives as it can be found in the dsv-is book series edited by [paterno94] and [bastide95]. formal methods have been one of a number of approaches; others include cognitive user models, design space representations, and software architecture models. applications for formal methods are well known, see for example [bowen95], and [gaudel94]. however, none of the cited applications use formal methods to examine the user interface. one reason is that the factors that influence the design of interactive systems depend mostly on psychological and social properties of cognition and work, rather than on abstract mathematical models of programming semantics. for this reason, claims made through formal methods about the properties of interactive systems must be grounded in some psychological or social theory.this paper builds on previous works carried within the esprit amodeus project and shows how a new approach to human-computer interaction, called _syndetic_ modeling, can be used to gain insight into user-oriented properties of interactive systems. the word syndesis comes from the ancient greek and means _conjunction._ it is used to emphasize the key point of this approach: user and system models are described within a common framework that enables one to reason about how cognitive resources are mapped onto the functionality of the system. g. p. faconti
experiences with selecting search engines using metasearch  search engines are among the most useful and high-profile resources on the internet. the problem of finding information on the internet has been replaced with the problem of knowing where search engines are, what they are designed to retrieve, and how to use them. this article describes and evaluates savvysearch, a metasearch engine designed to intelligently select and interface with multiple remote search engines. the primary metasearch issue examined is the importance of carefully selecting and ranking remote search engines for user queries. we studied the efficacy of savvysearch's incrementally acquired metaindex approach to selecting search engines by analyzing the effect of time and experience on performance. we also compared the metaindex approach to the simpler categorical approach and showed how much experience is required to surpass the simple scheme.  daniel dreilinger adele e. howe
the aggregate data problem: a system for their definition and management  in this paper we describe the fundamental components of a database management system for the definition, storage, manipulation and query of aggregate data, i.e. data which are obtained by applying statistical aggregations and statistical analysis functions over raw data. in particular, the attention has been focused on: (1) a data structure for the efficient storage and manipulation of aggregate data, called adas; (2) the graphical structures of the aggregate data model adamo for a more user-friendly definition and query of aggregate data; (3) a graphical user interface which enables a straightforward specification of the adamo structures; (4) a textual declarative query language to retrieve data from the aggregate database, called adquel.  m. rafanelli a. bezenchek l. tininini
extended commitment ordering, or guaranteeing global serializability by applying commitment order selectively to global transactions  the extended commitment ordering (eco) property of transaction histories (schedules) generalizes the commitment ordering (co) property defined in [raz 90]. in a multi resource manager (rm) environment eco guarantees global serializability when supported locally by each rm that participates in global transactions (i.e., transactions that span more than a single rm) and provides local serializability (by any mechanism). eco assumes that a rm has the knowledge to distinguish local transactions (i.e., transactions confined to that rm) from global transactions. eco imposes an order condition, similar to the co condition, on the commit events of global transactions only, and thus, it is less constraining than co.  like co, eco provides a fully distributed solution to the long standing problem of guaranteeing global serializability across rms with different concurrency control mechanisms. also, like co, no communication beyond atomic commitment (ac) protocol messages is required to enforce eco.  when rms are provided with the information about transactions being local, and are coordinated solely via ac protocols (have the extended knowledge autonomy property), eco, applied locally together with local serializability in each rm involved with global transactions, is a necessary condition for guaranteeing global serializability.  eco reduces to co when all the transactions are assumed to be global (e.g. if no knowledge about the transactions being local is available).  yoav raz
implementation of magic-sets in a relational database system  we describe the implementation of the magic-sets transformation in the starburst extensible relational database system. to our knowledge this is the first implementation of the magic-sets transformation in a relational database system. the starburst implementation has many novel features that make our implementation especially interesting to database practitioners (in addition to database researchers). (1) we use a cost-based heuristic for determining join orders (sips) before applying magic. (2) we push all equality and non- equality predicates using magic, replacing traditional predicate pushdown optimizations. (3) we apply magic to full sql with duplicates, aggregation, null values, and subqueries. (4) we integrate magic with other relational optimization techniques. (5) the implementation is extensible.  our implementation demonstrates the feasibility of the magic-sets transformation for commercial relational systems, and provides a mechanism to implement magic as an integral part of a new database system, or as an add-on to an existing database system.  inderpal singh mumick hamid pirahesh
the effects of narrow-band width multipoint videoconferencing on group decision making and turn distribution this study reports an experiment that examines the effects that face-to-face meetings (ff) and two modes of videoconferencing, switching video (sv), which shows only the current speaker, and mixing video (mv), which shows each group member simultaneously, have on turn distribution and the quality of small group decision making. the subjects were 200 undergraduate students and the task was the nasa moon survival problem. multiple comparison tests indicated that mv yielded significantly higher group decision quality than ff. the other pairs, ff-sv and sv-mv, showed no significant differences. with regard to turn taking, there was almost no difference between sv-mv. shinji takao
using domain knowledge in knowledge discovery  with the explosive growth of the size of databases, many knowledge discovery applications deal with large quantities of data. there is an urgent need to develop methodologies which will allow the applications to focus search to a potentially interesting and relevant portion of the data, which can reduce the computational complexity of the knowledge discovery process and improve the interestingness of discovered knowledge. previous work on semantic query optimization, which is an approach to take advantage of domain knowledge for query optimization, has demonstrated that significant cost reduction can be achieved by reformulating a query into a less expensive yet equivalent query which produces the same answer as the original one. in this paper, we introduce a method to utilize three types of domain knowledge in reducing the cost of finding a potentially interesting and relevant portion of the data while improving the quality of discovered knowledge. in addition, we propose a method to select relevant domain knowledge without an exhaustive search of all domain knowledge. the contribution of this paper is that we lay out a general framework for using domain knowledge in the knowledge discovery process effectively by providing guidelines.  suk-chung yoon lawrence j. henschen e. k. park sam makki
an agent-oriented modeling approach this paper proposes an agent-oriented modeling method for the information processing. first of all, it presents an information processing model for real world; then the hierarchical organization of agents and the structure of an agent are given. furthermore, the logical representation of transaction and event are described. finally, an agent-oriented modeling process is put forward. modeling starts from describing the agents that participate in the process; then gathers the other information centered on agents and creates the model. the approach can explicitly present the organized structure of agents and the correlation among transactions, reflect the dynamic process change by describing the state change of the system, illustrate the dynamic character of information process. hong liu g. zeng zongkai lin
personalizing the capture of public experiences  in this paper, we describe our work on developing a system to support the personalization of a captured public experience. specifically, we are interested in providing students with the ability to personalize the capture of the lecture experiences as part of the classroom 2000 project. we discuss the issues and challenges involved in designing a system that performs live integration of personal streams of information with multiple other streams of information made available to it through an environment designed to capture public information.  khai n. truong gregory d. abowd jason a. brotherton
updating derived relations: detecting irrelevant and autonomously computable updates  consider a database containing not only base relations but also stored derived relations (also called materialized or concrete views). when a base relation is updated, it may also be necessary to update some of the derived relations. this paper gives sufficient and necessary conditions for detecting when an update of a base relation cannot affect a derived relation (an irrelevant update), and for detecting when a derived relation can be correctly updated using no data other than the derived relation itself and the given update operation (an autonomously computable update). the class of derived relations considered is restricted to those defined by psj-expressions, that is, any relational algebra expressions constructed from an arbitrary number of project, select and join operations (but containing no self-joins). the class of update operations consists of insertions, deletions, and modifications, where the set of tuples to be deleted or modified is specified by a selection condition on attributes of the relation being updated.  jose a. blakeley neil coburn per-:1vke larson
a desk supporting computer-based interaction with paper documents  before the advent of the personal workstation, office work practice revolved around the paper document. today the electronic medium offers a number of advantages over paper, but it has not eradicated paper from the office. a growing problem for those who work primarily with paper is lack of direct access to the wide variety of interactive functions available on personal workstations. this paper describes a desk with a computer-controlled projector and camera above it. the result is a system that enables people to interact with ordinary paper documents in ways normally possible only with electronic documents on workstation screens. after discussing the motivation for this work, this paper describes the system and two sample applications that can benefit from this style of interaction: a desk calculator and a french to english translation system. we describe the design and implementation of the system, report on some user tests, and conclude with some general reflections on interacting with computers in this way.  william newman pierre wellner
videx: an integrated generic video indexing approach  this paper presents an integrated generic technique for low- and high-level video indexing. the proposed approach tries to integrate the advantages of existing low- and high-level video indexing approaches by reducing their shortcomings. furthermore, the model introduces concepts for a detailed structuring of video streams, and for correlations of low-and high- level video objects. the proposed model is called generic, as it only defines a framework of classes for an implementating a prototype of a distibuted multimedia information system supporting content-based video retrieval.  roland tusch harald kosch lazlo boszormenyi
an efficient scheme for providing high availability  replication at the partition level is a promising approach for increasing availability in a shared nothing architecture. we propose an algorithm for maintaining replicas with little overhead during normal failure-free processing. our mechanism updates the secondary replica in an asynchronous manner: entire dirty pages are sent to the secondary at some time before they are discarded from primary's buffer. a log server node (hardened against failures) maintains the log for each node. if a primary node fails, the secondary fetches the log from the log server, applied it to its replica, and brings itself to the primary's last transaction-consistent state. we study the performance of various policies for sending pages to secondary and the corresponding trade-offs between recovery time and overhead during failure- free processing.  anupam bhide ambuj goyal hui-i hsiao anant jhingran
erp project dynamics and enacted dialogue: perceived understanding, perceived leeway, and the nature of task-related conflicts different views on change and it- related outcomes have been proposed in the literature. most privilege the technological deterministic and organizational imperative positions. this article introduces two types of process views on change arising from designers' inability to forecast the impacts of erp on work and governance:• a dialectical process due to the lack of perceived leeway by the actors, and• a teleological process view, where actors feel they have more leeway and where they try to take advantage of technological effects that they feel they can controlbuilding on the concept of enactment and on the nature of conflicts, this work demonstrates the necessity to articulate these views in a theoretical framework describing the dynamics of erp projects.this framework is employed to interpret problems arising from erp choice and implementation in the french context. during the "chartering phase," the deterministic vision dominates the perceptions of designers. during the "project phase," the designers come closer to the organizational imperative view when they customize the system and make integration/differentiation choices. during the "shakedown" and subsequent phases, organizational outcomes are often not realized because of job and governance conflicts with end users. patrick besson frantz rowe
querying network directories  heirarchically structured directories have recently proliferated with the growth of the internet, and are being used to store not only address books and contact information for people, but also personal profiles, network resource information, and network and service policies. these systems provide a means for managing scale and heterogeneity, while allowing for conceptual unity and autonomy across multiple directory servers in the network, in a way for superior to what conventional relational or object-oriented databases offer. yet, in deployed systems today, much of the data is modeled in an ad hoc manner, and many of the more sophisticated "queries" involve navigational access.  in this paper, we develop the core of a formal data model for network directories, and propose a sequence of efficiently computable query languages with increasing expressive power. the directory data model can naturally represent rich forms of heterogeneity exhibited in the real world. answers to queries expressible in our query languages can exhibit the same kinds of heterogeneity. we present external memory algorithms for the evaluation of queries posed in our directory query languages, and prove the efficiency of each algorithm in terms of its i/o complexity. our data model and query languages share the flexibility and utility of the recent proposals for semi- structured data models, while at the same time effectively addressing the specific needs of network directory applications, which we demonstrate by means of a representative real-life example.  h. v. jagadish laks v. s. lakshmanan tova milo divesh srivastava dimitra vista
a practical query-by-humming system for a large music database  a music retrieval system that accepts hummed tunes as queries is described in this paper. this system uses similarity retrieval because a hummed tune may contain errors. the retrieval result is a list of song names ranked according to the closeness of the match. our ultimate goal is that the correct song should be first on the list. this means that eventually our system's similarity retrieval should allow for only one correct answer.  the most significant improvement our system has over general query-by-humming systems is that all processing of musical information is done based on beats instead of notes. this type of query processing is robust against queries generated from erroneous input. in addition, acoustic information is transcribed and converted into relative intervals and is used for making feature vectors. this increases the resolution of the retrieval system compared with other general systems, which use only pitch direction information.  the database currently holds over 10,000 songs, and the retrieval time is at most one second. this level of performance is mainly achieved through the use of indices for retrieval. in this paper, we also report on the results of music analyses of the songs in the database. based on these results, new technologies for improving retrieval accuracy, such as partial feature vectors and or'ed retrieval among multiple search keys, are proposed. the effectiveness of these technologies is evaluated quantitatively, and it is found that the retrieval accuracy increases by more than 20% compared with the previous system [9]. practical user interfaces for the system are also described.  naoko kosugi yuichi nishihara tetsuo sakata masashi yamamuro kazuhiko kushima
logical design for temporal databases with multiple granularities  the purpose of good database logical design is to eliminate data redundancy and isertion and deletion anomalies. in order to achieve this objective for temporal databases, the notions of temporal types, which formalize time granularities, and temporal functional dependencies (tfds) are intrduced. a temporal type is a monotonic mapping from ticks of time (represented by positive integers) to time sets (represented by subsets of reals) and is used to capture various standard and user-defined calendars. a tfd is a proper extension of the traditional functional dependency and takes the form x -&gt;m&amp;l; t;/f> y, meaning that there is a unique value for y during one tick of the temporal type μ for one particular x value. an axiomatization for tfds is given. because a finite set tfds usually implies an infinite number of tfds, we introduce the notion of and give an axiomatization for a finite closure to effectively capture a finite set of implied tfds that are essential of the logical design. temporal normalization procedures with respect to tfds are given. specifically, temporal boyce-codd normal form (tbcnf) that avoids all data redundancies due to tfds, and temporal third normal form (t3nf) that allows dependency preservation, are defined. both normal forms are proper extensions of their traditional counterparts, bcnf and 3nf. decompositition algorithms are presented that give lossless tbcnf decompositions and lossless, dependency-preserving, t3nf decompositions.  x. sean wang claudio bettini alexander brodsky sushil jajodia
clare - a prolog database machine  the clause retrieval engine (clare) is a coprocessor system which based on two-stage filtering, for handling large sets of disc resident clauses in prolog database applications. the overall architecture and the timing measurements of the first stage clare hardware are reported. the timing measurements shows that the first stage clare hardware can perform search operations on data transferring at a rate up to 4.5 million double bytes per second.  kam-fai wong howard m. williams
active database systems  active database systems support mechanisms that enable them to respond automatically to events that are taking place either inside or outside the database system itself. considerable effort has been directed towards improving understanding of such systems in recent years, and many different proposals have been made and applications suggested. this high level of activity has not yielded a single agreed-upon standard approach to the integration of active functionality with conventional database systems, but has led to improved understanding of active behavior description languages, execution models, and architectures. this survey presents the fundamental characteristics of active database systems, describes a collection of representative systems within a common framework, considers the consequences for implementations of certain design decisions, and discusses tools for developing active applications.  norman w. paton oscar díaz
computer support for distributed collaborative writing: defining parameters of interaction  this paper reports research to define a set of interaction parameters that collaborative writers will find useful. our approach is to provide parameters of interaction and to locate the decision of how to set the parameters with the users. what is new in this paper is the progress we have made outlining task management parameters, notification, scenarios of use, as well as some implementation architectures.  christine m. neuwirth david s. kaufer ravinder chandhok james h. morris