ppxscal/embedding_network huggingface dataset:
A control program for Computer Assisted Instruction on a general purpose computer
Authors: Eugene G. Kerr, T. C. Ting, William E. Walden
Venue: Proceedings of the 1969 24th national conference (1969)

A Computer Assisted Instruction system, running in a multiprogramming environment on an IBM 360 Model 67, is described. Instructional sequences can be built from basic units called frames. These frames can be presented for keypunching in a format which requires no computer programming knowledge. The frames are then processed and stored in direct access files where they can be easily expanded or modified. The system is being used to provide mathematics instruction to students in small remote high schools. A great amount of information is recorded automatically for evaluation of the students, the courses, and the system. The structure of the computer program is described as well as future plans for improving the system.
Firm models of unhealthy cash flows
Authors: Michael Keenan
Venue: Proceedings of the 5th conference on Winter simulation (1971)

This simulation study of corporporate funds flows examines the time path of balance sheet and income statement data for firms whose revenues are deteriorating. The objective is to ascertain what measures are likely to give the earliest correct signal to creditors that the firm is in trouble. A variety of firm behavioral assumptions and initial asset conditions are investigated to see how these system parameters may influence the choice of measure creditors should watch. The findings suggest that standard Balance Sheet and Income Sheet statements do not provide sufficient information to forewarn most types of creditors of impending financial crisis.
Adaptive interpretation as a means of exploiting complex instruction sets
Authors: Richard L. Norton, Jacob A. Abraham
Venue: ACM SIGARCH Computer Architecture News (1983)

In this paper we concentrate on the effect of instruction set architecture on the performance potential of a computer system. These issues are key in considerations of what instruction set is most appropriate for the support of high level languages on general purpose machines. Two possible approaches are so called complex instruction sets, such as those of the VAX and IAPX 432, and the &ldquo;reduced&rdquo; instruction set of the RISC I [2] microcomputer, which is expected to have performance similar to that of a VAX 11-780. We propose a method of instruction set interpretation that takes advantage of the architectural features of complex instruction sets. These methods have been simulated executing real programs and in the case of the VAX instruction set have resulted in a typical improvement of a factor of two, assuming the same cycle time as the VAX 11-780. The techniques presented exploit the context available in a complex instruction and retain this information for use in subsequent execution of that instruction. Since this context is available only within a single instruction, low level instruction sets cannot benefit from this technique. In this sense the reduced instruction set machines as implemented in RISC are at their architectural limits, while complex instruction sets such as the VAX are far from theirs. For these reasons, complex instruction sets can have a significantly greater performance potential than a RISC instruction set for a given technology.
On selecting the best of K systems: An expository survey of indifference-zone multinomial procedures
Authors: David Goldsman
Venue: Proceedings of the 16th conference on Winter simulation (1984)

We investigate the problem of selecting the 'best' one of k arbitrary systems or alternatives. Consider one observation from each of the k systems. By 'best,' we mean that system which has the highest probability of yielding the 'most desirable' of the k observations. The term@ 'most desirable' of the k observations. The term 'most desirable' is defined according to some criterion of goodness determined by the experimenter. We show that this problem can be formulated as a multinomial selection problem. Hence, multinomial selection procedures are, in a sense, nonparametric procedures. An up-to-date survey of 'indifference-zone' multinomial procedures is given.
Short-term scheduling in multiprogramming systems
Authors: Per Brinch Hansen
Venue: Proceedings of the third ACM symposium on Operating systems principles (1971)

This paper defines a set of scheduling primitives which have evolved from multiprogramming systems described by Dijkstra, Lampson, Saltzer, and the present author. Compared to earlier papers on the same subject, the present one illustrates a more concise description of operating system principles by means of algorithms. This is achieved by (1) describing the primitives as the instructions of an abstract machine which in turn is defined by its instruction execution algorithm; (2) introducing a notation which distinguishes between the use of synchronizing variables (semaphores) to achieve mutual exclusion of critical sections, and to exchange signals between processes which have explicit input/output relationships; (3) considering the influence of critical sections on preemption and resumption; and (4) using a programming language, Pascal, which includes natural data types (records, classes, and pointers) for the representation of process descriptions and scheduling queues. The algorithms are written at a level of detail which clarifies the fundamental problems of process scheduling and suggests efficient methods of implementation.
GASP IV tutorial
Authors: A. Alan. B. Pritsker
Venue: Proceedings of the 76 Bicentennial conference on Winter simulation (1976)

This paper presents a select set of slides that will be presented in the tutorial on GASP IV. Complete documentation for GASP IV is currently available (1,2) and does not need to be reproduced in these proceedings.
Coal mine belt system design simulation
Authors: James E. Juckett
Venue: Proceedings of the third conference on Applications of simulation (1969)

Design of a belt system to convey coal from the mine face to mine mouth can not economically be based on manufacturers rated output of mining equipment due to the high probabilities of random equipment breakdown. A model of the mining environment was developed such that the configuration of the mine can be easily redefined without reprogramming. Coal production is simulated at the mine face and belt overload conditions are checked for as the model simulates conveyance of the coal over the defined system of belts.
A microcomputer stochastic simulation model of seed dispersion of Melaleuca quinquenervia
Authors: Peter B. Schroeder, Joan A. Browder
Venue: Proceedings of the 13th annual symposium on Simulation (1980)

A model simulates the pattern of wind-driven Melaleuca seed dispersion under normal south Florida weather conditions and a hurricane situation. Major factors determining the dispersion pattern are seed terminal velocity, height of release, wind speed, mechanical turbulence, and conventional forces. Simulation results are compared to field measurements. The model was developed in a version of Microsoft BASIC on a low-cost microcomputer.
FLATS, a machine for numerical, symbolic and associative computing
Authors: Eiichi Goto, Tetsuo Ida, Kei Hiraki, Masayuki Suzuki, Nobuyuki Inada
Venue: Proceedings of the 6th annual symposium on Computer architecture (1979)

Functional aspects of a machine called FLATS are described. FLATS aims to efficiently run both numerical and algebraic programs. Overflow free and variable precision arithmetic, table look-up computation, and associative computation based on single-hit content addressed tables are introduced for advanced numerical, algebraic and symbolic computing. Hashing hardware, tag mechanism and hardware list processing are used to realize these features.
Marketing tools for increasing revenue and improving service
Authors: Thomas H. Bennett
Venue: Proceedings of the 3rd annual ACM SIGUCCS conference on User services (1975)

The University of Washington Academic Computer Center operates a CDC 6400 and Cyber 73, which are only two of 90 computers at the University of Washington. In spite of the large number of computers available on the campus, many students spend four years at the University with little or no exposure to computing. With this in mind, the Computer Center created a new position responsible for developing and coordinating a marketing program to expand the number of students and faculty serviced by the Center, as well as to bring in more funds from grants, contracts and other sources. We felt this program would have to identify and coordinate the various marketing tools we could use to attract new users and encourage present &ldquo;hard money&rdquo; users to do more computing with us. We titled a small section of the brochure &ldquo;How to Get Started.&rdquo; Immediately underneath the heading is a picture of two small children operating a CRT. This was inserted to provide a subtle message that computing is easy for everyone. This section explains how to get an account number and obtain necessary documentation. The rest of the brochure contains only two pictures taken at the Computer Center and these are much smaller than those showing user activities. This is the opposite emphasis from most of the other brochures we have seen, but we feel this emphasis on the users is essential if the brochure is to be an effective marketing tool.
A hidden-surface algorithm with anti-aliasing
Authors: Edwin Catmull
Venue: Proceedings of the 5th annual conference on Computer graphics and interactive techniques (1978)

In recent years we have gained understanding about aliasing in computer generated pictures and about methods for reducing the symptoms of aliasing. The chief symptoms are staircasing along edges and objects that pop on and off in time. The method for reducing these symptoms is to filter the image before sampling at the display resolution. One filter that is easy to understand and that works quite effectively is equivalent to integrating the visible intensities over the area that the pixel covers. There have been several implementations of this method - mostly unpublished - however most algorithms break down when the data for the pixel is complicated. Unfortunately, as the quality of displays and the complexity of pictures increase, the small errors that can occur in a single pixel become quite noticeable. A correct solution for this filter requires a hidden-surface algorithm at each pixel! If the data at the pixel is presented as a depth-ordered list of polygons then the average visible intensity can be found using a polygon clipper in a way similar to that employed by two known hidden-surface algorithms. All of the polygons in a pixel are clipped against some front unclipped edge into two lists of polygons. The algorithm is recursively entered with each new list and halts when the front polygon is clipped on all sides, thereby obscuring the polygons behind. The area weighted colors are then returned as the value to be added to the other pieces in the pixel.
The author-mode interface for the ASAG assignment generating system
Authors: Leonard H. Weiner, William P. Allaire
Venue: Proceedings of the fourth SIGCSE technical symposium on Computer science education (1974)

ASAG, the Assignment Scheduler, Analyzer and Generator [2], was first developed in 1968. Its purpose was to help fill the gap between computer grading systems and large scale, frame-oriented CAI systems. In particular, it was designed to generate assignments at a level and pace appropriate for each student and, at the same time, to automate assignment checking and record keeping in a mass education environment. The original system design met these goals, but the manner of implementation imposed some unexpected and undesirable restrictions on both the students and instructors. In order to ease these restrictions, and lay the groundwork for implementing ASAG in other courses, two major revisions have recently been made to the system. The purpose of this paper is to introduce and describe these new ASAG features.
Interactive computing in a project-oriented file organization course
Authors: Alan L. Tharp
Venue: Proceedings of the tenth SIGCSE technical symposium on Computer science education (1979)

In the decade since Curriculum '68 [1], the suggested structure of courses related to data management has evolved, as evidenced by the report of the ACM committee on curriculum in 1977 [2] and also noted by Dale [3]. A course in Curriculum '68 entitled &ldquo;Information Organization and Retrieval&rdquo; [IOR] does not appear in the 1977 report, while a new course in "File Processing [FP] is included. Influenced by Curriculum '68, N.C. State in 1970 instituted a senior-level course entitled &ldquo;Information Retrieval&rdquo; to correspond essentially to the IOR course. Over the years that course in information retrieval has changed gradually, as material related to document retrieval has been supplanted by material related to file organization. Although the title has remained constant, the content is now more similar to FP than IOR. This paper describes the current project-oriented course in information retrieval which stresses the importance of query languages in an information retrieval system. In addition, the paper highlights the use and impact of interactive computing, the choice of a project implementation language, and the relationship of the course to an individual's transition from student to professional. The paper concludes with a comparison of project grade and the associated computer development time.
Tutorial on Ada
Authors: George Poonen
Venue: Proceedings of the 1983 annual conference on Computers : Extending the human resource (1983)

Ada is a general purpose language that was developed to meet the needs ofsoftware development within the U.S. Department of Defense. By the end of the 1980's, it is expected that the majority of software developed for mission-critical systems will be written in Ada. With the recent standardization of Ada by ANSI, there has been a considerable interest in the language both in the United States and abroad. Ada is an extremely well-designed language and incorporates many important ideas in software methodology. These include: &bull;abstract data types &bull;information hiding &bull;concurrent processing &bull;re-usable software components This tutorial is designed to introduce the main features of Ada. Using a simple problem as a background case study, the tutorial will cover: &bull;Ada types &bull;classical programming constructs &bull;packages, exceptions and generics &bull;tasks
Selection schemes for dynamically microcoding fortran programs
Authors: Philip S. Liu, Frederic J. Mowle
Venue: Proceedings of the 3rd annual symposium on Computer architecture (1976)

The objective of the present study has been to investigate possible methods to reduce a program's execution time by detecting and converting automatically the more frequently executed program parts, mostly inner loops, into microcode. The methods proposed were static loading of inner loops, selective loading of inner loops, over-lay of inner loops, and user-aided scheme. Using Fortran programs as the test programs, a simulation program was written to measure the gain achieved by each method. A final gain between 1.587 and 4.76 was achieved by the proposed methods for memory speed ratios between 3 and 8. It was found that 90% of the final gain of the test programs could be obtained with writable control memory requirements that were less than 40% of the final requirement.
Some computations involving simple Lie algebras
Authors: N. Burgoyne, C. Williamson
Venue: Proceedings of the second ACM symposium on Symbolic and algebraic manipulation (1971)

This article is a report of some computations that were done recently with the hope of understanding an apparently simple, though as yet unanswered, question in linear algebra.
Comparing figures by regression
Authors: W. R. Tobler
Venue: ACM SIGGRAPH Computer Graphics (1978)

A procedure is described to obtain an empirical transformation regressing an independent plane configuration against a similar dependent configuration. As implemented the procedure constructs the mapping by estimating two bivariate tables, with arguments on a square lattice interpolated from the irregularly arranged original observations. The tables are constructed so that the transformation has smooth derivatives and so as to agree, as nearly as possible, with the empirical data. The curvilinear regression coefficients are represented a spatially varying, but coordinate invariant, second order tensor field. Bidimensional regression can automatically be illustrated by a warped coordinate grid, by comparison of the original configuration and the regression estimate, by a field of displacement vectors, by a diagram of the principal strains, and by a contour map. Intermediate configurations and extrapolations are also available.
Implementing SMART for minicomputers via relational processing With abstract data types
Authors: Edward A. Fox
Venue: Proceedings of the 1981 ACM SIGSMALL symposium on Small systems and SIGMOD workshop on Small database systems (1981)

Designed during the 1960's as a research tool for the field of information retrieval, the SMART system has been operating on an IBM 370 since 1974. SMART is now being enhanced, redesigned, and programmed under the UNIX operating system [28] on a DEC VAX 11/780. The techniques used should allow real-time operation on smaller minicomputers in the PDP 11 family. The implementation provides for a combination of database and information retrieval operations which make it applicable to office automation, personal information system management, and research studies. The SMART vector space model, which treats information requests and stored information records as vectors in an n-space (of terms), is integrated into the relational database model using the concepts of abstract data types (ADTs). Domains of relations are allowed to be any ADT; an extended relational algebra is described with operators that manipulate many complex data structures. After illustrating the application of these concepts to typical SMART tasks, a prototype implementation is outlined. Also included is a discussion of techniques to be employed in a more efficient version.
Software engineering: Management, personnel and methodology
Authors: Thomas H. Bruggere
Venue: Proceedings of the 4th international conference on Software engineering (1979)

Three key factors often determine the success or failure of a software project: the management of the project, the selection of personnel, and the development methodology that is used. This paper discusses the important considerations that should be addressed in each of these areas and examines the results of a typical project that paid attention to these factors. In particular, it was concluded that a good development methodology can help ensure the reliability, maintainability and timeliness of any software project.
&ldquo;An application of simulation to debugging and maintaining a computer network system&rdquo;
Authors: M. W. Collins, D. G. Harder
Venue: Proceedings of the 6th conference on Winter simulation (1973)

The Computing Division of the Los Alamos Scientific Laboratory is implementing a system which will link the Laboratory's large general purpose computers (3 - CDC 6600's and 2 - CDC 7600's) to a common data base (1012 bits on-line), and to a network of keyboard and computer based terminals. This paper discusses the use of simulation in designing, implementing, testing and maintaining the system software for the Front End Machine which is the center of this system.
The added dimension of geographic data
Authors: James R. Carter
Venue: Proceedings of the ACM 1980 annual conference (1980)

Geographic base files and data bases are unique from other digital data because they must be related to specific places on the earth's surface. Such digital files carry implicit or explicit indicators telling where features exist or events occur. Geographic phenomena may be identified with a point, along a line or within an area. An area may be defined as an irregular polygon, such as a county or a state, or by a regular cell in a matrix. A well, a house or the site of an accident would normally be defined as occurring at a point. Streets, rivers and contours are generally represented as lines. Counties, watersheds and service areas are described by irregular polygons that outline areas. Such logic may be extended to apply to three dimensional situations such as a volume of air space in an air quality study or the mass of overburden to be removed in a mining operation.
Multiuser microcomputer systems
Authors: Ivan Flores
Venue: Proceedings of the 1983 annual conference on Computers : Extending the human resource (1983)

Microcomputers are small, efficient, powerful and inexpensive. They have found many uses in commerce and industry as well as for education and enlightenment. They are so inexpensive that it is possible in some firms to put one on everybody's desk. The computers are truly personal. Personal stand-alone computers are fine for doing independent individual work. When it comes to sharing the work of others, we need an integrated system. Information created by one person should be easily available to any other person. This is a common policy in education, commerce, industry and engineering where the medium of exchange is the mainframe. Terminals allow users access to large quantities of information, as long as they are privileged to do so.
Mesa from the perspective of a designer turned user
Authors: James G. Mitchell
Venue: ACM SIGAPL APL Quote Quad (1981)

The Mesa language and run-time environment were designed for the purpose of building systems programs such as compilers, operating systems, graphics software and so on. It is a relatively high-level language with strong type checking and supports the ideas of modular programming and abstract data types. Although the system is compiler-based, one can debug programs interactively in source-language terms. The language has been in rather heavy use since 1976 by a programming community of a few hundreds of professional programmers within the Xerox Corporation, and a large amount of code has been written in it. This talk will give a designer's retrospective view of Mesa from the vantage point of a serious user and will attempt to evaluate its strengths and weaknesses as a vehicle for systems programming.
Segmentation of the Yellow Pages
Authors: S. Fischer, A. Amin, D. Drivas
Venue: Proceedings of the Third International Conference on Document Analysis and Recognition (Volume 2) - Volume 2 (1995)

We present a fully automated process to scan the Australian Telecom Yellow Pages and produce a text document consisting only of the business entries, while removing the advertisements, graphics and notes about the Yellow Pages. The system contains four major components: digitisation and thresholding, skew detection, segmentation (removal of unwanted parts of the image), and finally the recognition engine utilising the principles of mathematical morphology. This paper presents the current research, which consists of the process described above up to image segmentation. All the algorithms are written in C on a 5000/20 DEC workstation. We have tested more than 30 images with extremely promising results.