ppxscal/embedding_network huggingface dataset:
System description of the JHU emulation laboratory
Authors: Charles Neuhauser
Venue: Conference record of the 7th annual workshop on Microprogramming (1974)

The emulation laboratory described in this paper is being implemented at Johns Hopkins University as a research and educational facility. Currently, we are planning to use this laboratory to support research in the following areas: 1) Examination of and experimentation with novel system architectures, 2) Evaluation of various directly executed language (DEL) structures and the effective structure of their associated base machines [4], and 3) Dynamic analysis of the Performance of current machine organizations by a combination of emulation and embedded data collection routines. The design of the emulation laboratory and, particularly, the host machine have evolved from several seminars given at Johns Hopkins [1], [2], [3]. From these discussions we felt that there were several important features that our laboratory should include.
GPDS - a new simulation language
Authors: Philip S. Becker,  Jr.
Venue: Proceedings of the 5th conference on Winter simulation (1971)

XDS has developed the General Purpose Discrete Simulator (GPDS) System which runs on its Sigma computing systems in either a time-shared or batch environment. GPDS is an extension of GPSS. Enhancements include a matrix library feature and the capability of automatically segmenting a model into overlay sections and storing these sections on a direct-access device. Other improvements to GPSS include the ability to use indirect addressing with any entity instead of just parameters, two new blocks that can locate other transactions and access data from them, and the ability to terminate a simulation when a steady-state condition is reached. This paper briefly discusses the design philosophy behind GPDS and then examines the enhancements incorporated in the language. The discussion includes some examples that illustrate the use of these new features and suggests some new modeling techniques which are now available to the user.
High-speed buffering for variable length operands
Authors: H. L. Tredennick, T. A. Welch
Venue: Proceedings of the 4th annual symposium on Computer architecture (1977)

Variable word length processing is valuable for data base manipulations, editing functions in time-sharing systems, input-output data formatting, and vector operations, but current computer architectures seldom provide efficient means for manipulating variable length operands. A specialized computer architecture has been proposed to deal with the problems of variable length byte string processing. Operand buffering is a key part of the proposed architecture because the buffer: (1) replaces registers for variable length operands, (2) resolves address precision and operand boundary problems between the main memory and the ALU, and (3) can provide simultaneous access to several operands for faster execution. General observations are made about requirements which constrain memory buffer design and the merits of four memory buffering schemes are discussed. The most suitable of the buffering schemes is discussed in some detail. This scheme provides a separate cache for each of the operands. Hardware costs and timing considerations are given, and show that the multiple-buffer approach to variable word length buffering provides a reasonable cost-performance solution.
CELLSIM: A digital simulation language for cell kinetic modelling
Authors: Charles E. Donaghey
Venue: Proceedings of the 1978 annual conference - Volume 2 (1978)

The field of cell kinetics relates to the movement and proliferation of cells through their generative cycle, and how this cycle is affected by chemotherapy treatment. CELLSIM is a discrete, digital simulation language for modelling this process. It allows testing of assumptions about cell kinetics and chemotherapy. The language is interpretive, with the interpreter written in FORTRAN, and has been implemented on a wide variety of computer systems. The language features dynamic memory allocation, arithmetic string manipulation, and the capability of generating random variates from nine classic probability distributions. It uses vocabulary and conventions familiar to the cell kinetics scientist, and is now utilized by some who never before used computers in their research.
A checklist for transporting large user codes
Authors: Paul Messina
Venue: Proceedings of the 5th annual ACM SIGUCCS conference on User services (1977)

In early 1975, the Central Computer Facility of Argonne National Laboratory became saturated with work. The Facility's IBM 370/195 and 360/75 computers were unable to satisfy the needs of the more than fifteen hundred scientific and engineering computer users. Since procurement of additional computers would undoubtedly take a long time, the Computer Center started a project to secure access to and facilitate the use of other large computer installations which had spare capacity. Although the heaviest used sites have IBM equipment, we have run programs on a variety of equipment, including Control Data 7600S and the ILLIAC IV. The programs were frequently very large, up to 100,000 Fortran statements. The project was managed primarily by the User Services Group at Argonne. What follows is a list of the principal areas that required attention in the process of setting up this new service for our users.
Virtual Editing: II. the user interface
Authors: H. A. Wilder, N. F. Maxemchuk
Venue: ACM SIGOA Newsletter (1982)

This is the second half of a two-part report on Virtual Editing. In the first paper, virtual editing was defined and its implementation described. In this paper, a user interface to the editor is described and some of the problems of introducing a new form of communication which conceptually merges various media are discussed. The aim is acceptance by the office worker, or eventual end user. Possible applications for this technology are suggested. In addition, the use of a mouse in the system as a way of entering the user commands is explained.
A type-checking program linkage system for pascal
Authors: R. B. Kieburtz, W. Barabash, C. R. Hill
Venue: Proceedings of the 3rd international conference on Software engineering (1978)

We describe a new software facility useful in the development, debugging, and integration of quasi-independent program modules. It has been implemented in conjunction with a Pascal compiler for IBM 360 computers, but the linkage facility is machine-independent up to the point of formattingsystem object modules. With some minor syntactic extensions to permit the designation of external references, Pascal becomes a powerful language for modular programming. The new linkage subsystem allows the compile-time verification of type-correctness of Pascal programs to be extended uniformly across program module interfaces. This extends not only those diagnostics formerly restricted to compilation, but also the post-mortem diagnostic capability of the progranming system, and without sacrifice of run-time efficiency. The paper also discusses several language issues raised in meeting the requirements of modular programming, as well as implementation considerations.
The minuteman communication network simulator
Authors: W. V. Neisius, E. D. Katz
Venue: Proceedings of the second conference on Applications of simulations (1968)

This is a case history of a very versatile and complex Simscript simulation which has been completed and successfully used since December 1965. Several points are of interest: first, the original approach took maximum advantage of Simscript by concentrating upon the development of a quick and simplified model which could be expanded as additional system details were made available; second, the analysis reports went through a number of versions as experimentation goals were modified; and, finally,the simulation was responsible for uncovering potentially significant system problems.
A threshold selection language
Authors: Barry A. Wittman, Peter Zilahy Ingerman
Venue: Proceedings of the 1967 22nd national conference (1967)

This paper is concerned with a technique which, unlike Boolean-based methods, allows the selecting function to be specified in an intuitive manner, regardless of the complexity of the criteria, where Boolean statements might become quite awkward and lose all but their formal meaning. In order to describe this technique concisely, we find it convenient to introduce a modest amount of formalism to give our description a solid grounding. This process has begun above and will be completed in the next section.
Alternative Approaches To Wiring The Office Of The Future (Panel Discussion)
Authors: David Twyver, David Willard, John Shoch, Richard Strindmo
Venue: Proceedings of the 1978 annual conference (1978)

A new wideband communications infrastructure is needed to serve the diverse communications needs of the office building of the future. The ultimate goal is a communications backbone which can serve not only to couple management work stations, but facsimile terminals, video conferencing, and telephones on the same office network. Approaches range from cable loops to packet nets to all digital PBXs. In this session the speakers will describe various alternatives for solving the intra-facility and local area network problem.
Table lookup techniques for fast and flexible digital logic simulation
Authors: Ernst Ulrich
Venue: Proceedings of the 17th Design Automation Conference (1980)

A well-known fundamental computer technique consists of the &ldquo;interpretation&rdquo; of naturally available or artifically formed data items as addresses to perform table-lookups. Although well-known, this technique is still not exploited to its fullest potential. The power and extent of this technique as applied to logic simulation is demonstrated.
GESOP: A relational data base using generalized arrays and data-base primitives
Authors: Michéle Pierre
Venue: Proceedings of the international conference on APL: part 1 (1979)

This paper presents the results of our research in the use of APL concepts in the development of data-base management systems, and the actual application that resulted'. A brief description is given of APLIXI and its APL interpreter. The theoretical aspects are completed by a general description of the data-base management system GESOP. The application of GESOP to a personnel-management problem is described and examples of its use are given.
Small business applications using a UNIVAC Computing Center
Authors: Paul H. Rosenthal, Paul A. Hunt
Venue: Proceedings of the 1956 11th ACM national meeting (1956)

The small company presents an untouched area for office automation. The problem in applying large scale Electronic Data Processing Equipment to these small companies is discussed. A solution consists of having a UNIVAC Computing Center perform &ldquo;packaged&rdquo; procedures. The Insurance Production Analysis procedure is described and the Sales, Programming and Production problems outlined.
QUICK: A quasi-interactive computer-based instructional system
Authors: Sharon Fletcher, Thomas Luce
Venue: ACM SIGCUE Outlook (1976)

Traditionally, CAI has been characterized by (1) individualized instruction based on performance, and (2) real-time interaction. Efforts to provide CAI on general purpose equipment have not been successful, and as a result many have turned to dedicated equipment (TICCIT, PLATO). An alternate approach to CAI, on general purpose equipment, is proposed in this paper. A typical interaction between a student and a CAI system can be viewed as a stimulus from the system, followed by a response from the student, followed by feedback plus another stimulus from the system. In many applications, the student response interval can be relatively long. The approach used by QUICK is to purposely extend this student response time by means of the type of stimulus issued; then it is no longer necessary to have an interactive program waiting for the student to respond. Instead, the interaction can be accomplished via a batch job triggered by student input. In the QUICK system, the unit of courseware is a task, consisting of information, instructions, and a number of questions to be answered, which may take the student from a few minutes to several hours or days to complete. In a science course, for example, a task might contain instructions for performing an experiment. Such a system has a wide range of applications, from CMI type uses which primarily direct the student to existing materials for study, to CAI type uses which provide tutorials and drill excercises for the student. The QUICK system has been implemented and used in a first year Biology course and an introductory FORTRAN programming course at PURDUE. Student input can be accomplished via several devices - teletype terminal, punched card reader, or marked sense card reader. This paper presents some details of the currently implemented QUICK system, as well as some goals and future directions.
The use of antithetic control variates in computer simulations
Authors: R. C.H. Cheng
Venue: Proceedings of the 13th conference on Winter simulation - Volume 1 (1981)

The method of antithetic variates is a well-known technique for reducing the variability of estimators in computer simulation experiments. However, the usually suggested way of using the method, if incorrectly applied, can lead to an increase in the variance of estimators of certain quantities, such as percentiles. A procedure, based on two non-standard methods of generating samples from the normal distribution, is suggested which does not suffer this weakness. Numerical examples are given showing the ease of implementation and the effectiveness of the procedure.
A measurement of structure for unstructured programming languages
Authors: Gary W. Cobb
Venue: ACM SIGSOFT Software Engineering Notes (1978)

Software Science is a field of Natural Science which deals with the development of measurements which reveal properties of software programs. These measurements are qualified as to their degree of correlation to human beings being able to construct or understand a subject program. Maurice Halstead has pioneered much of the theories in this field ((5) through (10)), which applies statistical and psychological testing techniques to the evaluation of the measurements. The basic inputs to the Halstead predictors are easily measured: the number of distinct operators and operands, and the number of occurrences of the operators and operands. Due to the statistical nature of the measurements, there can be erroneous results when applying them to small sample spaces. However, the predictors are very adequate when applied to large samples, that is, large software systems. In an excellent review article by Fitzsimmons and Love (4), it is pointed out that several of the estimators defined by Halstead assumed that the subject programs were well-structured, and inaccurancy in the predictors can result if they are applied to "unpolished" programs. In fact, Halstead qualified six classes of impurities in code which can cause the length predictor to be inaccurate. The definition of volume for software, another predictor introduced in Halstead's book, is related to the level of the specification of the program. An algorithm which is written in assembly language will have a greater volume than the same algorithm written in Pascal, due to the richness of the semantic constructs that are available in the higher-level languages. Hence, this predictor is language dependent.
Current capabilities of the MACSYMA system
Authors: J. Moses
Venue: Proceedings of the 1975 annual conference (1975)

A short survey of various features of the MACSYMA algebraic manipulation system is given. This system has been under development at M.I.T. since 1969 and contains over 175K words of compiled code at the present time. The MACSYMA system has been under development at Project MAC, M.I.T. since 1969. The system has a wide range of capabilities. It is comprised of over 50 modules and over 175K words of compiled LISP code. It is currently available on a PDP-10 at M.I.T. which is accessed over the ARPA network and on various MULTICS systems. Conversion to other PDP-10 systems is under way. Over 40 articles and reports have been written so far which acknowledge use of the system.
Robust Telop Character Recognition in Video for Content-Based Retrieval
Authors: Minoru Mori, Shoji Kurakake, Toshiaki Sugimura
Venue: Proceedings of the Fifth International Conference on Document Analysis and Recognition (1999)

The recognition of telop characters in video has two problems: edge degradation and background noise. To overcome these problems, this paper proposes; (1) a feature that describes the shape of background region in addition to character region, (2) a classifier that dynamically decreases the influence of noise using the difference in number of pixel within a local area.Experiments show that the two proposals achieve the recognition rate of 76% and the cumulative classification rate within the best ten of 92%. Both values are significantly better than those of conventional methods.
Performance of SNA's LU-LU session protocols
Authors: James P. Gray
Venue: Proceedings of the Computer Network Performance Symposium (1982)

SNA is both an architecture and a set of products built in conformance with the architecture (1,2,3). The architecture is layered and precisely defined; it is both evolutionary and cost effective for implementing products. Perhaps the largest component of cost effectiveness is performance: transaction throughput and response times. For SNA, this involves data link control protocols (for SDLC and S/370 channel DLC's), routing algorithms, protocols used on the sessions that connect logical units (LU-LU session protocols), and interactions among them. SNA's DLC and routing protocols have been discussed elsewhere (4,5,6); this talk examines protocols on sessions between logical units (LU-LU session protocols) and illustrates the results of design choices by comparing the performance of various configurations.
The down-hill method of solving a polynomial equation
Authors: James A. Ward
Venue: Proceedings of the 1956 11th ACM national meeting (1956)

The purpose of this paper is to show a numerical method of determining to any desired accuracy the real and imaginary roots of a polynomial equation, f(x) &equil; 0, with real coefficients. The technique of using this method on a small digital computer is also given. Let f(u + iv) &equil; R(u,v) + iJ(u,v) where R and J are real and let (equation).
Analyzing the logical structure of data flow diagrams in software documents
Authors: G. Butler, P. Grogono, R. Shinghal, I. Tjandra
Venue: Proceedings of the Third International Conference on Document Analysis and Recognition (Volume 2) - Volume 2 (1995)

Understanding software documents requires the logical structure analysis of diagrammatic notations, such as data flow diagrams. A data flow diagram (DFD) represents the functional dependencies within a system: it shows how output values in a computation are derived from input values. We show how the logical structure of a DFD can be described using the formalism of Calculus of Communicating Systems (CCS). We present the process of generating the logical structure, and show how the formalism is used for deep understanding of DFDs. Using the Edinburgh Concurrency Workbench (CWB), we can use the formal description of a DFD to reason about the equivalence of two DFDs, and to simulate the behavior of a DFD.
Two results concerning the power of two-way deterministic Pushdown Automata
Authors: Daniel Martin, John Gwynn
Venue: Proceedings of the ACM annual conference (1973)

It is known that there is no one-way, non-deterministic Pushdown Automaton (INPDA) which is a universal machine for the class of Finite Automata [6]. We will show that there is a two-way, deterministic Pushdown Automaton (2DPDA), U, which is a universal machine for the class of Finite Automata (FA). Our method will parallel Knuth and Bigelow's construction of a language which is not context sensitive but which is the acceptance set of some stack automaton [5], that is, we will construct a language which is not context-free, but which is accepted by a 2DPDA.
CAD for military systems, an essential link to LSI, VLSI and VHSIC technology
Authors: Randolph Reitmeyer,  Jr.
Venue: Proceedings of the 18th Design Automation Conference (1981)

Government involvement in the development of computer aided design (CAD) tools for electronic circuits has a long history. The advent of large scale integrated (LSI) circuits, going into the 1970's, pulsed the development of the &ldquo;standard cell&rdquo; and &ldquo;gate array&rdquo; design methodologies and supporting CAD. Despite these burgeoning technologies, little custom LSI technology found its way into military systems. Custom LSI was considered too costly and risky. Moving into the 1980's we find a vastly different picture. DoD is closing the gap between fielded equipment and the use of advanced IC technology through the VHSIC and other VLSI technology insertion programs. The significance of this, is that CAD has become a critical technology and, as a result, is receiving considerable government funding.
The European side of the last phase of the development of ALGOL 60
Authors: Peter Naur
Venue: ACM SIGPLAN Notices (1978)

In preparing this account of some of the developments leading to ALGOL 60 I have primarily sought to present such relevant information that is readily available to myself, but not otherwise accessible or well known. In addition I have tried to answer the specific questions formulated by the organizers of the Conference on the History of Programming Languages. The notes fall in three freely intermixed groups: those that relate to existing documents, those that reflect my own reasoning as a participant in the development, and those that try to answer the organizers' questions. Where the proper support has been lacking I have left open holes in the presentation. Otherwise I have tried to be specific, giving names, dates, and reasons, as far as I have them available. While this manner of presentation seems to me the best way to support more penetrating historical research into the period, it is also bound to give rise to controversy. First, it is openly one-sided, in the manner that any autobiography is. Further, by being specific the presentation will offer sensitive points of attack to those who see the same development from a different angle and with different eyes. When these circumstances are combined with real events that involved differences of opinion and interest, strong reactions are bound to be provoked. This emerged clearly in the remarks from the reviewers of the draft of the paper.
Computer manpower development in Saudi Arabia
Authors: Charles L. Aird
Venue: Proceedings of the sixth SIGCSE technical symposium on Computer science education (1976)

While looking in ecstasy at the new horizons of computer technology, developing countries often underestimate the computer's dependency upon man. Computers are unlike any other machine. Not unlike many developing countries, the vast petroleum and mineral resources of Saudi Arabia pose complex and challenging problems at all levels of education. The physical resources of the Kingdom far outstrip the human resources. For a country with some 3,000 college graduates as of 1975, the rapid technical and economic developments could easily become too burdensome. Saudi Arabia has few trained personnel for the development and management of modern computer systems, even though the first unit record equipment was installed by the Arabian American Oil Company (ARAMCO) in 1952. The requirements for data processing services has rapidly increased.