ppxscal/embedding_network huggingface dataset:
Computer aided design of integrated circuits
Authors: Arnold Spitalny, Wilbur S. Mann, Gabriel Hartstein
Venue: Proceedings of the SHARE design automation project (1965)

The Norden Division of United Aircraft Corporation has had an active and extensive design automation program for the past 2 1/2 years. We are trying to apply the same thought and effort to development of man-machine systems for performing our engineering work more efficiently that we normally apply to development of radars, display systems, navigation systems, and other complex electronic equipment. Emphasis throughout our design automation program has been placed on development of user-oriented systems in which computer assistance is made conveniently available to engineers in the context of their own problems. These users do not have to become programmers to learn and use the systems we develop. Since most of our business is in development of electronic equipment, a large part of our design automation effort has been directed toward improved methods for synthesis, analysis, layout, and packaging of electronic circuits. Our early start, rapid progress, and demonstrated capability attracted outside recognition and support in two important areas.
Validation of simulation models
Authors: Averill M. Law
Venue: Proceedings of the 10th conference on Winter simulation - Volume 1 (1978)

One of the most difficult problems facing a real-world simulator is that of trying to determine whether a simulation model is an accurate representation of the actual system which is being studied. In this paper we present the results of a two-phase study to develop definitive qualitative and statistical procedures which actually can be used by a simulator in his validation efforts. The objective of the first phase was to develop a state-of-the-art survey of the qualitative considerations which come into play when attempting to validate a simulation model. Information for this survey was based not only on existing papers dealing with validation, but also on conversations with notable members of the academic and industrial communities who have had firsthand experience with validation. The second phase of our study sought to develop statistical procedures which can be used for comparing the output data from a simulation model and a corresponding real-world system (if the system exists). Although the existing validation literature states that such comparisons can be made, the manner in which this comparison could be carried out has not been explicitly stated.
A heuristic teleprocessing network design technique
Authors: Harold E. Livings, Udo W. Pooch
Venue: Proceedings of the 4th symposium on Simulation of computer systems (1976)

A technique is presented for designing teleprocessing networks on the basis of weighted heuristic partitions of the network nodes. The partitions group the nodes on the basis of common internodal design characteristics related to traffic flow, geographical location, delay and reliability requirements. Weights incorporated into the partition selection process permit adaptive adjustment of the design system based on actual experience gained in designing networks.
Different missions and shared responsibility: Teaming up with Systems Programming
Authors: Lois J. Secrist
Venue: Proceedings of the 6th annual ACM SIGUCCS conference on User services (1978)

Whether we welcome the changes or not, the traditional roles of User Services and Systems Programming are being altered by the increasing maturity of our university computer centers and user communities. Also at work are changes wrought by the greater prevalence of interactive computing and fourth generation computer concepts. Systems Programming, of course, antedated User Services, the latter having evolved from largely student assistant types to more sophisticated programmers over the past eight years. So for years, Systems Programming has worn many hats out of necessity, as they had the only experienced programmers in the place. The current situation is that applications software programming is done by whatever group has the talent in the required language. This is unfortunate, as both Systems Programming and User Services need talented programmers proficient in all necessary languages, including assembler. We are caught by circumstances at the moment, and we need to work to develop a sensible division of programming support by the two groups. Let's get the right work done with existing computer center resources, and let's make certain our respective staffs get training and experience in the needed languages.
Routing, merging and sorting on parallel models of computation
Authors: A. Borodin, J. E. Hopcroft
Venue: Proceedings of the fourteenth annual ACM symposium on Theory of computing (1982)

A variety of models have been proposed for the study of synchronous parallel computation. We review these models and study further some prototype problems. We distinguish two classes of models, fixed connection networks and models based on a shared memory. Routing is the prototype problem for the networks. In particular, routing provides the basis for simulating the more powerful shared memory models. We show that a simple but important class of deterministic strategies (oblivious routing) is necessarily inefficient with respect to worst case analysis. Routing can be viewed as a special case of sorting and the existence of a deterministic O(logn) routing or sorting algorithm for an n processor fixed connection network remains open. However, if we consider the more powerful class of shared memory models, we are -&-ldquo;almost-&-rdquo; able to achieve such an efficient sort via Valiant's parallel merging algorithm. Within a spectrum of models, we show that log log n - log log r is asymptotically optimal for rn processors to merge two sorted lists of n elements.
The System for Business Automation (SBA): Programming language
Authors: Moshe M. Zloof, S. Peter de Jong
Venue: ACM SIGMOD Record (1976)

The System for Business Automation (SBA) is a system within which application experts&mdash;non-programmers&mdash;can describe and execute their applications on a computer. This paper describes the programming language part of the system. This language is a superset of Zloof's Query-by-Example. In Query-by-Example the user retains the perception of manual table manipulation by programming within two-dimensional skeleton tables displayed on the screen. In SBA the user programs within skeletons of more general business entities such as tables, forms, charts, etc. Within these displays the user programs his application as a series of Query-by-Example operations. This system can also run in a part manual, part automated manner, thus permitting fast initial use of the computer together with gradual automation of the business.
Curriculum generators: Some design problems
Authors: Walter Maner
Venue: Proceedings of the 1978 annual conference - Volume 2 (1978)

For certain problem- oriented disciplines, generative CAI techniques may facilitate automated curriculum construction. This is especially likely in formal logic since problem- solvers and theorem-provers already in existence can be readily modified to create problems of arbitrary complexity. GPS and the &ldquo;Wang algorithm&rdquo; provide cases- in- point. Although curriculum generators promise to be effective instructional delivery systems, making educationally sound use of them awaits the development of computable measures of problem complexity which have psychological reality, which reflect observed item difficulties. This poses a serious dilemma for lesson designers which will tend to be resolved in favor of computable but empirically invalid measures.
Discussion of a -and-ldquo;problem set-and-rdquo; for instruction in digital computer programming
Authors: Elliott I. Organick
Venue: Proceedings of the 1964 19th ACM national conference (1964)

Recently there has been widespread acceptance of long-known learning principles applied to the teaching of programming. One way to apply the principle of learning in small pieces or steps is to construct and use a -and-ldquo;problem set.-and-rdquo; This is a sequence of problems whose solution on the computer helps the learner to gain progressive capability in computer language, programming fundamentals and programming practice. While not attempting to provide a recipe for construction of such a problem set, this paper analyzes a set of eight problems used successfully for several years during intensive eight-week seminars for engineering professors.
SIGART(Tutorial Session)
Authors: Cordell Green, Richard Fikes
Venue: Proceedings of the 1976 annual conference (1976)

This session focuses on the continuing effort to develop automatic techniques for transforming a specification of &ldquo;what&rdquo; is to be done into a specification of &ldquo;how&rdquo; the &ldquo;what&rdquo; is to be done. One presentation deals with programming tasks, where the results of the transformation are executable computer programs. The other with tasks being carried out by people or organizations, where the results of the transformation are plans and schedules.
Visual Information from Anisotropic Transformations
Authors: Giuseppe Boccignone, Mario Ferraro, Terry Caelli
Venue: Proceedings of the 10th International Conference on Image Analysis and Processing (1999)

Loss of information in images undergoing fine-to-coarse image transformations is analyzed by using an approach based on the theory of irreversible transformations. It is shown that entropy variation along scales can be used to characterize basic, low-level information and to gauge essential perceptual components of the image. The method is extended to the case of anisotropic diffusion and an algorithm based on entropy variation is presented that extracts relevant features of the image: in particular, how to discriminate between smooth, textured and edge-type regions.
Some observations on modular design technology and the use of microprogramming
Authors: D. P. Siewiorek
Venue: Conference record of the 7th annual workshop on Microprogramming (1974)

As modules become more complex the advantages and disadvantages of modularity have become more pronounced. The cost of modularity is measured not only in added hardware but also in a loss of flexibility. Functions that are easy to implement at a submodule level may be very difficult, or even impossible, to duplicate at the modular level. We term this a loss of transparency. PMS (Processor-Memory-Switch) level modules could be available in the next four-six years. Their existence will open many significiant areas of research. It appears that the overhead for PMS modular systems will be on the order of 30%-50% but with decreasing hardware costs this will be tolerable. The expendable components will be processors and there will be no effort to obtain a high utilization factor for the individual processors in a system. An 80%-90% idle time may be acceptable. The high sales volume required by the semiconductor industry suggests that, in the foreseeable future, PMS level components will be oriented towards mass market applications like personal calculators and intelligent terminals. It is interesting to note that as the cost per digital function has decreased the design time and cost per system has remained relatively constant. So instead of obtaining a cheaper system with the same functions a user gets a more complex system at the same cost. This is best exemplified by observing the evolution of minicomputers and noting that the cost per system of a 1965 vintage minicomputer (e.g., PDP-8) is about as costly as a ]974 minicomputer (e.g., the PDP-]I)*. Finally, microprogrammed modules are an attractive control element for PMS level modules from both an economic and a transparency point of view.
Crisis in computer science education at the precollege level
Authors: Larry W. Cornwell
Venue: Proceedings of the thirteenth SIGCSE technical symposium on Computer science education (1982)

This paper attempts to focus attention on the problem of providing meaningful and effective educational programs for precollege teachers. Computer science departments caught in their own staffing problems have not given much attention to precollege teacher training in computer science. Elementary and secondary schools are experiencing very little turnover in staff. Even when these schools have an open position, individuals entering the teaching field have little or no training in computer science. Yet the need for precollege teachers with a computer science background exists and is growing larger each year. This paper addresses this crisis in computer science education at the precollege level and proposes an approach which can be implemented easily and effectively.
Analysis of design alternatives for a packet switched I/O system
Authors: Richard A. Upton, Satish K. Tripathi
Venue: Proceedings of the 1980 international symposium on Computer performance modelling, measurement and evaluation (1980)

This paper describes an application of analytical modeling to the design and evaluation of a general purpose, packet-switched image processing system that will soon enter an implementation phase. A bottom-up modeling approach is used to evaluate such design issues as optimal packet size, optimal channel access method(s), and required number of processors and disks. Based on the characteristics of various hardware components and the predicted workload, specific design recommendations are made.
An analytic technique for router comparison
Authors: David C. Wilson, Robert J. Smith,  II
Venue: Proceedings of the 13th Design Automation Conference (1976)

Design automation of electronic systems is generally separated into a number of distinct areas of effort. Breuer [1] has divided design automation into the areas of logic synthesis, gate simulation, partitioning, placement, routing, and fault detection and diagnosis. While this separation may not be complete or entirely accurate, these functions generally must be performed.
A proposed course on data processing economics
Authors: M. Phister,  Jr.
Venue: Proceedings of the ACM SIGCSE-SIGCUE technical symposium on Computer science and education (1976)

Universities are often criticized for being too academic&mdash;too far removed from society's real problems. One reason for this remoteness is the academic preoccupation with analysis, despite the fact that the solution to many practical problems requires synthesis or invention. Another reason&mdash;and this is the one I want to discuss&mdash;is that faculties in science and engineering by and large are interested in the science of technology, and devote little or no time to teaching the economics of technology. The problem is a general one and I believe it deserves attention by all scientific and engineering faculties of the university (?). It is particularly important in the computer field, where growth and change are the norm, and where we all must be careful, in making decisions, to take into account trends and directions in the economics of data processing. I propose a course entitled &ldquo;Data Processing Technology and Economics&rdquo; as a solution to the problems described above, and in this paper I will describe the course, which is based on a textbook I have been preparing for the past several years. The course has been taught twice: at Harvard University in the Fall Semester 1974-1975; and at the University of Sydney, in Australia, in the Michaelmas Term, ]975. However, before describing the course in detail, I would like to explain, with the help of some examples, why I believe this subject is important to the student of Computer Science.
Sorting - a new/old problem
Authors: Howard J. Smith,  Jr.
Venue: ACM SIGAPL APL Quote Quad (1979)

With text processing growing in importance as a computer application, the problems of sorting and merging will be encountered with increasing frequency. Various techniques have been used in ordering alphabetic strings, but text processing, involving upper- and lower-case alphabets, introduces an extra degree of freedom and complexity to the problem. This paper will present APL models of a solution for the generalized sorting problem.
Microprogrammed implementation of a scheduler
Authors: R. Chattergy
Venue: Proceedings of the 9th annual workshop on Microprogramming (1976)

Application of microprogramming to enhance the performance of operating systems has been discussed in the literature in the past [7,1,5]. Two examples of such applications can be found in [4,6]. This paper discusses the philosophy behind the microprogrammed implementation of a scheduler, used in a large, time-shared computer incorporating several processors.
Man-machine interaction: Machine-aided design of context-free grammars
Authors: T. G. Evans
Venue: Proceedings of the 1965 20th national conference (1965)

A RECENT TREND of great potential importance is the increased on-line use of digital computers to permit a close coupling of user and machine in solving a wide variety of problems. Program debugging, theorem proving, mechanical design, architectural design, and mathematical manipulation are among the areas in which the use of such on-line techniques has already been attempted. With the spread of large-scale time-sharing systems, which are intended to make extensive usage of this type economically feasible, this approach will unquestionably be extended to many other areas. In this paper we shall not be concerned with such questions as the relative merits of various formal models of syntax. Rather, taking the extensive use of context-free grammars as evidence of their presently-established utility to at least some class of users, our purpose is to describe a program which permits the convenient on-line use of a digital computer as an aid in the modification and testing of such grammars. Both the structure and the use of the program are described in detail in the following sections.
Dictionary machines with a small number of processors
Authors: Allan L. Fisher
Venue: Proceedings of the 11th annual international symposium on Computer architecture (1984)

A number of tree-structured multiprocessor designs have been proposed for performing a group of dictionary operations (INSERT, DELETE, EXTRACTMIN, NEAR, etc.) on a set of keys. These designs typically use one processor for each key stored and operate with constant throughput, assuming unit time to communicate and compare keys. This assumption breaks down in applications with long keys. This paper describes a machine which uses a number of processors proportional to the maximum length of a key to achieve constant throughput, regardless of key length. This design has important practical advantages over the family of tree-structured machines, and demonstrates that processor-intensive VLSI structures are not always the best route to a high-performance system.
A shortest-path algorithm with expected time O(n2 log n log* n)
Authors: Peter Bloniarz
Venue: Proceedings of the twelfth annual ACM symposium on Theory of computing (1980)

We present an algorithm which finds the shortest distance between all pairs of points in a non-negatively weighted directed graph in the average time stated in the title. This algorithm, an extension of Spira's solution [Sp], executes in the stated time over quite general classes of probability distributions on graphs.
GPSS simulation for airport capacity and facilities expansion analysis
Authors: Charles A. Willis
Venue: Proceedings of the third conference on Applications of simulation (1969)

GPSS simulation of a major air carrier airport to provide an analysis of capacity of the runway and taxiway system and determination of delays encountered at peak levels of traffic activity. Alternate airport expansion schemes were developed and examined through the simulation technique and a concept for expanding operational capacity was selected. All essential elements and functions of the airport were contained in the model.
A Fortran language anticipation and prompting system
Authors: John H. Pinc, Earl J. Schweppe
Venue: Proceedings of the ACM annual conference (1973)

An experimental interactive system has been developed on an intelligent terminal which accepts only syntactically correct Fortran statements and otherwise assists the user in preparing Fortran programs. Whenever possible the system anticipates the syntax of statements which is implied by an initial input and supplies the general form of the statement directly beneath the line on which input is being accepted. In some cases (the function heading) decisions are inverted from the language and in others (statement numbers) inputs are automatically positioned. In general, only syntax within the statements is checked, but some global checking (multiple main programs) is performed. Alternate forms of statements are often displayed with the unwanted ones being eliminated as entries are made. The techniques used demonstrate pedagogic as well as productive potential.
A simulation language to facilitate the understanding of risk with an illustration from capital budgeting
Authors: R. V. Oakford, Arturo Salazar, R. S. Skertchly
Venue: Proceedings of the 12th conference on Winter simulation (1980)

Most risk analysis models use a measure of dispersion as a surrogate of risk. This paper presents an alternative method of risk analysis which uses a formalized dictionary definition of risk: the probability of occurrence of an undesirable event. The context of the Capital Budgeting Decision Process is used to discuss fundamental weaknesses of classical risk analysis, the limitations of probability theory to treat risk (properly) as probability of occurrence and the use of Monte Carlo Analysis in risk evaluation. In particular, the objective of maximizing future wealth of the firm, subject to an acceptable risk of ruin is discussed in detail. A description of the Capital Budgeting Decision Situation is included, since, judging from the existing literature, its true nature is not well understood. The development of a simulation language to facilitate risk evaluation is proposed; it should impose no more structure on the user than would the editorial requirements of a good journal. The use of the current version of the proposed language is illustrated with a hypothetical numeric example and a brief discussion of the results obtained is presented.
The impact of electronics on humans and their work environment
Authors: Panayotis Eric DeVaris
Venue: Proceedings of the 1982 conference on Human factors in computing systems (1982)

The American industry experiences today the &ldquo;Information Revolution&rdquo;, a phenomenon which affects greatly the development of modern technology, and which follows a universal movement toward great scientific innovation and a tremendous increase in information processing needs. The backbone of this &ldquo;Information Revolution&rdquo; is the computer. As a result we find that the computer, so far restricted in the backstage of a secluded computer room, expands rapidly onto every work-station in the plant and the office environment. This expansion presents a serious concern to many sociologists, psychologists, environmentalists, computer scientists, designers, architects and industrial engineers. Our concern emanates from the possible effects that this new intruder to the work environment will have on its human operators. An inkling of these effects is presented to us today when we visit a data center: wide open areas with huge display tubes planted like in a grove, is the first thing we see; behind them are the people working with them. They are slouching in front of a keyboard which is located on a standard height desk, and they are staring at a display tube through the hazy reflections of the ceiling lights and their own face. They are hiding from each other with the help of three-foot high piles of computer printouts located on their desk, on a chair, on the floor, in the waste paper basket. They are talking to the terminal, sometimes lovingly, sometimes cursingly. They are talking to each other with a confusing jargon. It is here where we can see that the side effects of this computer invasion have already created some problems with the interaction between the human and the computer.