ppxscal/embedding_network huggingface dataset:
Experiences and observations on teaching computer programming and simulation concepts to high school students
Authors: R. M. Aiken
Venue: Proceedings of the second SIGCSE technical symposium on Education in computer science (1972)

This paper outlines the experience of the author in teaching computer programming and simulation concepts to thirty high school students as part of a National Science Foundation Summer Institute in probability and computing.2 It is hoped that the experience and observations reported in this paper might help others who might become involved in a similar course. There is certainly no doubt that students at this age level are capable of doing sophisticated work in computing. This program consisted only of high ability students; however, the author's experience with this program and another high school program with students with less ability indicates that students do not have to be of high ability in order to be attracted to and do well in computing. As is true of almost any area of study, what is particularly needed for success is motivation. Students with average or above average ability can do quite well in computing if they are motivated to do so.
Simulating the financial effects of major corporate policy changes via a discrete state system model
Authors: R. Linn Soule
Venue: Proceedings of the second conference on Applications of simulations (1968)

Techniques originally developed to model and analyze complex systems of interacting physical components have recently been adapted for use in analyzing economic systems. These techniques can be applied to any phenomenon which can be identified as a collection of components interacting at clearly defined interfaces, as long as the behavioral characteristics of these components can be described mathematically, in terms of common flow and/or propensity variables. A system model thus developed can be utilized for various kinds of analysis, including simulation. In this study the business firm is viewed as a system of funds flows, both environmental, and between several internal asset collection points. A FORTRAN program is developed from this system model to simulate financial effects of three selected policy changes.
Computer quantitation of ventricular arrhythmias
Authors: Edward J. Battersby
Venue: Proceedings of the 1972 SIGGRAPH seminar on Computer graphics in medicine (1972)

This paper describes a system designed around a small laboratory computer directed toward the task of quantitating ventricular arrhythmias in support of pharmacologic research. This class of disorders of cardiac rhythm is so designated because the site of electrical origin is in the ventricles of the heart. In certain clinical states, the new appearance of or increase in frequency of beats of this type is often a herald of more serious, and at times, catastrophic rhythm disturbances. The presence of frequent ventricular beats or of runs of such beats in general usually motivates the Cardiologist to use drugs to suppress these rhythm disturbances. This system is designed to facilitate the data processing task associated with the investigation of such drugs.
On isomorphisms and density of NP and other complete sets
Authors: J. Hartmanis, L. Berman
Venue: Proceedings of the eighth annual ACM symposium on Theory of computing (1976)

If all NP complete sets are isomorphic under deterministic polynomial time mappings (p-isomorphic) then P @@@@ NP and if all PTAPE complete sets are p-isomorphic then P @@@@ PTAPE. We show that all NP complete sets known (in the literature) are indeed p-isomorphic and so are the known PTAPE complete sets. Thus showing that, inspite of the radically different origins and attempted simplification of these sets, all the known NP complete sets are identical but for polynomially time bounded permutations. Furthermore, if all NP complete sets are p-isomorphic then they all must have similar densities and, for example, no language over a single letter alphabet can be NP complete, nor can any sparse language over an arbitrary alphabet be NP complete. We show that complete sets in EXPTIME and EXPTAPE cannot be sparse and therefore they cannot be over a single letter alphabet. Similarly, we show that the hardest context-sensitive languages cannot be sparse. We also relate the existence of sparse complete sets to the existence of simple combinatorial circuits for the corresponding truncated recognition problem of these languages.
SLANG a problem solving language for continuous-model simulation and optimization
Authors: Joe M. Thames,  Jr.
Venue: Proceedings of the 1969 24th national conference (1969)

SLANG is a mathematical problem modeling and solution language. It is one of several languages in the programming subsystem of the Computer User Executive (CUE) System developed by TRW Systems. SLANG is both a procedural and a command language designed primarily for the &ldquo;casual&rdquo; user. Consequently, much attention was paid to programming ease, &ldquo;natural&rdquo; syntax rules, readability, and debugging ease. On the other hand, SLANG is designed to permit the solution of very sophisticated mathematical problems, characterized by iterative solution methods. Its translated object code therefore contains complex numerical solution logic in addition to the object code of its procedural syntax.
FDIC Bank Management Simulation
Authors: Kalman J. Cohen, J. Timothy Heames
Venue: Proceedings of the 1967 22nd national conference (1967)

The following paper describes research that the authors are currently conducting in the development of a large, complex bank management simulation. The simulation, to be called the FDIC Bank Management Simulation, will be a computer model of commercial banks competing against one another and other financial institutions in the economic marketplace.
The logical complexity of geometric properties in the plane
Authors: Louis Hodes
Venue: Proceedings of the first annual ACM symposium on Theory of computing (1969)

This paper studies the logical complexity of geometric properties in the plane. These properties are characterized according to the length of formulas necessary to express them. In this study a portion of the plane X will be considered as a collection of squares {x1, ..., xn} arranged into a fine grid. A pattern P is a subset of X and the grid is assumed to be fine enough so that approximations to geometrical figures can be obtained. P can be defined by mapping m: X &ran;{0,1} where for x &egr; X, m(x) &equil; 1 iff x &egr; P. A set of patterns or a geometrical property &rgr; can be expressed as a Boolean function f on the n variables x1, ..., xn such that the value of f is 1 under the assignment m iff P &egr; &rgr.
Markov modelling
Authors: W. K. Grassmann
Venue: Proceedings of the 15th conference on Winter Simulation - Volume 2 (1983)

Markov modelling deals with discrete event systems in which events happen completely at random. The resulting Markovian systems can often be analyzed analytically. In this session, we show how to use the available packages, and what methods can be employed to find transient and steady state results. It turns out that Markov modelling is extremely convenient to analyze systems with very few state variables.
APL modeling of DeMorgan algebras
Authors: Terence J. Reed
Venue: Proceedings of the international conference on APL: part 1 (1979)

Boolean algebras, whose elements are represented as vectors of bits, have been augmented with a &ldquo;don't care&rdquo; value by circuit theorists. Such an augmented algebra, with its operations appropriately extended, is called DeMorgan algebra. Various APL models of these algebras are presented and functions on them discussed. Applications include functions on three-element sets, simplification of Boolean functions, decomposition of Boolean functions, and extensions to Lukasiewicz algebras.
A general-purpose high-level language machine for minicomputers
Authors: Bradford W. Wade, Victor B. Schneider
Venue: Proceedings of the meeting on SIGPLAN/SIGMICRO interface (1973)

In the course of our investigations into the design of translator writing systems (compiler-compilers), it has been established [2] that a certain set of &ldquo;semantic primitives&rdquo; can adequately express the major portion of the semantics of programs written in any of the several common high-level languages (e.g., PL/I, ALGOL W). It was also observed that each of these semantic primitives, while representing frequently-used high-level language constructs, corresponds to predictable sequences of machine-language instructions in the object code of programs. Similarly, other authors have noted that conventional computer instruction sets are less than satisfactory as target languages for high-level language programs and have offered, as a solution to this problem, hardware or firmware processors designed specifically for programs written in a particular high-level language&mdash;the machine language and the programming language are essentially identical. The best known early example of such a processor is Helmut Weber's microprogrammed implementation of the EULER language on an IBM 360/30. [5] More recently, Burroughs Corporation has produced the B1700, a computer that has a microprogrammed language processor for each of several languages, the appropriate one of which is loaded into control memory to interpret a given program. [6,7] Such processors show significant speed increases over conventional computers of comparable basic speed in executing programs written in their particular language, but are too specialized to execute other languages efficiently. Therefore we have conjectured that, by designing a computer organization which implements a set of semantic primitives similar to Lancaster's via microprogramming, one instruction per primitive (so that the work required by a DO statement, for example, is performed in the firmware rather than in the software), we can achieve speed increases approaching those of the single-language processors, while retaining the flexibility characteristic of conventional computer organizations. This paper describes those primitives which we have chosen for initial implementation, and presents some preliminary results on the speedups obtained.
A graduate curriculum in Business-Oriented Computing
Authors: Richard E. Fairley
Venue: Proceedings of the fourth SIGCSE technical symposium on Computer science education (1974)

The Department of Computer Science at the University of Colorado has recently developed a graduate curriculum in Business-Oriented Computing. The program was developed in recognition of the increasing demand for individuals who are trained in both business methodology and computer science. The 30 semester hour program is designed to produce masters level computer scientists capable of integrating the needs of the business community with the technology of computer science. Prerequisites for the program include a Bachelor's degree in Business (or the equivalent), ten semester hours of computing, and nine semester hours of upper division mathematics. The prerequisite computing courses are: Introduction to Computer Science for Business Majors (CS 202), a four hour course in COBOL programming; Business Data Processing Methods (CS 312), a three hour course in FORTRAN emphasizing business applications; and Assembly Language and System Software (CS 400). The mathematics courses are typically in the areas of statistics, probability theory, mathematical programming, computability, and linear algebra. At the University of Colorado, the programming and mathematics courses can be taken in the undergraduate Computer Based Information Systems option of the Business School curriculum.
A technique for speeding up LR(k) parsers
Authors: Alfred V. Aho, Jeffrey D. Ullman
Venue: Proceedings of the fourth annual ACM symposium on Theory of computing (1972)

We present a new transformation that reduces the size and increases the speed of LR(k) parsers. This transformation can be applied to all LR(k) parsers including those produced by Knuth's and DeRemer's techniques. The transformation causes the parser to avoid reductions by productions of the form A &ran; B where A and B are non-terminals.
Iterative solution of block tridiagonal systems on parallel or vector computers
Authors: D. K. Stevenson, J. F. Traub
Venue: Proceedings of the ACM annual conference (1973)

Two iterative algorithms for the solution of block tridiagonal systems on a parallel or vector computer are analyzed. One is a new Parallel Gauss iteration and the second is Jacobi iteration. The results obtained by comparing the algorithms on a model problem are reported.
A model for simulating and evaluating the response of a management information system
Authors: Hamad Kamal Eldin, David Leon Shipman
Venue: Proceedings of the 6th conference on Winter simulation (1973)

This paper discusses the development of a model to simulate the information flow of a program management organization. The objective of the study was to evaluate the response of the information system when changes to the system were made.
Developments in logic network path delay analysis
Authors: Lionel C. Bening, Thomas A. Lane, Curtis R. Alexander, James E. Smith
Venue: Proceedings of the 19th Design Automation Conference (1982)

This paper discusses path delay analysis programs as an alternative to detailed logic simulation for finding timing problems in logic networks. Fundamentals of path delay analysis are reviewed, and several previously reported methods are surveyed. This is followed by a more detailed description of a delay analysis program that we have recently implemented. Our implementation uncovers a wide variety of timing problems and has a run time that is linearly proportional to the number of gates in the network. Other principle features are that timing information loss is minimized by treating 0-to-1 and 1-to-0 delays separately, and the user is given the capability of selectively disabling paths in order to discover timing problems that would otherwise remain hidden.
Computer Design Language - Version Munich (CDLM) a modern multi-level language
Authors: Winfried Hahn
Venue: Proceedings of the 20th Design Automation Conference (1983)

Based on Computer Design Language and Instruction Set Processor Specification, the language CDLM is proposed as a system both for design verification at different levels of abstraction and for dynamic verification of design refinement steps. After presenting some aspects of structure, behavior and algorithmic description level, design modularisation, time behavior simulation, and design methodology in CDLM is discussed.
Applying personalized weights to a feature set for on-line signature verification
Authors: Seong Hoon Kim, Myoung Soo Park, Jaihie Kim
Venue: Proceedings of the Third International Conference on Document Analysis and Recognition (Volume 2) - Volume 2 (1995)

For signature verification, there can be a large number of useful features including pen-speed, pen-pressure, etc. However, all these features may not be useful or even be harmful for a given person when not enough number of training samples are allowed. Namely, for an optimal verification, each person requires a different subset of all the possible features. Finding an optimal subset for an individual needs too much combinatorial efforts. Instead, we propose an approach using all the same features for every person by assigning a different weight to each feature according to the nature of the person's signature.
Using a distributed mini-computer network to automate a biochemical laboratory
Authors: William J. Lennon, Eric L. Baatz, Sandra L. Colussi, Kenneth E. Kinnear,  Jr.
Venue: Proceedings of the ACM SIGMINI/SIGPLAN interface meeting on Programming systems in the small processor environment (1976)

This research considers a distributed system constructed by networking small computers as an appropriate architecture for the automation of laboratories having an integrated function. The simplicity, inherent reliability, and flexibility of such an architecture can be realized only if the laboratory as a whole and its proposed final operational characteristics are considered from the very beginning. This desire to automate an integrated laboratory forces us to address not only the normal problems associated with instrument automation but also the goal oriented behavior of the laboratory. We have clarified these requirements by extending the accepted characterization of instrument automation and also by characterizing the levels of interaction appropriate for laboratories which must attain successive levels of integration. Because the distributed computer system is capable of supporting either integrated or independent activities and because computing power can be added incrementally as needed, the distributed system must be viewed as a design tool easily as important as those traditionally employed. We have access to the usual tools associated with software and hardware production&mdash;e.g. translators, editors, document generators&mdash;but also the facilities to utilize them simultaneously with production programs in a reliable and flexible manner.
An architecture for the simulation of human movement
Authors: L. Weber, S. W. Smoliar, N. I. Badler
Venue: Proceedings of the 1978 annual conference - Volume 2 (1978)

We wish to enable a digital computer to translate movement notation into an animated display of human figures performing the represented movements. To this end we have postulated a model of the human body as a network of special-purpose processors&mdash;one processor situated at each joint of the body&mdash;each with an instruction set designed around a set of &ldqo;primitive movement concepts.&rdqo; The translation process may then be divided into two stages: a compilation stage in which the movement notation gets translated into programs for these special-purpose processors, and a simulation stage which simulates the behavior of these processors as they interpret their respective programs. We shall describe the instruction set for these processors and discuss how these instructions may be interpreted.
Generalized translation in a data base system
Authors: C. Frasson
Venue: Proceedings of the 15th Design Automation Conference (1978)

In order to provide independence between the user's view of a data base and the actual data structure a generalized translator is presented. Two particular implementations with similar objectives show the feasibility of such a translator which leads to a two-level data base architecture.
The initial transient problem&mdash;estimating transient and steady state performance
Authors: S. J. Deutsch, J. E. Richards C. Fernandez-Torres
Venue: Proceedings of the 15th conference on Winter simulation - Volume 1 (1983)

In this paper, Deutsch, Richards and Fernandez-Torres (1983) fit relaxed time series (RARMA) models to transient and steady state data from a simulated M/M/1 queue and a nonstationary queueing network. Both systems are initially empty and idle. The statistical identification procedure (Richards 1983) for the RARMA model class is illustrated. Improved estimates of the steady state mean of the M/M/1, and of the polynominal in time of the network's nonstationary &ldquo;steady state&rdquo; performance, are obtained by including the identified transient model in the RARMA regression.
Management and editing of distributed modular documentation
Authors: Diana Patterson
Venue: Proceedings of the ACM 1980 annual conference (1980)

When computers really come to be useful and self-documenting tools there are new kinds of management problems. They require some innovative solutions. This paper presents some possible methods for dealing with; a)writers in a &ldquo;distributed&rdquo; office b)managing the quality of documents that are assembled paragraph by paragraph by a user on-line c)implications of mixed-media computer presentations in real time, on-line.
MicroNet a low-cost local area network for microcomputers
Authors: J. Michael Bennett, Paul V. Chefurka
Venue: Proceedings of the 1983 ACM SIGSMALL symposium on Personal and small computers (1983)

One of the limiting factors in the use of microcomputer systems has been the lack of sufficient local hardware resources to implement large software systems, at a cost commensurate with the systems. As with mainframes, this limitation has suggested the use of networks to expand the total computing power of such systems. However, such solutions must provide both user flexibility and reasonably high data rates, for a very low cost. This paper describes our MicroNet project: a solution to the above constraints. The MicroNet is a loosely-connected network which can link together many Motorola 68000-based microcomputers. It provides for a fairly high data rate, transparent error detection and recovery mechanisms, and a user interface that satisfies the dual constraints of ease of use and maximum flexibility in applications. Best of all, it is constructed from off-the-shelf components for a very low cost.
State space transformations in queueing network modeling
Authors: Jeffrey P. Buzen, Subhash C. Agrawal
Venue: Proceedings of the 1983 ACM SIGMETRICS conference on Measurement and modeling of computer systems (1983)

An important problem in queueing network modeling is that of characterizing and analyzing relationships among alternative models of a single system. The problem is approached by developing the concept of a state space transformation, which is a mechanism for expressing the way one model can be mapped into another. After discussing state space transformations in general terms, some important transformations are presented. The usefulness of the technique is demonstrated by developing state space transformations for the shadow CPU technique for analyzing preemptive priority scheduling and the aggregate server method for modeling serialization delays.
A new environment for teaching introductory computer science
Authors: William E. Ayen, Sam Grier
Venue: Proceedings of the fourteenth SIGCSE technical symposium on Computer science education (1983)

In 1973, a great amount of frustration was being vented about student inability to formulate and solve problems on a computer; at that time, a suggestion was made to separate problem solving from programming&mdash;to make problem solving language independent [1]. This approach was acknowledged in 1978 as one of four common methods of teaching college-level introductory computer science [2]. Finally, in 1981 and 1982, this method, or a variant of it, was widely proclaimed [3] [4] [5]. We adopted this approach of instruction in our introductory course in 1977 and the results have been less than spectacular. We don't make this point to discredit the approach; its existence has made manifest the necessity of teaching problem solving in an introductory course. Rather, we believe that the added teaching of a separate problem solving methodology is not by itself sufficient.
The functional design of a generalized vehicle flight simulation program
Authors: Vilas D. Henderson
Venue: Proceedings of the 1966 21st national conference (1966)

Aerospace missions have become exceedingly complex, requiring correspondingly complex vehicles in order to fulfill them and necessitating thorough analysis of the total mission/vehicle combination during the design, development, and testing phases. An important part of this analysis and synthesis concerns the behavior of the vehicle as it travels a flightpath toward the fulfillment of its mission. This behavior is so important that it actually may have considerable impact upon original mission objectives, over-all vehicle design, and various subsystem functions.
On approximating a vertex cover for planar graphs
Authors: R. Bar-Yehuda, S. Even
Venue: Proceedings of the fourteenth annual ACM symposium on Theory of computing (1982)

The approximation problem for vertex cover of n-vertex planar graphs is treated. Two results are presented: (1) A linear time approximation algorithm for which the (error) performance bound is 2/3. (2) An O(n log n) time approximation scheme.