ppxscal/embedding_network huggingface dataset:
Indeterminacy, monitors, and dataflow
Authors: Arvind, Kim P. Gostelow, Wil Plouffe
Venue: ACM SIGOPS Operating Systems Review (1977)

The work described in this paper began with a desire to include some linguistic concept of a resource manager within a dataflow language we have been designing [AGP76]. In doing so, we discovered that dataflow monitors (resource managers) provide a natural way of thinking about resources and especially their scheduling. Dataflow semantics are based upon a program composed of asynchronous operators interconnected by lines along which data tokens (messages) flow, such that when all of the input tokens for a given operator have arrived then that operator may fire (execute) by absorbing the input tokens, computing, and producing an output token as its result. These operations closely match one's intuitive model of resource managers (operators) passing signals (tokens) to one another for the purpose of synchronizing and scheduling resource usage. Previously though, dataflow languages [D73, K73, W75] have dealt only with the expression of highly asynchronous yet determinate computations; however, resource management characteristically involves indeterminate computation. The introduction here of dataflow monitors and an explicit nondeterministic merge operator for dataflow streams makes dataflow very well suited for expressing interprocess communication and operations on resources.
Estimates of distributions of random variables for certain computer communications traffic models
Authors: E. Fuchs, P. E. Jackson
Venue: Proceedings of the first ACM symposium on Problems in the optimization of data communications systems (1969)

A study of multiaccess computer communications has characterized the distributions underlying an elementary model of the user-computer interactive process. The model used is elementary in the sense that many of the random variables that generally are of interest in computer communications studies can be decomposed into the elements of this model. Data were examined from four operational multiaccess systems, and the model is shown to be robust; that is, each of the variables of the model has the same distribution independent of which of the four systems is being examined. It is shown that the gamma distribution can be used to describe each of the continuous variables of the model, and that the geometric distribution can be used to describe the discrete variables. Approximations to the gamma distribution by the exponential distribution are discussed for the systems studied.
B4Tran: A structured mini-language approach to the teaching of Fortran
Authors: Loren P. Meissner, Ruth L. Hinkins
Venue: Proceedings of the fifth SIGCSE technical symposium on Computer science education (1975)

Although senior computer scientists at major universities deplore the continued widespread use of Fortran in beginning computing courses, the fact remains that half a million college students each year are enrolled in courses that include Fortran proficiency as a major objective. If these students are to learn about program structure, ways must be found to teach this concept in Fortran courses. We propose the use of a structured mini-language, rather than a preprocessor, at the beginning of such a course. The B4Tran language has been designed as a subset of an extended Fortran dialect. It introduces alternative structures and iterative structures by using labelled statements to delimit the ends of blocks, in a manner analogous to the indexed DO block of Fortran. Controlled alternatives to GO TO are also provided. Some features of Fortran that cause difficulty for beginning students are omitted. All variables are of a single (&ldquo;real&rdquo;) type. Input and output are format-free. B4Tran runs as an interpreter; thus it can furnish improved feedback to the programmer during execution.
An implementation of a multiprocessing computer system
Authors: William B. Ackerman, William W. Plummer
Venue: Proceedings of the first ACM symposium on Operating System Principles (1967)

A PDP-1 computer was donated (by the Digital Equipment Corporation) to the Electrical Engineering Department of the Massachusetts Institute of Technology in late 1961. In May, 1963 the first time-sharing system was operational. Since 1963 this PDP-1 has undergone substantial modifications (c.f. Appendix). Presently the machine has twelve thousand words (18-bit) of five microsecond memory arranged in pages of four thousand words. One of these pages is reserved for the system code and is protected from user references.
Computing education for secondary school teachers: A cooperative effort between computer scientist and educators
Authors: C. Jinshong Hwang, Gerald Kulm, Grayson H. Wheatley
Venue: Proceedings of the twelfth SIGCSE technical symposium on Computer science education (1981)

The proposed program will establish a Computer Education Institute for computing, mathematics, and science teachers and supervisors in grade 7 to 12. The goals of the program are to: (1) provide teachers with a knowledge of programming in BASIC, and conceptual foundations of computer programming, (2) inform teachers of the variety of uses of computers in teaching science and mathematics, (3) provide an opportunity to observe and interact with youngsters as they learn to program, (4) establish a focus for teachers' future needs in computer education through contact with qualified scientists, and (5) develop and update teachers' knowledge about computers in society. The objectives will be accomplished through enrollment during a six-week summer session in a Structured Programming seminar and a Computer Education seminar. Intensive practice in a computer lab will develop programming skills. During the fall semester, four Guest Speaker Seminars will be held to provide nationally recognized experts as a resource. These meetings will also provide the program participants an opportunity to discuss their own implementation progress with the Institute staff.
Using Relevance Feedback to Learn Visual Concepts from Image Instances
Authors: Jun-Wei Hsieh, Cheng-Chin Chiang, Yea-Shuan Huang
Venue: Proceedings of the 10th International Conference on Image Analysis and Processing (1999)

This paper presents a novel method to retrieve images by learning the embedded visual concept from a set of given examples. Through user's relevance feedback, the visual concept can be effectively learned to classify images which contain common visual entities. The learning process is started by providing a set of either positive or negative training examples and is then interactively adjusted according to the user's relevance feedback. Different from the traditional methods, the proposed method utilizes a novel way to overcome the under-training problem which is frequently suffered in learning process. Since no time-consuming optimization process is involved, the proposed method learns the visual concepts extremely fast. Therefore, the target concept can be learned on-line and is user-adaptable for effective retrieval of image contents. Experimental results are provided to prove the superiority of the proposed method.
Computer-controlled display demonstrations of dynamic concepts in computer science
Authors: David R. Levine
Venue: Proceedings of the ACM SIGCSE-SIGCUE technical symposium on Computer science and education (1976)

Computer Science contains a large number of new concepts well outside most students' prior experience. An important characteristic of many of these concepts is their dynamic nature: the execution of a program, assignment of a value to a variable, change of machine state following an interrupt, convergence on a root. By using the computer itself as my demonstration apparatus, I propose to give the students personal exposure to the concepts in action. With a low-cost interactive CRT terminal and video projector, I can show various aspects of a program executing, for instance, at comparatively low investment in machine and people time.
Diagnosis and treatment in MEDAS (medical emergency decisions and assistance system)
Authors: Moshe Ben-Bassat, Edward Lipnick
Venue: Proceedings of the 1977 annual conference (1977)

MEDAS is a multicomponent computer aided medical decision and information system for emergency and critical care medicine. The capabilities of the system are briefly outlined and the diagnostic and treatment components are described in more detail. For diagnosis a modified version of the sequential Bayesian approach is utilized. This version allows simultaneous diagnosis of multiple disorders. For treatment, a modular approach is adopted by which complex protocols are viewed as a hierarchical structure of low level modules.
An experiment in microprocessor-based distributed digital simulation
Authors: Dana L. Wyatt, Sallie Sheppard, Robert E. Young
Venue: Proceedings of the 15th conference on Winter simulation - Volume 1 (1983)

This paper discusses the design of a distributed simulation system which will utilize off-the-shelf microprocessors in its implementation. Alternative approaches to the assignment of simulation functions and processes are presented. A project currently underway at Texas A M University is described which considers the impact of distributed architectures on the design of simulation language support systems. The emphasis in this research project is to produce an operational prototype which can be used to establish the feasibility and utility of distributed simulation.
A simplification heuristic for large flow tables
Authors: R. J. Smith,  II, J. H. Tracey
Venue: Proceedings of the 7th Design Automation Workshop (1970)

Flow tables specifying large asynchronous sequential circuits often contain more internal states than are required to specify desired circuit behavior. Known minimization techniques appear unsuited for reduction of such large (rows &times; columns > 250) flow tables, because of excessive computation and intermediate data requirements for problems of this size. The algorithm described here is intended to rapidly produce a simplified&mdash;but in general non-minimal&mdash;flow table. It is most economical when applied to extremely large tables and was devised primarily for automated design applications. The procedure has been programmed in PL/1 and has been incorporated into an asynchronous sequential circuit design automation systeml developed at the University of Missouri&mdash;Rolla. Typical flow table simplification times obtained using the program are cited. In one test reduction of a 217 row &times; 8 column table to 39&times;8 required about 2.6 minutes (the minimum table in this case was known to be 23&times;8).
SLAM tutorial
Authors: A. Alan B. Pritsker, Claude Dennis Pegden
Venue: Proceedings of the 10th conference on Winter simulation - Volume 1 (1978)

SLAM is a simulation language that allows for alternative modeling approaches. It allows systems to be viewed from a process, event, or state variable perspective. These alternate modeling world views are combined in SLAM to provide a unified systems modeling framework (1). In SLAM, a discrete change system can be modeled within an event orientation, process orientation, or both. Continuous change systems can be modeled using either differential or difference equations. Combined discrete-continuous change systems can be modeled by combining the event and/or process orientation with the continuous orientation. In addition, SLAM incorporates a number of features which correspond to the activity scanning orientation.
Software development staffs in the seventies and eighties
Authors: Herbert Nalsel
Venue: Proceedings of the 1979 annual conference (1979)

This talk will focus on staffing for software development, but first some background. The four principal components of computer systems are hardware, software, files and people. Substantial improvements In hardware are obtained by providing an opportunity for electronic engineers and physicists to develop new designs. In this area there is a substantial body of knowledge underlying the design process. College and university degrees are just about mandatory for entry Into the field of hardware design. There is a less well-defined body of knowledge appropriate to the development of software and to the processing of files. We learned something from the large scale software projects of the sixties and the principles of software engineering are becoming more and more relevant to software development but we still have a long way to go. Data base techniques have Impacted our file handling methods but it may be that hardware developments will have a more profound Impact on our file handling problems by providing such things as associative memories, megabit chips, and more and more cost effective disk systems. In any case, it is clear that a body of knowledge is evolving that is relevant to software development. Staffing for software development in the seventies has taken this into account in a variety of ways. Data is presented that indicates the extent to which systems analysts and programmers have been expected to have degrees in computer-related subjects in the seventies and predictions are made for the eighties. Increasing numbers of short seminars are being conducted by universities, computer manufacturers and training specialists. The conclusion that is reached is that the seventies and eighties are transition periods during which software development staffs in business data processing will be required more and more often to present formal evidence of having mastered a body of knowledge by successfully completing a degree program and/or passing a written examination administered by a certifying authority.
Custom VLSI electrical rule checking in an intelligent terminal
Authors: L. V. Corbin
Venue: Proceedings of the 18th Design Automation Conference (1981)

An extension to a language-based custom VLSI design approach is proposed in which the designer supplies just enough up-front semantic information to allow a substantial amount of beneficial design consistency checking with a minimum of computation. The computational load is reduced by using a bottom-up hierarchical design approach, with incremental checking as the design is built. The load is also reduced by imposing minor restrictions upon the layout designer, by requiring that all active elements be prechecked, and by attaching &ldquo;type&rdquo; attributes to interconnecting signals. The method is very efficient for highly &ldquo;regular&rdquo; designs. Checks performed are geometrical design rules, connectivity, static electrical consistency, and node rise-and-fall times.
Typographic design for interfaces of information systems
Authors: Aaron Marcus
Venue: Proceedings of the 1982 conference on Human factors in computing systems (1982)

Principles of information-oriented graphic design have been utilized in redesigning the interface for a large information management system. These principles are explained and examples of typical screen formats are shown to indicate the nature of improvements.
Graphic image handling in a multi-media system
Authors: Ralph Stromquist
Venue: Proceedings of the 3rd annual ACM SIGUCCS conference on User services (1975)

The Graphics Subroutine Package (GSP) developed at the Madison Academic Computing Center provides the software needed to generate or manipulate graphic images on the MACC central computer and direct the output to several different local or remote devices. MACC provides batch processing and timesharing services both locally and remotely via telephone communications lines. A goal is to make graphics services easily accessable with the least possible amount of user effort under either the batch processing or timesharing modes of operation. By careful attention to default parameter settings and built-in sensitivity to the users operating mode, the GSP works equally well for creating plotter output or interactive graphic terminal displays without program changes.
Extensibility in Simula 67
Authors: Jean D. Ichbiah
Venue: ACM SIGPLAN Notices (1971)

Simula 67 is a general purpose language developed at the Norwegian Computing Center. It evolved from an earlier simultation language called Simula 1 [1] Dahl and Nygaard however, realized that the problems that had to be solved for the implementation of a simulation language, namely the handling of complex data structures and of quasi-parallelism, were general problems. The language Simula 67 [2,3] was therefore defined as a general purpose language with a mechanism for extensions. The simulation capabilities are thus not defined in the base language Simula 67 but are rather defined by extension. This shows clearly how the language Simula 67, hereafter called Simula, is related to the idea of extensibility.
Understanding arrays
Authors: James A. Brown
Venue: ACM SIGAPL APL Quote Quad (1982)

Papers on general arrays, arrays of arrays, nested arrays, etc. have been in the literature since the early seventies. Many of these papers give readers the feeling that the subject is intricate and requires a large number of functions. Much of the problem was the lack of a notation for talking about such arrays. This paper will discuss a notation for arrays that contain arrays as items and show that the concept of such arrays is easy to comprehend.
Extended polynomial algorithms
Authors: Anthony C. Hearn, Rüdiger G. K. Loos
Venue: Proceedings of the ACM annual conference (1973)

It is shown that standard polynomial algorithms may be applied to a much wider class of functions by making a straightforward generalization of the concept of exponent. The implementation of a computer algebra system from a standard set of polynomial programs which allows for any coefficient or exponent structure is also discussed.
Fundamental GPSS tutorial
Venue: Proceedings of the 6th conference on Winter simulation (1973)

Approach to modeling in GPSS. Fundamental GPSS blocks, including GENERATE, TERMINATE, SIEZE and RELEASE, ADVANCE, and QUEUE and DEPART. A GPSS &ldquo;case study&rdquo; model for a one-line, one- server queuing system. Internal logic of the GPSS processor, including the current and future events chains, and a numeric example explaining how the processor simulates with the one-line, one-server model.
Generating negatively correlated gamma variates using the Beta-Gamma transformation
Authors: Peter A. W. Lewis
Venue: Proceedings of the 15th conference on Winter simulation - Volume 1 (1983)

The Beta-Gamma transform changes a Gamma distributed variate with shape parameter k into a Gamma variate with shape parameter q, where q is less than k. Using this transformation a scheme is given for generating negatively correlated Gamma variates, each with parameter k. The scheme can be implemented with nothing but a generator of Gamma deviates. It requires no inverse probability integral transform for Gamma variates.
A hardware description language for processor based digital systems
Authors: J. H. Tracey, K. S. Kumar
Venue: Proceedings of the 19th Design Automation Conference (1982)

A new HDL (Hardware Description Language) for describing processor modules and support chips is presented in [1,2]. This paper presents a portion of the dissertation and illustrates the effectiveness of the new descriptive technique in describing complex digital systems with example descriptions of the PDP-11 computer system and the 2900 bit-slice components. The examples presented illustrate that the descriptive technique allows functional abstraction not only at the chip interface level (as in the M6800 system description presented in [1,2]) but also at the subsystem (or PCB module) level (as shown in the PDP-11 example). Language modifications and enhancements to increase the power of the language are also presented.
Nial: A candidate language for fifth generation computer systems
Authors: C. D. McCrosky, J. J. Glasgow, M. A. Jenkins
Venue: Proceedings of the 1984 annual conference of the ACM on The fifth generation challenge (1984)

The anticipated fifth generation of computing systems presents many challenges. One of the more important is the challenge of designing languages suitable for describing the parallel computations which these systems will achieve. The new systems will outpace the expressive power of most existing languages. As the hardware components and AI techniques are developed to achieve the fifth generation, so must appropriate languages be created. Another view of the fifth generation is that it is to be distinguished from previous systems, in large part, by being language driven. That is, the abstraction of some functional language is to be the driving force behind the machine design, and that potential parallelism in the language should motivate parallelism in the machine.
Symbolic computer graphics and biological models
Authors: Mark W. Horovitz, Donald M. Austin, Harvard H. Holmes
Venue: ACM SIGGRAPH Computer Graphics (1972)

In the first part of my talk I will describe the operation of a symbolic graphics computer system; next, I will show how some models can be implemented by using this system, and finally I want to discuss techniques for establishing the validity of models.
Assessing Air Force logistics support: A simulation approach
Authors: Thomas D. Clark,  Jr., Robert K. Rasmussen, William D. Stover
Venue: Proceedings of the 13th conference on Winter simulation - Volume 1 (1981)

The study reported in this paper focuses upon the computer simulation of the operational needs of U.S. Air Force units. The model is used to determine support requirements for wartime operations and to assess a unit's ability to sustain those operations. The model used to illustrate the concept is of a War Reserves Supply Kit stockage requirements.
Using a behavioral theory of program comprehension in software engineering
Authors: Ruven Brooks
Venue: Proceedings of the 3rd international conference on Software engineering (1978)

A theory is presented of how a programmer goes about understanding a program. The theory is based on a representation of knowledge about programs as a succession of knowledge domains which bridge between the problem domain and the executing program. A hypothesis and verify process is used by programmers to reconstruct these domains when they seek to understand a program. The theory is useful in several ways in software engineering: It makes accurate predictions about the effectiveness of documentation; it can be used to systematically evaluate and critique other claims about documentation, and it may even be a useful guideline to a programmer in actually constructing documentation.
Using Prolog to implement a compiler for a parallel image processing language
Authors: P. J. Morrow, D. Crookes
Venue: Proceedings of the 1995 International Conference on Image Processing (Vol. 1)-Volume 1 - Volume 1 (1995)

This paper describes the use of Prolog as an implementation language for a compiler for a parallel image processing language. The target machine for which code is generated is an abstract model for parallel image processing. The structure of the final compiler closely reflects the BNF syntax definition of the image processing language thus allowing ease of implementation and maintainability to be achieved with relatively little effort.