ppxscal/embedding_network huggingface dataset:
Internal audit: A user of computer-based information systems
Authors: James G. Vincent
Venue: Proceedings of the seventeenth annual computer personnel research conference (1980)

With the advent of data communications, computer-based information systems became more user-oriented. At Southeast Banking Corporation, internal auditors interact with information systems on a continuous basis via audit software. Auditors who participate in the development of new systems are employing &ldquo;preventive auditing&rdquo; techniques and are responsible for ensuring that adequate auditability/controlability features are built into the system. The auditor reviews systems in order to render an opinion of the adequacy of the organization's system of internal controls. This implies that the auditor is, in fact, a &ldquo;user&rdquo; of data produced by computer-based information systems.
MAFLOS-a generalized manufacturing system simulator
Authors: Kazuyuki Mitome, Susumu Tsuhara, Susumu Seki, Ken'ichi Isoda
Venue: Proceedings of the 6th conference on Winter simulation (1973)

Manufacturing systems are very complicated, so it is very difficult to grasp the actual behaviour of the manufacturing processes in detail. Even if we obtain a new idea of the scheduling algorithm or the process layout, it takes a long time until the idea is put into practical use, because it is difficult to prove the actual validity of the idea. The simulation technique is valid to solve this bottleneck. However, the conventional simulators lack the ability to simultaneously simulate the material flows and the control systems' behaviour. In this papers, the authors analyze the functions of manufacturing system in the following factors: (a) equipment layout (b) control system, (c) material, (d) operation. According to the analysis, we present a new type simulator which is named &ldquo;MAFLOS&rdquo. MAFLOS is characterized by the following features. (a) MAFLOS has seven kinds of unit-element to describe the equipment layout of the manufacturing system. The simulation model is therefore generated by combining these unit-element. (b) MAFLOS can simultaneously simulate the material flow and the control system behaviour.
A course in minicomputer systems
Authors: T. A. Marsland, J. Tartar
Venue: ACM SIGCSE Bulletin (1973)

The study of minicomputer systems in a laboratory environment has been considered by both Electrical Engineering [1], and Computer Science [2] departments. In a summary of the COSINE Committee report on Digital Laboratories, Booth [1] points out that since minicomputers are becoming an integral part of many industrial systems, it is mandatory that students be made aware of the principles of such systems. Further, Booth suggests that the best way to accomplish this is in a projects-oriented laboratory environment. We certainly agree with his statement that &ldquo;A successfully completed project thus gives the student a sense of accomplishment that is hard to duplicate in any other educational situation.&rdquo;
Closed loop methodology applied to simulation
Authors: Al Fermelia
Venue: Proceedings of the 15th conference on Winter Simulation - Volume 2 (1983)

By using modern system theory to model physical systems, questions concerning the design, analysis, test, and evaluation of such systems can be answered. This tutorial will compare the traditional open loop methodology of simulation to the modern closed loop methodology. Advantages and disadvantages of each methodology will be discussed. Systems will be typed as being deterministic or stochastic. The use of partial differential equations, ordinary differential equations, and algebraic equations to describe the system will be discussed. In order to solve system questions, the need to solve the estimation, identi- fication, and control (EIC) problems will be motivated. The use of the EIC solutions with respect to the traditional open loop methodology (OLM) and the modern control loop methods (CLM) will be examined.
Interactive theorem retrieval and generation
Authors: Paul S. Jensen
Venue: Proceedings of the 1968 23rd ACM national conference (1968)

When developing or extending a technique for solving some mathematical problem, one normally spends a considerable amount of time recalling and searching the literature for information and theorems applicable to the subject. Because of the way that information on a subject tends to be sprinkled throughout the literature, the process of gathering the known facts on the subject is often inefficient and time consuming.
Behavioral styles of computer programmers - revisited
Authors: Edward M. Cross
Venue: Proceedings of the ninth annual SIGCPR conference (1971)

This paper describes the second phase of a continuing research project concerned with the attributes associated with membership and success in the computer programming occupation. The second phase of this research has differed some-what, both in intent and practice, from the first phase. First, the initial purpose of the study was to test an approach to job analysis which included the application of the principal instrument used in the study, the JAIM, or Job Analysis and Interest Measurement.1 The use of computer programmers as the subject group was the result of the investigator's previous career as a systems analyst and programmer. The second difference is that some additional data has been gathered. The third difference&mdash;and the one of most interest to people in the personnel research area&mdash;is that the study begins to look at the potential of the JAIM as a placement instrument.
An insight into PDP-11 emulation
Authors: J. C. Demco, T. A. Marsland
Venue: Proceedings of the 9th annual workshop on Microprogramming (1976)

In order to evaluate the Nanodata QM-1 as a universal host computer, an emulator for a contemporary computer, the PDP-11, was designed and constructed. It was required that the emulator be functionally equivalent to the target, without making excessive sacrifices in emulation speed. Some properties of emulation hardware necessary to achieve these goals are identified. In addition, the paper describes a monitor designed to support different emulators concurrently on a single host machine.
Using Jackson diagrams to classify and define data structures
Authors: Dean Sanders
Venue: Proceedings of the fourteenth SIGCSE technical symposium on Computer science education (1983)

A modified set of Jackson diagrams together with a classification scheme is proposed as a means for unifying the study of data structures. The diagrams have proven to be very useful for presenting complex concepts and relationships.
Computer science learning at pre-college ages
Authors: Mark A. Rosso, Kevin W. Bowyer
Venue: ACM SIGCSE Bulletin (1984)

This paper has been accepted for publication in the proceedings, but the photo-ready form was not received in time. Copies of the paper should be available upon request at the presentation. It may appear in a later issue of the SIGCSE Bulletin.
Prosodic generation research
Authors: Arvin Levine
Venue: Proceedings of the 1976 annual conference (1976)

Recently, research on sentence prosody has been carried out using the computerized audio synthesis and analysis facilities at IMSSS. The aim of this research has been to synthesize sentences with an acceptable-sounding prosodic contour using only the phonetic information contained in the individually recorded words contained in those sentences together with certain syntactic/semantic facts that can be derived from the structure of the sentence or read out of a lexicon. We demonstrate the importance of surface syntax to prosodic assignment and suggest that a prosodic synthesis system can be constructed which will be based largely on the surface syntax.
A comparison of reduction in APL with polyarity in LISP
Authors: David S. Touretzky
Venue: Proceedings of the international conference on APL (1983)

APL'S reduce operator can be viewed as a hybrid of two simple models of reduction; these models sometimes disagree. LISP, which lacks a reduce operator, has polyadic functions that implicitly imitate the behavior of reduce. Several differences between reduction in APL and reduction as it appears in LISP are discussed. The paper goes on to develop a flexible model of polyarity based on an applicative operator distributing arguments to a dyadic function. It is shown that, while reduce is the applicative operator most commonly used for this task, some polyadic functions require other operators. The relationship between reduction and polyarity has implications for the design of other programming languages.
Information systems: Modelling, sequencing and transformations
Authors: M M Jackson
Venue: Proceedings of the 3rd international conference on Software engineering (1978)

Specification and design of an information system conventionally starts from consideration of the system function. This paper argues that consideration may more properly be given first to the system as a model of the reality with which it is concerned, the function being subsequently superimposed on the model. The form of model proposed is a network of sequential processes communicating by serial data streams. Such a model permits a clear representation of change or activity over time, and it also prevents over-specification of sequencing by separating problem-oriented from solution-oriented sequencing constraints. The model, however, cannot be efficiently executed on uniprocessor hardware without transformation. Some relevant kinds of transformation are mentioned, and the derivation, by means of them, of conventional information system configurations from the proposed model.
Testing incomplete specifications of distributed systems
Authors: Pamela Zave
Venue: Proceedings of the first ACM SIGACT-SIGOPS symposium on Principles of distributed computing (1982)

Complex systems (such as distributed ones) should be specified before they are implemented. Even more advantages accrue if the specifications are executable, so that behaviors of the specified systems can be tested. This paper addresses practical questions such as how incomplete specifications can be tested, and what kind of interface is needed to control tests of distributed systems. The answers take the form of a concrete proposal which has been implemented in prototype form.
Cellular and hybrid threshold networks
Authors: Claudio Moraga
Venue: Proceedings of the sixth international symposium on Multiple-valued logic (1976)

Ternary threshold logic is an appealing alternative for Logic Design; however, ternary threshold gates become difficult to implement as fan-in and weights increase and thresholds get closer. A Ternary Threshold Network is proposed, which is free from that limitation. The Network is slower than a conventional gate, but its development considers possible applications in industrial controls, for instance, where reacting times in the range of miliseconds may be adequate.
Emulation of the IBM system/360 on a microprogrammable computer
Authors: George R. Trimble,  Jr.
Venue: Conference record of the 7th annual workshop on Microprogramming (1974)

In recent months, several microprogrammable computers (MCs) have become available. By development of a suitable microprogram, it is possible to extend the basic instruction set of an MC to include special purpose instructions designed to facilitate the processing of a frequently executed application. This paper presents the results of a study of the technical and economic feasibility of the development of an S/360 emulator on an MC. It was concluded that such an emulator could be developed, that the performance of the emulator would equal or exceed the performance of the S/360 in most applications, and that the cost of the MC, it's software, and amortized emulator development costs would be less than the S/360 Model 30 costs. An approach to implementation of the emulator is outlined, anticipated problems and their solutions are indicated, timing and storage estimates are developed, and the interface with the operating system for the MC is defined.
Isomorphism testing for graphs of bounded genus
Authors: Gary Miller
Venue: Proceedings of the twelfth annual ACM symposium on Theory of computing (1980)

We present an algorithm which determines isomorphism of graphs in vO(g)steps where v is the number of vertices and g is the genus of the graphs. In [FMR 79] an algorithm was presented for embedding graph on surfaces of genus g in vO(g) steps. Here we show how to extend this algorithm to isomorphism testing for graphs of small genus. This result is noteworthy for at least two reasons. First, this extends the polynomial time isomorphism results for the plane [HT 72] and also the projective plane [L 80] to arbitrary surfaces. Second, this gives one of the few known natural decompositions of the isomorphism problem into an infinite hierarchy of problems Po,P1,... such that isomorphism testing of problems in P1 is decidable in time vO(i).
A survey of how practicing programmers keep up-to-date first results including their implications for computer science education
Authors: James Fisher, John Alvarez, Robert Taylor
Venue: Proceedings of the ninth SIGCSE technical symposium on Computer science education (1978)

As the field of data processing grows, it becomes increasingly important for the computer professional to keep abreast of new developments. Because one of the most significant of these new developments is structured programming, we decided to use knowledge of structured programming concepts as a measure of how up-to-date a programmer is. Thus, we undertook to answer the following questions: 1. How up-to-date are today's programmers, i.e. how aware are they of some of these new concepts? 2. From what sources did they learn about these concepts? How much did these sources influence their work? 3. What are some of the other factors which influence up-to-dateness? To find the answers, we prepared a survey of sixteen questions. The first fifteen questions were designed to provide us with a background profile of our polled population. The last question dealt specifically with structured programming, presenting a list of programming concepts and potential sources for learning about these concepts. The respondent was questioned about his familiarity with a particular concept, his source of learning about the concept, and the degree to which his work was influenced by this source. The responses were input to a program written in CROSSTABS, a commercially available utility package, to produce tables of cross-tabulations and frequency percentages. We analyzed these tables and our conclusions drawn from this analysis follow.
Safeguard systems at nuclear facilities: A SNAP application
Authors: Floyd H. Grant,  III, Alonzo F. Hixson,  III, Dennis Engi
Venue: Proceedings of the 11th conference on Winter simulation - Volume 1 (1979)

Nuclear safeguards systems are primarily concerned with the physical protection of nuclear material. The Safeguards Network Analysis Procedure (SNAP) provides a convenient and standard analysis methodology for the evaluation of Safeguards system effectiveness in its ability to resist theft or sabotage. This is achieved through a standard set of symbols which characterize the various elements of safeguards systems and an analysis program to execute simulation models built using the SNAP symbology. The reports provided by the SNAP simulation program enable analysts to evaluate existing sites as well as alternative design possibilities. This paper describes the SNAP network modeling technique and provides an example illustrating its use.
A generalized digraph simulator
Authors: Brooke Allen
Venue: Proceedings of the eighth international conference on APL (1976)

Directed Graphs (Digraphs) can be used as powerful tools in the simulation of many social, political and economic models. Because the digraph can be thought of as a matrix and a transformation as simply a matrix multiplication, APL lends itself quite nicely to the implementation of a digraph simulation system. A collection of APL programs have been written (called GENSIM) that allow for the easy interactive definition correction, revision, running and outputting of digraph models. This paper gives a brief introduction to digraphs in apl terminology, a discussion of GENSIM and a sample terminal session showing the use of GENSIM.
A large scale job-shop simulation based on actual operating data
Authors: Harold J. Steudel
Venue: Proceedings of the 10th conference on Winter simulation - Volume 2 (1978)

This paper describes a simulation study of a large job-shop based on actual operating data and procedures. The simulation model is used to investigate and solve problems of shop floor congestion and poor lead times. Statistically design experiments are used to evaluate the effect of material handling support and job input rates on various common measures of shop performance. A predictive model for mean job flow time is also developed using multiple regression. This analysis provides the basis for several layout changes which reduce material handling and shop floor congestion. The results of the study also show the need for formalized work center loading and scheduling procedures based on the finite capacity of the work centers.
Context-free grammars on trees
Authors: William C. Rounds
Venue: Proceedings of the first annual ACM symposium on Theory of computing (1969)

In this paper we discuss still another version of indexed grammars 1 and macro grammars3,gaining some geometric intuition about the structure of these systems. An ordinary context-free grammar is a rewriting system for strings; we find that a macro grammar is a rewriting system for trees. CF grammars on strings form a special case since strings can be thought of as trees without branching nodes. We consider the special case of finite-state grammars in this report. We define the tree analogue of a non deterministic generalized sequential machine and obtain results about the domain and range of such a mapping. We relate these results to the theory of generalized finite automata6.
Workspace interchange on microcomputers
Authors: L. J. Dickey
Venue: ACM SIGAPL APL Quote Quad (1983)

This note addresses some of the problems associated with moving APL workspaces to and from micro-computers that run APL. Some solutions are proposed.
Some complexity questions related to distributive computing(Preliminary Report)
Authors: Andrew Chi-Chih Yao
Venue: Proceedings of the eleventh annual ACM symposium on Theory of computing (1979)

Let M &equil; {0, 1, 2, ..., m&mdash;1} , N &equil; {0, 1, 2,..., n&mdash;1} , and f:M &times; N &rarr; {0, 1} a Boolean-valued function. We will be interested in the following problem and its related questions. Let i &egr; M, j &egr; N be integers known only to two persons P1 and P2, respectively. For P1 and P2 to determine cooperatively the value f(i, j), they send information to each other alternately, one bit at a time, according to some algorithm. The quantity of interest, which measures the information exchange necessary for computing f, is the minimum number of bits exchanged in any algorithm. For example, if f(i, j) &equil; (i + j) mod 2. then 1 bit of information (conveying whether i is odd) sent from P1 to P2 will enable P2 to determine f(i, j), and this is clearly the best possible. The above problem is a variation of a model of Abelson [1] concerning information transfer in distributive computions.
VLSI test expertise system using a control flow model
Authors: G. Saucier, C. Bellon
Venue: Proceedings of the 21st Design Automation Conference (1984)

The automatic generation of test programs for VLSI circuits and systems remains an unanswered wish. The solution seems to be a computerized expert aid, integrated in a whole system for circuit design. This paper outlines the concepts of an intelligent agent whose aims are to help the designer in appraising the diagnosability of the device or the system under design, to suggest design modifications, to generate test patterns for elementary modules and to assemble the basic test sequences into a test program for the whole circuit. Emphasis is put in this paper on this last task, especially for systems described by a control flow model (CADOC language) which is suitable for VLSI circuits like general purpose or dedicated micro-processors, distributed controllers, etc... The CAT system works like an intelligent assistant for test program generation and like an expert system for the diagnosis on the chip.
WCRC: An ANSI SPARC machine architecture for data base management
Authors: Sudhir K. Arora, S. R. Dumpala, K. C. Smith
Venue: Proceedings of the 8th annual symposium on Computer Architecture (1981)

Several data base machine architectures have been proposed in the past few years. The next generation of these machines must simultaneously support different data models on the same physical data. One approach to this problem, GDBMS, has recently been described in the literature. This paper presents the architecture of another approach: the well-connected relation computer (WCRC). The architectures of these two computers are compared, and a preliminary performance evaluation showing that WCRC requires less storage and has faster query response time is presented.
APL and the relational model
Authors: J. Michael Blackford, Robert M. Taylor
Venue: ACM SIGAPL APL Quote Quad (1982)

During the past five years, Xerox has implemented a number of APL applications which interface with an internally developed relational data store. The syntax and features of the Xerox Planning Data Management System (XPDMS) are outlined, and several commonly used application utilities, which extend the power of XPDMS in areas such as array structuring and report generation, are examined. We conclude With a discussion of the effects of the implemented relational disciplines upon the functional management process.
Financial modeling...simulating your way to planned objectives
Authors: Joseph J. Centofanti, David C. Evans
Venue: Proceedings of the 10th conference on Winter simulation - Volume 1 (1978)

The objective of this report is to relate our experience in developing, implementing and maintaining a financial model in a capital goods manufacturing enterprise. Particular attention will be given to the practical aspects of financial modeling, and to the impact upon all levels of management within the organization. Actual examples will be presented throughout to emphasize the practicality and simplicity of the model. The model was developed to meet the specific needs of a division. Since its inception almost two years ago, the model's proven reliability has led to its acceptance throughout. The Warner Swasey Company as the corporate and divisional financial planning standard. Thus the model has been used successfully for several industries, ranging from machine tools to construction equipment, textile equipment and electronic accessories. We hope to share the perspective gained through this development and acceptance process.
SAI-SDDLTM ...a tool for automated documentation
Authors: Donald A. Heimburger, Marcia A. Metcalfe
Venue: Proceedings of the 1st annual international conference on Systems documentation (1982)

SAI-SDDL TM (Science Applications, Inc. Software Design and Documentation Language) is a licensed computer program which aids in the documentation as well as the design of computer software. The three components of SAI-SDDL are: the processor, which is a PASCAL program; the language, which is simple, unrestrictive, and keyword-oriented; and the methodologies, which are numerous and well established. This workshop focuses on the methodologies and the results obtained by applying them.