ppxscal/embedding_network huggingface dataset:
A fast scan-line algorithm for rendering parametric surfaces
Authors: James H. Clark
Venue: Proceedings of the 6th annual conference on Computer graphics and interactive techniques (1979)

An algorithm for rendering shaded pictures of parametric curved surfaces is presented. The algorithm recursively subdivides each surface element on the basis of its screen-space parametric curvature until it is sufficiently close to bilinear to be scan-converted by conventional polygon rendering techniques. The mathematical basis chosen to carry out the subdivision process yields the curvature criterion as a coefficient so that the tests for termination of the subdivision process are extremely simple. In addition, a surface is subdivided only in the parametric direction in which its curvature deviates from the tolerance. The algorithm incorporates a very simple solution to the problem of separations between sibling subpatches.
Programming conversational use of computers for instruction
Authors: Karl L. Zinn
Venue: Proceedings of the 1968 23rd ACM national conference (1968)

Interactive use of computers in instruction is increasing rapidly. Many manufacturers are promoting programming languages for educational applications of their equipment, and some are marketing small machines with software exclusively for instructional applications. Nearly 30 languages and dialects have been developed especially for programming conversational instruction1 but within this group there are actually only three or four different kinds of languages, and despite the variety, many of the differences between the languages are superficial, leaving some user needs still unmet.
Abstract families of deterministic languages
Authors: W. J. Chandler
Venue: Proceedings of the first annual ACM symposium on Theory of computing (1969)

Abstract families of (one-way) deterministic acceptors are formalized and shown to be characterized by families of languages closed under marked union, marked *, and inverse marked gsm mapping. The independence of these closure operations is also proved.
Message communication protocol and operating system design for the Distributed Loop Computer Network (DLCN)
Authors: Ming T. Liu, Cecil C Reames
Venue: Proceedings of the 4th annual symposium on Computer architecture (1977)

The Distributed Loop Computer Network (DLCN) is envisioned as a powerful, unified distributed computing system which interconnects midi/mini/micro-computers, terminals and other peripherals through careful integration of hardware, software and a loop communication network. Research concerning DLCN has concentrated on the loop communication network, message protocol and distributed network operating system. For the loop communication network, previous papers [2,3] reported a novel message transmission mechanism, its hardware implementation, and its superior performance verified by GPSS simulation. This paper presents an overview of the design requirements and implementation techniques for DLCN's message protocol and network operating system. Firstly, a bit-oriented distributed message communication protocol (DLMCP) which handles four message types under one common format is proposed. Besides user information transfer, this protocol supports automatic hardware-generated message acknowledgment, error detection and recovery, and network control and distributed operating system functions, Secondly, the network operating system (DLOS) is described which provides facilities for interprocess communication by process name, global process control and calling of remote programs, generalized data transfer, alterable multi-linked process control structures, distributed resource management, and logical I/O transmission in a distributed file system.
Construction of a validated simulator for performance prediction of DECnet-based computer networks
Authors: Bernd Wolfinger, Max Mühlhäuser
Venue: Proceedings of the 1983 ACM SIGMETRICS conference on Measurement and modeling of computer systems (1983)

Predicting important performance parameters of computer networks, recognizing potential bottlenecks, comparing design alternatives are factors of decisive importance in building complex computer networks. In this respect, computer aided simulation has proved to be a very effective design tool in a number of practical applications. It is shown by the example of the MOSAIC modeling system how a simulator applicable on a broad basis could be adapted to the specific characteristics of a class of existing computer networks. The class of computer networks chosen for modeling is based on DECnet communication software. Modeling concentrates mainly on the DECnet protocols and their hierarchies. The paper indicates the adaptations necessary to adjust the MOSAIC kernel system adequately to DECnet computer networks and summarizes the results of a rather extensive validation for the modeling system, comprising calibration and accuracy establishment, which has been carried out successfully.
A practicum - seminar in structured programming
Authors: Clarence A. Ellis
Venue: ACM SIGCSE Bulletin (1975)

This paper describes a practicum-seminar course which the author taught at the University of Colorado during the spring and summer of 1974. This course contained a number of salient features which made it an interesting experiment and a unique learning experience for all involved. The broad goals of the seminar were: a) to introduce participants to system design and software engineering techniques and to provide practical experience in the use of these techniques; b) to design and implement a flexible, human oriented student registration and scheduling system. This paper presents background and discussion of the project and the seminar. A class syllabus is given showing topics which were covered, and advantages and disadvantages of this type of educational experience are discussed.
LSI components modelling in a three-valued functional simulation
Authors: G. Alia, P. Ciompi, E. Martinelli, F. Bernardini
Venue: Proceedings of the 15th Design Automation Conference (1978)

This paper deals with the problem of describing the behaviour of LSI components for a three-valued functional simulation. The proposed functional description uses a set of predefined functional modules, named primitives, for handling data signals, and test blocks for handling control signals. Some primitives with relative algorithms are described and a procedure for test blocks management with three-valued control signals is proposed.
Newton's iteration and the sparse Hensel algorithm (Extended Abstract)
Authors: Richard Zippel
Venue: Proceedings of the fourth ACM symposium on Symbolic and algebraic computation (1981)

This paper presents an organization of the p-adic lifting (or Hensel) algorithm that differs from the organization previously presented by Zassenhaus [Zas69] and currently used in algebraic manipulation circles [Mos73, Yun74, Wan75, Mus75]. Our organization is somewhat more general than the earlier one and admits the improvements that yielded the &ldquo;sparse modular&rdquo; algorithm [Zip79] more easily than the Zassenhaus algorithm. From a pedagogical point of view, the relationship between Newton's iteration and the p-adic algorithms is clearer in our formulation than with the Zassenhaus algorithm.
RISC assessment: A high-level language experiment
Authors: David A. Patterson, Richard S. Piepho
Venue: Proceedings of the 9th annual symposium on Computer Architecture (1982)

We present the result of an informal experiment comparing the performance of one Reduced Instruction Set Computer, RISC I, to five traditional computers, VAX-11/780, PDP-11/70, BBN C/70, MC68000, and Z8000, in a high-level language environment. Measuring either absolute performance or the penalty for using high-level languages, the best computer is RISC I.
From information requirements to DBTG-data structures
Authors: J. A. Bubenko,  Jr., S. Berild, E. Lindencrona-Ohlin, S. Nachmens
Venue: ACM SIGPLAN Notices (1976)

The problem of determining, analysis and description of a particular application's information structure (and relations) and the process of mapping the information structure to a &ldquo;good&rdquo; data structure (in this case a DBTG-type structure) is considered. The applicability of a top-down oriented design procedure to a relatively large practical data base design case is demonstrated. A conceptual framework and a notation to be used for determining and definition of information requirements, information structure and information relations is suggested. A systematic and partly formalized approach to map an information structure to a DBTG-type data structure is discussed. The problem of analysis and evaluation of alternative DBTG-type structures is also considered.
Image processing techniques for bone image analysis
Authors: Zhi-Qiang Liu, T. J. Austin, D. Moore
Venue: Proceedings of the 1995 International Conference on Image Processing (Vol. 1)-Volume 1 - Volume 1 (1995)

Features of human bones are useful to establish correlation between bone structure and age, and information about age-related bone diseases. This paper presents a new approach to quantitative analysis of cross sections of human bones using image processing techniques. The system uses the adaptive neighborhood algorithm, clustering, local covariance measures, and the fuzzy region growing algorithm. The system extracts various bone features with consistency and provides more reliable statistics. As a result, the authors are able to correlate bone features with age and possibly with age related bone diseases such as osteoporosis.
Reliable host-to-host protocols: Problems and techniques
Authors: Lawrence L. Garlick, Raphael Rom, Jonathan B. Postel
Venue: Proceedings of the fifth symposium on Data communications (1977)

Host-to-host protocols capable of supporting internetworking and reliable transmission have been under development for several years. This paper discusses problems and techniques related to one type of reliable protocol, which features end-to-end positive acknowledgement, retransmission, internetwork addressing capabilities, and ordered delivery. The issues of interest are protocol correctness and completeness, protocol efficiency, and complexity of implementation. These will be discussed in a framework of three problem areas, flow control, sequence number space management, and reliable transmission of controls. Flow control heuristics using windowing techniques are explored. Flow control information is augmented to allow fair apportionment of bandwidth, better bandwidth utilization through optimistic credits, flow control credits matched to the type of traffic, and increased performance for high precedence connections. Alternatives for selecting the startup sequence number for a connection are presented. Techniques and problems of several sequence number space management strategies are presented. These include delayed startup, incarnation numbers, and resynchronization. The transmission of controls are discussed, with emphasis on whether or not to share a logical transmission channel between controls and data. The effect of data flow control on the delivery of out-of-band signals is an important consideration. The findings are presented both to further the understanding of and to encourage intelligent implementations of reliable protocols.
Space frame analysis and applications to other types of structures
Authors: H. Simpson, J. Antebi
Venue: Proceedings of the SHARE design automation workshop (1964)

We have been fortunate in having the opportunity to work with IBM in the field testing and final debugging of a computer program for the analysis of large space frames (FRAN). We are also pleased that M.I.T. Lincoln Laboratory sponsorship enabled us to develop and contribute the subroutine (CHECK) which provides a static check at every joint in the structure. This presentation consists of three parts: 1. A description of FRAN; this will include a brief resume of both the structural theory involved and of the method of solution used by the program. 2. The method by which other structural types can be treated as space frames for the purpose of analysis. 3. A discussion of the application of these methods in the analysis of a large antenna consisting of a 120 ft diameter reflector shell and its supporting structure.
Interval arithmetic applied to polynomial remainder sequences
Authors: James R. Pinkert
Venue: Proceedings of the third ACM symposium on Symbolic and algebraic computation (1976)

Polynomial remainder sequences are the basis of many important algorithms in symbolic and algebraic manipulation. In a number of these algorithms, the actual coefficients of the sequence are not required; rather, the method uses the signs of the coefficients. Present techniques, however, compute the exact coefficients (or a mixed radix representation of them), and then obtain the signs. This paper discusses a new approach in which interval arithmetic is used to obtain the signs of the coefficients without computing their exact values. Comparisons of this method with analogous standard techniques show empirical computing time reductions of two orders of magnitude for even relatively small cases.
Program efficiency and data structures
Authors: Moshe Augenstein, Aaron Tenenbaum
Venue: Proceedings of the eighth SIGCSE technical symposium on Computer science education (1977)

Program efficiency is usually considered from the point of view of optimizing code. Selecting a proper data structure can have a remarkable effect on the efficiency of the final program. In this paper it is shown how one problem can be solved in several ways using several different data structures. The efficiency of the programs depend on the data structures selected.
The effect of selected variables on the learning of some computer programming elements
Authors: Sorel Reisman
Venue: Proceedings of the ACM annual conference (1973)

The widespread use of computers in most aspects of society has caused educators to introduce computing into many levels of the curriculum. In the absence of experience suggesting techniques for structuring such courses, an intuitive approach is usually taken. A conflict which has arisen because of this concerns the advantages or disadvantages of teaching high level languages before low level languages. This study attempted to resolve this conflict. An additional objective of the study was to investigate the effects of providing learners with a) computer generated reinforcement and b) differential error diagnostics in their programming exercises. Elements of high level and low level programming languages were selected to be illustrative of programming languages taught in Ontario secondary schools. Two programmed instruction (PI) manuals, each representing one of the language levels, were written and field-tested for this study. Two sets of problems, one for each manual, were designed to be administered in two interactive time-sharing sessions.
Microprogrammed control for signal processing
Authors: Earl E. Swartzlander,  Jr.
Venue: Proceedings of the 10th annual workshop on Microprogramming (1977)

An easily implemented microprogrammed control concept for signal processors is presented. The control unit is developed by restricting the next state function of a classical Moore machine, and by using microprogramming in its implementation. The concept is well matched to requirements for signal processors (which do not require complex branching logic). It is optimized for efficient implementation with commercially available integrated circuits as demonstrated by an example signal processor which is described in detail to illustrate the simplicity and flexibility of the concept.
An application of parametric time series in simulation modeling
Authors: Neil W. Polhemus, J. Stuart Hunter
Venue: Proceedings of the 7th conference on Winter simulation - Volume 2 (1974)

A parametric time series model is employed to simulate the number of aircraft present in an air traffic control sector. Borrowing from the work of Box and Jenkins, the identification, parameter estimation and associated tests of adequacy are illustrated using data from a low altitude control sector. The fitted model provides a useful algorithm and reflects the time dependency which exists between the number of aircraft measured in consecutive time periods. The simulation is part of a larger air communications system simulation which is under development.
Use of APL in operations research an interactive dynamic programming model
Authors: Moshe Sniedovich
Venue: ACM SIGAPL APL Quote Quad (1981)

Issues related to the use of APL as an overall environment for operations research activities are discussed. The analysis is focused on the interface between the mathematical and computational environments provided by APL, and is based on experience gained during a three-year period. A simple interactive dynamic programming model is presented for illustrative purposes.
Developing user services for the researcher
Authors: Carol Waters
Venue: Proceedings of the 5th annual ACM SIGUCCS conference on User services (1977)

Researchers have varied and specialized computer needs. This paper describes an approach to developing services to meet these needs. After identifying the category of researchers to be helped, the services are developed in three ways. First are activities which are sponsored by the computer center to aid researchers in helping each other. Second are joint projects between the computer center and the academic community. Last are the traditional projects performed within the computer center.
Interaction, interfaces and design
Authors: John S. Gero, Warren G. Julain, W. Neville Holmes
Venue: Proceedings of the 11th Design Automation Workshop (1974)

Many planning problems cannot be formulated in such a manner t h a t a well developed optimizing technique can be applied to them to arrive at a satisfactory solution. This may be because of the structure of the problem itself, it may be because objectives and even parameters cannot be adequately described or it may be due to the need to include subjective factors. Additionally there is a class of problems for which the cost of the computation required to reach an optimum is not warranted by the expected gains. When we examine the tools available to a problem solver who wishes to use interactive computing, we find that the languages currently used to achieve interaction are both clumsy and restrictive.
Light reflection functions for simulation of clouds and dusty surfaces
Authors: James F. Blinn
Venue: ACM SIGGRAPH Computer Graphics (1982)

The study of the physical process of light interacting with matter is an important part of computer image synthesis since it forms the basis for calculations of intensities in the picture. The simpler models used in the past are being augmented by more complex models gleaned from the physics literature. This paper is another step in the direction of assimilating such knowledge. It concerns the statistical simulation of light passing through and being reflected by clouds of similar small particles. (It does not, however, address the cloud structure modeling problem). By extension it can be applied to surfaces completely covered by dust and is therefore a physical basis for various theories of diffuse reflection.
The TDIP System
Authors: Joseph D. Smith, James T. Perry
Venue: Proceedings of the ACM annual conference (1973)

The Table Driven Information Processing (TDIP) System, a data-independent information storage and retrieval package, is used to organize small and medium size information files containing nonamorphous data. A description of the file structure containing relative field positions, etc., is constructed once by the user and read by the Input Handling Package of TDIP. By maintaining file-dependent descriptions external to the TDIP program proper, the system need not be recompiled for each new application area. A unique, extendible type data field allows a variable number of subfield entries per record. The system is logically divided into the Input Handling Package, Retrieval Package, and Output Processing Package. This design facilitates conversion from the batch mode version to an on-line operation. The user requests are collected into an in-core table by the Input Handling Package. The Retrieval Package uses this table to perform a single, sequential search of the informatio file, and the Output Processing Package formats the search results. All user requests are free format and may be formulated by adhering to a few, easily learned commands. The system has been used to organize student records containing both fixed and variable entry fields.
Beyond cataloging functions for art museum data banks (abstract only)
Authors: Andrew B. Whinston
Venue: Proceedings of the joint conference on Easier and more productive use of computer systems. (Part - I): Information processing in the social sciences and humanities - Volume 1981 (1981)

A data management system for art museums is presented. In addition to providing conventional cataloging functions such as searching, sorting and indexing, the system is shown to be able to model complex relationships between entities relevant to the application. The importance of this capability with regard to representing higher levels of information (beyond pure physical characteristics) is pointed out. Alternative representations of such relationships are discussed and some directions of further work in the area of automation of a museum's catalog is cited.
Error modelling applications in software quality assurance
Authors: Alan N. Sukert, Amrit L. Goel
Venue: ACM SIGMETRICS Performance Evaluation Review (1978)

This paper presents the results of a two-phased experiment conducted by Rome Air Development Center and Syracuse University to demonstrate the potential applicability of software error prediction models in performing formalized qualification testing of a software package. First, decisions based upon the predictions of three software error prediction models will be compared with actual program decisions for a large command and control software development project. Classical and Bayesian demonstration tests are used to make accept/reject decisions about the software system. Finally, the results of the two phases will be compared and some conclusions drawn as to the potential use of these predictive techniques to software quality assurance.
Implications of data independence on the architecture of database management systems
Authors: Arthur J. Collmeyer
Venue: Proceedings of 1972 ACM-SIGFIDET workshop on Data description, access and control (1972)

Data independence is a relatively new concept in database management technology. In essence, the objective of data independence is the insulation of application programs from the underlying database management system. The remarkably widespread appreciation for the notion is in part a result of the vigorous discussion generated by the reports of the Data Base Task Group of CODASYL and the Joint GUIDE-SHARE Data Base Requirements Group. While the pros and cons have been discussed at some length, very little has been written or spoken on the implications of data independence on the architecture of database management systems. It is the purpose of this paper to identify and elaborate on some of the problems associated with the design of a data-independent system.