ppxscal/embedding_network huggingface dataset:
Automated proofs of microprogram correctness
Authors: W. H. Joyner,  Jr., W. C. Carter, G. B. Leeman,  Jr.
Venue: Proceedings of the 9th annual workshop on Microprogramming (1976)

This paper presents a method for verifying microprograms with computer aid, and examples of its application to actual systems. The specifications for an architecture and those for the computer on which it is to be implemented are both described formally, with the microcode supplied as data to the low level description. A correspondence between the two descriptions is then formalized, and a system of programs is used to prove mathematically that the correspondence holds. This interactive, goal-directed system not only provides a proof that microcode performs as specified, but more often aids in detecting and correcting microprogram errors. Several errors in actual implementations, some of which were difficult to detect using test cases, have been discovered in this way.
A performance analysis of multiple channel controllers
Authors: Alan Jay Smith
Venue: Proceedings of the 1973 ACM SIGME symposium (1973)

A multiple channel controller (MCC)is a controller which allocates a given number of channels among a larger number of peripheral devices, and permits simultaneous access to as many devices as there are channels available. Using simplifying assumptions, we develop formulas, based on infinite source queueing models, which closely approximate the mean effective service time, (MEST). The MEST is the time interval between arrival at the head of the queue and service completion, which includes both service time and waiting time at the head of the queue caused by the sharing of channels among devices. We also derive expressions for the variance of the effective service time. Various service time distributions and channel scheduling disciplines are examined and analytic results are compared graphically with those obtained by simulation. Alternative system configurations are compared with the objective of minimizing queueing delays.
On the method of minimum (or "best") approximation and the method of least nth powers
Authors: Allen A. Goldstein, James B. Herreshoff, Norman Levine
Venue: Proceedings of the 1956 11th ACM national meeting (1956)

There has been a renewed interest of late in the problem of approximation in the Tchebycheff sense, that is of minimizing the maximum residues. Several methods 1, 2, 3, have already been discussed and many examples of approximating functions of one variable by polynomials and rational functions, etc. have been published. On the other hand the important problem of solving an overdetermined system of linear equations in the Tchebycheff sense has not been given the attention it deserves. The possession of a practical method for the solution of this problem would make possible &ldquo;best&rdquo; approximations of functions of several variables by linear combinations of arbitrary functions. It is not widely known that an algorithm for solving this problem exists and is due to de la Vallee Poussin.4 Unfortunately the algorithm is unwieldy but it is still useful in the computation of a minimum approximation. We shall therefore outline the results of de la Vallee Poussin before discussing some new methods with which we have been experimenting.
Towards a person-centered computer technology
Authors: Rob Kling
Venue: Proceedings of the ACM annual conference (1973)

Contemporary computer designers are largely machine centered. They emphasize function and standards of elegance, efficiency and computing power. The side effects of systems may enhance or diminish the well-being of various users. Person-centered standards that promote a sense of competence and autonomy are outlined. The coupling of flexible software with responsive organizations is suggested as a means of enhancing personal competence and self-esteem of computer users.
Decomposition of a relation scheme into Boyce-Codd Normal Form
Authors: Don-Min Tsou, Patrick C. Fischer
Venue: Proceedings of the ACM 1980 annual conference (1980)

Decomposition into Boyce-Codd Normal Form (BCNF) with a lossless join and preservation of dependencies is desired in the design of a relational database scheme. However, there may be no decomposition of a relation scheme into BCNF that is dependency preserving, and the known algorithms for lossless join decomposition into BCNF require exponential time and space. In this paper we give an efficient algorithm for lossless join decomposition and show that the problem of deciding whether a relation scheme has a dependency-preserving decomposition into BCNF is NP-hard. The algorithm and the proof assume that all data dependencies are functional. We then discuss the extension of our techniques to the case where data dependencies are multivalued.
Teaching microprocessor architectures
Authors: Ratan K. Cuha
Venue: ACM SIGCSE Bulletin (1983)

For our undergraduate computer science architecture majors, we are making a major revision of our existing course sequence (three courses) on microprocessors. For effective utilization of microprocessors, a total system design and development methodology approach is used. In this paper, we discuss the development of the first course of the sequence. The first course emphasizes on various microprocessor architectures. Since our non-architecture major undergraduate students may take this first course as an elective, this course is designed as a self contained foundation course with proper mixes of hardware and software.
Experiences with CHUTE
Authors: F. M. Valenti, Z. G. Vranesic
Venue: Proceedings of the 1977 annual conference (1977)

This paper describes some of the experiences with CHUTE (CHess, University of Toronto, Engineering), an &ldquo;easily&rdquo; modifiable chess playing program. The basic characteristics of the program are discussed. The game tree look-ahead procedure used in the program does not employ a static position analysis, but selects the best path strictly on the basis of dynamic move analysis. A brief discussion of heuristics is given, along with some of the problems encountered in their implementation. The program has an opening book designed to take other chess playing programs out of their books.
The langley research center remote computing terminal system: Implementation and first year's operation
Authors: Roger V. Butler
Venue: Proceedings of the 1966 21st national conference (1966)

In April 1965 a remote computing terminal system was installed at the Langley Research Center in support of open shop programming. This paper describes the system and relates some of the experience gained in using and managing it. Because this system grew out of the needs of the open shop programmers, I will begin by reviewing the development of our open shop programming project. This work got under way in 1957 when it was decided to train some of the research scientists at the Center to use the IBM 650 at the Computer Center, and to schedule 1 hour of computer time each day for them to debug and run programs they had written in the Bell Interpretive Language. While this hour/day was a bit restrictive, it provided a schedule they could count on and manage according to their own priorities. It also gave them access to a computer much more powerful than the very small computers popular at that time, with the result that they could do fairly large programs and accomplish more in the hour than would have been possible in a day on the smaller computer. The objectives were to supplement the programming done by the professional programmers at the Computer Center and to enhance the computer as an experimental research device. The initiative for creating the open shop came from the Computer Center and the improvement in open shop computing facilities has continued to be one of our principal responsibilities. The open shop idea was widely accepted and steadily grew from one group of 10 people using a 650 one hour per day to 8 groups, totaling nearly 100 people, using the 650 all day. By the early 1960's the workload had grown to such a level that it was decided to provide an IBM 1620 solely for open shop use. This increase in computing capacity made it practical to begin programming in FORTRAN, thus enabling the open shop programmer to undertake more complex problems, which in turn encouraged even greater computer use. The work-load continued to grow until in 1963 it became necessary to use an IBM 7090 for processing some of the longer production runs. The 1620 was used primarily for debugging. In 1964, the Direct Coupled System (DCS) 1 was installed in the Computer Center. This system drastically reduced the turnaround time required by Previous large systems so that for the first time we felt it was practical for the open shop programmer to use a large computer system directly for all his computing needs.
&ldquo;Computer generated artwork - the aide system&rdquo;
Authors: M. Kliman
Venue: Proceedings of the 9th Design Automation Workshop (1972)

A comprehensive system of compute programs which take raw logic diagrams or equations through design to printed circuit board artwork.
Chip assemblers: Concepts and capabilities
Authors: Randy H. Katz, Shlomo Weiss
Venue: Proceedings of the 20th Design Automation Conference (1983)

A chip assembler is a tool for managing design information. It encourages a structured design methodology, wherein a design is described by a collection of hierarchical design decompositions, one for each of its representations. It assists in the enforcement of consistency constraints up, down, and across the different hierarchies. We argue that a chip assembler, as an integrated design environment, requires an integrated approach for the management of design data. We describe what a chip assembler is, how it is used for design management, and what are its desirable features.
SIMOB- a portable toolbox for observation of SIMULA executions. (Extended Abstract)
Authors: Knut Barra, Hans Petter Dahle
Venue: Proceedings of the ACM SIGSOFT/SIGPLAN software engineering symposium on High-level debugging (1983)

To reason correctly over what is happening during an execution is often hard just by looking at the program text. To assist programmers and others to understand what really is going on, a portable tool for observation of SIMULA executions has been designed at the Norwegian Computing Center. In this article the S-PORT project and the main features of the tool are described.
Invariant-based recognition of complex curved 3D objects from image contours
Authors: B. Vijayakumar, D. J. Kriegman, J. Ponce
Venue: Proceedings of the Fifth International Conference on Computer Vision (1995)

To recognize three-dimensional objects bounded by smooth curved surfaces from monocular image contours, viewpoint-dependent image features must be related to object geometry. Contour bitangents and inflections along with associated parallel tangents points are the projection of surface points that lie on the occluding contour for a five-parameter family of scaled orthographic projection viewpoints. An invariant representation can be computed from these image features and seen for modeling and recognizing objects. Modeling is achieved by moving an object in front of a camera to obtain a curve of possible invariants. The relative camera-object motion is not required, and 3D models are not utilized. At recognition time, invariants computed from a single image are used to index the model database. Using the matched features, independent qualitative and quantitative verification procedures eliminate potential false matches. Examples from an implementation are presented.
District office network simulator computer simulation of the characteristics of the Social Security Administration's district office operations
Authors: Barbara S. Haskins, John W. Fraser,  Jr.
Venue: Proceedings of the fourth annual conference on Applications of simulation (1970)

This publication describes the results of work undertaken by the SSA Operations Research Staff of the Social Security Administration. The release of this document to interested professionals in the field of Operations Research must be accompanied by the understanding that the content, opinions, and conclusions expressed here are those of the authors only and do not in any sense reflect views of the Social Security Administration or the Department of Health, Education, and Welfare.
Communication In X-TREE, A Modular Multiprocessor System
Authors: C. H. Séquin, A. M. Despain, D. A. Patterson
Venue: Proceedings of the 1978 annual conference (1978)

A communication network for a tree-structured assembly (X-TREE) of single-chip processors is described, and considerations for selecting this particular approach are discussed. The communication links between the processors are high-speed, byte-parallel connections with an asynchronous handshaking protocol. Each node of X-TREE consists of a powerful processor, a switching network and a dedicated communications controller. The latter checks the availability of the links terminating in this node, supervises the creation and elimination of message channels and controls the routing and time multiplexing of concurrent messages over the same link. The switching network inside each X-NODE connects the external links with the internal processor via a fast multiplexed bus which is interfaced to each input/output port through fifo message buffers. Network topology, routing algorithm, addressing scheme, message format and communication hardware are discussed.
A multiple delay simulator for MOS LSI circuits
Authors: H. N. Nham, A. K. Bose
Venue: Proceedings of the 17th Design Automation Conference (1980)

This paper describes a multiple delay simulator for MOS LSI circuits. The basic primitives for this simulator are MOS transistor structures where the transistors are evaluated logically. Integer rise and fall delays are associated with each transition and these delays are computed automatically based on device characteristics and circuit capacitances. The simulator has been extensively used for the design verification of production LSI chips.
Structured standardization managers' views
Authors: John F. Schrage
Venue: Proceedings of the 1979 annual conference (1979)

About 1964, the term &ldquo;structured&rdquo; was added to aspects of the computer programming and analysis areas which implied a method of better controlling the functions with manageable changing capabilities. In the past five years, the structured programming has lead more to use in the area of design based on surveying the commercial programs and courses circulating across management desks. Managers have generally provided training for computer personnel to learn and use the structured philosophy based on cost figures for training. (1) Problems have generally resulted in applying structured constraints for the experienced programmer; whereas, information about structured design has not been reported. (2)
Binding time optimization in programming languages: Some thoughts toward the design of an ideal language
Authors: Neil D. Jones, Steven S. Muchnick
Venue: Proceedings of the 3rd ACM SIGACT-SIGPLAN symposium on Principles on programming languages (1976)

A new approach to the design of a programming language and its processor is proposed and some of the techniques necessary to realize the design are investigated. The language would have a precisely specified syntax and semantics, with both designed to provide the programmer maximal expressive power and to be as easily understood as possible. The semantics would be based on extremely late binding times, which provide great power to the programmer and are consistent with ease of understanding of the execution process. It would be the responsibility of the processor to implement each program in the most efficient manner consistent with its being correctly executed. Implications of this design philosophy and some of the techniques to be used are discussed in greater detail, focusing particularly on data types and storage allocation.
Simulation of a large computing computing facility as a multiproduct firm
Authors: Charles J. Brauch
Venue: Proceedings of the 3rd symposium on Simulation of computer systems (1975)

A macro-model for evaluation of a large computer system is described. Estimates of system capacity and a simulated job load are used to compute a metric for the fraction of capacity which is utilized. This, coupled with estimates of average turnaround time, permits analysis of the &ldquo;throughput/service&rdquo; trade-off. The interrelationships of system measurement parameters are emphasized, and the large computing facility is characterized as a multiproduct firm which makes joint products available to its patrons. A simulation model which is under development is outlined, including examples. The simulations described herein consider two joint variables&mdash;central processor time and input/output activity (bytes transferred). Although the model can accommodate additional variables, the two variable case is sufficient for demonstrating the folly of failing to recognize the interaction of system parameters in determining the capacity of the system. Proper treatment of interdependent system parameters (joint products) in performance evaluation is the main thrust of the paper.
Structured machine design: An ongoing experiment
Authors: Richard F. Hobson
Venue: Proceedings of the 8th annual symposium on Computer Architecture (1981)

In the following sections, the needs of structured architecture from the point of view of a single-user HLLCS is discussed. A prototype machine is introduced, and its design is treated as an ongoing experiment in structured machine design. This approach is relevant because historical evidence suggests that computer architecture (hardware and software) evolves slowly, requiring valuable information obtained through everyday use.
Computer scientists' responsibility to educational research: A dynamic medium for creative thought
Authors: Alan C. Kay
Venue: Proceedings of the fourth SIGCSE technical symposium on Computer science education (1974)

A computing engine of sufficient power can both simulate existing media and provide new framewords for creative ideas. It must be personal, portable, and inexpensive. Movies of such a (hard) system/(soft) language designed and built for &ldquo;children of all ages&rdquo; will be shown.
On partial differential equations with irregular boundaries
Authors: H. Reichenbach
Venue: Proceedings of the 1956 11th ACM national meeting (1956)

The present project is the outcome of applying high speed digital computing techniques to the computation of stresses in irregularly shaped bodies. Here the usual relaxation methods based x upon a grid of regulairly spaced points, come in to difficulties, and so it was decided to develop a code which handles a network of irregularly spaced points. The code which we finally worked out, has sufficient generality to handle a variety of equations in different fields. The method is essentially a generalisation of the Gauss Seidel iteration technique. It reduces to the conventional method whenever the points of the network are situated in regular arrays.
Towards a taxonomy of computer architecture based on the machine data type view
Authors: W. K. Giloi
Venue: ACM SIGARCH Computer Architecture News (1983)

Existing taxonomies of computer architecture lack the descriptive tools to deal with the large variety of existing principles, features, and mechanisms of the existing spectrum of single processor, multi processor, and multi computer architectures. Consequently, they lack the discriminating power to be able to taxonomize computer architecture. In the paper, a new approach toward a complete taxonomy is presented. The key to the taxonomy is to start with the dichotomy of 'operational principle' and 'hardware structure' as the foundation of a computer architecture and describe the constituents of the operational principle in terms of 'machine data types' consisting of 'machine data objects', their representations, and the functions applicable on the objects. The resulting taxonomy provides a systematic approach to the design of innovative computer architectures.
Microprocessor tutorial session
Venue: Proceedings of the 1975 annual conference (1975)

This session will review the state of the art of microprocessor development from the standpoint of technology, software, and systems considerations. The papers are admittingly biased toward a software audience. Some less than obvious pitfalls of developing microprocessor software while using less than adequate software tools will be described. Methods of trading off hardware and software in microprocessing systems to minimize system cost will be presented.
A placement algorithm for array processors
Authors: Dah-Juh Chyan, Melvin A. Breuer
Venue: Proceedings of the 20th Design Automation Conference (1983)

In this report a concurrent pairwise exchange placement algorithm executing on an array processor is presented. Two force functions and their effects are discussed. The oscillation phenomenon caused by the concurrent computation is investigated and some solutions are suggested. A design for the array processor is presented along with a complexity analysis which indicates that this algorithm is O(N2) faster than a conventional sequential placement algorithm if N&times;N processors are employed.
Strategies for database schema acquisition and design
Authors: Matthew Morgenstern
Venue: Proceedings of the ACM '81 conference (1981)

Consideration of the database design process highlights specific problems in requirements determination, development of the overall conceptual schema, and the Data Base Administrator bottleneck. An alternative design strategy is described which first acquires the separate user views and then systematically merges these views to derive the overall conceptual schema. The user views may be specified independently and are not limited to a single data model formalism.
The integration of subjective and objective data in the animation of human movement
Authors: T. W. Calvert, J. Chapman, A. Patla
Venue: ACM SIGGRAPH Computer Graphics (1980)

Animation of human movement can be based either on analog inputs derived directly from actual movements or on symbolic inputs chosen to produce the desired movement. The former type of input can be quite accurate and objective but is a description of the required movement whereas the latter is often quite imprecise and subjective but provides an analysis of the required movements. Two existing systems for a computer based animation are being used to explore the problems involved in integrating such inputs. Specifically, animation driven by analog signals from electro-goniometers is integrated with animation derived from Labanotation commands; the results are illustrated with a short movie.
Computer science conference: How to attend this conference
Venue: Proceedings of the 2nd annual computer science conference on Program information abstracts (1974)

This Conference includes many short unrefereed presentations on current research. To accommodate the large number of submitted papers, a number of sessions have been scheduled in parallel. The time schedules will be closely followed so that it will be possible to go from one session to another to hear specific presentations. This means that during the discussion period following a presentation, there may be considerable traffic into and out of the room. These short presentations are not intended to cover all the details of a research project, but rather show the primary problems and results of current interest. The Conference has not required that any formal papers be available, but many authors will have additional information for interested participants. Hopefully, these sessions will bring together researchers of similar interests who can continue their discussions outside the formal Conference program.