ppxscal/embedding_network huggingface dataset:
Design optimization by adaptive control
Authors: Eldon J. Reynolds, John J. Allan,  III
Venue: Proceedings of the 9th Design Automation Workshop (1972)

Advances in low cost digital computing have spawned new design techniques. One of these, design optimization by adaptive control (DOAC), is explained. The point is made that modeling an entire system to optimize one component has many disadvantages. When using the ideas presented here, a component is removed from a physical system and replaced with a minicomputer, D/A and A/D hardware, transducers, and an adaptive simulation algorithm. An example implementation is given, and some future possibilities are outlined.
Comments on the computer science/computer center interface
Authors: Robert Kyle
Venue: Proceedings of the annual ACM SIGUCCS symposium on The administration and management of small-college computing centers (1972)

I'd like to find out how many people in this group come from institutions of 4000 or more students. How many of you come from institutions of 2500 or less? How many come from institutions of 1000 or less students? How many of you have your own computer? Are there any of you who don't have your own computer on campus? Of those who don't have their own computer on campus, how many are using some kind of real-time system or shared system of some sort? So everyone in here is in some way already in the computer racket. Now let me get one more pair of questions and then break off from this kind of audience participation. How many of you come from institutions where your computer is used almost&mdash;not necessarily altogether, but almost&mdash;exclusively for administrative purposes? Are there any people here whose computer is used altogether for instructional or educational purposes? Okay, that gives me a good idea of where things stand. It's really quite a broad spectrum of interests and backgrounds, as one might expect. Meetings of this kind frequently announce that they are appealing to small colleges, but because small colleges can't afford to come, the medium-size colleges, who think they're small anyway because they look at their budgets and realize what they'd like them to be, are the people who make up the group. I'm pleased to see the broad spectrum of interest. There were a good many comments earlier about curriculum. I come to you in a sense from the American Society of Information Science, a group with which I've had a good bit of involvement, and it is currently espousing a new curriculum look, inspired in part by &ldquo;Curriculum '68.&rdquo; In the American Society for Information Science we would make the claim&mdash;incidentally, I should preface this perhaps, with Harris's charge to me to produce some nice, controversial comments and bait you into a great deal of response&mdash;that information science is the basic routine, and computer science is a facet of it. This is also true of library science and several other fields which are quite different. All these have a common interface in an area which might be called information science, and as such, the American Society for Information Science recognizes that curriculum efforts so far have all been so computer oriented, so specifically use-of-computer oriented, that they've decided to explore the possibilities of some more curriculum material. One of the interesting things to me is that your comments this morning led me to realize that there has been no consideration built into this plan, per se, for the smaller schools. I think that's a big mistake, and I intend to try to see that something is done about it. I don't know how far this might be carried.
Neighborhood search algorithms for finding optimal traveling salesman tours must be inefficient
Authors: P. Weiner, S. L. Savage, A. Bagchi
Venue: Proceedings of the fifth annual ACM symposium on Theory of computing (1973)

search In this paper, we explore the use of neighborhood search techniques for finding optimal solutions to the symmetric Traveling Salesman Problem. These techniques have been dramatically successful in obtaining near-optimal solutions to this problem for a reasonable expenditure of effort (1,2,3,4,5,6,9,10,12). Extensions of these techniques can be used to obtain the globally optimum solution, but the effort involved is at least an exponential function of the number of cities, n. Indeed, as this paper demonstrates, all local search algorithms that are capable of finding the optimal solution to an arbitrary n-city problem must grow at least as fast as equation !. Thus for large problems, these algorithms are computationally inefficient. In following section we show that any exact neighborhood search algorithm for the Traveling Salesman Problem must inspect a prohibitively large number of feasible solutions. We begin with a brief discussion of the Traveling Salesman Problem (TSP) and neighborhood search techniques in section II. In section III we develop a necessary condition for neighborhood search to converge to an optimal solution. We use this result in sections IV and V to obtain a lower bound on the effectiveness of neighborhood search as applied to the TSP.
Introductory programming reconsidered - a user-oriented approach
Authors: Bob Cherniak
Venue: Proceedings of the ACM SIGCSE-SIGCUE technical symposium on Computer science and education (1976)

A comprehensive plan for an introductory Computer Science Course is presented, a plan where experience with a computer from the user point of view is a major component, not only for its own sake but as a stimulant for the development of clean programming habits.
RTFILE: Advanced data base management for DEC LSI-11s and PDP-11s running the RT-11 operating system
Authors: Robert C. Natale
Venue: Proceedings of the 1981 ACM SIGSMALL symposium on Small systems and SIGMOD workshop on Small database systems (1981)

The main purpose of this paper is to discuss about RTFILE and its utilities.
On the use of bit maps for multiple key retrieval
Authors: Oscar Vallarino
Venue: ACM SIGMOD Record (1976)

The traditional file structures used to support fast response to complex user queries have been based on the inverted list organization, using either the pointer or bit string representation. In this paper, the use of bit maps for executing multiple key searches is studied. Bit maps turn out to be less precise inverted lists Where the inversion is kept for a quantization of attribute domains and the objects referenced are blocks of data records. The goal is to reduce the total number of I/O accesses required to execute a retrieval based on a Boolean qualification. An evaluation of the method is given for both storage space and expected retrieval time under simplified assumptions. Key Words and Phrases: Multiple key retrieval, inverted lists, bit strings, bit maps, Boolean queries, data base management. CR Categories: 3.70, 3.71, 3.73, 3.74, 4.33, 4.34
Simulation of a multi-stage manufacturing process
Authors: Donald E. Pearson
Venue: Proceedings of the second conference on Applications of simulations (1968)

Providing management control of the multi-stage manufacturing processes found in industry today requires the engineer to apply more sophisticated methods of process definition and analysis. These statistical methods may be collectively called operations research of which simulation is a specific technique. The following paper describes the use of simulation to solve multi-stage process problems in terms of problem definition and analysis of the simulator output.
Locally minimum-distance correction of syntax errors in programming languages
Authors: Kuo-Chung Tai
Venue: Proceedings of the ACM 1980 annual conference (1980)

A formal model for locally minimum-distance correction of syntax errors is presented. This model is based on the assumption that errors occur in clusters which are separated by at least k correct symbols. Even if the assumption fails, this model can still be applied to produce a syntactically correct program from any input string. The value of k can be chosen by the programmer. A larger k reduces the chance that the correction made for one cluster of errors causes spurious errors in the remaining input. Several previous error correction methods are shown to be special cases of this model. A general algorithm for this model is given. An efficient LL(1) error correction algorithm for this model is also provided. Possible extensions of this model and future research are discussed.
Line digraph iterations and the (d,k) problem for directed graphs
Authors: M. A. Fiol, I. Alegre, J. L.A. Yebra
Venue: Proceedings of the 10th annual international symposium on Computer architecture (1983)

We consider in this paper the (d,k) problem for directed graphs: to maximize the number of vertices in a digraph of degree d and diameter k. For any values of d and k, we construct a graph with a number of vertices larger than (d 2&minus;1)/d2 times the (non-attainable) Moore bound. In particular, this solves the (d,k) digraph problem for k&equil;2. We also show that these graphs can be obtained as line digraph iterations and that this technique provides us with a simple local routing algorithm for the corresponding networks.
Equipment maintenance studies using a combination of discrete event and continuous system simulation
Authors: Harold G. Hixson
Venue: Proceedings of the third conference on Applications of simulation (1969)

These studies were undertaken to investigate the costs of alternative equipment maintenance procedures. The paper describes the scope of the investigation, the need for both discrete and continuous representation, the study costs and results, and the potential for using this model for additional applications.
A model high school computer lab(Special Session)
Authors: Irwin J. Hoffman
Venue: Proceedings of the fourteenth SIGCSE technical symposium on Computer science education (1983)

The George Washington High School has received many awards for its ecumenical approach to affording students a computer experience. The computer curriculum and laboratory treat the whole spectrum of student abilities and subject areas, including not only mathematics and business but also other areas such as English, art and music, as well as the educationally underprivileged. The curriculum includes 16 formal classes, and the laboratory currently contains 36 computers. The development and organization of the computer laboratory and curriculum will be presented. A brief demonstration of software to teach English to students speaking Spanish, Laosian, Hmong, and Vietnamese.
Probabilistic budgeting: One practical experience
Authors: R. J. Lord
Venue: Proceedings of the 9th conference on Winter simulation - Volume 2 (1977)

Probabilistic budgeting has been recommended in the accounting literature for nearly fifteen years as a basis for enabling organizations to better plan for and cope with uncertainty. Unfortunately, while it has been argued that the information contained in a probabilistic budget is essential for improved planning and management neither the feasibility or relevance of probabilistic budgets has been demonstrated. An attempt to develop a probabilistic budget utilizing Monte-Carlo Simulation is reported in this paper. It describes how the model of a small transport firm was developed and how the data necessary to support the model was gathered. It then discusses the apparent implications of this probabilistic budget for the firm, for the practical application of simulation techniques to the budget development process, and for the broader field of planning and management control.
A less dynamic memory allocation scheme for algol-like languages
Authors: Thomas P. Murtagh
Venue: Proceedings of the 11th ACM SIGACT-SIGPLAN symposium on Principles of programming languages (1984)

The conventional storage allocation scheme for block structured languages requires the allocation of stack space and the building of a display with each procedure call. This paper describes a technique for analyzing the call graph of a program in a block structured language that makes it possible to eliminate these operations from many call sequences, even in the presence of recursion.
In support of domain structure for operating systems
Authors: Douglas Cook
Venue: Proceedings of the seventh ACM symposium on Operating systems principles (1979)

One approach advocated in the search for better designed and more reliable operating systems is to base the design on the use of small protection domains. This paper presents empirical evidence to show that, with a suitable architecture, the overheads associated with using small protection domains do not make this an impractical approach.
Supporting ada memory management in the iAPX-432
Authors: Fred J. Pollack, George W. Cox, Dan W. Hammerstrom, Kevin C. Kahn, Konrad K. Lai, Justin R. Rattner
Venue: ACM SIGARCH Computer Architecture News (1982)

In this paper, we describe how the memory management mechanisms of the Intel iAPX-432 are used to implement the visibility rules of Ada. At any point in the execution of an Ada&reg; program on the 432, the program has a protected address space that corresponds exactly to the program's accessibility at the corresponding point in the program's source. This close match of architecture and language did not occur because the 432 was designed to execute Ada&mdash;it was not. Rather, both Ada and the 432 are the result of very similar design goals. To illustrate this point, we compare, in their support for Ada, the memory management mechanisms of the 432 to those of traditional computers. The most notable differences occur in heap-space management and multitasking. With respect to the former, we describe a degree of hardware/software cooperation that is not typical of other systems. In the latter area, we show how Ada's view of sharing is the same as the 432, but differs totally from the sharing permitted by traditional systems. A description of these differences provide some insight into the problems of implementing an Ada compiler for a traditional architecture.
An interactive system for page layout design
Authors: Peter B. Denes, Ira K. Gershkoff
Venue: Proceedings of the 1974 annual conference - Volume 1 (1974)

A prototype interactive page layout system is described in which textual and pictorial information can be manipulated under computer control on a scanned color display. The system demonstrates the unique advantages of a scanned display for the showing of both text and illustrations, of details of different fonts, and of color. Text can be edited, positioned, and changed in size, font, and case; pictures can be positioned, shrunk, enlarged, and cropped. The color of both text and pictures can also be changed in order to guide the designer's eye to essential parts of the page. The system is suitable for designing both the individual advertisements and complete pages of directories or newspapers.
Routing of printed circuit boards
Authors: S. Aranoff, Y. Abulaffio
Venue: Proceedings of the 18th Design Automation Conference (1981)

A SOFTWARE PROGRAM FOR THE ROUTING OF PRINTED CIRCUIT BOARDS IS DISCUSSED IN THIS PAPER. THIS PROGRAM IS PART OF A SYSTEM WHICH INCLUDES READING DATA FROM THE ENGINEER'S SCHEMATIC DIAGRAM, PLACING THE COMPONENTS ON THE BOARD, AND ROUTING THE CONNECTIONS. THE LAYOUT IS THEN WORKED UPON ON A GRAPHIC DISPLAY TO IMPROVE AND COMPLETE THE ROUTING, WHICH IS THEN USED TO PRODUCE THE PC BOARD. IN THIS PAPER ONLY THE ROUTER IS DISCUSSED. THE RESULTS ARE THAT WITH BOARDS WITH 6 SIGNAL LAYERS AND ABOUT 3 CHIPS PER SQ. IN., OVER 99% OF THE PATHS WERE FOUND. THIS WORK DEMONSTRATES THAT A MAZE-RUNNER CAN BE AN EXCELLENT ROUTER, IF ONE GUIDES THE MAZE-RUNNER PROPERLY BY ENCOURAGING THE PATHS TO HAVE THE DESIRED PROPERTIES, AND BY INTRODUCING RESTRICTIONS SO THAT THE PATHS TEND TO LIE ON REGULAR DIRECTIONS WITH A MINIMUM OF INTERFERENCE WITH EACH OTHER.
The command interpreter and command language design of the com-share COMMANDER II system
Authors: Steven S. Muchnick
Venue: Proceedings of the 1976 annual conference (1976)

The command language of the COMMANDER II time-sharing system was designed on the basis of a well-developed philosophy of the facilities a time-sharing utility should provide its users and the form in which the two should communicate. The philosophy includes concern for symmetry and completeness of the facilities provided, simplicity of input formats, confirmation of potentially disastrous effects, full use of the capabilities of the terminal, compatibility between batch and interactive use, and the Law of Least Astonishment. These philosophical principles are implemented in COMMANDER II in part by a system call which parses and dispatches a command for processing based on a table which describes the legal command imperatives and the associated parameters, default values, prompting structure, and so on.
VLSI tools and architectures: Putting the new technology to work
Authors: John Ousterhout
Venue: Proceedings of the 1983 computer science conference (1983)

This paper surveys the developments in VLSI that were triggered by the Mead-Conway design style. Computer-aided design tools and new architectures are reviewed, and future trends are suggested. The most significant future developments in tools are likely to center around the joining of procedural and graphical design methods, and the need for good routing aids. In the area of architecture, one of the most important unsolved problems is how to integrate special-purpose VLSI circuits easily into general-purpose computing systems.
Function arrays
Authors: Robert Bernecky
Venue: Proceedings of the international conference on APL (1984)

A functional enclose operator, which returns the scalar representation of a function, is introduced. By providing a scalar representation of a function, functional enclose provides capabilities similar to those of SHARP APL Packages. When used in conjunction with the formatting function, functional enclose supplants (@@@@)cr. Apply is defined as a proper extension of the execute (@@@@) primitive function to the domain of enclosed function and array arguments. Apply, in conjunction with functional enclose, extends the architecture of APL from SIMD [Single-Instruction , Multiple-Data] to MIMD [Multiple-Instruction, Multiple-Data], by allowing creation and concurrent execution of 'arrays' of functions. This provides a concise facility for the establishment of concurrent processes within a single APL task. Additional extensions allow these processes to communicate via shared variables, permitting the logical creation of arbitrary interprocessor connections, and facilitating the synchronization and control of such processes. Apply provides a hardware-independent way of describing various MIMD architectures, such as banyan- or cube-connected machines, and dataflow machines.
The importance of being square
Authors: Clyde P. Kruskal, Marc Snir
Venue: ACM SIGARCH Computer Architecture News (1984)

We present a theory that defines performance of packet-switching interconnection networks (delay and capacity) and their cost in terms of their geometry. This is used to prove that square banyan networks have optimal performance/cost ratio. These results, together with some known results on the complexity of routing in multistage networks, show that multistage shuffle-exchange networks are the unique networks with both optimal performance and simple routing. Finally, square delta networks are shown to have optimal area complexity.
The scheduling of multiple disk drives
Authors: Richard R. Reisman
Venue: Proceedings of the 1974 annual conference - Volume 1 (1974)

Techniques for scheduling disk drives are of two types: those which schedule transfers (based on rotational position) and those which schedule seeks (based on cylinder position). A simulation model has been developed to evaluate both of these approaches in a multiple drive environment. Use of this model for a comparison of two techniques for transfer scheduling has recently been reported [13]. This paper presents additional results of that study and extends it with a preliminary exploration of seek scheduling effects. The results indicate that seek scheduling can be effective for large configurations only when used in conjunction with a transfer scheduling technique.
Simulating station activity in an Advanced Group Rapid Transit system
Authors: Marilyn S. Sanfilippo
Venue: Proceedings of the 10th conference on Winter simulation - Volume 2 (1978)

Advanced Group Rapid Transit (AGRT) is a completely automated, guideway-based transit system concept that is currently being developed for the U.S. Department of Transportation. The system deploys small vehicles that are computer-controlled and dispatched in response to passenger requests for service. Passengers using the system can travel between any two stations in the network without changing vehicles. One critical area of the total system design is the area of station operations. The effect of configurations of berths and guideway within the station and the strategies used to assign vehicles to load and unload passengers at specific berths must be considered. This paper discusses the development and implementation of a discrete-event simulation designed for use in testing alternative station configurations and berthing strategies. The station model is flexible enough to simulate the range of possible station configurations and strategies for assigning vehicles to berths. The simulation also incorporates a high degree of detail in order to reflect differences of relatively small magnitude in station performance.
A simple analysis of exclusive and shared lock contention in a database system
Authors: Stephen S. Lavenberg
Venue: ACM SIGMETRICS Performance Evaluation Review (1984)

We consider a probabilistic model of locking in a database system in which an arriving transaction is blocked and lost when its lock requests conflict with the locks held by currently executing transactions. Both exclusive and shared locks are considered. We derive a simple asymptotic expression for the probability of blocking which is exact to order 1/N where N is the number of lockable items in the database. This expression reduces to one recently derived by Mitra and Weinberger for the special case where all locks are exclusive.
Location of a point in a planar subdivision and its applications
Authors: D. T. Lee, F. P. Preparata
Venue: Proceedings of the eighth annual ACM symposium on Theory of computing (1976)

Given a subdivision of the plane induced by a planar graph with n vertices, in this paper we consider the problem of identifying which region of the subdivision contains a given test point. We present a search algorithm, called point-location algorithm, which operates on a suitably preprocessed data structure. The search runs in time at most 0((log n)2), while the preprocessing task runs in time at most 0(n log n) and requires 0(n) storage. The methods are quite general, since an arbitrary subdivision can be transformed in time at most 0(n log n) into one to which the preprocessing procedure is applicable. This solution of the point-location problem yields interesting and efficient solutions of other geometric problems, such as spatial convex inclusion and inclusion in an arbitrary polygon.
Case analysis on the MIS/USER interface
Authors: Nestor Guimaraes
Venue: Proceedings of the seventeenth annual computer personnel research conference (1980)

The ultimate test of the MIS/USER interface effectiveness is the company's systems implementation history. The analysis of a major system implementation failure is presented. Two well-known implementation process management models are used as a framework for analysis and to a great extent they seem to explain the reason for the failure. From the analysis, with hindsight, suggestions are made on what could have been done to improve the chances of the project.