ppxscal/embedding_network huggingface dataset:
The rendering architecture of the DN10000VS
Authors: David Kirk, Douglas Voorhies
Venue: Proceedings of the 17th annual conference on Computer graphics and interactive techniques (1990)

The Appollo DN10000VS treats graphics as an integral part of the system architecture. Graphics requirements influence the entire system design. All floating-point computations for graphics are performed by the CPU(s), while rasterizing is handled by simplified hardware having no microcode. We decided to support alpha buffering, quadratic interpolation, and texture mapping directly in hardware. This partitioning reduces the cost of a high-end workstation, without sacrificing high rendering quality and performance. This paper describes some of the design trade-offs which led to the final system design.
High-performance multi-queue buffers for VLSI communications switches
Authors: Y. Tamir, G. L. Frazier
Venue: ACM SIGARCH Computer Architecture News (1988)

Small nxn switches are key components of multistage interconnection networks used in multiprocessors as well as in the communication coprocessors used in multicomputers. The design of the internal buffers in these switches is of critical importance for achieving high throughput low latency communication. We discuss several buffer structures and compare them in terms of implementation complexity and their ability to deal with variations in traffic patterns and message lengths. We present a new design of buffers that provide non-FIFO message handling and efficient storage allocation for variable size packets through the use of linked lists managed by a simple on-chip controller. We evaluate the new buffer design by comparing it to several alternative designs in the context of a multi-stage interconnection network. Our modeling and simulations show that the new buffer outperforms its &ldquo;competition&rdquo; and can thus be used to improve the performance of a wide variety of systems currently using less efficient buffers.
Discrete Black and White Object Recognition via Morphological Functions
Authors: D. Sinha, C. R. Giardina
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1990)

Two morphological algorithms that attempt to recognize a black and white object directly in its discrete domain are presented. The first algorithm is based on covariance functions, while the second is based on a variant of size distribution functions. In both these algorithms, the scale correction has been automated. Also presented is a complete geometric and algebraic characterization of objects that are identical with respect to the proposed methodologies, and it is shown that the induced equivalent classes over binary images contain objects that are structurally very similar. This has been accomplished by introducing the notions of a strongly attached pixel, discrete structure of an image, and a structure preserving operation. An outcome of the analysis is the insight into the relationship between the discrete structure of an image and the induced equivalence classes.
Control of cognitive processes during software design: what tools are needed?
Authors: R. Guindon, B. Curtis
Venue: Proceedings of the SIGCHI conference on Human factors in computing systems (1988)

A verbal protocol study of professional software designers has revealed three design process control strategies. At least one of them, the generation of opportunistic solutions at different levels of detail accompanied by problem domain modeling, had not been observed in previous empirical studies nor had been acknowledged in the software engineering practices. Specific breakdowns (difficulties) were associated with the different design process control strategies. Software tools should be provided to designers to alleviate these breakdowns. Parts of a cognitive model of software design, based on distributed control from specialists such as design schemas, design heuristics, and design methods, are presented to account for the observed control strategies.
A parallel `make' utility based on Linda's tuple-space
Authors: C. J. Fleckenstein, D. Hemmendinger
Venue: Proceedings of the 17th conference on ACM Annual Computer Science Conference (1989)

We describe a prototype of a parallel `make' utility that executes on multiple workstations and achieves a significant real-time speedup. This utility is implemented by means of logically shared memory based on the Linda system's tuple space. It makes work with distributed computing easy to conduct, since it can be built on top of an existing operating systems without modifying it, and since it permits easy experimentation with strategies for distributing the work.
A Hierarchical Computer Architecture for Distributed Simulation
Authors: A. I. Concepcion
Venue: IEEE Transactions on Computers (1989)

A methodology is developed to map hierarchical, modular discrete-event models onto a distributed simulated architecture, the hierarchical multibus multiprocessor architecture (HM/sup 2/A). The proposed architecture contains features closely reflecting the structure, behaviour, and modular properties of the model being simulated. Hence, this approach improves on previous approaches, which impose the model on a predesigned architecture.
Testing large software products
Authors: D. E. House, W. F. Newman
Venue: ACM SIGSOFT Software Engineering Notes (1989)

Software testing becomes more and more difficult the larger the software system gets. Operating systems and very large programming products often have special testing considerations that most application programs do not have. This paper describes a testing methodology with focus on system testing operating systems as implemented in an area of IBM's large systems software development - Myers Corners Laboratory, Poughkeepsie, New York. It also gives an overview of large-scale software manufacturing.
A unified analysis of batched searching of sequential and tree-structured files
Authors: Sheau-Dong Lang, James R. Driscoll, Jiann H. Jou
Venue: ACM Transactions on Database Systems (TODS) (1989)

A direct and unified approach is used to analyze the efficiency of batched searching of sequential and tree-structured files. The analysis is applicable to arbitrary search distributions, and closed-form expressions are obtained for the expected batched searching cost and savings. In particular, we consider a search distribution satisfying Zipf's law for sequential files and four types of uniform (random) search distribution for sequential and tree-structured files. These results unify and extend earlier research on batched searching and estimating block accesses for database systems.
Introducing finite automata in the first course
Authors: Mark R. Headington
Venue: ACM SIGCSE Bulletin (1988)

In the computer science curriculum, finite state machines and finite automata are typically introduced at the upper-division level. However, students can benefit from an earlier, informal exposure to finite automata for three reasons: - Finite automata represent a useful application when two-dimensional arrays are introduced. - A painless early introduction can ease the transition to rigorous approaches encountered later. - Finite automata provide yet another algorithmic tool to be added to the student's repertoire.
The creation of digital consciousness
Authors: J. T. Monterege
Venue: Issue 109 (July 1989) (1989)

It is possible with the existing computer technology to construct a machine that would be accepted as a fully intelligent and conscious entity.
A Language for Specifying Program Transformations
Authors: David Hildum, Jacques Cohen
Venue: IEEE Transactions on Software Engineering (1990)

A language is described for specifying program transformations, from which programs can be generated to perform the transformations on sequences of code. The main objective of this work has been to develop a language that would allow the user to quickly and easily specify a wide range of transformations for a variety of programming languages. The rationale for the language constructs is given, as well as the details of an implementation which was prototyped using Prolog. Numerous examples of the language usage are provided.
Matching ¿ A special case of unification?
Authors: Hans-Jürgen Bürckert
Venue: Journal of Symbolic Computation (1989)

Unification is the problem to solve equations of first order terms by finding (all) substitutions into their variables that make these two terms equal. Matching is the problem to solve equations, where only one of the terms has to be instantiated by the substitution. Usually research in unification theory does not take care of the problems arising with matching, as it is considered as a special form of unification. We recall the various definitions of matching from the literature and we compare matching and unification in a more general framework called restricted unification. We show that matching and unification in collapse free cquational theories behave similar with respect to the existence and the cardinality of minimal complete sets of solutions. We present some counterexamples where matching and unification behave differently, especially we give an equational theory, in which the existence of solutions for unification problems is decidable, for matching problems, however, this is undecidable. Matching and restricted unification as defined here are equivalent to extending the given signature by free constants. Our counterexamples show that unification may become undecidable, if we add new free constants to the signature.
Visualizing Large Data Sets in the Earth Sciences
Authors: William L. Hibbard, David A. Santek
Venue: Computer (1989)

The authors describe the capabilities of McIDAS , an interactive visualization system that is vastly increasing the ability of earth scientists to manage and analyze data from remote sensing instruments and numerical simulation models. McIDAS provides animated three-dimensional images and highly interactive displays. The software can manage, analyze, and visualize large data sets that span many physical variables (such as temperature, pressure, humidity, and wind speed), as well as time and three spatial dimensions. The McIDAS system manages data from at least 100 different sources. The data management tools consist of data structures for storing different data types in files, libraries of routines for accessing these data structures, system commands for performing housekeeping functions on the data files, and reformatting programs for converting external data to the system's data structures. The McIDAS tools for three-dimensional visualization of meteorological data run on an IBM mainframe and can load up to 128-frame animation sequences into the workstations. A highly interactive version of the system can provide an interactive window into data sets containing tens of millions of points produced by numerical models and remote sensing instruments. The visualizations are being used for teaching as well as by scientists.
A mean-value performance analysis of a new multiprocessor architecture
Authors: S. T. Leutenegger, M. K. Vernon
Venue: Proceedings of the 1988 ACM SIGMETRICS conference on Measurement and modeling of computer systems (1988)

This paper presents a preliminary performance analysis of a new large-scale multiprocessor: the Wisconsin Multicube. A key characteristic of the machine is that it is based on shared buses and a snooping cache coherence protocol. The organization of the shared buses and shared memory is unique and non-hierarchical. The two-dimensional version of the architecture is envisioned as scaling to 1024 processors. We develop an approximate mean-value analysis of bus interference for the proposed cache coherence protocol. The model includes FCFS scheduling at the bus queues with deterministic bus access times, and asynchronous memory write-backs and invalidation requests. We use our model to investigate the feasibility of the multiprocessor, and to study some initial system design issues. Our results indicate that a 1024-processor system can operate at 75 - 95% of its peak processing power, if the mean time between cache misses is larger than 1000 bus cycles (i.e. 50 microseconds for 20 MHz buses; 25 microseconds for 40 MHz buses). This miss rate is not unreasonable for the cache sizes specified in the design, which are comparable to main memory sizes in existing multiprocessors. We also present results which address the issues of optimal cache block size, optimal size of the two-dimensional Multicube, the effect of broadcast invalidations on system performance, and the viability of several hardware techniques for reducing the latency for remote memory requests.
An overview of high-level languages
Authors: Jean E. Sammet
Venue: Advances in computers; vol. 20 (2000)

A lengthy overview article on high-level languages could be written from many different viewpoints. . . . I have tried to make this contribution very broad, rather than deep in any particular area. . . . Each potential reader will find at least one section of direct interest. . . . Language specialists will find much of this material to be technically superficial. I have tried to provide an overview of all the issues which I think are worth mentioning in 1980. As a result, the coverage of most sections is superficial. &mdash;From the Introduction
Efficient (stack) algorithms for analysis of write-back and sector memories
Authors: James G. Thompson, Alan Jay Smith
Venue: ACM Transactions on Computer Systems (TOCS) (1989)

For the class of replacement algorithms known as stack algorithms, existing analysis techniques permit the computation of memory miss ratios for all memory sizes simultaneously in one pass over a memory reference string. We extend the class of computations possible by this methodology in two ways. First, we show how to compute the effects of copy-backs in write-back caches. The key observation here is that a given block is clean for all memory sizes less than or equal to C blocks and is dirty for all larger memory sizes. Our technique permits efficient computations for algorithms or systems using periodic write-back and/or block deletion. The second extension permits stack analysis simulation for sector (or subblock) caches in which a sector (associated with an address tag) consists of subsectors (or subblocks) that can be loaded independently. The key observation here is that a subsector is present only in caches of size C or greater. Load forward prefetching in a sector cache is shown to be a stack algorithm and is easily simulated using our technique. Running times for our methods are only slightly higher than for a simulation of a single memory size using nonstack techniques.
APL as a tool of research for the mathematical scientist
Authors: E. J. Danial
Venue: Conference proceedings on APL as a tool of thought (1989)

The simplicity and elegance of the APL language in helping the mathematical scientist think about decisions in serious research is clearly demonstrated. This is done by analyzing how the APL function INFDIV inspires the existence of the generalization of the sufficient conditions for a discrete random variable to be infinitely divisible. Documentations and sample outputs are presented.
Computer simulation as a method for selecting nurse staffing levels in hospitals
Authors: M. L. McHugh
Venue: Proceedings of the 21st conference on Winter simulation (1989)

Efficient utilization of staff resources is perhaps the most critical issue facing nursing department administrators today, and has been a matter of concern to nursing service administrators since at least the early 1940's. This study used computer simulation to examine the effect on wage costs and staffing adequacy of varying nurse staffing levels. Three Psychiatric care units in a large VA hospital served as models for the simulation study. The staffing patterns tested were 40%, 50%, 60%, and 80% of maximum workload. Due to a quirk in rounding, the 40% and 50% staffing levels were exactly the same for these nursing units. The 80% staffing level produced direct wage costs 8% higher than the 50% level and 6.7% higher than the 60% level. It also produced 11.6% overstaffing as compared with 1.7% for the 60% staffing level and .2% for the 50% level. The 50% staffing level produced .9% understaffing as compared with .4% for the 60% level and .3% for the 80% level. It was concluded that both the 50% and 60% staffing levels performance was acceptable. Graphical representation of the data demonstrated that the optimal staffing level fell at approximately the 55% staffing level.
The History Heuristic and Alpha-Beta Search Enhancements in Practice
Authors: J. Schaeffer
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1989)

Many enhancements to the alpha-beta algorithm have been proposed to help reduce the size of minimax trees. A recent enhancement, the history heuristic, which improves the order in which branches are considered at interior nodes is described. A comprehensive set of experiments is reported which tries all combinations of enhancements to determine which one yields the best performance. In contrast, previous work on assessing their performance has concentrated on the benefits of individual enhancements or a few combinations. The aim is to find the combination that provides the greatest reduction in tree size. Results indicate that the history heuristic combined with transposition tables significantly outperforms other alpha-beta enhancements in application-generated game trees. For trees up to depth 8, this combination accounts for 99% of the possible reductions in tree size, with the other enhancements yielding insignificant gains.
The cost distribution of clustering in random probing
Authors: Béla Bollobás, Andrei Z. Broder, Istvan Simon
Venue: Journal of the ACM (JACM) (1990)

A new approach to the analysis of random probing hashing algorithms is presented. The probability-generating function in closed form for the asymptotic cost of insertion via random probing with secondary clustering is derived. For higher-order clustering, it is shown that all the moments of the probability distribution of the insertion cost exist and are asymptotically equal to the corresponding moments of the cost distribution under uniform hashing. The method in this paper also leads to simple derivations for the expected cost of insertion for random probing with secondary and higher-order clustering.
The gould NP1 system interconnecting
Authors: D. J. Vianney, J. H. Thomas, V. Rabaza
Venue: Proceedings of the 2nd international conference on Supercomputing (1988)

The Gould NP1 is a multicomputer multiprocessing system designed for high performance and parallel processing required in diverse scientific and engineering applications. The NP1's basic building block is a dual-processor single bus system which can be expanded up to eight processors over four system buses. This paper discusses the overall design and implementation of tne NP1 system interconnection in particularly the inter-system bus link which interconnects four system buses to form a tightly coupled eight processor system. Such interconnectivity provides NP1 the flexibility in system expansion capable of addressing full four gigabytes of physical memory with the least communications delay. Index Terms - Gould NP1, dual-cpu, multiprocessor, processor farm, inter-system bus link.
Evaluating the size of queries on relational databases with non-uniform distribution and stochastic dependence
Authors: Silvio Salza, Mario Terranova
Venue: Proceedings of the 1989 ACM SIGMOD international conference on Management of data (1989)

The paper deals with the problem of evaluating how the originality of the attributes of a relation, i.e. the number of distinct values in each attribute, is affected by relational operations that reduce the cardinality of the relation. This is indeed an interesting problem in research areas such as database design and query optimization. Some authors have shown that non uniform distributions and stochastic dependence significantly affect the originality of the attributes. Therefore the models that have been proposed in the literature, based on uniformity and independence assumptions, in several situation can not be conveniently utilized. In this paper we propose a probabilistic model that overcomes the need of the uniformity and independence assumptions. The model is exact for non uniform distributions when the attributes are independent, and gives approximate results when stochastic dependence is considered. In the latter case the analytical results have been compared with a simulation, and proved to be quite accurate.
Constraint logic programming languages
Authors: Jacques Cohen
Venue: Communications of the ACM (1990)

Constraint Logic Programming (CLP) is an extension of Logic Programming aimed at replacing the pattern matching mechanism of unification, as used in Prolog, by a more general operation called constraint satisfaction. This aritcle provides a panoramic view of the recent work done in designing and implementing CLP languages. It also presents a summary of their theoretical foundations, discusses implementation issues, compares the major CLP languages, and suggests directions for further work.
An application of heuristic search techniques to the problem of flight path generation in a military hostile environment
Authors: Verlynda S. Dobbs, Henry W. Davis, Carl Lizza
Venue: Proceedings of the 1st international conference on Industrial and engineering applications of artificial intelligence and expert systems - Volume 1 (1988)

This paper is a study of the effectiveness of heuristic search algorithms in generating flight paths. Due to the need to generate and revise paths dynamically we are interested in execution speed as well as solution quality (conflict cost plus path length). Extensive tests with three search algorithms were made using a simple threat model. Using straight-forward heuristics, we found that two of the algorithms perform well then their weights are appropriately adjusted. One is A* and the other is a bidirectional search. Our results indicate that heuristic search is effective in flight path generation and provide details about algorithms which were successful.
Object-oriented modeling using C++
Authors: D. Peter Sanderson, Lawrence L. Rose
Venue: Proceedings of the 21st annual symposium on Simulation (1988)

Object-oriented modeling provides a natural and powerful paradigm for representing the elements of a discrete-state system and their behavior. The concepts of encapsulation and inheritance are central to the realization of the object orientation. The C + + programming language supports encapsulation through the class construct, and inheritance through derived classes. A hierarchy of C + + classes designed to support an event-oriented simulation viewpoint is presented. The use of this package is demonstrated through an example program for simulating the operation of a simple computer system.
A logic for simulating discontinous systems
Authors: S. Narain, J. Rothenberg
Venue: Proceedings of the 21st conference on Winter simulation (1989)

This paper presents DMOD, a formalism for simplifying the synthesis and analysis of programs for simulating discontinuous systems. It lacks the concept of explicit state. Its programs are constraints upon event occurrences, based upon a novel view of the causality relation. Constraints can freely refer to the past and future of causing events. Simulation is regarded as inference of event occurrences from constraints. An event is said to occur when an interesting proposition becomes true. The new concept of partially instantiated events is introduced.DMOD can be regarded as a formalization of the widely used event scheduling view of the discrete-event simulation technique. However, it shows how event occurrences can be computed without devices of scheduling, unscheduling or event queues, which are intrinsic to this view. Due to partially instantiated events, DMOD can also be considered more general.