ppxscal/embedding_network huggingface dataset:
CMS/1 - a corporate modeling system
Authors: Robert F. Zant
Venue: Proceedings of the 6th conference on Winter simulation (1973)

Past efforts in the area of corporate modeling have demonstrated the need for &ldquo;problem-oriented&rdquo; languages which would facilitate the construction of corporate models. CMS/1 is a discrete-state simulation system designed for use in corporate modeling. It is composed of three languages - a control language, a logic/data specification language, and a report format specification language. Among the features of CMS/1 are 1)the user specification of each variable's name and meaning, 2)the capability of &ldquo;grouping&rdquo; variables, 3) the ability to execute a logic module both as a deterministic model and as a stochastic model, and 4) the ability to transfer the values of variables from one model to another. This paper describes some of the design concepts of the system and presents some examples which illustrate its capabilities.
The non-technical person as technical writer/editor and documentation for the computer illiterate
Authors: Rita Seplowitz Saltz
Venue: Proceedings of the 3rd annual ACM SIGUCCS conference on User services (1975)

University computer center personnel know there is no dearth of documentation designed for the expert. Control Data, UNIVAC, DEC&mdash;;even IBM&mdash; paper and fiche all possible areas. IBM's latest Marketing Publications KWIC Index alone contains 60 pages (double columns, reduced print) of titles...an ample supply of words, even for rabid manualpeople. No, the documentation problem which faces User Services groups in academic installations is how best to provide information to the non-expert: the new, naive user; the pseudo-sophisticate who comes on strong with highly-specialized terms like &ldquo;keypunch&rdquo; and &ldquo;listing&rdquo;, the Director of User Services&mdash;in other words, the various types of true computer illiterate This paper respectfully suggests that it is possible to employ a person with no technical training as a technical writer/editor within a university computer center environment, and that such an individual can prove amazingly effective in helping User Services to attack this sometimes menial, always demanding task.
ECSS - an Extendable Computer System Simulator
Authors: Norman R. Nielsen
Venue: Proceedings of the third conference on Applications of simulation (1969)

An important aid in the construction of a complex computing system or network is a simulation model for analyzing and evaluating various design approaches. Unfortunately, the programming and debugging effort associated with the development of such a simulator all too often renders the project impractical. Accordingly, ECSS has been designed and specifically tailored to surmount these difficulties. Further, it is built as an extension of Simscript II, so that the full power of a general purpose simulation language is available to the user for unique features or special requirements.
Computers and science education: Issues and progress (Presentation Abstract)
Authors: Joseph Lipson
Venue: Proceedings of the ACM 1980 annual conference (1980)

Unless a systematic plan for the use of computers in education is jointly developed by educators, business and the government, our technological leadership will be seriously affected. Such a loss of leadership would harm our economic strength, our defense capability and the quality of life in general. For example, new job opportunities will increasingly fall in the field of knowledge production. Unless we teach the knowledge and skills for using computers to the poor and disadvantaged, those jobs will go to the already affluent, and the promise of equality of educational opportunity will have little substance. Improved educational attainment, enhanced intellectual power, increased productivity, and support of the U. S. computer industry are all likely outcomes of reasonable Federal initiatives. A new electronic educational publishing industry, using computer-related technologies could be stimulated. The skills connected with the computer will become a basic skill ( ldquo;the 4th 'R'&amprdquo;) that will give people vastly amplified intellectual resources. Simulation of complex events is but one of the ways that new mental adventures and tools for problem solving will be put at our disposal. Some of the educational alternatives will be discussed. A set of specific recommendations for Federal action and a report on progress will be presented.
Suggestion for a &ldquo;mapped&rdquo;, extension of APL
Authors: C. Leibovitz
Venue: Proceedings of the fourth international conference on APL (1972)

Users of APL are under the &ldquo;spell&rdquo; of beauty, conciseness and elegance of the language. They have however to go back to Fortran, for instance, whenever they cannot avoid a loop executed a great number of times in order to limit the CPU time used. The natural desire for enlarging the class[1] of cases in which &amp-ldquo;it would pay&rdquo; to use APL, is the origin of a great number of suggestions for modifications to and extensions of APL.
The SCEMP project
Authors: Philip Wolfe
Venue: Proceedings of the 1961 16th ACM national meeting (1961)

&ldquo;SCEMP&rdquo; stands for &ldquo;Standardized Computational Experiments in Mathematical Programming.&rdquo; Briefly described, the project is aimed at collecting information and evaluating the efficiencies of a variety of procedures for the computational solution of mathematical programming problems through solving a standardized set of problems by means of closely related computer routines which collect statistics on their own performance. Subcommittee on Test Problems and Machine Experiments of the SHARE linear Programming Committee has collected about fifteen realistic problems which can be used in the project; these have been thoroughly tested on the RAND-type production linear programming routines for the IBM 704 and 7090 by Esso Engineering and Research. A set of basic statistic-collecting routines, modeled on the all-in-core, FORTRAN-coded &ldquo;M&rdquo; series of linear programming routines, has been coded for the 7090.
A concurrent pattern operation algorithm for VLSI mask data
Authors: Tokinori Kozawa, Akira Tsukizoe, Junya Sakemi, Chihei Miura, Tatsuki Ishii
Venue: Proceedings of the 18th Design Automation Conference (1981)

A new pattern operation algorithm effective for VLSI mask data is presented. It conducts intersection-point calculation, slit division, and logical processing simultaneously. A new algorithm for intersection-point calculation is also presented. Using these algorithms, a pattern operation program package (VSOP) has been developed that is applicable to several mask artwork systems in common, and that has 21 functions. The execution time for VSOP varies approximately in proportion to the number of input vectors. CPU time for 1,000,000 vectors is 200 seconds.
A methodology for LISP program construction from examples
Authors: Phillip D. Summers
Venue: Proceedings of the 3rd ACM SIGACT-SIGPLAN symposium on Principles on programming languages (1976)

This paper reports on a system, THESYS, that synthesizes LISP recursive programs from examples of what they do. There has been recent interest in this form of program specification[1,4,8]. The theory of such inductive systems has been investigated by Blum and Blum[2], Kugel[5] and Summers[10]. In this paper we describe the practical results of an investigation into the problem of program synthesis from examples. The methodology to be presented is based on a firm theoretical foundation which may provide a basis for generalizing the results to other kinds of program synthesis systems. The various theoretical models for computation and data that comprise the theory are not described in detail in this paper but may be found in [10]. As part of the methodology we describe two processes used in constructing LISP recursive programs from examples. The first is a method for discovering and encoding the relationships or differences between pairs of examples used to specify a program. Unlike systems that synthesize programs from a single example[8], we feel that it is crucial to the process of program synthesis to discover these implicit relationships rather than inferring them from a single example. The multiple example approach permits the construction of a greater variety of programs than does the single example approach. If the algorithm for difference discovery is successful, the relationship between examples is encoded as a kind of recurrence relation. Derivation of such relations effectively determines the program to be constructed as one may prove equivalence between certain recurrence relations and various program schemata.
Textile Graphics/Computer Aided: A course taught at the Fashion Institute of Technology
Authors: Ann C. Gubiotti, Pat Velderman, Nitta P. Dooner, Janice R. Lourie, Kay James, Lynn Nowakowski
Venue: Proceedings of the ACM annual conference (1973)

Textile Graphics/Computer Aided is the first course presented in the U.S. dealing with the processes of computer aided textile design and manufacture. Given to students and members of the textile industry at the Fashion Institute of Technology, the course is composed of 15 modules, each accompanied by a computer workshop, and is taught using a team-teaching approach. The course is designed to address the needs of three groups of people: textile designers, textile technologists and manufacturers, and textile management. The course provides the student with a good grasp of what computers are capable of doing with specific reference to the problems of the textile industry. It also makes the student aware of how computers do things, what aspects of an apparent function are performed by the computers hardware (wiring) and what aspects are performed by a program (set of instructions) put into the computer.
On-line data analysis and graphics using BASIS-70
Authors: C. Claydon, R. Krohn, A. Fish
Venue: Proceedings of the ACM annual conference (1973)

The BASIS-70 user interface language for interactive information storage and retrieval has been described earlier.1 This language has been extended to allow the user to perform arithmetic and functional operations on items of the retrieved records. Also, the extended language allows the user to format as desired a plot on an interactive graphics terminal and to request 35mm film copies be produced on the Stromberg Datagraphix 4060. Several examples will be presented of the following steps: (a) interactive selection and retrieval of a subset of records from a large data base, (b) polynomial regression of data base items, and (c)plot of regressed polynomial.
Extending APL for pattern matching
Authors: Norman Brenner
Venue: Proceedings of the international conference on APL (1983)

APL includes a few primitives to permit searching of strings for single characters, principally the dyadic iota. APL2 adds iota underline. This latter function will find all occurrences of a given string in a longer string. Sometimes, however, more elaborate searching is needed; for example, searching for strings of variable length, searching for any of several alternate strings and avoiding of particular strings. In this paper, we describe two APL functions which permit very general string searching and substitution. Patterns describing the search to be done are written in APL with extended syntax. They are converted into a mixture of standard APL and defined functions and executed. The facility described is in experimental use as part of a macro language for the experimental full-screen editor ED3 [1].
Software Counting rules: Will history repeat itself?
Authors: Mitchell G. Spiegel
Venue: Selected papers of the 1982 ACM SIGMETRICS workshop on Software Metrics: part 1 (1982)

Counting rules in the software metrics field have been developed for counting such software measurables as the occurence of operators, operands and the number of lines of code. A variety of software metrics, such as those developed by Halstead and others, are computed from these numbers. Published material in the software metrics field has concentrated on relationships between various metrics, comparisions of values obtained for different languages, etc. Yet, little, if anything has been published on assumptions, experimental designs, or the nature of the counting tools (or programs) themselves used to obtain the basic measurements from which these metrics are calculated.
A generalized model and simulation analysis of a multiple parallel conveyor system for flexible manufacturing
Authors: Eugene Y. Yang
Venue: Proceedings of the 13th conference on Winter simulation - Volume 2 (1981)

This paper describes a simulation modeling tool for experimenting with alternative configurations for parallel conveyor systems. Incorporated into this simulation model are &ldquo;degrees-of-free&rdquo; routing strategies that enables system flexibility in the case of stochastic machine jamming and equipment failures.
Plagiarism in computer sciences courses(Panel Discussion)
Authors: William Dodrill, Doris K. Lidtke, Cynthia Brown, Michael Shamos, Mary Dee Harris Fosberg
Venue: Proceedings of the twelfth SIGCSE technical symposium on Computer science education (1981)

What constitutes cheating on programming assignments? What methods can be used to detect cheating? What should be done with offenders? How can cheating be eliminated in programming courses? These are all pertinent questions, but they are directed more towards treating symptoms rather than towards correcting some very fundamental problems. How can student interest in computer programming be stimulated? What can be done to reduce the frustrations inherent in writing and debugging code? What should be expected (and what should not be expected) of students taking introductory programming courses? How can individual performance and achievement be measured effectively for grading purposes? With critical problems of computer fraud and software theft increasing all the time, making Computer Science students aware of the ethics of the computer industry seems not only appropriate but necessary.
Whole mill simulation of small log sawmills with head sawyers
Authors: K. H. Kempthorne
Venue: Proceedings of the 10th conference on Winter simulation - Volume 2 (1978)

Two small log sawmills of different but typical configurations were modelled using GPSSV. Both models covered the whole mill from infeed deck to green chains and stackers. Such models have large memory requirements and required reallocation of common memory. User chains were also used to reduce processor scanning time. Very simple downtime generators were used to randomly distribute downtime episodes of random length to several different sawing centers. These downtime segments make use of the 'unavailable' feature. The head sawyer is also included in each model. The understanding of the decisions this person has to make was a major benefit of the model. Some experimentation has taken place on the possibility of using a micro-computer to relieve him of some of his decisions. The creation and use of the sawmill models was valuable for mill operating people as they now better understand the systems they are operating. One of these mills is known as Mill Five and is now under construction in Washington. The other, more complex, mill is located at Blue Ridge, Alberta. It was finished just over a year ago.
A methodology for evaluation of a hospital's vertical transportation needs
Authors: Robert B. Turnage
Venue: Proceedings of the 11th conference on Winter simulation - Volume 2 (1979)

This paper presents a case study of an evaluation of a University Medical Center's vertical transportation needs. The Hospital's traffic characteristics are documented and then modeled using a GPSS computer simulation model. The effect of several possible improvements in the Hospital transportation system are predicted through use of the model and the most cost effective alternatives chosen for implementation. The use of the model and the study's approach is not limited to university medical centers, and can be applied to evaluation of the vertical transportation needs of any size hospital, existing or planned.
Consulting services and the social sciences: Communication and cooperation
Authors: Ronn J. Hy, Peter B. Nelson, William L. Waugh
Venue: Proceedings of the 5th annual ACM SIGUCCS conference on User services (1977)

Using the computer to process data has become so indispensable to business and government that it is now being taught in an inchoate form to nearly all social science students. The principal reason the computer has become so important is obvious: the machine makes it possible to process large quantities of data quickly, conveniently, and accurately. Thus, knowing how to use the computer is essential for social scientists because they often are employed by public officials and agencies that increasingly are being required by law and administrative necessity to collect, retrieve, analyze, and ingest vast amounts of data.
Simple learning by a digital computer
Venue: Proceedings of the 1952 ACM national meeting (Toronto) (1952)

Digital computers can readily be programmed to exhibit modes of behavior which are usually associated only with the nervous systems of living organisms. This paper describes a concrete example of one practical technique by which the Electronic Delay Storage Automatic Calculator (EDSAC) of the University mathematical Laboratory, Cambridge, was made capable of modifying its behavior on the basis of experience acquired In the course of operation. Techniques of this type may have some value for those who, like psychologists and neurophysiologists, are interested In the potentialities of existing digital computers as models of the structure and of the functions of animal nervous systems. The description will be given in two stages. In the first stage (Section 2) the behavior of the EDSAC under the control of a response learning program will be presented from the point of view of an experimenter who can control the input of the machine and observe its output, but who is denied access to its internal mechanism. This point of view corresponds to that of an experimenter who attempts to deduce the structure and the internal mode of operation of an animal organism from controlled observations of its functions. In the second stage (Section 3), the factors determining the behavior of the machine are revealed, and are analyzed from the privileged point of view of the designer of the learning program.
Interactive computer modelling of truck/shovel operations in an open-pit mine
Authors: L. K. Nenonen, P. W.U. Graefe, A. W. Chan
Venue: Proceedings of the 13th conference on Winter simulation - Volume 1 (1981)

An interactive computer model of truck/shovel operations in an open-pit copper mine has been developed to aid in the design and evaluation of a computer-based truck dispatching system. Interactive features include computer graphics and alphanumeric displays of on-going simulation results and a facility for user command entry. These interactive features allow the model user to act as the decision maker during simulation experiments. A non-interactive option allows execution of high speed simulation experiments with no displays and with automatic decision making.
Retraining: Is it the answer to the computer faculty shortage?
Authors: William Mitchell
Venue: Proceedings of the fourteenth SIGCSE technical symposium on Computer science education (1983)

This paper reports on the experiences acquired in initiating a summer retraining program to prepare college faculty to teach undergraduate computing. The distinction between formal and informal retraining, the benefits of formal retraining, and the justification for credentializing such programs with a masters degree are also discussed.
Module structure in an evolving family of real time systems
Authors: D. M. Lasker
Venue: Proceedings of the 4th international conference on Software engineering (1979)

The problems of maintaining a large number of customized software systems are discussed. Module structuring techniques developed at Bell-Northern Research and used in the development of the Northern Telecom DMS 100 family of telephone switching equipment are described. Application of these techniques simplifies the evolution of the system to handle new features.
Process synchronization without long-term interlock
Authors: William B. Easton
Venue: Proceedings of the third ACM symposium on Operating systems principles (1971)

A technique is presented for replacing long-term interlocking of shared data by the possible repetition of unprivileged code in case a version number (associated with the shared data) has been changed by another process. Four principles of operating system architecture (which have desirable effects on the intrinsic reliability of a system) are presented; implementation of a system adhering to these principles requires that long-term lockout be avoided.
Deterministic simulation of non-deterministic turing machines (Detailed Abstract)
Authors: Walter J. Savitch
Venue: Proceedings of the first annual ACM symposium on Theory of computing (1969)

Computations of non-deterministic Turing machines are shown to correspond to &ldquo;solving&rdquo; certain mazes. The storage needed to &ldquo;solve&rdquo; mazes is related to the storage needed to deterministically simulate non-deterministic Turing machines. In particular, it is shown that a non-deterministic L(n)-tape bounded Turing machine can be simulated by an (L(n))2-tape bounded Turing machine, provided L(n)&ge;log2n.
The design of the Cambridge algebra system
Authors: S. R. Bourne, J. R. Horton
Venue: Proceedings of the second ACM symposium on Symbolic and algebraic manipulation (1971)

This paper discusses the design of the CAMbridge ALgebra system and describes some of the techniques that are used in its implementation. These techniques enable that system to provide reasonably general algebraic manipulation in an efficient way. The concepts of modularity and selection are introduced and their influence on the overall structure of the system is described. Examples of selection and editing facilities are given since these are considered to be a necessary part of any algebra system. The paper also discusses data structures that are appropriate for algebraic systems and examples are given for two of the CAMAL modules.
SIGACT (Paper Session)
Authors: George T. Ligler William C. Nylin,  Jr. Patrick Wang Patrick C. Fischer, Robert L. Probert
Venue: Proceedings of the 1976 annual conference (1976)

These papers indicate the diversity of the theoretical area of computer science. The first explores programming language concepts in terms of Hoare's formal assignment axiom. The second is well described by its title. The third is a contribution to formal language theory, and the last paper adapts a &ldquo;divide and conquer&rdquo; technique to a paging environment.
Retrieval efficiency using combined indices
Authors: Michael Stonebraker
Venue: Proceedings of 1972 ACM-SIGFIDET workshop on Data description, access and control (1972)

The problem considered here involves choosing the best set of indices for indexing a file on a secondary storage device where space may be limited. For a general class of queries and a specific index organization, approximations to the expected retrieval time for any choice of indices are developed. Subject to the simplifying assumptions the best selection of indices is obtained for several cases, both where the number of possible lists is constrained and where it is not. The examples indicate that retrieval time is quite sensitive to the choice made.