ppxscal/embedding_network huggingface dataset:
SPURT - a Simulation Package for University Research and Teaching
Authors: Martin Goldberg, Benjamin Mittman
Venue: Proceedings of the second conference on Applications of simulations (1968)

One problem facing an academic program in computer and information sciences is how to teach the basic ideas of simulation without being overwhelmed by the requirements of presenting a complex simulation language. It is usually true that the student taking a simulation course has some prior knowledge of computer programming, quite often FORTRAN. Capitalizing on this fact, the Industrial Engineering and Management Sciences Department of Northwestern University has developed SPURT: a Simulation Package for University Research and Teaching. SPURT is written in FORTRAN. It provides the novice with basic subroutines required for simulation, and it provides the more advanced user with considerable capability. SPURT consists of a collection of FORTRAN subroutines and functions providing generators for various probability distributions, matrix and graphical output, list processing, and clock functions for controlling discrete time simulation models. SPURT was developed originally for the CDC 3400 and has been converted to the CDC 6400 and the IBM System/360. This paper discusses the objectives and design of SPURT and its features for discrete simulation. Examples of the use of SPURT for a typical freshman exercise, an advanced, multiprocessor system simulation and other applications are presented.
A project approach to structure and correctness in Pitt's second computer science course
Authors: Lawrence Yelowitz
Venue: ACM SIGCSE Bulletin (1978)

The introduction of software methodological issues, including correctness and structure, into the undergraduate curriculum is aided by the availability of software projects which are not overwhelming, but nonetheless, are sufficiently complex to warrant a disciplined approach. A project covering a &ldquo;commercial&rdquo; application is described here. The use and instantiation of abstract program schemas to a variety of contexts is illustrated, as is a sequence of incremental additions which preserve correctness at each stage. Fuller details and a more formal description of this project, as well as of a project implementing a propositional logic theorem prover, are found in [1]. As a first step in appreciating the general applicability of these software methodological issues, students should realize that these methodologies were used in fundamental ways in developing both projects.
A computerized production scheduling system
Authors: Robert G. Sargent
Venue: Proceedings of the 13th conference on Winter simulation - Volume 2 (1981)

A computerized production scheduling system is described that was developed to replace a manual system for scheduling production in a production subsystem consisting of one hundred seventy people and a considerable amount of expensive production equipment. This computerized system uses a deterministic simulator for scheduling production and requires large data bases.
A transistor operational d.c. amplifier
Authors: W. Hochwald, F. H. Gerhard
Venue: Proceedings of the 1956 11th ACM national meeting (1956)

The d.c. operational amplifier is the most important in the line of component building blocks used in an analog computer. Equipped with appropriate input and feedback networks, this amplifier is capable of voltage or current summation, integration and differentiation. Present day applications in airborne computer systems frequently demand accuracies of 0.01% or less while necessitating the utmost in ruggedization, reliability, and minimization of volume, weight and power consumption. To meet the accuracy requirements, drift stabilization by means of a low-drift carrier-type preamplifier is normally required. The amplifier discussed here employs this principle in a manner similar to that developed by the RCA Research Laboratories (Project Typhoon, 1947). To meet the requirements of airborne use, transistors may be ideally employed. While it is now possible to achieve the requirements using semiconductors throughout the amplifier, this paper covers an interim version which employs transistors in all but two critical portions of the circuitry.
Architecture of a VLSI multiple ISA emulator
Authors: J. L. Wilkes
Venue: Proceedings of the 17th annual workshop on Microprogramming (1984)

This paper describes the architecture of a microprogrammed processor currently under development that addresses specific program objectives. These objectives include system throughput, ISA flexibility and software transportability. The design project is at the stage of completion of the architecture and the initial stages of VLSI chip design. Three candidate ISAs are scheduled to be implemented in a prototype form in the near future. While it is too early to report on results as they relate to the objectives it is believed that the overall architecture will remain as described.
A software study using Halstead metrics
Authors: C. T. Bailey, W. L. Dingee
Venue: Proceedings of the 1981 ACM workshop/symposium on Measurement and evaluation of software quality (1981)

This paper describes an application of Maurice Halstead's software theory to a real time switching system. The Halstead metrics and the software tool developed for computing them are discussed. Analysis of the metric data indicates that the level of the switching language was not constant across algorithma and that software error data was not a linear function of volume.
The Computer Sciences Program at Purdue University
Authors: Sam D. Conte
Venue: Proceedings of the 1964 19th ACM national conference (1964)

The Computer Sciences Program at Purdue University was initiated in the Fall of 1962. It is predicated on the conviction that there is a rapidly expanding body of knowledge centered about the computer which is capable of development into a science of computing, that there is a clear and urgent need for programs in the Computer Sciences, and that the development of such programs will hasten progress towwards a Theory of Computation. The Computer Sciences Program at Purdue is administered by a Department of Computer Sciences, one of 3 departments in the Division of Mathematical Sciences. The location of this program in the Division of Mathematical Sciences is a reflection of our belief that Computer Sciences as a discipline is more closely related in methodology and philosophy to mathematics than to any other discipline. This belief is strengthened by the clear evidence that the leaders in research and development in computing today were largely trained as mathematicians. The formation of a separate department of Computer Sciences to administer this program is a recognition of the fact that substantial difficulties arise when such programs are organized within the framework of an existing department. These difficulties center around the problems of attraction and promotion of faculty members, the relative expense of such programs, the interdisciplinary nature of Computer Sciences, and the administrative problems of servicing large numbers of students with various types of backgrounds.
Tagged architecture and the semantics of programming languages: Extensible types
Authors: E. A. Feustel
Venue: Proceedings of the 3rd annual symposium on Computer architecture (1976)

This research note suggests that before we design hardware or software for the task of problem solving, we re-evaluate the task of problem solving in terms of the linguistic constituents which will be required and the manner in which these linguistic constituents will be combined. Utilizing the principles of composition and abstraction-to-specifics, we conclude that all data and programs might be realized in a structured format called messages. We conclude with a few preliminary thoughts and questions as to how an architecture designed for such structured operands and operators might be designed.
A diversified undergraduate computer science program
Authors: Richard Cheng
Venue: ACM SIGCUE Outlook (1976)

This paper introduces a set of unique undergraduate computer science programs, some of which have been operating for more than two years at Rochester Institute of Technology. These programs are intended to meet current computer science manpower demands where as a generalized computer science curriculum is not sufficient to cover the range of students required by such demands. As is shown in Figure 1, the set of programs extend from a general computer science curriculum to cover several quasi-specialized areas.
Factors related to EDP personnel commitment to the organization
Authors: Kathryn M. Bartol
Venue: Proceedings of the 1977 annual conference (1977)

This paper investigates the relationship between organizational commitment and five dimensions of job satisfaction, as well as the relationship between commitment and several personal variables, for a sample of EDP personnel. Results show a strong positive relationship between job satisfaction and organizational commitment for all five satisfaction dimensions under investigation. Several personal variables, position level, years working in the computer field, and income, also were significantly and positively related to organizational commitment.
Computer Organization
Authors: Ronald Smith
Venue: Proceedings of the third annual computer personnel research conference (1965)

The Computer Personnel Research Group has processed a considerable amount of data, studied the information and with obvious enthusiasm and drive presented a Conference last year which has given a considerable service to this Computer decade. Some of the ideas last year have been developed by our Company but we do feel the environment, experience and type of organization imposed by the Computer Executives has a considerable effect upon the kind of results given in the Programmer Performance Prediction Study. When talking on Computer Organization I am describing our Service Bureau which already exists and on which the C.P.R.G. has had its effect. In setting up the first family commercial computer station in Great Britain we believe we have automatically overcome some of the prime programming psychological problems.
An interactive testability analysis program - ITTAP
Authors: D. K. Goel, R. M. McDermott
Venue: Proceedings of the 19th Design Automation Conference (1982)

ITTAP is a testability analysis program developed at the ITT-LSI technology center. In this paper we describe a testability measure for the test length and discuss the use of the selective trace concept for testability calculations. It is shown that ITTAP provides an order of magnitude improvement in run time over existing programs like SCOAP.
ADONIS a dynamic APL interactive package for multivariate analysis
Authors: Josiane Confais, Sylviane Bonnefous, Jean Brenot
Venue: ACM SIGAPL APL Quote Quad (1982)

ADONIS is a portable data analysis package using the interactive facilities of APL. The system consists of modules which can be easily connected to investigate fastly and progressively the data set. The modules are multivariate analysis oriented and emphasize french practices. The dynamic organization of the system makes it easy to introduce new options. The package is described, a complete documentation is available.
A conceptual approach to document retrieval
Authors: E. Barbi, F. Calvo, C. Perale, F. Sirovich, F. Turini
Venue: ACM SIGOA Newsletter (1984)

A document retrieval system is a quite useful tool in office environments, expecially for professionals who are interested in keeping along with the state of the art of their field by quickly consulting documents. The paper describes the design and the implementation of a document retrieval system based on a concept extraction from documents. Concept extraction is implemented using an internal knowledge representation (semantic network memory) of the subject the documents deal with retrieving concepts from a text is performed by search/inferential algorithms. Advantages of such methods are shown by comparing it to keyword extraction. The prototype system implementation is described. This system is actually in experimental phase. Several test descriptions provide a sketch of the first results.
IBM 4341 hardware/microcode trade-off decisions
Authors: James R. Kleinsteiber
Venue: ACM SIGMICRO Newsletter (1980)

The design of IBM's 4341 Processor, as with other processors, involved many cost/performance tradeoffs. The designer is continually under pressure to increase processor speed without increasing cost or to decrease processor cost without decreasing performance. This paper will examine some of the engineering decisions that were made in the attempt to make the 4341 a high-performing yet low cost processor. These decisions include searching for, or developing, algorithms that make the best use of hardware properties, such as data path width, arithmetic/logical operations and special functions. Functions were sought such that a small amount of added hardware would go a long way towards improving system performance. Hardware designers, microcoders and performance analysis people worked together to implement instructions, functions and algorithms with the proper mixture of hardware functions and microcode in order to build a viable processor. Some specific functions will be covered to examine a few of the decisions. The TEST UNDER MASK performance problem will be discussed with its resulting implementation decision. The method of using EXCLUSIVE OR to clear storage and the resulting algorithm design will be shown. Other topics to be discussed include multiple hardware functions and the resulting effect on floating point, fixed point and decimal multiply; the divide function and its effect on floating point and fixed point divide; and the effect of an 8-byte data path for decimal arithmetic.
Explicit parallelism in LISP-like languages
Authors: Gianfranco Prini
Venue: Proceedings of the 1980 ACM conference on LISP and functional programming (1980)

We introduce a LISP-like language whose parameter passing mechanism and control primitives allow for the creation and the synchronization of an arbitrary number of concurrent computations. The parameter passing mechanism is a parallel version of call-by-need: an argument of a function is evaluated only the first time the value of the corresponding formal parameter is needed during the evaluation of the function body, but such an evaluation is only initiated by-need and is then performed in parallel with all the other computations. Some primitives allow the user to initiate new computations explicitly and to check/wait for the termination of already initiated computations. Several examples illustrate how classical problems in multiprogramming have natural and elegant solutions using parallel call-by-need and the above mentioned primitives.
Symbolic and algebraic manipulation for solving differential equations
Authors: Paul J. Ossenbruggen, Andrew K. C. Wong, Tung Au
Venue: Proceedings of the 1971 26th annual conference (1971)

Two symbolic and algebraic manipulation programs written in LISP 1.5 are presented for the solution of differential equations. The program LORDE is based on an exact method for solving higher order linear differential equations with constant coefficients and linear boundary conditions. The program TRIALSOLUTIONS is based on a variational technique for testing and evaluating assumed trial solutions of linear elliptical partial differential equations with variable coefficients. The formula pattern recognition and formula manipulation techniques are discussed, and examples are presented to illustrate the problem solving capabilities of these programs.
The application of associative processing in discrete simulation
Authors: Jeffrey L. Posdamer, Robert G. Sargent, P. Bruce Berra
Venue: Proceedings of the 5th conference on Winter simulation (1971)

The associative memory is a digital storage device in which all words can be simultaneously accessed and compared to a search argument. The associative processor is an extension of the associative memory which adds the capability for arithmetic operations within all words simultaneously. This paper will discuss the effects of the associative processor on each of the steps of discrete simulation. Specific topics discussed will include model construction, programming, running the simulation and data analysis.
An integration of two language understanding methodologies
Authors: Philip R. Cohen
Venue: Proceedings of the 1974 annual conference - Volume 1 (1974)

This paper describes an attempt at integrating two existing methodologies to form a natural language understanding system, and at evaluating 1.PAK, an AI language developed at the University of Toronto. The design of this prototype version is based upon Fillmore's case grammar representation and Charniak's scheme for organizing routines to update a semantic network memory. Two essential components of such a system, an English parser and generation routine, have been developed separately and are not covered here, apart from describing their interfaces with the rest of the system. The system performs semantic disambiguation and deduction via demons and base routines, as in Charniak's thesis. Simple question-answering facilities are also available and planned extensions to this facility will encompass the consequent theorem methodology of PLANNER.
Simulation, mathematical modeling and optimization in industrial design: When and how to apply it?
Authors: R. F. Garzia, P. H. Schmidt, M. R. Garzia
Venue: Proceedings of the 12th conference on Winter simulation (1980)

With the current technology, optimization has become a feasible and profitable avenue for problem solving in industrial design. This in turn brings simulation and modeling into the design process in order to obtain a mathematical description of the process in question. This paper addresses the problem of &ldquo;When and How to Apply Optimization in Industrial Design?&rdquo;. In addition, it reviews the most common optimization algorithms and how they should be selected. Furthermore, some of the common optimization packages are discussed. Four industrial applications are briefly studied. The first two are in the area of simulation, in particular, the simulation of a foundry and a computer workload simulation. The other two examples deal with optimization. The first of which develops an algorithm for economic tube grouping and the second one discusses the optimization of a boiler's circulation system.
A model for estimating program size and its evaluation
Authors: Minoru Itakura, Akio Takayanagi
Venue: Proceedings of the 6th international conference on Software engineering (1982)

Estimation of the size and time required for software development is probably the most difficult aspect of any project. Up to now, most estimates have been done subjectively by experts. These estimates are often inaccurate. In the midst of development, faulty estimates may contribute to delays and/or excess expenses. In the last several years, several estimation have been proposed, most of which were models to estimate software development cost {manpower). These models used program size as a variable. However at the beginning of development, when estimations are made, program sizes are usually uncertain and costs (manpower) are equally uncertain. The authors developed a program-size estimation model for batch programs in a banking system, and used the model in an actual project. Using the adapted model, estimation errors amounted to only 7 percent. This is much better than the accuracy of estimtions made by experts in the field (usually about 10 percent accuracy), and indicates that objective estimation methods can be derived for program-size. In this paper, we introduce our estimation model and discuss the adaptation of that model for a specific project.
A summary of architectural involvement with computers
Authors: C. James Olsten
Venue: Proceedings of the 8th Design Automation Workshop (1971)

The architectural profession is generally considered by its members to be engaged in the practice of an art and as such has resisted for a time the application of computer aids to the design process. This process is concerned with the organization and specification of the built environment which houses man for work or pleasure. For those in architecture familiar with the computer, the pace of the profession's involvement has been slow. This paper covers some of the past developments that have produced the current state of the art. Questions concerning the methods and costs of utilizing technology in design are now being answered. Conferences and workshops such as this one are restructuring the profession's concern; how can the designer integrate available techniques into his personal design approach? This is the major question remaining for architecture.
An integrated computer aided design system for gate array masterslices: Part 1. Logic reorganization system LORES-2
Authors: Chiyoji Tanaka, Shinichi Murai, Shunichiro Nakamura, Takuji Ogihara, Masayuki Terai, Kozo Kinoshita
Venue: Proceedings of the 18th Design Automation Conference (1981)

The outline and the application results of a computer aided logic design system which combines automatic translation of TTL SSI/MSI logic into gate array logic, human intervention, auxiliary logic simulation, and automatic documentation are described. Automatic translation of logic circuit is done by macro expansion technique coupled with redundant logic reduction procedures.
Introduction to the SYMBOL 2R programming language
Authors: Hamilton Richards,  Jr., Charles Wright,  Jr.
Venue: Proceedings of the ACM-IEEE symposium on High-level-language computer architecture (1973)

The SYMBOL programming language (SPL) is not only an important feature of the SYMBOL 2R Computer System, but also was the starting point for the design of the system. SPL was designed as a general-purpose, higher-level programming language. After the language design was completed, the hardware of the SYMBOL computer was then designed to provide a hardware implementation of the language. This paper is intended primarily to provide a general overview of SPL as context for the companion papers (1,3,6). The reader is referred to (5) for a complete description of SPL, to (2) for a discussion of the design decisions involved in the creation of SPL, and to (4) for an overview of the entire SYMBOL project.
Cell kinetics and CELLISM
Authors: Charles E. Donaghey
Venue: Proceedings of the 7th conference on Winter simulation - Volume 2 (1974)

In the field of cell cycle kinetics there have been a number of computer simulation models that have been developed and reported in the literature (1), (2), (3). CELLSIM is a cell kinetics simulation system which is intended to solve these problems. The user interfaces to the system through a simple problem-oriented language which uses the conventions and the vocabulary common to the cell biologist.
What should we expect from our users?
Authors: Virginia K. Patterson
Venue: Proceedings of the 3rd annual ACM SIGUCCS conference on User services (1975)

What should we expect from our users? I was at Toronto and listened very carefully, but little was said about defining the user's responsibility to the Computing Center in return for the use of the facilities. After twelve years as an active programmer and consultant, I have some definite ideas about this matter. Our consulting role has been gradually changing. Some of our difficulties come from our basic policy changes which have happened over a period of years. Formerly there was need to offer more individualized service. Software and documentation were much less sophisticated; grants enabled a good part of our services to be free to the computing community. This paper will define what some of our expectations should be from our users and will note some attempts we are making at the University of Tennessee to help users recognize and achieve these expectations. I should also like to explore other techniques to bring about user competence and cooperation.