ppxscal/embedding_network huggingface dataset:
A scan line algorithm for displaying parametrically defined surfaces
Authors: James F. Blinn
Venue: ACM SIGGRAPH Computer Graphics (1978)

This paper presents a scan line algorithm for drawing picture of parametrically defined surfaces. A scan line algorithm is characterized by the order in which it generates the picture elements of the image. These are generated left to right, top to bottom in much the same was as a picture is scanned out on a TV screen. Parametrically defined surfaces are those generated by a set of bivariate functions defining the X, Y and Z position of points on the surface. The primary driving mechanism behind such an algorithm is the inversion of the functions used to define the surface. To keep the algorithm general enough to apply to a wide variety of functional forms, this inversion is done numerically. It is only required to provide mechanism for evaluating the function and its derivatives at any parametric location. The algorithm proceeds in two phases. First, a numerical search is made to find the local maxima of the Y definition function within the desired parameter ranges. These determine when portions of the surface first become visible as the scan plane progresses down the screen. Secondly, the actual scan conversion process is performed, maintaining a list of segments of the surface intersecting the current scan plane. As the scan plane passes local maxima of the Y function new segments are added to the list. In addition, any existing segments are updated to reflect their intersection with the updated scan plane. All intersection calculations are performed by a bivariate Newton-Raphson solution of the defining equations. If the solution does not converge, it is due to the scan plane passing a local minimum, causing segments to be deleted from the active list. Finally, within one scan line, an X scan must be performed to generate the Z information about the surface for each picture element. This is also performed by a bivariate Newton-Raphson iteration with a different set of defining functions.
Indexing infinite arrays: Non-finite mathematics in APL
Authors: R. W.W. Taylor
Venue: Proceedings of the international conference on APL (1982)

Standard arrays in APL are indexed by the index sets @@@@N. Generalization to arbitrary index sets allows discussion of non-finite objects such as the set of real numbers and provides a suitable notation for mathematical exposition in analysis.
CAI tutorial method of teaching Thermodynamics at U.S. Naval Academy.
Authors: Chih Wu
Venue: ACM SIGCSE Bulletin (1974)

A computer-assisted instruction in Thermodynamics developed during the past two years at the U. S. Naval Academy has been used for teaching a number of midshipmen individually . An IBM 1500 instructional system is used in which each midshipman is provided with a terminal, with a cathode ray tube (complete with a typewriter keyboard, and a light pen), and an image projector. The instructional material, optional supplementary instruction, questions and tests are presented to each midshipman individually, enabling him to proceed at his own demand and pace. Detailed records of each section of material are stored in the computer and will enable the instructors to review each midshipman's progress through the course. The content of the course, the background of the midshipmen, as well as the equipment which the system comprises in use is described. The overall logic and approach to the course is discussed. The method of development of programmed material and a study of its effectiveness toward the stated goals along with recommendations, are also included.
Design, implementation and experiences with a higher-level graphics language for interactive computer-aided design purposes
Authors: Guenther Schrack
Venue: ACM SIGGRAPH Computer Graphics (1976)

The higher-level graphics language LIG has now been operational for over two years. The language has proven to be easy to learn and easy to use, as attested by a number of programmers. Through its use, many improvement possibilities of the syntax and the supporting subprogram system have shown up. The experimental design of a higher-level special purpose programming language in terms of the linguistic characteristics of a language extension and its implementation with the aid of a compiler generator is discussed. A consideration of the data type GRAPHICAL, its properties and its manipulation as well as a description of the major parts of the language LIG follows, stressing its graphic capabilities and its features for handling interactive application programs. The paper concludes with remarks regarding an evaluation of the approach taken for the design and the language itself, together with a number of suggestions for improvements.
The architecture of an ALGOL 60 computer implemented with distributed processors
Authors: Leonard S. Haynes
Venue: ACM SIGARCH Computer Architecture News (1977)

In conventional computer systems, the computer hardware does not actually execute the user's source program. Instead, a software compiler and link editor transform the program into low level machine code which is executed by the hardware. This mapping from a high-level language to a von Neumann instruction set is a. Computationally costly because compilers and link editors are big and slow. b. Inefficient because the object code is generally poor. c. Error prone because compilers and link editors are difficult to design, debug, and maintain. Furthermore, diagnostic messages for execution errors (an arithmetic overflow for example) are either cryptic and require the user to be familiar with the machine language (i.e., a dump), or the object code generated must require considerable run time overhead to permit run time errors to refer back to the users source program (i.e., pointers and tables, etc.).
Tutorial session 3B: Prospects for program verification
Venue: Proceedings of the 3rd international conference on Software engineering (1978)

This session is composed of three tutorial talks on program verification. No written versions of the talks were prepared since the material is already available in the literature. However, an abstract and brief bibliography is given below for each talk. These tutorials are an attempt to expose enough of the technical material of program verification that the audience can begin to develop their own opinion on the issues. This talk concentrates on the general concepts and definitions of the inductive assertion method for correctness proofs. The following questions will be answered: What is an assertion, an inductive assertion, a verification condition? Which aspects are mechanical, which require intelligent invention? What is the role and character of a theorem prover?
HEMI (Hybrid Events Monitoring Instrument)
Authors: Peter R. Sebastian
Venue: ACM SIGMETRICS Performance Evaluation Review (1974)

HEMI is an experimental instrumentation system being developed for use with the CYBER 70 and 170 Series computers in order to ascertain the extent to which an integrated approach to instrumentation is economically and technologically viable for performance measurement and evaluation purposes. HEMI takes advantage of the distributed CYBER computer architecture. This consists of a pool of Peripheral Processors (PPs) - (mainly dedicated to I/O and system tasks) while the CPU capabilities are reserved mostly for computation; Central Memory constitutes the communications link. HEMI uses one of the PPs as its major processor. A hardware data acquisition front end is interfaced to one of the I/O channels and driven by the PP. Hardware probes sample events at suitable testpoints, while the PP has software access to Central Memory (Operating System tables and parameters), Status Registers, I/O Channel Flags, etc. A data reduction package is used to produce a variety of reports from the data collected. A limited on-line data reduction and display capability is also provided. This paper will describe the current status of the project as well as anticipated applications of HEMI.
Evaluation of text editors
Authors: Teresa L. Roberts, Thomas P. Moran
Venue: Proceedings of the 1982 conference on Human factors in computing systems (1982)

This paper presents a methodology for evaluating computer text editors from the viewpoint of their users&mdash;from novices learning the editor to dedicated experts who have mastered the editor. The dimensions which this methodology addresses are: &mdash;Time to perform edit tasks by experts. &mdash;Errors made by experts. &mdash;Learning of basic edit tasks by novices. &mdash;Functionality over all possible edit tasks. The methodology is objective and thorough, yet easy to use. The criterion of objectivity implies that the evaluation scheme not be biased in favor of any particular editor's conceptual model&mdash;its way of representing text and operations on the text. In addition, data is gathered by observing people who are equally familiar with each system. Thoroughness implies that several different aspects of editor usage be considered. Ease-of-use means that methodology is usable by editor designers, managers of word processing centers, or other non-psychologists who need this kind of information, but have limited time and equipment resources. In this paper, we explain the methodology first, then give some interesting empirical results from applying it to several editors.
Trouble shooting a photochemical grid model&mdash;the St. Louis experience
Authors: J. P. Killus
Venue: Proceedings of the 13th conference on Winter simulation - Volume 2 (1981)

Initial application of a photochemical grid model to St. Louis underpredicted ozone formation within the urban area. Analysis indicates that the underprediction was due primarily to an underestimation of hydrocarbon emission reactivity. When emissions reactivity is corrected the model predicts concentrations of ozone similar to those observed. Predicted pollutant peaks are often misplaced, however, probably due to errors and biases in wind monitoring data.
The numerical solution of the Reynold's partial differential equation applied to the air lubrication of circularly curved surfaces
Authors: V. A. Ciminersa, R. V. Wadding, W. C. Orthwein
Venue: Proceedings of the 1961 16th ACM national meeting (1961)

In this study, a slider bearing pitched at various angles is placed above a surface moving at a fixed velocity. The problem is to determine the variation of the load due to the existing air pad between the slider bearing and the moving surface as the minimum bearing to surface distance changes. The analysis of load variation with bearing to surface spacing in which the center of pressure was located at a fixed point was carried out by obtaining numerical solutions to the difference equation which approximates the Reynold's partial differential equation in two dimensions. The computations of this solution were carried out on the IBM 704 and 7090 Data Processing Systems.
A new class of two stage parallel sorting schemes
Authors: J. Cheung, S. Dhall, S. Lakshmivarahan, L. Miller, B. Walker
Venue: Proceedings of the ACM '82 conference (1982)

A two stage parallel sorting scheme is presented in which in the first stage the input file is divided into a number of subfiles and sorted in parallel using the conventional heap sort algorithm. The second stage then merges the sorted sub-files in parallel. It is shown that a given input file of size n can be sorted in 0(n) time using 0(log n) processors. The speed-up ratio, which is a measure of the effectiveness of parallel processing, with respect to the best sequential algorithm, is asymptotically proportional to log n, which is optimal in the number of processors used.
Applications of the inner product computer
Authors: Earl E. Swartzlander,  Jr.
Venue: Proceedings of the ACM annual conference (1973)

Recently much interest has been expressed in the idea that future improvements in computer speed will be due primarily to architectural innovations as opposed to improvement in the characteristics of components (i.e., logic circuits, delays, memories, cycle times, etc.). In view of this it is not surprising that the current generation of &ldquo;super computers&rdquo; (i.e., the ILLIAC IV, the STAR 100, and the ASC) all exemplify the use of new architectures to achieve great increases in computing speeds. In this paper yet another new architecture is proposed - the inner product computer4. Like the ILLIAC IV it is a &ldquo;special purpose&rdquo; processor which is intended to be used in conjunction with a general purpose (i.e., host) computer.
Complex information processing: a self organizing program for describing concepts
Authors: J. M. Snediker
Venue: Proceedings of the 1965 20th national conference (1965)

ASSOCIATED WITH MANY ARTIFICIAL intelligence problems there is a set of elementary objects with which the problem is concerned. This set of objects constitutes the universe for a particular problem. Typical examples might be the set of machine printed numerals 0-9, the set of all possible positions in a checker game, or the set of military land vehicles. The objects in any one of these sets possess various properties (e.g., shape, color, size, strength), and each particular object assumes one of several values for each of these properties. Each property then, by virtue of its values, partitions the universe into disjoint, exhaustive subsets. By suitable combinations of these subsets (i.e., set-theoretic union and intersection), one can create new sets whose elements possess any desired property values for all properties. This fact motivates the following definition of the word &ldquo;concept&rdquo;. A concept is defined as a set of elementary objects whose members can be identified as belonging to the set by virtue of their distinguishing properties2. We desire some method of describing and manipulating concepts that is suitable, in terms of memory requirements and logic, for use on a digital computer.
SIGPLAN (Tutorial Session)
Authors: Frank Engel,  Jr., Walter S. Brainerd, Thomas A. Gibson
Venue: Proceedings of the 1976 annual conference (1976)

A revision of the 1966 Fortran standard, as proposed by the X3J3 committee, was published for review and comment in the March issue of ACM SIGPLAN Notices. Important new features are CHARACTER data type, more general use of expressions, file cataloging, and DO loops with negative increment or zero trip count. An IF-THEN-ELSE control structure is under consideration. This tutorial will cover (1) Fortran and Subset Fortran&mdash;what is a standard conforming program? (2) The CHARACTER data type; (3) Input and output: files and cataloging.
Use of computer simulation in designing complex material handling systems
Authors: Kailash M. Bafna
Venue: Proceedings of the 13th conference on Winter simulation - Volume 1 (1981)

This paper discusses the application of computer simulation in the designing of complex material handling systems. It is divided into three parts. The first part discusses the need for using simulation. This is followed by guidelines helpful in the planning and development of the simulator. Finally, the use of proper input data for conducting the analysis is discussed.
An interprocess communication facility for the model a multi-microcomputer system
Authors: Ramkumar V. Chary, Robert C. Gammill
Venue: Proceedings of the 1983 ACM SIGSMALL symposium on Personal and small computers (1983)

An interprocess communication (IPC) facility for a shared memory multi-microcomputer system is described. Interprocess communication is performed by exchanging messages through dual-ported mail-box memories. The facility uses fundamental abstractions called 'sockets'. The goals and motivations for 'sockets', their abstract and implementation views and software interfaces to the interprocess communication facility are described. The hardware design of a 'fair' dual-port memory controller, which will improve the performance of the message-passing scheme, is also described.
Implicit data structures (Preliminary Draft)
Authors: J. Ian Munro, Hendra Suwanda
Venue: Proceedings of the eleventh annual ACM symposium on Theory of computing (1979)

We consider representations of data structures in which the relative ordering of the values stored is implicit in the pattern in which the elements are retained, rather than explicit in pointers. Several implicit schemes for storing data are introduced to permit efficient implementation of the instructions insert, delete and find. &thgr;(@@@@N) basic operations are shown to be necessary and sufficient, in the worst case, to perform these instructions provided that the data elements are kept in some fixed partial order. We demonstrate, however, that further improvements can be made if an arrangement other than a fixed partial order is used. A structure, based on a fixed partial order, is introduced to facilitate multiple key searches. This structure, together with the retrieval scheme based upon it, is shown to be within a constant factor of the optimal one based on a partial order.
A note on computational studies for solving transportation problems
Authors: Fred Glover, David Karney, Darwin Klingman
Venue: Proceedings of the ACM annual conference (1973)

This note provides a mathematical explanation for the superiority of certain pivot criterion heuristics when using the Row-Column Sum Method to solve transportation problems. In addition, new pivot criteria are developed using this mathematical explanation which are shown to be computationally superior to the previously best pivot criteria.
System characterization of a Retail Business System
Authors: Robert W. Huff
Venue: ACM SIGSIM Simulation Digest (1979)

The complexities of Retail Business Systems today require a thorough understanding of how functional requirements impact desired system performance. It is no longer feasible to discretely test and evaluate individual system components without considering their inter-relationship. The techniques described in this presentation will define the method of system characterization of products prior to customer delivery. Three techniques are utilized to characterize system performance - simulation, stimulation, and performance measurement. Simulation involves writing a mathematical model which is enhanced from a product feasibility model to a system configuration tool as a result of stimulation and measurement activities. Stimulation consists of using emulators to load the system component under test as if the actual system is inter-connected. The emulators are programmed to produce a processing volume which can exceed the peak benchmark of the potential user. Performance measurement is accomplished during the stimulation activity using hardware/ software probes to monitor specific system parameters. These monitors provide vital information to determine total system capacity and the expected system performance for a given configuration. The information derived from system characterization is invaluable in providing the customer with a realistic expectation of system capability to perform its present functions and in projecting future growth potential.
Character string pattern matching in Algol 68
Authors: R. J.W. Housden, N. Kotarski
Venue: Proceedings of the Strathclyde ALGOL 68 conference (1977)

An album of modes, operators and procedures has been implemented to provide SNOBOL-like character string pattern matching facilities for the Algol 68 programmer. Most of the primitive functions and operators of SNOBOL 4 are included in the album. This paper describes some of the facilities available and briefly outlines their implementation.
A pollution displacement model for the great lakes system
Authors: Kent S. Butler, William A. Gates, Brent H. McCown
Venue: Proceedings of the 7th conference on Winter simulation - Volume 1 (1974)

A pollution displacement model of the Great Lakes system is presented, together with a brief review of previous Great Lakes water balance and pollution displacement models. The DYNAMO II language is utilized in a simulation of historical water balance relationships and a water pollution transport system for dissolved substances in each lake. The model enacts a continuous simulation of some hydrologic and water quality components of each subsystem, while making the concentration of pollutant in a downstream lake partially dependent upon the calculated inflow from the upstream lake. The concept of residence time or response time of a lake is developed. Due to the long residence time of pollution in the Great Lakes, especially in Lakes Superior and Michigan, the effects of water quality degradation or improvement may not be detectable for many decades.
Design of a multi-level file management system
Authors: Edward W. Ver Hoef
Venue: Proceedings of the 1966 21st national conference (1966)

This paper describes the file handling system developed and being implemented as a part of INTIPS, (INTe- grated Information Processing System) under the aegis of Rome Air Development Center. This file system addresses itself to the physical problem of the storage and retrieval of fixed length blocks and their organization into higher-order structures. It does not concern itself with the contents of these blocks. (For an elaboration of this distinction, see reference 1.)
A logic design structure for LSI testability
Authors: E. B. Eichelberger, T. W. Williams
Venue: Proceedings of the 14th Design Automation Conference (1977)

The ability to put hundreds of logic gates on a single chip of silicon offers great potential for reducing power, increasing speed, and reducing cost. Unfortunately, several problems must be solved in order to exploit these advantages of large-scale integration, LSI. This paper will describe a logic design method that will greatly simplify problems in testing, diagnostics, and field service for LSI. The design method is based on two concepts that are nearly independent but combine efficiently and effectively. The first is to design sequential logic structures so that correct operation is not dependent on signal rise and fall time or on circuit or wire delay. The second is to design all the internal storage elements (other than memory arrays) so that they can also be operated as shift registers to facilitate testing and diagnostics. Sequential logic, which is difficult to test, can then be transformed to combinational logic, which is less difficult. The transformation is performed during test generation. Advantages and cost impact will also be discussed qualitatively.
The construction and use of a general purpose synthetic program for an interactive benchmark on demand paged systems
Authors: Joel N. Williams
Venue: Proceedings of the 1977 annual conference (1977)

A general purpose synthetic program may be used to good advantage in configuring a workload for use in benchmarking several machines. A good general purpose synthetic program should be able to do a variety of types of CPU and I/O processing in a variety of source languages, should be able to simulate interactive processing, and should be able to exercise the core management routines of a demand paged (virtual) system. The construction and use of a general purpose FORTRAN synthetic program is outlined, and the results of a benchmark in which it was used are given. The development of the workload used in the benchmark is also described.
Design issues in the development of a modular multiprocessor communications network
Authors: M. A. Franklin, S. A. Kahn, M. J. Stucki
Venue: Proceedings of the 6th annual symposium on Computer architecture (1979)

The design of a modular crossbar network that can be used to support a multiprocessor is reviewed in this paper. The network is viewed at a functional level and the objectives, motivations and resultant design decisions are discussed. Two of these decisions relating to the nature and depth of pipelining in the network are examined in detail. The network designed is expandable in an easy fashion, flexible and suitable for large-scale integration.