ppxscal/embedding_network huggingface dataset:
Cartoons: An initial investigation of animated graphs
Authors: Robert I. Winner
Venue: Proceedings of the ACM annual conference (1973)

Many structures and processes representable as graphs are well known. There are, however, structures the internal relationships of which change (predictably or not) over time. An example in computer science would be an adaptive process. In this case the state transition graph changes in response to certain stimuli. Another recent development presents a similar structural problem. The bubble memory is a two-dimensional matrix of bubbles which can be moved by altering the position of certain magnets. The possible bubble movements are representable as a maze of changing characteristics. If one represents such a movable maze as a graph with changing connectivity, problems of computation via bubble movements might become clearer. This paper attempts to provide a formalism in which such problems can be framed.
SPECL: A system programming dialect of ECL
Authors: David Udin
Venue: Proceeding of ACM SIGPLAN - SIGOPS interface meeting on Programming languages - operating systems (1973)

The SPECL programming system is an attempt to combine the characteristics of an implementation language with those desirable for verifiability (human and mechanical) and transportability. The former requires efficient code generation and access to hardware; the latter requires a highly structured language and isolation of machine dependencies. SPECL will be embedded in the ECL programming system, which currently includes an interpreter and compatible compiler for the extensible language EL1, and a set of tools for debugging, metering, and verification. The SPECL compiler (under design) will restrict the semantics of EL1 to eliminate the need for run-time support and type checking, and couple specification of machine representation of modes and operators with the EL1 definitional mechanism to enable generation of efficient object code.
An organizational structure to guarantee testing, documentation and software support
Authors: Herbert Harris
Venue: Proceedings of the 8th annual ACM SIGUCCS conference on User services (1980)

What this paper advocates is not a new thought for anyone attending a User Services Conference. It may well be a position that many of you have taken. Given that this is the case, you may well ask why would I persist in belaboring the obvious. Well, I am here to present a case where the grand experiment has been tried. A case where a user-oriented organizational group is in control of all software on a computer system. This was not accomplished through a bloody coup, blackmail, or bribery. This structure developed in response to an organizational need because of personalities. However, once in place it has worked well even though many of the original personalities are no longer present. It has some flaws and I will discuss these, but philosophically it has the right emphasis.
A toolbox for APL programmers
Authors: Robert C. Metzger
Venue: Proceedings of the international conference on APL: part 1 (1979)

A set of programming tools for APL programmers is described. One group of tools helps the reader understand APL by taking advantage of special features of communication terminals, as well as using nontraditional approaches toward program listings, and nonverbal communication methods. Another group of tools rewrites portions of APL programs in order to eliminate stumbling blocks to effective communication.
Use of simulation in the study of paradrop
Authors: Grant Martin, R. Peter Hypher
Venue: Proceedings of the 11th annual symposium on Simulation (1978)

Experience of operators on Paradrop Exercises indicated that they were experiencing Miss Distance errors not in concert with their expectations and that they were finding it difficult to reduce errors below a given threshold. Invariably it was concluded that low level jet winds must have existed to frustrate their efforts. This study demonstrates by simulation that in the paradrop type of activity, miss distances are, (a) insensitive to a large spectrum of input errors which can 'augment or cancel' one another, and that (b) Position and not Wind error was the most significant cause of poor scores. As a bonus to the study a new assessment system was devised.
Wargame-based training systems
Authors: L. Robert Ogus, James R. Jancaitis, Russel E. Hauck
Venue: Proceedings of the 13th conference on Winter simulation - Volume 2 (1981)

This paper introduces a candidate model for development of wargame-based training systems and describes the application of that concept during development of the Naval Tactical Game (NAVTAG) Training System. A wargame-based training system combines the inherent educational advantages of simulation and gaming with the best features of more formal or conventional methods of instruction. Research indicates that gaming simulation has the potential to afford significant advantages over conventional classroom methods of training. This appears to be particularly true for complex skills such as goal-oriented decision-making. Wargames can be made more effective by using an integrated development approach based upon the systems approach to instructional development, and the addition of a complete set of courseware.
The response of job classes with distinct policy functions(Extended Abstract)
Authors: Manfred Ruschitzka
Venue: Proceedings of the 1980 international symposium on Computer performance modelling, measurement and evaluation (1980)

Policy function schedulers provide a flexible framework for implementing a wide range of different scheduling schemes. In such schedulers, the priority of a job at any instant in time is defined by the difference between the time it spent in the system and an arbitrary function of its attained service time. The latter is called the policy function and acts as the functional parameter that specifies a particular scheduling scheme. For instance, a constant policy function specifies the first-come, first-serve scheduling scheme. By changing the policy function, the system behavior can be adjusted to better conform with desired response characteristics. It is common to express response characteristics in terms of a response function, the average response time of a job conditioned on its service requirement in equilibrium. In this paper, we analyze processor-sharing M/G/1 systems in which the priorities of different classes of jobs are determined by distinct policy functions.
Digital control simulation system
Authors: H. Rex Hartson
Venue: Proceedings of the 6th annual Design Automation Conference (1969)

Today there is widespread application of digital control circuitry in a wide range of products. This paper describes a simulation system in which the designer of these control circuits can interact with his design ideas before they are implemented in hardware. The Digitial Control Simulation System (DCSS) is a digital design description language with a set of programs to generate and execute a simulation program. The main use of this system (with an appropriate hardware interface) is the testing of, and possibly on-line simulation of, the control of a system being designed and constructed.
Real-time image processing algorithms for an automated retinal laser surgery system
Authors: D. E. Becker, J. N. Turner, H. Tanenbaum, B. Roysam
Venue: Proceedings of the 1995 International Conference on Image Processing (Vol. 1)-Volume 1 - Volume 1 (1995)

Although laser retinal surgery is the best available treatment for a variety of ophthalmic disorders, the current procedure has a success rate of less than 50%. A computer-controlled instrument is under development for minimizing this failure rate. This paper presents core image-processing methods used for this system. The image-processing problems of interest in this paper are (i) the computation of a retinal map from video retinal angiograms, and (ii) real-time eye tracking and location determination during laser surgery. The algorithms described here comprise of a fast method for detecting retinal landmark feature points, a fast method for matching feature-tagged point sets, feature-based method for montaging retinal angiograms, and an algorithm for real-time image tracking.
A note on matrix multiplication in a paging environment
Authors: Patrick C. Fischer Robert L. Probert
Venue: Proceedings of the 1976 annual conference (1976)

In order to minimize the number of page fetches required when multiplying matrices occupying many pages of virtual storage, we consider adapting Strassen-like recursive methods to a paging environment. An algorithm with a theoretically better rate of growth results. Also presented is an algorithm for efficiently converting matrices from row storage form to sub-matrix storage form, thus making more accessible the benefits of algorithms based on sub-matrix storage form which were presented in [5].
A generalization of Horner's rule for polynomial evaluation
Authors: W. S. Dorn
Venue: Proceedings of the 1961 16th ACM national meeting (1961)

A general polynomial of nth degree (1) p(x)&equil;ao+alx+ ... +anxn may be evaluated for x &equil; &agr; by use of Horner's rule, i.e., by recursively computing (2) bn &equil; an bj &equil; aj + &agr;bn+1 j &equil; n&minus;1, ..., 0 from which it follows that (4) p(&agr;) &equil; bo. Horner's rule requires n multiplications and n additions to compute p(&agr;). This is generally accepted as the minimum number of such operations to compute p(&agr;) although no proof exists except for n @@@@ 4.
Geometric modeling technology
Authors: William Luts
Venue: Proceedings of the 18th Design Automation Conference (1981)

The geometric model is an essential element of the design description. It is an abstract representation of the form and size of the object that serves as a medium of communication. The geometric model must hold sufficient information to answer all questions about form and size. The traditional engineering drawing was developed for and has served this function. Though highly developed, over a long period, the technique suffers from the fact that much of the information is implied and many times is ambiguous. It takes a trained human to interpret a drawing, a computer can't. Various approaches have been taken in design modeling and the capabilities and limitation should be understood before approaches are selected or rejected. The wire frame, surface and volumes approaches can form a complimentary system of modeling capabilities rather than replace each other. The need for multiple representation appears when deeper consideration is given to specific applications.
Markov chain models for analyzing memory interference in multiprocessor computer systems
Authors: Dileep P. Bhandarkar, Samuel H. Fuller
Venue: Proceedings of the 1st annual symposium on Computer architecture (1973)

This paper discusses various analytical techniques for studying the extent of memory interference in a multiprocessor system with a crosspoint switch for processor-memory communication. Processor behavior is simplified to an ordered sequence of a memory request followed by an interval of processing time. The system is assumed to be bus bound; in other words, by the time the processor-memory bus completes servicing a processor's request the processor is ready to initiate another request and the memory module is ready to accept another request. The techniques discussed include discrete and continuous time Markov chain models as well as several approximate analytic methods.
The automation of simulation
Authors: G. K. Hutchinson
Venue: Proceedings of the 13th conference on Winter simulation - Volume 2 (1981)

The principles of Computer Aided Design (CAD) have been incorporated in a simulation system to reduce the time and cost to produce simulations and expand the set of potential users to nonprogrammers. Computer Aided Programming for Simulation (CAPS) is an interactive program which queries the user and processes the responses to write a simulation program which, for models in its domain, is guaranteed to be logically correct and execute on the first run. CAPS is based upon the use of activity cycles for decomposition of the problem under study. Activity cycles, which appear to be a super set of Petrie Nets, are simply directed graphs. This technique permits one to do the classic barbership in 10 minutes at a cost of under &dollar;1.00 Activity cycles concepts will be described and the CAPS program demonstrated on an ALTOS 8000 micro computer. After the formal session is completed, a spontaneously submitted problem will be simulated on an interactive basis. CAPS writes Extended Control - Simulation Language (ECSL) which is a complete language with outstanding statistical characteristics and unique language features. Recent additions to the ECSL include *FIT, which tests distribution data against the 25 most commonly used statistical functions, and DISPLAY, which enables one to easily develop interactive simulations. CAPS/ECSL will be demonstrated on a personally owned micro computer, but will run on any system with ASCII Fortran IV, backing store, and sufficient care (16K words minimum).
A technology relative Logic Synthesis and Module Selection system
Authors: G. W. Leive, D. E. Thomas
Venue: Proceedings of the 18th Design Automation Conference (1981)

The logic synthesis step of the CMU-DA system selects modules from a database for use in a digital system. This approach to logic synthesis is described. An experiment using volunteer designers was conducted to calibrate the automated system. The results indicate that the automated system produces designs that are quite close to those expected in the sample population. Design spaces for a relatively large design and two module sets (TTL and CMOS Standard Cells) are illustrated and discussed. A methodology for predicting the bounds of a design space is illustrated and discussed. The system can be used to measure the usefulness of a new module in a module set or to reimplement a design with the modules of a new technology.
Multiprocessing via intercommunicating LISP systems
Authors: Mitchell L Model
Venue: Proceedings of the 1980 ACM conference on LISP and functional programming (1980)

Multiprocess environments comprising several intercommunicating LISP systems are straightforward to implement due to certain fundamental characteristics of the LISP language. Experiences with four methods of establishing the necessary communications linkages are described. The features of LISP which support experimentation with interprocess communication are identified. Two key characteristics of the language are important in this regard: 1. LISP programs can construct and interpret new code as they run; 2. Structures within LISP systems are accessible by name. The most flexible of the communication methods use only the ordinary LISP input and output functions, supplemented by a small amount of system-dependent code to create communication linkages that can be treated by LISP as file structures.
Building blocks for data flow prototypes
Authors: Jack B. Dennis, G. Andrew Boughton, Clement K.C. Leung
Venue: Proceedings of the 7th annual symposium on Computer Architecture (1980)

A variety of proposed architectures for data flow computers have been advanced. Evaluation of the practical potential of these proposals is being studied through analysis and simulation, but these techniques cannot be used to study a machine design in sufficient detail to make accurate predictions of performance. As a basis for extrapolating cost/performance of these architectures, and for developing a methodology for data flow program preparation, the construction of prototype machines is needed. In this paper we present our plan for realizing experimental data flow machines as packet communication systems using two types of hardware elements: a microprogrammed processing element with provision for packet transmission and reception; and a router unit used to build networks to support packet communication among processing elements.
Inference rules for program annotation
Authors: Nachum Dershowitz, Zohar Manna
Venue: Proceedings of the 3rd international conference on Software engineering (1978)

Methods are presented whereby an Algol-like program, given together with its specifications, can be documented automatically. The program is incrementally annotated with invariant relationships that hold between program variables at intermediate points in the program and explain the actual workings of the program regardless of whether the program is correct. Thus this documentation can be used for proving the correctness of the program or may serve as an aid in the debugging of an incorrect program. The annotation techniques are formulated as Hoare-like inference rules which derive invariants from the assignment statements, from the control structure of the program, or, heuristically, from suggested invariants. The application of these rules is demonstrated by an example, one of a number that have run on an experimental implementation.
GWSS - a generalized warehouse simulator system
Authors: Alvin M. Silver
Venue: Proceedings of the 6th conference on Winter simulation (1973)

A generalized warehouse simulator system (GWSS) was constructed to facilitate the construction and operation of simulation models of complex warehouse systems by design engineers and operating managers. This paper presents the structure of the generalized model and the techniques used to provide extreme versatility in the warehousing system that can be modeled. The use of the generalized model is explained and its application in the construction and exercising of a simulation model for a large complex warehouse system is illustrated by an example.
On the complexity of the Extended String-to-String Correction Problem
Authors: Robert A. Wagner
Venue: Proceedings of seventh annual ACM symposium on Theory of computing (1975)

The Extended String-to-String Correction Problem [ESSCP] is defined as the problem of determining, for given strings A and B over alphabet V, a minimum-cost sequence S of edit operations such that S(A) &equil; B. The sequence S may make use of the operations: Change, Insert, Delete and Swaps, each of constant cost WC, WI, WD, and WS respectively. Swap permits any pair of adjacent characters to be interchanged. The principal results of this paper are: (1) a brief presentation of an algorithm (the CELLAR algorithm) which solves ESSCP in time &Oslash;(&brvbar;A&brvbar;* &brvbar;B&brvbar;* &brvbar;V&brvbar;s*s), where s &equil; min(4WC, WI+WD)/WS + 1; (2) presentation of polynomial time algorithms for the cases (a) WS &equil; 0, (b) WS > 0, WC&equil; WI&equil; WD&equil; @@@@; (3) proof that ESSCP, with WI < WC &equil; WD &equil; @@@@, 0 < WS < @@@@, suitably encoded, is NP-complete. (The remaining case, WS&equil; @@@@, reduces ESSCP to the string-to-string correction problem of [1], where an &Oslash;( &brvbar;A&brvbar;* &brvbar;B&brvbar;) algorithm is given.) Thus, &ldquo;almost all&rdquo; ESSCP's can be solved in deterministic polynomial time, but the general problem is NP-complete.
Meeting the computational requirements of the university - the Brown University Interactive Language
Authors: Robert G. Munck
Venue: Proceedings of the 1969 24th national conference (1969)

This paper is directed toward the computational requirements, both educational and research, of the university. The features needed in a programming language in a university are discussed, assuming both remote access and batch processing. The Brown University Interactive Language system (BRUIN) is described. BRUIN is implemented as a JOSS-like interpreter and a WATFOR-Like compiler and has a syntax very much like PL/I. It is intended that BRUIN and PL/I will together form a language system which will supply most of the (non-computer science) computational requirements of the university. The use of computers in universities is rapidly emerging into a new era. The computer is becoming increasingly involved in the educational process, as well as research, spurred on by the development of time-sharing interactive console systems. As our systems become more complex, users from departments and majors other than computer science are becoming confused by the number of languages, processors, and options available. There is a need for a single integrated language system for those non-computer scientists in the university who need computational facilities. This implies a single, high-level language in an interactive and batch-processing system which is convenient for everyone from the freshman calculus student to the senior researcher in particle physics. This language must meet a number of requirements, some of which are described below. We have attempted to provide such a facility at Brown University, based on a medium-sized computer with a fair number of remote consoles.
Exploiting parallelism in a Relational Associative Processor
Authors: Paul J. Sadowski, S. A. Schuster
Venue: Proceedings of the fourth workshop on Computer architecture for non-numeric processing (1978)

The Relational Associative Processor (RAP) is a special purpose non-numeric back-end processor used in supporting general Data Base Management Systems. In particular, it is ideally suited for supporting a relational data base. The architecture and instruction set of RAP are discussed in this context. It is the purpose of this paper to show that RAP performance can be enhanced considerably by more fully exploiting its parallel nature. It is shown that a greater degree of concurrent activity will result in better overall performance. An operating system executive to support this high level of concurrency is proposed and modelled using simulation techniques. Both the analytic and simulation results support the value of the proposals.
Automatic text skew estimation in document images
Authors: Su Chen, R. M. Haralick, I. T. Phillips
Venue: Proceedings of the Third International Conference on Document Analysis and Recognition (Volume 2) - Volume 2 (1995)

This paper describes an algorithm to estimate the text skew angle in a document image. The algorithm utilizes the recursive morphological transforms and yields accurate estimates of text skew angles on a large document image data set. The algorithm computes the optimal parameter settings on the fly without any human interaction. In this automatic mode, experimental results indicate that the algorithm generates estimated text skew angles within 0.5/spl deg/ of the true text skew angles with a probability of 99%. To process a 300 dpi document image, the algorithm takes 10 seconds on SUN Sparc 10 machines.
A GPSS model of a unit load AS/R system and shipping department
Authors: J. S. Carson, C. H. Wysowski, W. A. Johnson, N. Wilson
Venue: Proceedings of the 15th conference on Winter simulation - Volume 1 (1983)

This paper describes a GPSS model of a unit load AS/RS (automated storage and retrieval system). The paper describes the system, the model, the input data analysis, the validation of the model, and the uses made of the model. Both transient and steady-state analyses are discussed.
Engineering Workstations: Tools or toys?
Authors: Steve Sapiro
Venue: Proceedings of the 20th Design Automation Conference (1983)

We've all heard the scenario&mdash;the complexity of designs is increasing at a staggering rate, design cycles are approaching the life of the products, the demand for design engineers far outstrips the supply, etc., etc. Everyone seems to know the solution: - Increase the efficiency of existing engineers by providing CAE tools - Provide tools and methodologies to allow non-IC/Systems designers to effectively and efficiently design products. Engineering workstations to the rescue? Are CAE tools the answers to the engineer's prayers? How about the engineering manager's dreams? These and other issues will be addressed by a panel of experts from both the vendor and user communities.