ppxscal/embedding_network huggingface dataset:
Simulation - an application in marine transportation scheduling
Authors: Ralph Forsaith, George Hvidsten
Venue: Proceedings of the 5th conference on Winter simulation (1971)

The Tanker Logistics System is a highly interactive, man-machine system for determining feasible tanker schedules on an annual basis. This system provides a basic tool for quickly evaluating alternative schedules due to changing conditions in a highly specified and sensitive network. The simulation model, based on a time-dependent sequential decision tree approach, is sensitive to the system's many constraints such as product run-out/run-over, voyage length, dry-docking, third party charter/subcharter and idle time.
Experiments in diffused combinator reduction
Authors: Paul Hudak, Benjamin Goldberg
Venue: Proceedings of the 1984 ACM Symposium on LISP and functional programming (1984)

In recent years there has been a fair amount of interest both in using combinators to represent functional programs, and in using graph reduction as an underlying valuation strategy. Combining these ideas within a single framework for an &ldquo;applicative architecture&rdquo; is very appealing because: (1) the normally ubiquitous &ldquo;environment&rdquo; is eliminated, (2) the evaluation strategy becomes very simple (amenable to VLSI), and (3) there is a great potential for parallelism. We have been exploring a model of diffused combinator reduction in which the reduction process is distributed &ldquo;by demand&rdquo; among a network of closely-coupled processors. We have tested our ideas via simulation, with encouraging results. This research was supported in part by NSF Grant MCS-8302018 and ONR Grant N00014-84-K-0043.
Optimization of simulation experiments
Authors: R. E. Taylor, J. W. Schmidt, V. Chachra
Venue: Proceedings of the 6th conference on Winter simulation (1973)

The basic objectives of this paper are two-fold. The first objective is to illustrate the use of three multivariable optimization techniques as they are applied in an interactive fashion to the optimization of simulation experiments. The second and more important objective is to present the rationale behind the termination criterion for simulation experiments which is applicable to virtually any multivariable optimization procedure. The termination criterion is statistically based and includes cost factors prevalent for running the simulation as well as the potential savings from continued application of the search. The optimization techniques to be considered in the paper are 1. The sequential one factor-at-a-time technique as proposed by Friedman and Savage, 2. The pattern search method of Hooke and Jeeves, and 3. The successive quadratic approximation technique of Schmidt and Taylor. It is shown that the termination criteria based upon economic and statistical considerations is most effective for simulation experiments.
OLDS: An on line documentation system
Authors: Harvey J. Poorbaugh
Venue: Proceedings of the 5th annual ACM SIGUCCS conference on User services (1977)

The On Line Documentation System at the New Mexico State University Computer Center was developed to satisfy the need for inexpensive, easily available, and up-to-date documentation of software and computer services available at the NMSU Computer Center. The next section of this paper compares costs associated with an on line documentation system to the costs associated with a users' manual. Further sections describe the information structure of OLDS, the maintenance and user access functions, the statistics kept, and the character set used in printing writeups as they will be after the new version of OLDS is complete. The conversion from the present OLDS to the changed OLDS is also discussed.
Heuristic enhancement of an algorithmic test generator
Authors: R. E. Strebendt
Venue: Proceedings of the 14th Design Automation Conference (1977)

It is well known that the problem of generating tests for logic circuits is a very difficult one to solve in a cost-effective way. In the work described in this paper it is shown that the combination of a good test generation algorithm and a suitable set of heuristics may be a way to obtain a test generator of larger capacity and higher speed than is possible with the algorithmic program alone.
The implementation and experiences of a structure-oriented text editor.
Authors: O. Strömfors, L. Jonesjö
Venue: ACM SIGPLAN Notices (1981)

This paper presents a generalized approach to data editing in interactive systems. We describe the ED3 editor, which is a powerful tool for text editing combining the ability to handle hierarchical structures with screen-oriented text editing facilities. Extensions for handling simple pictures and formatted data records in a uniform way are part of our approach. Examples of ED3 applications are presented.
PDP-10 virtual machines
Authors: S. W. Galley
Venue: Proceedings of the workshop on virtual computer systems (1973)

The architecture of the DEC PDP-10 prohibits using standard methods to construct a virtual PDP-10 on it. However, by simulating all executive-mode instructions and in rare cases user-mode instructions, a &ldquo;hybrid&rdquo; virtual machine may be constructed. Building on such a simulator and an operating system with hierarchical process relationships, the author has easily constructed a prototype virtual machine.
Aspects of quality in the design and production of text
Authors: Alison Pringle, Peter Robinson, Neil Wiseman
Venue: Proceedings of the 6th annual conference on Computer graphics and interactive techniques (1979)

The problem of quality in printed text produced by computer has received little attention. Three pieces of recent work at Cambridge which relate to different aspects of the problem are presented in this paper. The first is a letter design system, which enables the typographer to exploit not only the power of the computer but also the freedom which modern printing technology has made available. The second is an attack on the problem of high quality text for television transmission, especially where the text is itself computer generated. Third, is a system which enables the user to set and correct tabular text easily and flexibly.
Teaching software psychology experimentation through team projects
Authors: Ben Shneiderman
Venue: Proceedings of the 1982 conference on Human factors in computing systems (1982)

This paper describes an undergraduate human factors course which emphasizes psychologically oriented experimentation on the human use of computers. The reductionist principles of the scientific method are emphasized throughout the course: lucid statement of testable hypotheses, alteration of independent variables, measurement of dependent variables, selection and assignment of subjects, control for biasing, and statistical testing. Term-length team projects are highly motivating for students and have led to worthwhile research contributions.
Computer science for elementary school teachers
Authors: David Moursund, Mike Neill
Venue: ACM SIGCUE Outlook (1976)

The time line for significant changes in public education is long, and introduction of computers into education is not proving an exception to this. The circumstances that have contributed to relatively rapid progress in introducing computers in higher education do not exist at the pre-college level. This paper concentrates on the problems of computers in elementary education, and suggests several partial solutions to these problems.
APL learning bugs
Authors: Murray Eisenberg, Howard A. Peelle
Venue: ACM SIGAPL APL Quote Quad (1983)

This paper discusses common mistakes novices make when learning to program in APL. We present several exemplary APL &ldquo;learning bugs&rdquo;, describe the context in which they occur, indicate why we believe they are interesting, and speculate about underlying thinking processes. We claim that such learning bugs are worth examining: further study may yield insight into barriers to wider acceptance of APL, better understanding may lead to more effective APL teaching, and deeper analysis may hold implications for APL designers. bug...1: obs: bogey, bugbear (bugaboo): an imaginary object of fear; a source of concern 2: an insect or other creeping or crawling invertebrate... 3: an unexpected defect, fault, flaw, or imperfection 4: a disease-producing germ; also: a disease caused by it 5: a fad 6: enthusiast, hobbyist (obs: a crazy person) 7: a prominent person 8: a concealed listening device 9: a handicap (adapted from Webster's New Collegiate Dictionary, G. C. Merriam Co., Springfield, MA, 1977)
Multics Emacs (Prose and Cons): A commercial text-processing system in Lisp
Authors: Bernard S. Greenberg
Venue: Proceedings of the 1980 ACM conference on LISP and functional programming (1980)

This paper addresses the choice of Lisp as the implementation language, and its consequences, including some of the implementation issues. The detailed history of Multics Emacs, its system-level design considerations, and its impact on Multics and its user community are discussed in [Greenberg]. One of the immediate and profound consequences of this choice has been to assert Lisp's adequacy, indeed, superiority, as a full-fledged systems and applications programming language. Multics Emacs has established an awareness of Lisp in quarters where the term had never been heard.
Considerations for local compaction of nanocode for the nanodata QM-1
Authors: Douglas J. Rideout
Venue: ACM SIGMICRO Newsletter (1981)

Much work has been done recently on the problem of compaction of microcode, that of detecting parallelism between microoperations expressed in a sequential manner in order to pack the operations into as few microinstructions as possible. In particular, the theory of local compaction has developed to the stage where some extensive testing of the models and methods is called for. This paper examines some of the considerations for local compaction of the nanocode of the Nanodata QM-1 in the context of the theoretical model of compaction presented in the literature. This application of compaction to QM-1 nanocode not only provides a stringent test of the model, but also shows that compaction of code for this architecture is feasible, thus forming part of a test of the practicalities of developing a high-level microprogramming language for the QM-1.
Numerical analysis I: Function evaluation in unnormalized arithmetic
Authors: R. L. Ashenhurst
Venue: Proceedings of the 1962 ACM national conference on Digest of technical papers (1962)

SYSTEMS of unnormalized floating point arithmetic which permit a certain degree of error control have been described earlier. One of the variants discussed has been implemented on the MANIAC III computer at the University of Chicago. The evaluation of a function of one argument is a standard computer task. When an unnormalized number representation is used, it is appropriate that function evaluation be subject to certain adjustment criteria, defined independently of the computing method. In this paper some such criteria will be outlined, and their application described.
A computer science curriculum for a liberal arts college
Authors: R. Waldo Roth
Venue: Proceedings of the second SIGCSE technical symposium on Education in computer science (1972)

This paper describes the development of a computer science major for a liberal arts college of 1400 students located in rural Central Indiana. In presenting this curriculum the paper also describes the institution for which this program has been developed; and shows the minimal and desirable personnel, equipment, and budgetary requirements needed to implement it. In addition, it attempts to justify the existence of computer science as a distinct program in the liberal arts tradition.
Questions for Local Area Network panelists
Authors: Mitchell G. Spiegel
Venue: Proceedings of the Computer Network Performance Symposium (1982)

Much has been written and spoken about the capabilities of emerging designs for Local Area Networks (LAN's). The objective for this panel session was to gather together companies and agencies that have brought LAN's into operation. Questions about the performance of LANs have piqued the curiosity of the computer/communications community. Each member of the panel briefly described his or her LAN installation and workload as a means of introduction to the audience. Questions about performance were arranged into a sequence by performance attributes. Those attributes thought to be of greatest important were discussed first. Discussion on the remainder of the attributes continued as time and audience interaction permitted.
Error resynchronization in producer-consumer systems
Authors: David L. Russell, Thomas H. Bredt
Venue: Proceedings of the fifth ACM symposium on Operating systems principles (1975)

This paper is concerned with error processing for parallel producer-consumer interactions such as encountered in the desing of multi-process operating systems. Solutions to resynchronization problems that occur when a consumer process detects errors in information received from a producer process are presented. Fundamental properties of this error processing are discussed. It is shown that explicit error processing results in an increase in program complexity and a decrease in the ease of understanding a program.
Josef, programming for everybody
Authors: Ivan Tomek
Venue: Proceedings of the thirteenth SIGCSE technical symposium on Computer science education (1982)

The author believes that everybody should be introduced to programming but that standard general purpose languages are not suitable for this purpose, mainly because they do not provide an environment offering natural problems. Another characteristic which makes them unsuitable for the purpose is that they are all more or less burdened by restrictions imposed by legitimate concerns of professional programmers with security and economical aspects of programming. This paper briefly considers the general features that a programming language intended for the introduction of an average non-programmer should have and describes some aspects of one such language developed by the author.
Institute for educational computing
Authors: Fred Weingarten
Venue: Proceedings of the annual ACM SIGUCCS symposium on The administration and management of small-college computing centers (1972)

The Institute for Educational Computing of the Claremont Colleges provides timesharing services via a DECsystem10 (formerly known as a PDP-10) computer to colleges and high schools throughout the greater Los Angeles area. Operating as a non-profit service organization, the IEC is owned by the Claremont University Center, the central corporate body for the group. The hardware link within this network serves as the basis for a cooperative program between IEC and the academic communities it serves. The network provides on-line service to 13 colleges, including the Claremont group. A research hospital, a junior college and three high schools are also tied into IEC. The nearest user is at our own facility, the furthest is 80 miles away. The terminals, numbering from one to six per campus, are used both for academic and administrative applications, although educational use predominates by far.
Passengers Queue Length Measurement
Authors: Didier Aubert
Venue: Proceedings of the 10th International Conference on Image Analysis and Processing (1999)

The article presents an automatic measurement of passengers queue length based on image analysis. The algorithm developed is robust to contrast changes and is able to work even under low contrast. It is based on a level lines image representation, and on a study of the effects of contrast changes on them. This algorithm has been tested on real airport situations.
Towards a unified IU environment: coordination of existing IU tools with the IUE
Authors: C. Kohl, J. J. Hunter, C. L. Loiselle
Venue: Proceedings of the Fifth International Conference on Computer Vision (1995)

Progress in the field of computer vision/image understanding (IU) has long been hampered by the lack of standard software environments for research and application development. The Image Understanding Environment (IUE) is being implemented to provide a freely-distributed standard software environment that is appropriate for a wide range of research and development activities. Nevertheless, we recognize that the IUE will not serve everyone's individual needs and that conversion to the IUE could be an expensive process for many sites. Therefore, we are investing significant effort to make the IUE an open environment that can work in coordination with existing IU systems and tools. This paper introduces the work being performed at Amerinex AI to address the processing and data representation factors involved in this coordination.
An experimental study of computer system performance
Authors: H. D. Schwetman, J. C. Brown
Venue: Proceedings of the ACM annual conference - Volume 2 (1972)

This paper describes an experimental study of the performance of a large multi-programmed computer system (the UT-l/CDC 6600 system at the University of Texas at Austin) under systematic variation of available resources and resource allocation algorithms. The experiments were carried out in a controlled and reproducible environment provided by a synthetic job stream generator. The experimental data was recorded by an event-driven software monitor which recorded a complete trace of system activities at the level of system defined events. The study relates resource utilization and queueing patterns to the metric of job completion rate. The experiments undertaken in these studies are single factor experiments. Compensatory reactions by this complex system to variation of individual resources are nonetheless revealed. The experiments also demonstrate the criticality of optimal scheduling of bottleneck resources and offer comparisons of the performance of multi-drive disk units under different conditions of availability and space assignment. The data gathering facility was also run on the production environment to determine base lines for comparison to the experiments as well as for an understanding of the production mode of operation of the system.
Dichotomization, reachability, and the forbidden subgraph problem(Extended Abstract)
Authors: H. B. Hunt,  III, T. G. Szymanski
Venue: Proceedings of the eighth annual ACM symposium on Theory of computing (1976)

We present several techniques for proving lower bounds that can be applied to problems about grammars, formal languages, program schemes, simple programming languages, and automata. These techniques include dichotomization, extensions of dichotomization to certain classes of relational problems, recursive analogues of the Post Correspondence Problem, and the reachability problem. These techniques provide many new lower bounds and provide a unified framework for viewing much of the work on the complexity of problems about grammars, languages, schemes, and automata. We show how to prove the undecidability of a problem by efficiently reducing the membership problem for Tms that always halt to it. We also introduce the forbidden subgraph problem.
Structure and application of a measurement tool-SAMPLER/3000
Authors: Abbas Rafii
Venue: Proceedings of the 1981 ACM SIGMETRICS conference on Measurement and modeling of computer systems (1981)

Design, internal structure, implementation experience and a number of unique features of the SAMPLER/3000 performance evaluation tool are presented. This package can be used to produce program CPU and wait time profiles in several levels of detail in terms of code segments, procedure names and procedure relative addresses. It also provides an accurate profile of the operating systems code which is exercised to service requests from the selective parts of the user code. Programs can be observed under natural load conditions in a single user or shared environment. A program's CPU usage is determined in terms of direct and indirect cost components. The approaches to determine direct and indirect CPU times are described. A program counter sampling technique in virtual memory domain is discussed. Certain interesting aspects of data analysis and on-line data presentation techniques are described. The features of the computer architecture, the services of the loader and compilers which relate to the operation of the tool are discussed. A case study is finally presented.
Dynamics of the Johari Window: A simulation
Authors: L. E. Shirland
Venue: Proceedings of the 9th conference on Winter simulation - Volume 1 (1977)

A simulation of the dynamics of management behavior through the Johari Window is studied. A mathematical model is developed utilizing the concepts of Markov chains. Strategies for behavior modification are simulated. Results are presented which show that information flows between panes of the window and by interacting with barriers between panes, desired changes can be effected.
Formal solutions of differential equations in the neighborhood of singular points (Regular and Irregular)
Authors: J. Della Dora, E. Tournier
Venue: Proceedings of the fourth ACM symposium on Symbolic and algebraic computation (1981)

This paper presents an algorithm for building a fundamental system of formal solutions in the neighbourhood of every singularity of a linear homogenous differential operator.
Development and implementation of a computing major program based on suggested ACM curricula at an undergraduate liberal arts college
Authors: A. E. Sapega
Venue: Proceedings of the fifth SIGCSE technical symposium on Computer science education (1975)

Two recent ACM reports have been published suggesting curricula for undergraduate education in Computer and Information Sciences. These reports have provided the basis of a new major program, the Computer Coordinate Major, recently established at Trinity College. The synthesis of these reports with the curriculum of the College in developing the new major is discussed. The resulting program is suggested as a case study in the implementation of the ACM reports. It is recommended that the ACM reports be regularly reviewed and up-dated so as to continue to provide the basis for development of curricula for undergraduate education in computing.
VLSI circuit design using APL with fortran subroutines
Authors: Norman Brenner
Venue: ACM SIGAPL APL Quote Quad (1984)

Our group at IBM Yorktown Research has written a number of tool programs for VLSI design, all in APL. Several crucial algorithms were speeded up by recoding them in Fortran and Assembler Language. For example, the algorithm for complementation of a Boolean expression (which can sometimes have thousands of terms in dozens of variables) is 5 times faster in Fortran than the best APL code I could write. The linking mechanism used from APL to outside languages is the experimental AP403 from IBM Heidelberg, though other similar auxiliary processors exist (e.g. the IUP AP999). Thus, each language, Fortran and APL, is used to its best advantage: Fortran for raw speed, and APL for interactiveness and ease of coding.