ppxscal/embedding_network huggingface dataset:
The associative-addressing capability on cylinder-memories and its applications - an abstract
Authors: N. Minsky
Venue: Proceedings of 1972 ACM-SIGFIDET workshop on Data description, access and control (1972)

In a previous paper [1], it had been shown that cylinder-memories, in particular magnetic drums and the cylinder parts of disks, can be used as associative memories. That paper, however, concentrated on a particular realization of a certain type of associativity (which was called there partial associativity). In this paper we will approach the subject from a somewhat broader viewpoint, considering various methods for realizing associativity on cylinder-memories. Although all these methods are based on the same idea, they are quite different from the point of view of implementation, and in the type of associativity they provide. We will also discuss some of the applications of the associative-addressing capability. In particular, we will consider methods for organizing indices, two dimensional tables, trees, and various relational data structures.
A general personnel information retrieval system in APL
Authors: K. K. Wing, Y. K. Wong
Venue: Proceedings of the eighth international conference on APL (1976)

This paper describes an information retrieval system originally conceived for use in a personnel management environment. However, it is perfectly general and readily applicable to other areas. The data are stored in the form of an inverted file. Laymen with no prior exposure to APL can use the system for automatic report generation, frequency distributions and other information retrieval routines as well as simple statistical calculations. Ease of use is achieved via the construction of a simple syntactic structure.
Selection of microprocessor equipment
Authors: Edgar Maymon, Daniel Tabak
Venue: Proceedings of the 5th annual symposium on Computer architecture (1978)

A system selection procedure, proposed in a previous paper is implemented in the selection of microprocessor equipment to satisfy specified design criteria. The procedure is composed of stages involving curve fitting and minimization. A particular example, illustrating the implementation of the procedure, along with final recommendations, is presented.
Computer-1&mdash;a modern simple computer to introduce computer organization and assembler language programming
Authors: Donald S. Miller
Venue: Proceedings of the fourteenth SIGCSE technical symposium on Computer science education (1983)

COMPUTER-1 is an interactive editor/assembler simulator-debugger and program evaluator to be used as an instructional tool for an introductory course in computer organization and assembler language programming. COMPUTER-1's organization, assembler language and interactive facilities are designed to introduce basic concepts of computer architecture and assembly language programming while minimizing the amount of computer system dependent details present during this learning period. COMPUTER-1 is a decimal machine with a small modern single address instruction repertoire. A run-time view into COMPUTER-1's memory and registers is provided to help in program understanding and debugging. COMPUTER-1 provides a flexible instructor-oriented method for specifying and evaluating programming assignments and a way for students to determine whether and how well their programs have worked. COMPUTER-1 runs under UNIX and presumes the availability of a CRT with full-screen cursor addressability. COMPUTER-1 is a modern descendent of BASIC1 [1] in that it simulates a more contemporary architecture and possesses interactive features which are not tied to the capabilities of hard copy terminals or card readers.
Translations on a context free grammar
Authors: A. V. Aho, J. D. Ullman
Venue: Proceedings of the first annual ACM symposium on Theory of computing (1969)

Two schemes for the specification of translations on a context-free grammar are proposed. The first scheme, called a generalized syntax directed translation (GSDT), consists of a context free grammar with a set of semantic rules associated with each production of the grammar. In a GSDT an input word is parsed according to the underlying context free grammar, and at each node of the tree, a finite number of translation strings are computed in terms of the translation strings defined at the descendants of that node. The functional relationship between the length of input and length of output for translations defined by GSDT's is investigated. The second method for the specification of translations is in terms of tree automata - finite automata with output, operating on derivation trees of a context free grammar. It is shown that tree automata provide an exact characterization for those GSDT's with a linear relationship between input and output length.
Symbolic algebra in theoretical seismology
Authors: E. Nyland, C. H. Chapman
Venue: Proceedings of the second ACM symposium on Symbolic and algebraic manipulation (1971)

The solution of those systems of partial differential equations which arise in elastic wave propagation can be aided in some respects by the use of symbolic algebra manipulations on a digital computer. A serious difficulty in the algebra is the lack of ability torecognize more than trivial simplifications. It is possible to manipulate Legendre and Bessel functions with confidence, but algebraic swell leads to exorbitant core requirements. Investigation of algebraic details of aspects of a problem in wave scattering is feasible.
A microprocessor-assisted graphics system
Authors: Griffith Hamlin,  Jr., Thomas Crockett
Venue: Proceedings of the 5th annual conference on Computer graphics and interactive techniques (1978)

GRAF80 is a small scale graphics system designed to demonstrate some of the capabilities offered by microprocessor-assisted graphics. As such, it employs both hardware and software techniques. The system implements in a microprocessor a subset of the features of the SIGGRAPH-ACM CORE (1) graphics package, including picture segmentation and a subset of the output primitives and primitive attributes.
Evaluation and performance of computers: the program monitor&mdash;a device for program performance measurement
Authors: C. T. Apple
Venue: Proceedings of the 1965 20th national conference (1965)

IN 1961 A GROUP was established within IBM to test systems programs before they were released for customer usage. The goal of this group was to assure IBM management that each program released would be satisfactorily usable by the customer. One step taken by this group was to develop a monitor device which would permit programmers to record information being handled by the CPU during execution. Their intent was to use this recorded information to analyze the basic nature of programs with a goal of developing more adequate tests of a system program. Another potential use for this device was the measurement of hardware performance, such as disk-arm motion, at microsecond levels.
Single Camera Multiplexing for Multi-Target Tracking
Authors: Chiraz BenAbdelkader, Philippe Burlina, Larry Davis
Venue: Proceedings of the 10th International Conference on Image Analysis and Processing (1999)

This paper considers the problem of designing a real-time surveillance system, equipped with a single camera on a pan/tilt platform, to track multiple moving targets within the camera's field of regard. The objective is to maintain motion trajectory information of as many of these targets as possible, and for as long as possible. Because the camera can only capture a fraction of the field of regard at any one time, it may not be possible to track all targets of interest at once. The problem can hence be viewed as one of time-sharinga scarce resource (the camera) among multiple contending users (the targets).For this, we propose a system architecture that consists of two modules: one that handles the high-level time-allocation (target scheduling) issue within a queuing theory framework, and another that handles low-level localized detection and tracking of a target, based on principles of recursive filtering (estimation) and feedback control. Effective operation of the system relies on ability to accurately determine the two key parameters for each target: how much tracking time to allocate to it, and how often to re-schedule it.
Some ideas on data types in high level languages
Authors: David Gries, Narain Gehani
Venue: Proceedings of the 1976 conference on Data : Abstraction, definition and structure (1976)

We explore some new and old ideas concerning data types; what a data type is, overloading operators, when and how implicit conversions between programmer data types should be allowed and so forth. The current notion that a data type is a set of values together with basic operations on that set leads us to conclude that formal parameter types need not be so explicitly stated. Given a formal parameter X with operations &sgr;1,...,&sgr;n being performed on X within a procedure, one should be able to supply, as actual parameters in a call, a variable of any type which has operations &sgr;1,...,&sgr;n defined on it. We introduce a notation for this, using PASCAL as a base language, illustrate the added flexibility it gives us, and show briefly how to implement the idea efficiently.
A many-state Markov model for the estimation and prediction of computer software performance parameters
Authors: Ashok K. Trivedi, Martin L. Shooman
Venue: Proceedings of the international conference on Reliable software (1975)

A many-state Markov model has been developed for the purpose of providing various performance criteria for computer software. The software system under consideration is assumed to be fairly large, of the order of 105 words of code, so that statistical deductions become meaningful, and is assumed to initially contain an unknown number of unknown bugs. The model provides estimates and predictions of the most probable number of errors that will have been corrected at a given time t in the operation of this software package based on preliminary modeling of the error occurrence rate &lgr; as well as the error correction policy &mgr;. The model also provides predictions for the availability A(t) and for the reliability R(t) of the system. The differential equations corresponding to the Markov model are solved for the case when &lgr; and &mgr; are constant using an exact (closed-form) solution. The numerical solution is also obtained for this case for verification and demonstrative purposes. The more interesting and important case, from an applications point of view, is that when &lgr; and &mgr; are not constant, but rather functions of the state of debugging achieved. This case is solved numerically only, since the exact solution is cumbersome. It is also demonstrated that the numerical solution is superior to the so-called exact solution. Finally, some extensions and modifications of the basic Markov model are briefly discussed.
An architecture for application of artificial intelligence to design
Authors: J. R. Dixon M. K. Simmons, P. R. Cohen
Venue: Proceedings of the 21st Design Automation Conference (1984)

An architecture for application of artificial intelligence to engineering design is presented and discussed. The architecture places emphasis on evaluation and redesign, thus reflecting the iterative nature of the design process. Six independent knowledge sources are included having the following functions: initial design, evaluation, acceptability decisions, redesign, user-designer input, and flow of control. A &ldquo;blackboard&rdquo; is used to store and exchange information among the knowledge sources. The implementation of the architecture is illustrated with two examples from the mechanical design domain: v-belt drives and extruded aluminum shapes.
Hierarchical modeling and simulation in VISTA
Authors: Robert I. Gardner, Paul B. Weil
Venue: Proceedings of the 16th Design Automation Conference (1979)

The Missile Systems Group of Hughes Aircraft Company has defined the need for an LSI design capability that can produce very rapid designs of large digital and hybrid processors. These processor designs are characterized by: 100,000 gates/processor 10.000 gates/chip 10 LSI chips/processor The goal for this LSI design capability is to be able to design and fabricate a system in 12 months elapsed time, with half of that time allocated to design and half allocated for mask making, chip processing, testing, and system integration (figure 1). A computer aided design system named VISTA (VLsI Simulation Test and Artwork) is currently being developed to answer this LSI design need (figure 2). One aspect of this design system is the modeling and simulation facility that supports hierarchical design.
An input interface for a real-time digital sound generation system
Authors: Paul E. Dworak, Alice C. Parker
Venue: Proceedings of the 3rd annual symposium on Computer architecture (1976)

A man/computer input interface is described in this paper. This interface allows human control of the frequency, amplitude, spectral content and envelope of real-time sound production. The interface consists of a two-dimensional array of keys for entering data, latches and comparators to signal changes in key depression, hardware for scanning the keyboard and address generation logic. Both the fundamental frequency represented by each key column and the harmonics of each frequency&mdash;represented by each element in the column&mdash;are programmable. Amplitude and envelope are software controlled. Applications of the interface instrument range From music composition to clinical use in auditory testing. The interface is part of an electronic sound generation system presently being designed and constructed.
TOYCOM - a tool for teaching elementary computer concepts
Authors: Robert W. Sebesta, James M. Kraushaar
Venue: Proceedings of the eleventh SIGCSE technical symposium on Computer science education (1980)

Many of those who teach introductory computing courses have recognized the pedagogic value of a very simple computer model. A large number of introductory textbooks on computing contain a section explaining the logical components of such a system (1, 2, 3, 4, 5, 6, 7,8). These usually include an introduction to assembler language and machine level programming of a machine which is sometimes called the minimum configuration computer model. All of the previously implemented models of which we are aware have been constructed to operate in batch mode. After having used such systems for some time, we felt that they too soon introduced students to the aggravation of mispunched cards and long waits for runs, only to discover minor syntactic errors. We felt that the simple computer model's pedagogic value would be significantly increased by implementing it in the interactive mode. In order to test this thesis, we have designed and implemented such a system. Our interactive computer model is named TOYCOM, an obvious acronym for toy computer. TOYCOM is a submonitor-assembler-interpreter which can be collectively called a simulator. It presently runs as a submonitor under BASIC-PLUS, which runs under the RSTS-E operating system of the medium to large-scale DEC PDP-11 minicomputers. It is also written in BASIC-PLUS.
An integrated small computer laboratory using a central disk storage facility
Authors: J. M. Moshell, C. E. Hughes, R. M. Aiken
Venue: Proceedings of the ninth SIGCSE technical symposium on Computer science education (1978)

One of the most important developments in the 70's has been the introduction of microcomputers. The impact of these systems presents a major challenge for computer educators today and in the foreseeable future. Though educators have tried to adapt to this rapid change in technology, only recently have articles appeared describing experiences in integrating micro-systems in Computer Science curricula (5,6). Though each paper covers different topics in varying degrees of depth, almost all the authors agree that having a micro-lab facility provides students with exposure to concepts and problems such as: - actual hardware - computer operation - operating systems - backup procedures - time dependent coding - program size problems - inter-computer communications - scheduling - maintenance - computer management. These are the types of problems students will encounter after graduation and this laboratory provides them with actual experience that previously was not available.
The programming language EFL
Authors: S. I. Feldman
Venue: ACM SIGNUM Newsletter (1979)

EFL is a comprehensive language designed to make it easy to write portable, understandable programs. It provides a rich set of data types and structures, a convenient operator set, and good control flow forms. The lexical form is easy to type and to read. EFL was originated by A. D. Hall. The current author completed the design of the language and wrote the current compiler. Whenever possible, EFL uses the same forms that Ratfor [1] does; in this sense EFL may be viewed as a superset of Ratfor. EFL is a well-defined language; this distinguishes it from most &ldquo;Fortran preprocessors&rdquo; which only add simple flow of control constructs to Fortran.
A microprogramming language-directed microarchitecture
Authors: Ronald M. Guffin
Venue: Proceedings of the 15th annual workshop on Microprogramming (1982)

A microarchitecture designed for high performance, control store efficiency, and ease of microprogramming is described. These objectives were achieved by orienting the design to support the requirements of a powerful higher-level-like microprogramming language. 1, 2 The language is machine dependent and achieves efficiency of execution and space, as well as compactness of expression through relatively powerful constructs such as partial field operations and by permitting appropriate suboptions to be coupled with each of the various constructs. The relative utility of the various constructs is indicated by a statistical analysis of an actual emulator.
Tutorial on simulation output analysis
Authors: Lee W. Schruben
Venue: Proceedings of the 9th conference on Winter simulation - Volume 1 (1977)

Technical details of various approaches to the analysis of simulation output are presented in other sessions of this conference and have been the topic of previous Winter Simulation Conference sessions. This tutorial will include an introduction to many of these techniques but the focus is on particular problems in translating classical statistical methodologies to the simulation environment. A simulation experiment is often conducted to estimate some unknown parameter (scalar or vector) on which a decision is to be based. Furthermore the decision is likely to involve considerable risk; otherwise, the relatively expensive and time consuming methodology of computer simulation should not be employed. From this it follows that estimates are of little value unless their accuracy can be assessed. So-called &ldquo;point estimates,&rdquo; while useful in other phases of a simulation project such as distribution fitting and testing, are not nearly as meaningful in summarizing output. At this stage of a simulation study (when the model influences actual decisions) interval estimates or confidence intervals become an important form for presenting results.
SIMSCRIPT II.5@@@@ tutorial
Authors: Edward C. Russell
Venue: Proceedings of the 16th conference on Winter simulation (1984)

This tutorial will present the highlights of the SIMSCRIPT II.5 approach to building discrete event simulation models. The approach will be to construct a small example problem, implement the program in SIMSCRIPT II.5, and then to display the modularity which is possible with SIMSCRIPT II.5 by adding several "real-world" complexities to the model.
Register allocation for free: The C machine stack cache
Authors: David R. Ditzel, H. R. McLellan
Venue: Proceedings of the first international symposium on Architectural support for programming languages and operating systems (1982)

The Bell Labs C Machine project is investigating computer architectures to support the C programming language.1 One of the goals is to match an efficient architecture to the language and the compiler technology available. Measurements of different C programs show that roughly one out of every twenty instructions executed is either a procedure call or return.2 Procedure call overhead is therefore a very important consideration in the overall machine design. A second and related area of primary concern in overall machine efficiency is the register allocation strategy. While use of additional registers can offer considerable improvement in execution times, adding registers usually has the adverse effects of increasing the procedure call overhead due to register saving and creating an undue burden on the compiler. In this paper we describe a piece of the C Machine architecture which effectively eliminates the register allocation problem, and improves procedure calling by drastically reducing storage references required by traditional register saving. The technique can be generalized for other languages and architectures, though we will only directly address those issues involving the C language.
Simulation on microcomputers the development of a visual interactive modelling philosophy
Authors: J B Macintosh, R W Hawkins, C J Shepherd
Venue: Proceedings of the 16th conference on Winter simulation (1984)

This paper describes the development of a visual interactive modelling philosophy in Ford of Europe. The challenges of developing large visual interactive simulations on microcomputers are discussed together with the methods adopted by the authors for overcoming them. The benefits of modelling in this manner are also discussed and two case studies are presented.
Computer implementation of multiple comparisons with the best and selection procedures
Authors: Jason C. Hsu
Venue: Proceedings of the 15th conference on Winter Simulation - Volume 2 (1983)

The lack of computer software for Ranking and Selection has often been cited as a reason for it not having caught on in practice (Hayes 1982). Actually, this lack of software was a manifestation of some deeper perceived difficulties with practical usage, we believe. It was perceived that Bechhofer's (1954) Indifference Zone selection type inference was unavailable for single-stage experiments. The Multiple Comparisons with the Best (MCB) result of Hsu (1981) showed that not only is it available for single-stage experiments, it can be given simultaneously with Gupta's (1965) Subset Selection inference without decreasing the minimum confidence level of either. It has also been perceived that the unequal sample size case requires more complex methodologies than the equal sample size case. It is pointed out in Hsu (1983) that, so long as the analysis is performed on the computer, there needs to be no difference in methodology between the two cases. Based on these recent developments, a computer package has been written for Multiple Comparisons with the Best. Given the data (equal sample size or not) and the desired confidence level p* (&equil;1&minus;&agr;), the first page output includes Subset Selection inference and Indifference Zone selection inference (extended to single-stage experiments), while the second page output gives the confidence intervals inference of Hsu (1981, 1982). All the inferences are guaranteed to be correct simultaneously with a probability of at least P*. The result of analysis of some water filter data using an earlier version of the package has been reported in Lorenz, Hsu, and Tuovinen (1982).
Superlinearly convergent methods for unconstrained minimization problems
Authors: Klaus Ritter
Venue: Proceedings of the ACM annual conference - Volume 2 (1972)

Several methods of conjugate directions and quasi-Newton-methods are discussed as special cases of a general gradient method for which convergence results are established without assumptions on the second derivative of the function to be minimized. It is shown that the methods are superlinearly convergent under rather weak assumptions on the second derivative.