ppxscal/embedding_network huggingface dataset:
Winner selection
Authors: Young Jack Lee
Venue: Proceedings of the 9th conference on Winter simulation - Volume 1 (1977)

When k alternatives are simulated (e.g. in a study to find which one optimizes the performance of some real or planned system) it is not rare for multiple criteria to be employed (i.e., several system responses are of interest and no simple combination of them, called a measure of effectiveness, is available). In such settings, n persons (who are responsible for the system, e.g. administrators, investigators, etc.) may be asked to rank the performances of the k from best to worst. An optimal method for performing this ranking will be discussed. A similar problem occurs when each of n referees ranks k contestants to select the winner of a prize (the best contestant), and it is common that not all the referees complete the full ranking. Similar situations arise when selecting the most efficient simulation algorithm. Our methods for selecting the winner also apply to data of this type.
A neuromagnetic source distribution estimation using MRI information
Authors: K. Mino, N. Niki, N. Nakasato
Venue: Proceedings of the 1995 International Conference on Image Processing (Vol. 1)-Volume 1 - Volume 1 (1995)

The authors present an algorithm for the estimation of the magnetic sources in the human brain using MRI information. It is difficult to make a complete estimation of the whole brain magnetic sources. But it is known that the neurons exist densely in the cerebral cortex. For this reason, in this preliminary study the authors limit the estimation region to the surface of the cortex. They consider all the cortex surface points as current dipoles, and by using the MUSIC technique they determine the real dipoles. The authors give here the results of their algorithm applied to real human brain data.
A technique for solving ordinary differential equations using Riemann's P-functions
Authors: Shunro Watanabe
Venue: Proceedings of the fourth ACM symposium on Symbolic and algebraic computation (1981)

This paper presents an algorithmic approach to symbolic solution of 2nd order linear ODEs. The algorithm consists of two parts. The first part involves complete algorithms for hypergeometric equations and hypergeometric equations of confluent type. These algorithms are based on Riemann's P-functions and Hukuhara's P-functions respectively. Another part involves an algorithm for transforming a given equation to a hypergeometric equation or a hypergeometric equation of confluent type. The transformation is possible if a given equation satisfies certain conditions, otherwise it works only as one of heuristic methods. However our method can solve many equations which seem to be very difficult to solve by conventional methods.
Computing with text-graphic forms
Authors: Fred H. Lakin
Venue: Proceedings of the 1980 ACM conference on LISP and functional programming (1980)

Computing with text-graphic forms occurs when text-graphic patterns are used to direct the processing of other text-graphic patterns. The PAM graphics system was designed for just this kind of computation; PAM stands for PAttern Manipulating&mdash;PAM is a generalization of LISP (McCarthy [0]) from computing with (textual) symbolic expressions to computing with text-graphic forms. Like LISP, PAM acheives processing power by providing atomic objects, means of structuring them into complex objects and taking them apart, and equality tests for objects. Text-graphic engines can then be defined, allowing text editors, text-graphic editors, circuit design aids and visual language processors to all be developed in the same LISP-like environment. Examples discussed in the paper are: handPAM is an agile environment for the manual manipulation of text-graphic objects (described briefly). writtenPAM provides programmatic manipulation of visual objects. Pattern processing is demonstrated by functions which translate a LISP sexpr to the visual name-shape synonyms of the OUTLINE notation system, and then spatially lay it out. writtenPAM also permits definition of pattern evaluating, enabling actual computation with text-graphic forms. An evaluate function for text-graphic objects is given which can execute OUTLINE expressions. An experimental version of the PAM system has been implemented in MACLISP at the Stanford Artificial Intelligence Lab.
An actor-based programming system
Authors: Roy J. Byrd, Stephen E. Smith, S. Peter deJong
Venue: ACM SIGOA Newsletter (1982)

A programming system is described with which applications are built by defining collections of communicating objects, called actors. The actor programming system provides a uniform environment in which distributed applications can be automated in a highly modular and efficient manner. The system's design is based on the formal theory of actors, with certain modifications made for the sake of efficiency. We describe our view of the actor system, and an implementation of that view. We also discuss applications built on, and contemplated for, the actor system.
Study of an automated materials handling system
Authors: Lee W. Schruben, Philip I. Moser
Venue: Proceedings of the 10th conference on Winter simulation - Volume 2 (1978)

The design and implementation of automated materials handling systems is a very complex process. System models can serve a vital role in understanding such installations. This paper describes a GPSS simulation study of a large automated molten metal carrier system. The simulation model was a major factor in the implementaion process. An important part of this study was the development and documentation of a technique for the simulation of general automated materials handling systems and assembly line networks. Both the specific situation and the general methodology are discussed.
On the rendering of surfaces
Authors: A. R. Forrest
Venue: Proceedings of the 6th annual conference on Computer graphics and interactive techniques (1979)

Despite the relative sophistication of modern surface design systems, many graphical renderings of surfaces are rather crude. The paper discusses several possible renderings, including various line drawings methods, realistic and functional shading, and combinations of line drawings and smooth shading. It concludes that a good choice is the superposition of contours or sections on either realistic or Gaussian curvature shading.
Interactive graphics and menus for computer network models
Authors: Donald F. DuBois
Venue: Proceedings of the 15th conference on Winter Simulation - Volume 2 (1983)

The Hierarchical Modeling System (HMS) is a single software package that provides a discrete event simulation and analytic modeling capability for computer networks. The analyst may reconfigure the network model depending on the number of nodes and their interconnections by making a few changes to some simple data files-no recoding of the model is necessary. This paper describes an interactive graphics front end for HMS which allows the analyst the capability for reconfiguring the model at a graphics terminal. This provides a faster, less error prone input method. In addition, changes in the network topology are more readily understood when presented graphically. Menus are used with the graphics input in order to make changes to nodal specific models.
Inductive methods of teaching programming languages
Authors: Suhrit K. Dey
Venue: ACM SIGCSE Bulletin (1973)

In this cult, computer programming is one of the most modern needs in every academic discipline. Students majoring in various subjects are inclined spontaneously to take at least the first course of computer programming with an expectation that they will be capable of writing programs in their special fields of interest. What they mostly learn is the structure of the language and the basic rules and regulations governing its use. Possibly they write few programs, usually similar to those discussed in the classroom. The students' expectations were not fulfilled and their enthusiasm in programming fades.
A statistical response surface generator
Authors: James Roger Corliss
Venue: Proceedings of the 7th conference on Winter simulation - Volume 2 (1974)

Small scale special purpose analog simulators are finding many applications as teaching aids in the classroom. One type of simulator design is currently being used in graduate level statistics courses at the University of Delaware. It was developed primarily for teaching Statistical Response Surface Technology. Statistical Response Surface Technology (SRST) is an effective way of optimizing variables in a system or process. Samples at various operating parameters are taken and analyzed according to one of many Response Surface Design techniques. This statistical sampling process can produce an accurate estimate of a maximum or minimum point, or can give the optimum coefficients of a quadratic model. The Response Surface Generator (RSG) described in this paper incorporates multivariable function simulators and a random error generator to produce a variety of response surface designs. In general, the student is given a problem based on some process or model which is simulated in the RSG. He can manipulate any of the six input variables and then read the output response. The student may be asked to find the minimum or maximum operating point, the minimum or maximum cost, or the quadratic model for the process using SRST techniques.
The why and wherefore of the Cornell Program Synthesizer
Authors: Tim Teitelbaum, Thomas Reps, Susan Horwitz
Venue: Proceedings of the ACM SIGPLAN SIGOA symposium on Text manipulation (1981)

The Cornell Program Synthesizer is a syntax-directed programming environment that has been used in introductory programming courses since June, 1979. We present our experience with the Synthesizer by introducing its main features, by presenting our basic principles of design, and by discussing important design decisions.
A program verification system
Authors: Raymond J. Hookway, George W. Ernst
Venue: Proceedings of the 1976 annual conference (1976)

A program verification system has been developed consisting of three major components. The verification condition generator(which is patterned after the work of Igarashi, London, and Luckham [10]) is used to generate verification conditions from asserted PASCAL programs. The subgoal generator(which is similar to the program described in [2])processes the verification conditions to produce simpler subgoals, a significant number of which it proves using restricted techniques. The subgoal solveris a resolution theorem prover which was developed at NIH by L. Norton [13]. The more powerful techniques of the subgoal solver are used to prove subgoals which the subgoal generator was unable to prove. The verification system has been used to verify a number of programs. These include all but one of the examples from King [11], a Bubble Sort program, and Hoare's FIND program.
An APL system for interactive scientific-engineering graphics and data analysis
Authors: G. J. Burkland, P. Heidelberger, P. D. Welch, L. S.Y. Wu, M. Schatzoff
Venue: ACM SIGAPL APL Quote Quad (1984)

This paper describes an APL system, GRAFSTAT, designed for interactive scientific-engineering plotting, data analysis, applied statistics, and customized graphics output development. It runs under VSAPL on the IBM 3277GA and 3279 graphics terminals. The system has a full screen, menu driven interface. It is synergistic with APL in that full screen entries can be APL expressions and in that the interactively developed full screen responses can be run noninteractively within the user's own APL functions. The system contains a wide range of graphics capabilities, a set of commonly applied data analysis and statistical routines, and utilities for cataloging full screen responses, application functions, and data, i.e., for the general management of the user's work sessions and work units. It provides an excellent example of the potential of APL as a software base for scientific-engineering applications in interactive environments with high resolution graphics displays.
A portable APL language test generation and verification system
Authors: Charles G. Nylander
Venue: Proceedings of the international conference on APL (1981)

The major tasks that must be performed during development and use of an APL language test system include construction of tests and verification of test results. In addition, it is desirable that a test system be transportable to a variety of APL language implementations, be extensible, and allow easy revalidation of the language implementation. In this paper, we will describe the design, implementation, and use of an extensible, portable, self-verifying APL test system that includes facilities to generate large sets of useful tests with very little effort. The test system is based on a test definition language and on an executable formal definition of the APL language. By careful use of the test system, 150,000 self-verifying language tests were constructed in four man-weeks. Transportability was achieved by using APL as the implementation language for the test system software. The successful use and transportation of this test system demonstrates that it is relatively easy to generate tests for and in the APL language.
Topographic simulation as an aid to printed circuit board design
Authors: C. J. Fisk, D. L. Caskey, L. E. West
Venue: Proceedings of the 4th Design Automation Conference (1967)

The topographic simulation technique, presented here, is part of the continuing development of the ACCEL1 system. It is based on the idea that the configurations of a circuit board can be represented in a topographic structure. This idea was first introduced to the authors by Dr. Iben Browning, Executive Director of the Thomas Bede Foundation in Los Altos, California. The ACCEL system was developed jointly by Sandia Corporation and the Thomas Bede Foundation, under contract to Sandia. The development began in the Spring of 1964 and has continued to the present. A working system has been programmed and demonstrated. The demonstration shows a circuit board being designed by the system, starting with a rough schematic of the circuit as the primary input to the ACCEL system, then proceeding through the main phases to the final computer output, which includes the actual photographic negative etching master, a finished circuit schematic, an assembly drawing, a hole drilling list, a parts list, and a jumper wire drawing.
VIPTRAN - A programming language and its compiler for Boolean Systems
Authors: Alfred C. Weaver
Venue: Proceedings of the ACM annual conference (1973)

The solution of some industrial process control problems can be expressed as a system of Boolean algebra equations using variables representing inputs from and outputs to the real world. If this system is solved sequentially, cyclically, and in real time, the outputs may be used directly to control the state of real world devices. VIPTRAN is high-level FORTRAN-like language which allows the programmer to express his Boolean system symbolically in logical (Boolean) equations. The VIPTRAN compiler reduces the input to machine code for the VIP process controller, and can plot the resulting system as a relay tree. The concept is extensible to other industrial controllers.
Use of cluster analysis to evaluate software engineering methodologies
Authors: Eric Chen, Marvin V. Zelkowitz
Venue: Proceedings of the 5th international conference on Software engineering (1981)

The development of quantitative measures to evaluate software development techniques is necessary if we are going to develop appropriate methodologies for software production. Data is collected by the Software Engineering Laboratory at NASA Goddard Space Flight Center on developing medium scale projects of up to ten man years effort. In this study, cluster analysis was used on this collected data and several measures are proposed. These measurements are objective, quantifiable, are the results of the methodology, and most important, seem relevant.
Business and engineering enriched FORTRAN (BEEF)
Authors: Norman Moraff
Venue: Proceedings of the 1964 19th ACM national conference (1964)

In April, 1961, the Westinghouse Baltimore Defense and Space Center established a truly integrated Information Processing Department with the responsibility of serving the combined needs of scientific research and engineering computer applications, as well as management information systems and business data processing. A single high-speed, large scale, binary, fixed-word length computer was selected as the heart of the computer facilities to be used. Personnel previously using similar equipment in Westinghouse had for a number of years used FORTRAN for programming the solution process of a broad spectrum of engineering work in the area of military electronics. Obviously, FORTRAN would continue to be used as a programming language in this area of activity. The limitations of FORTRAN in its original form as a data processing language were, of course, recognized, however, the introduction of another language was not considered economically feasible or desirable in the light of the heavy engineering FORTRAN load. Instead, it was decided to augment FORTRAN with a package of CALLable subroutines suitable for the new problem area. What has been developed is an enriched FORTRAN suitable for a much larger spectrum of applications than the original algebraic language. This enriched machine independent programming language is referred to as BEEF for Business and Engineering Enriched FORTRAN. This approach to the problem has also been taken by several computer installations throughout the country. In particular, Rocketdyne has implemented a system designated as COMFORTII, while the Sandia Corporation in an article in the Communications of the ACM in July 1962 outlined and commented on several of their FORTRAN callable data processing subroutines.
Methods for stratified estimation in nonregenerative simulations
Authors: Andrew F. Seila, John S. Carson
Venue: Proceedings of the 13th conference on Winter simulation - Volume 2 (1981)

We discuss a general concept of natural stratification in simulation, and present an approach to estimating mean performance measures in stationary simulations which possess a natural stratification.
Tree-oriented proofs of some theorems on context-free and indexed languages
Authors: William C. Rounds
Venue: Proceedings of the second annual ACM symposium on Theory of computing (1970)

In this paper we study some applications and generalizations of the yield theorem: the yield of a recognizable set of trees (dendrolanguage) is an indexed language [1]. Standard results on context-free languages can be obtained quickly using this theorem. We consider here the Peters-Ritchie theorem [4]: the language analyzable by a finite set of CS rules is CF. An extension of the yield theorem reads: the yield of a CF set of trees is an indexed language. We prove some closure properties of CF sets of trees. Applying the yield theorem, we obtain properties of indexed languages. As a special result, we can solve the infiniteness problem for such languages.
Articulated vehicle simulation: A fresh approach to some recurring problems
Authors: James E. Bernard
Venue: Proceedings of the 7th conference on Winter simulation - Volume 2 (1974)

Current and pending goverment standards have encouraged an expanding interest in the braking and handling of articulated vehicles. Vehicle dynamicists are increasingly turning to simulation as an aid in their analysis. Two facets of the simulation of these vehicles which are recurring stumbling blocks will be discussed here, namely (1) the digital simulation of suspensions exhibiting large amounts of coulomb friction, and (2) the limitations of previous representations of the hitch and a more comprehensive hitch model. Some details of the simulation for which this work was done and results from the validation effort are also given.
Logic enhancement: A method for extending logic programming languages
Authors: Paul R Eggert, D Val Schorre
Venue: Proceedings of the 1982 ACM symposium on LISP and functional programming (1982)

Languages based on first order logic have rapidly gained popularity as practical programming languages in several fields. With experience, several problems with the most popular such language, Prolog, have come to light. Several proposals for changes and extensions to Prolog have been made, but proposals have been expensive to build and evaluate. An inexpensive method for extension is described that relies on preprocessors and checkers written in Prolog itself. The method is efficient and applies to any logic programming language that permits manipulation of programs as objects. Several extensions have been built, including modules, macros, functional notation, repetition notation, debugging, and profiling; the first three are explored in detail.
On the size of modular numbers
Authors: Aviezri S. Fraenkel
Venue: Proceedings of the 1964 19th ACM national conference (1964)

An iterative matrix method for determining the size of modular numbers which includes some previous methods as special cases, is discussed. It is proved that for a certain class -and-bgr; of auxiliary matrices which includes a matrix used by Mann (Math. Comp., 15, 1961, 190-192), the method always converges. It is shown, roughly speaking, that for a certain sub-class of -and-bgr;, chances of reducing the number of iteration steps are very high if certain conditions are imposed on the moduli. If one uses numerically least residues instead of least non-negative residues, these chances appear to be further improved, whereas the conditions on the moduli are less stringent.
Analytic representations of simulation
Venue: Proceedings of the 16th conference on Winter simulation (1984)

In much the same way that a mathematical model of a real or conceptual system is used to improve the design and operation of the system, mathematical models of simulation are used to improve the design and operation of simulation experiments. The participants in this discussion are advocates of various analytic representations of simulation. Contained in the paper that follows are each participant's responses to a set of questions concerning the representation of simulation they represent.
&ldquo;Typesetting&rdquo; reference cards with a plotter
Authors: Richard Wiersma, Bill Landrum
Venue: Proceedings of the 6th annual ACM SIGUCCS conference on User services (1978)

In 1970 we (the Academic Services department) started the process of having a reference card typeset. The type was set in &ldquo;hot&rdquo; type. Making changes to the original draft of the reference card was a costly and time-consuming process. In many cases, we found that new errors were introduced when old errors were corrected. The proofing required a minimum of 60 hours of staff time. In 1977, when we felt that our reference card just had to be redone, we looked for a more efficient way of typesetting it. The only computerized typesetter that we had access to did not have all of the symbols that we needed. The decision was made to draw the reference card on our plotter and then have it reduced and printed by our usual printing company.
Tailor: A simple model that works
Authors: Russ Blake
Venue: Proceedings of the 1979 ACM SIGMETRICS conference on Simulation, measurement and modeling of computer systems (1979)

Tailor is an atomic model of the Tandem/16 multiple-computer system. Atomic modeling is based on operational analysis and general considerations from queueing theory. Measurements of system atoms define the underlying components of processor usage. The workload is described to the model through a separate set of measurable parameters that comprise the workload atoms. Simple formulae from operational analysis are then applied to predict the amount of equipment necessary to support the projected application. Tailor's accuracy was tested under two very different workloads. For both a large backend database application and a program development system, Tailor was able to predict the equipment needed to handle the workloads to within 5 percent.