ppxscal/embedding_network huggingface dataset:
Ferro electric-materials as storage elements for digital computers and switching systems
Authors: J. R. Anderson
Venue: Proceedings of the 1952 ACM national meeting (Toronto) (1952)

The growing need for improved types of data storage systems in both the digital computer and telephone switching fields has led to the investigation of ferroelectric materials as memory devices. Among the objectives in developing these devices have been low power consumption while storing or reading out information, memory access times of one microsecond or less, small size per bit of memory, simplified low cost construction and high reliability. This paper presents an explanation of the operation of a basic storage circuit employing a ferroelectric material, requirements for suitable materials, descriptions of several types of circuits employing ferroelectrics. and experimental data obtained with operating circuits.
Notations For Software Specification And Design (Panel Discussion)
Authors: Yaohan Chu, Larry Peters, Leighton Scott
Venue: Proceedings of the 1978 annual conference (1978)

Software development involves the accomplishment of distinct functions such as problem definition, requirements engineering, system architecture design, etc. The major ingredients contributing to the accomplishment are creativeness, a level of experience, and a formal or informal methodology. To that end, a methodology can be thought of as the sum of four parts: (1) a collection of basic ideas containing a certain spirit or viewpoint (principles), (2) techniques which apply the basic ideas, (3) a set of tools for employing the techniques to the &ldquo;real-world&rdquo; problems, and (4) an overall procedure describing when to use the tools and techniques. The concept of a notation (graphical, linguistic, or tabular mechanism used for displaying or formulating ideas) is the keystone to the utilization of a methodology. The objective of this session is to deepen our understanding of the role of notations in the areas of requirements engineering and software design.
Control systems in robots
Authors: Walter Jacobs
Venue: Proceedings of the ACM annual conference - Volume 1 (1972)

A general framework is presented for treating the production of behavior in a system that interacts purposively with its environment. Such a system is viewed as having two parts: a body, which forms the interface with the outside world, and a control. Communications between these two parts constitute the moves in the system's game against the environment. The control embodies the rules that specify the system's set of tasks, as well as the strategy used in the reduced game that results from the use of the rules. Three classes of strategies are defined: local, problem-solving, and decision-making. Decision-making strategies, applied in the reduced game with the policy of maximizing utility, have desirable features. The simulation of PERCY, a nest-building insect, illustrates how such a strategy avoids difficulties that obstruct a problem-solving approach.
Performance of distributed software implemented by a contention bus
Authors: Edward E. Balkovich, John A. Morse
Venue: Proceedings of the ACM '81 conference (1981)

The dominant features of software for distributed computer systems are communication between processes, potential parallel execution of processes, and non-determinism. This paper examines how a software architecture can be expected to use a distributed computer system based on a contention bus. Processes tend to be fine-grained and transmit short messages. An operating system kernel that implements process interactions introduces an additional source of short messages used to coordinate process interactions. Existing analyses of contention bus performance show that traffic patterns will be unable to utilize more than a fraction of the potential contention bus bandwidth. This paper suggests some possible ways to extend performance models to more accurately reflect the features of software for distributed computer systems. It also suggests an approach to improving channel efficiency for implementations of distributed software.
A measure for the quantity of computation
Authors: R. T. Rozwadowski, Kenneth W. Kolence
Venue: Proceedings of the 1973 ACM SIGME symposium (1973)

The paper establishes a definition for the quantity of computation based on information theory concepts. The definition is based on the recognition of a computing device, process or procedure as a set of associated information sources as defined by Shannon. It is then shown that the quantity of computation (computer work) has a mechanical work equivalent. It is shown how this new measure of computation can be used for measurements of computer processes at various levels. The first area of application described is machine-language level performance, the second is high level language (FORTRAN) performance and finally the measure is applied to the process of sorting. It is shown that the quantity of computer work required to sort a set of items is directly proportional to the quantity of disorder in the set of items. The above system of measurement is proposed as a basis for a uniform and universal computer performance measuring system.
Solid model in geometric modelling system: HICAD
Authors: Shinji Tokumasu, Yoshio Kunitomo, Yoshimi Ohta, Shigeru Yamamoto, Norihiro Nakajima
Venue: Proceedings of the 20th Design Automation Conference (1983)

The geometric modelling system plays an important role in CAD for the mechanical engineering. This paper presents the general purposed conversational geometric modelling, HICAD which has been developed to confirm the integrated CAD. The HICAD is a generalized geometric model which includes three of the typical geometric modellings, i.e., the wire frame, surface, and solid models. Herein, the implementation method of solid model is especially discussed with the summary of whole system.
An experience with parallelism in Ada
Authors: David S. Notkin
Venue: Proceedings of the ACM-SIGPLAN symposium on The ADA programming language (1980)

One of the more interesting and controversial features of Ada is the tasking structure. The Ada tasking facility provides high level mechanisms for communication and synchronization among tasks executing in parallel. The open question about these mechanisms is whether they provide programmers with both the appropriate level of abstraction and also the necessary level of control. This paper describes in detail the implementation of a system using parallelism that was written during the Ada test and evaluation process. Research on Gandalf is supported by the Software Engineering Division of CENTACS/CORADCOM, Fort Monmouth, NJ.
An analysis of a use bit page replacement algorithm
Authors: Dale H. Grit, Richard Y Kain
Venue: Proceedings of the 1975 annual conference (1975)

The use bit algorithms have been proposed as approximations to least-recently-used page replacement algorithms. In this paper we describe two approximate Markov models and demonstrate their accuracy by comparison with simulations of paging behavior derived from traces of programs for the CDC 6600 computer. The use bit algorithm is found to be a good approximation to the least-recently-used algorithm. Furthermore, the models give reasonable predictions of the missing page rates.
Are programmers paranoid?
Authors: Theodore C. Willoughby
Venue: Proceedings of the tenth annual SIGCPR conference (1972)

&ldquo;The average programmer is excessively independent&mdash;sometimes to the point of mild paranoia. He is often egocentric, slightly neurotic, and he borders upon a limited schizophrenia.&rdquo; This was how one authority(1) described the programmer. But is this a correct and fair description? If it is, then the empirical research using psychological tests should provide the evidence. The data processors in my study were in the middle third on the computational, scientific, musical, clerical and mechanical scales. Considering the findings of my study along with the Triggs data, it appears that data processors do not have the interests which seem to be related to paranoia, schizophrenia or psychological deviation. These studies gave strong support to the view that data processors had different needs and interests from those of other professionals. The extent of the differences in needs is shown in the study described below.
APL and LISP&mdash;should they be combined, and if so how?
Authors: William H. Burge, Joel Moses, Vaughan R. Pratt
Venue: ACM SIGAPL APL Quote Quad (1979)

APL and LISP are very similar languages&mdash;both manipulate a complex data structure and the functional structure of the languages has been ideally chosen for convenient manipulation of these structures. Proposals have been made to combine them by embedding one within the other. Another approach is generalization of each into a common superior. This paper will argue that a superior language probably won't work and will then treat the issues by which the proper embedding choice should be made. The talk will be followed by a panel discussion about the relationship between APL and LISP.
A procedure for improving the estimate of the mean for weakly-stationary autoregressive time series
Authors: Richard Wiener, Jacob Rozmaryn
Venue: Proceedings of the 11th conference on Winter simulation - Volume 2 (1979)

A procedure for improving the estimate of the mean (in the mean-square sense), compared to &xmarc;, for a weakly-stationary autoregressive time-series is presented. The improvement provided by the procedure is especially evident when only a relatively short sample time-series is available and the power spectrum of the underlying process is not flat (white). A detailed empirical evaluation of the new estimation procedure, based on a simulation analysis, is presented. The new procedure is based on an estimator that would be BLUE (best linear unbiased estimator) if the order and coefficients of the underlying autoregressive process were known. The loss of efficiency caused by estimating the order and coefficients is shown to be small.
A logic and signal flow diagram subsystem
Authors: G. Sanderson, A. Milici
Venue: Proceedings of the 9th Design Automation Workshop (1972)

This paper discusses a logic diagram subsystem which has recently been added to a comprehensive design automation system at the Sperry Division of the Sperry Rand Corporation. This step was taken to answer a number of needs that existed in the current system, specifically to simplify the data entry and checking task for large systems, and to capture engineering data at earlier stages of system development. With the addition of the logic diagram subsystem, data is now taken directly from original logic sketches in a single operation.
APL2 syntax: Is it really right to left?
Authors: James A. Brown
Venue: Proceedings of the international conference on APL (1983)

This paper discusses the scanning of APL2 statements and shows that it is dynamic and that the language is inherently interpretive.
Characterization of an optimal delayed resolution policy
Authors: Ashok K. Thareja, Ashok K. Agrawala
Venue: Proceedings of the 1983 ACM SIGMETRICS conference on Measurement and modeling of computer systems (1983)

A class of policies called stationary delayed resolution policies have been proposed recently for sharing finite number of buffers at a store-and-forward node in a message switching network [9]. It has been shown that with respect to the total weighted throughput these policies comprise the optimal class of policies. In this paper, we present methods to obtain an optimal policy from the class of stationary delayed resolution policies for given values of the parameters. A method based upon policy iteration technique for Markov decision processes is used to obtain the optimal delayed resolution policy. It is shown that the policy iteration technique while useful in obtaining the exact optimal policy becomes intractable for practical values of buffer sizes and number of message classes. A class of policies called SRS delayed resolution policies is proposed. It is shown that the best SRS delayed resolution policies closely approximate the performance of the optimal delayed resolution policies.
An iterative algorithm for placement and assignment of integrated circuits
Authors: Douglas C. Schmidt, Lawrence E. Druffel
Venue: Proceedings of the 12th Design Automation Conference (1975)

In [1] a physical design automation system with a unified approach to physical layout techniques was presented. This method has been extended so that it now is an iterated, assignment placement algorithm which improves the placements reported last year. The problems to be addressed in this paper are those of assignment, placement, and spanning. Assignment is the process of assigning logical elements to integrated circuit chips. Placement is the process of placing integrated circuits on a board. Spanning is the process of converting a set of points which must be connected, to a wire list specifying the manner of connection. There are a number of criteria used to span. In this application, we have the option to use either Kruskal's spanning algorithm [2] or a chaining spanner [3]. The goal of these two processes is to increase the routability of the resulting board, which is often measured by the overall length of wire required (Manhattan distance).
Bounds for width two branching programs
Authors: Allan Borodin, Danny Dolev, Faith E. Fich, Wolfgang Paul
Venue: Proceedings of the fifteenth annual ACM symposium on Theory of computing (1983)

Branching programs for the computation of Boolean functions were first studied in the Master's thesis of Masek.7 In a rather straightforward manner they generalize the concept of a decision tree to a decision graph. Let P be a branching program with edges labelled by the Boolean variables, x1,...,xn and their complements. Given an input a&equil;(a1,...,an) &egr; {0,1}n, program P computes a function value fp(a) in the following way. The nodes of P play the role of states or configurations. In particular, sinks play the role of final states or stopping configurations. The length of program P is the length of the longest path in P. Following Cobham,2capacity of the program is defined to be the logarithm to the base 2 of the number of nodes in P. Length and capacity are lower bounds on time and space requirements for any reasonable model of sequential computation. Clearly, any n-variable Boolean function can be computed by a branching program of length n if the capacity is not constrained. Since space lower bounds in excess of log n remain a fundamental challenge, we consider restricted branching programs in the hope of gaining insight into this problem and the closely related problem of time-space trade-offs.
An experimental evaluation of on-line HELP for non-programmers
Authors: Celeste S. Magers
Venue: Proceedings of the SIGCHI conference on Human factors in computing systems (1983)

An interactive computer system was made easier to learn for non-programmers by modifying the on-line HELP and error messages of a system designed primarily for programmers. The modifications included supplementing the existing HELP command with a HELP key, making the content of HELP and error messages more concrete, responding to command synonyms, and more. The systems were evaluated in a between-groups experiment in which office workers with no programming experience were asked to perform a typical office task using one of the unfamiliar interactive computer systems. The results of the experiment supported the inclusion of the modifications. Non-programmers using the modified system completed the computer task in less time, with greater accuracy, and with better resulting attitudes than those who used the system designed primarily for programmers.
Computerized design of large capital equipment
Authors: Frederic L. Blum
Venue: Proceedings of the 10th Design Automation Workshop (1973)

This paper deals with the design of the housings of electrostatic precipitators. While it is expected that few people will be concerned with electrostatic precipitator housings, the general principle should have broad applicability. The product being designed here is a large and expensive piece of capital equipment. It is essentially custom designed for each installation. In this situation, the design cost for each item sold becomes a significant factor. The method presented in this paper is applicable if the item being design is one that is somewhat standardized, but within that standardization, there are so many options that the problem approaches a customized design.
Computer and information sciences program for high school students
Authors: Daniel Asher, Andries van Dam, Daniel Prener
Venue: Proceedings of the 1964 19th ACM national conference (1964)

A well-received pilot program held on seven consecutive Saturdays in 1962 led the University of Pennsylvania to initiate a full scale program in computer oriented mathematics and programming during July and August 1963. Thirty highly qualified students in a Basic Course studied number theory, switching circuits, and abstract algebra, with an underlying basis of machine language programming, software theory, and Fortran coding. Twenty Advanced Course students covered mechanical languages and system simulation. Six of these students assisted University professors in research problems. The 1964 program is sponsored by the National Science Foundation and has eighty-seven participants, nine of whom are high school teachers.
Discretization and rounding errors in orbit determination
Authors: P. Henrici, J. D. Riley, H. Stafford
Venue: Proceedings of the 1961 16th ACM national meeting (1961)

In this paper we study the growth of both discretization and roundoff error in the numerical determination of the orbit of a satellite around the earth by several typical step-by-step procedures. In particular we wish to compare the actual errors encountered in numerical computation with the errors predicted by the theory developed previously. In order to keep the analytical machinery simple, only the zeroth harmonic of the gravitational potential is taken into account, and the intended orbit is assumed to be circular. It appears that even in this extremely special situation our study reveals some patterns of error propagation which have not been previously reported. Some of our results are at variance with certain earlier findings.
Sampling frequency of digital servomechanisms
Authors: Julius Tou
Venue: Proceedings of the 1956 11th ACM national meeting (1956)

A digital servomechanism is a sampled-data feedback control system utilizing a digital computer to perform sampling, error-detection and digital compensation for the system. It consists essentially of a digital computer, digital-analog converters, and system components. The block diagram of a typical digital servomechanism is shown in Figure 1, in which D(z) is the program or the z-transfer function of a digital compensator in the computer, G(s) stands for the transfer function of the system components, Go (s) and Ho (s) denote the transfer functions of the decoder and the encoder respectively, r(t) is the continuous input, &egr;*(t), the sampled input, r*(t), the sampled error from the digital subtractor, &egr;l*(t), the processed error, and c(t), the output. The asterisk refers to sampled quantities. The digital program is designed for obtaining a stable system with minimum system error. l
GALA - an automatic layout system for high density CMOS gate arrays
Authors: B. N. Tien, B. S. Ting, J. Cheam, K. Chow, S. C. Evans
Venue: Proceedings of the 21st Design Automation Conference (1984)

This paper describes the automatic layout software system - GALA (Gate Array Layout Automation) - developed at Hughes Aircraft Company for a high density CMOS gate array family with 3u design rules. The system layout and hierarchical decomposition schemes used in GALA are presented. The particular design environment and style are discussed. The system has been used in production for the various sizes of the Hughes HCMOS gate array family for over 2 years. Routing results for some designs produced during that period are presented.
A MUMPS-based Relational Data Base system (MRDB)
Authors: Georges S. Nicolas, John W. Lewis
Venue: Proceedings of the 1976 annual conference (1976)

A relational database management system has been implemented in the MUMPS language using a binary tree structure for storage of relations. Several examples are given to illustrate the available functions and commands. Some details of the data structure are given, and tradeoffs discussed. The system was intended for teaching and research and no attempt was made to optimize performance. Nevertheless, timing measurements are presented to show that the use of a MUMPS-like tree structure for relational database system implementation can yield performance which varies with the size of the operand relations in a manner similar to previously reported relational database implementations.
Automatic test generation for large digital circuits
Authors: Akihiko Yamada, Nobuo Wakatsuki, Hideo Shibano, Osamu Itoh, Kyouji Tomita, Shigehiro Funatsu
Venue: Proceedings of the 14th Design Automation Conference (1977)

This paper describes an implemented technique of automatic test generation for large digital circuits. The test generator presented in this paper basically uses the path sensitizing method and is applicable to all kinds of logical circuits. Some application results are also described.
Design of an emulator oriented microprogrammable computer
Authors: Jin W. Soh, Ron Marko
Venue: Proceedings of the 11th annual workshop on Microprogramming (1978)

This paper presents a design and implementation of a computer hardware for emulation using chip sliced microprocessors. The system has been built at Wright State University Computer Science Laboratory for instructional purposes. It provides an efficient interactive method for the execution of microcode in emulator development efforts. The system consists of two processing units, FAIRCHILD F-8 and INTEL 3000 bit slices, and two modules of RAM, one for the main memory having 8 bit words, the other for dynamic microprogram memory having 32 bit words.
Pebblings, edgings, and equational logic
Authors: Dexter Kozen
Venue: Proceedings of the sixteenth annual ACM symposium on Theory of computing (1984)

A lower bound of &Ohgr;(n/logn) space is shown for two natural proof systems for equational logic. The method introduces an edging game, a generalization of the pebble game [P].
M.H. Halstead's Software Science - a critical examination
Authors: Peter G. Hamer, Gillian D. Frewin
Venue: Proceedings of the 6th international conference on Software engineering (1982)

Karl Popper has described the scientific method as &ldquo;the method of bold conjectures and ingenious and severe attempts to refute them&rdquo;. Software Science has made &ldquo;bold conjectures&rdquo; in postulating specific relationships between various 'metrics' of software code and in ascribing psychological interpretations to some of these metrics. This paper describes tests made on the validity of the relationships and interpretations which form the foundations of Software Science. The results indicate that the majority of them represent neither natural laws nor useful engineering approximations.