ppxscal/embedding_network huggingface dataset:
File allocation in distributed systems
Authors: K. M. Chandy, J. E. Hewes
Venue: Proceedings of the 1976 ACM SIGMETRICS conference on Computer performance modeling measurement and evaluation (1976)

The problem of allocating files in a computer network is a complex combinatorial problem due to the number of integer design parameters involved. These parameters include system cost, number of copies of each file to be stored, and sites at which the copies should be stored. The tradeoffs between these parameters are discussed. The design problem is formulated as an integer programming problem. A branch and bound algorithm is proposed to solve the problem. A linear programming formulation which ignores integer restrictions (and allows a fraction of a file to reside at a site) is shown to yield integer solutions in most cases. In other words integer restrictions are satisfied automatically. A near-optimal heuristic is presented, along with computational results. An efficient method to solve the file allocation problem for medium-scale networks is proposed.
Approaches to solid modelling (Panel Session)
Authors: Frank Bliss, William Carmody, Robert Johnson, Martin Schloessel, John Swarbrick
Venue: Proceedings of the 9th annual conference on Computer graphics and interactive techniques (1982)

Solid modelling systems in current use are based on approaches that are fundamentally different. The panelists will discuss the advantages and disadvantages of the different approaches, especially from the user's point of view.
An inventory management simulation game
Authors: Janet L. Showers
Venue: Proceedings of the 9th conference on Winter simulation - Volume 1 (1977)

The inventory management simulation is a multiechelon, multiproduct computer simulation of the Bell System inventory loop which can be controlled over a series of time periods. In the simulation the inventories, material flows, and accounting procedures of the inventory system are modeled in detail. The simulation was designed as a tool for teaching and illustrating inventory management concepts. Each period decisions must be made to control the flow of items throughout the loop. At the end of each period, stock information reports and financial statements are available to evaluate the decisions and the system's behavior. In this paper, the inventory system modeled in the simulation is described. In addition to the general operation and features, the education and research uses of the simulation are also presented.
Optimization aspects of compiler- compilers
Authors: T. E. Cheatham,  Jr., Thomas A. Standish
Venue: ACM SIGPLAN Notices (1970)

A decade of experience with prototype versions of compiler-compilers, some of which have been successful and some of which have not been so successful, leads us to the conclusion that we can now engineer good compiler-compilers which can generate efficient compilers that generate efficient object code. This paper reviews the experience with compiler-compilers, documents reasons for believing that some compiler-compilers are good, and advocates the importation of compiler-compiler techniques by commercial firms and the production of well-engineered compiler-compilers as commercial products. Some unanswered questions about compiler-compiler techniques are explored in relation to the newly emerging discipline of software engineering.
The specification of program flow in Madcap 6
Authors: James B. Morris,  Jr., Mark B. Wells
Venue: Proceedings of the ACM annual conference - Volume 2 (1972)

The control structures of the Madcap language have evolved to a point where today those of Madcap 6 have obviated programmer defined labels and go-to statements. The benefits of the removal of these concepts are discussed in detail. Madcap has a powerful class of data structures, including sets, sequences, and expressions, along with a full array of operators for manipulating these structures. These operators include important facilities for forming sets and for forming and concatenating sequences, based on very general iterative expressions. Procedures in Madcap are expressions whose evaluation is deferred; characteristics of this approach are discussed. Also described is a notation which facilitates backtrack programming.
Sorting on a mesh-connected parallel computer
Authors: C. D. Thompson, H. T. Kung
Venue: Proceedings of the eighth annual ACM symposium on Theory of computing (1976)

Two algorithms for sorting n2 elements on an n&times;n mesh-connected processor array that require 0(n) routing and comparison steps are presented. The best previous algorithms take time 0(n log n). Our algorithms are shown to be optimal in time within small constant factors.
The arpanet telnet protocol: Its purpose, principles, implementation, and impact on host operating system design
Authors: J. Davidson, W. Hathaway, J. Postel, N. Mimno, R. Thomas, D. Walden
Venue: Proceedings of the fifth symposium on Data communications (1977)

The protocol discussed in this paper was developed by many members of the ARPANET community starting in 1969 and continuing through the present. Many individuals and institutions have been members of this community at one time or another over the years. A review of the documents, both working and published, written on the subject of this protocol reveals that the following individuals were among those who contributed to the protocol design: A. Bhushan, R. Braden, R. Bressler, J. Burchfiel, S. Carr, V. Cerf, B. Cosell, D. Crocker, S. Crocker, W. Crowther, J. Davidson, D. Dodds, W. Duvall, G. Grossman, R. Gumpertz, W. Hathaway, W. Kantrowitz, R. Long, J. McConnell, A. McKenzie, R. Merryman, J. Melvin, R. Metcalfe, E. Meyer, N. Mimno, L. Nelson, T. O'Sullivan, M. Padlipsky, K. Pogran, J. Postel, M. Reese, J. Rulifson. R. Schantz, R. Thomas, R. Tomlinson, D. Walden, R. Watson, D. Wells, J. Winett, and S. Wolfe. No doubt others also contributed to the design and dozens of other individuals contributed to the many implementations of the protocol. We acknowledge all of their contributions. Many of the above named individuals were offered an opportunity to collaborate on the writing of this paper. The authors are those who responded. We apologize for the oversight to any individual who would have liked to help write this paper but was not apprised of the opportunity.
On the optimum structure for war-game simulations
Authors: A. T. Mollegen,  Jr.
Venue: Proceedings of the second conference on Applications of simulations (1968)

The primary content of this paper is a consideration of the basic approaches which may be used in constructing a war-game simulation. It is assumed that the simulation sponsor regards the simulation solely as a means of obtaining answers, and that he desires dependable answers quickly and cheaply. The life-cycle of a simulation is briefly discussed, and then the properties of a simulation as seen by (a) the simulation sponsor and (b) the simulation designer are discussed in some detail. A discussion is given of the comparative advantages and disadvantages of the Monte Carlo and probability-formula type simulations. An overall recommended approach is given, which consists of breaking the total game down into phases, and of developing independent simulations for each phase. Each phase can have its own optimum structure.
SAUSTALL - a new software environment
Authors: Robert K. Bell
Venue: Proceedings of the 5th ACM SIGSMALL symposium on Small systems (1982)

SAUSTALL (Sequential Algorithmic Universal Set-Theoretical Associative Logical Language) started as an attempt to define a new programming language. I have widened its scope to include the total software environment. It is hoped that SAUSTALL will be accepted as a general purpose language considerably better than conventional programming languages. Further, SAUSTALL attempts to overcome the conventional division of software into compilers, editors, command language, etc. It may be thought presumptuous to place before the public something which is a long way from availability. The reason for doing it is in the hope of getting reactions from the software community which will improve SAUSTALL.
A one-year introductory course for computer science undergraduate program
Authors: Ali Behforooz, Onkar P. Sharma
Venue: Proceedings of the twelfth SIGCSE technical symposium on Computer science education (1981)

The approach taken to teach the first undergraduate course in computer science varies a great deal. The one that places major emphasis on the teaching of a programming language is still widely used. We find many drawbacks with this approach. In our opinion, the discussion of introductory computer concepts and problem-solving techniques should precede the coverage of the syntax of a programming language. It is also our belief that basic data structure concepts should be presented in the first course and discussed independently of any particular programming language considerations. Finally, we don't subscribe to the view that teaching of programming styles should be delayed until later courses. With these ideas in view, we present in this paper the outline of a one-year beginning course for the computer science undergraduate degree program.
A critical path delay check system
Authors: Ryotaro Kamikawai, Minoru Yamada, Tsuneyo Chiba, Kenichi Furumaya, Yoji Tsuchiya
Venue: Proceedings of the 18th Design Automation Conference (1981)

A Critical Path Delay Check System for designing computers is described. It calculates the critical path delay between the start and end points. It can be used in the early stage of design when, for example, the location of the components on a plug-in card has not yet been determined. Some algorithms for predicting delays are also introduced.
Predicting the profitability of life insurance products
Authors: Eugene R. Mannacio
Venue: ACM SIGAPL APL Quote Quad (1981)

Predicting life insurance profitability is accomplished by making assumptions about parameters such as mortality, lapse rates, and expenses. These assumptions are used to project statutory profits, GAAP profits and model office results. We have developed an APL system which allows our actuaries to test the profitability of an insurance product for a variety of assumption sets. This system has simplified the process of specifying which assumptions are to be used and has fully automated the calculations. In doing so, it has virtually eliminated our need for special actuarial packages and has reduced the time needed to price life insurance products. This paper examines some considerations faced in the design and definition of this system.
Structure of complexity in the weak monadic second-order theories of the natural numbers
Authors: Edward L. Robertson
Venue: Proceedings of the sixth annual ACM symposium on Theory of computing (1974)

The complexity of decision procedures for the Weak Monadic Second-Order Theories of the Natural Numbers are considered. If only successor is allowed as a primitive, then every alternation of second-order quantifiers causes an exponential increase in the complexity of deciding the validity of a formula. Thus a heirarchy similar in form to Kleene's arithmetic heirarchy may be shown to correspond to the Ritchie functions. On the other hand, if first-order less-than is allowed as a primitive, one existential quantifier suffices for arbitrarily complex (in the Ritchie heirarchy) decision problems. This leads to a normal form, in which every sentence in the theory is equivalent in polynomial time to a sentence with less-than but only one existential second-order quantifier.
Uniform support for information handling and problem solving required by the VLSI design process
Authors: V. Ashok, W. McKnight, J. Ramanathan
Venue: Proceedings of the 21st Design Automation Conference (1984)

This paper addresses software engineering issues in designing software environments for managing the voluminous and non-homogeneous information generated during the VLSI design process. This involves not only a uniform logical framework within which to represent this information but also to provide a means to explicitly record the procedures used in creating and collecting this information. Our approach is to organize this information under a hierarchical framework based on grammars. The advantage of this approach lies in the ability to integrate both methodology information and CAD tools within this uniform framework. The approach is used to address problems which cannot be solved by designing sophisticated but isolated tools.
Contour plotting in rectangular domains&mdash;an APL approach
Authors: W. H. Niehoff
Venue: Proceedings of the sixth international conference on APL (1974)

Contour plotting of functions of two variables is useful for examining features of functions that are not clearly exhibited by normal plotting of traces. This paper reviews previous work on contouring and describes the use of that knowledge along with some important modifications to implement a contouring algorithm in APL. The purpose of the paper is to relate the design of the algorithm. As a result, the principal areas of discussion include the approach, the selection of data structures and the creation of the algorithm components.
On virtual memories and micronetworks
Authors: G. Jack Lipovski
Venue: Proceedings of the 4th annual symposium on Computer architecture (1977)

We propose to use the microcomputer in a network to share I/O resources such as printers and archival memories. A model of a network is developed where computers correspond to edges of a graph. This model reflects the desired characteristics of the microcomputer organization. The advantage of virtual memory in these microcomputers is discussed. Herein, pages in the virtual memory are packets in the network. Packets and requests for packets are generated by page faults and packets are stored and forwarded by hardware like that to manage virtual memory pages. The paper discusses the strategy for a micronetwork and suggests an implementation of the hardware of such a network.
Design considerations for a processing server
Authors: R. M. Needham
Venue: Proceedings of the 8th annual symposium on Computer Architecture (1981)

This paper considers design issues for machines to be used in a particular environment and for a particular purpose. The general name is processing servers.
A pragmatic view of distributed processing systems
Authors: Kenneth J. Thurber
Venue: Proceedings of the 8th annual symposium on Computer Architecture (1981)

This course provides an overview of state-of-the-art concepts and problems associated with implementing a distributed processing system. It defines what constitutes a distributed system and discusses contemporary models of distributed systems. The tutorial describes case studies including Ethernet, HYPERchannel, NESTAR, CLUSTER BUS, and Ungerman-Bass NET-ONE systems. A survey of design issues associated with system software, interconnection topology, and new hardware concepts is presented before concluding with observations on future system concepts.
The design of a distributed kernel
Authors: David R. Cheriton
Venue: Proceedings of the ACM '81 conference (1981)

The design of a distributed kernel for a multi-processor machine is described that combines the advantages of a shared centralized kernel with the efficiency of separate kernels per processor. The base machine architecture is a star network of microcomputer modules with a minicomputer as the central node, implemented using off-the-shelf hardware. The kernel implements a uniform, location transparent model of processes communicating via messages. Preliminary measurements are given for the message-passing times.
State of the art issues in distributed databases (ACM 81 Panel session): Transaction processing issues in the distributed database tested system
Authors: C. Devor Honeywell
Venue: Proceedings of the ACM '81 conference (1981)

Distributed database management systems provide architectures which include multiple independent processors. Such systems are capable of supporting multi-process distributed programs. This talk discusses how these features are used to increase inter- and intra-transaction parallelism and discusses the effects of parallelism upon consistency, termination, and recovery of transactions.
Assignments and high level data types
Authors: Bengt Nordström
Venue: Proceedings of the 1978 annual conference - Volume 2 (1978)

If x and y are integer variables or any other variables of a &ldquo;simple&rdquo; type, then the meaning of the assignment x:&equil;y is quite similar in different programming languages. The value of y is copied (into a register) and then stored into x so that a fresh copy of the value of y becomes the current value of x. On the other hand if x and y are compound objects the the situation is quite different: some languages don't allow assignments at all, and other languages call for a conditional copying depending on the form of the right hand side. This paper argues for a unified view on assignment with semantics, that can be described in terms independent of the complexity of the type of the variables involved. We also present some alternatives to assignments and discuss their consequences for programming with complex data types.
Lyra: A new approach to geometric layout rule checking
Authors: Michael H. Arnold, John K. Ousterhout
Venue: Proceedings of the 19th Design Automation Conference (1982)

Lyra is a layout rule checking program for Manhattan VLSI circuits. In Lyra, rules are specified in terms of constraints that must hold at certain corners in the design. The corner-based mechanism permits a wide variety of rules to be specified easily, including rules involving asymmetric constructs such as transistor overhangs. Lyra's mechanism also has locality, which can be exploited to construct incremental and/or hierarchical checkers. A rule compiler translates symbolic rules into efficient code for checking those rules, and permits the system to be retargeted for different processes.
Projection estimation in 3D PET reconstruction: a statistical evaluation
Authors: S. S. Furuie, G. T. Herman, N. D. A. Mascarenhas, S. Matej
Venue: Proceedings of the 1995 International Conference on Image Processing (Vol. 1)-Volume 1 - Volume 1 (1995)

The purpose of this work is to evaluate the estimation of projection data in fully 3D PET reconstruction. The estimation is carried out to reduce the effect of the noise prior to the application of a reconstruction algorithm and it is based on a non-linear operator that takes into account the Poisson nature of the noise. The evaluation is statistical, based on a set of 3D phantoms and on numerical observers for some typical medical tasks such as total uptake in regions of interest and detectability of hot and cold spots. Our work demonstrates that, for the studied tasks, the projection data estimation is an efficacious approach to fully 3D PET reconstruction.
Human factors (Tutorial Session)
Authors: James D. Baker, Richard W. Pew
Venue: Proceedings of the 1976 annual conference (1976)

This session will address the general problem of man-computer interaction in on-line systems. More rapid and effective man-computer communication has become perhaps the most pressing need of the computer systems industry. Much knowledge gained through psychological and human factors research is directly or indirectly applicable. Yet this information often fails to find its way to those who need it most&mdash;designers and implementors. It is the purpose of this session to address the nature of the man-computer interaction process, and to suggest specific ways in which man and computer can be made to function together more smoothly and cooperatively.
A line-expansion algorithm for the general routing problem with a guaranteed solution
Authors: W. Heyns, W. Sansen, H. Beke
Venue: Proceedings of the 17th Design Automation Conference (1980)

A new routing algorithm is presented which is based on the expansion of a line in the direction perpendicular to the line. The line-expansion principle is first applied to the single layer routing problem. For the routing on two layers only some minor modifications have to be made. An important extension is added in which the search for an interconnection from a given point is initiated in more than one direction at the same time. The major advantage of the line-expansion algorithm over the well-known line-search algorithm is the guarantee that always a solution will be found if one exists.
Magic's incremental design-rule checker
Authors: George S. Taylor, John K. Ousterhout
Venue: Proceedings of the 21st Design Automation Conference (1984)

The Magic VLSI layout editor contains an incremental design-rule checker. When the circuit is changed, only the modified areas are rechecked. The checker runs continuously in background to keep information about design-rule violations up-to-date. This paper describes the basic rule checker, which operates on edges in the layout, and the techniques used to perform incremental checking on hierarchical designs.
Associative/parallel processors for searching very large textual data bases
Authors: R. M. Bird, J. C. Tu, R. M. Worthy
Venue: ACM SIGMOD Record (1977)

This paper describes an approach to solving a major problem in the information processing sciences&mdash; that of searching very large (5-50 billion characters) data bases of unstructured free-text for random queries within a reasonable time and at an affordable price. The need by information specialists and knowledge workers for large, fast low-cost text and document retrieval systems is growing rapidly. Conventional approaches to the problem have usually depended upon expensive, general purpose computers, upon special pre-preprocessing of the textual data (e.g. file inverting, indexing, abstracting, etc.), and upon elaborate, costly software. The resulting retrieval systems often cost hundreds of dollars per query and the full scanning of an uninverted, unstructured billion byte textual data base could take hours of computer services. However, in spite of these restrictions, such full text search systems have proved useful and even indispensible for many applications. Computer technology of the late 1960's and the 1970's, in both hardware and software (e.g., minicomputers, low-cost, high density disk storage, &ldquo;chip&rdquo; electronics, natural language query systems, etc.), have made i t practical to build special purpose, low-cost text retrieval systems. Such a system has been built, tested, and is now in a production stage. The system called the Associative File Processor (AFP), utilizes a conventional minicomputer (DEC's PDP-11/45) for control, off-the-shelf high density disks for storage, a special purpose parallel search module as a text term detector, and query and retrieval software. The AFP is currently being field tested at two sites. Full text, parallel searches on un-preprocessed textual data bases are being performed at the effective matching rates of 4 billion bytes per second (8K byte key memory times 500 Kbyte/second data stream). Estimated costs are 10 to 25 cents per query for a one billion byte data base. The costs per query and the time for searching increase in a linear fashion as data base increases. A basic architecture for the AFP is described and an implemented version is discussed. A more powerful term detector module is also under development. This system is designed around a finite state automaton algorithm.
An order picking and shipping model
Authors: Lawrence W. Hillman
Venue: Proceedings of the third conference on Applications of simulation (1969)

This paper describes the use of a discrete event simulation model to aid in designing an enlarged order picking and shipping system. The model was used to compare the capacity effects of various conveyor configurations, to test assumptions of system design, and to arrive at an estimate of overall system capacity expansion of the revised system.