ppxscal/embedding_network huggingface dataset:
Rewriting systems on FP expressions that reduce the number of sequences they yield
Authors: Francoise Bellegarde
Venue: Proceedings of the 1984 ACM Symposium on LISP and functional programming (1984)

In this paper, we are interested in the application of program transformation for minimizing the number of intermediary sequences used in iterative programs. We shall use the FP language for presenting programs. The transformation rules are based on the algebra of functional programs. In contrast to the other systems of rules for program transformation, sets of rules presented here are convergent (i.e. finitely terminating and confluent) rewriting systems. These rewriting systems are the result of the Knuth-Bendix procedure applied to a set of equations. The equations are valided by the algebra of functional programs. We use the implementation of the Knuth-Bendix procedure in the system REVE. If REVE is applied to a set of equations and if it does not fail, then it returns a convergent rewriting set of rules. With such a rewriting system, the task of transforming a program is reduced to rewrite it until we get its normal form. Thus we propose a set of valid equations and we discuss how convergent rewriting systems can be generated using REVE.
Recovery scenario for a DB/DC system
Authors: Lawrence A. Bjork
Venue: Proceedings of the ACM annual conference (1973)

Previously developed sphere-of-control (SOC) concepts are used to develop a scenario for post-process recovery. An information structure provides the recovery boundary around the effects of the usage of a resource. Rules for building this structure are addressed, and the capability for searching backward in time is identified to determine the source of error and possible recovery strategies.
An efficient method for the numerical solution of one-phase Stefan problems
Authors: L. F. Shampine, R. J. Thompson
Venue: Proceedings of the SIGNUM meeting on Software for partial differential equations (1975)

The purpose of this talk is to discuss an implicit numerical method for the solution of a class of Stefan problems. The method is efficient in the sense that, although the location of the moving boundary is determined by solving a sequence of problems, the amount of computation done to advance the solution one time step is little more than would be required if the boundary were fixed.
Relational data management implementation techniques
Authors: V Kevin M. Whitney
Venue: Proceedings of the 1974 ACM SIGFIDET (now SIGMOD) workshop on Data description, access and control (1974)

The use of relations as a model of information stored in large data bases has several significant advantages over other methods of data description. It is often, however, criticized as difficult to implement efficiently. In this paper, some of the pros and cons of the relational model are discussed. The concepts of modeling information structures with data is illustrated with the CODASYL DBTG and the relational models. Then the main concepts of a relational data management system are presented based on current implementations. The advantages and disadvantages of the relational model is discussed in the light of these implementations. By presenting the theories of relational data management in a context of specific system implementations, the advantages and disadvantages of this data organization will be more clearly understood.
Design of the real-time executive for the Univac(r) 418 system
Authors: John Michael Williams
Venue: Proceedings of the 1966 21st national conference (1966)

The UNIVAC 418 system hardware The 418 is a small- to medium-scale real-time computer announced to the general public in September of 1964. It is available in two models, identical except for storage speed (two or four microseconds). Storage and registers
A new approach to programmer aptitude testing
Authors: Charles J. Testa
Venue: Proceedings of the eleventh annual SIGCPS computer personnel research conference (1973)

During the decade of the 1960's many organizations used aptitude tests to screen computer programmer applicants.(1) The results of these tests were claimed to be valid and reliable indicators of programmer potential. As such, they were often the sole criterion on which employment decisions were based. Although the content of available tests varied, most tests were oriented towards determining an individual's ability by using measures such as letter series, number series, and arithmetic reasoning. In more recent years test batteries have been developed which include aptitude, intelligence, and interest tests to provide a more thorough examination of the applicant. Inherent in this testing process, however, is a cultural and language bias. Recent state and federal legislation has forced employers to carefully examine personnel evaluation procedures to guard against this problem. Research is now being directed toward the development of tests which can correctly be used to assist in the selection process.
Application of simulation to the banking industry
Authors: K. L. Slepicka, G. A. Spohrer
Venue: Proceedings of the 13th conference on Winter simulation - Volume 2 (1981)

Computer simulation is examined as a tool to evaluate how the addition of an on line teller terminal system (OLTTS) will affect customer service in a bank. The St. Joseph Bank and Trust Company, in South Bend, Indiana, will be used as a case study bank to provide real data for this study. Before running the simulation model, industrial engineering techniques were used to gather and analyze the data which was needed as input to the model. To analyze the present performance of the bank's tellers, time studies were used to determine customer service times. Pre-determined motion-time data from a bank which installed an on line system was used to estimate customer service times once the OLTTS was added. Statistical techniques were used to reduce the data to several normal distributions. The following section discusses why computer simulation is used and presents an overview of the languages available. The actual model is discussed next, followed by a discussion of other possible uses of computer simulation techniques to solve problems in banking.
Context Filters for Document-Based Information Filtering
Authors: K. R. K. Murthy, S. S. Keerthi
Venue: Proceedings of the Fifth International Conference on Document Analysis and Recognition (1999)

In this paper we propose a key phrase-sense disambiguation methodology called ``context filters" for use in key phrase based information filtering systems. A context filter finds whether an input key phrase has occurred in the required context. Context filters consider various factors of ambiguity. Some of these factors are special to information filtering and they are handled in a structured fashion.The proposed context filters are very comprehensible. Context filters consider varieties of contexts which are not considered in existing word-sense disambiguation methods but these are all needed for information filtering. The ideas on context filters that we report in this paper form important elements of an Instructible Information Filtering Agent that we are developing.
A system for the solution of initial and two-point boundary value problems
Authors: Arthur C. Norman
Venue: Proceedings of the ACM annual conference - Volume 2 (1972)

A programming system is described which accepts as input a formal description of a problem in ordinary differential equations and produces as output a program for solving that problem. It is capable of accepting arbitrary order, non-linear coupled sets of equations with initial conditions or the most general boundary conditions. Internal to the system is a package for performing symbolic algebra, and use is made of this in generating a program to do numerical work appropriate to the particular set of equations presented. This use of an algebra system thus makes sophisticated and powerful numerical techniques available to the non-specialist programmer.
Circuits for multiple valued logic&mdash;a tutorial and appreciation
Authors: Kenneth C. Smith
Venue: Proceedings of the sixth international symposium on Multiple-valued logic (1976)

It has been stated often in the past that practical acceptance of multi-valued logic awaits the development of suitable electronic means for fabricating a sufficiently powerful and general purpose logic. Though the search for such means has proceeded in parallel with every other development in the multivalued field in the last thirty years, there is reason to believe that the pace is quickening and that success, by some measure, is sensibly upon us. In support of this contention I offer in a general sense the all-pervasive presence of the integrated circuit industry in which formerly inconceivable complexity is a current low cost reality. It is important for the multi-valued discipline that each of the practitioners of its various facets are truly aware of, and interact with, the developments of the others. With this in mind we will begin an overview of electronic circuitry whose goal it is to enhance the appreciation of non-specialists in the rapid technological development which surrounds them. We begin by reviewing some very basic properties of electronic devices, introduce a convention for drawing circuits which is a considerable aid in communicating and understanding, proceed to describe and interrelate global properties of available active (transistor) devices, then finally practice these basics on circuits typical of those you will see increasingly in the literature.
A comparison of software assurance methods
Authors: Marilyn S. Fujii
Venue: ACM SIGSOFT Software Engineering Notes (1978)

Several methods are currently employed by software developers to improve software quality. This paper explores the application of three of these methods: quality assurance, acceptance testing, and independent verification and validation. At first glance these methods appear to overlap, but a closer evaluation reveals that each has a distinct objective and an established set of procedures. The purpose of this paper is to clarify the role of each of these methods by examining their scope, organization, and implementation in the software development process.
Data link control procedures: What they are and what they mean to the user
Authors: Hubert F. Ickes
Venue: Proceedings of the 1967 22nd national conference (1967)

The United States of America Standards Institute (USASI) formerly known as the American Standards Association) is the national standards body in the United States. From its modest beginning in 1918, USASI has grown into a national federation of more than 138 technical societies and trade associations that are either member bodies or associate members. In addition, USASI has some 2200 company members. Within USASI, there are three sectional committees that work in the broad area of data processing standards. These are X3 (Computers and Information Processing), X4 (Office Machines), and X6 (Computers and Related Equipment). Each sectional committee usually has several subcommittees operating under its direction. For example, as shown in Figure 1, Sectional Committee, X3, has eight subcommittees which are X3.1 (Optical Character Recognition), X3.2 (Codes and Input/Output), X3.3 (Data Transmission), X3.4 (Common Programming Languages), X3.5 (Vocabulary), X3.6 (Problem Definition and Analysis), X3.7 (Magnetic Ink Character Recognition), and X3.8 (Data Elements and their Coded Representation). Subcommittee X3.3 (Data Transmission) has the following work scope: &ldquo;Determine and define the operational characteristics governing the performance of digital data generating and receiving systems combined with communications systems.&rdquo; To accomplish this work scope, X3.3 has six task groups operating under its direction (see Figure 2). One of these task groups, X3.3.4 (Control Procedures) is developing what are known as Data Link Control (DLC) procedures. These procedures will specify how data communications can be controlled by using the communications control characters provided in the coded character set known as the United States of America Standard Code for Information Interchange (USASCII).
An optical residue arithmetic unit
Authors: Alan Huang
Venue: Proceedings of the 5th annual symposium on Computer architecture (1978)

The residue number system is used to partition addition, subtraction, multiplication, or integer polynomial transforms into several simpler calculations, each of which can be processed in parallel with complete independence. These segments are computationally simple such that all the arithmetic interactions can be enumerated as mathematical mappings. By routing signals through various mappings a number may be encoded into residue form, processed in various ways, and eventually decoded back to a normal number system. The signals may be routed in a manner to reflect calculations involving a plurality of operands and operations. By routing several signals in close sequence calculations may be pipelined. By routing different types of signals independently several calculations may be multiplexed. Detection of abnormalities in a segment's signal may be used to exclude the segment from the decoding process, thus preserving the correctness of the calculations. By reducing and conveniently deferring the signal detections necessary, a greater variety of phenomena may be considered for digital computation. Optical implementations are of particular interest.
Human relations, scientific management, and human factors research
Authors: Philip Kraft, David Strauss
Venue: Proceedings of the 1982 conference on Human factors in computing systems (1982)

Human Factors research is concerned primarily with minimizing unpredictable behavior in computer-based systems. Much Human Factors research stresses simplification of computer-based work into discrete, standard, and measurable sub-tasks. The performance of these elemental work-fragments can then be compared against &ldquo;expert&rdquo; performance times. In addition to increased worker output, simplified and standardized jobs allow managers to control work more completely. Similarly, standardized jobs usually allow the use of less-skilled labor. This aspect of Human Factors research is an outgrowth of Scientific Management (&ldquo;time and motion&rdquo; studies) and, ironically, the management theories of Charles Babbage, the 19th-century inventor of the computer. Scientific Management and Human Factors research share a number of important assumptions. For the most part, these assumptions have not been subjected to careful scrutiny. In time, they may prove the source of significant problems for both systems designers and users.
Monitoring Motorway Infrastructures for Detection of Dangerous Events
Authors: G. L. Foresti, B. Pani
Venue: Proceedings of the 10th International Conference on Image Analysis and Processing (1999)

In this paper, a visual-based surveillance system for monitoring motorway infrastructures is presented. The system receives in input a sequence of color images and makes out an interpretation of the observed scene according to a set of possible events previously defined.The considered events are divided into four classes and range from normal situations (any object is present on the surveilled overpass) to very dangerous situations (persons performing harmful behaviors). Experimental results are presented on a long real image sequence containing two persons with suspicious behavior moving into a limited area of a motorway overpass.
Secure application environments in APL\3000
Authors: Alan M. Marcum
Venue: Proceedings of the international conference on APL: part 1 (1979)

Various mechanisms have been proposed for implementing secure applications (that is, a function or package of functions over which the author can maintain total control during execution, and whose possibly sensitive information can be protected). This paper describes another set of tools, a &ldquo;Spaghetti Stack&rdquo; with &ldquo;Exception Handling,&rdquo; for implementing secure applications. (A Spaghetti Stack is a means for capturing a State Indicator execution point, retaining the state, and executing from it later.)
Continuing education in information system development
Authors: Russell M. Armstrong
Venue: Proceedings of the ACM annual conference - Volume 1 (1972)

Key issues in continuing education for systems staffs involved in the development of in formation systems are identified and discussed. Perspective is provided by reference to the curriculum development efforts of the ACM Curriculum Committee on Computer Education for Management. Recommendations are made for efforts towards improving the field of counting education.
A microprogrammed data communications procedure controller
Authors: D. Dromard, O. Gibergues
Venue: Conference record of the 6th annual workshop on Microprogramming (1973)

This paper describes a microprogrmmaed data communications management. It is divided into three sections.1) presentation of the information structure and how current procedures work in data communications. 2) design and architecture of a microprogrammed controller executing the previous functions, avoiding most of software interventions during a transmission. 3) description of the interface between the software communications and the controller on the one hand and the relations between the different parts of that controller on the other hand. This architecture permits the use of low cost microprocessor and hardware and can use a standard channel for data communications.
Computer system models: An introduction
Authors: Herb Schwetman
Venue: Proceedings of the 1981 ACM SIGMETRICS conference on Measurement and modeling of computer systems (1981)

A system model is a tool used to predict system performance under changing conditions. There are two widely used modeling techniques: one based on discrete event simulation and one based on queuing theory models. Because queueing theory models are so much cheaper to implement and use, as compared to simulation models, there is growing interest in them. Users are developing and using queuing theory models to project system performance, project capacity, analyze bottlenecks and configure systems. This talk uses an operational analysis approach to develop system models. This approach, as presented in Denning and Buzen [1], provides an intuitive basis for analyzing system performance and constructing system models. Very simple calculations lead to estimates of bounds on performance - maximum job throughput rates and minimum message response times. The emphasis is on gaining an understanding of system models which reenforces intuition, not on mathematical formulae. Several examples are included. References to other works and publications are provided. Application areas and limitations of modeling techniques are discussed.
MICROSIM: A microinstruction simulator for teaching microprogramming and emulation
Authors: Francis P. Mathur
Venue: Proceedings of the 10th annual workshop on Microprogramming (1977)

This paper describes in the format of a user's manual, along with an example, a program for teaching microprogramming and emulation. This program simulates at the microinstruction set level the architecture of a 16-bit microprogram-controlled minicomputer. This simulator, as an instructional vehicle, has been successfully used in a software engineering laboratory adjunct to a regular course in microprogramming and computer architecture.
Effects of address interleaving on multiprocessor instruction - accessing memory interference
Authors: Peter T. Rux
Venue: Proceedings of the 1st symposium on Simulation of computer systems (1973)

In the classical multiprocessor configuration with a set of processors accessing a common set of memory modules, there is a loss in processor efficiency due to interference among the processors when accessing instructions or data. GPSS (General Purpose Simulation System) simulation experiments have been run to evaluate the effects of various address interleaving strategies on instruction-accessing interference. The important parameters in these experiments are the number of processors and memory modules, the degree of address interleaving, and the average consecutive instruction sequence length. The results support the following conclusions: (1) Address interleaving can substantially reduce instruction-accessing memory interference. (2) The amount of improvement increases with either a higher interleaving factor or a longer average consecutive instruction sequence length. (3) For minimum interference, the interleaving factor need not be larger than the average consecutive instruction sequence length.
Information Wheel - a framework to identify roles of information systems
Authors: C. S. Sankar
Venue: Proceedings of the 1984 annual conference of the ACM on The fifth generation challenge (1984)

In this paper, the roles of different information systems in an organization are identified using a framework called &ldquo;Information Wheel&rdquo;. An information wheel is similar to a physical wheel in that it consists of a hub, spokes, rim and a tire. The parts of a physical wheel are made of material such as steel, rubber and plastics. The parts of the information wheel are made of different information systems.
A relational data base machine: First step to knowledge base machine
Authors: Kunio Murakami, Takeo Kakuta, Nobuyoshi Miyazaki, Shigeki Shibayama, Haruo Yokota
Venue: ACM SIGARCH Computer Architecture News (1983)

The Japan's Fifth Generation Computer System project is divided into three stages. In the first three-year stage, a working relational data base machine is developed for a software development support system to be used in the second stage and also for an experimental system which provides a research tool for the knowledge base machine. The paper briefly describes the concepts and architecture of the relational data base machine named &ldquo;Delta&rdquo; which is currently under development at ICOT.
Combining dimensionality and rate of growth arguments for establishing lower bounds on the number of multiplications
Authors: Zvi M. Kedem
Venue: Proceedings of the sixth annual ACM symposium on Theory of computing (1974)

In this paper we describe a new method for establishing lower bounds for the number of multiplications and divisions required to compute rational functions. We shall start by reminding the reader of some standard notations.
Is APL a programming language or isn't it?
Authors: Alan J. Perlis
Venue: Proceedings of the international conference on APL (1981)

It is a matter of both pride and concern to APL programmers that APL appears to develop in ways different from all other programming languages. This talk will attempt to answer why this is so. Comparisons will be made between the directions of APL development and those of the ALGOL family and LISP.