ppxscal/embedding_network huggingface dataset:
Symbolic synthesis of digital computers
Authors: Irving S. Reed
Venue: Proceedings of the 1952 ACM national meeting (Toronto) (1952)

In an ideal sense a binary digital computer or what might be called more generally a Boolean* machine is an automatic operational filing system. It is a machine which accepts information automatically in the form of words constructed from an alphabet of only two symbols, say 0 and 1, the so-called binary coded words. For example a binary number is such a word. This information is stored or recorded in sets of elementary boxes or files, each containing one of the symbols 0 or 1. This information is either transformed or used to change other files or itself as a function of the past contents of all files within the system. If the contents of all files within the system are constrained to change only at discrete points of time, say the points n (n &equil; 1,2,3, ...), then the machine may be termed a synchronous Boolean machine. The discussion in this paper will be restricted to the synchronous Boolean machine. It is evident from the above discussion that the content of each elementary box or file within the system is a two valued function, say A(t), of the real parameter time, t. Since the content of each file is constrained to change only at the discrete points of time n?, then a suitable definition for A(t) is the following: Either A(t) &equil; 0 or A(t) &equil; 1 for n? &equil; t < (n+l)? where (n &equil; 0 1,2, ...). In this definition the right continuity of A(t) has been assumed for the sake of definiteness. Let the function A(t) be called a file function.
A new 'building block' for performance evaluation of queueing networks with finite buffers
Authors: Rajan Suri, Gregory W. Diehl
Venue: ACM SIGMETRICS Performance Evaluation Review (1984)

We propose a new 'building block', for analyzing queueing networks. This is a model of a server with a variable buffer-size. Such a model enables efficient analysis of certain queueing networks with blocking due to limited buffer spaces, since it uses only product-form submodels. The technique is extensively tested, and found to be reasonably accurate over a wide range of parameters. Several examples are given, illustrating practical situations for which our model would prove to be a useful performance analysis tool, specially since it is simple to understand, and easy to implement using standard software for closed queueing networks.
The Microprogrammed Controller Concept
Authors: Kenneth J. Thurber, Glen R. Kregness
Venue: Proceedings of the 1977 annual conference (1977)

This paper describes the MPC (Microprogrammed Controller) Concept used at Sperry Univac Defense Systems Division to implement real-time computer emulations. It discusses the concept and reasons for microprogrammed emulation and the basic MPC approach. Enhancements developed for the MPC and their impact are also discussed.
On balancing hardware-firmware for designing a fault-tolerant computers' series
Authors: B. Courtois, G. Saucier
Venue: Proceedings of the 8th annual workshop on Microprogramming (1975)

We will consider here the design of a fault-tolerant computers- series. These computers will utilize the same software, but will have different characteristics such as performance and reliability. We will deal with the influence of the choice between hardware-firmware solutions on these characteristics. In particular, we will be interested by the microprogramming effect on the performance-cost relationships for this series of computers.
Dynamic memory management for APL-like languages
Authors: Rodnay Zaks
Venue: Proceedings of the meeting on SIGPLAN/SIGMICRO interface (1973)

Microprogramming a high-level language interpreter permits execution speeds to be achieved which rival large conventional systems. However, the limited size of current control memories imposes limitations on the complexity of the resident interpreter. An extremely terse APL interpreter has been developed and implemented by the author, which requires less than 2K words of control storage on a contemporary microprocessor. Two areas in which specially significant advances have been achieved were the design of the parser and the design of the virtual memory management algorithms. The design of dynamic structures for microprogrammed memory management is presented here.
Government interest and involvement in design automation development (Position paper for the Panel Discussion)
Authors: Jonathan Allen
Venue: Proceedings of the 18th Design Automation Conference (1981)

Given the importance of design automation to the development of complex integrated circuits, university and industrial DA efforts should be complementary and not at cross purposes. Traditionally, universities have been a source of high-risk new ideas, while industry has adapted these innovations to practical applications as well as furthered the evolution of and motivation for these new directions. While universities and industry may form their own alliances directly, government assistance in the form of funding that draws together these two kinds of organizations can be (and is already) a useful means to speed up DA development. The government, through its sponsorship role, should certainly develop DA tools and systems. In this way, new developments become public and available to a wide class of users. Many useful programs developed at universities and government-sponsored laboratories have advanced the DA field considerably and have been readily adopted by industry.
Incremental program testing in a very high level language
Authors: B. M. Leavenworth
Venue: Proceedings of the 1976 annual conference (1976)

A testing and debugging methodology is presented which exploits the following properties of very high level languages: functionality, single assignment property, locality of reference, and aggregate operations. The approach is based on incremental construction of a program with testing and debugging in parallel using a graphic display and light pen. It is shown how these properties allow execution of arbitrarily small phrases of the program to obtain aggregate values. The emphasis on data flow rather than control flow permits causal errors to be traced by bottom-up or top-down scans of the program tree. Examples of the methodology are given using the Business Definition Language.
F/LOGIC - An interactive fault and logic simulator for digital circuits
Authors: P. Wilcox, H. Rombeek
Venue: Proceedings of the 13th Design Automation Conference (1976)

Digital simulators are becoming a standard and necessary CAD tool in the circuit design process. The acceptance of this design aid is a result of a number of factors, the predominant one being the over-whelming size and complexity of present day logic circuits and the requirement that a complete test plan be developed for these circuits. Another factor is that recent generation logic simulators have proven to be very flexible tools, capable of simulating very large circuits with a high degree of precision.
Machine-made analytic solutions of finite state Markov processes
Authors: C. Engelman, A. J. Kleinman
Venue: Proceedings of the ACM annual conference - Volume 2 (1972)

This paper explores the possible generation of parametric analytic solutions to finite state Markov processes by formal algebraic methods. The algebraic manipulation system employed, MATHLAB, is particularly well-tuned to this problem area because of its spectrum of automatic symbolic facilities including rational simplification, matrix inversion, inverse Laplace transformation, polynomial factorization, differentiation, and the solution of simultaneous linear equations. For the case of Poisson processes, we demonstrate that the irreversibility of the process implies that the above facilities are sufficient to generate closed-form analytic expressions for the probability vector. An example of this technique, including two-dimensional computer display of the solution, is presented. A contrasting example is included to illustrate how MATHLAB can be employed to compute symbolically certain significant process parameters even when the methods described in this paper fail to yield the probability vector. Typical areas of application are the study of queues, probabilistic games, and reliability.
Software liability issues in the 80's
Authors: Don Costello, Jane Devlin, Fred Greguras, John High, Jeff Meldman, Susan Nycum
Venue: Proceedings of the ACM 1980 annual conference (1980)

A panel of distinguished computing practitioners and legal computer experts will discuss the concepts of liability, product liability, and software liability as they might affect a data processing professional in the 1980's. Panelists will address the ideas of error free programs, adequate documentation and testing, and how these techniques might relate to the principles of reasonable care. Malpractice, the nonreferral ruling, precedents, and licensing will also be discussed as they relate to liability.
Extraction of Bibliography Information Based on Image of Book Cover
Authors: Hua Yang, Norikazu Onda, Masaaki Kashimura, Shinji Ozawa
Venue: Proceedings of the 10th International Conference on Image Analysis and Processing (1999)

This paper describes a new system for extracting and classifying bibliography regions from the color image of a book cover. The system consists of three major components: preprocessing, color space segmentation, and text regions extraction and classification.Preprocessing extracts the edge lines of the book, gets the basic information, and geometrically corrects and segments the input image, into the parts of front cover, spine, and back cover.The same as all color image processing researches, the segmentation of color space is an essential and important step here. Instead of RGB color space, HSI color space is used in this system. The color space is segmented into achromatic and chromatic regions first; and both the achromatic and chromatic regions are segmented further to complete color space segmentation.Then text regions extraction and classification follows. After detecting fundamental features (stroke width and local label width) text regions are determined. By comparing the text regions on front cover with those on spine, all extracted text regions are classified into suitable bibliography categories: author, title, publisher, and other information, without applying OCR.
Structure Relation between Classes for Supervised Learning Using Pretopology
Authors: F. LeBourgeois, M. Bouayad, H. Emptoz
Venue: Proceedings of the Fifth International Conference on Document Analysis and Recognition (1999)

This article presents a pretopological approach for class proximity evaluation according to cluster boundaries. This is a generic method independent of the classifier used, resulting in a neighborhood structure between objects for each class. This proximity measure of classes also gives an objective quality measure of a given training set and an evaluation of class separability. The theoretical context of the method is presented, followed by an application featuring evaluation for printed character recognition and an example of prototype selection for an improved training set selection.
SIGPLAN 1: Should high level languages be used to write systems software? (Debate)
Authors: James J. Horning, John G. Fletcher
Venue: Proceedings of the 1975 annual conference (1975)

The choice of programming language for a large systems software effort can have profound economic implications. A major point of disagreement is the level of language which should be chosen. This debate features representatives of both the academic and industrial communities, focusing on those issues where disagreement is strong.
Virtual grid symbolic layout
Authors: Neil Weste
Venue: Proceedings of the 18th Design Automation Conference (1981)

Free form or &ldquo;stick&rdquo; type symbolic layout provides a means of simplifying the design of IC subcircuits. To successfully utilize this style of layout, a complete design approach and the necessary tools to support this methodology are required. In particular, one of the requirements of such a design method is the ability to &ldquo;compact&rdquo; the loosely specified topology to create a set of valid mask data. This paper presents a new compaction strategy which uses the concept of a virtual grid. The compaction algorithm using the virtual grid is both simple and fast, an attribute which allows the designer to conveniently interact with the algorithm to optimize a layout. In addition to the compaction algorithm, methods used to create large building blocks will be described. The work described here is part of a complete symbolic layout system called MULGA which is written in the C programming language and resides on the UNIX operating system.
An experimental vehicle for the user/filing-system interface
Authors: Ronald Danielson, Philippe Rolander
Venue: Proceedings of the ACM '81 conference (1981)

Achieving maximum benefits from the automation of office functions will require that every member of the office staff use the automated system. As a result, an office information system (OIS) must be able to support interaction across a user community with a wide range of characteristics. Despite the relative importance of the filing system to an OIS, there is little knowledge regarding the best filing system structures for particular classes of users. This is at least partially due to the difficulties of conducting experiments. This paper describes a design for a prototype system to ease experimentation. The system provides for relatively easy changes of both filing system and user interface characteristics, and for transportability among different host systems.
Evaluation of a metric inventory system using simulation
Authors: James R. Coakley, Charles G. Carpenter
Venue: Proceedings of the 15th conference on Winter Simulation - Volume 2 (1983)

Traditional measures obtained from the application of theoretical inventory models do not provide detailed information on the ability of multi-echelon, reparable item inventory systems to maintain their supported machines in an operational status. Monte Carlo simulation techniques are applied to obtain estimates of the operational status actually attained. An advantage of the simulation techniques is that they do not require all the strict assumptions of the theoretical models. The SLAM simulation language developed by Pritsker and Pegden is used for this analysis.
Patterned prose for automatic specification generation
Authors: Sidney L. Smith
Venue: Proceedings of the 1982 conference on Human factors in computing systems (1982)

Writing functional system specifications is a significant job in the early stages of most system development programs. Computer aids for automatic generation of draft material could help produce comprehensive specifications more quickly. To create such computer aids, we must find some way to input defined requirements. A functional capabilities checklist has been proposed for that purpose. And we must find a way to output the appropriate words to describe those requirements. A novel technique called &ldquo;patterned prose&rdquo; is proposed for this purpose. The use of patterned prose for automatic specification generation must still be evaluated in practical application. If that evaluation proves successful, this technique may offer promise as a means of organizing knowledge derived from past experience so that it can be used effectively in future work.
A network-variational basis for generalized computer representation of multifreedom, constrained, mechanical systems
Authors: Milton A. Chace
Venue: Proceedings of the 6th annual Design Automation Conference (1969)

A vital component of computer-aided engineering design is the base program which computes the behavior of an arbitrary design, given a minimal input of both the structural identity and the design parameters. This paper considers the computer-aided design of multifreedom, constrained mechanical systems (realistic machinery). Characteristics of such systems and their computational representation and graphic display output are discussed in terms of an example machine system. An outline of mathematical methods useful for generalized representation is made. Finally an organizational scheme for implementation of a generalized program is briefly discussed. A preliminary program based on these methods is presently under test.
On the need for human rationing (abstract only)
Authors: Francis M. Sim, Glen D. Kreider, Roscoe T. Miller
Venue: Proceedings of the joint conference on Easier and more productive use of computer systems. (Part - I): Information processing in the social sciences and humanities - Volume 1981 (1981)

The occasion for this discussion is our recent experience with a severe shortfall in computational capacity at The Pennsylvania State University. Although the details of this affliction may not be reproduced elsewhere, it is our opinion that the events we experienced stem from essential, underlying phenomena which do have wide currency. These are, first, that overall demand for computational facilities and services is increasing "exponentially" and shows no sign of slowdown, and, second, that resources (most especially including funds) to provide increases in the relevant supply of computing capacities are not keeping pace and can not be expected to do so.It is possible that technical advances can treat this disorder, but in the nature of the political/bureaucratic systems which are the vehicles for the delivery of such "fixes", acquiring them will not be painless. Concretely, it seems unlikely that faculty and students in colleges and universities can expect relief from recurrent boom-and-bust in computational resources, whether the duration of such cycles is measured in decades or days. It behooves us to ask whether the attendant pains must be endured, and whether they are conducive to easier and more productive use of computing systems. Our answers are, first, that such pain does not ennoble, and, second, that it often is counterproductive. Consequently, we must try to identify the proximate sources of the disrupting effects of these cyclic shortfalls and attempt to curb them, within our means.We propose that the appropriate guidelines for allocating scarce computing resources may be characterized as prescriptions for humane rationing. In the most general terms, these prescriptions are 1) that qualified users should be ensured a fair share of the available resource without unnecessary expenses of effort in competition for them and in queuing, and 2) that use of computing resources should be so governed as to insure that all user sessions are as free as possible of delays, encumbrances, and constraints induced by management practices rather than by inherent limits of hard and software.While rationing is unnecessary during the occasional boom in academic computing resources, we should have on the shelf the management tools which can make fair and effective allocation possible during the recurrent busts we may anticipate in the 1980's.
Teaching systems programming and software design: Problems and solutions
Authors: Robert M. Graham
Venue: Proceedings of the first SIGCSE technical symposium on Education in computer science (1970)

In this paper we consider the problem of teaching systems programming and software design. We point out some of the major faults of many courses in this area and propose a course structure and method of presentation which we feel overcomes these faults. We review our past experience in using the proposed method and point out some aspects which need further development.
Hints for computer system design
Authors: Butler W. Lampson
Venue: ACM SIGOPS Operating Systems Review (1983)

Experience with the design and implementation of a number of computer systems, and study of many other systems, has led to some general hints for system design which are described here. They are illustrated by a number of examples, ranging from hardware such as the Alto and the Dorado to applications programs such as Bravo and Star.
Manpower requirements planning in a chemical maintenance facility: A time-dependent interactive simulation
Authors: William W. Williams
Venue: Proceedings of the 10th conference on Winter simulation - Volume 2 (1978)

A GPSS simulation model was developed to investigate the behavior of a maintenance support group of a large fiber processing facility. Data were collected and appropriate frequency distributions constructed for call-in repair rates, repair resource requirements, and service times. Complications inherent in the problem environment that were incorporated in the simulation design included a non-stationary arrival pattern and an interaction in service resource requirements. Analysis of simulated responses suggests the model's internal structure represents reality to an adequate degree. Results of simulated experience of fourteen manpower configurations provide decision makers with enriched information on which to base staffing needs.
Logical or non-mathematical programmes
Authors: C. S. Strachey
Venue: Proceedings of the 1952 ACM national meeting (Toronto) (1952)

A large part of any mathematical programme is concerned with operations which are not strictly mathematical at all. Examples of this are the input and output routines, the arrangements for calling in various sub-routines when required and, above all, the general organization of the problem as a whole. It is an interesting fact that these non-mathematical parts of the programme often take many more instructions than the mathematics proper. As an example, in a problem which involved the step by step integration of a simple non-linear differential equation, the actual integration cycle used 70 instructions, the arrangements to print out the results and to stop the integration at the required point used a further 48 instructions and a printing sub-routine of 64 instructions - a total of 112 instructions. The problem required this integration to be performed a large number of times with different parameters; the organization involved in doing this, and in arranging that the parameters should be fed into the machine in the simplest possible form used no fewer than 250 instructions and sub-routines totalling about 150 instructions. This may be a rather extreme case. but it is generally true to say, I think, that the non-mathematical parts of the programme use far more instructions than one would at first sight expect, and that a relatively large part of effort in preparing the programme is spent dealing with these non-mathematical operations.
On-line international cash management
Authors: John F. Wilson
Venue: Proceedings of the 1983 annual conference on Computers : Extending the human resource (1983)

This paper describes a state-of-the-art cash management system recently installed for the Treasury Section of the United Nations Development Programme (UNDP). This system was a multi-year development effort of the UNDP supported by Chemical Bank's Cash Management Consulting Services (CMCS). It is resident on an IBM 4331 running under CICS with a DOS/VSE operating system. The data base management system is DL/I and it utilizes IBM 3270 terminals locally. After a brief explanation on the basic functions of cash management, the general objectives of treasury systems are given to provide a background for the description of the system. The nature and scope of the operations of the Treasury Section are stated. In summary, the UNDP manages a cash flow of approximately &dollar;1 billion in over 150 currencies. Daily payments are made through 35 agencies with offices in 115 countries. Receivables (contributions) are denominated in 150 currencies. Cash in over 400 bank accounts is monitored daily and a &dollar;500,000,000 short-term portfolio, denominated in almost every major currency is maintained.