ppxscal/embedding_network huggingface dataset:
Quality level and fault coverage for multichip modules
Authors: K. E. Torku, C. E. Radke
Venue: Proceedings of the 20th Design Automation Conference (1983)

A relationship between the quality level of a multichip module package and test coverage is established. A fault model for each stage of assembly of the package is assumed and the contribution of each of these stages to the quality level is assessed to produce the required relationship to test coverage achieved through test generation programs.
A completeness technique for d-axiomatizable semantics
Authors: Francine Berman
Venue: Proceedings of the eleventh annual ACM symposium on Theory of computing (1979)

In this paper, we show that by dropping the restrictions on interpretations of arbitrary programs and requiring only that very natural deductive systems are sound, we get classes of semantics which give good representations of program behavior and are more well-suited for applications involving an axiomatic approach (for example program verification). In addition, by tying the restrictions on the behavior of arbitrary programs or specified axiom schema, we get both a powerful formal tool and properties more widely used specifications lack such as compactness and completeness. Completeness is a very desirable property. It is fairly straightforward to show given any reasonable deductive system D for a class of models A that Pr(D) @@@@ Th(A) . But given an application such as program verification, if it is not true that Th(A) @@@@ Pr(D) , we may be able to find correct programs which we cannot verify. In this paper we show that by using the &ldquo;axiomatizability&rdquo; of programming constructs, we can obtain a technique for showing completeness results for some of the more widely used variations of PDL. We begin with some definitions.
Graphical Description, Control Logic Development, Simulation Development, And Animated Display Of Material Handling Systems
Authors: William L. Maxwell, Eugene E. Fellows
Venue: Proceedings of the 16th conference on Winter simulation (1984)

We present a brief rationale for the material handling system design methodology being developed. During the presentation a film will be shown illustrating the development of a material handling systems design using interactive computer graphics and a subsequent animated display of a simulation of the system designed.
SIMPLAN: Moving simulation into the board room
Authors: R. Britton Mayo
Venue: Proceedings of the 9th conference on Winter simulation - Volume 2 (1977)

In many organizations, a primary obstacle to the productive use of simulation techniques is the difficulty in communicating the nature of the underlying process to a programmer or analyst. Often, only one or two people understand the organization's simulation requirements for a particular project, and these people seldom have sufficient expertise in data processing areas to implement the desired modeling system. If the model could be constructed directly by the people who are to be the end users of its output, more satisfactory and accurate results can almost always be obtained. One method of accomplishing this is through a modeling language which can be learned quickly and easily by people with no prior computer background.
The analysis and scheduling of devices having rotational delays
Authors: Samuel Henry Fuller
Venue: Proceedings of the ACM annual conference (1973)

A number of problems concerning the scheduling, organization, and configuration of auxiliary storage units are analyzed in this dissertation. Stochastic, combinatorial, or simulation techniques are applied, depending on the assumptions and complexity of the particular problem. For the relatively simple scheduling disciplines of first-in-first-out (FIFO) and shortest-latency-time-first (SLTF), stochastic models are used. The starting addresses of I/0 requests to a file (non-paging) drum are modeled as random variables that are uniformly distributed about the circumference of the drum; the lengths of I/0 requests are modeled as random variables that are exponentially distributed. This model of I/0 requests is based upon measurements from an operational computer system. The arrival times of I/0 requests are first modeled as a Poisson process and then generalized to the case of a computer system with a finite degree of multiprogramming. Well-known resuits in queueing theory are sufficient for some models, but in other cases original approaches are required. In particular, a new model of the SLTF file drum is developed, is compared with previous models of the SLTF file drum as well as a simulation model, and is found to be a more accnreat model than previously available. Another practical problem that is discussed is an I/0 channel serving several, asynchronous paging drums. A new scheduling discipline is presented to minimize the total amount of rotational latency (and processing time) for an aribtrary set of N I/0 requests and the algorithm that is developed to implement this minimal-total-processing-time (MTPT) scheduling discipline has a computational complexity on the order of NlogN. The MTPT scheduling algorithm was implemented, and for more than three or four records, the most time-consuming step is the initial sorting of the records, a step also present in SLTF scheduling algorithms.
An updated multilayer printed wiring C-A-D capability
Authors: G. L. Ginsberg, C. R. Maurer, E. H. Whitley
Venue: Proceedings of the 6th annual Design Automation Conference (1969)

In 1966 the Communications and Electronics Division of the Philco-Ford Corporation developed a Computer-Aided-Design (C-A-D) Capability for multilayer printed interconnection wiring.1 At that time improvements were planned to enhance the efficiency and usefulness of the series of computer programs involved. Since then additions and changes have been incorporated which allow for the slope classifying of nets, provide data for the automatic generation of artwork, and adapt the series for use on revisions as well as original runs. This paper addresses itself to describing the scope of these additions and changes, how they were implemented, and the resulting effects on the overall C-A-D capability
3D Deformable Face Model for Pose Determination and Face Synthesis
Authors: Mun Wai Lee, Surendra Ranganath
Venue: Proceedings of the 10th International Conference on Image Analysis and Processing (1999)

This paper describes a scheme for pose determination and face synthesis using a deformable 3D face model. This model is a composite of three sub-models: edge model, color model and a wire frame model (WFM) which jointly describe the shape of the face and various facial features. The edge and color models are used for image analysis and the WFM is used mainly for face synthesis. We can project this 3D model onto different view planes based on three rotational parameters to generate 2D face templates for matching face images. After matching, the pose can be readily estimated. The composite face model is allowed to undergo complex deformation to handle face shape variations among different people. The WFM is incorporated into the model so that after matching, the WFM can be readily adapted to the image and image synthesis can be carried out. This technique can be used to analyze and synthesize face images over a wide range of poses.
The University Of Toronto Model Electronic Computer
Authors: R. F. Johnston
Venue: Proceedings of the 1952 ACM national meeting (Toronto) (1952)

The University of Toronto Electronic Computer Model (known as the UTEC Model), is a parallel binary digital machine, using a one-address code, 12-binary-digit words, 8 orders, and a 512-word Williams electrostatic store. Internal orders are carried out in 120 microseconds. Terminal equipment includes punched paper tape input, tape and typewriter output; a magnetic tape auxiliary store is to be added in the near future.
An operating system based on the concept of a supervisory computer
Authors: R. Stockton Gaines
Venue: Proceedings of the third ACM symposium on Operating systems principles (1971)

This paper appears in the March, 1972, issue of the Communications of the ACM. Its abstract is reproduced below. An operating system which is organized as a small supervisor and a set of independent processes are described. The supervisor handles I/O with external devices - the file and directory system - schedules active processes and manages memory, handles errors, and provides a small set of primitive functions which it will execute for a process. A process is able to specify a request for a complicated action on the part of the supervisor (usually a wait on the occurrence of a compound event in the system) by combining these primitives into a &ldquo;supervisory computer program.&rdquo; The part of the supervisor which executes these programs may be viewed as a software implemented &ldquo;supervisory computer.&rdquo; The paper develops these concepts in detail, outlines the remainder of the supervisor, and discusses some of the advantages of this approach.
Simulating the NASA Mass Data Storage Facility
Authors: Myron H. MacDougall
Venue: Proceedings of the 2nd symposium on Simulation of computer systems (1974)

The NASA/Houston Mass Data Storage Facility (MDSF) is a multi-computer system providing data storage and retrieval services to the Real Time Computer Complex (RTCC) of the NASA Mission Control Center in support of the Skylab program. A large scale simulation model of the MDSF has been developed. There are two major areas of use for this model. One is concerned with determining how to use the present MDSF most effectively in accomplishing its current applications. Here, use of the model includes studies of data structuring and allocation alternatives, scheduling techniques, application program organization, system configurations, and so forth. The second major area of use is concerned with analyses of potential MDSF hardware and software design changes. This paper begins with an overview of the structure and facilities of the model. The methods employed in the internal and external design of the model to meet the wide range of requirements for its use are described, and the problems of developing large scale computer system simulation models are discussed.
The chip layout problem: A placement procedure for lsi
Authors: K. H. Khokhani, A. M. Patel
Venue: Proceedings of the 14th Design Automation Conference (1977)

This paper presents a placement technique for allocation of logic gates to locations. The placement technique involves four different procedures, namely, constructive placement, linear assignment of signal I/Os, pairwise interchange, and wirability evalution. The constructive procedure generates an initial placement configuration by adjoining logic gates (vertices) to a subset (nucleus) of already placed gates on a chip. This is followed by linear assignment of signal I/Os. A neighborhood-biased pairwise interchange procedure improves the initial placement by minimizing the total conductor length, and also utilizes wirability evaluation as a placement selection criterion.
T01A-programming languages: T01A6-A proposed data type resembling the SIMULA 67 class
Authors: Thomas W. Christopher
Venue: Proceedings of the 2nd annual computer science conference on Program information abstracts (1974)

A structured data type resembling the class of SIMULA 67 is proposed. This dat a type, which may be efficiently implemented in more conventional programming languages, has the following features: (1) When an object of an instance of this type is allocated, an associated block of code is executed to initialize it. (2) Associated with instances of the data type are procedures which may (or must) be used to manipulate objects of the type. (3) Access to the variable components of an object from &ldquo;outside&rdquo; may be restricted. (4) Since there are no coroutine facilities, implementation of the data type is consistent with the use of a stack for procedure activations.
Some requirements for architectural support of software debugging
Authors: Mark Scott Johnson
Venue: ACM SIGARCH Computer Architecture News (1982)

Architectural support of high-level, symbolic debugging is described at three levels of abstraction: the user's view of desired debugging functionality, the debugger implementor's view of architectural requirements that support the functionality, and the computer architect's view of architectural features or attributes that implement the requirements. References are made where possible to computing systems that meet the requirements. The paper is written from the viewpoint of debugger implementors, and is addressed primarily to computer architects.
A logic simulation machine
Authors: M. Abramovici, Y. H. Levendel, P. R. Menon
Venue: Proceedings of the 19th Design Automation Conference (1982)

Special-purpose CAD hardware is increasingly being considered as a means to meet the challenge posed to conventional (software-based) CAD tools by the growing complexity of VLSI circuits. In this paper we describe the architecture of a logic simulation machine employing distributed and parallel processing. Our architecture can accommodate different levels of modeling ranging from simple gates to complex functions, and support timing analysis. We estimate that simulation implemented by the proposed special-purpose hardware will be between 10 and 60 times faster than currently used software algorithms running on general-purpose computers. With the available technology, a throughput of 1,000,000 gate evaluations/second can be achieved.
A master's degree in school computer studies
Authors: Phillip J. Heeler
Venue: Proceedings of the fourteenth SIGCSE technical symposium on Computer science education (1983)

Several papers have been written about the shortage of knowledgeable computer science teachers at the secondary and junior college level. Additional reports have been written describing workshops, courses, and various other methods to help reduce this shortage. See for example papers by Moursund, Dennis, Piorot and others in various publications by ACM and the proceedings of recent National Educational Computing Conferences.(l,2) Very few papers have reported on the existence of degree programs for teachers who are interested in developing the necessary background to teach computer science. Even fewer master's degree programs exist to help train teachers in computer science education. Moursund has described the master's degree at Oregon(3), Lykos has established a degree at Illinois Institute of Technology, and the University of Illinois has a degree for teachers.(2) This paper describes a unique master's degree program at Northwest Missouri State University. Details are given on the development and present status of the program. Also, several suggestions are indicated for possible future directions for such a program.
Piloting electronic mail in today's office environment
Authors: Bonnie A. Callender
Venue: Proceedings of the 1st annual international conference on Systems documentation (1982)

This paper is a review of the experiences of the authors with electronic mail and is based upon their use of two different electronic mail systems. The first part of the paper contains a review of the attributes of the commercial systems currently available. The second part of the paper is a review of the use of two different electronic mail systems. User response to the electronic mail systems tested is considered to be the key measurement in system acceptability and utilization. The users' expectations, attitudes and responses to the systems are examined. The final part of the paper is a recommendation of how to introduce a pilot electronic mail system into a technically oriented organization.
APL - a boon to budgeting
Authors: Beverly J. Spellman, M. Scott Downing
Venue: ACM SIGAPL APL Quote Quad (1982)

Recent clamor over the Federal budget of the United States brought the acronyms ZBB (Zero Based Budgeting) and POM (Program Objective Memorandum) into the spotlight again. The two APL financial applications discussed in this paper illustrate the difference between ZBB and PPBS (Programming, Planning, and Budgeting System) used to create Federal budgets. These applications also discuss the differences between a budget that must be cut and monitored to keep that cut and one that may be increased. The APL applications show how APL, through the assiduous selection of utilities, raw code, graphics, and &ldquo;off the shelf&rdquo; software is able to reduce programming time, produce professional looking reports, and prepare for Congressional briefings.
On the line breaking problem in text formatting
Authors: James O. Achugbue
Venue: Proceedings of the ACM SIGPLAN SIGOA symposium on Text manipulation (1981)

A basic problem in text formatting is that of determining the break points for separating a string of words into lines to obtain a formatted paragraph. When formatted text is required to be aligned with both the left and right margins, the choice of break points greatly affects the quality of the formatted document. This paper presents and discusses solutions to the line breaking problem. These include the usual line-by-line method, a dynamic programming approach, and a new algorithm which is optimal and runs almost as fast as the line-by-line method.
Contrasts in physical design between LSI and VLSI
Authors: William R. Heller
Venue: Proceedings of the 18th Design Automation Conference (1981)

In the last five years, there has been rapid growth in logic and memory chip circuit density. The number of different digital processors and the typical size of such processors has also grown. With all this growth, alternatives in VLSI design style as well as packaging have to be considered. These consist, on the one hand, of powerful automated placement and wiring routines, indispensable on large regular package images, and, on the other, of techniques facilitating rapid, interactive adaptation of functional logic design to the layout and interconnection of &ldquo;macros&rdquo; on large chips. Some results from study of each method are presented.
Williams tubes selection program
Authors: J. C. Chu, R. J. Klein
Venue: Proceedings of the 1952 ACM national meeting (Toronto) (1952)

Probably the most critical component in the Williams Memory System is the storage tube itself. It was originally supposed that ordinary cathode ray tubes, designed for use in oscilloscopes, would suffice for the storage element in this type of electrostatic memory but it soon became apparent that these tubes had two serious defects. First, they had impurities on the storage surface, and2 second, the focus of the electron beam was not sharp enough to allow repetitive consultation of one storage location without disturbing the surrounding information. These defects are opposite in nature so that the circuit parameter change that improves one of these conditions, aggravates the other. Thus, if the acceleration voltage is increased, the focus improves but the impurities become more troublesome.
Computer based strategies for clustering jobs
Authors: Patrick R. Pinto
Venue: Proceedings of the tenth annual SIGCPR conference (1972)

This paper is a review of some practical procedures for clustering jobs into homogeneous groups. The techniques are mainly statistical, and all have in common the collection of multivariate data on several jobs. Since the storage and processing requirements are well beyond the capabilities of any manual system of computation, I think it is appropriate that these procedures be reviewed before a group such as yours that has such a keen interest in using the computer in personnel research.
Statistical methods for improving simulation efficiency
Authors: Donald P. Gaver,  Jr.
Venue: Proceedings of the third conference on Applications of simulation (1969)

This paper describes a variety of statistical devices for improving the effectiveness of computer simulations of random processes. The methods are illustrated by examples from a queueing problem that is inadequately treated by conventional analytical theory.
Distinctiveness Maps for Image Matching
Authors: Roberto Manduchi, Carlo Tomasi
Venue: Proceedings of the 10th International Conference on Image Analysis and Processing (1999)

Stereo correspondence is hard because different image features can look alike. We propose a measure for the ambiguity of image points that allows matching distinctive points first and breaks down the matching task into smaller and separate sub-problems. Experiments with an algorithm based on this measure demonstrate the ensuing efficiency and low likelihood of incorrect matches.
Introductory computer science courses a modular design
Authors: Ivan M. Rosenberg
Venue: ACM SIGCUE Outlook (1976)

This paper proposes a set of assumptions about learning in general, followed by a set of assumptions concerning ICS courses in particular. Using these as a foundation, an ICS course content and structure is developed which clearly shows the relationships between the various branches of computer science, encourages a logical presentation, and is modular and hierarchical, permitting use for a wide variety of audiences and course objectives. Since content organization is only one aspect of a course, the method of presentation is also discussed, with emphasis on methodologies other than lecture.
Some experience with automated aids to the design of large-scale reliable software
Authors: B. W. Boehm, R. K. McClean, D. B. Urfrig
Venue: Proceedings of the international conference on Reliable software (1975)

This paper summarizes some recent experience in analyzing and eliminating sources of error in the design phase of large software projects. It begins by pointing out some of the significant differences in software error incidence between large and small software projects. The most striking contrast, illustrated by project data, is the large preponderance of design errors over coding errors on large-scale projects, not only with respect to numbers of errors, but also with respect to the relative time and effort required to detect them and correct them. The paper next presents a taxonomy of software error causes, and some analyses of the design error data, performed to obtain a better understanding of the nature of large-scale software design errors and to evaluate alternative methods of preventing, detecting, and eliminating them. Based on this analysis of observational data, a hypothesis was derived regarding the potential cost-effectiveness of an automated aid to detecting inconsistencies between assertions about the nature of inputs and outputs of the various elements (functions, modules, data bases, data sources, etc.) of the software design. This hypothesis was tested by developing a prototype version of such an aid, the Design Assertion Consistency Checker (DACC), using TRW's Generalized Information Management (GIM) system, and using it on a large-scale software project with 186 elements and 967 assertions about their inputs and outputs. Of the 121,000 possible mismatches between input and output assertions, DACC found 818, at a cost in computer time of $30. Most of the mismatches resulted from shortfalls in the initial version of DACC or the initial data preparation, such as a lack of a synonym capability and a lack of a explicit statements about external inputs and outputs. However, a number of serious mismatches were exposed at a time when they were easy to correct, and a most useful work-list generated of items needing resolution before allowing the design effort to proceed to further detail. In general, the data confirmed the hypothesis about the general utility of a DACC capability for large software projects. However, a number of additional features should be considered to compensate for current deficiencies (in areas such as manuscript preparation) and to fully take advantage of having the software design in machine-readable form.