ppxscal/embedding_network huggingface dataset:
Computation of power supply nets in VLSI layout
Authors: H-J. Rothermel, D. A. Mlynski
Venue: Proceedings of the 18th Design Automation Conference (1981)

For a given placement of macrocells with given power consumption a full automatic layout of power supply and ground nets has been developped. The varying width in different segments of these nets is calculated from local current values resulting in rectangles presenting the net segments. These rectangles are embedded in the routing plane with regard to given design rules.
Applying cognitive psychology to computer systems: A graduate seminar in psychology
Authors: Thomas P. Moran, Stuart K. Card
Venue: Proceedings of the 1982 conference on Human factors in computing systems (1982)

This paper describes a graduate seminar given by the authors at Stanford University in the Department of Psychology in the Spring of 1980. Although the seminar was also listed as a Computer Science course and was attended by students and faculty from Computer Science and other departments, the course was addressed to Ph.D. students in cognitive psychology. The seminar assumed that the students were familiar with modern cognitive psychology, but did not assume that they necessarily had much experience with interactive computing.
Impertinent Question-Answering Systems: justification and theory
Authors: Laurent Siklóssy
Venue: Proceedings of the 1978 annual conference (1978)

A Question-Answering System (QAS) is impertinent if it tells a user something the user did not ask! Since a user rarely understands the full implications of a data base, especially a large one, his question is limited by his knowledge of the data base. Sometimes, a question similar to the one he originally asked could better satisfy his goals, but he did not ask it because he had no reason to do so. Hence, impertinence is a necessary feature of sophisticated QAS. We describe a complete theory for impertinent QAS. The QAS is impertinent when, and only when, a small change in the question results in a large positive change in the answer, i.e., in the presence of a discontinuity. (The metrics are user dependent.) In impertinent QAS, the user's: &ldquo;Why didn't you tell me?" answered by &ldquo;BUT YOU DIDN'T ASK!," no longer occur. The theory has been implemented in a sophisticated airline tariff system.
No. 1A ESS Laboratory Support System - erasable flag facility
Authors: Donald V. Buyansky, James W. Schatz
Venue: Proceedings of the 6th international conference on Software engineering (1982)

A Laboratory Support System (LSS) is provided in all No. 1A Electronic Switching System (ESS) test laboratories to support the ESS software development process. The LSS tools are utilized by the developers to accomplish ESS program database management, lab load administration, lab load generation, and program testing and debugging in the laboratory environment. This document describes one of the LSS testing and debugging tools: the No. 1A ESS Laboratory Erasable Flag System. This facility is a test coverage analyzer which monitors how well an executed test procedure has exercised, or covered, specified instruction and data words resident in No. 1A ESS memory. Erasable flag output data makes it possible to enhance test procedures to achieve a more comprehensive level of software checkout during feature development and system integration of ESS code.
MIDL - a microinstruction description language
Authors: Marleen Sint
Venue: Proceedings of the 14th annual workshop on Microprogramming (1981)

A microinstruction description language called MIDL is introduced. A MIDL description of a microarchitecture defines the semantics and triggering conditions of all microoperations. It also defines operand selection. MIDL incorporates a timing model that allows detailed specification of the timing of each microoperation, and a sequencing model that allows the description of many different sequencing schemes.
On some deterministic space complexity problems
Authors: Hong Jia-wei
Venue: Proceedings of the twelfth annual ACM symposium on Theory of computing (1980)

In this paper we give a complete problem in DSPACE(n). The problem is whether there exists a cycle in the connected component containing (o,o,...,o) in the graph Gp of the zeroes of a polynomial P over GF(2) under a suitable natural coding. Hence the deterministic space complexity of this problem is O(n) but not o(n). We give as well several problems for which we can obtain very close upper and lower deterministic space bounds. For example, the deterministic space complexity to determine whether there exists a cycle in the graph of the set of assignments satisfying a Boolean formula is O(n/log n) but not o(n/log2n).
ABACUS/X an incremental compiler for minicomputer use
Authors: David L. Fulton, Richard T. Thomas
Venue: Proceedings of the ACM SIGMINI/SIGPLAN interface meeting on Programming systems in the small processor environment (1976)

This paper describes an incremental compiler which has been developed for use on minicomputers. The language which it accepts, ABACUS/X, is described, as is overall system operation. The internal workings of the compiler are discussed, along with the methods developed to minimize the memory space problems inherent in the use of incremental compilers. Speed and space comparisons are included for some benchmark programs.
Curve-fitting with piecewise parametric cubics
Authors: Michael Plass, Maureen Stone
Venue: ACM SIGGRAPH Computer Graphics (1983)

Parametric piecewise-cubic functions are used throughout the computer graphics industry to represent curved shapes. For many applications, it would be useful to be able to reliably derive this representation from a closely spaced set of points that approximate the desired curve, such as the input from a digitizing tablet or a scanner. This paper presents a solution to the problem of automatically generating efficient piecewise parametric cubic polynomial approximations to shapes from sampled data. We have developed an algorithm that takes a set of sample points, plus optional endpoint and tangent vector specifications, and iteratively derives a single parametric cubic polynomial that lies close to the data points as defined by an error metric based on least-squares. Combining this algorithm with dynamic programming techniques to determine the knot placement gives good results over a range of shapes and applications.
Joint cost allocation - a simulation approach
Authors: Morcos F. Massoud, Ralph T. Hocking
Venue: Proceedings of the 9th conference on Winter simulation - Volume 2 (1977)

Joint products are produced together because the production process is essentially the separation of natural raw materials into component elements: for example, the conversion of coal into gas and coke, and milk into cream and skim milk. Sometimes join products are produced together as a result of the technology adopted in a particular production process, as with electricity and water for irrigation from a hydroelectric dam. The essential characteristic of all the preceding examples is that neither product of each pair could be produced independently of the other once the technological setup has been decided. Often the relative proportions of joint products emerging from a production process can be varied to some extent by changing the quality of input materials or the extent of processing. Such products are said to be joint products in variable property The accumulation of cost data in joint product situations can provide useful information for analysis of overall cost and revenue changes arising from variations in input quality and processing effort.
Approaches to based storage in PL/I
Authors: Moshe Augenstein, Aaron Tenenbaum
Venue: Proceedings of the seventh SIGCSE technical symposium on Computer science education (1977)

In this paper it is shown how the topic of BASED storage in PL/I can be used to illustrate a wide variety of concepts in intermediate level courses in data structures and programming languages. Because most instructors introduce the topic only from the point of view of a linked list, the true meaning of BASED storage and POINTERs is lost in the maze of practical problems which these features can be used to solve. Because BASED storage allows the programmer close access to physical storage, an understanding of these features goes a long way toward clarifying the behind the scenes actions involved in implementing and using data structures in high level languages.
A course in computer structures
Authors: Jonathan Allen
Venue: Proceedings of the 3rd annual symposium on Computer architecture (1976)

In this subject, we treat computer structure as an element of a group of interacting structures including the technology, algorithm, data, and programming language. In the belief that the best designs result when these structural factors &ldquo;match&rdquo; in a complementary manner, the influence of each of these domains is carefully studied at both the conceptual and descriptive levels. Thus a modular treatment of current technology is provided, as well as a thorough analysis of algorithmic structure as reflected in computational schemata. Single-sequence machine design is discussed, including advanced topics such as multiple functional unit conflict resolution. Following a presentation of microprogramming and input/output, virtual ideas centered around the notion of process are introduced, leading to the design of multiprocessing and multiprocessor systems. These ideas are applied and extended in the presentation of the Burroughs B6700 as a higher-level language machine designed to execute ALGOL efficiently. Finally, the subject concludes with an introduction to general interpretive structures for high-level languages.
On-line interactive graphics the designer's dream or the production manager's nightmare
Authors: S. H. Zelinger
Venue: Proceedings of the 9th Design Automation Workshop (1972)

This paper discusses computer automation, computer-aided design, and computer-aided production as applied to creating artwork from electronic design. The purpose is to establish distinctions among the three automated techniques and the equipment necessary to implement them. The conclusion is a recommended approach to justifying the cost and characteristics of the equipment. A simple design is followed through its artwork stages as is done without computer aids, then as done with various computer aids. Finally, a technique for selecting and cost justifying the optimum computer-aided system is presented. Throughout the paper, terms are defined. These definitions are not necessarily industry standards but are given for clarity while in context. It is the intent that one should be able to determine whether he has purchased or is in the process of purchasing an expensive toy or an extremely valuable tool that will make his operation less costly, more productive and hence more profitable. If this determination is made, the concept of computer-aided design will have been looked upon in its proper perspective and never again confused with the concept of computer-aided production!
A planning model to forecast market demand for two lines of durable products
Authors: S. H. Manning
Venue: Proceedings of the 13th conference on Winter simulation - Volume 2 (1981)

This paper describes a planning model which forecasts annual domestic market demand by end use for a Westinghouse division manufacturing two lines of durable goods. This model takes an unusual approach in solving the problems that arise in analyzing any mature market: it combines traditional econometric techniques with a structured theory of the market. The structured approach was used where data such as saturation or replacement rates was available. The adequacy of the structured portions was determined by historical industry data and the division's marketing experience. Where appropriate inputs for the structured model could not be found, traditional econometric techniques were employed. This combination of approaches allows the model to reflect the overall market structure, market maturity, economic influences, and division insights. A computer program has been written to allow periodic updates and easy simulation of alternative economic scenarios for planning purposes.
Color graphics for remote teaching
Authors: William Hankley, Virgil Wallentine
Venue: ACM SIGGRAPH Computer Graphics (1980)

A system for preparation and manipulation of color graphics video frames is described. The system commands are designed for use by a class instructor (who is not a computer science person) in preparation and delivery of lectures to a remote site. The system can provide the types of images, overlays, and coloring that could be drawn using transparency sheets and color pens, or that could prepared as 35 mm technical slides (not photographs, but text and diagrams). The hardware consists of standardly available input, display, and output components. Several hardware alternatives are noted so that cost and capability tradeoffs can be compared. Communication between the instructor's site and the remote class site uses standard telephone lines for transmission of participants' voices and for digital graphics commands and compressed image data. The system software is yet in experimental form. It is in BASIC, but in modular form. While none of the individual components or graphics concepts in this system is in itself dramatically new, the integrated system demonstrates an important advancement in state-of-the-art for remote instruction.
The future of optical fibers for data communications
Authors: Tingye Li
Venue: Proceedings of the fifth symposium on Data communications (1977)

Optical-fiber transmission lines appear attractive for a variety of communication applications in which twisted copper pairs and coaxial cables are now used. These applications range from on-premises data links and equipment wiring to interoffice and intercity telecommunications trunks. Experiments to explore the technical feasibility of glass fibers in these areas are presently in progress. This talk summarizes the current state of research on optical fibers, fiberguide cables and splicing techniques, reviews the state of the art of fiber-compatible sources and detectors, and discusses various systems considerations, experiments and applications.
Discussion of Jacobs paper
Authors: Jeanne C. Adams
Venue: Proceedings of the eleventh annual SIGCPS computer personnel research conference (1973)

The field of computing has grown considerably in recent years and the tasks performed on computers encompass more and more variety in scientific, industrial and business applications. The programming task itself must be defined in very broad terms if one is to cover all the activities performed in all areas where computers are used today. In his paper, Mr. Jacobs defines the programming task in very broad terms. He recognizes that current tests for personnel selection are not satisfactory and suggests that certain tests of cognitive capabilities might prove better instruments for recognizing potential programming skills. However, the predictor variables did not correlate significantly with the criterion variable, success in programming training, and his hypotheses were not supported.
The influence of software structure on reliability
Authors: D. L. Parnas
Venue: Proceedings of the international conference on Reliable software (1975)

This paper assumes software structure to be characterized by the interfaces between subsystems or modules. Reliability is considered to be a measure of the extent to which the system can be expected to deliver usable services when those services are demanded. It is argued that reliability and correctness (in the sense used in current computer literature) are not synonyms. The differences suggest techniques by which the reliability of software can be improved even while the production of correct software remains beyond our reach. In general, the techniques involve considering certain unpleasant facts of life at an early stage in the design process, the stage where the structure is determined, rather than later. An appendix gives some specific examples of questions which, if they are thoughtfully considered early in the design, can lead to more reliable systems.
Teaching Compiler Development
Authors: Bill Appelbe
Venue: Proceedings of the tenth SIGCSE technical symposium on Computer science education (1979)

Although a course in Compiler Development is common in both undergraduate and graduate computer science curriculum there has been little agreement on how to achieve a balance between theory and practice within a single semester course. This article proposes a new approach to teaching compiler development, to enable students to gain both the experience of writing a modular compiler and a theoretical background in compiler design, within the scope of a one semester course. The approach advocated is based upon the integration of the course project and the course lectures, enabling students to develop a modular compiler for a general purpose high level algorithmic language. The course project uses a simple parser generator and syntax-directed translation techniques to minimize the programming effort without oversimplifying the design of the compiler. The course was taught at Southern Methodist University to a senior undergraduate class, who developed and debugged useable compilers without the common symptom of major programming projects: programming to meet a deadline rather than a design.
Interactive graphics for enhancement of simulation systems
Authors: Daniel L. Roberts, Julia M. Hodges
Venue: Proceedings of the 13th annual symposium on Simulation (1980)

A computer simulation system was greatly enhanced by providing an interactive graphics interface. It is easy for the user to access and use. Output is in graphics form that is quick and easy to comprehend. Brief instructional messages appear, on the TEKTRONIX screen, at each phase of the simulation so that training required to use the system is almost nonexistent. The user may select any one of four simulations, interactively edit input data, and select output in graphics or tabular form. Alternatively, the user may access only the input and output of the previous simulation run. The interface can be readily adapted to other systems.
&ldquo;Extension of APL to tree-structured information&rdquo;
Authors: M. Alfonseca, M. L. Tavera
Venue: Proceedings of the eighth international conference on APL (1976)

A new outlook on the APL system management together with a new set of primitive functions are proposed to be included in the APL language to manage tree-structured information. Since the appearance of APL, this language has been prone to extension requirements, possibly due to the fact that it allows such an ease of computing and programming, that the user quickly arrives to the point where he should like to have something else to make even more complex procedures with even less programming effort. Some of such requirements have been accepted and are now operative, namely the execute and formatting functions and the scan operator. Our approach has selected the planar tree as a new APL object. Stress has been applied to the minimization of the number of primitive functions and symbols extensions needed to handle the new objects as well as the maintaining of a maximum coherence between our extensions and the standard APL operations. In addition to this, a new work space library organization is proposed in order to overcome the limitations inherent to the present limited work space size and file management.
Numerical solution of ordinary differential equations at a remote terminal
Authors: C. W. Gear
Venue: Proceedings of the 1966 21st national conference (1966)

A number of general purpose numerical systems have been developed since the advent of time-sharing consoles. Some take the form of extensions of desk calculators, others, such as MAP1 provide a functional ability in which many of the commands take the form of operators on functions. In MAP this is handled by representing the function by a set of values and interpolating where necessary. For high accuracy problems in differential equations such systems are either not convenient or not sufficiently accurate. The special purpose system described in this report attempts to be a tool for the study of the behavior of the solutions of ordinary differential equation systems. There has been some discussion in the literature, both pro and con, concerning the use of a differential equation package as a general purpose problem solving tool (see Klopfenstein2 and Kubik3). We will not enter this discussion, but just point out that such a package can be used to solve a number of additional problems, albeit inefficiently. The purpose of this report is to describe the current status and immediate plans for the system and to comment on the utility of performing tasks, such as integration, in an on-line mode.
Dollars and sense of D.P. (PANEL-2)
Authors: Herbert W. Bomzer
Venue: Proceedings of the 1975 annual conference (1975)

Data Processing offers the programmer and analyst opportunity for challenge, growth, and rewards. Whether you're currently employed in data processing or seeking to enter the field, a clearly identified career path will help you meet your personal goals. Inevitably, your career and development are dependent on your working environment, the organization, its policies, equipment, etc. In this session working conditions, management viewpoints, and pay in different operational environments will be reviewed. We will discuss what is required to get into D.P., what is expected of you on the job, what is done to help you be productive, and what financial and other rewards can be expected. Clyde Allen will discuss the large industrial shop and mid-management considerations in manpower utilization. Kathy Stanley will depict conditions encountered in a commercial environment. Ken Crawford will describe the multifaceted demands of small shops. Bob Green will tie the package together by presenting organizations as they are today and as they may appear in the future, with emphasis on careers and the associated monetary rewards. The ensuing cross discussion should provide real answers to questions affecting the &ldquo;Quality of Life&rdquo; of the D.P. enthusiast.
Structured assembly language programming
Authors: Robert N. Cook
Venue: Proceedings of the thirteenth SIGCSE technical symposium on Computer science education (1982)

For those of us who are essentially high level programmers, the intricacies and lack of structure in assembly language programs are often an insurmountable barrier to effective assembly language programming. This paper attempts to show a way to overcome this barrier. Structured pseudocode is used to solve the problem just as if the solution were to be coded in PL/I, PASCAL, ADA, or some other structured high level language. Then the structured pseudocode is &ldquo;compiled&rdquo; into assembly language using appropriate labels to show the structure of the assembly language program.
Dual-Mode Slotted TDMA Digital Bus
Authors: Norman B. Meisner, Joshua L. Segal, Malcolm Y. Tanigawa
Venue: Proceedings of the fifth symposium on Data communications (1977)

A Dual-Mode Slotted TDMA Digital Bus has been designed and a prototype system has been built. This type of bus is a hybrid design which provides optimized bandwidth usage when such a system contains a combination of users with high duty cycle and/or synchronous data and low duty cycle asynchronous data. High duty cycle and/or synchronous users are assigned dedicated slots as in MITRIX. Low duty cycle asynchronous users are assigned a common set of contention slots as in slotted ALOHA. To assure both good response time and system stability, an algorithm was developed to compute an adaptive mean retransmission delay for the ALOHA slots. This paper discusses the theory behind the Dual-Mode Slotted TDMA Bus and provides supporting data determined by simulation.