ppxscal/embedding_network huggingface dataset:
A course description for teacher education in computer science
Authors: J. L. Poirot
Venue: Proceedings of the ACM SIGCSE-SIGCUE technical symposium on Computer science and education (1976)

This paper describes the content of a course entitled &ldquo;Computers in Education&rdquo; offered within the teacher certification program at Southwest Texas State University. This course, designed specifically for teacher education has several objectives including the following: (1) to cover material which would be most likely included in a secondary school curriculum, (2) to give adequate motivation for covering this material in the secondary school, (3) to list objectives to be reached in the secondary school classroom for each topic, (4) to present teaching techniques for topics in the secondary school, (5) to present computer related topics designed to aid the teacher in instruction, (6) to present computer related topics designed to aid the teacher in school administrative work.
Fundamentals of digital simulation modeling
Authors: J. W. Schmidt
Venue: Proceedings of the 13th conference on Winter simulation - Volume 1 (1981)

This paper and the tutorial session with which it is associated treat the fundamental concepts of digital simulation. The topics discussed include system modeling, simulation models and their advantages and disadvantages relative to mathematical models, the development of simulation and current applications, the role of simulation modeling in systems analysis and simulation languages. The paper and the tutorial are presented at a level which requires no previous exposure to digital simulation. However, familiarity with the fundamentals of probability, probability distributions and inferential statistics will facilitate the participant's understanding of the material presented.
A language for a scientific and engineering database system
Authors: Ted M. Sparr
Venue: Proceedings of the 19th Design Automation Conference (1982)

Databases are an important part of many Computer Assisted Design (CAD) applications. Real world knowledge is often defined by a database which is managed by a database system. Unlike most traditional database applications, the CAD process involves significant amounts of scientific and engineering computation on database contents to produce a result. Existing standalone language database systems often cannot meet this computational need. Users can either forego the use of a database system and its conveniences or interface conventional Procedure Oriented Language (POL) programs to database systems for the computational work. This paper describes EXTRAS, a relational algebra query language with extensions for numerical computation. This language has the advantages of a unified approach to computation and database query capabilities and of offering a high level language for numerical computation based on relations.
Computer architecture for correct programming
Authors: K. Berkling
Venue: Proceedings of the 5th annual symposium on Computer architecture (1978)

A computer architecture which is centered around the transformation of expressions facilitates the generation of programs from definitions, axioms, and theorems. It is shown that some of the well known methods to construct correct programs are directly available on this novel computer. Due to its novel architecture the need for support by large software systems and entailing systems size is diminished or has disappeared. Using this novel computer employing a lambda reduction language as machine language it is demonstrated how suitably chosen invariants get transformed into an executable program which is correct by construction. The various types of information which get incorporated into the result, as well as those parts of the original expression denoting the invariant which get expelled because they are constant, are discussed. It is demonstrated why the above mentioned novel computer architecture frees the user from being concerned with inessential problems, while on the other hand the use of higher level programming languages introduces additional problems due to the semantics of these languages. They necessitate considerations alien to solving the original problem. Crossreferences to other disciplines are pointed out which employ similar concepts.
Sequencing computation steps in a network
Authors: A. J. Herbert, R. M. Needham
Venue: Proceedings of the eighth ACM symposium on Operating systems principles (1981)

It is sometimes necessary in the course of a distributed computation to arrange that a certain set of operations is carried out in the correct order and the correct number of times (typically once). If several sets of operations are performed on different machines on the network there is no obvious mechanism for enforcing such ordering constraints in a fully distributed way. This lack basically stems from the difficulty of preventing copying and repetition of messages by machines and from the impossibility of constraining externally the actions of machines in response to messages that come into their hands. This paper presents a possible method for ensuring the integrity of sequences of operations on different machines. The technique may be thought of as a means of enabling machines to ensure that requests made of them are valid and timely, not as means of centralized control of services.
Evaluation of concurrent physical database reorganization through simulation modeling
Authors: Lars Söderlund
Venue: ACM SIGMETRICS Performance Evaluation Review (1981)

The performance of a database system commonly deteriorates due to degradation of the database's physical data structure. The structure degradation is a consequence of the normal operations of a general database management system. When system performance has degraded below acceptable limits the database must be reorganized. In conventional, periodic reorganization the database, or part of it, is taken off line while the data structure is being reorganized. This paper presents results from a study where it is shown that concurrent reorganization, i.e. a continous reorganization of the physical data structure while application processes have full access to the database, is an attractive alternative to conventional reorganization. The paper also presents a solution to a methodological problem concerning the simulation of a system which has activities with extremely varying durations.
Programming languages for non-numeric processing&mdash;2: Time sequenced logical simulation based on circuit delay and selective tracing of active network paths
Authors: E. G. Ulrich
Venue: Proceedings of the 1965 20th national conference (1965)

MANY PUBLISHED efforts in the field of logical simulation indicate that the programming concept of &ldquo;compiling and executing&rdquo; is the most frequently used foundation for the construction of simulation programs. The technique to be described here represents a complete departure from the concept of &ldquo;compiling and executing&rdquo;. The basic framework for the simulation method to be presented is simply a close imitation of the structure and operation of a logical network. Applying this concept leads to a realistically operating &ldquo;general purpose&rdquo; simulator. The resulting simulation possibilities are&mdash;at least with respect to the field of logical simulation&mdash;relatively unexplored and unexploited. Simulation in other fields, e.g., the simulation of nerve nets by Reiss1, has preceded the field of logical simulation in taking advantage of the structure and operation of (neural) networks. The first success in applying these methods to the field of logical simulation has been reported by Case, et al2.
Resource management in a decentralized system
Authors: Daniel H. Craft
Venue: ACM SIGOPS Operating Systems Review (1983)

The heterogeneous collection of machines constituting the Processor Bank at Cambridge represents an important set of resources which must be managed. The Resource Manager incorporates these machines into a wider view of resources in a network. It will accept existing resources and specifications for constructing others from existing ones. It will then allocate these to clients on demand, combining existing resources as necessary. Resource management in a decentralized system presents interesting problems: the resources are varied and of a multi-level nature; they are available at different locations from where they are required; the stock of available resources varies dynamically; and the underlying system is in constant flux.
Fuzzy information processing and robotics research
Authors: Paul P. Wang
Venue: Proceedings of the ACM '82 conference (1982)

From the time the term &ldquo;robot&rdquo; was conceived by the Czech novelist Karel Capek, human beings have dreamed of creating a machine with stamina, durability and a form of intelligence enabling it to perform a variety of tasks skillfully, perhaps in a hostile environment demanding precision, reliability and repetition. Such a machine would provide many useful services on a day to day basis, resembling man with its integration of (artificial) intelligence and the human-like abilities of sight, tactile sensing, voice recognition and others. A robot with all of these charactertistics is not yet in existence and awaits the coming of new technologies to support it; however it is conceivable that such an &ldquo;intelligent&rdquo; robot may be readily available during the next two decades. Numerically controlled machines have been called by some researchers, the &ldquo;first generation&rdquo; robots, and those available commercially (such as in the auto industry), the second generation. Robots equipped with various types of sensors with feedback or adaptive controllers are the subject of current research and comprise what might be called the third generation robots. The capabilities of future generations of robots appear to be entirely subject to our imagination, and the availability of new technologies. It is perhaps not too far fetched to think of a robot with the &ldquo;sensitivity&rdquo; required to give injections to patients in a hospital. A robot might be programmed to roam the corridors of a hotel, vaccuming or polishing floors; snake-like robots might be used to grasp on object of any shape and hardness without dropping it and without structural damage to it.
Design considerations in language processing tools for Ada
Authors: W. Babich, L. Weissman, M. Wolfe
Venue: Proceedings of the 6th international conference on Software engineering (1982)

The Ada Language System (ALS) is a complete programming environment for the development of Ada programs. This paper discusses the design objectives of those portions of the ALS which support translation and execution of Ada programs, particularly the compiler, linker, and program library. The ALS capabilities for maintenance of software configuration control are highlighted. Tradeoffs in the design of the compiler phase structure and intermediate languages are presented.
Augmented Transition Networks as a design tool for personalized database systems
Authors: Alan L. Tharp
Venue: Proceedings of the 1st annual international ACM SIGIR conference on Information storage and retrieval (1978)

This paper illustrates the use of Augmented Transition Networks (ATNs) as a design tool for constructing document retrieval systems for those personalized applications which are too small or specialized to attract a commercial vendor. ATNs, which are explained in the context of this application, are used not only to improve the human/computer interface with the retrieval system but also to conceptually organize its structure.
Comparison of simulation and analytical packages for performance evaluation
Authors: Robert B. Cooper, Edward A. MacNair, Debasis Mitra, Joseph J. Talavage
Venue: Proceedings of the 15th conference on Winter simulation - Volume 1 (1983)

This 90-minute panel discussion will embrace comparisons of simulation packages and analytical packages for performance evaluation of computer, telecommunications, and similar systems. Packages that combine both simulation and analytic methods can tap the strengths of each. The three panelists, each of whom is an author of a package that uses one or both of these methodologies (MacNair - RESQ, Mitra - PANACEA, Talavage - Micronet), will each talk briefly about his views on the subject in general and how they relate to his own package in particular. The chairman will then entertain questions and comments from the audience.
NUFACTS: A tool for the analysis of nuclear development policies
Authors: Mark B. Triplett, Theodore L. Willke, John D. Waddell
Venue: Proceedings of the 9th conference on Winter simulation - Volume 2 (1977)

NUFACTS, the Nuclear Fuel Cycle Activity Simulator, is a combined continuous/discrete simulation of the nuclear power economy. This model has been useful in the evaluation of nuclear development policies as it projects the economic and resource impacts attributable to a given policy. A recent application of NUFACTS has involved the economic evaluation of plutonium recycle options in light-water reactors. Based upon the GASP IV simulation language, NUFACTS provides a highly flexible means of simulating a wide variety of nuclear growth scenarios. In its present form most planned reactor concepts can be studied. To achieve this capability a model of the nuclear fuel cycle has been developed that incorporates functions related to the control over the pattern of development of nuclear power as well as to the detailed operation of individual reactors.
A programmable configurator
Authors: F. Beuger, T. W. Sidle, L. W. Leyking, A. G. Livitsanos
Venue: Proceedings of the 11th Design Automation Workshop (1974)

This paper discusses a system for programmatic processing of data processing equipment orders. Major tasks performed include analysis of the marketing order for completeness, determination of the required equipment configuration, and parts selection based upon the determined configuration. The key feature is that a single program is able to handle any data processing order within the Burroughs product line. This program is driven by &ldquo;rules&rdquo; disk files which are maintained independently through the use of a high level language.
Sigmini the challenge of mini-computer software(Panel Discussion)
Authors: H.R.J. Grosch, Elizabeth D. Rather, T. G. Lewis, W. J. Holden
Venue: Proceedings of the 1975 annual conference (1975)

In the early years of electronic computing, much attention was given to efficient algorithm design and implementation. It may be necessary to return to such efficiencies if we are to use short word, limited memory, constrained instruction set machines. One panelist believes that programming techniques superior to those &ldquo;into which we were frozen 15 years ago&rdquo; can be designed. Another panelist is concerned with the social values of balancing economy, convenience and security.
An application of tree structures to an interactive double-entry bookkeeping system
Authors: Sander Rubin
Venue: Proceedings of the eighth international conference on APL (1976)

This paper describes how an interactive general ledger bookkeeping system was developed by piggy-backing the application on a general-purpose APL system. Two points of special interest are emphasized: 1. Conventional accounting techniques were recast into algebraic techniques which were then applied to tree- and list-structures. 2. The underlying APL language was used to provide general-purpose binary-tree manipulating functions which were used in turn to form the journal-, ledger-, and report-generating functions. Because APL is not especially effective in performing tree-related operations, the cost of entering transaction data proved to be excessive. It is hoped that the exhibition of an important tree-based application may encourage further work in augmenting the APL language to process tree-like data structures more efficiently.
On the efficiency of control procedures for computer communication networks
Authors: Holger Opderbeck
Venue: ACM SIGOPS Operating Systems Review (1975)

The last decade has seen an explosive growth in the area of computer communications and, in particular, computer networking. Similar to the early stages of the development of time sharing systems, the first studies in this new area concentrated on demonstrating the feasibility and building a theoretical foundation [CHU 69, DAVI 68, SCAN 68, HEAR 70, FRAN 70, KLEI 70, CARR 70]. While many theoretical questions remain unresolved [CHOU 74, KLEI 74a, OPDE 74a], the feasibility of these systems has clearly been established. The interest has recently shifted toward efficient and secure implementations of computer communication systems. In this paper we will comment on the efficiency of control procedures and report on the experience which we have gained with the operation of the ARPANET.
A systematic approach to advanced debugging through incremental compilation (Preliminary Draft)
Authors: Peter Fritzson
Venue: Proceedings of the ACM SIGSOFT/SIGPLAN software engineering symposium on High-level debugging (1983)

This paper presents two topics: implementation of a debugger through use of an incremental compiler, and techniques for fine-grained incremental compilation. Both the debugger and the compiler are components of the highly integrated programming environment DICE (Distributed Incremental Compiling Environment) which aims at providing programmer support in the case where the programming environment resides in a host computer and the program is running on a target computer that is connected to the host. Commands to the debugger command level includes all legitimate PASCAL statements. The debugger is machine-independent - it calls the incremental compiler which generates code for evaluation of commands, or modifies the machine code of the target program for insertion of breakpoints etc. Essentially all machine-dependences are isolated inside the code generator of the incremental compiler.
Group effectiveness at an ERDA installation
Authors: Joan Franz
Venue: Proceedings of the fifteenth annual SIGCPR conference (1977)

This report is the product of a series of component objectives in studying organizational behavior. It is composed from personal involvement in the consultants group at LBL, and from interviews of the other members of the group and the immediate supervisor. The interviewed group was composed of nine consultants. I have conducted the interviews, analyzed the data, and written the report as a study goal for my tutorial in organizational behavior. The purpose of this report was to (1) identify the problems that are curtailing personal and group effectiveness, (2) present members' solutions to these problems, and (3) analyze whether these solutions will increase the cohesive functioning of the group.
On students presenting technical material to non-technical audiences in a computer science curriculum
Authors: Wm J. Mein
Venue: Proceedings of the thirteenth SIGCSE technical symposium on Computer science education (1982)

Much attention has been given regarding the lack of writing ability of our graduating students. Many of these same students cannot make reasonable oral presentations of predominantely technical material to peers, graduate students, or faculty much less to an audience consisting of mostly non-technical (lay) persons. This paper examines one such attempt to do so for twenty undergraduate students in a computer science curriculum. The reactions of the presenters as well as those of the audiences are given.
Performance and fault tolerance improvements in the Inverse Augmented Data Manipulator network
Authors: Robert J. McMillen, Howard Jay Siegel
Venue: Proceedings of the 9th annual symposium on Computer Architecture (1982)

The Inverse Augmented Data Manipulator (IADM) is a multistage interconnection network based on the Augmented Data Manipulator (ADM) and Feng's data manipulator. It is designed to be used in large-scale parallel/distributed processing systems for communication among processors, memories, and other system devices. Two aspects of IADM network design are discussed: performance and fault tolerance. A single stage look-ahead scheme for predicting blockage is presented to enhance performance. Next, one method of adding some links to the network to enable it to tolerate one link failure is described. Finally, a different method of adding links is shown that both improves performance and allows the network to tolerate two switching element or two link failures. Included is a new routing tag scheme that accommodates the new links.
Propositional modal logic of programs
Authors: Michael J. Fischer, Richard E. Ladner
Venue: Proceedings of the ninth annual ACM symposium on Theory of computing (1977)

We introduce a fundamental propositional logical system for describing correctness, termination and equivalence of programs. We define a formal syntax and semantics for the propositional modal logic of programs and give several consequences of the definition. Principal conclusions are that deciding satisfiability requires time dn/log nfor some d > 1 and that satisfiability, even in an extended system, can be decided in nondeterministic time cnfor some c. We provide applications of the decision procedure to regular expressions, Ianov schemes, and classical systems of modal logic.
A simulation study of dynamic dispatching
Authors: Amy Chiang Cho, J. C. Strauss
Venue: Proceedings of the 3rd symposium on Simulation of computer systems (1975)

This paper investigates the performance of dynamic dispatching algorithms based on the HASP Execution Task Monitor (HETM) which is an optional feature of the IBM OS/360 Operating System. HETM attempts to improve system performance by maintaining balanced usage of the CPU and I/O channels. HETM dynamically distributes priority to the most I/O bound jobs by periodically rearranging the OS/360 dispatching chain to give classes preemptive CPU execution priority in inverse order to that of their CPU utilization (A class with low CPU utilization history will be assigned high CPU priority). The success of HETM has prompted the development of similar algorithms with different performance improvement goals and mechanisms. This paper describes simulation of an analytic model and its use in evaluating the effectiveness of HETM and other HETM-like dynamic dispatching algorithms. Previously obtained analytic results are verified and simulation is demonstrated to be a useful means for the experimental study of computer system performance.
Dynamic derived relations within the RAQUEL II DBMS
Authors: Kayhryn C. Kinsley, James R. Driscoll
Venue: Proceedings of the 1979 annual conference (1979)

An implementation technique for supporting dynamic derived relations within a particular relational DBMS (the RAQUEL II DBMS) is presented. Included is a discussion of the RAQUEL II concepts of permanent and temporary relations, base and derived relations, and explicit and implicit updates. The methods presented here for support of updates in regard to dynamic derived relations take the form of immediate updates. Proofs are presented to show the validity of the update methods.
A logical approach to teach digital computer design at logic and systems level
Authors: Sarma R. Vishnubhotla
Venue: Proceedings of the seventh SIGCSE technical symposium on Computer science education (1977)

Design courses in Computer Systems Design are being taught in many undergraduate programs both for Computer Science and Electrical Engineering students. A design project is explained in this paper to give all the information to the students regarding the important concepts in both logic and systems level. The computer has sixteen instructions, two K memory and a single index register. This project can also be enlarged by introducing many extra hardware features.