ppxscal/embedding_network huggingface dataset:
On the number of additions to compute specific polynomials (Preliminary Version)
Authors: Allan Borodin, Stephen Cook
Venue: Proceedings of the sixth annual ACM symposium on Theory of computing (1974)

It is well known from the work of Motzkin [55], Belaga [58] and Pan [66], that &ldquo;most&rdquo; nth degree polynomials p &egr; R[x] require about n/2 &times;, &divide; ops and n &plusmn; ops and that these bounds can always be achieved within the framework of preconditioned evaluation (1). More precisely, if p can be computed using less than [equation] &times;, &divide; or less than n &plusmn; ops, then the coefficients of p are algebraically dependent. The situation when counting &plusmn; ops with the potential of unlimited * ops, is not as clear. While the arguments based on algebraic dependence provide us with our best lower bounds thus far, a different approach of independent interest is taken in section IV. Namely, we are able to show that the number of &plusmn; ops required to compute any p &egr; R[x] is bounded below by a function of the number of distinct real zeros of p. The potential (e.g., for producing non linear lower bounds) and limitations of this approach will be discussed.
MERT - a multi-environment real-time operating system
Authors: D. L. Bayer, H. Lycklama
Venue: Proceedings of the fifth ACM symposium on Operating systems principles (1975)

MERT is a multi-environment real-time operating system for the Digital Equipment PDP-11/45 and 11/70 computers. It is a structured operating system built on top of a kernel which provides the basic services such as memory management, process scheduling, and trap handling needed to build various operating system environments. Real-time response to processes is achieved by means of preemptive priority scheduling. The file system structure is optimized for real-time response. Processes are built as modular entities with data structures that are independent of all other processes. Interprocess communication is achieved by means of messages, event flags, shared segments, and shared files. Process ports are used for communication between unrelated processes.
Simulation key unlocks problems of reducing in-process inventory and improving manufacturing flow
Authors: W. Daniel Nilsson, Paul R. Becker
Venue: Proceedings of the second conference on Applications of simulations (1968)

This study describes a General Purpose System Simulator (GPSS) model created to determine the acceptable minimum inventory levels and the dynamic effects of a conveyor system proposed for the unit record manufacturing area at International Business Machines Corporation's Poughkeepsie, New York, plant. Because of the model's complexity, it was run on a multi-processor operating system with 512K bytes of storage.
The evolution of design automation to meet the challanges of VLSI
Authors: Lawrence M. Rosenberg
Venue: Proceedings of the 17th Design Automation Conference (1980)

This paper presents the author's opinion of the major problems confronting Design Automation for VLSI and how Design Automation may evolve to meet these challenges. The paper first takes a historical look at the driving forces for Design Automation development by analyzing the evolution of Design Automation at RCA. It looks at both some successful and unsuccessful development efforts and attempts to isolate some of the criteria necessary for success. It review RCA's current LSI Design Automation capabilities and compares them to the challenge of VLSI. The major challenges&mdash;layout, design verification and testability &mdash; are discussed along with possible achievable solutions.
Computer chess programs (Panel)
Authors: Gary J. Boos, Dennis W. Cooper, James J. Gillogly, David Levy, Herbert D. Raymond, David J. Slate, Rolf C. Smith
Venue: Proceedings of the 1971 26th annual conference (1971)

Last year, during ACM'70 in New York, the First United States Computer Chess Championship was held. Six programs competed, with Northwestern University's CHESS 3.0 winning the tournament. This year at ACM'71, the Second Annual Computer Chess Championship and a panel of the programs' authors are scheduled. At the time of this writing, there are six programs entered in the tournament. Presented below are short summaries of authors' panel presentations, giving some details of their programs and discussing techniques for developing more effective chess playing programs. Mr. David Levy, an international chess master from the University of Glasgow, is the tournament director for the chess championship and a discussant during the panel.
Human information processing styles and the information systems architect in the PSC systemeering model
Authors: William Taggart
Venue: Proceedings of the seventeenth annual computer personnel research conference (1980)

In the first section of this paper, we introduce the structure and dynamic functioning of the model. Attention focuses on the definition of primary roles and the communication needs among these roles in the systems development process. Then in the second section of the paper, the PSC life cycle is compared to traditional and evolutionary views of this process.
MATHRISK - a management tool for the analysis of investment decisions
Authors: Stephen L. Robinson
Venue: Proceedings of the 6th conference on Winter simulation (1973)

In recent years simulation has played an increasingly more prominent role in the analysis of new investment opportunities. Numerous computer programs have been created to facilitate the simulation of cash flows created by new investments. Such programs can usually be classed as either inordinately simple to use, in which case they are often quite inflexible, or quite difficult to use, for which price the user obtains a flexible program. This paper describes the design criteria for a dynamic software system which is not only easy to use, but flexible enough to provide the user with progressively more complex modeling capability.
Monte Carlo techniques in code optimization
Authors: Dean Jacobs, Jan Prins, Peter Siegel, Kenneth Wilson
Venue: Proceedings of the 15th annual workshop on Microprogramming (1982)

Effective optimization of FPS Array Processor assembly language (APAL) is difficult. Instructions must be rearranged and consolidated to minimize periods during which the functional units remain idle or perform unnecessary tasks. Register conflicts and branches cause complications. Deterministic algorithms to arrange instructions traditionally use complex heuristics which are tailored to specific inputs. A non-deterministic approach can be simpler and effective on a large class of inputs. This is a progress report on the &ldquo;Monte Carlo&rdquo; optimizer under construction at Cornell University by the authors. This optimizer randomly modifies the text of an APAL program without changing its meaning. Modifications which improve the program are favored. A set of six elementary transformations are the basis for modifications.
Cpoda - a demand assignment protocol for satnet
Authors: Irwin Jacobs, Lin-Nan Lee, Andrew Viterbi, Richard Binder, Robert Bressler, Nai-Ting Hsu, Robert Weissler
Venue: Proceedings of the fifth symposium on Data communications (1977)

A new contention-based demand assignment protocol (CPODA) is described. The protocol is designed to handle packetized data and voice traffic in a multiple access satellite broadcast channel, where the channel is typically shared by hundreds of earth stations. A sophisticated traffic environment is assumed, including multiple priority and delay class distinctions, variable message lengths, and an arbitrary load distribution among the stations. In addition, stations may have different receiving rate capabilities. The CPODA protocol is part of a broader research project concerned with developing protocols for a one-hop satellite network (SATNET). The CPODA and other protocols are currently undergoing experimental evaluation using an INTELSAT IV-A satellite and four earth stations in the Atlantic region.
A relational database machine architecture
Authors: David Elliot Shaw
Venue: Proceedings of the fifth workshop on Computer architecture for non-numeric processing (1980)

Algorithms are described and analyzed for the efficient evaluation of the project and join operators of a relational algebra on a proposed non-von Neumann machine based on a hierarchy of associative storage devices. This architecture permits an O(log n) decrease in time complexity over the best known evaluation methods on a conventional computer system, without the use of redundant storage, and using currently available and potentially competitive technology. In many cases of practical import, the proposed architecture may also permit a significant improvement (by a factor roughly proportional to the capacity of the primary associative storage device) over the performance of previously implemented or proposed database machine architectures based on associative secondary storage devices.
An examination of evolution dynamics
Authors: M. J. Lawrence
Venue: Proceedings of the 6th international conference on Software engineering (1982)

Data on the history of seven systems was analysed to statistically test the 5 laws of software evolution proposed first by Belady and Lehman in 1976. While there was some evidence supporting laws 1 and 2, laws 3-5 were not supported by the data. In the light of the result a new discontinuous model of software evolution is proposed to replace the smoothly changing continuous model proposed by Lehman.
A robust B-tree implementation
Authors: J. P. Black, D. J. Taylor, D. E. Morgan
Venue: Proceedings of the 5th international conference on Software engineering (1981)

A storage structure for B-trees is presented which is robust in that any pair of changes to structural fields of an instance of the structure can be detected, as well as many sets of larger numbers of changes. Included in the paper are a motivation for robustness as a design criterion, cost and performance implications of the B-tree implementation, and a solution to the subproblem of a robust implementation for each node's contiguous list of pointers and keys.
A dynamic control system for hospital inventories
Authors: James D. Durham, Stephen D. Roberts
Venue: Proceedings of the 6th conference on Winter simulation (1973)

This paper offers an approach to the inventory problem involving stochastic demand and stochastic lead time when only empirical distributions of these random variables are available. The proposed inventory model utilizes experimental optimization in a unique fashion to solve this problem. Through the use of Monte Carlo simulation and a modified non-linear programming approach, an expected total cost objective function is minimized by the selection of appropriate reorder points and reorder quantities. The model is shown to be dynamic in nature and suitable for control of large inventories. The technique has been applied to several hospital inventory items and sample computations are included in the paper.
An application of a specialized data bank for analysis and information retrieval in the field
Authors: James A. Brown, Bernaro Verner
Venue: Proceedings of the sixth international conference on APL (1974)

This paper describes a computerized data processing and information retrieval system specifically designed to meet the information requirements of a large- scale archaeological investigation at the Koster site, a deep stratified Archaic site in southern Illinois. The purpose of the system is to make up a deficiency present in most large-scale programs by: 1) offering an efficient means of expediting data analysis and 2) providing feedback during the course of excavation that effects field decision making, student instruction and sampling procedures. The on-site use of a computer terminal is the key element in the success of the system. The data bank is restricted to accumulating specific classes of debris that provide quickly attainable means of discovering the type and intensity of occupation through statistical analyses.
The SAGA project: A system for software development
Authors: Roy H. Campbell, Peter A. Kirslis
Venue: ACM SIGPLAN Notices (1984)

The SAGA (Software Automation, Generation, and Administration) project is investigating formal and practical aspects of computer-aided support for the software lifecycle [Campbell and Richards, 81]. The goal of the project is to design a practical software development environment that supports and aids management of all major phases of the lifecycle. This paper presents requirements for a software development environment and shows how they are guiding the specification and design of the SAGA project. We review the goals of the project, and give an overview of the organization, design, and status of the major components of the SAGA software development system for which prototypes have been built. These components include a table-driven LR parser-based language-oriented editor, a discussion forum, a source code control system, and an incremental compilation facility.
Nonlinear edge enhancement
Authors: H. Greenspan, S. Akber
Venue: Proceedings of the 1995 International Conference on Image Processing (Vol. 1)-Volume 1 - Volume 1 (1995)

The article work extends a nonlinear, image enhancement scheme proposed by Greenspan and Anderson (see Proceedings of SPIE on Image and Video Processing II, vol.2182, p 2-13, 1993). We concentrate on parameter sensitivity in a global scheme, as well as motivate and discuss adaptive local parametrization in the enhancement algorithm. The enhancement scheme uses nonlinear filtering to augment the frequency spectrum of a blurred input (creating new high-spatial frequencies). As a result of the enhancement, images are created with higher resolution than the sampling rate would allow. This property is highly valuable in application domains which require limited bandwidth to represent or transmit images, including the HDTV and videophone markets.
Dynamically maintaining configurations in the plane (Detailed Abstract)
Authors: Mark H. Overmars, Jan van Leeuwen
Venue: Proceedings of the twelfth annual ACM symposium on Theory of computing (1980)

For a number of common configurations of points (lines) in the plane, we develop datastructures in which insertions and deletions of points (or lines, respectively) can be processed rapidly without sacrificing much of the efficiency of query answering of known static structures for these configurations. As a main result we establish a fully dynamic maintenance algorithm for convex hulls that can process insertions and deletions of single points in only O(log3n) steps or less per transaction, where n is the number of points currently in the set. The algorithm has several intriguing applications, including that one can &ldquo;peel&rdquo; a set of n points in only O(log3n) steps and that one can maintain two sets at a costs of only O(log3n) or less per insertion and deletion such that it never takes more than O(log2n) steps to determine whether the two sets are separable by a straight line. Also efficient algorithms are obtained for dynamically maintaining the common intersection of a set of half-spaces and for dynamically maintaining the maximal elements of a set of plane points. The results are all derived by means of one master technique, which is applied repeatedly and which seems to capture an appropriate notion of &ldquo;decomposability&rdquo; for configurations.
VLSI - a design challenge
Authors: R. Waxman
Venue: Proceedings of the 16th Design Automation Conference (1979)

The difficult takes a while to accomplish, the impossible takes just a little longer. VLSI is significantly more complex than any technology today. A VLSI chip of the '80s is depicted within the industry as having 0.5 micron minimum feature size, 106 devices per chip, and 105 gates per chip. With the expected capability of placing so much logic on a chip, what are the design challenges and how can they be met? Chart I illustrates the many aspects of design. They are strongly interrelated and dependent upon each other. Choosing an optimal design methodology for VLSI is critical since a bad choice will leave a designer with inadequate design tools and a lack of design integrity.
Assessing a class of software tools
Authors: M. A. Hennell, D. Hedley, I. J. Riddell
Venue: Proceedings of the 7th international conference on Software engineering (1984)

The roles and capabilities of LDRA software Testbeds and their appropriate environments have been described in a number of papers [1,2]. The way in which management uses the tools as elements of a controlled software development environment is described in [3]. The principal benefits of such use are that management has the assurance that software development standards are enforced, and has reliable information concerning project status. The explicit standards enforced by the use of these tools are described in detail in [2]. One class of these standards is that of test effectiveness, which is measured primarily through three test effectiveness metrics reinforced by a code auditing capability. This paper attempts to quantify the benefits of using such a software Testbed in providing assurance of the absence of program errors. The attempt is made from two viewpoints, the theoretical and the experimental. The theoretical aspect is important because the practical use of a tool may fail to demonstrate that the tool can be a powerful detector of a class of errors simply because no errors of that type were present in the software sample validated. Finally the paper attempts to summarise some of the experiences gained through the use of the tools over a twelve year period.
Interactive data analysis and statistical graphics in APL
Authors: Neil W. Polhemus
Venue: ACM SIGAPL APL Quote Quad (1983)

This article describes the structure of an APL interactive statistical graphics system called STATGRAPHICS. The system provides a comprehensive package of statistical routines which create an environment in which graphical techniques are fully integrated into basic statistical procedures. Individual procedures can be executed as separate APL functions or under the control of fullscreen menus. By using fullscreen panels and soft PF keys to control major statistical procedures, graphics becomes an integral part of the statistical analysis process.
FREEHEAT-a passive solar system simulation program
Authors: J. C. Chapman, P. J. Burns, C. B. Winn
Venue: Proceedings of the 11th conference on Winter simulation - Volume 1 (1979)

A finite-difference, nodal computer simulation has been developed to handle various passive solar components and systems. Mass wall and direct gain systems may be analyzed. Various overhang geometries, thermocirculation heat transfer, variable thermal mass, secondary lumped thermal mass, heat pipes, selective surfaces, night insulation, and thermosyphon systems are options available in the two versions of FREHEAT (1.0 and 2.0). A radiation network can be calculated for internal heat transfer. The program has single zone capacity at present, but various ground coupling coefficients are optional. Various auxiliary heating, venting, and cooling options are available with low and high thermostat set temperatures. Although the program is well-documented, some knowledge of heat transfer is required for modification. A monthly simulation requires roughly 45 CPU seconds on a CYBER 171. The program is presently available from Colorado State University. Results from four example problems are presented. Conclusions point towards the large energy savings obtained from installing an effective night insulation system.
Minicomputer systems in business (Panel Discussion): what are the limiting factors?
Authors: Gerry Cullen, Ted Cary, Peter van Berkel, D. E. Schilling, Elizabeth D. Rather
Venue: Proceedings of the 1976 annual conference (1976)

This session will deal with application of minicomputers to commercial operations and the design criteria for such systems. Panelists, representing a broad range of backgrounds, will analyze business minicomputer systems from a variety of viewpoints including peopleware, software, and hardware
Computing science courses - training or education?
Authors: Neil Willis
Venue: Proceedings of the ACM SIGCSE-SIGCUE technical symposium on Computer science and education (1976)

The debate about the usefulness or otherwise of Computing Science degrees has raged for some time. Critics of these degree courses have stated that the courses do not satisfy the needs of commercial and industrial users; that they do not train the graduate to be of immediate use or that the subject is developing too rapidly for degrees to impart any lasting knowledge and so on. It may be (and is) argued by some, that an Institute of Higher Education (be it College, Polytechnic* or University) should not aim to train students to be of immediate use to industry. However there is obviously a demand for trained personnel in the computing field, as demonstrated by the proliferation of courses run by manufacturers, various professional bodies and commercial organizations, and it is to satisfy this demand that a number of Polytechnics in England, and Sheffield Polytechnic in particular, have designed courses aimed at educating students in the field of computing.
On the possibility and impossibility of achieving clock synchronization
Authors: Danny Dolev, Joe Halpern, H. Raymond Strong
Venue: Proceedings of the sixteenth annual ACM symposium on Theory of computing (1984)

It is known that clock synchronization can be achieved in the presence of faulty clocks numbering more than one-third of the total number of participating clocks provided that some authentication technique is used. Without authentication the number of faults that can be tolerated has been an open question. Here we show that if we restrict logical clocks to running within some linear function of real time, then clock synchronization is impossible, without authentication, when one-third or more of the processors are faulty. However, if there is a bound on the rate at which a processor can generate messages, then we show that clock synchronization is achievable, without authentication, as long as the faults do not disconnect the network. Finally, we provide a lower bound on the closeness to which simultaneity can be achieved in the network as a function of the transmission and processing delay properties of the network.
Cloud pattern recognition
Authors: R. D. Joseph, S. S. Viglione, H. F. Wolf
Venue: Proceedings of the 1964 19th ACM national conference (1964)

Cloud cover photographs transmitted from meteorological satellites must be processed and interpreted before weather maps can be issued. Most of the routine processing can be handled by present day digital computer techniques; however, the recognition and interpretation of cloud patterns such as vortices indicating hurricanes, must still be performed by humans due to the lack of suitable recognition mechanisms. This paper investigates the feasibility of using a perceptron-type computer for the recognition of vortex patterns. A formula is derived which enables the prediction of machine performance as a function of problem complexity and perceptron size (number of logic units). It is shown that the problem complexity can be estimated through optical correlation measurements on cloud cover negatives. These measurements are described and a computer routine is developed which mechanizes the prediction equations and examines the experimental data gained from 10,000 measurements. The results of the computer program are presented and their meaning is discussed.