ppxscal/embedding_network huggingface dataset:
Some implementations of segment sequential functions
Authors: J. A. Bush, G. J. Lipovski, S. Y. W. su, J. K. Watson, S. J. Ackerman
Venue: Proceedings of the 3rd annual symposium on Computer architecture (1976)

Since conventional computers are straining to handle the increased size and sophistication of non-numeric processing (data management, information retrieval, artificial intelligence), a new class of non-numeric architectures is evolving. The segment sequential architecture is one of these. Further development of this architecture requires new techniques for multiple cell operation and intercell communication to handle control and search operations. This paper describes such techniques for instruction fetching, operand recall, string, set and tree context searching, and pointer transfer. It is expected that combinations of these techniques will appear in future architectures that are needed for non-numeric processing.
Input scaling and output scaling a binary calculator
Authors: E. F. Codd, H. L. Herrick
Venue: Proceedings of the 1952 ACM national meeting (Toronto) (1952)

Suppose 1) the input for a problem which is to be solved on a binary calculator is given in decimal form; 2) the programmer desires to specify in his program the scale factors to be applied to intermediate results to keep these results within the capacity of the registers of the calculator; 3) the scale factors to be applied are powers of two (this allows advantage to be taken of the shifting operations which may be built into the calculator). A method will now be described for using the binary calculator itself to scale the input and in such a way as to obtain the best possible accuracy together with exact reconversion. This method is sufficiently general to form the basis of a standard input program. Once such a program has been developed, the programmer is relieved of much of the labor of preparing decimal input in a form suitable for a binary calculator.
DESRS: An on-line documentation entry, search and retrieval system for academic computer users
Authors: Raymond D. Volpe
Venue: Proceedings of the 6th annual ACM SIGUCCS conference on User services (1978)

State University of New York at Buffalo (SUNY/Buffalo) is one of four university centers in the state's university system. At SUNY/Buffalo we have developed an on-line and automated Documentation Entry, Search and Retrieval System (DESRS). A cross-referenced index of documentation for software supported by the Center, or available from departmental libraries, is available on-line. DESRS enables the novice and experienced user to learn what software is available to accomplish a given task and obtain the available information relevant to its use.
A program complexity metric based on data flow information in control graphs
Authors: Kuo-Chung Tai
Venue: Proceedings of the 7th international conference on Software engineering (1984)

This paper presents a new approach to measuring program complexity with the use of data flow information in programs. A complexity metric, called DU, is defined for the control graph of a structured program. This new metric is different from other control-graph based metrics in that it is based on &ldquo;representative&rdquo; data flow information in a control graph. An algorithm for computing the value of DU(G) for a control graph G is given. The lower and upper bounds of DU(G) are provided. The DU metric is shown to have several advantages over other control-graph based complexity metrics.
Making the wire frame solid
Authors: Donald Robbins
Venue: Proceedings of the 19th Design Automation Conference (1982)

At SNLA, the primary computer-aided drafting tool is the Applicon Graphics System (AGS). The data base for mechanical parts on the AGS is a &ldquo;wire frame&rdquo; model. Experiments are underway for adding surface information to the wire frame and passing this information &ldquo;up stream&rdquo; to a VAX computer. On this computer, a programming system for manipulating polygonal information (MOVIE.BYU) is available. One of the output devices is a RAMTEK 9400 high resolution color display. This display has also been interfaced to a color recorder.
SIGMETRICS (Panel Session)
Authors: Edwin S. Herndon, James S. Cameron, M. Talbott, Bennet P. Lientz
Venue: Proceedings of the 1976 annual conference (1976)

Selection and evaluation of computer systems and services is becoming increasingly sophisticated and complex. Algorithms for decision-making are being developed and refined. Hardware and software tools are being developed. Following brief presentations of the highlights of the papers, there will be a discussion of key questions including: &ldquo;What's the difference between procuring systems and services?&rdquo;, &ldquo;How much advance work is required to get a pay-off?&rdquo;,and &ldquo;What tools are worth using?&rdquo;
ISP/1: A conversational statistical package
Authors: Michael D. Murray
Venue: Proceedings of the sixth international conference on APL (1974)

A library of conversational programs written in APL and designed to perform a great many common statistical procedures is described. Areas covered include simple parametric statistics, analysis of variance and covariance, multivariate analysis of variance, multiple discriminate analysis, correlation and regression analysis, factor analysis and assorted nonparametricstatistics.
Communication and management support in system development environments
Authors: Beverly I. Kedzierski
Venue: Proceedings of the 1982 conference on Human factors in computing systems (1982)

A System Development Support Environment that assists in communication and management tasks of software project members should aid the development of large, evolutionary computer systems. The environment proposed in this paper will include integrated capabilities for project management, system evaluation, documentation/help, and intelligent communication between designers/users, and either the system or other designers. The goal is to have the environment help collect, organize and disseminate information about a project, using a model of the underlying system. The work is based on the idea that people perform &ldquo;Communication Acts&rdquo; (ACTs) such as: questioning, griping, planning, requesting or informing, while interacting with a system, and that processing of these ACTs can be automated. A Taxonomy of &ldquo;simple&rdquo; ACTs has been created from initial, informal studies of system/user interaction. A knowledge-based synthesis approach is used to create an experimental environment to support a program synthesis (software) project [Phillips-81]. The environment design and framework, which is part of the author's Ph.D. thesis work in progress [Kedzierski-80], is discussed.
Some extensions to algebraic specifications
Authors: Jhon V. Guttag, Ellis Horowitz, David R. Musser
Venue: Proceedings of an ACM conference on Language design for reliable software (1977)

Algebraic specifications of abstract data types are beginning to gain wide currency. In this paper we discuss an extension to this specification technique which allows the specification of procedures which alter their parameters, and various ways of handling the specification of error conditions.
A Petri Net model of the CDC 6400
Authors: Jerre D. Noe
Venue: Proceedings of the SIGOPS workshop on System performance evaluation (1971)

Measurement and evaluation of computer systems requires a model of the computer under control of the operating system that shows the interrelation between task flow and allocation of resources. For multiprogramming and multiprocessing systems, the model needs to show parallelism of operations. Furthermore, it should allow easy shift into greater or less detail as required by the measurement investigation, while providing perspective on the whole system. An adaptation of Petri Nets has been found well suited to this purpose. The representation shows parallelism, and allows compression of either sequential or parallel operations when less detail is required. The paper describes a multiprocessor, multiprogramming system, the CDC 6400, in terms of Petri Nets and shows how this type of representation lends itself to planning system measurements.
The use of a meta-assembler to design an M code interpreter on AMD2900 chips
Authors: Stanley Habib, Xue-Liang Yang
Venue: Proceedings of the 14th annual workshop on Microprogramming (1981)

There have been several machine designs using microproprammed control which interpretively execute intermediate code such as P code and earlier version such as POPS. The recently announced Modula language uses M code as an intermediate language This paper describes how an AM-DAM2900 bit slice aechitecture was used to implement the interpretive execution of M code. The microcontrol is microprogrammed using the standard AMD AM2900 microfunctions to execute the M code. The design was tested using a meta-assembler which proved to be very helpful in debugging the microprogramming. The meta-assembler is briefly described. It is always difficult to convince others about ones in house specially designed meta-assembler but we discuss the meta-assembler and how we use it in the hope that the material concerning the M code is of interest even if the meta assembler is too detailed to follow. machines.
Analysis of computer peripheral interference
Authors: John Staudhmmer, C. A. Combs, Gordon Wilkinson
Venue: Proceedings of the 1967 22nd national conference (1967)

Among the limiting factors in computer performance are the rates at which information can be transferred into and out of the memory. Obviously the effective data transfer rate depends on the characteristics of the peripheral unit (speed of data collection or data posting) and the characteristics of the central processor (speed of filing of data). As peripherals are becoming faster and more numerous, the requests by the peripherals for data filing by the processor can become so dense that they can not be accommodated. This point will occur sometime before the total number of requests multiplied by the service times for those requests (namely the peripheral load factor) becomes one.
Case Studies On The Implementation And Use Of Database Management Systems (Panel Discussion): Experience with resistance
Authors: James A. Senn, Robert M. Curtice, Richard H. Godlove, John K. Lyon
Venue: Proceedings of the 1978 annual conference (1978)

The most dramatic advance of the past decade in software technology has been the development of database management systems (DBMS). There is little question about the potential of these systems for enhancing system support to managers and users while reducing design, structuring, and maintenance problems. Database systems also provide a way of improving information system flexibility by decoupling user-oriented data structures from physical storage methods. In spite of the vast potential of database management systems, the information systems community has not reacted with the total enthusiasm that might have been expected. Significant resistance has been encountered in some organizations, both from users, systems managers, and programming staff members. Although the literature on the features of database systems is substantial, there is little discussion of resistance problems encountered during the actual implementation and use of these systems in organizations. The purpose of this panel is to examine issues related to resistance toward DBMS in organizations. The panel members, each of whom is experienced in this area, will examine a number of organizational, technical, and application issues pertinent to the problem of resistance. The discussion will focus on why this resistance has occurred and how, if at all possible, it could have been avoided. Both behavioral and technical issues will be examined. This session should be of interest to both the practitioner and theorist alike. Database management systems are collectively the most significant software product advance in the last decade. There is little question about the potential of these systems for improving data management in organizations. Yet not all persons show a level of enthusiasm for these systems that their capabilities would merit. Users and systems persons alike have been known to resist acquisition and/or introduction of database management systems, sometimes strongly. In the discussion that follows, the problem of resistance as it applies to database management systems is introduced. The intent is to raise issues for research and investigation rather than to provide concrete answers to problems.
An architecture for a relational dataflow database
Authors: Lubomir Bic, Mike Herendeen
Venue: Proceedings of the 1981 ACM SIGSMALL symposium on Small systems and SIGMOD workshop on Small database systems (1981)

A relational database system based on the principles of functional, data-driven computation is proposed. An architecture composed of a large number of independent, asynchronously operating processing units, each equiped with a separate memory unit holding a portion of the database is shown which implements the relational database system. All processing units are interconnected via 1) a circular shift-register bus, and 2) a daisy chain connection. Relations are represented as streams of values (tuples) where each value is carried by a unique token. To perform a query on the data base, relations involved in the query are replicated from the database as streams and used as inputs to dataflow programs (graphs) implementing the relational algebra. All operators represented within the dataflow program are executed by independent processing units and are data-driven. Proceeding asynchronously as stream values needed as inputs are produced. A time complexity of O(n) is achieved for any relational algebra query assuming a sufficient number of processing units are available.
An observation on time-storage trade off
Authors: Stephen A. Cook
Venue: Proceedings of the fifth annual ACM symposium on Theory of computing (1973)

Recently there have been several attempts to prove that every set of strings in @@@@ (i.e., recognizable in deterministic polynomial time) can be recognized in deterministic storage (log n)2. The methods used in the attempts were based on that of [1], in which it is shown that every context free language can be accepted in storage (log n)2 Our thesis in the present paper is that these attempts must fail. We define a specific set SP of strings which is clearly in @@@@, but in a certain well-defined sense cannot be recognized in storage (log n)2 using the techniques in [1]. We conjecture that no Turing machine recognizes SP within storage (log n)2, and show that if this conjecture is false, then in fact every member of @@@@ can be recognized within storage (log n)2.
A bayesian approach to the design of simulation experiments
Authors: Mark A. Turnquist, Joseph M. Sussman
Venue: Proceedings of the 76 Bicentennial conference on Winter simulation (1976)

Simulation is inherently an experimental modelling tool. One obtains results from simulation models by operating them, or in other terms, by conducting experiments with them. The intrinsic experimental na-ure of simulation (and its resulting costliness as a modelling methodology) implies that in order to utilize simulation effectively, it is important to make the fullest possible use of the tools of experimental design and statistical analysis. Effective design of simulation experiments requires consideration of a number of issues, including: &bull; the context of the experiments (i.e., deterministic or stochastic model, continuous or discrete domain of experimentation, etc.); &bull; the nature of the decisions to be made, based on the outcome of the experiments; &bull; the special experimental capabilities of simulation models. The approach to experimental design described here is oriented toward stochastic models, and to situations involving discrete experimental options, as opposed to experiments in a continuous space.
Chap - a SIMD graphics processor
Authors: Adam Levinthal, Thomas Porter
Venue: Proceedings of the 11th annual conference on Computer graphics and interactive techniques (1984)

Special purpose processing systems designed for specific applications can provide extremely high performance at moderate cost. One such processor is presented for executing graphics and image processing algorithms as the basis of a digital film printer. Pixels in the system contain four parallel components: RGB for full color and an alpha channel for retaining transparency information. The data path of the processor contains four arithmetic elements connected through a crossbar network to a tessellated scratchpad memory. The single instruction, multiple data stream (SIMD) processor executes instructions on four pixel components in parallel. The instruction control unit (ICU) maintains an activity stack for tracking block-structured code, using data-dependent activity flags for conditional disabling subsets of the ALUs. Nested loops and if-then-else constructs can be programmed directly, with the ICU disabling and reenabling ALUs on the basis of their individual status bits.
Fuzzy maps and their application in the simplification of fuzzy switching functions
Authors: Abraham Kandel
Venue: Proceedings of the sixth international symposium on Multiple-valued logic (1976)

In Boolean logic, a Karnaugh map may be regarded either as a pictorial form of a trugh table, or as an extension of the Venn diagram. However, when fuzzy logic is concerned another minimization method is required, and therefore an extension of a Karnaugh map is investigated. In this paper a new minimization algorithm is developed in order to remove the existing disadvantage of simplifying fuzzy forms. The algorithm is based on a new representation of fuzzy forms that assures a very suitable automatic generation of the fuzzy prime implicants and of the essential fuzzy prime implicants.
Fast maze router
Authors: J. Soukup
Venue: Proceedings of the 15th Design Automation Conference (1978)

This paper describes a method of generating a path between two points of a cellular array, with some cells being specified as obstacles. The method combines two techniques: A line search is first directed toward the target. This is a fast and extremely effective method on boards with plenty of space. When the line search hits an obstacle, an expansion technique typical for the Lee-type algorithms is then used to &ldquo;bubble&rdquo; around the obstacle. The line search can then continue toward the target again.
M3L: A list-directed architecture
Authors: J. P. Sansonnet, M. Castan, C. Percebois
Venue: Proceedings of the 7th annual symposium on Computer Architecture (1980)

This paper describes the basic principles and the architecture of a general host machine based upon lists processing. Current works in this field are dealing with conventional direct execution schemes which use lineary structured Directly Executable Languages: prefixed languages with varying formats for operators and operands. If these languages are convenient for interpretation and provide an efficient execution scheme, on the other hand, they are very hard to generate. Therefore, we propose here a new direct execution model based upon the definition of a class of Directly Executable Languages with a list oriented structure using LISP as model. The first part of the scheme is held by an editor which translates the high level source-text into the internal tree-structured form. The second part is held by an interpreter which executes this form on an appropriate machine. In this paper we pursue the design of the list-structured intermediate form and we give the reasons of our choice. Once we have brought out the concepts and the functions required for the implementation of non-numerical processing and particularly for list-structured forms, we discuss the architecture of the lists-directed machine.
SIGBDP 5 (Panel Discussion): Human resource requirements for business application development
Venue: Proceedings of the 1975 annual conference (1975)

In 1973, the Management Information Systems Research Center of the University of Minnesota and 14 &ldquo;Associate Firms&rdquo; headquartered in the Twin Cities conducted a study of skill requirements needed by and possessed by MIS practitioners. The study results were surprising when contrasted with recommendations made by the ACM Curriculum Committee on Computer Education for Management. This session will use the study results as a starting point for a discussion of what IS and DP practitioners need to know to perform their jobs. Positions from programmer to managerial leads were examined. After the introduction to the previous results and updating them to 1975, questions pertaining to the future will be examined. Included will be: What will the demand be for IS and DP personnel in the late 70's and 80's? What skills will be required for various positions? How are these skills to be provided, i.e., what is the role of OJT, Vendor Classes, Secondary Education? What is the current state of the affairs regarding education in MIS and what trends exist?
JOYCE: A next generation personal computer
Authors: W. R. Franta
Venue: Proceedings of the 3rd ACM SIGSMALL symposium and the first SIGPC symposium on Small systems (1980)

In this paper we will detail the JOYCE hardware/software design decisions, cost, status and our plans for continued system development. We examine its features in light of some scheduled applications including CAI (a stand alone PLATO system), database management, electronic mail, etc. We will also detail our experiences relating to the acquisition of components necessary for the realization of JOYCE, including delivery delays, vendor promises and the gap between vendor product (chip, etc.) actual operation and documented operational descriptions.
The MACSYMA &ldquo;big-floating-point&rdquo; arithmetic system
Authors: Richard J. Fateman
Venue: Proceedings of the third ACM symposium on Symbolic and algebraic computation (1976)

We describe the design of a set of elementary function floating point evaluation routines for use with an algebraic manipulation system.
Characterization algorithms of binary pictures
Authors: Yuan R. Wang
Venue: Proceedings of the ACM annual conference (1973)

Given a vector A of m row projections and a vector B of n column projections, efficient reconstruction algorithms of a binary picture Z from A and B have been developed by Chang.1 The set of projections S&equil;(A,B) is empty, unique or multiple if it determines no binary picture, exactly one binary picture or more than one binary picture respectively. Two binary pictures are similar if they are determined by the same set of projections. A binary picture Z is ambiguous if it has at least another similar binary picture, otherwise it is unambiguous. A complete characterization of binary pictures with respect to their projection sets is summarized in two questions. Given a binary picture Z, is it unambiguous? Given a set of projections S&equil;(A,B), is it empty, unique or multiple? Two algorithms base upon the idea of Ryser are presented.2 The first algorithm answers the first question and the second algorithm answers the second question.
Cost effectiveness of alternative sewage collection treatment and disposal systems at recreational areas
Authors: Mesbah U. Ahmed, Kenneth B. Young, Arun G. Walvekar
Venue: Proceedings of the 10th conference on Winter simulation - Volume 2 (1978)

This paper illustrates the applicability and usefulness of systems approach in evaluating the sewage collection, treatment and disposal alternatives at a selected recreational area. The paper identifies the interactions among sewage collection, treatment and disposal alternatives. The analysis process considers increases in effluent loading rates with additional developments of the project over time and is designed to select the least cost combination of collection, treatment and disposal facilities. The model, as developed in this study, is general; that is, it can be applied to other interactive sewage projects where land application may be beneficial.