ppxscal/embedding_network huggingface dataset:
Computer Aids for the fabrication of large microprogram Read-Only Memories
Authors: Douglas A. Anderson
Venue: Proceedings of the 1975 annual conference (1975)

A system of computer programs is described which provide the following set of general functions: [1] Truth table partitioning and recombining, [2] Bit ordering and inverting, [3] Chip and circuit pack name handling, [4] New and old chip comparing, and [5] Format converting. The system was originally designed to assist the process of fabricating a reasonably sized microprogram store out of a number of mask-encoded ROM integrated circuit chips. Its purpose was to fill the automation gap between a microprogram assembler and existing automated facilities for making and testing integrated circuit chips. However, it has also been used in other ROM and ROM-like applications. The various functions provided aid in the encoding, testing, assembly, and documentation of semiconductor ROMs. The primary input normally consists of a binary truth table for a ROM store generated by a microprogram assembler. This truth table is partitioned into many smaller chip truth tables to be used for encoding and testing individual IC chips and these are recombined into large circuit pack truth tables for assembling and testing individual circuit packs. The partitioning and recombining algorithms allow the user complete freedom in specifying the store, chip, and circuit pack size.
How to Extend and Bootstrap an Existing Data Set with Real-Life Degraded Images
Authors: Ihsin Tsaiyun Phillips
Venue: Proceedings of the Fifth International Conference on Document Analysis and Recognition (1999)

This paper introduces a methodology for bootstrapping and creating large number of ground truthed "real-life" degraded images from an existing data set with a fraction of the original costs and times. The real-life degradations include geometric distortions, coffee stains, water or ink marks, and folds and creases. The methodology also include an automatic procedure to generate unlimited "real-life" degraded images (with coffee and ink marks and soil spots) without any cost. A small experiment was conducted to illustrate the effectiveness of our methodology.In the experiment, 22 real-life degraded images and the two original images were tested on a commercial OCR system. The accuracy rates of the OCR for the two original pages are 98.46% and 99.34% while the accuracy rates for the degraded pages are ranging from 57.17% to 98.45%, depend on the severity and the type of degradation applied to the pages.
Towards a user based automated architectural design system: Theory, system operation and future development
Authors: Jerry Finrow, Robert L. Heilman
Venue: Proceedings of the 10th Design Automation Workshop (1973)

The system described in this article is called ARCHIT. Perhaps the clearest way to understand how the system operates is to give a brief description of a user example. Before we do this we will explain a little about the technical aspects of the system. All of the programs are written in Fortran IV and operate on a PDP-10 time sharing computer. The user communicates to the program via a remote terminal which can be either a teletype or a scope. Most users in our current experiments use a teletype. The user, or client, will sit at the teletype and, following a set of instructions, make connection with the main operating system. All he needs to do is have a user number and type a few simple characters on the teletype, the computer takes it from there. Once having gotten the attention of the computer, the user will then enter into an interactive dialogue with the program. The computer will begin by asking the user questions. An example of the dialogue is indicated below and a sample execution follows the written documentation.
Display oriented computer usage system
Authors: Harold S. Corbin, Werner L. Frank
Venue: Proceedings of the 1966 21st national conference (1966)

The history of data processing has shown the development of general purpose packages in support of data processing hardware. Thus, we have seen the evolution of assemblers, compilers, service routines, and I/O routines. These software packages have led us to operating systems, job monitors, and data manipulation packages in support of batch processing operations. The advent of user-oriented terminal devices and conversation modes of on-line operation, be it time sharing or direct access systems, uncovers new software requirements. Thus new tools are required by application implementors to:
Computational augmentation of blood gas measurements
Authors: Richard D. Yoder
Venue: Proceedings of the 1971 26th annual conference (1971)

Blood gas analysis provides the physician with powerful tools for both diagnosis and patient management. It is technically and economically expedient to measure pH and the partial pressures of oxygen and carbon dioxide directly. Oxyhemoglobin saturation may then be calculated, and oxygen and carbon dioxide content and arteriovenous differences determined by computation if hemoglobin, hematocrit, and temperature are known. Although the necessary computational techniques are available, they are not commonly used in clinical practice. A computer program called BLOODGAS, which performs these calculations was written in basic FORTRAN IV for an XDS Sigma 3 computer. In addition to the calculations indicated above, it corrects the measured partial pressures for temperature. The oxyhemoglobin saturations which it computes are virtually indistinguishable from those of the standard oxy-hemoglobin dissociation curve. For example, the P50(7.4) of the standard curve is approximately 26.4 while that of the computed curve is 26.834. Its calculated values of carbon dioxide content compare favorably with values published in the literature.
A probabilistic PDL
Authors: Dexter Kozen
Venue: Proceedings of the fifteenth annual ACM symposium on Theory of computing (1983)

In this paper we give a probabilistic analog PPDL of Propositional Dynamic Logic. We prove a small model property and give a polynomial space decision procedure for formulas involving well-structured programs. We also give a deductive calculus and illustrate its use by calculating the expected running time of a simple random walk program.
The computational complexity of algebraic numbers
Authors: H. T. Kung
Venue: Proceedings of the fifth annual ACM symposium on Theory of computing (1973)

Let {xi} be a sequence approximating an algebraic number &agr; of degree r, and let [equation], for some rational function @@@@ with integral coefficients. Let M denote the number of multiplications or divisions needed to compute @@@@ and let &Mmarc; denote the number of multiplications or divisions, except by constants, needed to compute @@@@. Define the multiplication efficiency measure of {xi} as [equation] or as [equation], where p is the order of convergence of {xi}. Kung [1] showed that &Emarc;({xi}) &le; 1 or equivalently, [equation]. In this paper we show that (i) [equation]; (ii) if E({xi}) &equil; 1 then &agr; is a rational number; (iii) if &Emarc;({xi}) &equil; 1 then &agr; is a rational or quadratic irrational number. This settles the question of when the multiplication efficiency E({xi}) or &Emarc;({xi}) achieves its optimal value of unity.
How Women Can Advance In Management (Presentation Abstract): A perspective
Authors: Jeanette A. Griver
Venue: Proceedings of the 1978 annual conference (1978)

The panelist will discuss the methods women may employ in making the transition from the technical aspect of the Computer Sciences to Management. Examples will be cited as to how the application and presentation of Completed Staff Work techniques, Cost-Effectiveness procedures, and Operational Definitions can accelerate their development. The importance of gaining experience in project management in order to broaden the individual's experience with the total system will be discussed. The differences in communication techniques between men and women will also be discussed
Communications between users in a dispersed A.P.L network
Authors: Charles Weiss
Venue: Proceedings of the sixth international conference on APL (1974)

@@@@@ discusses reasons for having communications between @@@@@ in a remote network. Objectives are set for such @@@@@ and the implementation is described.
An efficient general purpose parallel computer
Authors: Zvi Galil, Wolfgang J. Paul
Venue: Proceedings of the thirteenth annual ACM symposium on Theory of computing (1981)

In this paper we investigate the question of what is a good way to interconnect a large number of processors. Our main result is the construction of a universal parallel machine that can simulate every reasonable parallel machine with only a small loss of time and with essentially the same number of processors.
Motivation in the high technology industry
Authors: Marshall Bynum, Warren Moseley
Venue: Proceedings of the ACM '82 conference (1982)

Motivation of employees in the high technology environment needs some very special considerations. This seminar will address some ways of motivating employees in this environment. Each of the speakers/panelist are noted for their technical achievement as well as their ability to stimulate a healthy environment and generate enthusiam among their employees. The agenda will be a 15-20 minute statement of position from each participant and then questions and answers. The participants are:
Business and management data processing II: On the scheduling of jobs by computer
Authors: E. S. Page
Venue: Proceedings of the 1962 ACM national conference on Digest of technical papers (1962)

THE PROBLEM to be considered in this paper is the scheduling of several jobs requiring operations on a set of machines in the same order. Explicit derivations of an optimum order of the jobs in simple cases have been given and other cases have been formulated as integer linear programming problems. Neitehr approach is usually a practical proposition for the size and complexity of problems encountered in industry.
Three theorems on abstract families of languages
Authors: Joseph S. Ullian
Venue: Proceedings of the second annual ACM symposium on Theory of computing (1970)

(1) If every set in @@@@ is a subset of a* and the empty word belongs to one of them, then 7(@@@@)&equil;&7circ; (@@@@). One consequence is that &7circ;(L) is always principal for L &le; a*. (2) On the other hand, there is a language L &le; a*b* such that &7circ;(L) is not principal. (3) There are subsets J and K of a* such that 7(J) @@@@ 7(K) is not principal.
A server host system on the ARPANET
Authors: Robert T. Braden
Venue: Proceedings of the fifth symposium on Data communications (1977)

Computer networking is now an established technology, and its applications amy be expected to proliferate rapidly. As a result, the design of future operating systems should be influenced by the requirements of networking. The design of entirely-new operating systems for widely-used CPU's is a rather uncommon event, however; more often, it is necessary to add a network interface to an existing operating system. The consequent host software development can be a major undertaking, particularly for operating systems on large-scale CPU's. It is useful to examine the requirements for interfacing existing systems to current networks [3, 4]. This paper describes the design of host software extensions which allow a large-scale machine running a widely-used operating system to provide service to the ARPANET. This software has enabled the host, an IBM 360/91 at UCLA, to provide production computing services to ARPANET users since 1971 [1]. The machine was physically linked to the UCLA IMP in January 1971, and user-level protocols became operational 8 months later.
On the validity and complexity of bounded resolution
Authors: Zvi Galil
Venue: Proceedings of seventh annual ACM symposium on Theory of computing (1975)

Several procedures based on (not necessarily regular) resolution for checking whether a formula in CN3 is contradictory are considered. The procedures use various methods of bounding the size of the clauses which are generated. The following results are obtained: 1) All of the proposed procedures which are forced to run in polynomial time do not always work&mdash;i.e., they do not identify all contradictory formulas. 2) Those which always work must run in exponential time. The exponential lower bounds for these procedures do not follow from Tseitin's lower bound for regular resolution since these procedures also allow nonregular resolution trees.
Tools for modular programming: Finding out what's needed
Authors: John B. Goodenough
Venue: Proceedings of the ACM annual conference (1973)

Modularity, in our view,1 deals with how to structure programs so that specified purposes are more easily attained. Our current work deals with three purposes&mdash;modifiability, reliability, and efficiency&mdash;and seeks to identify what structural properties, tools, and language features facilitate the attainment of these purposes. Our approach is to study the structure of three actual programs to see how their structure makes the programs more or less modifiable, reliable, and efficient. The first program is a 1,000 statement PL/I program written in top-down style with levels of abstraction. The second is a large circuit analysis program (AEDCAP). The third is a general purpose package for processing list structured data in a fashion that permits changing details of the data structure representation without revising high level algorithms operating on the data. The case study results will be used to assess the potential utility of possible programming tools and language features. 2
Design of an ATN generator/modifier for supporting a communication prosthesis
Authors: Russell B. Kegley, Lois M. Boggess
Venue: Proceedings of the 1984 annual conference of the ACM on The fifth generation challenge (1984)

Research into construction of a communication prosthesis for the handicapped requires a system that can model a user's past language acts. We describe a system that continuously adapts to a particular user's needs by maintaining an augmented transition network (ATN) and discuss methods for optimizing and generalizing the information in the network.
Vegetation - environment interactions
Authors: J. S. Armstrong
Venue: Proceedings of the second conference on Applications of simulations (1968)

This paper gives brief details of a computer simulation model of light penetration within a structure of leaves. It is a direct model in three dimensions with as few abstractions as possible. The aim of the work is two fold (a) to investigate the changes in spectral characteristics of the light at different levels in the crop with different plant spacings, (b) to investigate the relationship between model sophistication and computing cost for the various features within the model.
A record oriented, grammar driven data translation model
Authors: Shaun Liu, Jack Heller
Venue: Proceedings of the 1974 ACM SIGFIDET (now SIGMOD) workshop on Data description, access and control (1974)

The Data Translation problem is the problem of translating data from one computer stored form into another, either with or without changing its original logical structure. A lot of work have been established in this field, but most of them are geared to the data encountered in the commercial and business environment. Another kind of data, namely the self-defining data which is very common in the humanities data processing environment, has received very little consideration. This paper examines both and proposes an unifying approach &mdash;a top down grammar driven method&mdash;to the generalized data translation problem.
The application of control variables to the simulation of closed queueing networks
Authors: S. S Lavenberg, T. L. Moeller, P. D. Welch
Venue: Proceedings of the 9th conference on Winter simulation - Volume 1 (1977)

Control variables are presented which reduce the variance of estimators of steady state response characteristics in the simulation of a broad class of closed queueing networks. Statistical aspects of applying control variables in this context are discussed, and results of extensive empirical studies, conducted to evaluate the control variables, are summarized.
Teaching formal methods for program development and verification (Panel Session)
Authors: Susan L. Gerhart, Eric C. Hehner, Harlan D. Mills
Venue: Proceedings of the fourteenth SIGCSE technical symposium on Computer science education (1983)

A. Joe Turner The role of formal methods for program development and verification in computer science curricula will be discussed. The panel members will address the questions 1) What should be taught? 2) When should it be taught? 3) What are the objectives in teaching this material? 4) What are the problems in teaching this material at this level? The panel members and an outline of their positions is given below. Susan L. Gerhart Certain things are understood to be needed for applying verification technology to actual software. The basic knowledge needed to apply verification methods using current technology to large-scale problems will be discussed, based on actual experience in using the technology in such areas as database systems, operating systems, and communications systems. Eric C. Hehner The Dijkstra/Gries approach to program development is an important and useful component of the computer science curriculum. Good programmers use this approach informally, and instruction in the formal methods can provide the understanding that will improve average programmers. Although the subject matter is currently taught at the senior/graduate level at Toronto, it should be taught earlier, for example during the second year. Teaching the material earlier does require a different approach, however, and good student preparation in logic would be essential for success. Harlan D. Mills Formal methods and a large structured set of principles for program design and verification should be taught early in the computer science curriculum. Instruction in programming can be improved by teaching a large set of small principles, and teaching by apprenticeship. Students learn easier and faster when they are freshmen than later after they have become hackers.
Space-bounded probabilistic turing machine complexity classes are closed under complement (Preliminary Version)
Authors: Janos Simon
Venue: Proceedings of the thirteenth annual ACM symposium on Theory of computing (1981)

For tape constructible functions S(n)&ge;log n, if a language L is accepted by an S(n) tape bounded probabilistic Turing machine, then there is an S(n) tape bounded probabilistic Turing machine that accepts &Lmarc;, the complement of L.
Computer graphics in commercial and broadcast production (Panel)
Venue: ACM SIGGRAPH Computer Graphics (1984)

The goal of this panel is to acquaint the listener with what is perhaps the most visible area of computer graphics - the use of animation in television and motion pictures Creating animation for commercial use is subject to many factors outside of the animator's control. Pieces are constrained by deadlines and budgets and yet must be &ldquo; new, fresh and different&rdquo; in order to satisfy the client. The speakers on the panel represent four of the leading computer animation production houses and are well acquainted with having to work with these constraints while still delivering work of the highest possible quality. In addition to showing some of their work, the participants will discuss methods for creating animation for commercial use.
An approach to computerized space planning using graph theory
Authors: John Grason
Venue: Proceedings of the 8th Design Automation Workshop (1971)

One technique in space planning that has received a lot of attention in the last five years is the use of linear graphs for representing floor plans (Levin, 1964; Casalaina and Rittel, 1967; Krejcirik, 1969; Grason, 1970a, 1970b, 1970c; Teague, 1970). The fact that this paper describes one such technique will probably provide its chief attraction for space planners. However, the paper is also intended as a case study in computer-implemented design. One of its purposes is to illustrate the relationship between the representation chosen for a design problem and the methods developed for solving that problem. This aspect will be introduced in more detail in the next section. The paper treats computerized space planning by discussing methods for the solution of a formal class of floor plan design problems. These methods have been implemented in an experimental computer program called GRAMPA (for GRAph Manipulating PAckage). The methods of solution depend on a special linear graph representation for floor plans called the dual graph representation and a pseudo-grammar called PGG for specifying these graphs. This paper is a condensation of a much larger document (Grason, 1970c). Because of this, the primary emphasis will be placed on results, rather than the reasoning behind the results. The interested reader can consult the larger document for more detailed descriptions of the material presented.
Closed-world tracking
Authors: S. S. Intille, A. F. Bobick
Venue: Proceedings of the Fifth International Conference on Computer Vision (1995)

A new approach to tracking weakly modeled objects in a semantically rich domain is presented. We define a closed-world as a space-time region of an image sequence in which the complete taxonomy of objects is known, and in which each pixel should be explained as belonging to one of those objects. Given contextual object information, context-specific features can be dynamically selected as the basis for tracking. A context-specific feature is one that has been chosen based upon the context to maximize the chance of successful tracking between frames. Our work is motivated by the goal of video annotation-the semi-automatic generation of symbolic descriptions of action taking place in a contextually-rich dynamic scene. We describe how contextual knowledge in the "football domain" can be applied to closed-world football player tracking and present the details of our implementation. We include tracking results based on hundreds of images that demonstrate the wide range of tracking situations the algorithm successfully handles as well as a few examples of where the algorithm fails.
Experimental design for real-time simulations of air traffic control concepts
Authors: E. H. Stevens
Venue: Proceedings of the 9th conference on Winter simulation - Volume 2 (1977)

One of the most effective tools for use in air traffic control experimentation, evaluation, and systems studies is the Digital Simulation Facility (DSF) of the Federal Aviation Administration's National Aviation Facilities Experimental Center located at Atlantic City, New Jersey. The DSF combines computer hardware, software, and personnel for testing and evaluating advanced air traffic control (ATC) concepts and procedures. DSF simulations, performed principally in the real-time mode, permit the analysis of the man-machine interface of the ATC system. This paper describes the design, experimentation, and analysis activities involved in real-time simulations of air traffic control concepts on the DSF.
Operational features of an MOS timing simulator
Authors: P. Kozak, H. K. Gummel, B. R. Chawla
Venue: Proceedings of the 12th Design Automation Conference (1975)

This paper describes operational features of a timing simulator having performance characteristics between those of circuit analysis programs and conventional logic simulators.