ppxscal/embedding_network huggingface dataset:
A simplex algorithm&mdash;gradient projection method for nonlinear programming
Authors: L. Duane Pyle
Venue: Proceedings of the 1971 26th annual conference (1971)

Witzgall [8], commenting on the gradient projection methods of R. Frisch and J. B. Rosen, states: &ldquo;More or less all algorithms for solving the linear programming problem are known to be modifications of an algorithm for matrix inversion. Thus the simplex method corresponds to the Gauss-Jordan method. The methods of Frisch and Rosen are based on an interesting method for inverting symmetric matrices. However, this method is not a happy one, considered from the numerical point of view, and this seems to account for the relative instability of the projection methods.&rdquo; This paper presents an implementation of the gradient projection method which uses a variation of the simplex algorithm. A more detailed exposition is given in [5]; motivation for this approach may be found in [6].
A total verification of printed circuit artwork
Authors: Manfred A. Ward
Venue: Proceedings of the 18th Design Automation Conference (1981)

The paper describes a system for automated verification of artwork for printed-circuits. The system also checks for adherence to preset design rules. In use, the system has reduced checking time by 65 percent.
An interactive debugger for software and firmware
Authors: Morrie Gasser
Venue: Conference record of the 6th annual workshop on Microprogramming (1973)

A program for interactively debugging software and firmware on an Intercomputer 1-50 minicomputer is described. Two processors sharing a common memory are used. The debugger is controlled by standard firmware in one processor, and the firmware and software to be debugged run under the other processor. By inserting a small defined routine into the firmware to be debugged, the debugger has control of the other processor, yet is practically invisible to it.
The satellite transmission protocol of the universe project
Authors: A. Gillian Waters, Christopher J. Adams
Venue: Proceedings of the ACM SIGCOMM symposium on Communications architectures and protocols: tutorials symposium (1984)

The Universe network uses a broadcast satellite channel to connect local area networks into a high speed wide area network. The satellite channel is scheduled using a packet TDMA scheme. Time allocation is controlled by one site acting as master, but is based on indications received from each participating site about its own requirements. The TDMA scheduling is thus based not on circuits or the requirements of individual packets, but on a picture of the distributed requirements of the network as a whole. The paper describes the protocol currently implemented on the Universe network and looks forward to a more general way of applying this technique.
Simulation of a two-man interaction system
Authors: D. S. Kochhar, B. L. Wills
Venue: Proceedings of the 5th conference on Winter simulation (1971)

This paper describes a GPSS/360 simulation of a two-man machine model where the performance of both operators as they together perform a task comprising of a series of individual and/or interacting subtasks is simulated. The program considers in ter and in tra operator variance, and such factors as operator proficiency, stress tolerance and partner confidence. Output for various systems consists of areas of operator overload and underload, subtask and task failure or success and a comparison of the standard and actual execution times.
The evolution of a Source Code Control System
Authors: Alan L. Glasser
Venue: ACM SIGSOFT Software Engineering Notes (1978)

The Source Code Control System (SCCS) is a system for controlling changes to files of text (typically, the source code and documentation of software systems). It is an integral part of a software development and maintenance system known as the Programmer's Workbench (PWB). SCCS has itself undergone considerable change. There have been nine major versions of SCCS. This paper describes the facilities provided by SCCS, and the design changes that were made to SCCS in order to provide a useful and flexible environment in which to conduct the programming process.
A Route-Oriented Simulation System for ATC studies
Authors: W. R. Sutherland, T. H. Myer, E. L. Thomas, D. A. Henderson,  Jr.
Venue: Proceedings of the 5th conference on Winter simulation (1971)

A simulation system for modeling air traffic situations is described. Real- or fast-time control of many aircraft over easily defined routes is provided. Simulated aircraft can be vectored manually or instructed to follow routes predefined by the experimenter. Special language forms have been developed for describing both the geographical and procedural aspects of these routes. The program runs in a PDP-10 timeshared computer and capitalizes on some of the standard system features. The influence of the interactive computer environment on the program's development and operation is discussed.
Data structures for on-line updating of matroid intersection solutions
Authors: Greg N. Frederickson, Mandayam A. Srinivas
Venue: Proceedings of the sixteenth annual ACM symposium on Theory of computing (1984)

Matroid intersection problems are considered in which one of the matroids is a partition matroid specifying that exactly q elements in the solution must be red, and the rest green. A characterization is presented for how the solution changes when one element changes in cost. Data structures are given for maintaining the solutions to several such problems online under the operation of changing an edge cost. Efficient update algorithms are given for maintaining a red-green minimum spanning tree in both a general and a planar graph, and a red-green job schedule for unit-time jobs with integer release times and deadlines.
Early LISP history (1956 - 1959)
Authors: Herbert Stoyan
Venue: Proceedings of the 1984 ACM Symposium on LISP and functional programming (1984)

This paper describes the development of LISP from McCarthy's first research in the topic of programming languages for AI until the stage when the LISP1 implementation had developed into a serious program (May 1959). We show the steps that led to LISP and the various proposals for LISP interpreters (between November 1958 and May 1959). The paper contains some correcting details to our book (32).
Thick film substrate (Micropackage) design utilizing interactive Computer Aided Design systems
Authors: Freddie M. Christley
Venue: Proceedings of the 14th Design Automation Conference (1977)

Honeywell Information System, Inc. in Phoenix, Arizona utilizes Computer Aided Design (CAD) systems with graphics capabilities and online data bases to design, build and test thick film substrates. The thick film substrate is enclosed in a metal housing with edge connections and is called a Micropackage.
A simulation model for network routing
Authors: Udo W. Pooch, Charles Neblock, Rahul Chattergy
Venue: Proceedings of the 11th conference on Winter simulation - Volume 2 (1979)

The simulation program described in this paper was devised as a vehicle for the study of communication network routing procedures. It was designed to model the behavior of a wide range of network topologies and routing disciplines. An event driven simulation approach was chosen to minimize program development time and complexity. GASP-IV was selected as the simulation language. The determining factor in choosing the language was the clean interface it presents to FORTRAN. The use of GASP-IV permits utilizing the full power of FORTRAN in describing complex routing algorithms while simultaneously relieving the programmer of the responsibility for such essential housekeeping functions as enqueuing and dequeuing messages, file manipulation and event sequencing. As an application of this simulator, a loop-free distributed adaptive routing algorithm is proposed and analyzed. Simulation results are presented and the effect of the algorithm on overall network performance is examined. In addition to a loop-free property, the algorithm is shown to provide a partial solution to the single path routing problem. Furthermore, a modification to the algorithm is given which precludes message loss, and is shown to be superior in performance to current update algorithms (PUA).
Interactive knitted textile design: A computer tool for designers and manufacturers
Authors: Janice R. Lourie, Nitta P. Dooner
Venue: Proceedings of the 9th Design Automation Workshop (1972)

Textile Graphics is a computer-aided technique for developing a textile design and textile machinery patterning mechanism information from an artist's drawing. The computer is operated by a textile designer-technician who understands the particular textile machinery for which he is adapting the original drawing. He inputs the original drawing to the computer with a combination of graphic input devices. When the artist's original design has been transmitted to the computer, he develops it into the information which controls the patterning mechanism of a specific kind of a textile machinery. The computer serves as a tool for the artist or designer. It enables him to make the same aesthetic judgements he would normally make; however, it executes his decisions much more rapidly than is possible when using traditional methods. The preservation of aesthetic judgement by the user, increased design capability and increased experimental capability are major characteristics of the system.
Combinational logic synthesis from an HDL description
Authors: Sajjan G. Shiva
Venue: Proceedings of the 17th Design Automation Conference (1980)

Hardware Description Languages are used to input the details of a digital system into an automatic design system. An algorithm to synthesize combinational logic from the description in one such language (DDL) is discussed. A sample implementation and the cost comparison are provided.
Discrete structures in the undergraduate computer science curriculum
Authors: G. L. Engel, N. D. Jones
Venue: ACM SIGCSE Bulletin (1973)

A course in discrete mathematical structures has been included as a necessary component of a program in all major curriculum studies in computer science. This paper discusses this type of course with respect to problems encountered in its implementation due to its central position in the curriculum. Recommendations are made regarding the level, content, and handling of the course, based on several years' experience in teaching the material.
Completeness criteria for testing elementary program functions
Authors: William E. Howden
Venue: Proceedings of the 5th international conference on Software engineering (1981)

Program testing metrics are based on criteria for measuring the completeness of a set of program tests. Branch testing measures the percentage of program branches that are traversed during a set of tests. Mutation testing measures the ability of a set of tests to distinguish a program from similar programs. A criterion for test completeness is introduced in this paper which measures the ability of a set of tests to distinguish between functions which are implemented by parts of programs. The criterion is applied to functions which are implemented by different kinds of programming language statements. It is more effective than branch testing and incorporates some of the advantages of mutation testing. Its effectiveness can be discussed formally and it can be described as part of an integrated approach to testing. A tool can be used to implement the method.
Complete axiomatization of algorithmic properties of program schemes with bounded nondeterministic interpretations
Authors: Grazyna Mirkowska
Venue: Proceedings of the twelfth annual ACM symposium on Theory of computing (1980)

Propositional algorithmic logic PAL is a propositional counterpart of algorithmic logics. It investigates properties of program connectives: begin...end, while...do, if..then..else, or .... PAL supplies tools for reasoning about programs constructed from program variables by means of program connectives and about their algorithmic properties. Sound rules of inference and tautologies of PAL are as important in analysis of programs (e.g. verification) as tautologies of classical propositional calculus. On the other hand propositional algorithmic theories are of highest interest, since they can capture properties of data structures and also algorithmic properties of behaviours of concurrent systems. We proved that the semantical and the syntactical consequence operations coincide (completeness property) and that the model existence theorem holds.
Control structure aptness: A case study using top-down parsing
Authors: Gary Lindstrom
Venue: Proceedings of the 3rd international conference on Software engineering (1978)

The range of control structures available in a higher-level programming language directly governs the set of algorithms conveniently programmable therein. This fact has been well-demonstrated by the salutary effect the ideas of structured programming have had on traditional control structures (sequential, iterative, and procedural). This paper seeks to demonstrate this same fact for more advanced control structures through the use of top-down parsing as a case study. A series of increasingly more satisfactory top-down parsers are presented, using (i) iterative, (ii) recursive, (iii) coroutine, and (iv) nondeterministic control forms. A fifth solution, using a new control form termed &ldquo;non-forgetful backtracking&rdquo;, is sketched. This study indicates that the development of new control forms, as well as more thorough understanding and application of existing ones, are worthy pursuits for software engineering. A few directions for continuing work in this spirit are offered in the concluding section.
A hierarchical placement procedure with a simple blocking scheme
Authors: Shinichi Murai, Hiroo Tsuji, Morio Kakinuma, Kazumichi Sakaguchi, Chiyoji Tanaka
Venue: Proceedings of the 16th Design Automation Conference (1979)

The outline of a hierarchical placement procedure utilizing a simple blocking scheme is described with the results of the application to the DSA-MOS gate arrays. Indirect clustering value is introduced for the blocking, i.e. grouping of modules under block size restriction. The system including the procedure has been successfully applied to the design of MOS gate arrays with effectively no manual assistance.
The implementation of a user-extensible system on a dynamically microprogrammable computer
Authors: Fergus K. Fung, Willis K. King
Venue: ACM SIGMICRO Newsletter (1977)

On a dynamically user-microprogrammable computer the user can tailor the machine to his needs by constructing microprogrammed routines and adding them to the system. If these routines are recognized by the assembler, then using them is no different from using any other basic machine instruction of the computer. The base machine is thus extended. The design and implementation of such a user-extensible system is described. It consists of 2 main parts: a pager which manages a virtual memory for the writable control storage and a user-extensible assembler which accepts microprogrammed routine into the virtual control memory and makes this an integral part of the system.
A Portable Graphics system for minicomputers
Authors: M. Catherine Neal, Linda G. Shapiro
Venue: Proceedings of the 1978 annual conference - Volume 2 (1978)

PIGLI (Portable Interactive Graphics Language Interpreter) is a high-level interactive graphics system implemented on an INTERDATA 8/32 minicomputer. PIGLI is written in sequential PASCAL and executes under the SOLO operating system, which is written in concurrent PASCAL and has been shown to be highly portable. This paper describes the major features of the PIGLI system including interactive programming commands, flexible hierarchic picture generation, referencing functions, query commands, exec files, and device independent output commands. In addition, the paper discusses the program design and its relationship to operating system and space considerations.
Career development for computer programmers in the business environment
Authors: Barbara Ann Evenson
Venue: Proceedings of the twelfth annual SIGCPR conference (1974)

This year Chemical Bank celebrated its one hundred and fiftieth birthday. As at the first quarter of 1974, we are the sixth largest bank in New York and the seventh largest bank in the United States. We are the twenty-fourth largest bank in the world. We have a total of approximately 12,000-plus employees. Our Information Services Group has a total of approximately 416 employees. The training staff provides training for all personnel, clerical, technical, and management, i.e., entry through management.
The implementation of the attributed recursive descent architecture in VAX-11/780 microcode
Authors: C. D. Ardoin, J. L. Linn, B. W. Reynolds
Venue: ACM SIGMICRO Newsletter (1984)

This paper describes a case study in the implementation of a special purpose architecture on a particular microprogrammable engine. The host engine used is the VAX-11/780; the target architecture is one tailored for implementing recursive descent translators. The paper describes the mapping of the target resources onto the host machine including a discussion of the issues involved in interfacing with the normal VAX environment. The architecture specification does not mandate the exact bit-level representation of the target architecture instructions allowing a more efficient emulator to be constructed. Many of the important design decisions involve choosing instruction representations to effectively utilize the host engine. The paper concludes with discussion of the considerable shortcomings of this approach, of the suitability of the VAX-11/780 as an underlying engine for the target architecture, and of the implications of the study for universal host machines.
Experience of using message spooling processors in a non-interactive network
Authors: D. R. Innes, J. L. Alty
Venue: Proceedings of the 1976 annual conference (1976)

The use of mini-computer subnets in computer communication networks is now widely established. Such subnets are normally designed for the fast response traffic of interactive computer usage. An alternative design, orientated to the high volume, slow response traffic of non-interactive computing, is described. The mini-computers have local disc based file stores through which the message traffic is spooled. These message spooling processors need not form a conventional communications subnet since only one message spooling processor is needed between any two host computers. This paper examines the advantages derived from message spooling in a variety of modes of operation.
Wire routing by optimizing channel assignment within large apertures
Authors: Akihiro Hashimoto, James Stevens
Venue: Proceedings of the 8th Design Automation Workshop (1971)

The purpose of this paper is to introduce a new wire routing method for two layer printed circuit boards. This technique has been developed at the University of Illinois Center for Advanced Computation and has been programmed in ALGOL for a B5500 computer. The routing method is based on the newly developed channel assignment algorithm and requires many via holes. The primary goals of the method are short execution time and high wireability. Actual design specifications for ILLIAC IV Control Unit boards have been used to test the feasibility of the routing technique. Tests have shown that this algorithm is very fast and can handle large boards.
Linear expected-time algorithms for connectivity problems (Extended Abstract)
Authors: Richard M. Karp, Robert Endre Tarjan
Venue: Proceedings of the twelfth annual ACM symposium on Theory of computing (1980)

Researchers in recent years have developed many graph algorithms that are fast in the worst case, but little work has been done on graph algorithms that are fast on the average. (Exceptions include the work of Angluin and Valiant [1], Karp [7], and Schnorr [9].) In this paper we analyze the expected running time of four algorithms for solving graph connectivity problems. Our goal is to exhibit algorithms whose expected time is within a constant factor of optimum and to shed light on the properties of random graphs. In Section 2 we develop and analyze a simple algorithm that finds the connected components of an undirected graph with n vertices in O(n) expected time. In Sections 3 and 4 we describe algorithms for finding the strong components of a directed graph and the blocks of an undirected graph in O(n) expected time. The time required for these three problems is &Ohgr;(m) in the worst case, where m is the number of edges in the graph, since all edges must be examined; but our results show that only O(n) edges must be examined on the average.*@@@@ In Section 5 we present an algorithm for finding a minimum weight spanning forest in an undirected graph with edge weights in O(m) expected time.
Does relevance feedback improve document retrieval performance?
Authors: Robert E. Williamson
Venue: Proceedings of the 1st annual international ACM SIGIR conference on Information storage and retrieval (1978)

Many authors (1, 2, 3, 5, 6, 7) have suggested that overall performance of a document retrieval system is improved by relevance feedback. Relevance feedback denotes the last three steps in the following process: 1) the searcher enters a query, 2) the system prepares a ranked list of suggested documents, 3) the searcher judges some of the documents for relevancy, 4) the searcher informs the system of these documents judged and of the judgement, 5) the system constructs a new query based on the descriptors used in the original query and the descriptors used in the documents judged, 6) the system prepares a second ranked list of suggested documents. The presumption is that the second list is better than the first. By all performance measures (e.g. -&-ldquo;fluid ranking-&-rdquo; and -&-ldquo;frozen ranking-&-rdquo;), the second list is better than the first. However, if one reranks documents in the original list so as to reflect the searcher's efforts (step 3), the corresponding performance measures are comparable to those for the second list. The marginal difference between the performance measures for the -&-rdquo;reranked original-&-rdquo; list (searcher's efforts alone) and the second list (which includes computer efforts) makes it unclear if the cost of steps 4 through 6 above can be justified. It is hoped that advocates of relevance feedback will present -&-ldquo;reranked original-&-rdquo; performance measures as a basis for any performance improvement claims. This paper also presents three reasonable, easily understood retrieval procedures for which the frozen ranking, the fluid ranking, and the reranked original evaluations are -&-ldquo;obviously-&-rdquo; the pertinent way to evaluate. Relevance feedback techniques as implemented in Salton's SMART DRS appear to show that it is worthwhile for user's to read abstracts prior to evaluation of full texts. The last indication presented in this paper is that the relevance feedback performance improvements noted using SMART are due mostly to the user making assessments; subsequent computer efforts appear to be most likely to result in no further change. For a query for which there is a subsequent change, the change is as likely to be harmful as helpful.
The enforcement of security policies for computation
Authors: Anita K. Jones, Richard J. Lipton
Venue: Proceedings of the fifth ACM symposium on Operating systems principles (1975)

Security policies define who may use what information in a computer system. Protection mechanisms are built into a system to enforce security policies. In most systems, however, it is quite unclear what policies a mechanism can or does enforce. This paper defines security policies and protection mechanisms precisely and bridges the gap between them with the concept of soundness: whether a protection mechanism enforces a policy. Different sound protection mechanisms for the same policy can then be compared. We also show that the &ldquo;union&rdquo; of mechanisms for the same program produces a more &ldquo;complete&rdquo; mechanism. Although a &ldquo;maximal&rdquo; mechanism exists, it cannot necessarily be constructed.