ppxscal/embedding_network huggingface dataset:
TABLOG: The deductive-tableau programming language
Authors: Yonathan Malachi, Zohar Manna, Richard Waldinger
Venue: Proceedings of the 1984 ACM Symposium on LISP and functional programming (1984)

TABLOG (Tableau Logic Programming Language) is a language combining functional and logic programming using first-order (quantifier-free) predicate logic with equality. TABLOG incorporates advantages of LISP and PROLOG. A program in TABLOG is a list of formulas in a first-order logic (including equality, negation, and equivalence) that is more general and more expressive than PROLOG'S Horn clauses. Whereas PROLOG programs must be relational, TABLOG programs may define either relations or functions. While LISP programs yield results of a computation by returning a single output value, TABLOG programs can be relations and can produce several results simultaneously through their arguments.
The effect of team programming on student achievement in COBOL instruction
Authors: Nancy Ellen Miller, Charles Glenn Petersen
Venue: ACM SIGCSE Bulletin (1982)

As a result of analyzing the art of computer program development, new skills are being suggested to improve programming efficiency. Two of these skills are the use of structured programming and the ability to work as a member of a team (Khailany and Saxon, 1978). The benefits gained from employing these skills in an educational setting (Cheney, 1977; Lemos, 1978; Weinberg, 1971) and in commercial areas (Baker and Mills, 1973; Schonberger and Franz, 1978) have been discussed in the literature. Team programming involves the process of one's peers inspecting one's work for errors, ideas, and design methods in order to improve productivity and learning. The group technique is being applied to programming in industrial settings and is advocated for educational settings as one approach to improving programming.
The PROSE [protection system evaluator] model
Authors: John E. Lenz
Venue: Proceedings of the 11th conference on Winter simulation - Volume 1 (1979)

The PROSE model is a combined GASP IV computer simulation to aid in the evaluation of protection systems. The primary systems that the PROSE model was designed for is the safeguarding of special nuclear fuel in transit or at a fixed site. The method used in designing the PROSE study model was to simulate a small arms combat between a guard force and attacking adversaries. Discrete events include player and vehicle movement, engagement between two players, portal construction and penetration, player captures, and sensor detections. Observation between players and other plays and vehicles are represented with continuous state equations. In this decision, each player has a state variable representing the probability of detecting another entity. This probability is cumulated over time until a threshold is crossed. This state event then indicates that a detection has occurred, and the observing player has his perception updated which contains copies of the attributes values of the observed entity. Also, the perceived information is available to be communicated to other communication net members. Individual and leader decisions are also simulated in the PROSE model. Individual decisions are based on the attribute values of perceived entities (including oneself). Existing situations are identified and responses are selected. For example, a situation might occur when the special nuclear material has been stolen, and the guard response might be to block the exist route of the adversaries. This type of decision making represents immediate responses, or standard operation procedures of the guards. Leader planning or decision making is simulated by a different means. The leader of each force (guards and adversary) has the responsibility of organizing each subordinate's plans. The guard leaders perception is searched to determine if any adversaries are perceived to occupy &ldquo;key&rdquo; or vital locations. If so, then a response is selected. The responses might appear as movements of guard to &ldquo;strategic&rdquo; location in response to the occupancy of the &ldquo;key&rdquo; location. Adversary planning is somewhat different in that &ldquo;goals&rdquo; provide guidance for decision making. An adversary goal might be to secure the nuclear material room with these persons. If the adversary leader perceived that only two subordinates were in the process of achieving this goal, another subordinates (if possible) would be given the plan to move to the nuclear material room. Statistics collection is an important part of the PROSE model design. Since this model was designed to an aid in evaluation of protection systems, several types of statistics are made available to provide measures of the protection systems strengths and weaknesses. Some of these include firing accuracy, region occupancy, amount of information communicated, number of sensor detections, and whether or not plans were carried out properly.
Computer aided design of microprocessor-based systems
Authors: Alan Ross, Herschel H. Loomis,  Jr.
Venue: Proceedings of the 15th Design Automation Conference (1978)

In this paper, an implementation of an automatic system for the design of Real Time Control Systems is presented. Also presented is a discussion of the new developments in the theory underlying the system, which among other features, leads naturally to the design of multi-microprocessor systems.
Tests for the verification and validation of computer simulation models
Authors: Robert E. Shannon
Venue: Proceedings of the 13th conference on Winter simulation - Volume 2 (1981)

This paper discusses the quantitative as well as qualitative tests which can be run in trying to convince the user of a simulation model that the results are valid
Linear representation of tree structure - a mathematical theory of parenthesis-free notations
Authors: W. J. Meyers
Venue: Proceedings of the third annual ACM symposium on Theory of computing (1971)

In this paper we present a substantially general theory of parenthesis-free notations for finite plane trees. We obtain stronger one-to-oneness results, including a characterization of one-to-oneness for a large class of notations, and a quite general sufficient condition for one-to-oneness that involves the recursive structure of plane trees in what appears to be a minimal way. We then study various properties of notations that promise to be of practical interest. The two most important of these&mdash;single scan bottom-up readability, and single scan top-down readability&mdash;both turn out to be particular cases of our general sufficient condition for one-to-oneness. We formulate simple descriptions of all notations that have one or the other of these properties, and find a simple transformation of notations that establishes a one-to-one correspondence between them. The unique fixed point of this transformation turns out to be the only notation single scan readable in both directions.
TRM: A resource model for networked processes
Authors: Lawrence L. Rose
Venue: Proceedings of the 15th annual symposium on Simulation (1982)

This paper describes a large-scale GASP simulation model of workload processing on computer systems. Utilizing the TRM simulator one can define a network of processes which comprise a software system and model its execution in a man-machine environment to derive data throughput times, man/machine utilization statistics, and queueing statistics. Trace, plot, and histogram features enhance the utility of the outputs for the modeler. Results of using this model to simulate the TES/EMPS system are presented and extensions for continued research are noted.
Color spaces for computer graphics
Authors: George H. Joblove, Donald Greenberg
Venue: ACM SIGGRAPH Computer Graphics (1978)

Normal human color perception is a product of three independent sensory systems. By mirroring this mechanism, full-color display devices create colors as mixtures of three primaries. Any displayable color can be described by the corresponding values of these primaries. Frequently it is more convenient to define various other color spaces, or coordinate systems, for color representation or manipulation. Several such color spaces are presented which are suitable for applications involving user specification of color, along with the defining equations and illustrations. The use of special color spaces for particular kinds of color computations is discussed.
Towards VLSI complexity: The DA algorithm scaling problem: can special DA hardware help?
Authors: H. G. Adshead
Venue: Proceedings of the 19th Design Automation Conference (1982)

With the increasing scale of integration we need to employ DA algorithms to assist us in managing the complexities involved. Many of our current techniques are already costly and slow and yet scale by some power law as the gate count increases. An analysis of the strategies open to us leads to the possibility that in many cases specialised DA hardware is cost effective. This paper then describes a series of trials to employ a 64 x 64 distributed array processor at DA tasks. Some unexpected results were obtained as algorithms evolved in the area of tracking, simulation, placement, test generation, fault simulation, and layout rule checking. The paper concludes with a discussion of the overheads incurred in employing unconventional hardware.
ABISS&mdash;an inexpensive computer-based sound spectrograph
Authors: M. J. Park, W. Teoh, W. Klemme, H. Gates
Venue: Proceedings of the fourteenth SIGCSE technical symposium on Computer science education (1983)

A practical tool for assisting deaf children to learn to speak is discussed. The first portion of this project which has been completed is presented in detail. On-going further development leading to the final system is also discussed.
APL applications
Authors: Harley M. Courtney, Ronald A. Seaberg, Richard D. Cuthbert, Richard D. Grinold, Robert M. Oliver, Theodore J. Mock, M. Vasarhelyi
Venue: Proceedings of the 6th conference on Winter simulation (1973)

The use of APL in business and economics has increased significantly in recent years. This session considers APL's simulation features in three financial planning applications and in addition, a number of APL PLUS simulation and optimization algorithms in cash flow management.
Simulation of econometric models
Venue: Proceedings of the 6th conference on Winter simulation (1973)

The purposes of this tutorial are to present some fundamental properties of econometric model structures relevant to effective understanding of simulation procedures, and to describe the use of simulation software for analysis and forecasting. The fundamental concepts of model specification are developed formally to provide a logical foundation for model construction and simulation procedures. The concepts of integrated and causal structures, reduced and final forms are examined and related to issues of: empirical identification and statistical estimation; interpretation; and computation. Procedures for decomposition of causal systems into ordered subsets of equations are outlined. The formal analysis is supplemented with specific examples. The dynamic simulation capabilities of several available simulation software systems are described in general terms and specific procedures for loading and simulating econometric models with the California Economic Forecasting Project/Interactive Model Simulator (CEFP/IMS) system are given. Procedures for generation of' dynamic multipliers, incorporation of judgment in forecasting and forecast error analyses are discussed. The session is concluded with an on-line demonstration of the CEFP/IMS.
A case study of putting APL to work with a large database
Authors: James K. Schmidt
Venue: Proceedings of the eighth international conference on APL (1976)

This paper will describe how APL was applied to a project, involving a large data base, undertaken by the Consolidated Edison Corporation of New York. The purpose of the project was to monitor and analyze the maintenance of underground structures in the Con Edison network, and was identified by the acronym CIMOES (Computerized Inspection and Maintenance of Electrical Structure). The impetus for the computer implementation came from the Department of Quality Assurance and Reliability, where it was felt that on-line availability of maintenance records would furnish valuable statistics about equipment failure rates and provide the residual benefit of scheduling information for the repair crews in the field. The programming for CIMOES was done by the staff of APL Services, Inc. on the ACTION/APL.SV time-sharing system. The volume, type of data, and method of input presented significant problems for a successful APL implementation. The concepts and techniques used in the project are significant for anyone interested in using APL on larger-scale systems in business and industry.
On going developments in GPSS
Authors: Julian Reitman
Venue: Proceedings of the 76 Bicentennial conference on Winter simulation (1976)

This conference marks fifteen years since Geoffry Gordon of IBM introduced GPSS to the world at the 1961 joint computer conference held in Washington1. For those who feel that GPSS was rather primative as originally introduced, well there was GPSS II, GPSS III, GPSS/360, and since 1970 GPSS V. Yes GPSS V has been around that long and with relatively few changes. As a result, a new aspect of GPSS has emerged. The past few years have produced considerable activity directed toward making the GPSS V and GPSS/360 languages available on a number of manufacturers systems. Over the years GPSS has been the most popular simulation language. With the recent increase in availability, it seems probable that the language will continue to be widely used.
Epipole and fundamental matrix estimation using virtual parallax
Authors: B. Boufama, R. Mohr
Venue: Proceedings of the Fifth International Conference on Computer Vision (1995)

The paper addresses the problem of computing the fundamental matrix which describes a geometric relationship between a pair of stereo images: the epipolar geometry. We propose a novel method based on virtual parallax. Instead of computing directly the 3/spl times/3 fundamental matrix, we compute a homography with one epipole position, and show that this is equivalent to computing the fundamental matrix. Simple equations are derived by reducing the number of parameters to estimate. As a consequence, we obtain an accurate fundamental matrix of rank two with a stable linear computation. Experiments with simulated and real images validate our method and clearly show the improvement over existing methods.
On Bounding Distributions For Stochastic Networks
Authors: James R. Yee
Venue: Proceedings of the 1978 annual conference (1978)

Consider a PERT network where the arc lengths are discrete random variables. This paper presents methods for determining upper and lower bounding probability distributions on the exact probability distribution for the project duration in a PERT network. An analysis of the computational complexity of each of the methods is presented. In addition, we show that these methods may be improved by using the exact probability distribution for the starting time at a subset of the nodes. By incorporating this feature, one obtains tighter bounding probability distributions, and consequently tighter bounds on the expected project duration. This is illustrated by several examples. The ideas in this paper are applicable to the determination of the length of a shortest path in a transportation network, the reliability of a communications network, and the maximum flow in an electric power network.
Tutorial on statistical analysis and experimental design in discrete event digital simulation experiments
Authors: George S. Fishman
Venue: Proceedings of the 5th conference on Winter simulation (1971)

This tutorial reviews topics pertinent to the evaluation of results of discrete event digital simulation experiments and to the design of such experiments. The presentation includes: 1. alternative methods of estimating the variance of the sample mean of a process of interest 2. computation of rough confidence intervals for the mean that acknowledge use of sample variance of sample mean in place of true variance of the sample mean 3. bias due to initial conditions 4. &ldquo;rough&rdquo; correlogram and spectrum estimation 5. variance reduction as applied to experimental replication and the comparison of experimental results
Paradropper: A General-Purpose Global Computing Environment Built on Peer-to-Peer Overlay Network
Authors: Liu Zhong, Dou Wen, Zhang Wei Ming, Zou Peng
Venue: Proceedings of the 23rd International Conference on Distributed Computing Systems (2003)

We describe Paradropper, a general-purpose global computing system based on a peer-to-peer self-organizing overlay network. In Paradropper, the peer is organized into an overlay network with "small world" characteristics, and workload is well balanced among the peers according to their workload in a decentralized manner. Particularly, it not only supports embarrassing parallel computing mode, but also allows correlativity between tasks. Moreover, the master/worker roles are extended in Paradropper, which makes it more flexible in computing environment configuration.
An improved events list algorithm
Authors: James O. Henriksen
Venue: Proceedings of the 9th conference on Winter simulation - Volume 2 (1977)

One of the basic overhead activities necessary to carry out a discrete event simulation is the insertion and deletion of event notices (transactions) in/from the event list (future events chain). The insertion of event notices is of particular interest, because it requires a search of the event list to determine the point at which an event notice should be inserted. If a linear search is used, as is the case with most simulation languages, the time consumed by the search can grow as N2, where N is the average size of the event list. In a paper entitled &ldquo;A Comparison of Event List Algorithms,&rdquo; authors Jean G. Vaucher and Pierre Duval (1) evaluated three algorithms as alternatives to linear search. They concluded that an &ldquo;...indexed list algorithm provides the best overall performance.&rdquo; This paper describes a new algorithm, based on the indexed list algorithm of Vaucher and Duval. The algorithm is adaptive to the distribution of event interarrival times. Results are shown that indicate the algorithm works well with a number of distributions and that shortcomings of the indexed list algorithms are overcome.
Interaction of Wireless TCP Schemes and Rerouting: Analytical Models and Simulation
Authors: Waleed S. Al-Numay, Sridhar Radhakrishnan, Tao Zheng, Chandra N. Sekharan
Venue: Proceedings of the 23rd International Conference on Distributed Computing Systems (2003)

The performance of wireless Transmission Control Protocol (TCP) schemes is directly tied to the underlying network protocol and the rerouting strategies used after a handoff. Analytical models are proposed for the various interactions and verified by simulation to determine thebuffer requirements at base stations (BS) and to estimate disruption time which is the time between the arrival of the last packet to the mobile receiver while at the cell of the old BS and the arrival of the first packet to the mobile receiver while at the cell of the new BS. This evaluation will aid a protocol designer to pick the right combination of wireless TCP scheme and rerouting strategy based on the network properties including mobility patterns, network topology, and others. Towards this, we provide for the first time protocols for reliable communication that takes into account every combination of wireless TCP schemes and rerouting strategies.
The design, simulation, and evaluation of a menu driven user interface
Authors: Ricky E. Savage, James K. Habinek, Thomas W. Barnhart
Venue: Proceedings of the 1982 conference on Human factors in computing systems (1982)

As the number of system users increases, the degree of formal training of the typical user declines. Techniques such as menu selection, which can best accommodate the novice user, almost necessarily must be included in a strategy for person-computer communication. Yet care must be taken that the experienced or sophisticated user is not encumbered with an interface that involves frustratingly slow entry of commands or procedures. This paper details the process and techniques required to develop and test an interface that would satisfy the needs of a broad spectrum of users. Two design and evaluation iterations are described.
Synthetic program specifications for performance evaluation
Authors: Henry C. Lucas,  Jr.
Venue: Proceedings of the ACM annual conference - Volume 2 (1972)

Three purposes of performance evaluation and monitoring are reviewed along with eight techniques for evaluation. An earlier proposal for using synthetic programs for the purpose of selection evaluation is discussed. It is suggested that a set of industry wide synthetic modules be developed and provided by each computer manufacturer for his equipment. An outline of a series of possible modules is discussed, although complete specification of modules should be undertaken by an industry-wide committee. Two examples are presented which illustrate the use of synthetic modules in evaluating the performance of computer systems.
International standards for data communications: A status report
Authors: Ira W. Cotton, Harold C. Folts
Venue: Proceedings of the fifth symposium on Data communications (1977)

Recent developments in data communications standards have been patterned on a hierarchical approach to communications system architecture. A number of independent levels have been identified, and standards development has proceeded at its own pace within each level. These levels are identified and recent progress at standardization is discussed for each.
Evaluating User Satisfaction
Authors: M. D. Walsh
Venue: Proceedings of the 10th annual ACM SIGUCCS conference on User services (1982)

The primary objective of consultation is to provide a service that, in all aspects, matches the requirements of our users. As these requirements change constantly, it becomes necessary to evaluate the effectiveness of the type of consultation offered from the point of view of the user. The questionnaire, discussed in this paper, covers three main areas: consultation, documentation and our Newsletter. In addition each area is subdivided into: time spent by the user to locate documentation and waiting to see a consultant. Furthermore, the effectiveness of each was measured by the percentage of problems solved by the user as a result of utilizing one, or any combination, of these services.
TEGAS2&mdash;anatomy of a general purpose TEST GENERATION AND SIMULATION system for digital logic
Authors: S. A. Szygenda
Venue: Proceedings of the 9th Design Automation Workshop (1972)

This paper will attempt to consider requirements and problems encountered in the development of digital logic simulation and test generation systems. The procedure for doing this will be to first consider requirements and general considerations for a particular simulation system (TEGAS2(1,2)TEST GENERATION AND SIMULATION) and then to dissect the system into its major constituent parts with a discussion of adopted techniques and experiences. It is obvious that a detailed discussion of this sort would require far more space than permitted in these proceedings. Therefore, an attempt will be made to discuss the most important considerations for system design and development.