ppxscal/embedding_network huggingface dataset:
In support of users
Authors: Roger W. Watt
Venue: Proceedings of the 3rd annual ACM SIGUCCS conference on User services (1975)

SHARE Inc. is an IBM users' group; it is a non-profit international organization whose members are organizations which make use of large-scale IBM computing systems. Today, in its 20th year, SHARE's members number almost 1300 installations spread over six continents. Computing personnel from these member installations meet at two major and two interim SHARE conferences each year. The participants at these conferences (called SHAREs) discuss common problems, exchange ideas and solutions to problems, and attempt to influence the directions IBM takes in its technological and business decisions. The two major SHARE conferences each year are attended by several thousand people from the member installations. The computing interests of these individuals and the installations they represent encompass the entire spectrum of the computing environment. SHARE offers its members a forum in which to pursue and expand personal, professional, and installation objectives through interaction with others. Its stated purpose is to foster the research, development, exchange, and public dissemination of information and techniques pertinent to computing technology, in the best scientific tradition.
Iterative computer simulation as an aid to systems design and cost effectiveness analysis
Authors: Jerry L. Hooley
Venue: Proceedings of the second conference on Applications of simulations (1968)

Traditionally, in the design of a major system, product, or procedure, various cost effectiveness analysis techniques have been employed in order to choose the best from a set of alternative configurations. In choosing the best design, it is first necessary to divide the set of alternatives into acceptable and unacceptable members. Here we present those alternatives making up the set of acceptable alternatives which forms a boundary below and to the right of which no unacceptable alternative may be found. Consideration of a great number of alternatives finds more points included in this acceptable set and thereby the boundary smooths into a curve, possibly of the type shown. A variety of computer simulation languages have been utilized by many types of firms. One of the most successful of these languages is the General Purpose Simulation System (GPSS) initially developed by International Business Machines Corporation. It has generally been the case, as is borne out by those who have written of their use of GPSS, that the application of this language facilitates the understanding of major systems to be simulated and the quickness with which the simulation's user can construct, validate, operate, and gain the required results from his model. Proceeding on this basis, that the user of a simulation technique should be acutely critical of its contribution to understandability and response as well as its accuracy, the extended use of simulation as discussed in the following pages will be presented in relation to the GPSS language.
A knowledge base for supporting an intelligent program editor
Authors: Daniel G. Shapiro, Jeffrey S. Dean, Brian P. McCune
Venue: Proceedings of the 7th international conference on Software engineering (1984)

This paper presents work in progress towards a program development and maintenance aid called the Intelligent Program Editor (IPE), which applies artificial intelligence techniques to the task of manipulating and analyzing programs. The IPE is a knowledge based tool: it gains its power by explicitly representing textual, syntactic, and many of the semantic (meaning related) and pragmatic (application oriented) structures in programs. To demonstrate this approach, we implement a subset of this knowledge base, and a search mechanism called the Program Reference Language (PRL), which is able to locate portions of programs based on a description provided by a user. This research was supported by the Air Force Office of Scientific Research under contract F49620-81-C-0067, the Office of Naval Research under contract N00014-82-C-0119, and Rome Air Development Center under contract F30602-80-C-0176.
New layouts for the shuffle-exchange graph(Extended Abstract)
Authors: Daniel Kleitman, Frank Thomson Leighton, Margaret Lepley, Gary L. Miller
Venue: Proceedings of the thirteenth annual ACM symposium on Theory of computing (1981)

In this extended abstract, we present several new layouts for the shuffle-exchange graph, including one which requires only 0(n2/log2n) area. The optimal layout is described and analyzed in section 3. The analysis is heavily dependent on several combinatorial results which we state in section 2 and prove in the appendix. The other layouts are described in section 4. Although these layouts are not asymptotically optimal (most require 0(n2/log3/2n) area), the theory behind their development is interesting and may eventually lead to good practical layouts as well as other asymptotically optimal layouts.
A representation for the analysis of microprogram operation
Authors: Richard L. Kleir
Venue: Conference record of the 7th annual workshop on Microprogramming (1974)

Architectural advances and cost reductions in computer hardware have accelerated the demand for user support on the microprogram level. To service these demands, several approaches have been forwarded including the compilation from high level languages to microprogram object code [1,2,3]. Based upon the historical development of compilers, we can anticipate that microprogram compilers will eventually require object text optimization [4]. Microprograms operate some what differently from traditional assembly language programs. The microprogram language inherits many properties from the hardware architecture. A diversity of code formats has developed among available equipment. These properties have worked in opposition to unifying techniques for improving microprograms.
What to do when the seat of your pants wears out&mdash;the formalization of the VLSI design process
Authors: Ed Burdick
Venue: Proceedings of the 18th Design Automation Conference (1981)

While individual design tools are getting better and better, comprehensive design automation system progress is hampered by the fact that engineers have been slow in formalizing the design process. If CAD designers are to build optimal comprehensive design automation systems, those of us who are to use those systems must rigorously define what our design process is.
Active data structures
Authors: Gregory R. Andrews, David P. Dobkin
Venue: Proceedings of the 5th international conference on Software engineering (1981)

Data structures have traditionally been regarded as passive software objects implemented by procedures and as having only one view, i.e., only a single set of access functions for manipulation. The advent of microprocessor technology suggests that we rethink our previous models of data structures. This leads to a different approach in which data structures are active and provide multiple views to users. Both these ideas imply that data structures will be implemented by processes. This makes it feasible to implement each data structure on its own processor. In this paper, we describe the active data structures/multiple views model and provide two examples of its utility: a file directory system and a graphics application.
Computer education for pre-college teachers (Panel Session)
Venue: Proceedings of the ACM 1980 annual conference (1980)

Over the past few years we educators in computer science have become increasingly aware of the need for computer science education of pre-college teachers. The ES3 committee is working on an organized approach to this need; however, as more and more high and elementary schools offer instruction in computer programming and related CS subjects, an immediate ad hoc approach is frequently necessary. Each of the members of this panel has had direct experience with teaching computer science to pre-college teachers. They will share some of these experiences with us and in so doing answer some questions and raise others for those faced with implementing programs for pre-college educators.
Graph Cut: Application to Bayesian Emission Tomography Reconstruction
Authors: Martin Bonneville, Jean Meunier, Sébastien Roy
Venue: Proceedings of the 10th International Conference on Image Analysis and Processing (1999)

We present an application of graph cuts to Bayesian emission tomography (ET) reconstruction. The method is built on the expectation-maximization (EM) maximum a posteriori (MAP) reconstruction. In general, MAP estimates are hard to assess. For instance, methods such as simulated annealing cannot be employed, because of the computational complexity of bayesian ET reconstruction.We propose to perform a part of the M-step by a maximum-flow computation in a particular flow graph. Because the possible priors (in a maximum-flow approach) are limited to linear function, we have incorporated the estimation of a line process that will preserve discontinuities in the reconstruction. It is the iterative nature of EM that allows the introduction of the line process. The method is illustrated first over synthetic data and then over the Hoffman brain.
Compilers for student jobs
Authors: Saul Rosen
Venue: Proceedings of the 1964 19th ACM national conference (1964)

Many University Computer Centers devote a good deal of computer time and a great deal of effort to processing -and-ldquo;student jobs.-and-rdquo; These are programs written by relative beginners in the computer field. Large numbers of students may be attempting to compile and run the same fairly simple programs. Many of the runs never get into execution as a result of source-language errors. There is rarely anything that can be characterized as a production run. The completion of the debugging phase marks the successful completion of the problem. A programming system that is adequate to handle a typical Job mix in an industrial installation may prove to be extremely inefficient when handling hundreds or even thousands of student Jobs per day.
CRITIC - an integrated circuit design rule checking program
Authors: Lawrence M. Rosenberg, Carole Benbassat
Venue: Proceedings of the 11th Design Automation Workshop (1974)

CRITIC is a production proven design rule checking program which can perform minimum width, minimum clearance, minimum enclosure and other geometrical relationship tests for artwork figures on one mask level or between different mask levels.
An implementation of the ACM/SIGGRAPH proposed graphics standard in a multisystem environment
Authors: Richard G. Kellner, Theodore N. Reed, Ann V. Solem
Venue: Proceedings of the 5th annual conference on Computer graphics and interactive techniques (1978)

Los Alamos Scientific Laboratory (LASL) has implemented a graphics system designed to support one user interface for all graphics devices in all operating environments at LASL. The Common Graphics System (CGS) will support Level One of the graphics standard proposed by the ACM/SIGGRAPH Graphic Standards Planning Committee. CGS is available in six operating environments of two different word lengths and supports four types of graphics devices. It can generate a pseudodevice file that may be postprocessed and edited for a particular graphics device, or it can generate device-specific graphics output directly. Program overlaying and dynamic buffer sharing are also supported. CGS is structured to isolate operating system dependencies and graphics device dependencies. It is written in the RATFOR (RATional FORtran) language, which supports control flow statements and macro expansion. CGS is maintained as a single source program from which each version can be extracted automatically.
A functional instruction mix and some related topics
Authors: James H. Hughes
Venue: Proceedings of the 1976 ACM SIGMETRICS conference on Computer performance modeling measurement and evaluation (1976)

In recent years the use of instruction mixes to define measures of relative computational power has diminished. This paper will describe how a systemic functional mix of much greater power and complexity than the traditional Gibson Mix was derived, then employed effectively in solving problems which arise in central processor definition and design. Some extensions of the basic technique are also covered, which include decomposition into fractional mixes as well as the study of instruction doublets and triplets.
Data processing personnel career development program
Authors: L. Roy Cottrell
Venue: Proceedings of the 1979 annual conference (1979)

Data processing personnel career development implies the exercising of a specific plan within a structured environment. Career development should allow an individual to start as a programmer trainee or anywhere in the hierarchy of the group and progress to appropriate levels of responsibility, authority, and pay that are commensurate with that individual's abilities and desires. Career development is &ldquo;GOOD BUSINESS&rdquo; for the company and for the individual, as it provides for the development and optimal use of existing potential. It can provide significant contributions to productivity improvement and at the same time reduce retention problems. If a career development program is to work, it must be pragmatic. First it has to be developed and implemented within the environment of each individual company. Second, it has to have sufficient flexibility to allow for the specific career requirements of each individual. This &ldquo;tall order&rdquo; has been met with varying degrees of success. This case study is intended to provide one example of how career development can and does work for the Missouri Pacific Railroad computer professional.
On How to Describe Shapes of Devanagari Characters and Use Them for Recognition
Authors: Veena Bansal, R. M. K. Sinha
Venue: Proceedings of the Fifth International Conference on Document Analysis and Recognition (1999)

The paper presents an schema for description of shapes of Devanagari characters and its application in their recognition. It exploits certain features of the script in both reducing the search space and creating a reference with respect to which correspondence could be established, during the matching process. The description prototypes are constructed using the real-life script after segmentation so that the aberrations introduced during the inevitable process of segmentation get accounted for in the description. This has been tested on printed Devanagari text with a success of approximately 70% without any post-processing and 88% correct recognition with the help of a word dictionary.
Person-job matching in the eighties
Authors: Nambury S. Raju
Venue: Proceedings of the ACM 1980 annual conference (1980)

One of the major tasks of a personnel psychologist is to match persons with jobs. This industrial match-making is a dynamic enterprise which continuously strives for improvement in its psychometric methods, as well as its responsiveness to the needs of society at large. From a psychometric point of view, several recent methodological advances have greatly improved the science of test development and the utility of test-based selection decisions or person-job matching. One such methodological advance is latent trait theory 4_ a precise mathematical statement about the relationship between test performance and the underlying abilities or aptitudes of the individual. Although this particular mathematical theory has been known to measurement specialists for test-related problems, however, is a more recent development. Other recent methodological advances include improved procedures for assessing the validity and utility of selection decisions in a person-job matching enterprise.
PSL/PSA a computer-aided technique for structured documentation and analysis of information processing systems
Authors: Daniel Teichroew, Ernest Allen Hershey,  III
Venue: Proceedings of the 2nd international conference on Software engineering (1976)

requirements analysis PSL/PSA problem statement analysis computer-aided documentation PSL/PSA is a Computer-Aided Structured Documentation and Analysis technique that was developed for, and is being used for, analysis and documentation of requirements and preparation of functional specifications for information processing systems. The present status of requirements definition is described as the basis for describing the problem which PSL/PSA is intended to solve. The basic concepts of the Problem Statement Language are introduced and the content and use of a number of standard reports that can be produced by the Problem Statement Analyzer are briefly described. The experience to date indicates that computer aided methods can be used to aid system development during the requirements definition stage and that the main factors holding back such use are not so much related to the particular characteristics and capabilities of PSL/PSA as they are to organizational considerations involved in any change in methodology and procedure.
Health services (Session 4)
Venue: Proceedings of the 6th conference on Winter simulation (1973)

Simulation in the health services has seen increasing use. While many papers have been written, only a few have cited the monetary savings which the application of the technique has created. Two of the papers in this session fall into this latter category. The third paper considers the use of health auxiliaries to alleviate pressing health manpower problems.
Design data for Algol-60 machines
Authors: A. P. Batson, R. E. Brundage, J. P. Kearns
Venue: Proceedings of the 3rd annual symposium on Computer architecture (1976)

The performance of a high-level language machine will depend upon the characteristics of its workload. Equally, the design for such a machine should be guided by some understanding of the work which it will be called upon to perform. We present here some behavioral properties of a large Algol-60 program in terms of the requests they represent for the various processing resources of an Algol-60 machine. The data provide insight into the behavior of such machines, particularly with respect to dynamic memory requirements and the procedure activation rates associated with direct Algol-60 execution. The data can thus be of value to designers of high-level language machines in view of their implications for the performance of such systems.
A unified CAD system for electronic design
Authors: J. C. Foster
Venue: Proceedings of the 21st Design Automation Conference (1984)

We will describe a CAD system used by AT T Bell Laboratories, AT T Information Systems, and AT T Technologies, Inc. for the design and documentation of electronic packages. It is a highly integrated system designed around a single common data base. Both the system and data base have evolved over a number of years. The system is made up of two major functional subsystems; EDS - the Engineering Design System, a systems for design intent capture, validation and prototype for all packaging levels; IDS - the Interconnection Design System, a physical layout and documentation system for circuit packs and backplanes. In this paper we will take a high level view of the system, looking at the goals for the system and the consequent functional and architectural strategies, the history of its development, its overall architecture and some of the future directions its development might go in. Companion papers will discuss in more detail the functional components of the system plus some specifics of its use.
A syntax directed approach for handling natural language relations
Authors: Robert W. Lingard, David Wilczynski
Venue: Proceedings of the ACM annual conference - Volume 1 (1972)

This paper describes an algorithmic approach for handling natural language relations. The motivation for the syntax directed method is discussed as well as the formalism for it. The method for analyzing sentences is based on hand written frames and skeletons. Their combination provides the mode for interacting with the data base and the basic backtracking routine. The main algorithm is modeled after a top-down syntax analyzer and is presented as a non-deterministic algorithm. The examples presented display the versatility and flexibility of the system. A major goal was to provide for a simple method of introducing new relations and specifying their interaction with existing ones. The table driven algorithm operates on a set of syntax rules which contain the interaction specifications. These rules, based on real world observations, are part of the input stream as are the frames and skeletons.
The delay of synchronous logic nets
Authors: Herschel H. Loomis
Venue: Proceedings of the 1964 19th ACM national conference (1964)

The delay of networks of delayed-logic synchronous devices is considered in this paper. In particular, the paper is concerned with the delay of representations of Boolean functions constructed from unit delay logic devices. It is shown that the delay required for some non-zero fraction of functions represented grows linearly with the number of arguments (input sequences). It is also shown that this fraction gets extremely large as the number of arguments grows. It is demonstrated that a simple construction technique used with AND, OR, and NOT devices with unit delay can produce networks with delays that also grow linearly in delay as a function of number of arguments with the same slope.
Design automation - lessons of the past, challenges for the future
Authors: John S. Mayo
Venue: Proceedings of the 20th Design Automation Conference (1983)

During the past two decades, we have learned that design automation is increasingly the only viable way to deal with the complexity of electronic circuits. And DA will continue to thrive in the future because of ever-increasing complexity. Following the development of the transistor and the integrated circuit, electronic desings grew almost exponentially in numbers of components and interconnections. Unfortunately, so did the design effort and the potential for errors, as unwelcome effects. The automation of electronic designs attacked this complexity to save labor and improve quality. My company, Bell Labs, designs hundreds of VLSI chips each year and thousands of circuit packs. Without design automation there is no way we could dot it&mdash;not in the required time and not with the available resources. Without DA, for example, designing and debugging our 32-bit microprocessor would have been virtually impossible.
On-line interpreted batch APL
Authors: Naomi Geller Kleid, Gerald M. Weinberg
Venue: Proceedings of seventh international conference on APL (1975)

This paper discusses how a remote batch APL facility might be implemented, how it might be used, and the advantages it would give to the installation and the individual user. The facility discussed is based on an extension of the concept of 'active' workspace to include workspaces that are active but not attached to a terminal, that is, non-'interactive'. A single new command, RUN, is introduced so that the user may create active workspaces which can perform computations while leaving both the terminal and user free to carry out other work projects. When the active workspace is ready to output or when the user wishes to check on its progress or interact with its processing, an active workspace may be loaded into an interactive workspace connected to a terminal. A variety of programming techniques and applications of this facility are discussed.
A CAD system for logic design based on frames and demons
Authors: Takao Saito, Takao Uehara, Nobuaki Kawato
Venue: Proceedings of the 18th Design Automation Conference (1981)

A hierarchical logic design system based on frames and demons is proposed in this paper. Featuring a graphic editor which puts the design information into frames and a symbolic simulator which consists of demons (data-driven functions stored in frames), the system is flexible enough for a designer to easily add his own functions, such as monitoring functions of design constraints.