ppxscal/embedding_network huggingface dataset:
The synthesizer generator
Authors: Thomas Reps, Tim Teitelbaum
Venue: ACM SIGPLAN Notices (1984)

Programs are hierarchical compositions of formulae satisfying structural and extra-structural relationships. A program editor can use knowledge of such relationships to detect and provide immediate feedback about violations of them. The Synthesizer Generator is a tool for creating such editors from language descriptions. An editor designer specifies the desired relationships and the feedback to be given when they are violated, as well as a user interface; from the specification, the Synthesizer Generator creates a full-screen editor for manipulating programs in the language.
Infinite arrays and diagonalization
Authors: J. O. Shallit
Venue: ACM SIGAPL APL Quote Quad (1981)

This paper discusses the application of infinite arrays to several areas, notably the formation of &ldquo;do-while&rdquo; expressions. The functions diagonal and inverse diagonal are defined, with applications to processing both finite and infinite arrays. Infinite arrays are shown to be useful in mathematical exposition. Finally, suggestions are given for the implementation of diagonalization functions.
Automatic design with dependence graphs
Authors: A. E. Casavant, D. D. Gajski, D. J. Kuck
Venue: Proceedings of the 17th Design Automation Conference (1980)

A design automation system for the design of digital systems from a high-level algorithmic description is proposed. The definition of the data-dependence graph and techniques for performing transformations that lead to optimization of hardware are described. The system can be used on several levels of design with the VLSI layout level given particular emphasis.
Total Energy Plant - simulation model
Authors: R. D. Doering, Y. A. Hosni
Venue: Proceedings of the 12th conference on Winter simulation (1980)

A case of Total Energy Plant (TEP) has been modeled and the operational characteristics simulated. Applying the simulated data to the model will assist the TEP dispatcher in deciding on the operational schedule for the plant energy generating components, to attain an optimal cost of generating consumer demands for various types of energies.
Computer design: Generalized measures of computer system performance
Authors: J. R. Hillegas, A. C. Nester, J. A. Gosden, R. L. Sisson
Venue: Proceedings of the 1962 ACM national conference on Digest of technical papers (1962)

GENERALIZED measures of computer system performance are being developed as part of a comprehensive information service. The need for standardized performance criteria is emphasized by the wide range of commercially available computers, the varied configurations each can assume, the great variety of tasks and methods of implementing them, and the ever-present limitations upon time and money for the selection, programming, and operation of the system.
Engineering applications I: Application of the adjoint system of differential equations in the solution of the Bang-Bang Control problem
Authors: T. R. McCalla, A. M. Wildberger
Venue: Proceedings of the 1962 ACM national conference on Digest of technical papers (1962)

THIS PAPER will report on the investigation of certain problems in the optimum control of a linear dynamic system, particularly the problem of determining the minimum time required to drive a linear, constant coefficient dynamic system from an initial state to a specified terminal state with a limited power source. An important feature of this treatment is that an elementary method of solution for the problem is given. This is a method of successive approximations based on the adjoint system of differential equations. The method is similar to that which Bliss used in calculating differentials in Ballistics. A program for solving the minimum-time problem on a digital computer will be presented, and elementary methods will be used to prove that if the routine converges, then the solution thus found yields the desired minimum time.
Performance measurements on HEP - a pipelined MIMD computer
Authors: Harry F. Jordan
Venue: Proceedings of the 10th annual international symposium on Computer architecture (1983)

A pipelined implementation of MIMD operation is embodied in the HEP computer. This architectural concept should be carefully evaluated now that such a computer is available commercially. This paper studies the degree of utilization of pipelines in the MIMD environment. A detailed analysis of two extreme cases indicates that pipeline utilization is quite high. Although no direct comparisons are made with other computers, the low pipeline idle time in this machine indicates that this architectural technique may be more beneficial in an MIMD machine than in either SISD or SIMD machines.
Computer-aided process design and simulation for forging of turbine blades
Authors: Nuri Akgerman, David J. Kasik
Venue: Proceedings of the 11th Design Automation Workshop (1974)

Turbine and compressor blades for jet engines and gas turbines are forged from high-strength alloys and require close control of the process parameters. The design and manufacture of the dies require particular attention, for they impart their geometry to the final product. For precision forging, the die surface must be corrected for local elastic deflections and thermal shrinkage. Considering turbine blades as a geometric family, a system of programs was developed to aid in forging process design. Given data on the configuration of the blade, the material properties and the forging conditions, this system of programs calculates (a) the optimum forging plane to minimize lateral forces, (b) the required stock volume and weight, (c) the forging load and the torque on the dies, (d) the optimum flash dimensions for uniform metal flow, (e) the average temperature of the blade during forging and (f) the local stresses and elastic deflections during forging. A simulation of the process aids in preform design and in minimization of flash losses by determining the proper position of the preform in the die. This system of programs requires the ability to visualize the forging die to facilitate the design process. Computer graphics has been used in two phases to aid this visualization; first, in the design of the dies using the system and second, in explaining its capabilities to others. The first phase relies on the use of interactive graphics techniques to provide information about the die, which includes representations of (a) the preform determined by the programs, (b) the cutter paths necessary to cut the part, and (c) the die itself. Interactive graphics allows the user to make decisions and modify his design rapidly. The second phase uses motion picture techniques to present the findings of this project. Computer animation has been added to conventional techniques to help audiences conceptualize the forging process. The animation allows the audience to view the process in slow motion by illustrating metal flow behavior and the variations of die stresses during forging. This technique has proved to be successful in demonstrating the capabilities of the system to a wide range of audiences.
Chip partitioning aid: A design technique for partitionability and testability in VLSI
Authors: S. DasGupta, M. C. Graf, R. A. Rasmussen, R. G. Walther, T. W. Williams
Venue: Proceedings of the 21st Design Automation Conference (1984)

This paper presents a structured partitioning technique which can be integrated into the design of a chip. It breaks the pattern of exponential growth in test pattern generation cost as a function of the number of chips in a package. In one of its forms, it also holds the promise of parallel chip testing, as well as migration of chip-level tests for testing at higher package levels.
Toward a simulation model of the stock market
Authors: Charles C. Ying, Neil B. Bromberg, Martin K. Solomon
Venue: Proceedings of the 5th conference on Winter simulation (1971)

A simulation model of the stock market is proposed here. While it is not practical (nor desirable) to include all aspects of the stock market in our model, we do hope that the proposed market mechanism has captured a sufficient number of essential features of basic forces underlying the stock market that it can serve as a first step toward an operational framework for studying the behavior of stock prices.
Turning on the undergraduate computer science student: A RE-IPL suggestion
Authors: Edward L. Schulman
Venue: ACM SIGCSE Bulletin (1977)

The School of Advanced Technology currently has a number of courses that are used to better acclimate students on the graduate level to an industrial environment. This paper describes a two-course sequence designed for the undergraduate level that serves the same purpose.
Program optimization - theory and practice
Authors: David B. Loveman, Ross A. Faneuf
Venue: ACM SIGPLAN Notices (1975)

The conventional program optimization techniques employed by the ILLIAC FORTRAN compiler are general purpose, effective, and efficient. The underlying theory is applicable to FORTRAN and to other high level languages. A unique approach to the gathering of global set and use information about variables as well as careful software engineering of the algorithms has led to the construction of an effective source-to-source optimizer which performs constant propagation, constant computation, common subexpression elimination, reduction in strength, and invariant code motion. We will first consider the type of information which must be gathered about a program, and how this information is used to perform optimization. Then we shall state the algorithm for globally computing the set and use information for program variables. Having discussed the science of optimization we shall turn to the engineering aspects and consider such topics as representation of programs, order of optimization transformations, and efficient computation of global use and set information.
Simulation of the Coast Guard search and rescue process
Authors: Gerald L. Underwood
Venue: Proceedings of the 12th annual symposium on Simulation (1979)

The Search and Rescue Simulation (SARSIM) is a management tool that is being used by U.S. Coast Guard decision makers to assist in the allocation of limited resources with the goal of achieving desired levels of performance. SARSIM is an event oriented digital computer simulation that is programmed in SIMSCRIPT II.5 and is operational on CDC (CYBERNET) remote computing service.
Information retrieval: information storage and retrieval using AVL trees
Authors: C. C. Foster
Venue: Proceedings of the 1965 20th national conference (1965)

ALTHOUGH TREES have long been used for the storage and retrieval of information 1,2, unfortunately there is a tradeoff between storage (construction) time and retrieval time. To keep retrieval time at a minimum, the tree must be balanced; but posting a new item under this constraint can require a complete reorganization of the tree. Conversely, if the tree is allowed to grow without restriction on its structure, the average number of probes (that is, references to main memory) required for retrieval can approach N/2, depending on the order of arrival of the items. Recently, Adel'son-Vel'skiy and Landis presented a tree structure that provides a good compromise between the two extremes of complete balancing and unrestricted growth 3. Their structures - called AVL trees here - are characterized by the constraint that the two subtrees dependent from any node will have maximum path lengths that will differ at most by one. This paper reviews the results of Adel'son-Vel'skiy and Landis, presenting somewhat expanded versions of their proofs. It then goes on to derive the mean number of probes for posting and retrieval in these structures. Finally, it shows that the number of probes required to post items on or retrieve items from AVL trees are few enough to permit a suitably organized computer, using only conventional components, to keep up with the delivery of requests from a buffered hypertape.
Clustering and linear placement
Authors: Donald M. Schuler, Ernst G. Ulrich
Venue: Proceedings of the 9th Design Automation Workshop (1972)

This paper presents two algorithms, one for clustering a set of interconnected nodes and the other for forming a linear placement of clustered interconnected nodes. The linear placement algorithm requires the output of clustering as an input. The two algorithms were designed to analyze the structure of digital logic for automatic placement of logic functions on a MOS/LSI chip as part of an automatic layout system8 and so far have only been used for that application. However, the clustering algorithm could be used to analyze any undirected graph. Both algorithms are noniterative and provide very good results with small amounts of computer time.
Microprogramming in large scale architecture
Authors: J. R. Douglas
Venue: Conference record of the 6th annual workshop on Microprogramming (1973)

The choice of architectures open to designers of large scale systems seems a bewildering array until certain rules of design can be identified. This presentation has outlined the design choices made in one implementation of a large scale system. The author of this presentation is not proclaiming that time multiplexed designs are the answer to all problems, but feels this approach, however implemented, should be given serious consideration for processor designs of almost any size system.
Design and implementation of a portable database system for small computers
Authors: G. Weck, B. Wiesner
Venue: ACM SIGSMALL Newsletter (1981)

This paper describes the design and implementation of PEDMS. Part B describes design objectives, resulting system architecture and interfaces to user and database administrator. Part C concentrates on the implementation of PEDMS, discussing the difficulties imposed by the environment, and the ways of circumventing these difficulties.
A contour display generation algorithm for VLSI implementation
Authors: Michael J. Zyda
Venue: ACM SIGGRAPH Computer Graphics (1982)

Recent articles have discussed the current trend towards designing raster graphics algorithms into VLSI chips. The purpose of these design efforts is to capture some of the real-time animation capability found in vector graphics systems. Currently, real-time vector graphics animation is limited primarily to operations involving coordinate transformations. In order to enhance this animation capability, frequently encountered vector graphics algorithms that require the high speed, parallel computation capability of VLSI must be identified. Real-time contour display generation from grid data is one such algorithm. This paper describes the specifics of a contour display generation algorithm, the architectural framework of a processor that performs this algorithm and the architectural requirements of such a processor. The contouring algorithm is based on a data structure, the contouring tree, whose regularity and amenability for parallel computation make it an ideal candidate for VLSI. The architectural framework for a contouring processor chip that performs this algorithm for the real-time environment of interactive graphics is discussed, particularly the issues of memory size and data distribution. A model of the contouring process is created in order to determine the necessary physical parameters of the contouring processor in this architectural framework. Conclusions are drawn concerning the feasibility of producing a VLSI chip that performs this contouring algorithm.
A questionnaire analysis of the needs and opportunities provided to employees at a computing center
Authors: Michael P. Munger, Donald F. Costello, Susan C. Duda
Venue: Proceedings of the eighth annual SIGCPR conference (1970)

The management of the University of Nebraska Computing Center (UNCC) is faced with primarily two tasks. The first task is making decisions in accordance with externally imposed conditions, such as physical resources and policies established by the University administration. The second task is making decisions according to UNCC internal policies and professional staff needs. With respect to the second task, it became apparent during planning sessions that management had available various sources of data concerning the staff on a global level, primarily the monthly reports generated by the accounting system, but only one source of data concerning the needs of individual staff members, this being the individual's supervisor. While it was possible for the supervisors to meet and try to synthesize various views into a global picture of staff requirements, such a picture is necessarily highly subjective. An additional source of data was required. A review of the literature revealed that most studies related to such topics as &ldquo;job satisfaction&rdquo; were based on populations already well defined; the newly emerging profession(s) concerned with computers pose special problems for the researcher, problems which are largely definitional in nature.
The bayesian computer-assisted data analysis (CADA) monitor
Authors: Gerald L. Isaacs, Melvin R. Novick
Venue: ACM SIGCUE Outlook (1976)

Many steps are involved in completing a Bayesian statistical analysis. Some are skilled tasks requiring the expertise of a professional, others are purely mechanical. The former include such tasks as choice of model, specification of the prior distribution and interpretation of the posterior distribution; the latter include such things as the arithmetic necessary to combine the prior distribution with the data to produce the posterior distribution and to produce probability statements from that distribution. Unfortunately, it is all too often the case that the arithmetic gets in the way of the professional's decision-making responsibilities by breaking concentration and line of thought; and at times the sheer bulk of computation precludes the use of advanced techniques by the unaided researcher. What is required is a monitoring system that does all of the arithmetic and, even further, sees to it that all of the steps in the analysis are performed correctly and in their proper sequence. Also, within an instructional process, it can be very useful to have a system that helps a student learn by guiding his steps through a valid statistical analysis even if he doesn't yet fully understand what he is doing. For these and other reasons, a system of Computer-Assisted Data Analysis (CADA) was developed at the University of Iowa (Novick, 1971, 1973). Further investigation into available computer technology coupled with expansion of the theoretical base on which the original system rested resulted in the refinement and expansion of the available programs and the construction of a monitor to facilitate their use.
A load leveling support methodology for networking
Authors: Stephen R. Kimbleton, Helen M. Wood
Venue: Proceedings of the 76 Bicentennial conference on Winter simulation (1976)

Networking provides an effective means for resource sharing; however, its utility for load leveling requires further demonstration. This paper examines obstacles to load leveling and concludes that the key issues relate to the possible loss of control over remotely processed jobs and data. Although an organizational framework necessary to provide appropriate control exists, the technological support mechanism necessary for control in the form of processing guarantees has not yet been developed. Such development requires an essentially real time control capability for determining both the feasibility of accepting remote jobs as well as the guarantees which can be stipulated when such jobs are offered for processing. The key component of this capability is shown to be a very fast analytically driven simulation technique which can be invoked at a given site each time a job is offered for processing. We note in passing that this control capability can be viewed as the &ldquo;other side&rdquo; of control limits. That is, while control limits are concerned with determining when system performance has strayed out of bounds, a control capability is concerned with dynamic control of system workload to keep system performance within bounds.
Decision process simulation models of defense contractor behavior
Authors: Kalman J. Cohen, Arie Y. Lewin, Richard C. Morey
Venue: Proceedings of the 11th conference on Winter simulation - Volume 1 (1979)

The demand for defense systems is determined by a single buyer - the U.S. Department of Defense. In such an environment traditional competitive market mechanisms cannot be expected to operate effectively. Historically, the objective of procurement policies has been to prevent excess profits. This has resulted in bilateral contractual arrangements based on cost reimbursement, with low profits for the contractor and with the government bearing most of the risks. However, studies which have investigated incentive contracts conclude that their effectiveness in achieving DOD costs and performance objectives cannot be generalized. This paper describes the development of decision process simulation models describing defense contractor motivation, management and performance. The computerized models employ feedback/adaptation/search mechanisms to describe the internal decision making behavior of defense contractors at the project and corporate levels. It is expected that the simulation models will provide the basis for generating and testing various hypothetical incentive schemes.
Generalized selection and ranking (Preliminary Version)
Authors: Greg N. Frederickson, Donald B. Johnson
Venue: Proceedings of the twelfth annual ACM symposium on Theory of computing (1980)

Selection in a set requires time linear in the size of the set when there are no a priori constraints on the total orders possible for the set. Constraints often come for free, however, with sets which arise in applications. Linear time selection [Bl] can be suboptimal for such problems. We therefore generalize the well known selection problem to admit constraints on the input sets, with a view toward settling the complexity issues which arise. The generalization also applies to the other quantile problems of ranking a given element in the input set and verification of the claim that a given element has a specified rank.
Partitioning for VLSI placement problems
Authors: A. M. Patel, L. C. Cote
Venue: Proceedings of the 18th Design Automation Conference (1981)

Two partition/interchange processes are described for solving VLSI placement problems. Explicit partitioning is used in both methods to decompose the initial large graph into several smaller graphs for initial placement and subsequent interchange optimization. Comparative runs were made between the two processes and against the interchange process without partitioning on problems involving a few hundred elements. The comparative results clearly establish the effectiveness of partitioning in enhancing the performance of interchange processes and constraining computation time growth. While the two methods described herein were developed for VLSI placement problems, they are applicable to quadratic assignment problems arising from numerous other settings.
Second order methods for the solution of stiff ordinary differential equations
Authors: R. L. Brown
Venue: Proceedings of the ACM annual conference (1973)

Stiff system y1 &rquil; f(y, t) exist for which conventional numerical methods are inadequate because of the servere step size restriction imposed by the requirement of numerical stability. Implicit methods exist which are A-stable, A(agr;)-stable, or stiffly stable, any one of whish is sufficient for numerical stability in the integration of stiff equations. Gear1 developed a method using stiffly stable formulae of maximum order 6; a Newton's iteration with the Jacobian matrix [equation] is used to get convergence of the method. Enright2 uses [equation] to interpolate through y'(tn, yy)&rquot;(tn) and the k previous derivatives y' (tn-k) to obtain A(&agr;)-stable formulae of maximum order 9. Formulae based on interpolation through y' (tn), y"(tn) and y (tn-k) are to be better then Enright's in terms of A(&agr;)-stability.