ppxscal/embedding_network huggingface dataset:
Software development methodology and technology for the TALON combat simulation model
Authors: Henry Kleine
Venue: Proceedings of the 13th conference on Winter simulation - Volume 1 (1981)

The subject of this paper is a methodology and technology used for the program development and documentation of the TALON Combat Simulation Model. TALON was developed for the Air Force at Nellis Air Force Base, Nevada. It is a broadly scoped model encompassing many functional elements such as Ground Operations, Air Operations, Reconnaissance, Intelligence, etc. Because of the size and scope of the model, heavy emphasis was placed on developing and using state-of-the-art methodology for program design, coding, documentation, and configuration management. As a result of this emphasis, many new methods and techniques were developed and implemented in the TALON project with satisfying results. This paper contains examples taken from the TALON model but, it should be noted that the methods and techniques themselves can be applied generally to any software development task.
Error-correcting strategies and human interaction with computer systems
Authors: Adam V. Reed
Venue: Proceedings of the 1982 conference on Human factors in computing systems (1982)

Human problem-solving strategies may be classified as error-preventing (no response is chosen until one can be selected with relatively high confidence) or error-correcting (a tentative solution is formulated immediately, subject to revision in the light of subsequent evidence). Recent work in the author's laboratory indicates a strong preference for error-correcting over error-preventing strategies on the part of human problem-solvers. Unfortunately, most contemporary computer languages and programming environments enforce an error-preventing rather than error-correcting strategy. Using Marvin Minsky's concept of a frame, an error-correcting programming strategy may be thought of as obtaining a program frame with all parameters pre-set to their default values, and then revising those values until a script corresponding to a successful solution is arrived at. The present paper defines a frame-based programming environment which can accommodate error-correcting programming strategies, and discusses the application of such environments to different types of programming languages.
Concurrent software system design supported by SARA at the age of one
Authors: Ivan M. Campos, Gerald Estrin
Venue: Proceedings of the 3rd international conference on Software engineering (1978)

This paper presents a multilevel modeling method suitable for the design of concurrent hardware or software systems. The methodology is requirement driven and uses tools incorporated in a programming system called SARA (Systems ARchitect's Apprentice). Both top down refinement and bottom up abstraction are supported. The design of an asynchronous sender receiver illustrates the key steps in going smoothly from programming in the large to programming in the small or actual code. The same methodology can be used to design hardware systems by applying different pragmatics than those proposed for software systems. SARA consists of a set of interactive tools implemented both at UCLA and also on the MIT-Multics system. Although SARA continues in long-term development, completed design tools accessible for experimentation by authorized users at either location via the ARPANET.
Symbols, graphics and architectural education: The pagan experience
Authors: Michael Kennedy
Venue: Proceedings of the 14th Design Automation Conference (1977)

A graphics language for introducing beginning architecture students to discrete symbols and computer graphics is presented and its uses discussed.
Structured model specification with a supportive simulation architecture
Authors: Edward R. Comer
Venue: Proceedings of the 15th annual symposium on Simulation (1982)

Recent emphasis in structured software development has resulted in a greater awareness of an orderly methodology for problem solving. This disciplined approach is adapted for model specification. Through the use of structured software techniques and a Model Specification Language (MSL) a complex distributed computer system model is derived and documented. The model specification is supported by a discrete event simulation architecture which directly reflects the model structure.
The effect of environment on computer science curriculum
Authors: Gerald L. Engel, Bruce H. Barnes
Venue: Proceedings of the second SIGCSE technical symposium on Education in computer science (1972)

In this paper by tracing the history of the programs and outlining the programs themselves, a comparison will be made of the factors that lead to the creation and development of a computer science program in a large state university and in a small liberal arts college. In the first case the program leads to a baccalaureate degree in computer science. In the second it is a branch of the mathematics curriculum. Along with the factors of educational philosophy environmental factors such as the relationship of the department to the institution, equipment desired and available, the relationship to the computer center and facilities for faculty development will be considered.
A method to document data entry forms
Authors: C. S. Sankar
Venue: Proceedings of the 2nd annual international conference on Systems documentation (1983)

All of us receive data entry forms manually and electronically. These forms have to be filled and returned. They vary in size, content and clarity. Frequently parts of them are duplicates, but the duplication is concealed by the use of different terminology. The amount of duplicate input will increase sharply in the future, as more and more forms are communicated electronically. This paper describes a method to document data entry forms. This method converts a paper form to computerized form, divides the form into data elements, identifies synonyms and replaces them with one preferred term, standardizes mathematical relationships, and arrives at a smaller subset of elements for which actual values have to be input. Once values are input for this limited subset, the method can compute the values for the other derived elements and produce the final filled-in form. All the data elements in the forms are thus documented precisely. Six different software products have to be developed and linked together to make this method operational. The work on these is also described.
Graphical data structures in APL
Authors: Martin Hardwick
Venue: Proceedings of the international conference on APL (1981)

The continuing reduction in the price of graphics terminals has led to greater interest in graphics and computer aided design. This trend has in turn focussed attention on methods of modelling graphical data using programming languages and databases. This paper presents a method of defining, analyzing and transforming graphical data using an extended APL notation. The fundamental extension this notation makes to APL is to allow the items in an APL array to have a user defined data structure. A consequence of this extension is that the items in an array can now represent graphical entities such as circles, lines, points etc. In conventional APL an item in an array must be either a number or a character. In this extended notation an item in an array might be a structure designed to represent a point, or a circle, or any other entity.
On sharing of pages in CP-67
Authors: P. N. Wahi
Venue: Proceedings of the workshop on virtual computer systems (1973)

Sharing of procedure code among user-programs is a controversial concept in computer systems operating in a virtual machine and a time-sharing environment. In some systems the sharing can be effected at a segment level while in others it is effected at a page level. A model for sharing of pages in a CP-67/360 environment is developed and the results of experiments are presented.
Effectiveness of spatially-variant apodization
Authors: Jung Ah Choi Lee, D. C. , . Jr. Munson
Venue: Proceedings of the 1995 International Conference on Image Processing (Vol. 1)-Volume 1 - Volume 1 (1995)

Sidelobe artifact is a common problem in image reconstruction from finite-extent Fourier data. Conventional shift-invariant windows applied to the Fourier data, reduce sidelobe artifacts at the expense of worsened mainlobe resolution. Stankwitz et al. (1995) have suggested spatially-variant apodization (SVA) as a means of reducing the sidelobe artifacts, while preserving the mainlobe resolution. SVA adaptively selects windows from a set of raised-cosine weighting functions. The algorithm is heuristically motivated, and is known to be effective in synthetic aperture radar (SAR) imaging. However, this technique has received only limited analysis. In this paper, we formulate SVA as a spectral estimator, and show that SVA is a special version of the minimum variance spectral estimator (MVSE). We study the properties of SVA that are inherited from MVSE. Then, we consider the application of SVA to spectral estimation and Fourier reconstruction. Although SVA is effective in SAR, we show that it has limitations for reconstructing real-valued extended targets.
An importance sampling scheme for simulating the degradation and failure of complex systems during finite missions
Authors: Leonidas C. Kioussis, Douglas R. Miller
Venue: Proceedings of the 15th conference on Winter Simulation - Volume 2 (1983)

The variance reduction technique of path-splitting is applied to reliability analysis of complex systems. Two approaches are given. In the first, paths are split into a fixed prespecified number of branches. In the second, a sequential procedure is used to estimate the number of branches which will give the maximum variance reduction. The method is illustrated on a simulation of a simplified model of a fault-tolerant computer system. The estimated variance reduction ranged from 36% to 61%.
Heuristics for weighted perfect matching
Authors: Kenneth J. Supowit, David A. Plaisted, Edward M. Reingold
Venue: Proceedings of the twelfth annual ACM symposium on Theory of computing (1980)

The problem of finding near optimal perfect matchings of an even number n of vertices is considered. When the distances between the vertices satisfy the triangle inequality it is possible to get within a constant multiplicative factor of the optimal matching in time O(n2 log K) where K is the ratio of the longest to the shortest distance between vertices. Other heuristics are analyzed as well, including one that gets within a logarithmic factor of the optimal matching in time O(n2 log n). Finding an optimal weighted matching requires &thgr;(n3) time by the fastest known algorithm, so these heuristics are quite useful. When the n vertices lie in the unit (Euclidean) square, no heuristic can be guaranteed to produce a matching of cost less than [equation] in the worst case. We analyze various heuristics for this case, including one that always produces a matching costing at most [equation]. In addition, this heuristic also finds a traveling salesman tour of the n vertices costing at most [equation]. A different one of the heuristics analyzed produces asymptotically optimal results. It is also shown that asymptotically optimal traveling salesman tours can be found in O(n log n) time in the unit square.
The future of programming&mdash;whither APL?
Authors: John R. Searle
Venue: Proceedings of the international conference on APL (1984)

Changes in the computing industry can be expected to maintain their spectacular growth rate of recent years. The implications of these changes for programming languages, and on the techniques required by computer software professionals, are briefly discussed. In particular, the role of APL in this changing environment is analysed, with the intention of identifying some deficiencies in the current status of the language. Possible modifications are then suggested, in order to develop APL into an even more useful and generally acceptable tool for problem solving.
The Oak Ridge Automatic Computer
Authors: J. C. Chu
Venue: Proceedings of the 1952 ACM national meeting (Toronto) (1952)

The ORACLE (Oak Ridge Automatic Computer Logical Engine) is a general purpose digital computer, designed and constructed at the Argonne National Laboratory for the Oak Ridge National Laboratory. Production of the major electronic units has been carried out by Technitrol Engineering Company of Philadelphia, Pennsylvania. The construction started in November, 1951. In logical design, it belongs to the parallel asynchronous type. The number system is binary with fixed binary point. The orders which can be executed by the machine can be classified as of the following types: Arithmetic Memory and arithmetic unit transfer Control transfer Memory and auxiliary memory transfer. A total of seventy-seven individual orders is provided.
Algebraic analysis of nondeterministic behavior
Authors: S. Leinwand, T. Lamdan
Venue: Proceedings of the 17th Design Automation Conference (1980)

This paper is concerned with the analysis of design errors that lead to unpredictable response of digital systems. Besides classical topics, such as hazards and races, the analysis of malfunctions in real circuits is also included. After defining the notion of behavior and nondeterministic response, a general approach for detecting such design problems through algebraic analysis is presented. Compared with existing simulation methods, the algebraic technique provides results of improved accuracy. Another basic advantage is the ability to accomodate modular synthesis of digital systems. Examples show how the proposed methods deal with sequential circuits under various delay assumptions. In particular, analysis of designs based on nominal delay parameters and on window delays is presented. A novel method, aiming at spike detection, is also presented. The ability of the algebraic analysis to detect errors in a modular design environment is illustrated by means of an example. Finally, the topic of nondeterministic behavior at RTL is briefly discussed. Notably, an algebraic method for deriving setup and hold time constraints from the circuit delay parameters is proposed.
Edge-deletion and edge-contraction problems
Authors: Takao Asano, Tomio Hirata
Venue: Proceedings of the fourteenth annual ACM symposium on Theory of computing (1982)

For a property -&-pgr; on graphs, the corresponding edge-deletion problem PED(-&-pgr;) (edge-contraction problem PEC(-&-pgr;), resp.) is defined as follows: Given a graph G, find a set of edges of minimum cardinality whose deletion (contraction, resp.) results in a graph satisfying property -&-pgr;. In this paper we show that the edge-deletion problem PED (-&-pgr;) (edge-contraction problem PEC (-&-pgr;), resp.) is NP-hard if -&-pgr; is hereditary on subgraphs (contractions, resp.) and is determined by the 3-connected components.
A scheme for coordinating the processing services and documentation of the remote batch user
Authors: Dorothy A. Creswell
Venue: Proceedings of the 5th annual ACM SIGUCCS conference on User services (1977)

An effective, efficient method for scheduling services and coordinating documentation is desirable for any data processing center large or small. The small remote user has needs which differ from those of the large central computing facility, partly because with the smaller staff individuals perform multiple jobs, and also because the absence of one member from the team is a significant factor. The scheme to be presented was developed pragmatically, and has seemed to work well.
Statistical Approach to Feature Extraction for Numeral Recognition from Degraded Documents
Authors: V. Vaidya, V. Deshpande, D. Gada, B. Shirole
Venue: Proceedings of the Fifth International Conference on Document Analysis and Recognition (1999)

In this paper, we propose a fast statistical method , which follows the statistical approach to for numeral recognition from degraded documents. Our method uses a feature-based approach in combination with weights assigned to each feature along with a factor that defines how much of the feature is detectable. We describe an object by how it looks (does not look) by giving positive (negative) weights for those features. Also it is equally important to describe an object in terms of what it is not by assigning negative weights. In the proposed method, the positive and negative weights together describe a numeral completely and help to clearly distinguish one numeral from the other.Recognition rate obtained by this method is much higher than that obtained by a simple feature-based method. We present results of 160 bills printed on a dot matrix printer. There are many variations in the printed output such as faded bills or highly smudged outputs. With this level of distortion, the numerals are sometimes ambiguous to human eyes. However our method can recognize the distorted numerals with a success rate of 97%. The algorithm takes about 0.01 seconds for recognition of a single numeral on a Pentium 200 MHz machine.
Teacher certification in computer education
Authors: David Moursund
Venue: Proceedings of the 1975 annual conference (1975)

The instructional usage of computers at the secondary school level is well established, and is growing fairly rapidly. The article begins with a discussion of current computer availability and usage in Oregon. After projecting future growth, it discusses certification for the computer non-expert, for the computer teacher, and for the computer instruction specialist. The article concludes with a discussion of courses and programs of study needed for teacher certification. The paper is designed to serve as a basis for planning and discussion for groups involved in the teacher certification process.
An open operating system for a single-user machine
Authors: Butler W. Lampson, Robert F. Sproull
Venue: Proceedings of the seventh ACM symposium on Operating systems principles (1979)

The file system and modularization of a single-user operating system are described. The main points of interest are the openness of the system, which establishes no sharp boundary between itself and the user's programs, and the techniques used to make the system robust.
GASP IV simulation of nuclear waste
Authors: Jeffery Lee Turek, Elden L. Deporter, Harold A. Kurstedt,  Jr., Charles E. Rasbach, Steven K. Funk
Venue: Proceedings of the 13th conference on Winter simulation - Volume 1 (1981)

The current governmental research and development program for the disposition of high-level nuclear wastes from both defense and commercial sources is modelled using a discrete GASP IV based simulation. The simulation utilizes, as input, actual and current data from various DOE management information systems. A sampling of disposition data contained within these systems are milestones, storage facility capacities, and predecessor and successor relations. Decision variables include facility capacities and on-line times. Results indicate the time scheduling for bringing interim and final storage facilities on-line and the capacities of these facilities. An accident analysis module provides a probabilistic methodology to quantify intangibles such as congressional approvals and societal demands. The objectives of the simulation are to provide an effective management tool where the impact of alternative decisions can be evaluated and to gain visibility of existing and related data on waste disposition.
Computer literacy objectives for college faculty
Authors: Janet D. Hartman
Venue: Proceedings of the 11th annual ACM SIGUCCS conference on User services (1983)

The personal computer has had an enormous impact on our society during its short life span. Microcomputer sales are soaring; costs continue to decrease putting the computer within the reach of nearly everyone. Schools have rapidly begun to acquire hardware and software to aid teachers in the educational process. The infusion of computers into the schools extends upward into higher education. College faculty are becoming increasingly aware that the computer is going to have some impact in every discipline. The fact that computer literacy objectives are being established for students in many institutions makes faculty even more aware that they, too, must become computer literate. In trying to meet the literacy needs of faculty some questions arise: What is computer literacy? What should the content of a faculty computer literacy program be? How much is enough? Who will provide for the computer education of faculty? The purpose of this paper is to provide answers to some of these questions.
A model of Univac 1100/42 swapping
Authors: Lawrence W. Dowdy, Hans J. Breitenlohner
Venue: ACM SIGMETRICS Performance Evaluation Review (1981)

The performance of a computer system depends upon the efficiency of its swapping mechanisms. The swapping efficiency is a complex function of many variables. The degree of multiprogramming, the relative loading on the swapping devices, and the speed of the swapping devices are all interdependent variables that affect swapping performance. In this paper, a model of swapping behavior is given. The interdependencies between the degree of multiprogramming, the swapping devices' loadings, and the swapping devices' speeds are modeled using an iterative scheme. The validation of a model is its predictive capability. The given swapping model was applied to a Univac 1100/42 system to predict the effect of moving the swapping activity from drums to discs. When the swapping activity was actually moved, throughput increased by 20%. The model accurately predicted this improvement. Subtopics discussed include: 1) the modeling of blocked and overlapped disc seek activity, 2) the usefulness of empirical formulae, and 3) the calibration of unmeasurable parameters. Extensions and further applications of the model are given.
An interactive computer graphics space allocation system
Authors: S. Al Banna, W. R. Spillers
Venue: Proceedings of the 9th Design Automation Workshop (1972)

An interactive graphics space allocation system is described with which a designer at the console of an IBM 2250 can generate and edit preliminary building layouts.
The effect of modularization and comments on program comprehension
Authors: S. N. Woodfield, H. E. Dunsmore, V. Y. Shen
Venue: Proceedings of the 5th international conference on Software engineering (1981)

An experiment was conducted to investigate how different types of modularization and comments are related to programmers' ability to understand programs. Forty-eight experienced programmers were given eight different versions of the same program and asked to answer a twenty question quiz used to measure comprehension. These eight different versions were the result of the program being constructed with four types of modularization (monolithic, functional, super, and abstract data type), each with and without comments. Those subjects whose programs contained comments were able to answer more questions than those without comments. Also, those subjects who were given the abstract data type version of the program were able to do significantly better than those with any other type of modularization.
Investment Analysis application + style
Authors: J. Beetz
Venue: Proceedings of the eighth international conference on APL (1976)

Investment Analysis is a classical application in Long-Range Planning. It deals with the investigation of uncertainties, the evaluation of alternatives, the answer to &ldquo;What-if&rdquo; questions. This paper shortly describes the key problems in this application domain, shows how the flexibility and power of APL can cope with the complexity of the problems, and especially high-ligths how the style of the APL programs and the problem solution influence each other.