ppxscal/embedding_network huggingface dataset:
A language for shading and lighting calculations
Authors: Pat Hanrahan, Jim Lawson
Venue: ACM SIGGRAPH Computer Graphics (1990)

A shading language provides a means to extend the shading and lighting formulae used by a rendering system. This paper discusses the design of a new shading language based on previous work of Cook and Perlin. This language has various types of shaders for light sources and surface reflectances, point and color data types, control flow constructs that support the casting of outgoing and the integration of incident light, a clearly specified interface to the rendering system using global state variables, and a host of useful built-in functions. The design issues and their impact on the implementation are also discussed.
Asynchronous communication on Occam
Authors: N. B. Serbedzija
Venue: ACM SIGPLAN Notices (1988)

In this paper primitives for asynchronous process communication are defined and added to the programming language Occam. Most of the existing concurrent programming concepts have synchronization mechanisms built-in the communication primitives degrading process independency and restricting the parallelism they are trying to provide. Asynchronous process communication provides more freedom in programming concurrent systems allowing non-blocking semantics for both send and receive primitives. Messages are buffered and a number of operations over buffered but not yet received messages are defined, allowing programmer to set or dynamically change the communication discipline needed for the particular application. The goal of the work presented is to relax strict process communication discipline and to make Occam more convenient for expressing concurrency needed for real-time applications. Although Occam is based on the synchronous communication model, its low level facilities provide a possibility to create the semantics of concurrency completely different from the one initially offered.
Universal one-way hash functions and their cryptographic applications
Authors: M. Naor, M. Yung
Venue: Proceedings of the twenty-first annual ACM symposium on Theory of computing (1989)

We define a Universal One-Way Hash Function family, a new primitive which enables the compression of elements in the function domain. The main property of this primitive is that given an element x. We prove constructively that universal one-way hash functions exist if any 1-1 one-way functions exist. Among the various applications of the primitive is a One-Way based Secure Digital Signature Scheme, a system which is based on the existence of any 1-1 One-Way Functions and is secure against the most general attack known. Previously, all provably secure signature schemes were based on the stronger mathematical assumption that trapdoor one-way functions exist.
The taming of an expert: an anecdotal report
Authors: B. Brown
Venue: Issue 108 (April 1989) (1989)

In the mid-80's when I joined the Texas Instruments Defense Systems Artificial Intelligence Lab, expert systems were a solution looking for a problem. My first assignment as a knowledge engineer was knowledge acquisition for a small expert system supporting an internal TI project. Preparing for the task, I reviewed texts [1][2][3] and journal articles [4][5] in the lab's small but growing technical library. Most texts agreed that effective knowledge acquisition was essential and that the process could be a bottleneck in system development. But the how-to, what-to, and how-fix were often missing. In an effort to supplement the limited material, the lab made available to its fledgling knowledge engineers internal guidelines to aid in beginning knowledge acquisition [6][7][8].
A scheme for data compression in supercomputers
Authors: M. A. Bassiouni, N. Ranganathan, A. Mukherjee
Venue: Proceedings of the 1988 ACM/IEEE conference on Supercomputing (1988)

There is a growing recognition of the importance of efficient coding and data compression schemes in supercomputing centers and in networks of high-speed computing machines. Recently, there has been a considerable interest in arithmetic coding as a promising technique for reducing the cost of data storage and transmission. In this paper, we present a compression algorithm that is tailored to utilize the enormous speed and memory size of supercomputers and which utilizes an enhanced arithmetic coding scheme. The paper also presents efficient VLSI designs for the enhanced scheme. These hardware designs are suitable for inclusion in disk and communication controllers of supercomputers and would provide a practical way to effectively increase thresholds of data transfer rates and communication bandwidth.
Exaggeration
Authors: Daniel S. Weld
Venue: Artificial Intelligence (1990)

Exaggeration is a technique for solving comparative analysis problems by considering extreme perturbations to a system. For example, exaggeration answers the question, &ldquo;What happens to the output temperature of a heat exchanger if fluid flow rate increases?&rdquo; by simulating the behavior of an exchanger with infinite flow rate. Exaggeration is implemented as a sequence of three phases: transform, simulate, and scale. The transform phase takes a comparative analysis problem and generates the description of an exaggerated system. The simulate phase predicts the behavior of the transformed system. Finally, the scale phase compares the original and exaggerated behaviors to answer the original comparative analysis question. This paper explains the theoretical basis of exaggeration, describes an implementation that has solved over fifty problems, and compares exaggeration with the differential qualitative (DQ) analysis approach to comparative analysis. &mdash;Author's Abstract
Expressibility of bounded-arity fixed-point query hierarchies
Authors: P. Dublish, S. N. Maheshwari
Venue: Proceedings of the eighth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems (1989)

The expressibility of bounded-arity query hierarchies resulting from the extension of first-order logic by the least fixed-point, inductive fixed-point and generalized fixed-point operators is studied. In each case, it is shown that increasing the arity of the predicate variable from k to k+1 always allows some more k-ary predicates to be expressed. Further, k-ary inductive fixed-points are shown to be more expressive than k-ary least fixed-points and k-ary generalized fixed-points are shown to be more expressive than k-ary inductive fixed-points.
The use of anaphoric resolution for document description in information retrieval
Authors: S. Bonzi, E. Liddy
Venue: Proceedings of the 11th annual international ACM SIGIR conference on Research and development in information retrieval (1988)

This study investigated two hypotheses concerning the use of anaphors in information retrieval. The first hypothesis, that anaphors tend to refer to integral concepts rather than to peripheral concepts, was well supported. Two samples of documents, one in psychology and the other in computer science, were examined by subject experts who judged the centrality of phrases which were referred to anaphorically. The second hypothesis, that various term weighting schemes are affected differently by anaphoric resolution, was also well supported. It was found that schemes which incorporate document length into the calculations produce much smaller increases in term weights for terms occurring in anaphoric resolutions than do those which do not consider document length. It is concluded that although anaphoric resolution has potential for better representing the &ldquo;aboutness&rdquo; of a document, care must be taken in choosing both the anaphoric classes to be resolved and the term weighting schemes to be used in measuring a document's topicality.
Fill-in-the-blank JCL: why we did it and how
Authors: L. Manderson
Venue: Proceedings of the 17th annual ACM SIGUCCS conference on User Services (1989)

Several years ago, in an effort to simplify our production job process, standardize our production JCL, and live with the installation of a new security package, we developed a system called Production Job Submission Control (PJSC). PJSC consists of a small &ldquo;programming&rdquo; language and a full-screen interface that prompts for input and then generates job streams using the input. Increasingly, PJSC is not just for our Operations staff. It is becoming a tool for use by us, the programming staff, and most important, our Users. Even complete programs can be generated and/or submitted to the system using this process. This paper will discuss the underlying concepts of PJSC and present an overview of the implementation which is now run at UAB. Examples of use and suggestions for development of similar programs for other environments will also be included.
How do the experts do it? The use of ethnographic methods as an aid to understanding the cognitive processing and retrieval of large bodies of text
Authors: D. O. Case
Venue: Proceedings of the 11th annual international ACM SIGIR conference on Research and development in information retrieval (1988)

This paper explores an important problem in information retrieval: that of rapidly increasing amounts of full-text storage that is difficult to file and retrieve effectively. The author suggests that a possible avenue for improving full-text retrieval would include in-depth studies of the ways in which individual users cope with large amounts of written information, stored chiefly on paper in their offices. Relevant literature in cognitive psychology is reviewed and some recent and continuing studies are described that have used anthropological methods to approach this problem. It is argued that historians are a good group to study, due to their reliance on the examination and processing of texts, and the broad scope of their inquiries. Examinations of the ways in which this one group of information workers categorize documents could lead us to a better understanding of human problems in processing and retrieving textual information.
Finite monoids and the fine structure of NC1
Authors: David A. Mix Barrington, Denis Thérien
Venue: Journal of the ACM (JACM) (1988)

Recently a new connection was discovered between the parallel complexity class NC1 and the theory of finite automata in the work of Barrington on bounded width branching programs. There (nonuniform) NC1 was characterized as those languages recognized by a certain nonuniform version of a DFA. Here we extend this characterization to show that the internal structures of NC1 and the class of automata are closely related. In particular, using Th&eacute;rien's classification of finite monoids, we give new characterizations of the classes AC0, depth-k AC0, and ACC, the last being the AC0 closure of the mod q functions for all constant q. We settle some of the open questions in [3], give a new proof that the dot-depth hierarchy of algebraic automata theory is infinite [8], and offer a new framework for understanding the internal structure of NC1.
Pgraphite: an experiment in persistent typed object management
Authors: Jack C. Wileden, Alexander L. Wolf, Charles D. Fisher, Peri L. Tarr
Venue: Proceedings of the third ACM SIGSOFT/SIGPLAN software engineering symposium on Practical software development environments (1989)

Defining, creating, and manipulating persistent typed objects will be central activities in future software environments. PGRAPHITE is a working prototype through which we are exploring the requirements for the persistent object capability of an object management system in the Arcadia software environment. PGRAPHITE represents both a set of abstractions that define a model for dealing with persistent objects in an environment and a set of implementation strategies for realizing that model. PGRAPHITE currently provides a type definition mechanism for one important class of types, namely directed graphs, and the automatic generation of Ada implementations for the defined types, including their persistence capabilities. We present PGRAPHITE, describe and motivate its model of persistence, outline the implementation strategies that it embodies, and discuss some of our experience with the current version of the system.
Some results in memory conflict analysis
Authors: D. A. Calahan
Venue: Proceedings of the 1989 ACM/IEEE conference on Supercomputing (1989)

The delay of accesses in shared-memory vector multiprocessors is considered. Simple formulae are presented which predict the delays of both scalar and vector accesses with a variety of loads in terms of memory technology and design parameters. Comparisons are made with both simulated and measured results on five CRAY memory systems.
OOP in the real world
Authors: Rick DeNatale, Charles Irby, John LaLonde, Burton Leathers, Reed Phillips
Venue: ACM SIGPLAN Notices (1990)

Some advocates of OOP have promised that it will make all code reusable, shorten development cycles, remove the applications backlog, cure the common cold and plug the hole in the ozone layer. How well does actual experience bear this out? Success stories are published much more often than failures and false starts. This is very unfortunate since the former two are often much more instructive. This panel will attempt to bring the less successful experiences to light, and hopefully, will provide lessons on how to do better.
Visual Navigation of an Autonomous Vehicle Using White Line Recognition
Authors: S. Ishikawa, H. Kuwamoto, S. Ozawa
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1988)

A method is presented for the autonomous visual navigation of a vehicle by using a white guide for path recognition. The vehicle moves over a white guide line on the flat ground or floor, which is contrasted with its background. The vehicle uses a forward-looking TV camera for sensing. The white-line recognition algorithm presented uses a state transition algorithm. A field pattern monitoring method is also presented for vehicle guidance using a state transition scheme. When the vehicle comes to branches, it selects a suitable direction according to a path planner output. The vehicle can also avoid collisions with obstacles in front of it by monitoring the field patterns and their changes. An experimental moving vehicle system was constructed. Tests conforming the effectiveness of these approaches are described.
Symbiotic systems for complex problems
Authors: Mike Sciabin, Stephen Bisanz, Geoffrey Lakeman, Sandy Place
Venue: Proceedings of the 1st international conference on Industrial and engineering applications of artificial intelligence and expert systems - Volume 1 (1988)

Until computer programs can be devised which perform the functions of the human right brain, Symbiotic Systems may provide the best practical alternative for solving complex problems which can be represented visually (such as finding an effective layout for a plant or office, or developing a complex employee schedule). The human visual approach to such problems seems to be non-sequential. Computer methods which make use of traditional sequential algorithms generally do not provide an effective interface with people attempting to use a right-brain visual approach to solving the problem. Even used interactively, a sequential procedure can interfere with the human's developing thought patterns. In a symbiotic system, each component (computer or human), helps the other component to continue in its own way to provide further improvements to the current solution. In particular, the computer allows the human to continue to expand on a train of thought between interactions. This continuity can be achieved if the computer system appears to think in the same way as the human. Based on an early version which has been shown to provide excellent results on a well-known set of problems, an example of a symbiotic system for facility layout, muFLAC, is implemented on the IBM RT scientific computer. Emulating the human visual approach to designing layouts, muFLAC facilitates a symbiotic relationship between the human user and the RT computer. A second symbiotic system is described, in which the computer component emulates the human visual approach to scheduling employees in a hospital. Features which contribute to symbiosis, such as animation of a network diagram, the representation of rules as visual patterns, the provision of an environment for manipulating visual symbols, controlled display speed, and screen interactions are discussed.
Polymorphic effect systems
Authors: J. M. Lucassen, D. K. Gifford
Venue: Proceedings of the 15th ACM SIGPLAN-SIGACT symposium on Principles of programming languages (1988)

We present a new approach to programming languages for parallel computers that uses an effect system to discover expression scheduling constraints. This effect system is part of a 'kinded' type system with three base kinds: types, which describe the value that an expression may return; effects, which describe the side-effects that an expression may have; and regions, which describe the area of the store in which side-effects may occur. Types, effects and regions are collectively called descriptions. Expressions can be abstracted over any kind of description variable -- this permits type, effect and region polymorphism. Unobservable side-effects can be masked by the effect system; an effect soundness property guarantees that the effects computed statically by the effect system are a conservative approximation of the actual side-effects that a given expression may have. The effect system we describe performs certain kinds of side-effect analysis that were not previously feasible. Experimental data from the programming language FX indicate that an effect system can be used effectively to compile programs for parallel computers.
Bat brushes: on the uses of six position and orientation parameters in a paint program
Authors: C. Ware, C. Baxter
Venue: ACM SIGCHI Bulletin (1989)

A geometry is described for converting hand position and orientation into six useful variables for computer input. The application is that of controlling form and color in an experimental computer &ldquo;paint&rdquo; program. We find that the most easily controlled parameters of hand placement are x,y and z cartesian coordinates and a twist parameter which approximates the wrist action that occurs when a dial is turned.The two remaining parameters are horizontal and vertical wrist rotations. In order to capture these it is necessary to correct for the rotation about the elbow which naturally occurs when the hand is translated. However, these two parameters are difficult to control independently of hand translations. Computer paint &ldquo;brushes&rdquo; are described which allow the real-time control of size, color and position on the screen using the hand parameters described.
Designing the interface designer's interface
Authors: Gurminder Singh, Mark Green
Venue: Proceedings of the 1st annual ACM SIGGRAPH symposium on User Interface Software (1988)

The concepts of a user interface management system (UIMS) and user interface designer have become well known in the user interface and graphics community. Most UIMSs developed so far have concentrated on the efficiency of generating the user interface; the user interface designer's interface has received relatively little attention. We identify the important features of the user interface designer's interface. A UIMS incorporating these features in its interface has been developed, and is described in this paper.
Quasi-Valid range querying and its implications for nearest neighbor problems
Authors: D. E. Willard, Y. C. Wee
Venue: Proceedings of the fourth annual symposium on Computational geometry (1988)

We define a new formalism called the quasi-valid range aggregation. This formalism leads to a new and quite simple method for reducing non-range query-like problems to range queries and often to orthogonal range queries, with immediate applications to the ATTRACTED NEIGHBOR and the planar ALL-PAIRS NEAREST NEIGHBORS problems (the latter being solved optimally on both parallel and sequential machines). A point of special interest is that our new formalism permits operators &ldquo;+&rdquo; that are neither associative nor abelian (unlike traditional range query theory). The technique described in this paper should therefore have significant other applications besides those we consider, especially in the context of parallel computational geometry.
Online query refinement on information retrieval systems: a process model of searcher/system interactions
Authors: H. Chen, V. Dhar
Venue: Proceedings of the 13th annual international ACM SIGIR conference on Research and development in information retrieval (1989)

This article reports findings of empirical research that investigated information searchers' online query refinement process. Prior studies have recognized the information specialists' role in helping searchers articulate and refine queries. Using a semantic network and a Problem Behavior Graph to represent the online search process, our study revealed that searchers also refined their own queries in an online task environment. The information retrieval system played a passive role in assisting online query refinement, which was, however, or that confirmed Taylor's four-level query formulation model. Based on our empirical findings, we proposed using a process model to facilitate and improve query refinement in an online environment. We believe incorporating this model into retrieval systems can result in the design of more &ldquo;intelligent&rdquo; and useful information retrieval systems.
A knowledge-based analysis of zero knowledge
Authors: Joseph Halpern, Yjoram Moses, Mark Tuttle
Venue: Proceedings of the twentieth annual ACM symposium on Theory of computing (1988)

While the intuition underlying a zero knowledge proof system [GMR85] is that no &ldquo;knowledge&rdquo; is leaked by the prover to the verifier, researchers are just beginning to analyze such proof systems in terms of formal notions of knowledge. In this paper, we show how interactive proof systems motivate a new notion of practical knowledge, and we capture the definition of an interactive proof system in terms of practical knowledge. Using this notion of knowledge, we formally capture and prove the intuition that the prover does not leak any knowledge of any fact (other than the fact being proven) during a zero knowledge proof. We extend this result to show that the prover does not leak any knowledge of how to compute any information (such as the factorization of a number) during a zero knowledge proof. Finally, we define the notion of a weak interactive proof in which the prover is limited to probabilistic, polynomial-time computations, and we prove analogous security results for such proof systems. We show that, in a precise sense, any nontrivial weak interactive proof must be a proof about the prover's knowledge, and show that, under natural conditions, the notions of interactive proofs of knowledge defined in [TW87] and [FFS87] are instances of weak interactive proofs.