ppxscal/embedding_network huggingface dataset:
The exponential Markov stochastic model
Authors: Salah M. Yousif
Venue: Proceedings of the 7th conference on Winter simulation - Volume 2 (1974)

This paper presents a system stochastic model described by Kolmogorov's differential equations which they lead in the steady state to the system balance equations. Applications of this model to some engineering simulation situations are briefly treated.
On the precision of probabalistic process generators in GPSS
Authors: Julian M. Scher
Venue: Proceedings of the 9th conference on Winter simulation - Volume 1 (1977)

The precision of several &ldqqo;standard&rdquo; probabalistic process generators, as provided to the GPSS user in various textbooks and language manuals, are investigated in this paper. In particular, the unique requirements in GPSS for integral increments in its simulation clock, as well as its background integer and truncation features, are seen to have an inherent impact on methodologies for the generation of probabalistic processes. Thus, GPSS requires that we invoke a discrete approximation to any underlying continuous probabalistic process. The GPSS programmer should be keenly aware of these aspects; failure to do so could lead to a model lacking the desired verisimilitude to the object system under study. A methodology is then developed in this paper which utilizes a least squares approach to yield process generators for the exponential, Gaussian and other continuous distributions. This approach is seen to overcome several of the difficulties associated with the conventional GPSS process generators, and will be useful in numerous instances.
The dynamic re-evaluation of alternatives and the emulation of human decision making
Authors: Joe K. Clema, Mark Fynewever
Venue: Proceedings of the ACM annual conference - Volume 2 (1972)

C&Oslash;NSIM (Conflict Simulator), a computer program designed to heuristically simulate decision making (3), has incorporated Bayes' Theorem in its structure to re-evaluate alternatives as new information becomes available to the decision maker. With this ability to re-evaluate alternatives utilizing both present and past information, even complex areas such as international affairs may be heuristically studied and analyzed. By employing elements of game theory, computer modeling and simulation, Bayes' Theorem, and probabilistic utility theory, the authors have developed a program that simulates decision making for n-person, zero-sum games with an arbitrary number of alternatives for each participant. The capability of human misunderstanding and misinterpretation of opponent's decisions has been included in the model. The methodology of C&Oslash;NSIM is general and may be applied in virtually any area of decision making where the alternatives are mutually exclusive, exhaustive, and the decision maker is willing to use a Bayesian approach in the assignment of probabilities, or has statistical records available.
Segmentation-Based Lossless Compression for Color Images
Authors: Carmen Serrano, Begoña Acha, Rangaraj M. Rangayyan
Venue: Proceedings of the 10th International Conference on Image Analysis and Processing (1999)

It is generally accepted that a color image may be encoded by using a gray-scale compression technique on each of the three-color planes. Such an approach, however, does not take advantage of the correlation existing between the color planes. In this paper, a new segmentation-based lossless compression method is proposed for color images. The method exploits the correlation existing among the three-color planes by treating each pixel as a vector of three components, and performing region growing and difference operations using the vectors. The method performed better than the Joint Photographic Experts Group (JPEG) standard by an average of 0.68 bit/pixel with a database including four natural color images of scenery, four images of burn wounds, and four fractal images. A transformation from the RGB planes to the luminance, in-phase, and quadrature-phase (YIQ) planes is applied, obtaining much better compression efficiency, given by 2.42 bits/pixel over JPEG.
A design automation system for telephone electronic switching system
Authors: Frank E. Swiatek
Venue: Proceedings of the 14th Design Automation Conference (1977)

An overview is given of the development and operation of a large computer-aided design (CAD) system for the physical realization and documentation of Electronic Switching Systems. The No. 4 ESS physical characteristics contain frames of equipment which include a large number of plug-in digital logic thin film circuit packs. An integrated computer support system with data base management control has been developed to assist in the design of such systems. Specifications for the CAD system were jointly established by user and programming teams. The CAD system is used in a hierarchial manner. Programs are executed to design and build data bases at the circuit pack level. These data bases then form the building blocks to progess to the next level of circuit pack electrical interconnection or frame level of design and documentation. Subsequent use of the frame level data base, together with a data base which describes the physical (geometric) relationship of circuit packs in the frame yields still another data base which contains backplane detailed wiring requirements. The entry of design changes and the data base management of the large number of data bases are accomplished by the formal application of data verification and check programs following each change transaction. The computer-aided system described herein has been a significant factor in the rapid development of No. 4 ESS. Cost and schedule effectiveness has been achieved. The benefits of computerized data generated from design inception through manufacturing and testing applications has been realized.
Managing the economics of computer programming
Authors: George F. Weinwurm
Venue: Proceedings of the 1968 23rd ACM national conference (1968)

The computer, perhaps more than any invention of this century, has elicited a fanciful, and even a utopian, mood on the part of many of its proponents. Indeed, acceptance of the computer and its potential has been in the realm of the fantastic. Yet, it seems clear that the full potential of the computer will not and cannot be realized until the development and the application of information processing systems can be managed reliably in an economic sense, i.e., until a generally accepted and generally applicable management methodology becomes generally available. The lack of an effective and readily transferable management methodology is becoming more and more of an issue with the user community as their relative and their absolute investment in information processing, and its importance to their operational and competitive well-being, grows. The purpose of this session is to provide a substantive overview of the sort of management methodology that is needed and of the steps that can be and are being taken to bring it into being, focusing especially on computer programming which, in many respects, is the area within information processing where the lack of such a management methodology is felt most urgently.
The dream of a lifetime: A lazy variable extent mechanism
Authors: Guy Lewis Steele,  Jr., Gerald Jay Sussman
Venue: Proceedings of the 1980 ACM conference on LISP and functional programming (1980)

We define a &ldquo;rack&rdquo;, a data abstraction hybrid of a register and a stack. It is used for encapsulating the behavior of the kind of register whose contents may have an extent which requires that it be saved during the execution of an unknown piece of code. A rack can be implemented cleverly to achieve performance benefits over the usual implementation of a stack discipline. The basic idea is that we interpose a state machine controller between the rack abstraction and its stack/registers. This controller can act as an on-the-fly run-time peephole optimizer, eliding unnecessary stack operations. We demonstrate the sorts of savings one might expect by using cleverly implemented racks in the context of a particular caller-saves implementation of an interpreter for the SCHEME dialect of LISP. For sample problems we can expect that only one out of every four pushes that would be done by a conventional machine will be done by the clever version.
Programming of the method of characteristics for axisymmetric flow
Authors: D. C. Leigh, C. R. Eubank
Venue: Proceedings of the 1956 11th ACM national meeting (1956)

The method of characteristics for axisymmetric flow is described in Sears (1) and elsewhere and it has been programmed to various degrees for several computing machines. We wish to describe here an extensive project in use on the IBM 701 at Convair, Fort Worth. The method of characteristics for axisymmetric flow is a method of computing the exact solution to problems of inviscid supersonic steady, irrotational or rotational flow with axial symmetry. This procedure has a wide field of application. At Convair it has been used for calculating the flow about point and open nosed bodies of revolution with or without discontinuities, and hence for calculating pressure distributions, drag, and shock patterns for such bodies. It has been used in the design of axisymmetric nozzles, in the calculation of the boundary of a free jet, and in calculating the total pressure recovery of axisymmetric inlets.
Evaluation of high-order polynomial triangular finite elements using FORMAC
Authors: N. Chepurniy
Venue: Proceedings of the second ACM symposium on Symbolic and algebraic manipulation (1971)

The triangular finite element method is useful for numerical solution of field problems involving elliptic partial differential equations. Two outstanding advantages of the Method are its simplicity in dealing with complicated boundary shapes and its accuracy for polynomial expressions of high-order. In this paper an analytic derivation is given for polynomials of any order, using the inhomogeneous Helmholtz equation as an example, however the method presented is equally applicable to other field equations. The process for evaluating the coefficients is clearly defined but the manipulative labour involved in finding any but the lowest order elements is formidable. FORMAC programs are presented whereby the complete element matrices associated with a triangular element can be readily obtained for any order N. Fortran programs are inadequate because of arithmetic overflows and lack of character manipulation capabilities in the FORTRAN language. The evaluation of the coefficient matrices associated with other field equations can readily be obtained by making minor alterations to the FORMAC programs presented in this paper.
Recovery blocks in action: A system supporting high reliability
Authors: T. Anderson, R. Kerr
Venue: Proceedings of the 2nd international conference on Software engineering (1976)

The need for reliable complex systems motivates the development of techniques by which acceptable service can be maintained, even in the presence of residual errors. Recovery blocks allow a software designer to include tests on the acceptability of the various phases of a system's operation, and to specify alternative actions should the acceptance tests fail. This approach relies on certain architectural features, ideally implemented in hardware, by which control and data structures can be retrieved after errors. A brief account is presented of the recovery block scheme, together with a description of a new implementation of the underlying cache mechanism. The salient features of a proposed computer architecture are described, which incorporates this implementation and also provides a high level of detection for errors such as the corruption of code and data. A prototype system has been constructed to test the viability of these techniques by executing programs containing recovery blocks on an emulator for the proposed architecture. Experiences in running this system are recounted with respect to the execution of programs based on erroneous algorithms and also with respect to errors introduced by deliberate attempts to corrupt the system.
The intelligent voice-interactive interface
Authors: Christopher Schmandt, Eric A. Hulteen
Venue: Proceedings of the 1982 conference on Human factors in computing systems (1982)

&ldquo;Put That There&rdquo; is a voice and gesture interactive system implemented at the Architecture Machine Group at MIT. It allows a user to build and modify a graphical database on a large format video display. The goal of the research is a simple, conversational interface to sophisticated computer interaction. Natural language and gestures are used, while speech output allows the system to query the user on ambiguous input. This project starts from the assumption that speech recognition hardware will never be 100% accurate, and explores other techniques to increase the usefulness (i.e., the &ldquo;effective accuracy&rdquo;) of such a system. These include: redundant input channels, syntactic and semantic analysis, and context-sensitive interpretation. In addition, we argue that recognition errors will be more tolerable if they are evident sooner through feedback and easily corrected by voice.
Finding Invariant assertions for proving programs
Authors: Michel Caplain
Venue: Proceedings of the international conference on Reliable software (1975)

We attempt to extract from any program loop its &ldquo;Most General Invariant&rdquo; in order to either prove its correctness, including termination, or disprove it and propose corrections.
&ldquo;INSTANT CAI&rdquo;
Authors: R. F. Conklin
Venue: Proceedings of the sixth international conference on APL (1974)

This paper describes four simple APL functions which allow an author to quickly create a sequence of computer-aided instruction (CAI) questions, answers, and responses. Rather than requiring knowledge of a computer language or programming logic, the author needs only to type four lines of input for each question in a drill sequence: 1) the question, 2) the correct answer, 3) the correct answer response to the student, and 4) a hint in case of a wrong answer. Each student needs only to enter the name of a drill and follow instructions. At the end of a class session, the teacher can retrieve a set of statistics, providing student and class averages.
Computer input/output of two-dimensional notations
Authors: Morton I. Bernstein
Venue: Proceedings of the second ACM symposium on Symbolic and algebraic manipulation (1971)

Notational devices are invented to aid the visualization and mental manipulation of abstract representations or models of real or imagined problems. The notations of mathematics are a prime example, but we must not forget those of logic, chemistry, or even, computer science. The problem at hand is to provide the users of these notations with a natural means of using them to communicate with a computer for the specific purpose of using that computer as an aid. Naturalness implies that input should be as free and easy as using pencil and paper or chalk and blackboard and output should be at least as readable as printed text, without most of the restrictions imposed by presently accepted typesetting standards.
Simulation in defense management
Authors: Thomas D. Clark,  Jr., Morton Berman, Murray Geisler
Venue: Proceedings of the 12th conference on Winter simulation (1980)

The panel presentation focuses upon the role of computer simulation study and analysis in establishing and managing United States defense policy. Short presentations by panel members will provide a review of the &ldquo;state-of-the-art&rdquo; in several topic areas. Strategic policy development, force structure and sizing, logistics management, and battle gaming will be discussed. A seminar discussion will follow the presentations.
SIGCSE (Panel Session)
Authors: Richard Austing, Michael Mulder, Norman E. Gibbs, Susan Brewer
Venue: Proceedings of the 1976 annual conference (1976)

This panel will present the current work of the ACM curriculum committee on computer science (C3S), and the model curriculum subcommittee of the education committee of the IEEE computer society. Common ground between the reports of the two groups will be identified, and areas where the reports diverge from each other, and from earlier curriculum reports, will be discussed.
Publication only
Venue: Proceedings of the ACM annual conference - Volume 2 (1972)

These papers were considered to have merit worthy of ACM '72, even though there was no session for which they would be appropriate. They were therefore accepted for publication in the Proceedings.
Undergraduate computer science education
Authors: Preston C. Hammer
Venue: Proceedings of the first SIGCSE technical symposium on Education in computer science (1970)

The rapid development of electronic computers coupled with the very successful popularization of the actual and possible roles of computers has put higher educational institutions in a peculiar situation. Most universities and colleges, even while attempting to organize computer programs, have shown very little grasp of the need for computer science education. The computer manufacturers themselves have often seemed opposed to such education while eager to sell machines to be managed atrociously by untutored personnel. It is obvious that equipment as expensive as computers are, should be in charge of very well prepared people. It is also obvious that businesses, industries, and governmental agencies are not prepared to provide an adequate background in computer science. It would be a grievous error, however, to treat the computer science area as one which is merely technical and not fit for a liberal education. The intellectual character of computer science as we shall indicate more fully later, is at a higher level of thought then many computer scientists themselves realize. A strange situation has arisen in the computer science area largely due to its spectacular growth. This is the absence of well-established leaders. True, there are many competent people who have achieved a degree of recognition but there are none who have achieved a status comparable to many from the older sciences. Those computer scientists who have been best placed to lead have ignored computer science education.
Mnemonic strategies in word processing systems
Authors: Avshalom Aderet, Paul J. Hoffman
Venue: ACM SIGOA Newsletter (1984)

The useability of character mnemonics in office information systems is discussed and several issues involved in the use of mnemonics as effective design concept are highlighted in the context of word processing tasks. In a series of studies, the mnemonics technique was compared to other user interfaces, such as function-key interface or menu-driven interface. In these studies we found significant differences between novices and experienced operators with respect to ease of performance and ease of recall of word processing operations. Our results suggest that experience plays an important role in operating a mnemonics-driven system compared to a non-mnemonics driven system. Additional research is needed in order to understand the ways by which mnemonics strategies affect the performance of office information systems.
Office automation: New arena for old struggle
Authors: Abbe Mowshowitz
Venue: Proceedings of the 1983 annual conference on Computers : Extending the human resource (1983)

Office work accounts for one-half of the total employment in the United States. In 1978 there were 15.6 million professional and technical workers, 8.8 million managers and administrators, 6.4 million salesworkers, and 17.8 million clerical workers, for a grand total of 48.6 million white-collar employees constituting 49.8 percent of all workers. 1 The Bureau of Labor Statistics projects an increase in this category of at least 24.9 percent, compared with 18.6 percent for blue-collar workers, 31.4 percent for service workers, and a decline of about 21 percent for farm workers. Although service occupations are expected to be the fastest growing occupational group during 1978-1990, the largest number of new jobs will occur in the white- and blue-collar categories. The former is expected to increase by 12.1 to 16.1 million jobs; the latter by 5.9 to 8.9 million.
A low cost hierarchical system for VLSI layout and verification
Authors: Tom H. Edmondson, Richard M. Jennings
Venue: Proceedings of the 18th Design Automation Conference (1981)

With IC complexity and the manhour effort required for design doubling every two years, new approaches to layout and mask verification are required. A low-cost VLSI layout and verification system was developed to produce cost effective designs using present resources. The system is IC technology independent, makes effective use of present design skills while maintaining density, and includes structured and behavioral intelligence to aid design verification. In addition, it is easy to learn to use since it provides a simplified design methodology for layout.
Current trends in the development of integrated general purpose CAD systems
Authors: R. Jacquart, Ph. Regnier, F. R. Valette, J. Foissau
Venue: Proceedings of the 12th Design Automation Conference (1975)

This paper is approaching the computer aided design problem only from the programming point of view. Let us begin with two remarks to explain this approach: [i] very often computer aided design is heavily technology oriented; we mean that very often in a design process, the computer is used for the only phase of technological design of the object. [ii] moreover, until quite recently, CAD was considered only through application areas as, for example: aeronautics, electronics (circuits analysis), layout of printed circuits, civil engineering, ship building, etc...
The A.M. Turing Award: 1971 ACM A. M. Turing Award
Authors: John McCarthy
Venue: Proceedings of the 1971 26th annual conference (1971)

The A. M. Turing Award is given each year to an individual for his technical contributions to computer science and engineering. Upon acceptance of the award, the winner delivers the annual Turing Lecture. Dr. McCarthy's presentation, &ldquo;The Present Status of Research in Artificial Intelligence,&rdquo; will be published in an ACM publication subsequent to the conference.
Hierarchical coroutines a mechanism for improved program structure
Authors: Leonard I. Vanek, Rudolf Marty
Venue: Proceedings of the 4th international conference on Software engineering (1979)

The design of a built-in hierarchical coroutine mechanism for a procedural language is described. This mechanism allows the simultaneous activation of coroutines and recursive procedures and permits coroutines to have value or reference parameters. It is argued that this design has clearer semantics than the traditional view of coroutines (particularly in the presence of recursion) while retaining the feature that makes coroutines useful&mdash;the ability to leave a coroutine without destroying its internal state. The problems encountered in creating type-safe and well defined parameters are discussed an a solution is outlined.
The use of simulation in the design of information systems
Authors: A. L. Frank
Venue: Proceedings of the second conference on Applications of simulations (1968)

This paper describes the application of simulation to the design and analysis of information systems. The philosophy of such models is described in detail. Then the actual application of the technique is discussed.
A network interface unit simulation using micro passim
Authors: Tom P. Vayda, Larry L. Wear
Venue: Proceedings of the 15th conference on Winter simulation - Volume 1 (1983)

This paper describes how micro PASSIM, a GPSS based simulation system, was transported from the Apple II to the HP 9836. The problems associated with moving a large program form one UCSD Pascal system to another are discussed. Micro PASSIM was transported to the HP system so that an Ethernet to HPIB interface board could be modeled. The model is described and the results obtained from the simulation are discussed. A discussion of the advantages and disadvantages of using micro PASSIM rather than a standard language, such as GPSS, is also included.