ppxscal/embedding_network huggingface dataset:
A PL/I model of an emergency medical system
Authors: Kenneth F. Siler
Venue: Proceedings of the 6th conference on Winter simulation (1973)

A comprehensive PL/I simulation model has been developed for evaluating existing and proposed emergency medical systems. The model is composed of two sub-models and a unique analysis package. The first sub-model generates a "representative" stream of emergency incidents from user specified tables. This incident stream becomes the input to the second sub-model which simulates an emergency medical system responding to the incidents. An event-oriented methodology is used in the simulation. Performance of the model is validated by simulation using actual data from the San Fernando Valley area of Los Angeles. The model is keynoted by a user orientation, flexibility, and generality which is not found in other EMS models. AI input to the model is checked for consistency to avoid erroneous computer runs. Numerous dispatch and retrieval alternatives for emergency vehicles can be tested by varying only a few parameters of the simulation. Furthermore, both simple and complex emergency medical care systems can be represented easily. Results of the simulation using the two sub-models is analyzed by a unique PL/I program. Using the preprocessor facility of PL/I, a tailor-made analysis program is constructed. In simulations involving many variables, such as an EMS simulation, it is almost impossible to design an analysis program that satisfies all relevant research. To circumvent this problem, the analysis package allows the user to specify his desired analysis and then constructs a PL/I program to do it. Experience with the package demonstrates its usefulness and efficiency.
Analysis of error remediation expenditures during validation
Authors: Mary Anne Herndon, Ann P. Keenan
Venue: Proceedings of the 3rd international conference on Software engineering (1978)

Approximately 200 errors were detected during the formal in-house validation of a real time communications system that provides for ship-to-shore communications via both conventional and satellite links. A cost equation was developed to assess the utilization of expenditures associated with validation. The components of this equation reflected the costs that are typically expended during validation, such as reporting, analysis, remediation, retesting, and general managerial over-head. The results of a parametric analysis of the cost equation with respect to error cause and system impact indicated a significant under utilization of resources expended for validation.
Information resource management(IRM): Theory applied to three environments
Authors: John F Schrage, John M Blair, Forest Woody Horton,  Jr., Boulton B Miller
Venue: Proceedings of the ACM '81 conference (1981)

The Information Resource Management (IRM) concept will be defined with reference to available resources written on the topic. The major business related information systems curricula projects by Association for Computing Machinery (ACM) and Data Processing Management Association (DPMA) will be shown with their respective philosophy around the resource management area. The professional society which has emerged from the resource management area will also be described. Discussion will be initiated on the relevance to the business curriculum of IRM with details on how implementations of concepts have been done on both the graduate and undergraduate levels. A specific example of IRM training will be presented with an overview of how the material is applied in other educational settings.
Digital signature schemes for computer communication networks
Authors: Henk Meijer, Selim Akl
Venue: Proceedings of the seventh symposium on Data communications (1981)

This paper introduces four new digital signature schemes for computer communication networks. These involve one or more arbitrators who validate and authenticate messages and signatures without having access to the actual contents of the messages.
How to teach structured COBOL to beginners
Authors: Daniel D. McCracken
Venue: Proceedings of the 1975 annual conference (1975)

Since all programming should be taught according to a structured approach and since COBOL is the most widely-used programming language, it is important to find good ways to teach a structured form of COBOL to beginning students in data processing. It is argued that COBOL, although not ideal for structured programming, is considerably better than sometimes thought. A possible course outline is presented, and three illustrative programs demonstrate the pedagogical and programming feasability of the approach suggested.
Development and application of a designer oriented cyclic simulator
Authors: G. J. Parasch, R. L. Price
Venue: Proceedings of the 13th Design Automation Conference (1976)

Because of the increasing complexity of the role of the design engineer, in the design of digital systems, the need has arisen for a behavioral modeling technique which can be accurately controlled by the designer, with minimal effort, while remaining relatively error free. Explored here will be a technique for behavioral modeling of digital system designs which is in variance with the more traditional approaches. It will be shown how the design engineer will be basically responsible for the construction of a model, by use of a design language, and yet be relatively unencumbered by the myriad of programming restrictions and conventions normally imposed on those who generate simulation models. With this technique it becomes possible for the design engineer to be reasonably familiar with the construction of a model while, at the same time, the need for highly skilled programmers is greatly reduced. The more intimately familiar the design engineer is with a model, the more gainful can be the use of that model for testing the algorithms of the design. There will be discussion on the specification of models by use of flowcharts, enabling the design engineer to maintain a current pictorial representation of his design. The problems of documenting ones design, and how this method helps to provide accurate documentation, will be discussed. Fragmentation of an algorithm within a model will be discussed and it will be shown how portions of an algorithm can be modified without concern of adversely affecting any other portions of the algorithm. Cyclic aspects of simulators will be discussed and correspondence will be made between simulator time intervals and actual hardware time intervals. A technique will be discussed for achieving the effect of parallelism in logic execution while at the same time eliminating the concern of the sequential nature of programs. The problem of signal ordering will be discussed along with a method for insuring proper signal ordering. The various types of facilities available will be described and their correspondence to actual logic functions will be discussed.
Efficient Word Segmentation Driven by Unconstrained Handwritten Phrase Recognition
Authors: Jaehwa Park, Venu Govindaraju, Sargur N. Srihari
Venue: Proceedings of the Fifth International Conference on Document Analysis and Recognition (1999)

An efficient system which finds the best match between an input image and a lexicon is presented. To capture writing style of spacing between words and characters prime stroke analysis based on statistical methods is introduced.A method for estimating bound on number of characters without actual recognition is also presented. For system efficiency, before actual recognition, classified groups of word segments and eligible subset of lexicons are generated as hypotheses. The hypotheses are verified and ordered by a lexicon driven word recognizer. We have tested our approach in the street name recognition/interpretation for US mail stream. Experimental results and encouraging.
EDP management personnel education
Authors: Richard Cheng, Ivan Rosenberg
Venue: Proceedings of the thirteenth annual SIGCPR conference (1975)

Organizations are paying increasing attention to the efficiency of their EDP operations. In these days of excessive computer systems, high inflation and recession, no longer can business be casual about EDP expenditures. The primary problem with filling the EDP management positions is the unique blend of technical expertise and management skills required. Unfortunately, these positions are usually occupied by persons with technical expertise but with no management training. Formal training is needed for adequate performance. Time on the job is spent in managing the installation, learning about its particular features, and in keeping abreast with the field.
The description and the structure of ALGOL N
Authors: N. Yoneda
Venue: Proceedings of the international symposium on Extensible languages (1971)

ALGOL 68 has been designed as a powerful successor of ALGOL 60. It is a monumental language, but we regret the complexity of it and its description. This has been the primary motivation for our designing ALGOL N, a more viable successor of ALGOL 60, as powerful as ALGOL 68, and yet described in a much simpler way. Some characteristics of ALGOL N will now be given. The letter 'N' is short for 'Nippon', which means 'Japan' in Japanese. 1. An easy-to-grasp meta-language for the syntax description is devised. It is logically equivalent to BNF, but the whole syntax can be compactified by its use. Thus the syntax of ALGOL N (see Appendix) is even shorter and easier to understand than the BNF syntax of ALGOL 60. There are a number of extensions to the strict language just as in ALGOL 68. 2. The semantics is described with rigor, partly in prose of mathematical clarity, and otherwise, in the form of simple programs in a semantics description language called the 'core language'. 3. Basic data types are effect, real, bits, string, and reference from which types of array-style, structure-style, and procedure-style are compounded. The result of a completed elaboration of an expression is (aside from possible side effects) a 'quantity' of some 'mode' with which some value of a fixed type is associated. The type specifies a machine-independent domain of values such as the domain of real numbers, while the mode prescribes the behavior of a quantity upon assignment of a value (e.g. rounding). Coercion is avoided by this system without tears. 4. The treatment of operators is generalized so that the unified notion 'formula' covers term, factor, assignment statement, for-statement, conditional expression, etc. This together with the feature that, in specifying a type, any sample expression having an established type may be used, makes the mode-indication in ALGOL 68 only a special case of 0-ary operator.
An overview of a multi associative processor study
Authors: Gary J. Nutt
Venue: Proceedings of the 1974 annual conference - Volume 1 (1974)

In this paper, a brief introduction is given to a multi associative processor computer system. This architecture embodies multiple control units, each capable of SIMD operation on an associatively addressed set of processing elements. The purpose of the study is threefold: to investigate the capability of a new system architecture; to study measurement and evaluation techniques for this and similar classes of architecture; and to derive some general properties of operating systems for machines of this general class.
Reproductive adaptive plans
Authors: Daniel J. Cavicchio,  Jr.
Venue: Proceedings of the ACM annual conference - Volume 1 (1972)

This paper traces the experimental development of a new class of powerful and flexible adaptive plans, called reproductive plans. Adaptive plans are formally presented as search procedures for locating superior devices in an extremely large space. Reproductive adaptive plans operate by treating the search procedure as an evolutionary process of finding the best organism in a certain environment. Devices are represented as strings or chromosomes. At each &ldquo;generation&rdquo; or time step a population of devices is tested and each device is copied (rewarded) according to its performance. Then the copies &ldquo;mate&rdquo; using a number of genetic-like operators to produce a modified population of devices. In this particular study devices are pattern recognition programs although they could be any set of modifiable procedures. Much of the work is concerned with experimentally testing and improving the general reproductive plan to achieve fast and continuous adaptation.
Iterative vs. a directive method for solving fourth order elliptic difference equations
Authors: Louis W. Ehrlich
Venue: Proceedings of the 1966 21st national conference (1966)

We compare a block successive overrelaxation method (BSOR) with a direct method for solving difference equations derived from fourth order elliptic partial differential equations. The direct method appears to be competitive in time and accuracy for a general problem.
A general system for computer based acquisition, analysis and display of medical image data
Authors: Daniel S. Schlusselberg, Wade K. Smith, Margaret H. Lewis, Bradley G. Culter, Donald J. Woodward
Venue: Proceedings of the ACM '82 conference (1982)

A general computer-based system has been developed and implemented for acquiring and viewing medical image data. Originally developed for neuroanatomic studies (1), including investigations of cell topography and connectivity in brainstem nuclei, the system has become a versatile and powerful tool for three-dimensional analysis and display of a variety of types of image data, including studies of cardiac morphometry and 2-d gel electrophoresis. The system includes components for data input via video frame digitizer or digitizing tablet; graphical output through a high-resolution color graphics display or hardcopy plotter. Keys to the system's flexibility and power are a tree-structured data file system, in which line segments and shaded strips may be combined to form complex three-dimensional structures, and a disk-based virtual memory system which permits greater numerical accuracy and use of larger structures than would be otherwise possible with a 16-bit minicomputer.
AUTOLOFT: The AUTOLOFT geometric processor
Authors: R. Maier
Venue: Proceedings of the SHARE design automation workshop (1964)

I'm going to talk about one phase of the design automation problem, that of the geometric computer processor, using as an example North American's AUTOLOFT system. Any design automation system requires a modicum of geometric ability, both in the analytic definition and manipulation areas. In the APT (Automatic Programmed Tool) system, both areas are well-developed, with many automatic features provided such as the continuous guiding of the tool - a geometric object - along the part and driving surfaces in response to a single initiating command, suitably interpreted. In common with other interpretive systems, the effective on-going program of such a processor is, so-to- speak, &ldquo;thrown together&rdquo; at execution time while the affective or meta-program consists of special command-and-control instructions never required to be organized into a complete, closed, or unified body at input time.
An experimental comparison of relevance-feedback techniques
Authors: Roger W. Elliott, Lee E. Cashman
Venue: Proceedings of the ACM annual conference (1973)

This paper describes an experiment in which seven relevance feedback document retrieval techniques are compared. It is shown that for the set of parameters and indexed document collection used, two of the techniques performed worse than the initial queries and that the greatest gains in precision for the others occur at low levels of recall. At the extreme recall levels no significant differences were found among any of the techniques while over all recall levels no significant differences were found among five of the techniques.
Comparting strategies for effecting social change in large organizations by means of modeling
Authors: Richard L. Justice
Venue: Proceedings of the 9th conference on Winter simulation - Volume 1 (1977)

Effecting social change in large organizations can at once be both a simple and a complicated task. It can be a simple task because business and industry have always been involved in the process of managing change; that's the very essence of their existence. It can be difficult because managing social change in this country is one of the more challenging problems of the century. This paper will attempt to delineate what some of the problems are and how they can be studied in the industrial environment. What is meant by social change? There are a large number of topics of broad social interest today, such as ecological, environmental, safety, and health that are of considerable interest to the private and public sectors alike. However, for this paper, we are going to restrict our attention to the topic of effecting social and organizational change within the human resources of large industrial organizations
A package of computer subprograms for control system analysis
Authors: G. J. Williams, R. S. Miles, L. C. Casady, J. P. Edenhofer
Venue: Proceedings of the 4th Design Automation Conference (1967)

This paper describes a package of digital computer subprograms which provides control systems engineers at Autonetics with an easy-to-use, comprehensive, and flexible design-aid tool The subprograms are written in FORTRAN IV for the IBM 7094. Most of the subprograms are similar to ones found in almost every company's program files. They provide such standard capabilities as the generation of Bode plots, Root Locus plots, Nyquist plots, Nichols charts, and time and frequency response. The package contains three subprograms, however, which are not standard. These employ dichotomous techniques to generate transfer functions for active networks and continuous control systems. Since these techniques are currently attracting widespread interest, the three subprograms which implement them will be discussed in some detail.
VHM : a Virtual Hardware Monitor
Authors: Vittore Casarosa, Carlo Paoil
Venue: Proceedings of the workshop on virtual computer systems (1973)

We describe here the features and the implementation of a system that collects information about the activity of the virtual machines generated by CP-67. This system can collect information about CPU usage and I/O activity of the virtual machine without interfering with its operation and without knowing what the system running in the virtual machine is doing. In this sense it behaves like an hardware monitor behaves on a real machine, and hence has been called Virtual Hardware Monitor (VHM). VHM provides a general tool that can be used by any virtual machine. The information it provides, eventually used in connection with those provided by other systems that monitor the total activity of CP-67, can lead to a better knowledge of the load of CP-67 and to an improvement in the performance of CP-67 itself and in the performance of the various virtual machines.
Stepwise Segmentation and Interpretation of Section Representations in Vectorized Drawings
Authors: Hans Grabowski, Chenguang Liu, Arno Michelis
Venue: Proceedings of the Fifth International Conference on Document Analysis and Recognition (1999)

This paper describes a procedure for data extraction and interpretation of section representations in vectorized line drawings. Vectorized drawings are considered as graph representation. The hatch areas are analyzed and extracted in regard of their geometric and topologic characteristics with the help of context analysis. With the semantic interpretation, the referred view representations of half-and local sections in same view direction are completed in the viewpoint of orthogonal projection and are then available for 3D geometric reconstruction with known algorithms.
Generation of value-consistent multi-valued prime implicants
Authors: William R. Smith,  III, Ramon Duggan
Venue: Proceedings of the sixth international symposium on Multiple-valued logic (1976)

In sum of products realizations of multi-valued functions the covering of values is handled in two distinct ways - the k-cover scheme, whereby each value of a function is covered by its own set of implicants; and the value-consistent scheme, whereby an implicant may cover any and possibly all values. A new method of generating the value-consistent prime implicants from those of the k-valued covers is presented which is fairly simple to use by hand, and has been programmed to take advantage of the several binary methods already developed for realizing k-covers. The method involves a max-like operation which is easily applied in two steps to the k-cover prime implicants to yield the value-consistent terms. If properly applied all terms fall out with very little redundancy or subsumption.
Automated software engineering through structured data management
Authors: C. A. Irvine, J. W. Brackett
Venue: Proceedings of the 2nd international conference on Software engineering (1976)

The Software Engineering Facility (SEF) is a system for software engineering which is specifically designed to support the development of well-engineered software. However, it is not an operating system. Unlike operating systems such as OS/370, EXEC 8, and others, the SEF is not meant to support the execution of applications programs, just as the ordinary operating systems are not intended to specifically support the development of well-engineered applications programs. The SEF, in fact, will run under and use the facilities of such operating systems. It, then, is easily transferable and can be used with various hardware/operating system configurations where it will provide a host-independent software development system. In such a role it will provide to the software developer standard facilities across a variety of host systems. The SEF provides the central support for an integrated collection of subsystems, and the subsystems provide appropriate facilities for all phases of the software development process, from requirements definition through maintenance and enhancement. Each such subsystem contributes in a cohesive way towards the cost-effective development of well-engineered software. The design of the SEF was determined only after a careful analysis of the software development process and a thorough study of recent efforts in the field of software engineering.
Introduction to GPSS
Authors: Thomas J. Schriber
Venue: Proceedings of the 13th conference on Winter simulation - Volume 1 (1981)

Summary information about key aspects of the simulation programming language GPSS is provided. The class of problems to which GPSS applies especially well is described; commentary on the semantics and syntax of the language is offered; the learning-oriented literature for GPSS is summarized; various GPSS implementations are commented on; the time-sharing networks offering GPSS are cited; and public courses on the language are listed. Finally, the source of a tutorial introduction to the fundamental semantics and syntax of GPSS is given. Copies of this tutorial material, excluded from reproduction here because of page-count limits, will be distributed at the session and provide the basis for the session itself.
Real time diagnosis of logic assemblies
Authors: F. David Patch, Lubomyr M. Zobniw
Venue: Proceedings of the 7th Design Automation Workshop (1970)

The logic Diagnostic Algorithm is a real-time procedure that analyzes the failure responses of a logic assembly under test, and automatically directs a monitor probe to selected accessible points on the logic assembly to gather additional information. Deterministic conclusions are reached after one or more iterations of probing to locate the error to the lowest replaceable unit.
A simulation model for strip mining
Authors: D. W. Sifferd
Venue: Proceedings of the second conference on Applications of simulations (1968)

The purpose of this paper is to present concepts and approaches for implementing a strip mining production planning system. Submodels within this system use FORTRAN IV, GPSS/360, MPS/360, and MARVEL languages.