ppxscal/embedding_network huggingface dataset:
A language design for vector machines
Authors: V. R. Basili, J. C. Knight
Venue: Proceedings of the conference on Programming languages and compilers for parallel and vector machines (1975)

This paper deals with a programming language under development at NASA's Langley Research Center for the CDC STAR-100. The design goals for the language are that it be basic in design and able to be extended as deemed necessary to serve the user community, capable of the expression of efficient algorithms by forcing the user to make the maximum use of the specialized hardware design, and easy to implement so that the language and compiler could be developed with a minimum of effort. The key to the language was in choosing the basic data types and data structures. Scalars, vectors, and strings are available data types in the language. Each basic data type has an associated set of operators which consist primarily of the operations provided by the hardware. The only data structure in the language is a restricted form of the array. Only vector and string data types may be stored in arrays, forcing the user to vectorize scalar data when it is necessary to structure it. This permits the most effective use of the machine for entities such as real arrays since the high level vector machine instructions may be used to deal with them directly.
The data structure set model
Authors: Charles W. Bachman
Venue: Proceedings of the 1974 ACM SIGFIDET (now SIGMOD) workshop on Data description, access and control: Data models: Data-structure-set versus relational (1975)

I think we have a discussion today; not a debate. Its real purpose is to increase our understanding of the basic concepts underlying data base structures and their models; to note the similarities and differences between them, and to determine their compatibility or the lack thereof. We are talking about concepts, not about implementations. The reason for all data base structuring is retrieval: retrieval for output, retrieval for decision-making, retrieval for updating. To pinpoint the object of retrieval we must intelligently select the &ldquo;right&rdquo; data&mdash;the correct single record, the correct group of records, and, in some sense, the correct sequence of records (in those situations where the sequence in which these records are seen is important). For accurate selection, dependent on the particular interests, needs, and requirements of a given person, we want a mechanism for readily defining records to be selected. We want a mechanism that will permit the data base to evolve as the enterprise and information systems change. We want a mechanism which will protect already existing investment in programs and report specifications, while the data base evolves. We want a mechanism which permits the reoptimization of the structure of stored data as things change.
An algorithmic pretest development for fault identification in analog networks
Authors: Vijay Masurkar
Venue: Proceedings of the 18th Design Automation Conference (1981)

This paper describes the design and development of an algorithm for fault identification in electrical analog networks. The emphasis is on mathematical formulation of the problem and generation of a viable fault identification criterion. The method serves as a pretest for a catastrophic (or considerably out-of-tolerance) fault condition. Under non-accessibility of some of the nodes, the method estimates nodal voltages to arrive at an estimated admittance matrix for the faulty Unit Under Test (UUT). The simulation of networks is done through Electronic Circuit Analysis Program (ECAP).
A contribution towards the measurement of user behavior (abstract only)
Authors: Helmut Wilke
Venue: ACM SIGSOC Bulletin (1982)

A prerequisite for the design of better systems - in terms of human interface- is knowledge of its users, their problems and behavior. Within the context of a larger project comparing several large statistical program packages, attempts have been made to attack the problem of "knowing the user'. Among traditional methods like surveys, different ways of automatic data collection have been tried and their strengths and weaknesses can be discussed. A particularly powerful tool proved to be a logfile which is automatically updated each time certain software is used. It contains individual level data about size of job and data set, control cards and -statistical procedures used, types of errors and more. This gives valuable insights about:--the structure of the user community.--styles of package use,--weak points of packages.In my paper I will discuss some general problems of recording and analyzing user information, and will present data fre~ the logfile described. This should he considered as an example in the methodological discussion as well as a substantive contribution to the analysis of SPSS-use and -users.
Evaluating the performance of a unified switching node using a simulated network
Authors: Kenneth J. Bodzioch, Bernard E. Patrusky
Venue: Proceedings of the 76 Bicentennial conference on Winter simulation (1976)

This paper describes a program which utilizes a discrete event simulation to drive a real switching node. Empirical measurements of various nodal performance characteristics are gathered and recorded during the exercise of this program to aid in the evaluation and design of candidate future nodal architectures. Applications software and specialized hardware for a unified node which switches both digitized voice and data (packet) traffic were developed and tested in a flexible testbed facility at RCA in Camden, New Jersey. Both voice and data traffic are switched over common trunking facilities employing dynamic channel allocation. All packet transfers are made under the protocol set forth by the ANSI Advanced Data Communication Control Procedures (ADCCP). To measure the performance characteristics of the unified switching node, software was developed to simulate the node/network and node/source terminal interfaces. Projected levels of voice and packet traffic were used as inputs to a discrete event simulation program which generates a source traffic tape in accordance with specified interarrival and holding time distributions. This traffic tape then serves as the traffic input to the network simulator software which examines and interprets each traffic event on the tape. The network simulation software reacts to data arrivals by generating properly formatted packets, introducing these packets to the nodal applications program at the appropriate times, and providing all required network and source terminal protocol responses. Voice call arrival and departure events are used to alter the packet service rate on those trunks which employ dynamic channel allocation. Performance statistics and measurements are continuously collected by the network simulator and prepared for analysis by off-line data reduction programs.
Control structures in programming languages - part-I (Panel Session): &ldquo;The state of the art&rdquo;
Authors: Burt Leavenworth
Venue: Proceedings of the ACM annual conference - Volume 2 (1972)

This session is devoted to current developments in the design and analysis of control structures for programming languages, with emphasis on the recognition and analysis of concurrency in programs, and the realization of linguistic primitives for expressing backtracking algorithms.
An engagement effectiveness model for surface ships
Authors: Jonathan F. Bard
Venue: Proceedings of the 13th conference on Winter simulation - Volume 1 (1981)

A stochastic model is presented that can be used to evaluate the effectiveness of surface ships as they operate in their various military roles. The development is undertaken from the defensive point of view; both a surface-to-air missile system and a gun system are considered. Input data are obtained from a complementary model in the form of platform reaction time distributions. Once the scenario is specified overall performance measures are derived from ship survivability and cumulative kill probability calculations. A sample engagement is outlined.
Financial simulation model for the computer business
Authors: M. N. Bartakke, H. B. Horton
Venue: Proceedings of the third conference on Applications of simulation (1969)

This paper describes a model used for financial simulation of computer systems, their component cabinets, and the Univac Data Processing Division of Sperry Rand Corporation. The analyses derived from the model are part of the company's short-range (2-year period) and long-range (6-year period) planning procedures. This model, which runs on UNIVAC&reg; 1108 computer, provides the means through which both short- and long-range effects of certain types of decisions can be traced in greater detail and speed than by previous procedures. The model has been utilized for long-range revenue forecasting, for measuring effects of alternative marketing programs, and for estimating manpower requirements.
Test generation systems in Japan
Authors: S. Funatsu, N. Wakatsuki, T. Arima
Venue: Proceedings of the 12th Design Automation Conference (1975)

With the advent of large scale and medium scale integrated circuit, test and diagnosis of digital logic circuits become more and more difficult to get an efficient and economical goal. In this paper, Test Generation Systems for testing digital logic circuits (IC Cards) in Japan are introduced. One implemented in Nippon Electric Co. is described in detail. Future problems of Test Generation Systems are also briefly discussed.
Symbolic simulation for functional verification with ADLIB and SDL
Authors: W. E. Cory
Venue: Proceedings of the 18th Design Automation Conference (1981)

The basic verification problem addressed in this paper is to determine the consistency of two digital design descriptions. This is done by symbolically simulating each description and comparing the results. This approach is complicated by the presence of different levels of abstraction and asynchronous timing. This paper motivates interest in this problem and provides background information on verification, ADLIB, and SDL. It then discusses approaches for dealing with the problems encountered in the symbolic simulation of ADLIB/SDL descriptions.
SMP - A Symbolic Manipulation Program
Authors: Chris A. Cole, Stephen Wolfram
Venue: Proceedings of the fourth ACM symposium on Symbolic and algebraic computation (1981)

SMP is a new general-purpose symbolic manipulation computer program which has been developed during the past year by the authors, with help from G.C. Fox, J.M. Greif, E.D. Mjolsness, L.J. Romans, T. Shaw and A.E. Terrano. The primary motivation for the construction of the program was the necessity of performing very complicated algebraic manipulations in certain areas of theoretical physics. The need to deal with advanced mathematical constructs required the program to be of great generality. In addition, the size of the calculations anticipated demanded that the program should operate quickly and be capable of handling very large amounts of data. The resulting program is expected to be valuable in a wide variety of applications. In this paper, we describe some of the basic concepts and principles of SMP. The extensive capabilities of SMP are described, with examples, in the &ldquo;SMP Handbook&rdquo; (available on request from the authors).
Evolution of the engineering design system data base
Authors: Jere L. Sanborn
Venue: Proceedings of the 19th Design Automation Conference (1982)

The IBM Engineering Design System is a corporate-wide electronic design automation system used for the development of the 3081 and other machines incorporating LSI chips and their carriers. Initially planned in the late 1960s, the system has evolved to respond to a changing set of requirements. This paper describes the evolution of the system data base, as well as the steps taken to ensure the integrity of the data and the correctness of the design.
Project implementation of Software Configuration Management
Authors: C. R. Fredrick
Venue: ACM SIGMETRICS Performance Evaluation Review (1981)

Have you or one of your programmers said: &ldquo;The system ran yesterday; I only changed one line.&rdquo; or &ldquo;I spent my budget, but I'm not done.&rdquo; or &ldquo;I fixed that problem yesterday, but it's back now.&rdquo; or &ldquo;I thought it would be a nice feature for the operator, so I added it to the program.&rdquo; or &ldquo;Why was this line of code changed? Who did it and when?&rdquo;? If these or other similar statements are familiar, then Software Configuration Management is a subject that should interest you. Software Configuration Management (SCM) is a management method that establishes a discipline for the software development process and provides visibility to that process. The step by step procedures used by a large software organization to resolve some of their development problems will be followed here. The result of their efforts was the formulation of a management method that significantly improved the quality of their software products and reduced the costs. It was learned later that other software organizations had gone through similar processes and arrived at similar results. This new tool is now known as Software Configuration Management.
A discrete structures course for a small college
Authors: Margaret E. Dexter, Margaret L. Rhoden, Jerry Sue Townsend
Venue: ACM SIGCSE Bulletin (1975)

It is generally accepted that a course in discrete structures such as Course B3 in Curriculum 68 recommendations [1] is an important part of a Computer Science program. In many institutions a Discrete Structures course is offered in the Computer Science Department although it overlaps courses in the Mathematics Department [2,3,4]. In smaller schools the size of the student body and staff limitations make such a solution impractical. At Augusta College we have met the objective of early exposure to discrete mathematics with applications in computer science by offering a two-hour computer science course as a co-requisite to a three-hour mathematics course. While this approach is a compromise it does appear to have some merit.
Whole Word Recognition in Facsimile Images
Authors: N. Sherkat, T. J. Allen
Venue: Proceedings of the Fifth International Conference on Document Analysis and Recognition (1999)

This paper presents the research carried out in producing a whole recognizer for cursive hand written words in facsimile images. Two sets of hand written data samples are collected and converted into facsimile images. The first set comprises approximately 1600 word images from 8 writers and is used for development purposes. The second set consists of approximately 2000 word images from 10 writers. This set is used for testing only.The algorithms for extraction of holistic features namely, vertical bars, holes and cups used in the recognizer are described. A series of test are carried out and the results are presented. Using a 200 word lexicon.The holistic recognizer produced 62% top rank and 82% in top 5 alternatives. When a lexicon of 1000 words was used these values reduced to 49% and 70% respectively.The future directions of the research for improvement of recognition rate are proposed. It is envisaged that definition of further features would improve the overall accuracy.
PC board layout techniques
Authors: David R. Johnson
Venue: Proceedings of the 16th Design Automation Conference (1979)

This paper discusses general concepts and sample results of printed circuit board layout techniques involving the use of a general purpose, interactive graphics, computer aided design and manufacturing system. Employed is a balance of automatic processes and manual techniques proven to be effective for addressing a wide range of board sizes and types.
A Mailbox-Based Scheme for Improving Mobile IP Performance
Authors: Liang Zhang, Jiannong Cao, Sajal K. Das
Venue: Proceedings of the 23rd International Conference on Distributed Computing Systems (2003)

Mobile IP route optimization and Mobile IP local registration are two approaches to solve performance problems associated with the base Mobile IP protocol proposed by IETF. The route optimization scheme solves the triangular routing problem by introducing the bindingcache concept. The local registration scheme reduces the large overhead for location management by processing the mobile host's registration request only at a local foreign agent. In this paper, we present a mailbox-based approach to take advantages of both approaches. Each mobile host migrated to a foreign network is associated with a mailbox, which can be decoupled with the owner host, and packets destined to the receiver will be delivered to the mailbox whose address is cached in the sender. Separating mailbox from its owner host allows us to achieve adaptive location management, while at the same time buffering incoming packets in the mailbox located somewhere in the network closer to the receiver reduces the retransmission cost. The dynamic migration of mailbox also eliminates the need of pre-structuring mobility agents into hierarchy which is a necessary in the local registration scheme.
Inferential question answering in a textual data base
Authors: Robert F. Simmons
Venue: Proceedings of the 1976 annual conference (1976)

A paragraph of expository text is presented in case predicate and semantic network form as an example of a textual data base. An inferential procedure that has been used to answer questions from case predicate structures is outlined. It is argued that case predicates and their corresponding graphic form, semantic networks, are variant notations convenient to represent and compute the logical relations that hold among conceptual elements in English texts.
Medical applications of data-driven APL programs
Authors: W. Hagamen, W. Bell, J. Lincoln, D. Linden, J. Weber
Venue: Proceedings of seventh international conference on APL (1975)

The program generator does not produce APL code. The programmer is asked a series of questions. The answers to the questions are stored as data. This data drives the basic APL functions common to all programs, and makes each program unique. In order to avoid confusing this data with that which is subsequently entered via the application program it self , we shall refer to the data that drives the programs as &ldquo;program data&rdquo;. Information entered through the application programs will be called &ldquo;file data&rdquo;. In using the term &ldquo;data-driven programs&rdquo; we are drawing a distinction between special purpose programs individually coded for each application, and a general purpose program, modified by a series of stored instructions for each application.
A hardware architecture for controlling information flow
Authors: Harry J. Saal, Israel Gat
Venue: Proceedings of the 5th annual symposium on Computer architecture (1978)

The foundations of capability schemes are critically examined. The context free utilization of capabilities once acquired is shown to be inconsistent with both least privilege norm and information flow requirements. An enhanced Capability Vector mechanism which pre-confines the set of capabilities with which a given capability can be combined is proposed. It is shown that capability vectors dynamically define an information flow structure which is potentially more refined, flexible, and versatile than traditional information classification systems. Based on this property, a Generalized Capability Vector machine which enforces a controlled information flow policy is designed. The proposed machine supports programmable resources which are either statically or dynamically bound to an information class.
Probabilistic analysis of a crossbar switch
Authors: T. N. Mudge, B. A. Makrucki
Venue: ACM SIGARCH Computer Architecture News (1982)

This paper presents a probabilistic analysis of a crossbar switch interconnection network. A crossbar switch can be used to interconnect various combinations of computer subsystems. In the analysis below it is assumed, without loss of generality, that the crossbar is being used to connect N processors to M memories. The crossbar is termed an N-M crossbar (read &ldquo;N to M crossbar&rdquo;). General expressions are developed for a variety of performance figures for an N-M crossbar including: the probability of a memory request being accepted (i.e. not being blocked by another request to the same memory), the expected bandwidth of the crossbar, and the average wait time of a request before it is accepted. Closed form solutions to these expressions are given for the uniform request case and for the favorite memory case (i.e. where processor i requests memory i with a higher probability than others memories). The closed form solutions are tested against simulations.
Discrete digital simulation of a genetic control theory
Authors: Richard B. Jones, Charles K. Lumpkin,  Jr., James R. Smith
Venue: Proceedings of the 13th annual symposium on Simulation (1980)

Normal human cells are able to reproduce in cell culture, but the extent of reproduction is limited to 50-70 population doublings (Hayflick and Moorhead, 1961). It has been proposed that this limited proliferation is a manifestation of normal biological aging at the cellular level. This idea has stimulated a great deal of research into the mechanisms limiting the doubling potential of normal cells in culture (Hayflick, 1977). Experimental evidence has recently been obtained which has led to the formulation of a new theory to explain the mechanisms involved in this phenomenon. The purpose of this paper is to analyze via computer simulation a genetic control model that could describe the processes that occur during cell proliferation reproduction. For many years mathematical models have been developed to study various aspects of cellular kinetics with both general (Valleron and Frindel, 1973; Hahn, 1970) and specific (Absher and Absher, 1978) applications in mind. The experimental data documenting the limited replicative lifespan of human diploid cells has provided the foundation for many current studies of cellular senescence and its relationship to in vivo aging (Hayflick and Moorhead, 1961). This information has been obtained from observing the doubling behavior of cells in clonal distributions (Smith and Hayflick, 1974), cell hybrid studies (Norwood et al., 1974), and mass culture data. This data base supports many competing hypotheses and mathematical models of cellular senescence (Good, 1975). Within the past year new experimental evidence in the form of clonal
Computer capacity planning using queueing network models
Authors: T. L. Lo
Venue: Proceedings of the 1980 international symposium on Computer performance modelling, measurement and evaluation (1980)

This paper presents several computer capacity planning case studies using a modeling tool, BEST/1, derived from the theory of queueing networks. All performance predictions were evaluated based on the selected service levels such as response times and throughputs. Advantages and disadvantages of using the modeling approach are also briefly discussed.
Developing a SARA building block - the 8080
Authors: William T. Overman, Gerald Estrin
Venue: Proceedings of the Symposium on Design Automation and Microprocessors (1977)

This paper concerns itself with issues in development of building blocks for use in structured synthesis of computer systems and bases its discussion on experiences with behavioral modelling of the 8080 microprocessor. The SARA (System ARchitects Apprentice) system offers a set of modelling and analysis tools intended to aid a designer in a structured design procedure [EST77, GAR77, RAZ77, CAM77, GAR75, FEN76]. Every design developed with the help of SARA terminates in a composition (bottom-up) step in which previously validated models of elements (building blocks) are joined together. The multi-level modelling which SARA is supposed to support [GAR77] depends upon the fact that building block models use the same primitives as higher level systems. This paper discusses experiments with development of machine processable models using graph model primitives for the 8080 family via the SARA tools.