ppxscal/embedding_network huggingface dataset:
WIDAS - Wiring Diagram Assembly System
Authors: Michio Tokunaga, Tooru Kurosaki, Mitsuyuki Masui, Chikai Ii, Fujio Otake
Venue: Proceedings of the 10th Design Automation Workshop (1973)

Totsuka, Kanagawa, Omika and Musashi Works of Hitachi Limited have developed CAD (Computer Aided Design) systems for electronic parts and equipment. Also Hitachi Central Laboratory and Hitachi Laboratory, which are engaged in basic and application research, have developed CAD systems for other purposes. As these systems are designed exclusively for particular products and research objects, it is difficult to describe a representative CAD system of Hitachi Limited. This paper describes the WIDAS, which is one of the subsystems of the CAD system developed by the Totsuka Works for ESS (Electronic Switching System).
Simulating modular microcomputers
Authors: Frank J. Langley, Gerald A. LaGro, Joan Sheehan
Venue: Proceedings of the 11th annual symposium on Simulation (1978)

The commitment of microprocessor-based system configurations to detailed logic design and breadboard fabrication traditionally results in a costly development cycle. This paper reports on the use of a computer design high-order-language (HOL) to simulate micro-computer functional elements, &ldquo;macromodules&rdquo;, at the register level, and verify the timing and interface requirements for a family of microcomputer configurations. The definitions of these microcomputer macromodules (i. e., microprocessors, memories, and input-output interface modules) was the outcome of requirements derived through previous system analyses and simulation work, reported in References 1 through 5, sponsored by the Office of Naval Research. Of the several choices of computer architecture simulation/emulation methods available (References 6 through 11), the technique adopted provided the necessary level of simulation required to verify the timing, interface and data flow within and between macromodules in the family, for subsequent system performance simulations. Further, the discrete logic, module-level simulation work described formed the necessary link between system design and ultimate hardware description for a low-cost, step-by-step design process. Writing and executing the module simulations provided a disciplined approach to hardware design, since all aspects of the components had to be implemented in order to follow and time the flow of data through any given microcomputer configuration. Lastly, since the language used was the most practical available language, its strengths and weaknesses were determined in the context of state-of-the-art LSI technology.
A structured specification of a hierarchical operating system
Authors: Ashok R. Saxena, Thomas H. Bredt
Venue: Proceedings of the international conference on Reliable software (1975)

This paper applies the concepts of hierarchical levels of abstraction and structured programming to the design of a large program system. An operating system for a multi-processor installation is specified that supports a large number of concurrently active processes and provides a virtual store for them. The specification is in an extended version of PASCAL, a high-level language.
Methods for Dynamic Classifier Selection
Authors: Giorgio Giacinto, Fabio Roli
Venue: Proceedings of the 10th International Conference on Image Analysis and Processing (1999)

In the field of pattern recognition, the concept of Multiple Classifier Systems (MCSs) was proposed as a method for the development of high performance classification systems. At present, the common operation mechanism of MCSs is the combination of classifiers outputs. Recently, some researchers pointed out the potentialities of dynamic classifier selection as a new operation mechanism. In a previous paper, the authors discussed the advantages of selection-based MCSs and proposed an algorithm for dynamic classifier selection. In this paper, a theoretical framework for dynamic classifier selection is described and two methods for selecting classifiers are proposed. Reported results on the classification of different data sets show that dynamic classifier selection is an effective method for the development of MCSs.
An optimum channel-routing algorithm for polycell layouts of integrated circuits
Authors: B. W. Kernighan, D. G. Schweikert, G. Persky
Venue: Proceedings of the 10th Design Automation Workshop (1973)

This paper presents an algorithm for finding optimum routings for interconnection paths in a channel between two parallel rows of circuit cells. The algorithm, although based on branch and bound, has provided optimum routings for circuits with 50 to 60 nets in a minute or two of computing.
Computational complexity of computing polynomials over the fields of real and complex numbers
Authors: V. Ya. Pan
Venue: Proceedings of the tenth annual ACM symposium on Theory of computing (1978)

Fast computation of polynomials of 1 variable in the fields R and C of real and complex numbers is considered. The optimal schemes of computation with preconditioning (that is, the schemes involving the minimal number of arithmetic operations without counting preliminary treatment of coefficients) for evaluation in C are presented. The schemes which are close to optimal ones are presented for evaluation in R. The difference between the complexity of computation in R and in C is established. A new generalization of the problem is presented.
Gathering and analyzing data from a computer system: A case study
Authors: H. D. Schwetman
Venue: Proceedings of the 1975 annual conference (1975)

The Purdue Dual-MACE operating system has been equipped with a software event-recording facility. This facility provides a detailed view of the dynamic behavior of the system in operation in addition to more traditional statistical summaries. This paper describes the facility and discusses its cost of operation, limitations, and uses. The data gathering facility has been used both to support development and improvements in the operating system and by operating systems researchers. It can be concluded that while there are costs associated with the operation of the facility, the benefits which are derived from prudent use of the facility outweigh these costs. Examples of the output of the facility are included.
Dynamic and deductive fault simulation
Authors: A. Miara, N. Giambiasi
Venue: Proceedings of the 15th Design Automation Conference (1978)

In this paper, the authors present an extension of a dynamic logical network simulation to a dynamic deductive fault simulation. In this paper, we present a model which allows the dynamic propagation of both logical transitions and fault lists. An convenient algorithm has been deduced from this model. Its implementation gives a simple and efficient simulation called &ldquo;SIMDE&rdquo;. Finally, an example will be given to illustrate the propagation procedure.
Visual interactive production language systems
Authors: Patrick W. Ireland, Herbert V. Savage, Earl J. Schweppe
Venue: Proceedings of the first SIGMINI symposium on Small systems (1978)

In earlier work on anticipation and prompting systems for programming languages it was recognized that a more formal approach to development of such interactions with programmers at display terminals was needed. It was observed that the bulk of the data involved in these interactions was in the displays themselves and that certain display drivers operated on action strings similar to those in production language systems. The development of special Floyd-Evans production languages oriented toward a visual interactive environment was therefore undertaken. Based on two experimental interpreters which have been implemented, the language itself has now been substantially refined and compilers for a common language have been designed with one being implemented. In the first implementation which was accomplished on a Datapoint 2200, a substantial portion of the effort was devoted to a pedagogic display of the parsing process. In the second implementation on an Interdata 85, all of the programming was made reentrant so that multiple users can be served using the same or different target languages. Furthermore, some of the basic functions were reduced to microcode, although it was not possible to carry this as far as had been hoped. It was also learned during development of the second system that left-part matching and right-part replacement could be treated as generalized actions&mdash;thus simplifying the internal structure of the interpreter. Development of these systems is part of ongoing research with programming languages and automated programmer assistance.
An approach to the introductory computer science course for non-majors
Authors: Robert N. Cook
Venue: Proceedings of the eighth SIGCSE technical symposium on Computer science education (1977)

The course described in this paper is intended for students who are not majoring in computer science or mathematics. In a typical semester students majoring in such diverse fields as dietetics, sociology, psychology, elementary education, accounting, broadcasting, physical education, music, industrial technology, english, business administration, chemistry and secretarial science are enrolled in the course. Virtually the only common element in the background of the students enrolled in the course is their lack of a previous university course in either mathematics or computer science. The highest level of mathematical education that may be expected is first year high school algebra; occasionally even that expectation is too high. 4 For students with this background many of the available textbooks are not satisfactory. This paper will attempt to further clarify the nature of the course by stating its objectives, by discussing the choice of a language for the course, by discussing what topics normally included in available textbooks are not desirable, and finally by suggesting topics which are desirable in an introductory course for non majors.
Integrated Designer's Activity Support System for Architecture
Authors: Hideo Matsuka, Toshihiro Kawai, Sakae Uno
Venue: Proceedings of the 12th Design Automation Conference (1975)

This paper presents the Integrated Designer's Activity Support System for Architecture (IDAS-A), a man-machine system experimentally developed for use by a designer/engineer in the preliminary building design area. New concepts introduced in organizing this system are those of &ldquo;Status and Flow&rdquo; and &ldquo;Milestone&rdquo;, which allow the designer to perform a full latitude of design activities. For effective storage of the building data which is designed in 2 dimensional space, the relational data base is adopted. Also, special supervisor has been developed to handle many application programs dynamically and to control the interaction between man and machine flexibly.
The Burroughs B1800 microprogrammed measurement system: A hybrid hardware/software approach
Authors: W. Michael Denny
Venue: Proceedings of the 10th annual workshop on Microprogramming (1977)

Traditional computers are not usually effective assistants in their own measurement. It is cost-prohibitive to dedicate much of the hardware to measurement. And, when any is dedicated, it is usually too rigidly attached to the hardware itself to follow the rapidly changing software structures. Software measurement tools, on the other hand, often exhibit overhead penalties and usually remain tools for a few elite &ldquo;system&rdquo; programmers. The majority - programming in &ldquo;non system&rdquo; languages like COBOL, FORTRAN, and RPG - look to these &ldquo;experts&rdquo; for analysis of their own programs' performance. The B1800 utilizes a hybrid measurement approach which retains many of the advantages of traditional hardware and software monitoring while avoiding the rigidity of hardware-only measurements and the overhead of software-only measurements. This hybrid system is easily implemented in ordinary high level languages like COBOL, RPG, and FORTRAN and easily used by non-system programmers.
Computational experience with the Central Cutting Plane Algorithm
Authors: Jack Elzinga, Thomas G. Moore
Venue: Proceedings of the ACM annual conference (1973)

The Central Cutting Plane Algorithm is an algorithm for solving the convex programming problem. Its convergence and other properties have been established elsewhere [2,6]; here, we will state, but not prove, the major theoretical results concerning the algorithm. The purpose of this presentation is to report some preliminary computation al experience with an experimental code of the algorithm.
A simple approach to the empty generalized APL arrays
Authors: Ziad Jamil Ghandour
Venue: Proceedings of the eighth international conference on APL (1976)

An important problem in a general APL which includes arrays of arrays is the proper definition of the primitive operators and functions on arguments which are empty arrays, or leading to results that are empty, or results indirectly related to empty arrays. Two major approaches to handle empty arrays are possible. The first allows empty arrays to have structures like other arrays, and the second collapses all empty arrays to simple arrays, that is, any empty array has structure consisting of the size of the array only. The first approach imposes inconveniencies on the users because of the nonintuitive nature of computation of the structure of empty arrays. The second approach avoids the above complexities. This paper demonstrates the feasibility of the second approach by defining functions and operators on empty arrays in a consistent, useful, and convenient manner. The examples in the paper were obtained from a formal definition in APL of the above concepts.
Delay and power optimization in VLSI circuits
Authors: Lance A. Glasser, Lennox P.J. Hoyte
Venue: Proceedings of the 21st Design Automation Conference (1984)

The problem of optimally sizing the transistors in a digital MOS VLSI circuit is examined. Macromodels are developed and new theorems on the optimal sizing of the transistors in a critical path are presented. The results of a design automation procedure to perform the optimization is discussed.
Engineering applications II: Phase plane studies by use of digital computers
Authors: O. Gurel
Venue: Proceedings of the 1962 ACM national conference on Digest of technical papers (1962)

LET US CONSIDER the following set of two differential equations of the first order: dx/dt &equil; P(x, y; &zgr;k), dy/dt &equil; Q(x, y; &zgr;k), (1) where &zgr;k (K &equil; 1, 2, . . . , n) is the number of parameters. Functions P and Q may be nonlinear with respect to the variables x and y. For a dynamic system, x is the displacement and y is the velocity. Dividing dy/dt by dx/dt the time variable, t, can be eliminated from equation (1) yielding the first order equation dy/dx &equil; Q(x, y; &zgr;k)/P(x, y; &zgr;k).(2) Solutions of this differential equation plotted on the phase plane are called trajectories with a closed trajectory named a limit cycle. In the present study plots of these trajectories are generated automatically by use of a digital computer. Several illustrative examples will be given in this paper.
Flexible building of specialized information retrieval systems application to the management of APL functions as a programming aid
Authors: Jean-Claude Pages, Anne Mauboussin
Venue: Proceedings of the sixth international conference on APL (1974)

This paper describes an Information Retrieval system designed as a flexible &ldquo;kit&rdquo; in order to build various specialized and personalized information retrieval systems more easily. All these systems (including of course the &ldquo;father system&rdquo;) are based upon free-text descriptions of the objects handled in a given application. For each word chosen as a keyword, the user can give synonyms and enter a definition; in each definition itself, keywords can also be defined, and so on... This defining procedure, recursively available to any depth within the same entry function, is the main source for the thesaurus capabilities of the system. A new approach to Computer Assisted Instruction is described as a consequence of these facilities to build and to manage individualized IR systems. By applying an early version of the system to its own functions, we obtained an on-line updating tool for the development of the application, issuing easily updated write-ups as well as supporting interactive consultation. These facilities are now available for the development of other packages, completely unrelated to the system.
Automatic programming and compilers II: The FORAST programming language
Authors: L. W. Campbell
Venue: Proceedings of the 1962 ACM national conference on Digest of technical papers (1962)

FORAST is a programming language that has been implemented on BRLESC and ORDVAC. Designed for and used primarily by BRL's professional programmers, it is a problem-oriented language that is closer to a good machine language than most problem-oriented languages. The design objectives for FORAST were: (1)&mdash;fast translation and load and go operation, (2)&mdash;to allow full usage of machine's capabilities, (3)&mdash;efficient object programs, (4)&mdash;to fit translator in a 4096-word memory, (5)&mdash;human readability, (6)&mdash;primarily for mathematical problems, and (7)&mdash;compatability between BRLESC and ORDVAC.
Energy forecasting and simulation models
Authors: John C. Sweeney
Venue: Proceedings of the 10th conference on Winter simulation - Volume 2 (1978)

This paper will present a review of the main methodologies used in constructing energy simulation and forecasting models. The models to be discussed will include: (1) Econometric Models (2) Optimizing Models (3) Structural Models (4) Time Series Models A discussion of the various model limitations and problems will also be included in the paper.
Effects of channel blocking on the performance of shared disk pack in a multi-computer system
Authors: Abbas Raffi
Venue: ACM SIGSIM Simulation Digest (1979)

In a multi-computer environment where several computers share packs of disk drives, the architecture of the disk controller can have significant effect on the throughput of the disk pack. In a simple configuration a controller can allow access to only one disk in the pack at a time, and effectively block other channels from accessing other disks in the pack. A desirable alternative is to be able to access different disks of the same pack simultaneously from different channels. Motivated by the presence of a mixed hardware in an installation to support both configurations, an attempt is made to model each system and produce analytical and simulation results to compare their relative performances. It is predicted that under the prevalent conditions in the installation, a complete switchover to either system should not give rise to significant performance change.
A tool that detects plagiarism in Pascal programs
Authors: Sam Grier
Venue: Proceedings of the twelfth SIGCSE technical symposium on Computer science education (1981)

Plagiarism has become a problem in introductory Computer Science courses. Programmed assignments can be copied and transformed with little human effort. A pertinent recommendation has resulted from this realization; an on-line system to detect programs that are &ldquo;too similar&rdquo; and hence suspected of plagiarism should be developed [4]. This paper discusses such a system for Pascal programs.
Firmware versus software verification
Authors: S. Budkowski, P. Dembinski
Venue: Proceedings of the 11th annual workshop on Microprogramming (1978)

The paper presents an uniform framework in which the firmware verification problem can be reduced to the software one. It is shown how to transform the control memory (ROM) content into a microprogram written in the specially designed language MIDDLE and what kind of information has to be included in the hardware documentation in order to make the transformation possible. Once such a microprogram is found, different software methods of verification, outlined in the paper, can be applied.
&ldquo;Computers and the law&rdquo;: A course description
Authors: Philip Koltun
Venue: Proceedings of the tenth SIGCSE technical symposium on Computer science education (1979)

This paper surveys current legal issues in the computer field and discusses the author's experience in twice teaching a course on computers and the law at Sangamon State University. Legal topics highlighted in the course include databanks and privacy; contracting for computer services; protection of proprietary software; tax treatment of computer software; liability problems in providing computer services; government regulation of the computer and communications industries; and the Justice Department's anti-trust suit against IBM. Teaching approaches for the non-lawyer are discussed and a bibliography is included. The primary purpose of this paper is to discuss the author's experiences in teaching, for the second time, a course at Sangamon State University, Springfield, Illinois, entitled &ldquo;Legal Issues in the Computer Field,&rdquo; and thereby stimulate interest in organizing similar courses at other universities. In addition, the author surveys the many topics that comprise the course content, and includes an abbreviated bibliography as an appendix.
Switch-level delay models for digital MOS VLSI
Authors: John K. Ousterhout
Venue: Proceedings of the 21st Design Automation Conference (1984)

This paper presents fast, simple, and relatively accurate delay models for large digital MOS circuits. Delay modeling is organized around chains of switches and nodes called stages, instead of logic gates. The use of stages permits both logic gates and pass transistor arrays to be handled in a uniform fashion. Three delay models are presented, ranging from an RC model that typically errs by 25% to a slope-based model whose delay estimates are typically within 10% of SPICE's estimates. The slope model is parameterized in terms of the ratio between the slopes of a stage's input and output waveforms. All the models have been implemented in the Crystal timing analyzer. They are evaluated by comparing their delay estimates to SPICE, using a dozen critical paths from two VLSI designs.
MADMAN machine
Authors: J. S. Hutchison, W. G. Roman
Venue: Proceedings of the fourth workshop on Computer architecture for non-numeric processing (1978)

A back-end data base machine is discussed in which the back-end is closely coupled to the host system as an intelligent I/O device. The design of the hardware and software is such that the data base disks can be on either the host or back-end computers. The design is motivated by memory size considerations on mini-computer systems and also by cost considerations of large disks. The implementation of such a system on PDP-11s is discussed.
CONSIM(Conflict Simulator): Risk, cost and benefit in political simulations
Authors: Joe Clema, John Kirkham
Venue: Proceedings of the 1971 26th annual conference (1971)

The development and use of CONSIM (Conflict Simulator), a computer program designed to heurististically simulate decision making, is described. A typical example is used to evaluate and analyze the methodology of CONSIM. The simulation model is designed for two political opponents, each possessing any finite number of alternatives. The model is constructed utilizing techniques frequently employed in game theory. Probabilities are assigned, using a Bayesian Approach, to sets of alternatives available to the United States and China. Incorporated into the model is the capability of varying the probabilities as the Vietnam Conflict evolves and the re-evaluation of risks, costs, and benefits occurs. CONSIM is easy to use and applicable wherever probabilities may be assigned to each alternative in a mutually exclusive and exhaustive set of alternatives in a dynamic situation.