ppxscal/embedding_network huggingface dataset:
Simulation: An overview
Authors: Robert E. Shannon
Venue: Proceedings of the 15th conference on Winter simulation - Volume 1 (1983)

Simulation is one of the most powerful analytical tools available to managers of complex systems. We define what simulation is and what it is not. We will define simulation as the process of designing a model of a real system and conducting experiments with this model for the purpose either of understanding the behavior of the system, or of evaluating various strategies for the operation of the system. Thus we understand the process of simulation to include both the construction of the model and the analytical use of the model for studying a problem. The types of systems that can be simulated are those that are either in existence or capable of being brought into existence. Therefore, systems in the preliminary or planning stage can be modeled as well as those already in existence.
Are we becoming addicted to computers?
Authors: Arthur Fink
Venue: Proceedings of the 1983 annual conference on Computers : Extending the human resource (1983)

What do we mean by &ldquo;addicted&rdquo;? The Oxford English Dictionary defines it as: &ldquo;(1) Delivered over devoted, destined, bound. (2) Attached by one's own act; given up, devoted, ... naturally attached bondage, which displaces free will.&rdquo; It is a condition in which really objective self-examination does not and probably cannot guide our behavior. It is generally regarded as a pitiful state, over which one has little control.
MAP: A tool for understanding software
Authors: Sally Warren
Venue: Proceedings of the 6th international conference on Software engineering (1982)

Maintenance of software is a major problem that the data processing industry faces today. This paper describes MAP, a tool, that addresses the problems of software maintenance by helping programmers to understand their programs.
Data types and extensible languages
Authors: Philippe Jorrand
Venue: ACM SIGPLAN Notices (1971)

Definition mechanisms for extensible programming languages, in principle, allow variation of the language definition in various directions: data types, operations, control structure and syntax. We will focus our attention here on the definitional capabilities that one might expect from a data type extension mechanism. First, we will define informally what the nature of a data type is, what kind of information it contains. Then, we will discuss the most classical approach for data type definition in extensible languages. Finally, we will sketch a model for a mechanism which would permit to introduce really new data types in a language.
A preliminary step towards a language for picture control in a real-time mode
Authors: Lou Katz, Bill Etra
Venue: The papers of the ACM symposium on Graphic languages (1976)

With the proliferation of extremely complex analog systems for the control of television images it has become evident that some more efficient system has to be found for dealing with the mire of knobs, switches, levers, and patch cords which make up any video processing device. In planning an attack on this situation, we soon realized that a major aspect of the problem is a linquistic one. Television has only a few terms which deal with the almost infinite number of effects possible in any given system. The specification of wipes, fades, dissolves, keys, etc. tells one the process used, but does not go into great detail as to what it looks like on the screen. A circle wipe, for instance, may start in any part of the screen, have an edge in any of several degrees of softness, may be modulated by a wide range of frequencies, and may have a number of outlines around it in any combination of colors. Given these technical capabilities, the problem of how to catalog the possible effects and how to specify them was approached in terms of a description based on a Cartesian coordinate system representation of the multidimensional video space. The use of such a coordinate system has given us several advantages. The first is that there is a large body of existing work dealing with physical movements along orthogonal axes. Secondly, image color in television can be measured or specified in terms of phase shifts from 0 to 360 degrees in a planar reference axis system. Another consideration which makes this description natural is that it is standard for zero voltage on a CRT display to be center screen, thus defining our origin and relating it in a simple way to the physical control values. With this as our point of departure we embarked on our work with the clear realization that, because the dimensions and variability of the system were almost infinite, due to the unconstrained combination of analog patches and digital programming, some severe restraint would be necessary in order to make the results meaningful.
Profile of a Computer and Information Science B.S. graduate
Authors: Donald L. Kalmey
Venue: Proceedings of the fourth SIGCSE technical symposium on Computer science education (1974)

The Department of Computer and Information Science at The Ohio State University was conceptualized in 1967 and actualized one year later in October, 1968. Since that time, the Department has had both graduate and undergraduate degree programs. Originally there were two undergraduate degree programs, one in the College of Engineering and the other in the Colleges of Arts and Sciences. In 1971 a third undergraduate degree program was started in the College of Administrative Science 2 . As of July, 1973, these programs have graduated 426 computer and information science majors. This paper deals with a survey that was recently conducted of the above mentioned graduates. The purpose of the survey was threefold: (1) To determine what positions our majors are filling in industry; (2) To determine how effective the different undergraduate curriculums are in preparing our B.S. degree graduates for the Job market; and (3) To obtain an evaluation of these programs by the graduates. Since questionnaires are still being returned, the following represents a partial summary of this survey.
Problems, plans, and programs
Authors: Elliot M. Soloway, Beverly Woolf
Venue: Proceedings of the eleventh SIGCSE technical symposium on Computer science education (1980)

An important learning skill is the ability to make abstractions, i.e., to construct classification schemes which highlight similarities and differences. In this paper we shall outline the content of a undergraduate course which attempts to teach this skill in the context of teaching introductory LISP programming and problem solving. The key to this enterprise has been the development of: 1. a taxonomy of problems, i.e., a classification scheme which groups problems into classes based on specific criteria, and 2. a set of plans, i.e., abstractions, each of which captures the essential features of a class of problems, and corresponding solution programs. We begin by developing a scheme for classifying the problems usually offered as exercises in introductory LISP courses. We then examine the LISP programs which solve problems in the various classes and abstract higher level structures called 'plans.' Here we view a plan as a program template plus comments describing the goals and reasons for the various expressions in the template. Next, we build on the set of plans to include new problems. Finally, we speculate briefly on the utility of our taxonomy with respect to programming in languages such as FORTRAN, APL, or PASCAL.
Cubical notation for computer-aided processing of multiple-valued switching functions
Authors: Stephen Y.H. Su, Peter T. Cheung
Venue: Proceedings of the sixth international symposium on Multiple-valued logic (1976)

In this tutorial paper, cubical notation is introduced for representing multiple-valued switching functions. Various advantages of the cubical notation over other conventional representations are pointed out. The cubical notation is presented in a step-by-step manner and with many different variations. It is general enough to represent any multiple-valued switching functions. Representation of input and output multiple-valued conditions using strings of binary digits are given. Examples are given to show the one-to-one correspondence between the map and the cubical representation of multiple-valued switching functions. The basic set of operators for manipulating arrays of cubes is given. Experience on the computer implementation of cubical notations is reported and the trade-offs between computer execution time, memory spaces and programming effort are given.
Reducing manual labor: An experimental analysis of learning aids for a text editor
Authors: Donald J. Foss, Mary Beth Rosson, Penny L. Smith
Venue: Proceedings of the 1982 conference on Human factors in computing systems (1982)

It is by now a truism to say that computational systems should be designed with ease of use in mind. Indeed, Shneiderman [10] collects together nearly a dozen lists of advice produced by authors in the past decade on how to meet this laudable goal. The advice that is given seems often to be quite good, but it is almost always qualitative in nature, rather vague, and sometimes contradictory. Remarkably little work has been done examining the actual usefulness of carrying out some of the advice, the extent of savings that can be realized by so doing, or the theoretical rationale behind it. In this paper we will present the rationale for investigating two variables that may aid the user, in particular the novice user, and we will describe an extensive experiment designed to examine the actual effects of these two variables. The goals of the work are (1) to understand better the acquisition, representation, and utilization of knowledge by novice or occasional users of computer-based information systems, and (2) to put to the test some ideas derived from current views of memory and attention.
The analog behavior of digital integrated circuits
Authors: Lance A. Glasser
Venue: Proceedings of the 18th Design Automation Conference (1981)

The analog behavior of digital VLSI circuits is investigated. A theory based on nonlinear Thevenin equivalent circuits and RC ladder networks is developed. We obtain closed form expressions for the upper and lower bounds on propagation delay through a string of inverters. We generalize this to multiple-input, multiple-output gates and show that the problem of estimating signal propagation delays in VLSI circuits may be reduced to the problem of summing the step responses of a set of linear RC networks. As well as having implications for a computationally efficient timing simulator, the theory begins the formalization of the fundamental properties of digital integrated circuits.
Stochastic sensitivity analysis of linear programs by simulation techniques
Authors: Joseph L. Balintfy
Venue: Proceedings of the fourth annual conference on Applications of simulation (1970)

Sensitivity analysis is the investigation of the stability of the optimal solution to a linear programming problem. [equation] (1) Suppose that A is an mxn matrix with rank equal to m and that an mxm submatrix, B, is the optimal basis. Let further SB be the index set of the column vectors forming B. It is well known that the necessary and sufficient conditions for B to be optimal are the conditions of primal and dual feasibility, i.e. [equation] (2a) where &cacute;B is the row vector of objective function co-efficients for J&egr;SB and aj is the j-th column of A. As long as these conditions are maintained the basis is stable&mdash;that is, insensitive to variations in the coefficients. The ranges within which these variations may occur can be computed&mdash;ceteris paribus&mdash; for any particular component of &cacute;, b and aj by well known formulae.1,2
A machine independent assembler course
Authors: Charles M. Shub
Venue: Proceedings of the twelfth SIGCSE technical symposium on Computer science education (1981)

The development over the years of a topical outline and course notes for a second course in Computer Science is described. The adaption of this courseware to several machines and several textbooks is chronicled. An experiment in using the material to teach a truly machine independent course in assembly programming and machine organization is described. Results of the successful experiment are presented. The newest course is related to the new A.C.M. Curriculum. Conclusions are drawn.
Control structure abstractions of the backtracking programming technique
Authors: Susan L. Gerhart, Lawrence Yelowitz
Venue: Proceedings of the 2nd international conference on Software engineering (1976)

Backtracting is a well-known technique for solving combinatorial problems. It is of interest to programming methodologists because (1) correctness of backtracking programs may be difficult to ascertain experimentally and (2) efficiency is often of paramount importance. This paper applies a programming methodology, which we call control structure abstraction, to the backtracking technique. The value of control structure abstraction in the context of correctness is that proofs of general properties of a class of programs with similar control structures are separated from proofs of specific properties of individual programs of the class. In the context of efficiency, it provides sufficient conditions for correctness of an initial program which may subsequently be improved for efficiency while preserving correctness.
A system for segmenting and recognising totally unconstrained handwritten numeral strings
Authors: T. M. Ha, D. Niggeler, H. Bunke
Venue: Proceedings of the Third International Conference on Document Analysis and Recognition (Volume 2) - Volume 2 (1995)

We propose a system for segmentation and recognition of totally unconstrained handwritten numeral strings. The system is built upon a number of components, namely, a presegmentation module, an isolated numeral recognizer, a segmentation-free module and a merging module. Presegmentation consists in dividing the input numeral string image into groups of numerals each of which represents an integer number of numerals. For each group, the actual number of numerals and their identity are then determined by a cascade of two recognition-based tests: isolated numeral and segmentation-free. The last one is able to recognise a numeral group of any length. All results from all groups are eventually merged yielding the final interpretation of the input numeral string. We also introduce the concept of dummy symbol in order to overcome the problem of noisy parts that cannot be eliminated by standard filtering algorithms. Preliminary experiments on totally unconstrained data from the CEDAR database yielded a segmentation rate of 94.5% and a recognition rate of 84.2% at string level. These results compare favorably to other published methods.
On program verification and easy to veryfy programming
Authors: Timothy White
Venue: Proceedings of the ACM annual conference (1973)

In the first part of the paper, a discussion of program verification techniques is given. After a brief survey of formal and informal methods for proving the correctness of programs, special attention is focused on programs involving compound recursion since, in many instances in computer science (e. g. parsing of BNF languages), compound recursion provides the most natural way of stating the problem to be solved. Several examples of proving such programs are discussed and the ease of proving them is commented on. Then, ways of writing programs which simplify verification are discussed. The problem of writing a PL/1 program using based variables for setting up and processing a deque is given and programs written with and without proof techniques in mind are compared for ease of verification as well as efficiency. Finally, conclusions are drawn about how the &ldquo;top-down&rdquo; design process could help in the proof of programs.
Graphic model building system
Authors: Yoshikazu Yamamoto, Mats Lenngren
Venue: Proceedings of the 16th annual symposium on Simulation (1983)

An interactive Graphic Model Building System (GMBS) for discrete event simulation is presented. The GMBS is designed so as to be used even for unexperienced users who have no previous knowledge about neither modeling nor simulation languages. We introduce a new concept in which a model is divided into two specifications, that is, structural relations between system components and description of the logical behavior of each component.
Computer science education in small colleges - a report with recommendations
Authors: Richard H. Austing, Gerald L. Engel
Venue: Proceedings of the annual ACM SIGUCCS symposium on The administration and management of small-college computing centers (1972)

The Subcommittee on Small College Programs of the Committee on Curriculum in Computer Science (C3S), of the Association for Computing Machinery was appointed in 1969 to consider the unique problems of smaller colleges and universities, and to make recommendations regarding programs at such schools. Through the efforts of this group, with support from the National Science Foundation, an institute was held, in the summer of 1971 at Purdue University, on undergraduate computer science education. At this institute fifty-three instructors from smaller colleges and universities received instruction regarding the teaching of courses in discrete structures, programming languages, data structures, and operating systems. In the process of evaluating the results of this institute, it became apparent to the committee that recommendations regarding programs in computer science specifically directed to the smaller schools were needed. It is the purpose of this report to supply these recommendations.
Every reduct of two-element boolean algebra can be finitely axiomatized by modus ponens or substitution rule
Authors: Stanistaw J. Surma
Venue: Proceedings of the sixth international symposium on Multiple-valued logic (1976)

A general method yielding a Hilbert-type finite axiomatization of any fragment of the two-valued propositional logic is described in this paper. The method extends and simplifies a L. Henkin's method of axiomatization of only those propositional connectives which define implication. It also simplifies an earlier author's result. We start with conjunctive normal forms of formulas rather than with their zero-one definitions as L. Henkin does. This gives us the possibility of reducing the number of axioms characterizing an arbitrary propositional connective.
Computer algebra and numerical integration
Authors: Richard J. Fateman
Venue: Proceedings of the fourth ACM symposium on Symbolic and algebraic computation (1981)

Algebraic manipulation systems such as MACSYMA include algorithms and heuristic procedures for indefinite and definite integration, yet these system facilities are not as generally useful as might be thought. Most isolated definite integration problems are more efficiently tackled with numerical programs. Unfortunately, the answers obtained are sometimes incorrect, in spite of assurances of accuracy; furthermore, large classes of problems can sometimes be solved more rapidly by preliminary algebraic transformations. In this paper we indicate various directions for improving the usefulness of integration programs given closed form integrands, via algebraic manipulation techniques. These include expansions in partial fractions or Taylor series, detection and removal of singularities and symmetries, and various approximation techniques for troublesome problems.
Further results on equivalence and decomposition in queueing network models
Authors: Alexandre Brandwajn
Venue: Proceedings of the 1980 international symposium on Computer performance modelling, measurement and evaluation (1980)

This paper addresses three aspects related to the notion of exact equivalence in queueing models. In many cases the parameters of a system equivalent to a given model involve only a small subset of conditional probabilities of the state of the original model given the equivalent one. It is shown that meaningful bounds may be obtained for the conditional probabilities of interest with little computational effort. Such bounds are useful in assessing processing capacities as well as the accuracy of approximate solutions. As a second point it is shown that the notion of exact equivalence may be easily extended to networks with non-exponential servers. This is done for both the methods of supplementary variables and for the imbedded Markov chain technique. Qualitative analysis of approximation methods is also discussed. Finally, numerical methods based on the notion of exact equivalence, i.e. operating on conditional probabilities, are considered.
Design of a 2 &times; 2 fault-tolerant switching element
Authors: Woei Lin, Chuan-lin Wu
Venue: Proceedings of the 9th annual symposium on Computer Architecture (1982)

This paper describes the architecture of a 2 &times; 2 fault-tolerant switching element which can be used to modularly construct interconnection networks for multi-processing and local computer networking. The switching element uses distributed control and circuit switching. Its good gate-to-pin ratio can facilitate VLSI implementation.
Compiler chip: A hardware implementation of compiler
Authors: Akira Fusaoka, Masaharu Hirayama
Venue: ACM SIGARCH Computer Architecture News (1982)

In this paper we discuss about another approch: Compiler Chip, which is a VLSI implementation of a compiler. Constructing a compiler by a few VLSI chip, the computer manufacturer can deliver compilers by sets of VLSI chips, and these chips are installed in a intelligent terminal in order to remove the compilation from the tasks which are processed in the mainframe.
Using generalized programs in the teaching of computer science
Authors: Gerald Peterson
Venue: Proceedings of the fourteenth SIGCSE technical symposium on Computer science education (1983)

Courses in Computer Science have undergone significant improvement during the last few years. This improvement has resulted from the introduction of guiding principles such as structured programming and top-down design. Unfortunately, even with the use of these principles, buggy programs are commonplace. More guiding principles are needed. This paper introduces the concept of generalized programs and described how they may be used as a guide in the creation of correct computer programs. The method is discussed as it relates to a first course in Computer Science, but the idea could be applicable elsewhere in the curriculum. Basically, the idea is to partition the problems usually solved in the first course into groups such that the programs for solving the problems in each group will have common features. It was not found possible to find such a group for every problem, but a majority of the problems in the first course could be grouped in this manner. For each group a generalized program is written which captures the common features of the group. When given a problem to solve, if the student can ascertain the group to which it belongs, then the generalized program for this group will give guidance for programming the solution.