ppxscal/embedding_network huggingface dataset:
Compile time syntax analysis of APL programs
Authors: Zvi Weiss, Harry J. Saal
Venue: ACM SIGAPL APL Quote Quad (1981)

We present a technique for the compile-time determination of the syntactic attribute of names essential for the development of a compile-time parser for APL. The method is applicable to a large class of APL programs namely, programs which do not utilize certain features of the language allowing dynamic changes in the syntactic meaning of program statements. Empirical evidence supports the hypothesis that the restricted APL language encompasses almost all existing APL code.
Vector representation of switching and three-valued functions
Authors: Ytzhak Levendel, Melvin A. Breuer
Venue: Proceedings of the eighth international symposium on Multiple-valued logic (1978)

In this paper we present a new vector representation for switching functions, where two or three-valued logic systems are employed. Using this representation, rules for carrying out numerous operations are presented such as vector AND, OR and complementation; Boolean difference; vector reduction; and substitution of 0, 1 or u for the variables. Hence complex operations classically carried out over large Boolean expressions can now be more easily carried out using simple algorithms which operate over the components of these new vector representations.
Reliability experience with Chi/OS
Authors: W. C. Lynch, J. W. Langner, M. S. Schwartz
Venue: Proceedings of the international conference on Reliable software (1975)

The Chi/OS operating system, the latest large scale software effort of Chi Corporation, has had an excellent reliability record since its installation in November, 1973. Although the system design is vital to the reliability of Chi/OS, several environmental factors are equally vital. After a brief presentation of the substantial work load supported by Chi/OS, this paper deals with those environmental factors which contribute to the reliability of the software.
Architectural support for system protection (Recent Results)
Authors: Eduardo B. Fernandez, Rita C. Summers, Charles D. Coleman
Venue: Proceedings of the 3rd annual symposium on Computer architecture (1976)

A set of architectural extensions, involving hardware/software interaction, is proposed to constrain the execution-time behavior of application and higher authority programs, running in a CPU of the type of IBM System 370. The extensions consist of the addition of a new state to the previous supervisor and problem states enforcement of disciplined transition between states, hardware distinction of four data types, and a set of rules that enforce the structure of processes operating in this environment. Application of the extensions to a shared data base shows that the protection of the operating system under which it runs can be enhanced significantly, with respect to errors or attacks from the users of this data base.
A new look at logic synthesis
Authors: John A. Darringer, William H. Joyner,  Jr.
Venue: Proceedings of the 17th Design Automation Conference (1980)

Despite many attempts to generate hardware implementations automatically from functional specifications, the literature does not record any commercial success. Previous efforts have dealt primarily with technology-independent primitives and have emphasized circuit minimization. However, larger scales of integration have made other design requirements and technology restrictions as important as circuit count, and have increased the cost of making an engineering change. Thus it is becoming increasingly important to insure that initial chip designs are correct. This paper outlines an investigation into the feasibility of logic synthesis in this new context. A system is described which will produce a naive implementation automatically from a functional specification, and then will interact with the designer, allowing him to evaluate it with respect to these many factors, and to improve it incrementally by applying local transformations until it is acceptable for manufacture. The use of simple local transformations will insure correct implementations, will isolate technology-specific data, and will allow the total process to be applied to larger VLSI designs. This approach has been tested on the design of a single chip with encouraging results. A prototype synthesis system is now being used to perform further experiments.
Supervision in MIS: A call for research
Authors: Robert P. Bostrom, G. Nicholas Hopkins
Venue: The Proceedings of the Twentieth Annual Computer Personnel on Research Conference (1983)

The problems currently faced by Information Systems managers are well-known. Frequently mentioned are personnel turnover, applications development backlogs, employee dissatisfaction, and low productivity. This paper suggests a link between these pervasive IS problems and the quality of supervision received by IS workers. Its primary purpose is a call for research on supervision in Information Systems.
Modeling a production system in a recessionary environment
Authors: Edward C.Y. Lai, Donald E. Schacht
Venue: Proceedings of the 14th annual symposium on Simulation (1981)

The design of an automatic overhead storage and conveyor system is discussed in this paper. The problem centers on the introduction of a modern material handling system into an existing manufacturing facility. Simulation was originally premised on a production schedule of 25,000 computer systems per day. The value of simulation was demonstrated when recessionary trends reduced initial production projections by 40%.
A flexible approach to teaching FORTRAN
Authors: Thomas C. Richards
Venue: Proceedings of the ACM annual conference (1973)

The demand by students from all academic disciplines to obtain a basic knowledge of a computer programming language is increasing at an exponential rate on most university campuses. The Systems Analysis Department at Miami University is currently teaching approximately eighteen sections of introductory FORTRAN programming each school year. A concerted effort is now being undertaken in an attempt to design instructional materials and methods which will allow a gross reduction in the teaching load generated by this growing demand. The purpose of this paper will be to discuss the current status of this research effort at Miami University. The objective of this research is to determine if introductory FORTRAN can be taught with little or no emphasis on the lecture recitation mode of instruction. The author outlines the experimental methods he will be using in a controlled experimental approach during the coming school year.
A new look at ALTRAN
Authors: W. S. Brown
Venue: Proceedings of the 1975 annual conference (1975)

This paper presents an overview of the principal characteristics of the ALTRAN language and system for symbolic algebra, indicating how these characteristics arose from the original design objectives set forth in the autumn of 1968. Some related mathematical problems and some recent applications are also discussed. Fortunately, the objectives of the ALTRAN project were few enough and simple enough to permit progress by a small group, yet numerous enough and complex enough to make a great many issues of contemporary computer science and mathematics relevant. While the system more than fulfills our main objective of providing an efficient tool for massive elementary algebra, it also provides context, motivation, and guidance for research on a wide range of fundamental topics. In some cases this work has already had a major impact, while in other cases exciting concepts are just beginning to take shape.
Job shop heuristics and statistical inference in a taxicab simulation
Authors: Tasker Generes
Venue: Proceedings of the second conference on Applications of simulations (1968)

A simulation of the taxi service system of the University of California Lawrence Radiation Laboratory (UCLRL) was undertaken to investigate (without disrupting normal operations) ways of modifying the operations of the existing system which would result in substantially better service at no great additional cost. The successful achievement of the above objective resulted from the recognition of the close relationship between job shop scheduling and the decision-making problem of UCLRL's taxi service system; and the applicability, therefore, of some of the rules and heuristics employed in job-shop scheduling. GPSS III was used to model the proposed system, rules and heuristics because it readily permitted the formulating of complex models. Although GPSS flexibility allowed accurate modeling of the majority of the system, GPSS approximations were still necessary to represent the distribution of arrivals. To defend the independent Poisson distribution a statistical inference study was used to establish that the model's distribution was robust with respect to the effects of the actual distribution of arrivals. A brief description of UCLRL is necessary prior to any further discussion of how the simulation study was particularly applied.
Preventing the plagiarism of programming assignments (Panel Discussion)
Authors: Darrell E. Criss Clinton P. Fuelling Darryl E. Gibson Jerry P. Harshany Betty W. Hwang Tseng-Yuh Lee
Venue: ACM SIGCSE Bulletin (1982)

Plagiarism on programming assignments, particularly in lower-level computer classes, has been a problem of considerable concern. We suspect that the strongest contributing factor to the increase in this kind of cheating is the computing profession's reputation for being able to offer such a high-salaried positions. Students are literally clamoring to get into computer classes, partly with the hopes of securing high-paying jobs after graduation. The competition is keen in these computer classes, the computer departments frequently having to apply increasingly tough standards in order to thin out the ranks. Therefore, the strong desire to get an attractive job, coupled with the fear of failing computer courses seems to bring out the worst in many students, and they resort to cheating. The teaching staff naturally reacts to this problem by devising all sorts of methods for detecting and preventing instances of cheating.
LINUS: A structured language for instructional use
Authors: John D. Woolley, Leland R. Miller
Venue: ACM SIGCSE Bulletin (1974)

One of the crucial decisions in organizing a first course in computer science is the choice of a programming language. Although there is considerable variance of opinion as to what the ideal language should be, two main approaches can be delineated. The first approach stresses the necessity of learning the dominant scientific language, which in the Americas amounts to a vote for Fortran (2). The practicality of this choice is as indisputable as the awkwardness of the syntax of that language. The alternative view stresses the importance of the program structure in developing a sound sense of &ldquo;algorithmic thinking&rdquo;. Proponents of this view would suggest Algol W (4) or perhaps Pascal (5). We contend that both approaches have important advantages. This paper explores an approach which attempts to maximize the benefits of both.
Initial placement of gate arrays using least-squares methods
Authors: John P. Blanks
Venue: Proceedings of the 21st Design Automation Conference (1984)

It is known [1] that the optimal placement of devices on a carrier is NP-complete. So algorithms are forced to rely on heuristics in order to generate placements which are of high quality even if not globally optimal. This paper proposes the use of a metric which is the sum of the squares of the lengths of connections, for which a globally optimal assignment can be derived when overlapping components are ignored. A second placement phase maps this into a non-overlapping placement on the carrier while perturbing the derived placement as little as possible. This is essentially the metric used in [4] although not explicitly stated. However, [4] does not deal with the problems of fixed devices, IO's and other constraints which are important to VLSI design. The current paper seeks to incorporate these constraints into the model from the beginning.
A digital system modeling philosophy and design language
Authors: Mehmet B. Baray, Stephen Y. H. Su
Venue: Proceedings of the 8th Design Automation Workshop (1971)

With the increasing complexity of digital systems, a new approach to system decomposition and modelling must be developed. Such an approach must not only permit a system to be described in a modular fashion, but the basic system modules must be able to be decomposed to allow a precise description of the module function. In this paper, a modelling philosophy and language are presented which permit the system designer to: (1) specify the system design in a hierarchical, modular fashion; (2) describe the function of each module by independently specifying the structure and the control function of the module; (3) build arbitrarily complex structures and control functions through the use of macro like definitions; and (4) handle the problem of specifying complex concurrent control functions in a straight forward and unambiguous manner. Examples are used throughout the paper to clarify the semantics of the language. A complete unit design and a Backus Normal Form (BNF) specification of the language syntax are presented.
A digital signal processor for real time generation of speech waveforms
Authors: Glen S. Miranker
Venue: Proceedings of the 5th annual symposium on Computer architecture (1978)

The system for generation of human quality speech from unrestricted English text is under development at MIT. One component of the system is the computationally intense task of converting a parameter stream to a digital speech waveform. This is done using a computational model of the human vocal tract. Largely due to the amount of computation done in this synthesis, the overall system runs much slower than real time. A medium speed, special purpose, digital signal processor has been constructed to simulate the resonant characteristics of the human vocal tract, and so allow the computation to be done in real time. We describe some of the architectural details of the processor, and its usefulness in the task of speech generation.
Scalar Seprent, Processor for APL
Authors: Yves C. Fav@@@@@@@, Louis P.A. Fohichand
Venue: Proceedings of the sixth international conference on APL (1974)

A &ldquo;Scalar Seprent Processor&rdquo; is defined. for the translation of those parts of APL expressions which contain moradic and dyadic functions. In present version of APL the execution of a simple sub-expression is triggered as soon as a function and its @@@@@@@@@@@ are found. In the Scalar S@@@ent approach the tri@@@@@@@ is delayed, it a controlled fashion, in order to reduce the overhead in the translation and execution of APL expressions.
Designer's Workbench: Delivery of cad tools
Authors: R. A. Friendenson, J. R. Breiland, T. J. Thompson
Venue: Proceedings of the 19th Design Automation Conference (1982)

Designer's Workbench (DWB) is a systematic approach to design aids integration that overcomes most of the barriers that frequently restrict the use of those aids. In combination with the UNIX* operating system [1,2], DWB manages both the flow and the form of data that is required by application programs that reside on various computer systems. The techniques described in this paper enable the Designer's Workbench development team to respond quickly to electrical and physical designers' needs. Because of this ability to respond quickly to users' needs Designer's Workbench has had uncommon growth and acceptance in the user community.
A result on the relationship between simple precedence languages and reducing transition languages
Authors: James B. Morris
Venue: Proceedings of the second annual ACM symposium on Theory of computing (1970)

Two of the more recently published systems for the efficient parsing of subclasses of deterministic, context-free languages are the backwards-deterministic, (or unambiguous, as they were originally called) simple precedence languages due to Wirth and Weber, and the reducing transition languages due to Eickel, Paul, Bauer, and Samelson. The main result demonstrated in this paper is that the backwards-deterministic, simple precedence languages are a proper subclass of the reducing transition languages. The reducing transition languages are certainly a subclass of the deterministic, context-free (LR(1)) languages but it is not known if this inclusion is proper. The major complaint against the reducing transition languages is the large amount of memory required when this technique is utilized with large grammars, such as the ALGOL 60 grammar. With memory costs and physical memory sizes decreasing at a rapid rate, it is very possible that this disadvantage will not exist in the not-too-distant future. When this becomes true, the advantage of reducing transition languages, i.e., the relatively small amount of time required for their parsing, may result in their significance being substantially increased. Thus it is of some import that we study their relationship to other languages. The main result is based on two theorems: (1) if G is a backwards-deterministic simple precedence grammar, then G is a reducing transition grammar; and (2) the language L1 &equil; {a0n1n2m&brvbar;m,n &ge; 1} &ugr; {b0n1m2n&brvbar;m,n &ge; 1} is a reducing transition language but is not a backwards-deterministic simple precedence language.
Procedures for submission and processing of jobs
Authors: Bernard A. Galler
Venue: Proceedings of the 1964 19th ACM national conference (1964)

The procedures considered here assume a fairly large-scale operation, without the individual typewriter-like consoles which many computer installations are now contemplating. Actually, with appropriate modifications, these procedures should serve equally well in any installation which has a -and-ldquo;closed-shop operation-and-rdquo; with respect to the actual running of the computer. The objectives to be met here are (1) fastest possible turn-around time, (2) maximum safety of decks and privacy of information, and (3) smooth flow of materials, such as cards, paper, etc., throughout the entire process. It is commonly accepted (though there are still some dissenters), that the most efficient use of a large computer, and the best service for the majority of people who are submitting Jobs, is obtained by using a well-organized executive (or monitoring) system to schedule and otherwise control the sequencing of Jobs through the computer. Usually, but not necessarily always, such a system is used in an invlronment in which a satellite computer handles input and output matching for the system, such as card-to-tape, tape-to-card, and tape-to-printer operations, so the master computer can more nearly match its input-output speeds (from tape) with its internal speed.
An attribute-based file organization for a relational database
Authors: Jay-Louise Weldon, Shamkant B. Navathe
Venue: Proceedings of the 1976 annual conference (1976)

A file organization based on the work of Wong and Chiang (12) may be used to store a relational database which comprises several relations. In the proposed storage structure, keywords are defined on domains (other than primary key domains) and used to divide the file into disjoint subsets called Boolean atoms. Tuples in each Boolean atom are stored contiguously and identifiers for each atom are stored in a directory. The actual construction of the atom directory and the storage of the tuples are presented with an example. Procedures for processing queries against the proposed structure are illustrated using sample queries from SQUARE (1). A modification of the structure to accommodate ranges of values as keywords is also indicated.
Diagnostic And Computational Reconfiguration In Multiprocessor Systems
Authors: F. Saheban, A. D. Friedman
Venue: Proceedings of the 1978 annual conference (1978)

Diagnosis and reconfiguration is concerned with the detection and location of faulty units and the minimization of the effect of faults within a digital system. This topic is motivated by the need for highly available systems that can continue essential operation, perhaps with degraded performance, when hardware failures occur. In recent years there has been a great progress in development of large-scale integrated (LSI) and microcomputer technology. This led to the consideration of systems of complex elements, such as networks of microprocessors. Today, multiprocessor structures are not only feasible but also highly attractive as cost-effective computer structures. Having a multiplicity of independent processors raises the opportunity for making the system self-diagnosable through interprocessor communication. Also the homogenity of the processors make it possible that after the occurrence of faults the system can reconfigure so that the effect of faults is minimized. In this paper we consider techniques for the design of systems which incorporate diagnostic and computational reconfiguration.
GASP IV simulation model for the composites and bonding production facility
Authors: Darrell W. Starks
Venue: Proceedings of the 10th conference on Winter simulation - Volume 2 (1978)

This article describes the operation of the composites and bonding production facility of McDonnell Aircraft Company in St. Louis. It explains why a simulation of this area was needed, gives an overview of the simulation, and describes how the industrial engineers use the results of the simulation.
Forgetting in an association memory
Authors: Edward A. Feigenbaum, Herbert A. Simon
Venue: Proceedings of the 1961 16th ACM national meeting (1961)

Though the phenomenon of forgetting is an everyday and commonplace experience of human intelligent systems it has been inadequately treated by theorists of intelligent systems (human and computer). On the one hand there is the stark behavioral fact that humans who were, at one point in time, able to respond in some particular way to some particular stimuli are, at a later time, no longer able to respond to those stimuli. On the other hand, there are the ever-intriguing experiences, shared by us all, that humans are able to recall stimuli whose age-in-memory is of the order of many years and that a person's technique of association can be pressed into the service of retrieving &ldquo;long lost&rdquo; information from his memory (sometimes quite consciously!) Furthermore, some modern experiments (4), involving the implantation and stimulation of microelectrodes in the brain, have suggested that experiences far removed in time can be evoked in great informational detail by appropriate stimulation of barin tissue.
An investigation of descriptor oriented architecture
Authors: Terry A. Welch
Venue: Proceedings of the 3rd annual symposium on Computer architecture (1976)

A computer architecture is proposed which uses a hardware implemented descriptor system to provide facilities for explicit data typing, memory relocation, and access protection at the data element level. The problem of having to fetch descriptors for every operand access is overcome by storing descriptors in small fast memories of various types. The resulting machine runs simple languages (such as FORTRAN) as fast as conventional architectures, and offers significant speed improvement for languages using complex data types (such as data management systems). The cost of the descriptor storage hardware is shown to be modest, so this architecture would be suitable for machines as small as a large minicomputer.