ppxscal/embedding_network huggingface dataset:
Intelligent integration of information
Authors: Gio Wiederhold
Venue: Proceedings of the 1993 ACM SIGMOD international conference on Management of data (1993)

This paper describes and classifies methods to transform data to information in a three-layer, mediated architecture. The layers can be characterized from the top down as information-consuming applications, mediators which perform intelligent integration of information (I3), and data, knowledge and simulation resources. The objective of modules in the I3 architecture is to provide end users' apoplications with information obtained through selection, abstraction, fusion, caching, extrapolation, and pruning of data. The data is obtained from many diverse and heterogeneous sources. The I3 objective requires the establishment of a consensual information system architecture, so that many participants and technologies can contribute. An attempt to provide such a range of services within a single, tightly integrated system is unlikely to survive technological or environmental change. This paper focuses on the computational models needed to support the mediating functions in this architecture and introduces initial applicatiions. The architecture has been motivated in [Wied:92C].
Compiling performance models from parallel programs
Authors: Arjan J. C. van Gemund
Venue: Proceedings of the 8th international conference on Supercomputing (1994)

A technique is described to automatically compile performance models in the course of program translation. The performance models are fully symbolic in order to preserve as much diagnostic information as possible. Although compiled statistically, the models account for the effects of resource contention, due to the introduction of a novel algorithm within the symbolic compilation scheme. It is shown that the compilation approach fundamentally outperforms traditional static estimation procedures in terms of precision at a negligible increase in cost. This claim is illustrated by a case study of an LU factorization algorithm on a multiprocessor.
Layer sharing: an improved structure-sharing framework
Authors: E. Villemonte de la Clergerie
Venue: Proceedings of the 20th ACM SIGPLAN-SIGACT symposium on Principles of programming languages (1993)

We present in this paper a structure&ndash;sharing framework originally developed for a Dynamic Programming interpreter of Logic programs called DyALog. This mechanism should be of interest for alternative execution models of PROLOG which maintain multiple computation branches and reuse sub-computations in various contexts (computation sharing). This category includes, besides our Dynamic Programming model, the tabular models (OLDT, SLDAL, XWAM), the &ldquo;magic-set&rdquo; models, and the independent AND and OR parallelism with solution sharing models. These models raise the problem of storing vast amount of data, motivating us to discard copying mechanisms in favor of structure-sharing mechanisms. Unfortunately, computation sharing requires joining computation branches and possibly renaming some variables, which generally leads to complex structure-sharing mechanisms. The proposed &ldquo;layer-sharing&rdquo; framework succeeds however in remaining understandable and easy to implement.
The evolution of Lisp
Authors: Guy L. Steele,  Jr., Richard P. Gabriel
Venue: The second ACM SIGPLAN conference on History of programming languages (1993)

Lisp is the world's greatest programming language&mdash;or so its proponents think. The structure of Lisp makes it easy to extend the language or even to implement entirely new dialects without starting from scratch. Overall, the evolution of Lisp has been guided more by institutional rivalry, one-upsmanship, and the glee born of technical cleverness that is characteristic of the &ldquo;hacker culture&rdquo; than by sober assessments of technical requirements. Nevertheless this process has eventually produced both an industrial-strength programming language, messy but powerful, and a technically pure dialect, small but powerful, that is suitable for use by programming-language theoreticians. We pick up where McCarthy's paper in the first HOPL conference left off. We trace the development chronologically from the era of the PDP-6, through the heyday of Interlisp and MacLisp, past the ascension and decline of special purpose Lisp machines, to the present era of standardization activities. We then examine the technical evolution of a few representative language features, including both some notable successes and some notable failures, that illuminate design issues that distinguish Lisp from other programming languages. We also discuss the use of Lisp as a laboratory for designing other programming languages. We conclude with some reflections on the forces that have driven the evolution of Lisp.
The birth of Prolog
Authors: Alain Colmerauer
Venue: The second ACM SIGPLAN conference on History of programming languages (1993)

The programming language, Prolog, was born of a project aimed not at producing a programming language but at processing natural languages; in this case, French. The project gave rise to a preliminary version of Prolog at the end of 1971 and a more definitive version at the end of 1972. This article gives the history of this project and describes in detail the preliminary and then the final versions of Prolog. The authors also felt it appropriate to describe the Q-systems since it was a language which played a prominent part in Prolog's genesis.
Eco-problem-solving model (abstract): results of the n-puzzle
Authors: Alexis Drogoul, Christophe Dubreuil
Venue: ACM SIGOIS Bulletin (1992)

Eco-Problem-Solving (EPS) is a new approach to problem solving based on the paradigms of Distributed Artificial Intelligence and founded on interacting agents. We show the way to decomposing the n-puzzle problem into EPS agents, the behaviors with which they are provided and some general mechanisms. Then, we show how simple interactions between agents can lead to the solving of the problem of the edges. We prove that our solving method is guaranteed always to find a solution if there is one. We also prove that the method is more than complete and becomes decidable. Evidence of completeness and decidability are formulated. Finally, we propose some empirical results to show that the EPS implementation of the n-puzzle can effectively solve significantly larger problems than have previously been solvable using traditional heuristic search methods.
The TickerTAIP parallel RAID architecture
Authors: Pei Cao, Swee Boon Lin, Shivakumar Venkataraman, John Wilkes
Venue: ACM Transactions on Computer Systems (TOCS) (1994)

Traditional disk arrays have a centralized architecture, with a single controller through which all requests flow. Such a controller is a single point of failure, and its performance limits the maximum number of disks to which the array can scale. We describe TickerTAIP, a parallel architecture for disk arrays that distributes the controller functions across several loosely coupled processors. The result is better scalability, fault tolerance, and flexibility.This article presents the TickerTAIP architecture and an evaluation of its behavior. We demonstrate the feasibility by a working example, describe a family of distributed algorithms for calculating RAID parity, discuss techniques for establishing request atomicity, sequencing, and recovery, and evaluate the performance of the TickerTAIP design in both absolute terms and by comparison to a centralized RAID implementation. We also analyze the effects of including disk-level request-scheduling algorithms inside the array. We conclude that the Ticker TAIP architectural approach is feasible, useful, and effective.
The V3 video server--managing analog and digital video clips
Authors: Thomas C. Rakow, Peter Muth
Venue: Proceedings of the 1993 ACM SIGMOD international conference on Management of data (1993)

The V3 Video Server is a demonstration showing a multimedia application developed on top of the VODAK database management system. VODAK is a prototype of an object-oriented and distributed database management system (DBMS) developed at GMD-IPSI. The V3 Video Server allows a user to interactively store, retrieve, manipulate, and present analog and short digital video clips. A video clip consists of a sequence of pictures and corresponding sound. Several attributes like author, title, and a set of keywords are annotated. The highlights of the demonstration are as follows. (1) It is shown that an object-oriented database management systems is very useful for the development of multimedia applications. (2) The video server gives valuable hints for the development of an object-oriented database management system in direction to a multimedia database management system.
Quasi-static scoping: sharing variable bindings across multiple lexical scopes
Authors: Shinn-Der Lee, Daniel P. Friedman
Venue: Proceedings of the 20th ACM SIGPLAN-SIGACT symposium on Principles of programming languages (1993)

Static scoping embodies a strong encapsulation mechanism for hiding the details of program units. Yet, it does not allow the sharing of variable bindings (locations) across independent program units. Facilities such as module and object systems that require cross references of variables therefore must be added as special features. In this paper we present an alternative: quasi-static scoping. Quasi-static scoping is more flexible than static scoping, but has the same encapsulation mechanism. The user can control when and in what scope to resolve a quasi-static variable, i.e., to associate it with a variable binding. To demonstrate its versatility, we add quasi-static scoping to Scheme and show how to build the aforementioned facilities at the user-level. We also show that quasi-static scoping can be implemented efficiently.
Optimization of array subscript range checks
Authors: Jonathan M. Asuru
Venue: ACM Letters on Programming Languages and Systems (LOPLAS) (1992)

Compile-time elimination of subscript range checks is performed by some optimizing compilers to reduce the overhead associated with manipulating array data structures. Elimination and propagation, the two methods of subscript range check optimization, are less effective for eliminating global redundancies especially in while-loop structures with nonconstant loop guards. This paper describes a subscript range check optimization procedure that can eliminate more range checks than current methods. Two transformations called inner-loop guard elimination and conservative expression substitution are introduced to enhance propagation of range checks in nested while-loops and to define a partial order on related range checks. Global elimination is improved by considering range checks performed before control reaches a statement and after control leaves a statement. A unique feature of this method is the simplification of the available range-check analysis system for global elimination.
Pattern Recognition and Valiant's Learning Framework
Authors: Lorenza Saitta, Francesco Bergadano
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1993)

The computational learning approach shows that the concept descriptions acquired from examples are approximately correct with a degree of probability that grows with the size of the training sample. The same problem has also been widely investigated in the field of pattern recognition under a variety of problem settings. Some of the results obtained in both fields are surveyed and compared, and the limits of their applicability are analyzed. Moreover, new and tighter bounds for the growth function of some classes of Boolean formulas are presented.
Placement, performance and turnover of information systems professionals: implications for HRIS
Authors: Karen Ketler, Robert D. Smith
Venue: Proceedings of the 1993 conference on Computer personnel research (1993)

The purpose of this paper is to report the results of an empirical study of the placement and performance of 130 information systems professionals in a large utility company. Four distinct job environments were identified: 1) Centralized information systems department with technical focus, 2) Centralized information systems department with a user focus, 3) Decentralized information processing in the user departments with a technical focus, and 4) Decentralized information processing in the user departments with a user focus. The demands of each department were noted, and matched with the personality/education of the personnel. There was remarkable congruency between the demands of the position and the characteristics of the individuals. There was also statistical evidence that this congruency appears to improve performance.
Parallel query processing in shared disk database systems
Authors: Erhard Rahm
Venue: ACM SIGMOD Record (1993)

System developments and research on parallel query processing have concentrated either on &ldquo;Shared Everything&rdquo; or &ldquo;Shared Nothing&rdquo; architectures so far. While there are several commercial DBMS based on the &ldquo;Shared Disk&rdquo; alternative, this architecture has received very little attention with respect to parallel query processing. A comparison between Shared Disk and Shared Nothing reveals many potential benefits for Shared Disk with respect to parallel query processing. In particular, Shared Disk supports more flexible control over the communication overhead for intra-transaction parallelism, and a higher potential for dynamic load balancing and efficient processing of mixed OLTP/query workloads. We also sketch necessary extensions for transaction management (concurrency/coherency control, logging/recovery) to support intra-transaction parallelism in the Shared Disk environment.
An instructed tool for cache coherence protocols
Authors: Jerónimo Nájera, Luis Gómez
Venue: ACM SIGCSE Bulletin (1994)

Several protocols have been proposed in order to solve the cache coherence problem. In all cases, it is very difficult to understand how each algorithm works. The tool ToCCata has been designed and developed to graphically show the dynamic behavior of generic cache coherence algorithms. ToCCata can be used for pedagogical or demonstration purposes.
Specifying the correctness of binding-time analysis
Authors: Mitchell Wand
Venue: Proceedings of the 20th ACM SIGPLAN-SIGACT symposium on Principles of programming languages (1993)

Mogensen has exhibited a very compact partial evaluator for the pure lambda calculus, using binding-time analysis followed by specialization. We give a correctness criterion for this partial evaluator and prove its correctness relative to this specification. We show that the conventional properties of partial evaluators, such as the Futamura projections, are consequences of this specification. By considering both a flow analysis and the transformation it justifies together, this proof suggests a framework for the incorporating flow analyses into verified compilers.
An interactive tutorial system for MC68000 assembly language using HyperCard
Authors: W. A. Coey
Venue: ACM SIGCSE Bulletin (1993)

Assembly language programming of the Motorola MC68000 microprocessor is taught to post-graduate students in the department of Computer Science at Queens University of Belfast in a course entitled "Microcomputer Architecture and Programming". Due to the large number and complexity of the 68000's instructions an interactive tutorial system was developed, using HyperCard and HyperTalk, to enhance existing teaching methods. The system, although aimed at courses teaching MC68000 programming, would be a useful introduction to low level programming theory on courses teaching computer architecture or assembly language programming.
Kernel-control parallel versus data parallel: a technical comparison
Authors: Terrence W. Pratt
Venue: ACM SIGPLAN Notices (1993)

The dusty deck problem is the problem of how to automatically transform large existing serial/vector codes into a form suitable for efficient execution on new parallel architectures. Kernel-control parallel (KCP) methods provide a promising approach to solving the dusty deck problem for MIMD distributed memory machines. This paper is a status report on a project to develop this technology into a full-scale prototype for running large Fortran 77 codes on the Intel iPSC/860. Space limits preclude a full description of the methods. Instead, we sketch the approach and then use a series of questions to explore some of the key differences between this new technology and existing data parallel methods, which are similar but better known.
A path-based method of parallelizing C++ programs
Authors: Genjiang Zhu, Li Xie, Zhongxiu Sun
Venue: ACM SIGPLAN Notices (1994)

This paper presents a path-based method for identifying parallelism in C++ programs and proposes an execution model which trades off the efficiency and parallelism. Based on the path information provided at compiler time or computed at run time, the model reduces the rollbacks while enhances the parallelism.
Information organization using Rufus
Authors: Allen Luniewski, Peter Schwarz, Kurt Shoens, Jim Stamos, John Thomas
Venue: Proceedings of the 1993 ACM SIGMOD international conference on Management of data (1993)

Computer system users today are inundated with a flood of semi-structured information, such as documents, electronic mail, programs, and images. Today, this information is typically stored in filesystems that provide limited support for organizing, searching, and operating upon this data, all operations that are vital to the ability of users to effectively use this data. Database systems provide good function for organizing, searching, managing and writing applications on structured data. Current database systems are inappropriate for semi-structured information because moving the data into the database breaks all existing applications that use the data. The Rufus system attacks the problems of semi-structured information by using database function to help users manage semi-structured information without requiring that the user's information reside in the database.
A Unified Interprocedural Program Representation for a Maintenance Environment
Authors: Mary Jean Harrold, Brian Malloy
Venue: IEEE Transactions on Software Engineering (1993)

Unified interprocedural graph (UIG) that extracts the important features of existing program representations and adds new information to provide an integrated representation for maintenance tasks is presented. Algorithms that were developed for previous representations are adapted to use the UIG by identifying the subset of nodes and edges in the UIG required for that computation. Newly developed algorithms can use the UIG since it contains data flow, control flow, data dependence, and control dependence information. The main benefits of this approach are the reduction in storage space since individual representations are not kept, the savings in maintenance time of a single representation over the individual representations, and the convenience of accessing a single program representation without increase in access time. A single program representation also assists in program understanding since relationships among program elements are incorporated into one graph.
Optimal motion planning for a rod in the plane subject to velocity constraints
Authors: Yui-Bin Chen, Doug Ierardi
Venue: Proceedings of the ninth annual symposium on Computational geometry (1993)

Previous results for finding optimal motions for a rod/ladder concentrated on the path planning problems. In this paper, we focus on the optimal trajectory planning problems and provide an explicit solution to find the shortest time trajectory for an ideal rod in the plane with velocity constraints.
Multimodal human-computer interaction: the second ERCIM workshop, Nancy, France, November 1993
Authors: Noelle Carbonell
Venue: ACM SIGCHI Bulletin (1994)

The European Research Consortium for Informatics and Mathematics (ERCIM) was established in April 1989 as a result of a joint initiative from CWI, GMD and INRIA. The Consortium is dedicated to the advancement of European research and development, in the areas of information technology and applied mathematics, and welcomes national research laboratories from all European countries as members. At present, ERCIM includes 11 national member institutions which are strongly involved in the European Community's R amp;D programmes: AEDIMA (Spain), CWI (the Netherlands), CNR (Italy), FORTH (Greece), GMD (Germany), INRIA (France), INESC (Portugal), RAL (United Kingdom), SICS (Sweden), SINTEF (Norway), VTT (Finland). Through the definition of common scientific goals and strategies, ERCIM member institutes aim to foster collaborative work within the European research community and to increase cooperation with European industry. To further these objectives, the Consortium organizes joint scientific Workshops and Advanced Courses, sponsors a Fellowship Programme for talented young researchers, undertakes joint strategic projects, encourages technology transfer, and promotes international research collaborations and networks. ERCIM publications include workshop proceedings, research and strategic reports, as well as a worldwide distributed quarterly newsletter. The Workshop on Multimodal Human-Computer Interaction that took place at INRIA-Lorraine in November 1993 is one of the numerous scientific events that ERCIM initiated and sponsored in 1993.
Artificial Intelligence in HRM: an experimental study of an expert system
Authors: John J. Lawler, Robin Elliot
Venue: Proceedings of the 1993 conference on Computer personnel research (1993)

This paper reports results of an experimental study of an expert system to aid job evaluation. It focuses on the impact of expert system use on problem-solving accuracy across problems of varying complexity. The results indicate that the program impacted accuracy, though the observed relationships differed what had been hypothesized.
Area optimization of simple polygons
Authors: Sándor P. Fekete, William R. Pulleyblank
Venue: Proceedings of the ninth annual symposium on Computational geometry (1993)

We discuss problems of optimizing the area of a simple polygon for a given set of vertices P and show that these problems are very closely related to problems of optimizing the number of points from a set Q in a simple polygon with vertex set P. We prove that it is NP-complete to find a minimum weight polygon or a maximum weight polygon for a given vertex set, resulting in a proof of NP-completeness for the corresponding area optimization problems. We show that we can find a polygon of more than half the area AR(conv(P)) of the convex hull conv(P) of P, and demonstrate that it is NP-complete to decide whether there is a simple polygon of at least (3/2 + &egr;)AR(conv(P)). Finally, we prove that for 1 &le; k &le; d, 2 &le; d, it is NP-hard to minimize the volume of the k-dimensional faces of a d-dimensional simple non-degenerate polyhedron with a given vertex set, answering a generalization of a question stated by O'Rourke in 1980.
Mutual harmony and temporal continuity: a perspective from the Japanese garden
Venue: ACM SIGCHI Bulletin (1993)

The traditional style of Japanese gardens, which has been elaborated over centuries, can be an inspiration for a highly refined style of human-computer interaction (HCI). It offers an example of an "interface" that provides an elegant way of combining heterogeneous factors.
Computing the discrepancy
Authors: David Dobkin, David Eppstein
Venue: Proceedings of the ninth annual symposium on Computational geometry (1993)

We develop algorithms for computing the discrepancy of point sets in various Euclidean range spaces.