ppxscal/embedding_network huggingface dataset:
A metalanguage for interactive simulation
Authors: R. C. Heterick, J. A. Gerth, N. D. Huebner
Venue: Proceedings of the 9th conference on Winter simulation - Volume 2 (1977)

Interactive computing environments ought to offer increased flexibility to persons interested in discrete system simulation. Much of this potential advantage may be lost, however, if the language available to the model builder are not inherently interactive, or if he must be continually concerned with the basic housekeeping tasks involved in the execution of a simulation. Those who have become accustomed to the interactive environment desire to retain its full power and diversity for whatever tasks must be accomplished. The intent of this paper is to describe several metafunctions, which, when taken together, form a metalanguage for interactive, discrete system simulation. The metalanguage may be used alone to effect a simulation or it may be embedded in a macro-structure to create an application language for simulation. That is, the metalanguage can be used directly by those who wish non-standard queueing disciplines, special statistics, etc. as well as by those who wish to create a precoded application language such as GPSS. An application of each type is described.
Desirable extensions to APL for handling numerical multidimensional arrays
Authors: Egon Dorrer
Venue: ACM SIGAPL APL Quote Quad (1982)

A rigorous use of multidimensional arrays (hypermatrices) representing logically and naturally structured numerical data leads to some useful extensions to APL. By means of simple examples typical to optimal estimation, this paper describes the practical need for a conceptional expansion of the inner product for hypermatrices. In particular it is shown that the range of compatible axes between the two operands should not be restricted to one. The concept includes hypermatrix division and inversion. Also discussed is a simple way of representing and using the Jacobians of defined hypermatrix functions. Together with already existing mixed operations on multidimensional arrays, such extensions would considerably enhance the transparency of corresponding APL-expressions. Implementation of some of the proposed language extensions into APL is strongly recommended.
Software engineering with standard assemblies
Authors: R. Lanergan, B. Poynton
Venue: Proceedings of the 1978 annual conference - Volume 2 (1978)

The techniques of functional modularity are utilized in a business data processing environment to prepare modules for use in multiple applications. These modules are tested, documented, and stored in a library for later use. Three major applications using this technique averaged 60 percent re-used code. In addition, business programs have been categorized into three types and pre-written &ldquo;logic structures&rdquo; have been prepared for each type, to serve as a framework to be completed by the addition of copied code and unique code.
Executable specifications for a human-computer interface
Authors: Robert J.K. Jacob
Venue: Proceedings of the SIGCHI conference on Human factors in computing systems (1983)

It is useful to be able to specify a proposed human-computer interface formally before building it, particularly if a mockup suitable for testing can be obtained directly from the specification. A specification technique for user interfaces, based on state transition diagrams, is introduced and then demonstrated for a secure message system application. An interpreter that executes the resulting specification is then described. Some problems that arise in specifying a user interface are addressed by particular features of the technique: To reduce the complexity of the developer's task, a user interface is divided into the semantic, syntactic, and lexical levels, and a separate executable specification is provided for each. A process of stepwise refinement of the syntactic specification, leading from an informal specification to an executable one is also presented. Since the state diagram notation is based on a non-deterministic model, constraints necessary to realize the system with a deterministic interpreter are given.
Assisting network users with a network access machine
Authors: Robert P. Blanc
Venue: Proceedings of the 1974 annual conference - Volume 1 (1974)

Accessing networks of heterogeneous computer systems can often be cumbersome due to differences in command languages and conventions. Approaches toward improving these conditions are identified and a specific solution - a &ldquo;Network Access Machine&rdquo; - is described in detail. The &ldquo;Network Access Machine&rdquo; is a mini- computer-based system that acts as a network access point for a user at his terminal and assists the user through the automatic execution of access procedures. This minicomputer facility allows the user to specify (or to have specified) his own network commands. The minicomputer expands these commands into command sequences executable on a specified network and host connected to that network. Further, system and network responses are analyzed to assure agreement with those anticipated for specific commands. Conditional and parameterized expansions allow the use of the same commands on different host computers and different networks.
Cooperation of multi-layer perceptrons for the estimation of skew angle in text document images
Authors: N. Rondel, G. Burel
Venue: Proceedings of the Third International Conference on Document Analysis and Recognition (Volume 2) - Volume 2 (1995)

Estimating the skew angle in text document images can be a crucial problem in optical character recognition. Based on a new sensor array processing technique, an original solution to skew angle estimation (SAE) is proposed. Thanks to the reformulation of the SAE problem in the framework of angle of arrival theory, a fast and accurate method is presented that is based on the cooperation of two neural networks. The first neural net is a three-layer perceptron receiving on input the values of the correlation matrix of the signals; the output is a "rough" estimation of the angle to estimate. This gross estimate is then used to initialize the weights of a second multi-layer perceptron (MLP). The second MLP is built in order to perform a maximum likelihood-like optimization, therefore reaching good performances. The system, though trained on simulated radar data, shows good performances on noisy handwritten texts.
Use of an external optimizing algorithm with a GPSS model
Authors: Robert M. Lefkowits, Thomas J. Schriber
Venue: Proceedings of the 5th conference on Winter simulation (1971)

Although GPSS enjoys many advantages as a language for modeling discrete, non-deterministic systems, it suffers from several disadvantages. GPSS is interpretive, resulting in relatively slow execution times. In addition, the input/output and computational capabilities in the language are limited. Disadvantages like these can be lessened or overcome by use of the GPSS HELP Block, which makes it possible to interface an executing GPSS model with one or more FORTRAN subroutines. As an instructive example of HELP Block utility, this paper shows how a GPSS model has been mated with a FORTRAN subroutine implementing the univariate searching strategy. The result is a GPSS-FORTRAN combination which automates the search for the optimal way to configure a system.
The modular structure of complex systems
Authors: D. L. Parnas, P. C. Clements, D. M. Weiss
Venue: Proceedings of the 7th international conference on Software engineering (1984)

This paper discusses the organization of software that is inherently complex because there are very many arbitrary details that must be precisely right for the software to be correct. We show how the software design technique known as information hiding or abstraction can be supplemented by a hierarchically-structured document, which we call a module guide. The guide is intended to allow both designers and maintainers to identify easily the parts of the software that they must understand without reading irrelevant details about other parts of the software. The paper includes an extract from a software module guide to illustrate our proposals.
The effectiveness of an open house
Authors: Frances Craig
Venue: Proceedings of the 6th annual ACM SIGUCCS conference on User services (1978)

This paper discusses the strategies for an &ldquo;Open House&rdquo; to inform the user community of the resources and services offered by a university computer center. The orientation is directed toward faculty and graduate students, especially newcomers, at Carnegie-Mellon University. The paper discusses the development of these strategies to meet the goal of publicizing the resources and services of the Center. The major strategies selected for the Open House are to select a suitable time period, develop a program which attracts the designated users, establish a good publicity plan, and insure that the logistics facilitate an organized activity. Finally, the paper establishes the criteria for evaluation of the Open House.
Lunar ephemeris: De Launay's theory revisited
Authors: Andre Deprit, Jacques Henrard, Arnold Rom
Venue: Proceedings of the second ACM symposium on Symbolic and algebraic manipulation (1971)

DeLaunay's reduced Hamiltonian of the main problem in lunar theory is checked against a new analytical theory based on Lie transforms. It is found to be correct up to order 9 with the exception of one error in addition of order 7.
A modularized package of dual algorithms for solving constrained nonlinear programming problems
Authors: Michael Minkoff
Venue: Proceedings of the 1975 annual conference (1975)

A package of algorithms for numerical experimentation with constrained optimization methods is described. This package is addressed to dual methods and is modularized to permit experiments with a particular module (such as a penalty function module) without changing any of the other modules. Thus reliable comparisons can be made without questioning differences in implementations of the remaining portions of a constrained algorithm. The feasibility of modularization as well as advantages and disadvantages for dual algorithms are discussed. Some numerical results are also presented.
Performance measurements on a virtual memory computer system in a batch-processing environment
Authors: Alan Batson, Robert Brundage
Venue: Proceedings of the SIGOPS workshop on System performance evaluation (1971)

A standard benchmark mix has been developed for a B5500 computer, and was run under different operating conditions to investigate the effects of overlaying on system performance. The results provide some data on the changes in throughput associated with the support of a virtual memory scheme.
A recursive virtual machine architecture
Authors: Hugh C. Lauer, David Wyeth
Venue: Proceedings of the workshop on virtual computer systems (1973)

This paper summarizes the preliminary design of a computer system with a recursive, virtual machine architecture and gives a brief account of the considerations leading to that design . In this system, each process operates in its own address space, called its virtual memory, and can create other processes within its space and pass control to them. The newly create d processes can, recursively, create their own descendants without the knowledge or assistance of a supervisor. There is no &ldquo;privileged&rdquo; or &ldquo;supervisor&rdquo; state; protection is provided entirely by the virtual memory mechanism, and each interrupt is directed by hardware to the process designated to handle it. Virtual memories are segmented; moreover, paging is treated as a recursive application of segmentation and can occur at any level. The machine architecture encourages modular and hierarchical approaches to program design because of the high degree of protection afforded by the creation of new virtual memories at low cost.
The impending impact of distributed information systems
Authors: Norman Statland
Venue: Proceedings of the 1978 annual conference - Volume 2 (1978)

As computer users become more familiar with the capabilities of the equipment, they prefer to be responsible for their own activities - that is, operate their own equipment (under their own sets of priorities and schedules, within their own budget) and use their own data files. Since today's computers - particularly mini- computers - have reached the point where the cost of acquisition is small, many business organizations are venturing into the acquisition of Distributed Information Systems under some form of Distributed Data Processing. Management personnel, particularly those concerned with Management Information Systems (MIS), have become very conscious of the costs associated with data processing. These costs have risen over the years, in spite of the fact that both equipment and communication costs have been reduced. The rise in costs - attributed to poor quality software and the failure of MIS management to improve productivity within the software development process - is the largest problem to be encountered in implementing Distributed Information Systems.
A methodology for protocol design and specification based on an extended state transition model
Authors: Richard Chung
Venue: ACM SIGCOMM Computer Communication Review (1984)

A lot of effort is being dedicated world-wide to defining Open Systems Interconnection (OSI) protocol standards and tools for formally describing them. However, little work is done in developing methods for applying these tools to the development of new protocols. This paper presents such a methodology based on OSI and software engineering principles. It provides general guidelines for designing protocols based on an extended state transition formal description technique (FDT). It emphasizes a systematic, analytical and algorithmic approach to achieve completeness of protocol specification during the protocol design process. Its possible application to the development of OSI protocol standards is discussed and suggested for study by the standards community.
An integrated multiprocessing array for time warp pattern matching
Authors: Bryan Ackland, Neil Weste, D. J. Burr
Venue: Proceedings of the 8th annual symposium on Computer Architecture (1981)

Pattern matching by dynamic time warp has recently been widely applied in the fields of speech and visual pattern recognition. A new approach to this technique that is based on an orthogonal array of simple processing elements is presented. The approach emphasizes using parallel computation and pipelined data flow to achieve extremely high throughput. The internal architecture of the basic processing element and an integrated CMOS implementation are described. Simulation estimates indicate performance gains of up to 200:1 over existing techniques.
Perturbation testing for computation errors
Authors: Steven J. Zeil
Venue: Proceedings of the 7th international conference on Software engineering (1984)

The use of algebraic techniques in defining a neighborhood of functions is particularly suited to testing for computation errors. Two possible approaches are Howden's algebraic testing method and perturbation testing, which in this paper is generalized to permit analysis of individual test points rather than entire paths. These approaches are shown to be mathematically equivalent when applied to a program's black-box output. Perturbation testing, however, offers more flexibility in the choice of potential errors to be investigated. A significant alternative offered by perturbation testing is the ability to work in the static domain, choosing test data to eliminate possible error terms in specific assignment and output statements.
Simulation of an individual making decisions under uncertainty
Authors: Francis D. Tuggle, F. Hutton Barron, Richard O. Day
Venue: Proceedings of the 6th conference on Winter simulation (1973)

A computer simulation model, SIDIP (Simulation of Individual Decisions through Information Processing), of a person making nine decisions under uncertainty is sketched. Eight of a subject's (S's) choices are consistent with the Laplace or maximize expected value criteria and S's other is consistent with the Savage (minimax regret) criterion (see Luce and Raiffa, 1957). SIDIP implies that the subject does not use the conventional computational processes dictated by those criteria. SIDIP reproduces S's articulated choice behavior: inconsistent use of choice criteria, rejection of some alternatives, and eventual choice from the preferred alternatives. Analysis of information processing models of suboptimal decision behavior suggests operational techniques by which decision making can be improved.
Software reliability: The role of programmed exception handling
Authors: P. M. Melliar-Smith, B. Randell
Venue: ACM SIGSOFT Software Engineering Notes (1977)

The paper discusses the basic concepts underlying the issue of software reliability, and argues that programmed exception handling is inappropriate for dealing with suspected software errors. Instead it is shown, using an example program, how exception handling can be combined with the recovery block structure. The result is to improve the effectiveness with which problems due to anticipated faulty input data, hardware components, etc., are dealt with, while continuing to provide means for recovering from unanticipated faults, including ones due to residual software design errors.
The Strategic Petroleum Reserve Distribution (SPRED) simulation model
Authors: Dennis Taillie, John Neidlinger, Joseph Demasco, William Begenyi
Venue: Proceedings of the 10th conference on Winter simulation - Volume 2 (1978)

The Strategic Petroleum Reserve Distribution (SPRED) Model is a large scale computer simulation model developed by ERNST ERNST, Washington, D.C. for the Department of Energy (DOE) and the Maritime Administration, Department of Commerce. The Model has been developed using SIMSCRIPT II.5 in an interactive timesharing mode. The Model is a versatile tool for studying present and future import patterns at U.S. ports, as well as for analyzing the alternative solutions to problems concerning the realistic and efficient distribution of the strategic petroleum reserve. This paper describes the system the Model simulates, various types of potential Model applications and the Model structure.
A practical application of Parnas modular approach
Authors: Joyce R. Calabro, Maria M. Pozzo
Venue: Proceedings of the 5th ACM SIGSMALL symposium on Small systems (1982)

In the development of a system, it is often desirable to break it up into pieces so that different people can work on several parts simultaneously. This paper discusses the criteria used to decompose an actual system into modules and the effect this decomposition had on the implementation of that system.
A Logic-in-Memory architecture for large-scale-integration technologies
Authors: A. M. Peskin
Venue: Proceedings of the ACM annual conference - Volume 1 (1972)

A computing machine is described which is structured around a distributed logic storage device called the Processing Memory. This machine, the Brookhaven Logic-In-Memory Processor (BLIMP), is meant only as a vehicle for simulating and evaluating its concepts, rather than for eventual fabrication. In particular, it is shown that the architecture used is very well suited to large-scale-integration (LSI) implementation technologies. It was first necessary to redefine the various goals of logic design optimization in the context of LSI implementation. Then an elemental building block of the Processing Memory is described as having evolved from associative memory circuits. It is shown that a computer such as BLIMP which utilizes the Processing Memory concept can meet the goals of design optimization for LSI. Design techniques for this project were developed as they were required. Of particular importance is a simulation system called MODEL, which documents the structure and analyzes the behavior of the proposed system.
Design and verification of large-scale computers by using DDL
Authors: Nobuaki Kawato, Takao Saito, Fumihiro Maruyama, Takao Uehara
Venue: Proceedings of the 16th Design Automation Conference (1979)

This paper describes the total support system for DDL which has been approved by design engineers at Fujitsu. A simulator is used not only at register transfer level but also with gate level description. The translator generates gate level designs which are then optimized by designers. The verifier has powerful functions to detect conflicts in specification and its implementation.
Recommendations for the first course computer science
Authors: Elliot Koffman, Philip Muller, Caroline Wardle
Venue: Proceedings of the fifteenth SIGCSE technical symposium on Computer science education (1984)

Working under the Curriculum Committee of the Education Board of the ACM, the committee has developed a detailed analysis of the requirements of the first course in computer science as described in the current ACM curriculum guidelines. The report includes the material which should be included in such a course and also recommendations for effective presentation of the material. Discussion of the computer laboratory and implications of increased exposure to programming experiences by incoming students is included.
An APL batch scheduler improves service and system management
Authors: Jeff Shrager, Lyle Hartman
Venue: ACM SIGAPL APL Quote Quad (1983)

An APL.MS2 system is described which enhances the behavior of the batch task scheduler for the Univac 90 series system: VS/9. In addition to permitting customized task control on a per-shift basis the system manager can interactively tune the system's batch load. The workspace communicates through operator commands and implements a simple algorithm which spreads the batch load so that both large and small tasks can execute. This work is an instance of the application of APL to systems programming in order to provide elegant interactive operating system tools.
Context-sensitive immediate constituent analysis&mdash;context-free languages revisited
Authors: P. Stanley Peters, Robert W. Ritchie
Venue: Proceedings of the first annual ACM symposium on Theory of computing (1969)

The ability of context-sensitive grammars to generate non-context-free languages is well-known. However, phrase structure rules are often used in both natural and artificial languages, not to generate sentences, but rather to analyze or parse given putative sentences. Linguistic arguments have been advanced that this is the more fruitful use of context-sensitive rules for natural languages, and that, further, it is the purported phrase-structure tree which is presented and analyzed, rather than merely the terminal string itself. In this paper, a language is shown to be context-free if and only if there is a finite set of context-sensitive rules which parse this language; i.e., if and only if there is a collection of trees whose terminal strings are this language and a finite set of context-sensitive rules which analyze exactly these trees.
Communication primitives supporting the execution of atomic actions at remote sites
Authors: Kurt Rothermel
Venue: Proceedings of the ACM SIGCOMM symposium on Communications architectures and protocols: tutorials symposium (1984)

A request manager is described that provides a set of communication primitives supporting the cooperation between processes requesting service and processes providing service. These communication primitives allow the initiation and termination of atomic actions at remote sites. They also maintain recoverable action state tables, which can be used to recall uncompleted actions during restart recovery. The presented request manager is a good foundation on which to develop application oriented high-level primitives as well as language level primitives. Besides a detailed description of the services offered by the request manager, the paper develops a request management protocol that, no matter what happens, insures the atomic property of actions. Evaluation nets, which are a modified form of Petri nets, are applied to describe this protocol.