ppxscal/embedding_network huggingface dataset:
A proposed academic program in the computer sciences
Authors: Earl J. Schweppe
Venue: Proceedings of the 1964 19th ACM national conference (1964)

Considerable work in the Computer Science Center at the University of Maryland has been devoted to the creation of an academic program in the computer sciences. Those involved have been W. C. Rheinboldt, J. P. Menard, R. H. Austing, J. M. Ortega, G. E. Lindamood and the author. Numerous other people, both at Maryland and elsewhere, have contributed to this work, but the frequent assistance of H. E. Tompkins and A. B. Marcovitz of the Electrical Engineering Department has been especially helpful. The program is now under consideration for adoption at the University and will hopefully be underway by the Fall of 1965. This program would begin with the offering of a number of new courses and expand toward the establishment of a master of science degree, a baccalaureate degree and then a doctoral program as rapidly as staff and other necessary conditions could be developed. In addition to degree programs in the computer sciences, the development of supporting courses for other programs is very important and this program has been designed to satisfy much of this need.
The N.2 System
Authors: Greg M. Ordy, Charles W. Rose
Venue: Proceedings of the 20th Design Automation Conference (1983)

The N.2 System is described. N.2 is a simulation based design environment which is built upon the N.mPc System1. Major enhancements are presented, as well as a system overview. Areas covered include a hierarchical description facility, expanded port interconnection primitives, fault insertion/detection, a PLA description language, and increased use of graphics.
Computer Modules: An architecture for large digital modules
Authors: S. H. Fuller, D. P. Siewiorek, R. J. Swan
Venue: Proceedings of the 1st annual symposium on Computer architecture (1973)

This paper describes the architecture of Computer Modules, or CMs. They are large digital modules of about minicomputer complexity that are specifically designed to take advantage of the rapidly advancing semiconductor technology. These modules are intended to be interconnected into systems that implement a wide range of computational structures. The main features of a CM include a small processor as the primary control element and memory distributed among the CMs in the system rather than centralized into memory modules as in current multiprocessors. CMs are interconnected into a network via buses that each have their own virtual address space to facilitate efficient inter-module memory sharing. This paper includes an ISP description of the address translation mechanisms as well as a discussion of several important implementation issues such as the avoidance of deadlocks in CM networks and the width of the inter-CM buses.
A study of rolling-mill productivity utilizing a statistically designed simulation experiment
Authors: G. F. Koons, B. Perlic
Venue: Proceedings of the 9th conference on Winter simulation - Volume 2 (1977)

A statistically designed experiment was conducted to quantitatively describe the effects of operating conditions on rolling-mill performance. Instead of observing the actual performance of the facility, a Monte Carlo model was developed and used to simulate the operation of the mill under all the treatment combinations required to complete the experimental design. The empirical equations that resulted from the analysis of the simulated responses have proved useful in aiding mill scheduling, locating bottlenecks, determining economical operating strategies, and evaluating the potential of proposed operating changes.
Microprocessor implementation of a parallel processor
Authors: Gary J. Nutt
Venue: Proceedings of the 4th annual symposium on Computer architecture (1977)

A wide variety of uses have been proposed for the spectrum of currently available microprocessor systems. Included in this set of applications is the use of microprocessors for implementing larger systems; here, the possibility of employing bit slice microprocessors for various parts of a multiple control unit SIMD processor is discussed. A brief summary of bit slice microprocessor architecture is given, followed by an outline of individual applications to various components such as control units and arithmetic/logic units of the SIMD processor.
Invited papers: Toward better programming languages
Authors: V. H. Yngve
Venue: Proceedings of the 1962 ACM national conference on Digest of technical papers (1962)

THE STYLE of a programming language often has a great influence on the approach that a programmer takes to a particular problem. This is the Whorf hypothesis applied to programming languages. Most programming languages are general purpose in that anything that is programmable can be programmed in them. But to the extent that they differ, some programs are more easily expressed in one language than in another. We do not consider here the important considerations of the efficient use of computer memory and running time, since these are more related to the particular machine and compiler configuration used than to the structure of the programming language itself. We are more interested in factors of programming convenience, brevity, fluency, legibility, ease of learning, ease of checkout, etc., that are of more direct concern to the programmer.
A data flow processor array system: Design and analysis
Authors: Naohisa Takahashi, Makoto Amamiya
Venue: ACM SIGARCH Computer Architecture News (1983)

This paper presents the architecture of a highly parallel processor array system which executes programs by means of a data driven control mechanism. The data driven control mechanism makes it easy to construct an MIMD (multiple instruction stream and multiple data stream) system, since it unifies inter-processor data transfer and intra-processor execution control. The design philosophy of the data flow processor array system presented in this paper is to achieve high performance by adapting a system structure to operational characteristics of application programs, and also to attain flexibility through executing instructions based on a data driven mechanism. The operational characteristics of the proposed system are analyzed using a probability model of the system behavior. Comparing the analytical results with the simulation results through an experimental hardware system, the results of the analysis clarify the principal effectiveness of the proposed system. This system can achieve high operation rates and is neither sensitive to inter-processor communication delay nor sensitive to system load imbalance.
TheSys-a comprehensive thesaurus system for intelligent document analysis and text retrieval
Authors: Chin Lu, K. H. Lee, H. Y. Chen
Venue: Proceedings of the Third International Conference on Document Analysis and Recognition (Volume 2) - Volume 2 (1995)

Well designed thesauri can represent semantic/conceptual knowledge so as to reveal relationships among different elements in documents, thus serving as a critical tool in intelligent text retrieval systems and document analysis systems. In this paper, we present a thesaurus system, referred to as TheSys, which can be used as a tool for users to build thesauri according to their own requirements. It is our goal to design a comprehensive thesaurus building tool which can be used in any field of specialty rather than targeting for a particular specialty field. People can use our system to build an electronic thesaurus in any specialty field required for a specific application. We propose a thesaurus model, referred to as the thesaurus frame, which uses weighted links, to represent semantic relationships among concepts and terms. Our approach is to use a set of controlled terms, referred to as semantemes, to build the thesaurus frame. This approach can effectively reduce the size of the thesaurus yet the intelligence of the thesaurus is not compromised.
A combined simulation model of the nuclear fuel cycle
Authors: E. L. DePorter, Harold A. Kurstedt,  Jr., Joel A. Nachlas
Venue: Proceedings of the 9th conference on Winter simulation - Volume 1 (1977)

Strategies for dealing effectively with the complex nuclear fuel cycle are needed to assure the availability of the required nuclear energy portion of U.S. energy supplies. The vertical integration approach to assuring uranium fuel supplies is achieved through control or ownership of fuel cycle stages. Global system analysis is facilitated by identifying crucial control points in the fuel cycle. A GASP IV simulation model of the production and inventories of the sequentially produced nuclear fuel is developed and includes the optional feedback loop associated with the recycle of uranium from spent fuel. The model is verified to assure accurate fuel cycle representation by comparing derived material flows to 1970-75 historical data. The model is then applied to the 1977-1994 horizon to verify the practicality of vertical integration within the fuel cycle and to determine stages in which altered production capacity is appropriate. Results of the simulation analysis using a one-at- a-time search technique using four replications indicate that production capacities throughout the fuel cycle should be increased, in some cases significantly. Additional milling capacity should be added every year and several new refining plants and reprocessing facilities will be needed to assure provision of planned nuclear generated electricity supplies.
Extending reliability (Extended Abstract>: Transformational tailoring of abstract mathematical software
Authors: James M. Boyle
Venue: Proceedings of the SIGNUM Conference on the Programming Environment for Development of Numerical Software (1978)

Over the past decade, mathematical software libraries have matured from small, usually locally-assembled, collections of subroutines to large, commercially-provided libraries which are approaching the status of standards [Aird; Du Croz; Fox]**. Despite the high quality of such libraries and the obvious economic advantages of using routines whose development cost has been shared with many other users, applications programmers, when asked: &ldquo;Why don't you use routine XYZ from IMSL, or from NAC, or from PORT?&rdquo; frequently reply that library routines are too general, that they need a routine which takes advantage of special features of their problem, and that since they could not use a library routine without modifying it, they might as well write their own routine from scratch. In many, if not most, instances, the latter assertion could be easily refuted by a simple competition on selected test problems. However, the need for a routine adapted, or tailored, to a particular problem is more difficult to dismiss. It usually arises from considerations of efficiency, which may range from the perceived inefficiency of the presence of unused options in a routine to the practical impossibility of using a routine whose data representation is utterly incompatible with that needed in the rest of the applications program.
A definition of the cobol procedure division using algol metalinguistics
Authors: Jean E. Sammet
Venue: Proceedings of the 1961 16th ACM national meeting (1961)

It has often been stated that one of the faults of COBOL is its lack of rigorous definition, particularly with regard to the PROCEDURE DIVISION. It is the purpose of the paper to refute this contention, by defining the syntax of the COBOL PROCEDURE DIVISION using the same metalinguistic formulae as those used for ALGOL. Although a knowledge of both languages is extremely desirable, it is not required, since the complete paper is self-contained (except for semantic material which is directly available in the references, and has not been reproduced as part of the paper.)
Design automation and the WRAP System
Authors: J. A. Brown, L. J. Cesa, J. J. Sawicki
Venue: Proceedings of the 5th annual Design Automation Workshop (1968)

The WRAP (Wire Routing and Packaging) System is a 7094 programming system for the automatic packaging and wiring of Aerospace computers. WRAP, originally written to assist in the packaging of IBM's System/4 Pi family of computers, has been applied to a wide range of package configurations. Use of the WRAP System has greatly reduced the time required to design and manufacture a machine. The system operates from a logic design recording system (SLDA), performs automatic packaging and wiring, and from this data produces numerical control instructions for manufacturing. Self-checking built into WRAP guarantees that the MIB (Multilayer Interconnection Board) produced is error free and corresponds exactly to the design requested by the engineer. Tasks performed by WRAP may be grouped into four main categories: Packaging, Wiring, Manufacturing Interface, and Control Services. Examples throughout this paper will be taken from IBM's System/4 Pi family of computers. System/4 Pi uses 14 pin integrated circuit modules to implement the computer's logic design.
ALPHA-a high-performance LISP machine equipped with a new stack structure and garbage collection system
Authors: Hiromu Hayashi, Akira Hattori, Haruo Akimoto
Venue: ACM SIGARCH Computer Architecture News (1983)

ALPHA is a dedicated machine designed for high-speed list processing. In this article, we describe a highly effective stack which can support a value cache and virtual stack, and high-speed garbage collection algorithm for virtual memory. These new ideas have been studied in ALPHA. ALPHA is designed as a back end processor for a large computer under TSS. ALPHA allows TSS users to do more high-speed list processing than a large computer does. Currently UTILISP is operating on ALPHA and runs several times faster than MACLISP on the DEC 2060.
Computer people and their attitudes toward computerization: A social survey of the ACM'70 Conference
Authors: Ronald E. Anderson, Kay Troost
Venue: Proceedings of the ACM annual conference (1973)

During the 1970 ACM Annual Conference, a sample of persons were interviewed as they wandered through the exhibit hall. Both computer people and others were asked how they felt about computers and databanks. Although computer people are less negative in their orientation toward computers than the general public, both groups include a suprisingly large number of persons who express negative attitudes toward computers. It appears that the gap between the computer world and the public is less than some have assumed.
Virtual machine-based simulation of distributed computing and network computing
Authors: Richard T. Wang, J. C. Browne
Venue: Proceedings of the 1981 ACM SIGMETRICS conference on Measurement and modeling of computer systems (1981)

This paper proposes the use of virtual machine architectures as a means of modeling and analyzing networks and distributed computing systems. The requirements for such modeling and analysis are explored and defined along with an illustrative study of an X.25 link-level protocol performance under normal execution conditions. The virtualizable architecture used in this work is the Data General Nova 3/D.
Hierarchical multi-granular modeling to improve software performance
Authors: Robert H. Fleming, Margaret E. Berry
Venue: Proceedings of the 15th annual symposium on Simulation (1982)

This paper discusses the problems experienced in predicting execution times while varying the workload for a large batched transaction-oriented management information system. Experiments were also performed to determine the runtime sensitivity of proposed modifications to the software architecture. The need for the predictions was based on the substantial observed differences in runtime between the first two users of the system. These differences were observed despite superficially similar workloads and identical hardware and operating systems.
On what exactly is going on when software is developed step-by-step
Authors: T. S. E. Maibaum, W. M. Turski
Venue: Proceedings of the 7th international conference on Software engineering (1984)

In this paper we present a (necessarily) informal and brief description of formal concepts which lend mathematical support to a paradigm of software development. Some important obligations which must be met by the software developers are pointed out. Correspondences between widely adhered to practices and their mathematical counterparts are identified and explained.
Software engineering: A keynote address
Authors: C. A. R. Hoare
Venue: Proceedings of the 3rd international conference on Software engineering (1978)

This paper argues that our recent progress in the development of a sound programming methodology should not lead us to ignore the more difficult aspects of engineering; and that in future we should pay more attention to the quality of our designs, and not just the accuracy of their implementation.
Interpretation of query-by-example language in bubble hardware language
Authors: Hsu Chang
Venue: Proceedings of the 1978 annual conference - Volume 2 (1978)

Query-by-Example is a high-level user language. Bubble hardware language (BHL) enables the operation of efficient data-base bubble chips. As both QBE and the bubble chips are modeled after relational data model, one would intuitively speculate their close affinity. This note proposes rules by which QBE can be interpreted in BHL.
Predicting numbers of errors using software science
Authors: Linda Ottenstein
Venue: ACM SIGMETRICS Performance Evaluation Review (1981)

An earlier paper presented a model based on software science metrics to give quantitative estimate of the number of bugs in a programming project at the time validation of the project begins. In this paper, we report the results from an attempt to expand the model to estimate the total number of bugs to expect during the total project development. This new hypothesis has been tested using the data currently available in the literature along with data from student projects. The model fits the published data reasonably well, however, the results obtained using the student data are not conclusive.
The Group Rep: Effective decentralization of applications support
Authors: Steven E. Naron
Venue: Proceedings of the 10th annual ACM SIGUCCS conference on User services (1982)

At the Center for Naval Analyses (CNA), we have succeeded in providing computation application support to all parts of this decentralized research organization by decentralizing our staff. CNA is divided into four functionally separate departments, each overseen by a Vice President and broken functionally into smaller programs or divisions. Three departments do studies of day-to-day Navy operations, long-term Navy planning, and the Marine Corps; the fourth is concerned with CNA's administration. Applications Support operates in an environment much like that of any university user services group serving users with a wide variety of needs, skills, and applications. The application consultants are call Group Representatives. The Group Reps, serving as the first line of consulting support, share office space with the study teams they support. They speed communications throughout CNA and are in a position to gain detailed knowledge about applications peculiar to their projects. They also tend to build close working relationships with their &ldquo;customers.&rdquo; Finally, Group Reps are often major participants in research for CNA's clients in the Department of the Navy and elsewhere. Research results are reported at the highest levels of government and often affect important decisions. There are four useful results of such participation in research. First, the Group Rep gains greater respect from the line organization. Second, being a &ldquo;user&rdquo; endows the Group Rep with a little more understanding and even a touch of humility. Third, the Group Rep develops experience with new tools. Finally, the Group Rep who wants a career path into the line organization is thus provided with one. The remainder of this paper covers issues that may prove useful to anyone who is considering the advantages of setting up a similarly oriented user services organization. The appendix tries to define the Group Rep position in more detail.
Application of a syntax driver to logic equation processing and data-control card scanning
Authors: J. A. Rader
Venue: Proceedings of the 5th annual Design Automation Workshop (1968)

This paper will describe the use of a syntax driver in writing a logic equation compiler (LOGCOM). By such a compiler or processor we mean a program which takes logic equations punched on cards and converts them into a tabular form which subsequently is used by other design automation programs. In the body of the paper it is assumed that the reader possesses a casual familiarity with syntax. This assumption is made mostly for organizational convenience and an appendix discussing syntax is included at the end of the paper. My terminology is summarized at the end of this appendix and the reader familiar with syntax can check there to see if his terminology and mine agree. Sample syntax applied to a specific problem is shown in figure 3 and is discussed in Section 2.
A continuous process simulation using GPSS
Authors: Robert Greer Lavery
Venue: Proceedings of the 13th conference on Winter simulation - Volume 1 (1981)

This paper describes the methodology and results of a simulation of an oil purification process used by a food processing company in Toronto, Ontario. The process involves reacting a mixture of edible oils with a caustic solution to precipitate out various free fatty acid and gum components in the oils in the form of soap solids. The process is discrete in that batches of crude oil are processed individually but the processing of each batch is done on a continuous basis. The simulation model developed for this process simulates one crude oil batch at a time. Thus the model simulates an essentially continuous operation. The success of GPSS, a discrete event simulation language, in simulating this continuous process forms the basis of this paper.
ACM doctoral dissertation award: ACM international scholastic programming contest awards
Authors: Gwen Bell
Venue: ACM SIGCSE Bulletin (1984)

Dr. Bell is director of The Computer Museum in Marlboro, Mass., a memeber of the Charles Babbage Institute Program Committee and an editorial board member for the Annals of the History of Computing. As director of The Computer Museum since 1980, she has interpreted computer history via exhibitions, programs and public speeches.
Multi-valued multi-threshold networks
Authors: Okihiko Ishizuka
Venue: Proceedings of the sixth international symposium on Multiple-valued logic (1976)

In this paper we propose multi-valued multi-threshold networks (MVTN's) to realize multi-valued logic functions. A definition, transformations of multi-valued functions and network syntheses for an MVTN are described. There are three emphases on the MVTN's: 1) any arbitrary multi-valued logic function can be realized by an MVTN, 2) an MVTN can be composed of conventional threshold elements, and 3) various synthesis procedures for binary multi-threshold networks can be applied to MVTN's.
Office information and telecommunications
Authors: Russ Shurig
Venue: Proceedings of the eighth symposium on Data communications (1983)

In order to understand the relationship of office information to office products and to telecommunications, the category of information media must be introduced. Voice, image, text and data information media can be related to one another, to computer and telecommunications technologies and to the needs of different types of workers. The purpose of business offices, however, is not usually primarily information, computing or telecommunications, but rather knowledge, products and useful work. The information categories including media, transfer, products and work can be related to one another for a better understanding of office information products and telecommunications and in order to predict their future.