ppxscal/embedding_network huggingface dataset:
Porting the Zed compiler
Authors: G. B. Bonkowski, W. M. Gentleman, M. A. Malcolm
Venue: Proceedings of the 1979 SIGPLAN symposium on Compiler construction (1979)

Zed is the base language used to implement the portable realtime operating system Thoth[7], and to write commands, utilities, application programs, and other software which run under Thoth. (Zed is similar to C, although language details are not important in this paper.) One of the founding principles of Thoth is our experience that the hardest problems in porting programs usually arise when interfacing to different operating systems. By porting the whole operating system first, we ensure that other programs see the same system interface. Hence, with a modicum of care in programming, programs can be machine independent in that, without change, they can be compiled for any machine to which Thoth has been ported. Since the Zed compiler is a program which runs under the Thoth operating system, it is portable in this sense, and the same source serves to produce either native mode or cross compilers because it does not depend on the machine on which the compiler will run. Compilers, in common with certain other &ldquo;system software&rdquo;, are, however, machine specific in that the output from executing a compiler must be different depending upon the machine on which that output is destined to be run. Clearly, for Thoth to be ported to many machines, the compiler should be portable in this second sense: as much as possible of the source of the compiler should be machine invariant, that is, independent of the target machine, and for those parts which are machine specific, there must be a well organized scheme to assist realizing versions for new machines. The Zed compiler is designed to ease such ports. Actually, the objective is broader than that, because the initial port is only part of the problem: once versions of the compiler are available for several machines, we still have the problems of maintaining all these different versions, enhancing them, and evolving them to follow changes in the language. To do this, we need a structure that is easy to understand and to work with. We also want to minimize the amount of source code for which multiple versions must exist.
A conjugate gradient method based on an exponential model
Authors: J. S. Kowalik, E. R. Kamgnia, W. R. Boland
Venue: Proceedings of the 1977 annual conference (1977)

The problem considered is that of calculating the least value of a general differentiable function of several variables. If computer storage is at a premium and the gradient vector can be computed, then a conjugate gradient method is suitable for solving the problem. An exponential function of the positive definite form is considered as a model for the conjugate gradient optimization method. A numerical algorithm is derived and tried on several standard test functions. In several cases it clearly out-performed the classical conjugate gradient method based on the quadratic function model.
DCG - a system for automatic code generation for hyperbolic problems
Authors: Björn Engquist, Tom Smedsaas
Venue: Proceedings of the SIGNUM meeting on Software for partial differential equations (1975)

DCG is a program which generates FORTRAN code for difference approximations from a mathematical specification of a hyperbolic system. In our system the user presents his problem in a mathematical notation. DCG analyses the problem, chooses algorithms and generates a complete program for the numerical integration. The main parts of DCG are a program for symbolic analysis, &ldquo;the analyser&rdquo;, a library of FORTRAN-code and a program, &ldquo;the synthesiser&rdquo; that composes a complete FORTRAN program using code from the library.
Memory-Based Forecasting of Complex Natural Patterns by Retrieving Similar Image Sequences
Authors: Kazuhiro Otsuka, Tsutomu Horikoshi, Satoshi Suzuki, Haruhiko Kojima
Venue: Proceedings of the 10th International Conference on Image Analysis and Processing (1999)

A novel framework called Memory-Based Forecasting is proposed to forecast complex and time-varying natural patterns. In this framework, past patterns similar to the present pattern are retrieved, and the forecast pattern is produced by using the patterns that follow the retrieved sequences. We represent the dynamic features of a sequence by using the spatial distribution of the patterns, velocity field, and temporal texture features; the sequences are transformed into paths in eigenspaces. The relationship between retrieval error and prediction error are modeled to define a similarity measure for retrieval. Forecast images are constructed from a future point in the eigenspace which is estimated by a nonlinear prediction scheme. Several experiments using weather radar images confirm the effectiveness of our method especially for drastically changing patterns.
An analysis of traffic handling capacity of packet switched and circuit switched networks
Authors: Kazuo Itoh, Takao Kato, On Hashida, Yutaka Yoshida
Venue: Proceedings of the third ACM symposium on Data communications and Data networks: Analysis and design (1973)

This paper reports the results of a study on traffic handling capacity of switching nodes and transmission lines in the circuit and packet switched networks, and on cost evaluation methods for the two types of networks. The two types of networks were compared by setting various parameters, including the communication density defined in the paper. The comparison results show that there are application regions favorable for each type of network.
Bounds on the time for parallel RAM's to compute simple functions
Authors: Stephen Cook, Cynthia Dwork
Venue: Proceedings of the fourteenth annual ACM symposium on Theory of computing (1982)

We prove that a parallel RAM with no write conflicts allowed requires -&-Ohgr;(log n) steps to compute the Boolean or of n bits stored in the first n global memory cells. We first argue that this result is subtler than it appears, and in fact the -&-ldquo;obvious-&-rdquo; lower bound of log2n steps can be beaten.
On the Use of Density Distribution of Keywords for Automated Generation of Hypertext Links from Arbitrary Parts of Documents
Authors: Koichi Kise, Hiroyuki Mizuno, Masashi Yamaguchi, Keinosuke Matsumoto
Venue: Proceedings of the Fifth International Conference on Document Analysis and Recognition (1999)

This paper presents a method of automated generation of hypertext links for electronic documents. The goal is to generate links from an arbitrary part of a document (a source of a link) to its relevant parts of target documents (destinations). To achieve this goal, we assume that words are often shared by parts of documents if these parts are relevant with each other.In order to extract parts densely including words of a source (keywords), we employ density distributions of keywords. This enables us to determine destinations simply by extracting parts whose density exceeds a threshold. Experiments on generating links from figures/tables to parts of documents, as well as from texts to parts of different documents show that our method with the optimal parameters yields recall of 60% and precision of 50%.
An experiment with design formalism in introductory courses
Authors: Gary A. Ford
Venue: Proceedings of the fourteenth SIGCSE technical symposium on Computer science education (1983)

(This paper has been accepted for publication in the Proceedings, but the photo-ready from was not delivered in time. Copies of the paper should be available upon request at the presentation.)
GRASP&mdash;a graphic service program
Authors: Eugene M. Thomas
Venue: Proceedings of the 1967 22nd national conference (1967)

As computing systems become more and more powerful, the tasks for which these systems are used become more and more sophisticated. In analyzing a complete task, one finds that there are certain portions which are best allocated to the computer and certain portions which are best allocated&mdash;at least at present&mdash;to man. Calculations and repetitive operations are done most efficiently by computer; intuitive functions and certain types of heuristic information are best handled by man. If man and the computer are to function together efficiently a device is needed to facilitate the communication of complex information between them. The sophisticated CRT display console is by far the best device available today for accomplishing this communication. To use the full capability of the graphic display console, both the computer and the man at the console must be able to create and manipulate drawings as well as alphanumeric information. If the computer is to do this, it needs an internal representation of the drawing information which provides not only the lines and points but also the information on how these are related to each other. The internal or computer representation of a drawing has come to be called the &ldquo;model.&rdquo;
Folding and unrolling systolic arrays (Preliminary Version)
Authors: K. Culik,  II, Jan K. Pachl
Venue: Proceedings of the first ACM SIGACT-SIGOPS symposium on Principles of distributed computing (1982)

This paper is about two constructions for transforming planar systolic arrays. By a systolic array we mean a uniformly structured processor configuration that allows only local communication (between neighbour processors) and supports high throughout by pipelining. Such configurations are suitable for VLSI implementation [4, 5]. We show how new connections in a systolic array can be established by folding the array along a line; and how computations in one-dimensional arrays unroll to two-dimensional structures resembling trellis automata [2]. We construct systolic arrays for computing large powers of a matrix; for matching keywords; for recognizing square-free words; and for finding the controlled product of matrices.
Can present methods for library and information retrieval service survive? (Panel)
Venue: Proceedings of the 1971 26th annual conference (1971)

When the need of the research people for keeping in touch with current and ongoing research in their field started to become acute new methods of librarianship were indicated. Progress of all research and their results are being reported at conferences in proceedings, in professional journals and in special reports. Because of the large volume of these materials, locating specific items of interest within this great bulk, to a scientist conducting research is of the essence. In depth indexing of these materials become the panacea to satisfy this new requirement. The need for currentness, the large volumes of materials, and the in depth identification of content suggested automatic processes which resulted in the development of several specialized information retrieval centers, each specializing in the literature of a discipline or a profession. Basically, most of the centers followed a somewhat similar approach. A policy for acquisition of materials would be adopted based on needs and the center's available resources. These materials would be received at the centers, a document number would be assigned to each paper and passed on to indexers. The indexers would read each document and assign index terms to them, identifying information content. In some instances, where abstracts are not available, they would create them. A search file would consist of document numbers and their respective index terms stored in a machine readable form. An alphabetic list of all the terms used for indexing the literature in the given corpus would consititute a dictionary of index terms. A search request would be converted into a search strategy consisting of a logical combination of terms taken from the dictionary, using AND, OR, and NOT logic. The method of indexing by terms and coordinating their concepts at search time using Boolean logic is known as coordinate indexing. An output of a search request would consist of a set of document numbers or accession numbers which met the search strategy requirement. Abstracts relating to the accession numbers would constitute the bibliography which the originator of the search request receives. He then examines them and finds that many are not relevant to his need nor to his biblio- graphic request. The non relevant references are referred to as false drops. In addition to the false drops, he finds that some are only peripherally relevant and it is his decision as to which documents he wishes to pursue further or read in full.
A relational data base machine employing associative memories and transposed files
Authors: Hamid Farsi, John Tartar
Venue: Proceedings of the 1983 annual conference on Computers : Extending the human resource (1983)

This paper presents the design of a relational data base machine which exploits features of the transposed file structure and the search capability of an associative memory to enhance the performance of relational database operations. The transposed file storage organization facilitates a significant reduction in the amount of data transfer, that is other-wise required for the processing of queries on very large relations of the database. Application of associative memories to the implementation of relational database operations, although promising, has shown to introduce several drawbacks. Utilization of these powerful search devices can be improved if they are designed according to the requirements of the application. The design proposed here is that of a hierarchically structured associative memory and a parallel pipeline processor which meet the potential requirements of relational database operations.
Word processing functions
Authors: Samuel Waldo Reynolds
Venue: Proceedings of seventh international conference on APL (1975)

This paper discusses ten user-defined APL functions having names and characteristics that are closely related to the APL mixed primitive functions. The defined functions are applicable to proper files. Some auxiliary support functions are discussed and several examples are included.
Analysis of computational systems: Discrete Markov analysis of computer programs
Authors: C. V. Ramamoorthy
Venue: Proceedings of the 1965 20th national conference (1965)

A PROGRAM with a number of subroutines can be represented by a flow diagram; Figure 1. The nodes represent the subroutines and the directed branches indicate the allowed transitions between them. Given a program consisting of n subroutines R1, R2 .....Rn, two matrices are also assumed to be known, viz., an n &times; 1 matrix of execution times of each subroutine and a n &times; n matrix P, such that its ij-th element Pij is the branching probability that the program will branch to subroutine j from subroutine i. We shall assume Pij's are statistically independent so that the model of the computer program is that of a discrete Markov process. The expected time to complete a program is then a summation of all possible statistically weighted paths that begin at an initial or starting subroutine and end at the terminal subroutine.
A new REDUCE model for algebraic simplification
Authors: Anthony C. Hearn
Venue: Proceedings of the third ACM symposium on Symbolic and algebraic computation (1976)

This paper shows how the general concepts of mode analysis can play a useful role in the design and implementation of programs for algebraic simplification. We utilize these ideas in presenting a new model for simplification which will be incorporated into REDUCE in the near future.
A national perspective on computer security
Authors: Louise Giovane Becker
Venue: Proceedings of the 1984 annual conference of the ACM on The fifth generation challenge (1984)

Computers and associated resources influence many aspects of modern society. While the continuing dependence on information technology and the fifth generation of computers prompts attention to potential abuse and misuse of these resources. Recent concerns have focused on the possible harm to the nation, society and individuals from misuse and abuse of computerized resources. The intentional and unintentional threats to computerized resources triggers consideration of appropriate measures to cope with the problems of computer vulnerabilities. The potential and real danger of unauthorized disclosures, unwarranted manipulation of data, degradation of services and capability, and destruction of resources prompts attention to protecting computerized resources in the fifth generation and beyond. This paper examines some of the major computer security problems and remedies within the broad context of defense and national security, critical systems, privacy and confidentiality, and computer crime. Highlights of specific problems confronting decisionmakers in selecting the appropriate approach to protecting computerized resources are reviewed. The paper reviews recent legislative proposals and executive branch actions as well as private sector activities having implications on future developments. This paper explores some of the problems that may require a more comprehensive examination by government and the private sector to assure that computer security requirements are met by the fifth generation. Identification of some of the critical issues related to implementing computer security measures will be a major focus. The prospects for new technology to meet the fifth generation requirements will be outlined.
Psychometric characteristics of the CDP examination
Authors: T. C. Willoughby
Venue: Proceedings of the thirteenth annual SIGCPR conference (1975)

The CDP Ambassador Information Folder (1) and the Study Guide (4) give a brief history of the Certified Data Processor (CDP) examination. The current examination subjects are: Data Processing Equipment Computer Programming and Software Principles of Management Quantitative Methods Systems Analysis and Design. The primary objective at the beginning of the program was an educational one. The aim was to encourage the data processing manager to bring his knowledge up to the state of the art. The CDP examination is then an examination of the knowledge needed by the data processing manager and should be evaluated in that light. The four appropriate psychometric qualities are item difficulty, item discriminating ability, reliability and content validity. In addition the test results give some hints about the potential usefulness of the examination as a predictive instrument. We shall discuss this issue.
Program improvement by source to source transformation
Authors: David B. Loveman
Venue: Proceedings of the 3rd ACM SIGACT-SIGPLAN symposium on Principles on programming languages (1976)

We treat a program as an object of manipulation, determine items of program constancy, and simplify the program based on the constancy. Some motivation for program manipulation is presented, along with two examples of &ldquo;higher level optimization&rdquo; written in an Algol-like language. A collection of program transformations and a model of the compilation process in terms of source-to-source transformations are presented. Finally a description of the application of these ideas to an existing programming language is given.
Type two computational complexity
Authors: Robert L. Constable
Venue: Proceedings of the fifth annual ACM symposium on Theory of computing (1973)

A programming language for the partial computable functionals is used as the basis for a definition of the computational complexity of functionals (type2 functions). An axiomatic account in the spirit of Blum is then provided. The novel features of this approach are justified by applying it to problems in abstract complexity, specifically operator speed-up, and by using it to define the illusive notion of the polynomial degree of an arbitrary function. New results are obtained for these degrees.
A statistical user interface for the Relational Model of data
Authors: Robert F. Teitel
Venue: Proceedings of the joint conference on Easier and more productive use of computer systems. (Part - II): Human interface and the user interface - Volume 1981 (1981)

In the decade since the introduction of the Relational Model as a user view of large stored data bases, a variety of user languages have been proposed and a number of experimental systems have been implemented. The current computer science literature is replete with papers on the theoretical and practical aspects of the Relational Model and its implementation, as are most recent texts on data management systems.Implicit in the design of the user languages of most database systems, including those based on the Relational Model, are assumptions regarding the patterns of access to and the usage of the content of the database. Somewhat oversimplified, the assumed pattern of access is to search for a particular occurrence (case, observation) in the database which satisfies a given condition, and then to display the values of all attributes (fields, variables) of that one occurrence. The languages are designed to permit users to pose queries such as, for example, "what widgets do we buy from ABC industries?" or "display Jones' employment history". Queries of this type are termed informational queries; and systems supporting such queries with appropriate user languages and internal data storage techniques and access methods are information systems.A statistical query, similarly oversimplified, specifies a pattern of access to most, if not all, of the occurrences in a database, and a usage pattern of at most a few of the attributes. Examples of statistical queries are "what is the average size of our purchase orders?" and "display the number of employees by race, sex, and job category". Current statistical systems have limited capability for performing analysis over large and complex data collections, and their user languages reflects this limitation. A statistical query, as defined here, need not involve sophisticated mathematical analysis; the distinction between informational and statistical is derived from the antithetical patterns of access to and usage of the data content of a database. Most work on access languages for relationally based data systems has been on information query languages; very little work has been done on statistical query languages.This paper, then, discusses some elements of a language for statistical queries for a data system employing the Relational Model as the user view of large stored data bases.
A proposed secondary education computer science curriculum
Authors: Stephen W. Thorpe, Paul D. Amer
Venue: Proceedings of the fourteenth SIGCSE technical symposium on Computer science education (1983)

(This paper has been accepted for publication in the Proceedings, but the photo-ready form was not delivered in time. Copies of the paper should be available upon request at the presentation.)