ppxscal/embedding_network huggingface dataset:
A Monte Carlo Process for Determining Response Times for Tactical Systems
Authors: Leroy C. Sanders
Venue: Proceedings of the second conference on Applications of simulations (1968)

The MACK tactical system is a highly Mobile Command and Control system. To monitor system performance for the MACK tactical system, analysis was conducted to support the design and development of the logic for the functional elements of the Operational and Recording Programs and their interface capability with the Executive and with associated peripheral equipments. This analysis provided the capability for continuous monitoring of the operating environment from the point of sequencing computer subprograms, allocating the necessary storage requirements and satisfying response time requirements. This analysis was conducted by the development of a Monte Carlo Process for Determining Response Times for Tactical Systems simulation program.
The automatic printed wire routing system of BACKIS
Authors: G. J. Miron, S. R. Tarrant
Venue: Proceedings of the 12th Design Automation Conference (1975)

As the printed wiring density on circuit packs and equipment multilayer boards increases, it becomes increasingly difficult for the unaided human to route the printed wire paths needed to interconnect the terminals constituting an electrical node (i.e., a net). Thus, a large amount of effort has been devoted to providing computer aids to assist the designer with the routing problem. The ultimate aim is to provide an automatic routing system which will achieve complete net connectivity meeting all hardware and electrical constraints. While the system presented here does not completely reach these goals, it does represent one of a series of steps in attempting to achieve it. It does this by providing fast, cost effective routers embodied in a system design which permits the user wide latitude in controlling the routing strategy to be used. This paper discusses the concept of a routing strategy, what strategies may be used, and some comments on what has been found to be an effective strategy.
Link Segment System
Authors: James A. Porter
Venue: Proceedings of the 1961 16th ACM national meeting (1961)

Our profession, the art of preparing programs for electronic computers, is now experiencing an evolutionary phase similar to that which other professions have experienced from their inception to maturity. In this phase of our professional activity we are attempting to find the most efficient procedures for operating computers and preparing computer programs for our customers. Recognizing these factors, I believe the Link Segment philosophy is our answer for a more economical and efficient approach to the problems than anything we have had in the past. The LSS concept, if implemented adequately has the following potentials: 1) benefiting the programming staff in their preparation of the production programs and the systems programmers preparing the utility routines; 2) aiding the analyst in his design of specifications for these programs; 3) representing a base for management in their estimation of keeping costs as low as possible. By exploring some of the details of the LSS concept we can see how the above problems are solved.
Chapter 1: Methodology
Venue: Specifications on The SIGGRAPH/GSPC Core System (1977)

In order for successful design activity to take place, two essential ingredients must exist. The first of these is a body of knowledge on which to base the design. The second is a set of strategies or codes of practice, based on this body of knowledge, that the designer can follow in order to produce his design; we call this a design methodology. In attempting to design a graphics standard, we can fall back on a fairly extensive body of knowledge, represented by the graphics literature. We lack the corresponding methodology for graphics standards design&mdash;indeed, prior to 1976 the notion of such a methodology hardly existed. Over the last year and a half, however, a great deal of progress has been made towards developing a useful design methodology for graphics standards. This chapter discusses a methodology for graphics standards, and shows how it leads to the specification of a standard graphics package, called the Core System.
A framework for the measurement of software quality
Authors: Joseph P. Cavano, James A. McCall
Venue: ACM SIGMETRICS Performance Evaluation Review (1978)

Research in software metrics incorporated in a framework established for software quality measurement can potentially provide significant benefits to software quality assurance programs. The research described has been conducted by General Electric Company for the Air Force Systems Command Rome Air Development Center. The problems encountered defining software quality and the approach taken to establish a framework for the measurement of software quality are described in this paper.
Implementation consideration for machine translation
Authors: Allen B. Tucker,  Jr., Giuliano Gnugnoli, Long Vo Nguyen, Bedrich Chaloupka
Venue: Proceedings of the 1978 annual conference - Volume 2 (1978)

This paper describes the implementation and operational features of a machine translation (MT) system for Spanish and English text. Sample translations from Spanish to English and English to Spanish are illustrated. The system's computer hardware and software requirements are also presented, along with an assessment of the ongoing machine dictionary management requirements.
Probabilistic analysis of bandwidth minimization algorithms
Authors: Jonathan Turner
Venue: Proceedings of the fifteenth annual ACM symposium on Theory of computing (1983)

We study the probabilistic performance of heuristic algorithms for the NP-complete bandwidth minimization problem. Let (equation) be a graph with (equation). Define the bandwidth of G by (equation) where &tgr; ranges over all permutations on V. Let A be a bandwidth minimization algorithm and let A (G) denote the bandwidth of the layout produced by A on the graph G. We say that A is a level algorithm if for all graphs (equation) the layout &tgr; produced by A on G satisfies (equation) The level algorithms were first introduced by Cuthill and McKee [1] and have proved quite successful in practice. However, it is easy to construct examples that cause the level algorithms to perform poorly. Consequently worst-case analysis provides no insight to their practical success. In this paper we use probabilistic analysis in order to gain an understanding of these algorithms and to help us design better algorithms. Let (equation) be the graph defined by (equation) and let G be a random spanning subgraph of Bn&darr; in which the vertices have been randomly re-labelled. We show that if A, is a level algorithm and (equation) then (equation) almost always holds, where &egr; is any positive constant. We also introduce a class of algorithms called the modified level algorithms and show that if A ' is a modified level algorithm and (equation) then (equation) almost always holds. A particular modified level algorithm MLA1 is analyzed and we show that when (equation). We also study several other properties of random subgraphs of Bn&darr;.
An Integrated Productivity, Training, and Performance Planning/Appraisal Framework
Authors: Robert A. Rouse
Venue: Proceedings of the 1979 annual conference (1979)

Improving the productivity of computer personnel requires an integrated view of the factors which promote effective and efficient work. Motivation, training, performance planning and productivity are so closely interrelated that to attack them individually results in initiatives which often conflict with one another and lead to confusion of ends by professional personnel. Successful integration of these factors results in a management style and organizational form that supports the accomplishments of productive work. The framework identifies five major areas contributing to performance and behavior: personal effort, knowledge and skills, attitudes and values, environment, health and sense of direction. These areas define the impact of training, personal development, management style, project control, performance planning and job/goal direction-setting on performance and behavior.
Corporate simulation models - a review and reappraisal
Authors: William F. Hamilton
Venue: Proceedings of the 6th conference on Winter simulation (1973)

This paper examines the potential and the practice of simulation modeling for corporate financial planning. The contributions of formal models to the planning process are reviewed and appropriate design features are proposed. Comparative analysis of simulation and optimization applications in corporate planning points to substantial functional complementarity and opportunities for combined use. An actual planning system involving both simulation and optimization techniques is described to illustrate the feasibility and potential of the hybrid modeling approach.
A &ldquo;non-restrictive&rdquo; artwork verification program for printed circuit boards
Authors: David Kaplan
Venue: Proceedings of the 19th Design Automation Conference (1982)

This paper describes a PCB artwork verification program which imposes virtually no restrictions on the layout designer. The program is capable of making fast and reliable verifications of layouts of any type and style. The concepts and techniques used to achieve the &ldquo;non-restrictive&rdquo; feature of the program are discussed. A unique characteristic of the program is the special treatment of nonelectrical elements. The program has been proven by continuous practical use in a dynamic production environment.
A complete mechanization of (&ohgr;) -order type theory
Authors: T. Pietrzykowski, D. C. Jensen
Venue: Proceedings of the ACM annual conference - Volume 1 (1972)

We present a complete unification algorithm for logic with the language of all finite types. In addition, we show how this procedure can be used with a generalized resolution principle which does not require expressions to be pre-Skolemized. Both of these steps are essential for an effective and complete mechanization of higher order logic.
On decomposing languages defined by parallel devices
Authors: Sven Skyum
Venue: Proceedings of seventh annual ACM symposium on Theory of computing (1975)

In this paper we give a method for decomposing subclasses of different families of languages, into other possibly smaller families. This method can be used to produce languages not in a family by using known examples of languages not belonging to other families.
Artificial intelligence and self-organizing systems: An experimental model of adaptive memory
Authors: S. Warshall
Venue: Proceedings of the 1962 ACM national conference on Digest of technical papers (1962)

AN ADAPTIVE MEMORY may be conveniently viewed as a space in which data are stored and which is subjected to structural deformation as a function of the ways in which the data are used. The intent of the deformation is to produce a space whose metric places in close proximity information which is highly correlated historically. The average access time per piece of data in a data request may be fairly low even though access time to the first piece located is large. After enough data requests have been serviced so that the statistics of the environment seem to be stable&mdash;and thus the space is holding still&mdash;a second phase of adaptation may occur. In this phase an attempt is made to generate two functions which map from the formal representation of the data request and the data, respectively, into the space. These are referred to as the retrieval function and the storage function, respectively.
Feedback coupled resource allocation policies in the multiprogramming-multiprocessor computer system
Authors: Richard S. Brice, J. C. Browne
Venue: Proceedings of the 1974 ACM SIGMETRICS conference on Measurement and evaluation (1974)

This paper presents model studies of some integrated feedback-driven scheduling systems for a multiprogrammed computer system. This abstract can present only the conclusions of the studies and little of the supporting data and detail. The basic format of the analysis is to fix a size for the local buffers and a total size for the collection buffers, to define a set of algorithms for the determination of the data removal quanta to the local buffers, the allocation of space in the collection buffers, and the look-ahead mechanism for input and then to evaluate the relative merits of the various strategies by the resulting CPU efficiency. Three feedback algorithms are studied as examples in this work.
Performance aspects of disk space management
Authors: James O. Dyal, Michael K. Draughn
Venue: Proceedings of the 13th conference on Winter simulation - Volume 1 (1981)

Dynamic Disk Space Management is a set of strategies for allocating files to disk storage devices so as to reduce seek time, device contention, and storage fragmentation. In this paper, the impact on system throughput and user response time is projected, via simulation model results, for a small general-purpose operating system which manages large capacity disk drives.
Formulation of design rules for NMR imaging coil by using symbolic manipulation
Authors: John F. Schenck, M. A. Hussain
Venue: Proceedings of the fourth ACM symposium on Symbolic and algebraic computation (1981)

A common problem in electrical technology is to design a current carrying coil that will produce a given magnetic field. For over a hundred years an equation, the Biot-Savart law, has been available that defines precisely the magnetic field at any point as a line integral along the path of the electric currents that are the sources of the field. In principle then, the design problem is straightforward - it is merely necessary to invert the Biot-Savart law and find a path whose line integral has the given values at the specified field points. However, the actual solution is not trivial and there is a continuing need for improved computational methods for relating magnetic fields to their sources. Two forms of series expansion will be considered here - the ordinary Taylor series and the expansion in spherical harmonics. Other possible expansions - such as Bessel function methods for cylindrical coordinate problems - usually involve integrals over some eigenparameter rather than discrete sums and are not directly competitive with the methods discussed here.
A study of branch prediction strategies
Authors: James E. Smith
Venue: Proceedings of the 8th annual symposium on Computer Architecture (1981)

In high-performance computer systems, performance losses due to conditional branch instructions can be minimized by predicting a branch outcome and fetching, decoding, and/or issuing subsequent instructions before the actual outcome is known. This paper discusses branch prediction strategies with the goal of maximizing prediction accuracy. First, currently used techniques are discussed and analyzed using instruction trace data. Then, new techniques are proposed and are shown to provide greater accuracy and more flexibility at low cost.
The computerized statesman: Further explorations into the escalation of conflict
Authors: Douglas F Johnson, William L Mihal
Venue: Proceedings of the 1971 26th annual conference (1971)

An experiment is described which treats the computer as an interacting member of a dyad in studying the social psychology of conflict. An internation simulation is used to test the effects of threat type (Deterrent vs. Compellent), situation (Hostile vs. Friendly set) and opponent (Man vs. Computer) on compliance. The results indicate that those playing against the computer are more likely to initiate an early pre-emptive attack. Of those that do not attack, though, those playing against the computer are more likely to comply to a threat than those playing another person. Further, compellent threats are less likely to be complied with and are more likely to result in an attack from the person being threatened. Possible reasons for these findings are discussed. Finally, it was found that individual self-perceptions and perceptions of the other vary as a function of the condition.
The design and implementation of a virtual machine operating system using a Virtual Access Method
Authors: James H. March
Venue: Proceedings of the workshop on virtual computer systems (1973)

In the autumn of 1969, we decided to try a new approach to the design of a virtual machine operating system. Until that time, most installations using Virtual Machine Monitors merely ran operating systems that already existed for &ldquo;stand-alone&rdquo; use. Few, if any, installations had attempted to design and create an operating system that took advantage of its running environment. The Virtual Machine Monitor we were using was a highly modified version of CP-67 which was designed to operate on an IBM S/360 Model 67. Our design motivation centered on the reduction of CP-67 overhead by reducing the amount of virtual memory required to support the operating system. A secondary design goal was to produce a &ldquo;production oriented&rdquo; system. The resulting operating system should be able to be &ldquo;tailored&rdquo; to a particular user's requirements. The design of the New System (NS), as it came to be called, revolved around the fact that it not only knew it was executing within a virtual machine, but took advantage of it. Special communication links were designed and installed allowing NS to more directly control its paging and I/O profile.
Problems, complete in &ldquo;average&rdquo; instance
Authors: Leonid A. Levin
Venue: Proceedings of the sixteenth annual ACM symposium on Theory of computing (1984)

Many interesting combinatorial problems were found to be NP-complete. Since there is little hope to solve them fast in the worst case, researchers look for algorithms which are fast just &ldquo;on average&rdquo;. This matter is sensitive to the choice of a particular NP-complete problem and a probability distribution of its instances. Some of these tasks were easy and some not. But one needs a way to distinguish the &ldquo;difficult on average&rdquo; problems. Such negative results could not only save &ldquo;positive&rdquo; efforts but may also be used in areas (like cryptography) where hardness of some problems is a frequent assumption. A concept of &ldquo;NP-complete random problems&rdquo; proposed below may serve this purpose.
Visiting industrial professors and sabbaticals in industry
Authors: Robert R. Korfhage
Venue: Proceedings of the first SIGCSE technical symposium on Education in computer science (1970)

Since computer science is an applied science, it seems wise that computer science departments maintain close contact with computer-based industry. This may be done through programs calling for an active interchange of academic and industrial computer scientists.
Pressurized water reactor [PWR] system simulation and disturbance analysis for anomalous transients and degraded system conditions
Authors: V. K. Dhir, S. Guarro, J. C. Lin, M. Motamed, D. Okrent
Venue: Proceedings of the 11th conference on Winter simulation - Volume 1 (1979)

In this paper potential applications of disturbance analysis to improve availability and safety of light water reactors (LWR's) are discussed. Needs for developing on-line computer aided guidance to the reactor operator during anomalous transients are pointed out. Currently available methods to simulate primary and secondary systems of a pressurized water reactor (PWR) during anomalous transients and other conditions severely degraded from normal operation are reviewed. Limitations of these methods for simulation of operational transients are mentioned. Finally, using one of the existing codes, steam line rupture in a PWR is analyzed.
A Methodology for Woody Crop Location and Discrimination in Remote Sensing
Authors: J. García-Consuegra, A. Martínez, G. Cisneros
Venue: Proceedings of the 10th International Conference on Image Analysis and Processing (1999)

In this paper, we provide a solution to a common problem in Remote Sensing when woody crops (almond and olive fields, vineyards, and so on) must be located and discriminated. Experience has taught us that, currently, the usual way to accomplish this task is with a photo-interpreter digitizing on the images. Our solution is based on a widely used and accurate texture segmentation such as the Multi-Channel Filtering (MCF) based on Gabor Functions (GF) and on the ECHO (Extraction and Classification of Homogeneous Objects) approach to carry out the segmentation process. The test bed consisted of high spatial resolution images such as aerial photography and those images scanned by the Daedalus-1268 multi-spectral scanner on board of an airborne platform. Favorable results were yielded with both types of images, in particular, the discrimination between almond and olive fields were carried out in the case of multi-spectral images.
Analysis of the optical array imaging system and construction of an adaptive imaging algorithm
Authors: O. Ikeda
Venue: Proceedings of the 1995 International Conference on Image Processing (Vol. 1)-Volume 1 - Volume 1 (1995)

In a previous article by Ikeda (1991), an optical array imaging system has been presented, which collects the array data and derives the eigenvalue with the largest eigenvalue to get images of the object. For some objects, however, the eigenvector fails to give sharply resolved object images. A preliminary study showed this problem could be solved by using a subset of the array data instead of the full set. In this paper, the integral equation describing the system is analyzed and an adaptive algorithm is constructed, to get reliable estimates of the optimum subapertures in a very short time. The algorithm is investigated thoroughly using both computer-generated and experimentally obtained array data.
Self-assessment for the computing professional: Consideration of a natural delivery system
Authors: Terry J. Frederick
Venue: ACM SIGCSE Bulletin (1976)

Self-assessment is a procedure based on questions and answers covering knowledge in technical areas which allows an individual to determine his own activities for the purpose of keeping up with progress in his field. It is assumed that the individual wishes to continue active learning and that he wants to identify his deficiencies (usually in a manner where no one else knows of them). A major premise regarding self-assessment is that it should primarily be an educational experience for the participant. An alternative to using the professional testing agency approach for developing and administering self-assessment procedures for the computing field is proposed.
An intensive instruction format for information systems
Authors: John F. Schrage, Robert A. Schultheis
Venue: ACM SIGCSE Bulletin (1984)

For over fifteen years Southern Illinois University at Edwardsville has offered management information systems courses using an intensive weekend format at locations around the United States. Although a variety of information systems courses in the Masters of Business Administration has been provided, the most frequently taught course has been Introduction to Information Systems. The introduction course combines elementary computer and data processing concepts, programming, applications, and systems analysis and design. However, the emphasis of the course is analysis and design of systems from a manager, or user frame of reference. Because of the nontraditional format of the course, a variety of instructional strategies have evolved to insure successful student achievement of course objectives. Frequent comparisons between the test scores of students finishing the off-campus program and students completing the on-campus program indicate that the achievement levels are equivalent.