ppxscal/embedding_network huggingface dataset:
Interactive computing and the manager-machine interface
Authors: Art Guthrie
Venue: Proceedings of the eighth international conference on APL (1976)

A survey of managers in the Greater Vancouver, B.C. region revealed a predicted low level of manager-machine interaction. Lack of manager-oriented computer languages and the process-orientation of most computer data processing departments were identified as the two key constraints to the manager-machine interface. An interactive model for a managerial application was developed in APL and it was determined that APL was not a suitable language for managerial interactive useage.
Word processor to mainframe links: Why, what, and how
Authors: Marcia L. Meyers
Venue: Proceedings of the 1st annual international conference on Systems documentation (1982)

Many development groups have a mix of standalone word processors and mainframe computers. The main computers may be manufactured by the company or purchased from another company, but they have one thing in common: programmers and engineers use them as vehicle machines for software and/or hardware development. Writers must document how the 'systems' work. For the purpose of discussion, we will assume that the mainframe systems are readily accessible to writers as well as engineers and programmers and that they are able to support a number of terminal users. The case study presented in the body of this paper is based on multiple main systems, each of which supports 30-40 terminal users, including writers, engineers, managers, and programmers.
The PDP-11: A case study of how not to design condition codes
Authors: Robert D. Russell
Venue: Proceedings of the 5th annual symposium on Computer architecture (1978)

This paper investigates a design weakness in the PDP-11 architecture, namely the condition code bits. Experience with the machine has demonstrated a number of &ldquo;traps&rdquo; for the unwary programmer stemming directly from an inconsistent and sometimes confusing scheme of condition code settings. This is particularly annoying in view of the otherwise clean architectural characteristics of the machine. A number of &ldquo;principles&rdquo; are proposed that would correct the deficiencies and could therefore be used as a guide for designing future machines. The paper also presents some measurements based on actual programmatic usage of the PDP-11 that question the validity of a condition code scheme as an efficient architectural technique.
Alternatives for on-line help systems
Authors: T. P. Kehler, M. Barnes
Venue: Proceedings of the 8th annual ACM SIGUCCS conference on User services (1980)

This paper reviews some existing possibilities for help systems and proposes a series of steps for improving the interactive interface to users. We consider a hypothetical environment of a predominantly time- sharing facility providing services to multiple campuses over a large geographical area with s small staff for training and user services.
Exponential lower bounds for restricted monotone circuits
Authors: L. G. Valiant
Venue: Proceedings of the fifteenth annual ACM symposium on Theory of computing (1983)

In this paper we consider monotone Boolean circuits with three alternations, in the order &ldquo;or&rdquo;, &ldquo;and&rdquo;, &ldquo;or.&rdquo; Whenever the number of alternations is limited to a fixed constant the formula and circuit size measures are polynomially related to each other. We shall therefore refer to this measure interchangeably as &Sgr;&pgr;&Sgr;-formula size or &Sgr;&pgr;&Sgr;-circuit size. We shall prove that any such circuit or formula for detecting the existence of cliques in an N-node graph has at least 2&Ohgr;(N&egr;) gates for some &egr; > 0 independent of N.
Integrated services data switching network
Authors: Kei-ichi Tsukada, Yutaka Yoshida, Ken-ichi Yukimatsu, Hirokazu Ohnishi
Venue: Proceedings of the sixth symposium on Data communications (1979)

In this paper, service integration of voice, data and facsimile communications is studied from the viewpoint of developing the data switching networks to integrated services networks which could handle various types of information transmission. First, requirements from the user's and carrier's points of view are described. Integrated services networks must handle various calls with different traffic characteristics and meet different service grades in accordance with each type of calls. Considering such environments, many network morphological alternatives are listed as regards data switching network integration and data-telephone network integration, and network functions associated with service integration and developed within or around data switching networks are explained. Last, two experimental systems are described as some approaches to integrated services data networks.
The Administration Decision Game: A simulation for developing planning skills in educational managers
Authors: Michael J. Murphy
Venue: Proceedings of the 10th conference on Winter simulation - Volume 2 (1978)

The Administration Decision Game, a flexible computer simulation which can be used to depict, study or teach decision approaches in educational management, has been developed to introduce administrators to quantitative thinking and planning awareness. The Administration Decision Game (ADG) inputs includes a set of school variables and certain system constraints. Administrative behavior is represented as symbolic actions or &ldquo;moves&rdquo;. Moves take place within the constraints defined for the system and are used to determine status, analyze data, and allocate resources. ADG simulates the educational process impacts. Specified as general outcomes are a set of student achievement scores. ADG derives from a generated data base, a computer model of instructional processes, and a set of analytic routines. System parameters, input as data, control random number based generating routines, and thus the size and character of the data base. The FORTRAN implemented model was developed so that, through a specified series of function parameters, scaling parameters, and weights, it is possible to alter the relationship between any pair of variables or any multivariate set. It is also possible to manage stochastic events by setting the percent of variance that will be tolerated in function calculations. Resident data display and analytic routines enable the player to determine system state at any given time, to compare system states at different times (e.g., after an intervention), or to &ldquo;discover&rdquo; relationships in the data base. This design facilitates developmental levels of interaction ranging from introduction of quantitative approaches through model description and prediction exercises, to model design itself.
A graphics-based programming-support system
Authors: H. P. Frei, D. L. Weller, R. Williams
Venue: ACM SIGGRAPH Computer Graphics (1978)

A programming support system using extended Nassi-Shneiderman diagrams (NSD) is described. The aim of the work is to develop techniques for improving the quality and cost of specifying, documenting and producing computer programs. NSD's can be executed interpretively or compiled to produce running code. The system implementation has begun and charts can be drawn on a variety of display devices. The system is being developed using the Picture Building System developed earlier.
Design, implementation, and evaluation of a Revision Control System
Authors: Walter F. Tichy
Venue: Proceedings of the 6th international conference on Software engineering (1982)

The Revision Control System (RCS) is a software tool that helps in managing multiple revisions of text. RCS automates the storing, retrieval, logging, identification, and merging of revisions, and provides access control. It is useful for text that is revised frequently, for example programs and documentation. This paper presents the design and implementation of RCS. Both design and implementation are evaluated by contrasting RCS with SCCS, a similar system. SCCS is implemented with forward, merged deltas, while RCS uses reverse, separate deltas. (Deltas are the differences between successive revisions.) It is shown that the latter technique improves run-time efficiency, while requiring almost no extra space.
PA3 a general-purpose, time-shared Problem Analysis language
Authors: D. G. Ebeling, E. G. Hurst,  Jr.
Venue: Proceedings of the third conference on Applications of simulation (1969)

A general-purpose, time-shared language for modeling and solving problems which exhibit uncertainty in the input variables is presented. The language is described in terms of some comparative measures of simulation systems. A simple example is worked to demonstrate the major features of the language. Examples of actual problems which have been solved are described to illustrate the breadth of possible applications.
A technology independent block extraction algorithm
Authors: F. Luellau, T. Hoepken, E. Barke
Venue: Proceedings of the 21st Design Automation Conference (1984)

Functional block extraction is a useful tool for layout verification of integrated circuits. In particular, it facilitates the network comparison problem by transferring it to a higher level of hierarchy. This paper describes a computer program called BLEX (Block Extractor), which is able to extract any given circuit block, e.g., gates, flip-flops, memory cells, differential amplifiers, Darlington circuits etc., from a SPICE-like network description. The algorithm is fully technology independent. The size of the blocks is not subject to any restrictions. Descriptions of the functional blocks having the same format as the network description are supplied by the user. The circuit to be examined results usually from a preceding circuit extraction. The extractor and BLEX are part of the layout verification system ALAS (ALayout Analysis System).
Information security issues in an APL application
Authors: Bill Hillman
Venue: ACM SIGAPL APL Quote Quad (1984)

This paper will describe various methods to secure an APL database application. Primary foci will be in the areas of &ldquo;physical&rdquo; protection, and in cryptographic techniques. To that end, distinctions will be made between &ldquo;data,&rdquo; and &ldquo;information.&rdquo; Because of those differences, specific methods will be offered which are appropriate for each modality of security. A brief set of examples will be included for the use of IBM's1 RACF2 (Resource Access Control Facility). Also, a description of a Public Key Cryptographic function, implemented in APL, will be offered. Finally, these will be combined into a database scenario, applicable to products like APLDI23 (APL Data Interface).
Electronically directed "focal" stereo
Authors: P. Burt, L. Wixson, G. Salgian
Venue: Proceedings of the Fifth International Conference on Computer Vision (1995)

A key to developing computationally efficient stereo vision is the incorporation of intelligent control. Stereo is most effective when it is able to "focus" its analysis on regions and details of a scene that are important to the task at hand, while avoiding less important regions and unnecessary detail. The paper describes two methods for electronically "focusing" stereo measurement through simple image pre-processing. The first allows measurement sensitivity to be adjusted. The second allows the shape of the 3D region in which measurements are gathered to be matched to the shape of surfaces in the scene.
Cross software development for microprocessors using a translator writing system
Authors: Massimo Ancona, Gabriella Dodero, Ercole Luigi Durante
Venue: Proceedings of the 4th international conference on Software engineering (1979)

This paper illustrates four experiences in cross software development for microprocessors. After a comparison among some programming techniques (high-level languages, macroprocessors, meta-assemblers and special purpose systems) a translator writing system has been used to implement a cross-assembler, a simulator, a microassembler and a cross compiler for a microprocessor, showing its great flexibility at a low cost. Each of the four applications is briefly described and compared with similar programs written using other techniques.
Architecture of a VLSI instruction cache for a RISC
Authors: David A. Patterson, Phil Garrison, Mark Hill, Dimitris Lioupis, Chris Nyberg, Tim Sippel, Korbin Van Dyke
Venue: ACM SIGARCH Computer Architecture News (1983)

A cache was first used in a commercial computer in 1968,1 and researchers have spent the last 15 years analyzing caches and suggesting improvements. In designing a VLSI instruction cache for a RISC microprocessor we have uncovered four ideas potentially applicable to other VLSI machines. These ideas provide expansible cache memory, increased cache speed, reduced program code size, and decreased manufacturing costs. These improvements blur the habitual distinction between an instruction cache and an instruction fetch unit. The next four sections present the four architectural ideas, followed by a section on performance evaluation of each idea. We then describe the implementation of the cache and finally summarize the results.
Two-place decomposition and the synthesis of many-valued switching circuits
Authors: D. M. Miller, J. C. Muzio
Venue: Proceedings of the sixth international symposium on Multiple-valued logic (1976)

Two-place decomposition is a technique where a many-valued function is reexpressed as a composition of three functions, two of which have at most two arguments. In this paper, the construction of sequences of two-place decompositions is considered. Taking a many-valued universal decision element as a basic building block, such a sequence represents a switching circuit realizing the initial function. A simple algorithm for constructing sequences of two-place decompositions is presented. This algorithm generates a sequence representing a 'good' circuit quickly rather than searching for an optimal solution.
A modular greatest common divisor algorithm for gaussian polynomials
Authors: B. F. Caviness, Michael Rothstein
Venue: Proceedings of the 1975 annual conference (1975)

In this paper the Brown-Collins modular greatest common divisor algorithm for polynomials in Z[x1,...,xv], where Z denotes the ring of rational integers, is generalized to apply to polynomials in G[x1,...,xv], where G denotes the ring of Gaussian integers, i.e., complex numbers of the form a + ib where a, b are in Z Under certain simplifying assumptions, a function is found that dominates the maximum computing time of the new god algorithm.
ACM SIGPLAN history of programming languages conference SIMULA language summary
Authors: W. R. Franta
Venue: ACM SIGPLAN Notices (1978)

SIMULA was conceived in the early sixties by Ole-Johan Dahl and Kristen Nygaard of the Norwegian Computing Center [3 ]. The most prevalent version of the language today is SlMULA-67 [1]. SIMULA was designed for system description and system simulation. A system in this case is a collection of interdependent elements with a common goal [4]. A natural way to simulate a system is to describe the life cycle scenarios of its elements. This approach combines the local attributes of elements and the protocols for inter-element communication into a single structure. Elements may exist for the duration of the simulation or be created and destroyed during its course.
Practical statistical analyses of simulation output data: The state of the art
Authors: Averill M. Law
Venue: Proceedings of the 13th conference on Winter simulation - Volume 1 (1981)

It has been our observation that in many simulation studies a large amount of time and money is spent on model development and programming, but little effort is made to analyze the simulation output data in an appropriate manner. As a matter of fact, a common mode of operation is to make a single simulation run of somewhat arbitrary length and then treat the resulting simulation estimates as being the &ldquo;true&rdquo; answers for the model. Since these estimates are random variables which may have large variances, these estimates may, in a particular simulation run, differ greatly from the corresponding true answers. The net effect is, of course, that there may be a significant probability of making erroneous inferences about the system under study. One reason for the historical lack of definitive output data analyses is that simulation output data are rarely, if ever, independent. Thus, classical statistical analyses based on independent identically distributed observations are not directly applicable. At the present time, there are still several output analysis problems for which there is no completely accepted solution, and the solutions that do exist are often complicated to apply. Another impediment to getting accurate estimates of a model's true parameters or characteristics is the computer cost associated with collecting the necessary amount of simulation output data. Indeed, there are situations where an appropriate statistical procedure is available, but the cost of collecting the amount of data dictated by the procedure is prohibitive. We expect this latter problem to become less important as the cost of computer time continues to drop. Our goal in this talk is to give a state-of-the-art treatment of statistical analyses for simulation output data, and to present the material with a practical focus which should be accessible by a reader having a basic understanding of statistics. The emphasis will be on statistical procedures which are relatively easy to understand and apply, have been shown to perform well in practice, and have applicability to real-world problems. Most of the material presented in this talk may be found in Law and Kelton (1981).
Subject and classification-code indices: Foreword
Venue: Proceedings of the 2nd annual computer science conference on Program information abstracts (1974)

These indices were prepared by Irwin A. Danto, Computer Science Department, Wayne State University with the aid of programs developed at The Ohio State University. The technique used for production of these indices is a variation of the Double-KWIC Coordinate Indexing Technique, various aspects of which have been described by A. E. Petrarca and W. M. Lay in J. Chem. Doc., 256(1969); ASIS Proceedlngs, 6, 277(1969); Proceedinss of the Seventh Annual National Colloquium on Information Retrieval, 155,(1970); and b y W. M. Lay in his PH.D. Dissertation, The Ohio State University, 1973. The index entries are derived from the titles of the conference papers augmented by one or more ACM classification codes (a dictionary of which appears at the end of these indices). There are two types of entries in the indices. One type, called a Double-KWIC index entry (type I in the example below), provides a greater specificity of retrieval when there are a large number of entries under a very general heading in the index. It is created by extracting the index word (or phrase) common to a number of titles exceeding some arbitrarily assigned threshold minimum (10 for the subject index) and posting it as a maifl term in the index. Each title containing such a main term is then treated as a permuted (rotated) subordinate entry so that a subordinate entry is created for each additional significant word in the title as illustrated for the type I index entry in the annotated example below. If the number of occurrences of a main term does not exceed the threshold then one regular KWIC index entry is created for each title containing that main term with the keyword (main term) appearing in a left-justlfied index column as illustrated for the type II index entry shown below. The treatment for the classification codes (see dictionary at the end of these indices) are the main terms, and a permutation threshold of 18 was used for that index.
Another approach to service courses
Authors: William Mitchell
Venue: Proceedings of the tenth SIGCSE technical symposium on Computer science education (1979)

This paper discusses the issues surrounding service offerings by Computer Science departments and focuses specifically on the first programming course. The approach described by the author has been developed to serve business students who seek an introduction to programming, but it applies also to most non-majors. The popularity of computer applications in the various disciplines as well as the widely publicized vocational opportunities in data processing induce ever more students to try their hand at programming. The embarrassment of riches in enrollment, however, brings with it multiple problems of staffing, machine resources, and curricular balance. Less obviously it also brings the pressure for instant success in serving this new population and thereby avoiding the splintering of programming education among interested disciplines, as happened with statistics instruction. Various viewpoints on solutions to these problems have been published, but little understanding of the nature and goals of the students involved has been evidenced. What follows is an explanation of a student-oriented approach to service course instruction which has been instituted at the University of Evansville(Mitchell 78).
Design and Implementation of a Real Time Information Storage and Retrieval System
Authors: Steven J. Karpen
Venue: Proceedings of the 1971 26th annual conference (1971)

Presented here is a paper on the &ldquo;Design and Implementation of a Real Time (On Line) Information Storage and Retrieval System&rdquo;. Guidance is given into the design and testing of a hashing function for a volatile set of alphanumeric keys. The interrelationship between the hashing function and the Information Storage and Retrieval (IS R) System is examined with respect to design criteria. Finally the design of the IS R System itself is presented in terms of an attempt to optimize the Input/Output (I/O) time versus disk and memory storage for a volatile set of records. Built into the IS R System design is the flexibility to optimize the systems performance under both the ideal and worst case hashing function design or performance. Emphasis, in the design, is placed on the I/O time required in updating, or inquiring, the file for a matched record retrieval. The following techniques were combined to form the original IS R System: data structures, directory (dictionary) concept, bit directories, link listing (chaining), hashing function, and minimization of disk head movement. The theory of the IS R System is derived in general and is applicable to a variety of applications as long as the application possess the following requirements: a highly volatile set of records, a real time (or on line) retrieval requirement, difficulty in designing (or choosing) a hashing function due to the volatile set of keys, and heavy activity on updating, or inquiring, the file. Detailed algorithms of the system design are presented for this purpose.
The data transform programming method: An example for file processing problems
Authors: C. J. Lucena, R. C. B. Martins, P. A. S. Veloso, D. D. Cowan
Venue: Proceedings of the 7th international conference on Software engineering (1984)

This paper presents a new programming method, called the data transform programming method. In particular, we present a specialization of data transform programming to deal with file processing applications. Direct comparison is made with Jackson's approach1 by the presentation of uniform solutions to problems that cannot be solved through his basic method. The new method consists of the application of data transformations to the abstract problem statement, following the formal notions of problem reduction and problem decomposition. Data transformations are expressed in programming terms through a basic set of data type constructors.