ppxscal/embedding_network huggingface dataset:
Computer animation with scripts and actors
Authors: Craig W. Reynolds
Venue: Proceedings of the 9th annual conference on Computer graphics and interactive techniques (1982)

A technique and philosophy for controlling computer animation is discussed. Using the Actor/Scriptor Animation System (ASAS) a sequence is described by the animator as a formal written SCRIPT, which is in fact a program in an animation/graphic language. Getting the desired animation is then equivalent to &ldquo;debugging&rdquo; the script. Typical images manipulated with ASAS are synthetic, 3D perspective, color, shaded images. However, the animation control techniques are independent of the underlying software and hardware of the display system, so apply to other types (still, B W, 2D, line drawing ...). Dynamic (and static) graphics are based on a set of geometric object data types and a set of geometric operators on these types. Both sets are extensible. The operators are applied to the objects under the control of modular animated program structures. These structures (called actors) allow parallelism, independence, and optionally, synchronization, so that they can render the full range of the time sequencing of events. Actors are the embodiment of imaginary players in a simulated movie. A type of animated number can be used to drive geometric expressions (nested geometrical operators) with dynamic parameters to produce animated objects. Ideas from programming styles used in current Artificial Intelligence research inspired the design of ASAS, which is in fact an extension to the Lisp programming environment. ASAS was developed in an academic research environment and made the transition to the &ldquo;real world&rdquo; of commercial motion graphics production.
An introduction to the N. mPc design environment
Authors: Frederic I. Parke
Venue: Proceedings of the 16th Design Automation Conference (1979)

N.mPc, a design tool for multi-processor systems, consists of six components which work together to produce functional register transfer level simulations of multiple processor, heterogeneous target systems. A meta assembler allows the user to specify the format, nmemonics, and associated bit patterns of target instruction sets. Instruction nmemonics are mapped into bit strings and output in a machine independent control/memory allocation graph. A generalized linking loader resolves the machine dependent aspects of assembler output graphs, links, and allocates the resulting image to physical memory according to user specified strategies. A hardware description language, ISP', compiler is used to translate processor and interconnection element descriptions into executable code. This code, the linking loader outputs, and a description of the target system topology are linked by on Ecologist and Simulated Memory Processor into a simulation model which runs under the control of a Runtime Package. The Runtime Package consists of a Command Interpreter, Kernel, and Simulated Memory Manager. The Kernel and Command Interpreter permit interactive control and monitoring of simulations. The Simulated Memory Manager supervises the simulated memory contents, available physical memory, and mass storage to optimize the performance of the simulation. N.mPc is implemented on a PDP-11 system under the UNIX operating system and is currently undergoing system test and evaluation.
On the packet interleaved interface between packet switched network and computers
Authors: Toshihiko Nakajo, Tetsuo Nagata, Hirotaro Ohba, Yutaka Yoshida
Venue: Proceedings of the third ACM symposium on Data communications and Data networks: Analysis and design (1973)

This paper describes a study of transmission control procedure for computer to computer and computer to terminal communication through a public packet switched network. Four types of basic data link are defined over a packet travel path in the network, and the functions required for the data link are discussed. By applying the result of the discussion and introducing the concept of a process number, a transmission control method and call control signalling method between computer and packet switched network are proposed for the packet interleaved communication on the basis of the HDLC procedure.
&ldquo;Views of a vendor&rdquo; (Position Paper)
Authors: Michael J. Cronin
Venue: Proceedings of the 16th Design Automation Conference (1979)

A vendor of Design Automation systems must contend not only with the prospective user, but also with the user's computer staff. The latter can be very helpful, but may also have development plans which run counter to any outside purchase. Once a purchase decision is made, organizational problems and opportunities become paramount. For example, most turnkey design automation systems not only encompass design automation, but extend to automated drafting and numerical control programming. Management gradually realizes that a common database will allow the flow of design studies to drafting and then to manufacturing engineering without redundant handling or redraw. The major question becomes &ldquo;should we allow department 'X' to make a decision that will affect departments 'Y' and 'Z' without a corporate team or at least a policy on database standardization?&rdquo;
A testing strategy for PLAs
Authors: Charles W. Cha
Venue: Proceedings of the 15th Design Automation Conference (1978)

Programmable Logic Arrays (PLA) are finding increasing use as a cost-effective means to utilize LSI electronics. In this paper, three classes of faults, namely stuck faults, shorts and cross-point defects are defined and characterized in a PLA. The relationship between the test sets and their faults among all three classes are discussed. Finally, an algorithm for generating a test set for all three classes of faults is presented.
Central flow control software development: A case study of the effectiveness of software engineering techniques
Authors: Peter C. Belford, Richard A. Berg, Thomas L. Hannan
Venue: Proceedings of the 4th international conference on Software engineering (1979)

The purpose of this paper is to present cost and error data collected during the development cycle of a large-scale software effort, to analyze this data in comparison with other available data from similar projects, and to evaluate the effectiveness of the techniques utilized on the project. The project being reported on is Computer Sciences Corporation's development of the Central Flow Control Software System for the Federal Aviation Administration's Air Traffic Control System Command Center. Analysis of the cost data provides insight not only into the added development costs associated with severely limiting module sizes, but also into the effectiveness of various cost estimation techniques. The error data analysis supports the usefulness of the software engineering techniques which were used on the project in conjunction with definitive module-level test requirements. The paper provides a foundation upon which to establish the development and data collection environment for future software systems.
Cellular arrays for asynchronous control
Authors: Suhas S. Patil
Venue: Conference record of the 7th annual workshop on Microprogramming (1974)

The microprogrammed controls which have evolved following Wilkes' suggestion are for synchronous control structures. This paper presents a micro-programmable array for realizing an asynchronous control structure. The work presented here extends Jump's asynchronous control arrays to include many essential control capabilities which were lacking. The arrays realize structures which allow sequencing of operations, conditional branch, subroutine call, fork operation to create parallel processes, join of parallel processes, merging of control, and arbitration with semaphore primitives to achieve controlled access to limited resources. The control to be realized is specified as a Simple Petri net which is then translated into an array representation which represents the microprogram. The cellular array is then obtained by selecting cell configurations in accordance with the node of the array representation of the control. The circuits obtained are asynchronous and speed independent. The microprogrammed array is a cellular form of C, S, NOR, XOR synthesis of Petri Nets.
Some further methods of discretizing the exponential distribution
Authors: Irwin W. Kabak
Venue: Proceedings of the 1967 22nd national conference (1967)

One method for discretizing the exponential distribution such that the discrefized values bear a resemblance to the continuous distribution is as follows. The density function will first be divided into N equiprobable intervals each of area 1/N. Some measure of central tendency of each interval will define the equiprobable values. In a previous study [1] the effects of using the mean and the median of the equiprobable intervals was noted. The measure of effectiveness used involved a comparison of the moments of the delay distribution for a simple queueing system based upon these measures of central tendency and known theoretical results. This paper will present the results of two extensions of the previously cited study [1]. It was shown that when using the mean of the equiprobable intervals one obtained &ldquo;better&rdquo; i.e., less biased, results for the moments of the delay distribution under question than when the medians of the intervals were used. Although these results were very good, on some subjective measure, a bias does exist for all higher moments of the delay distribution. One way to reduce this bias is to consider different measures of each equiprobable interval. This paper shows the results of using the rth root of the rth moment of each interval, corrected for the mean. A second concern arises when there is a limited amount of storage space in the digital computer for the discretized points.
Fitting &ldquo;standard&rdquo; distributions to data is necessarily good: Dogma or myth?
Authors: Bennett L. Fox
Venue: Proceedings of the 13th conference on Winter simulation - Volume 1 (1981)

This paper questions the conventional wisdom that &ldquo;standard&rdquo; distributions such as the normal, gamma, or beta families should necessarily be used to model inputs for simulation and proposes an alternative. Relevant criteria are the quality of the fits and the impact of the input distributions on effective use of variance reduction techniques and on variate-generation speed. The proposed alternative, a &ldquo;quasi-empirical&rdquo; distribution, looks good on all these measures.
MANIP-a parallel computer system for implementing branch and bound algorithms
Authors: Benjamin W. Wah, Y. W. Ma
Venue: Proceedings of the 8th annual symposium on Computer Architecture (1981)

In this paper, we propose and analyze the design of MANIP, a parallel machine for processing nondeterministic polynomial complete problems. The most general technique that can be used to solve a wide variety of NP-complete problems on a uniprocessor system, optimally or suboptimally, is the branch and bound algorithm. We have adapted and extended the branch and bound algorithm for parallel processing. The parallel branch and bound algorithm requires a combination of sorting and merging. A common memory to sort for a large number of processors can become a bottleneck in the system. We have proposed a system with distributed intelligence so that sorting can be carried out in a distributed fashion. A unidirectional ring network is proved to be the optimal and most cost-effective interprocessor communication network when sorting is done by a hardware priority queue in each processor. Lastly, the performance on the proposed system is evaluated using the vertex covering problem.
The social implications of computers and automation
Authors: Edmund C. Berkeley
Venue: Proceedings of the SHARE design automation project (1965)

When I was first asked to talk to you, I had two questions. My first question was, &ldquo;Do I have to relate what I have to say to design automation?&rdquo; The answer was &ldquo;No&rdquo;. That seemed to me a bit odd but I accepted that. The second question was. &ldquo;Do I have to talk all by myself for all of 40 minutes?&rdquo; and the answer to that was &ldquo;May be&rdquo;. But I did find out last night that that's not necessary. I found out that I can ask out to indicate your agreement and disagreement, and to speak up and discuss and argue with me all during my talk. So my talk does no have to be an address or a lecture or a monologue, but instead can be an argument or a controversy. This is good and this pleases me, and this room is not too large for a good discussion. Now let me establish two rules with regard to this argument. The first rule is this: that if you don't understand any word which I use, you should hold up your hand and ask me to explain it. If you allow me to use a word that you don't understand, then I will choose some one of you and ask you to explain it. The other the rule this: that if you ask me a question that perplexes me and that I don't know how to answer. I will simply say, &ldquo;Let's talk about that later.&rdquo;
The complexity of the equivalence problem for straight-line programs
Authors: Oscar H. Ibarra, Brian S. Leininger
Venue: Proceedings of the twelfth annual ACM symposium on Theory of computing (1980)

We look at several classes of straight-line programs and show that the equivalence problem is either undecidable or computationally intractable for all but the trivial classes. For example, there is no algorithm to determine if an arbitrary program (with positive, negative, or zero integer inputs) using only constructs x &larr; 1, x &larr; x + y, x &larr; x/y (integer division) outputs 0 for all inputs. The result holds even if we consider only programs which compute total 0/1 - functions. For programs using constructs x &larr; 0, x &larr; c, x &larr; cx, x &larr; x/c, x &larr; x + y, x &larr; x &minus; y, skip l, if p(x) then skip l, and halt,1 the equivalence problem is decidable in [equation] time (&lgr; is a fixed positive constant and N is the maximum of the sizes of the programs). The bound cannot be reduced to a polynomial in N unless P &equil; NP. In fact, we prove the following rather surprising result: The equivalence problem for programs with one input/output variable and one intermediate variable using only constructs x &larr; x + y and x &larr; x/2 is NP-hard. We also show the decidability of the equivalence problem for a certain class of programs and use this result to prove the following: Let IN be the set of natural numbers and f be any total one-to-one function from IN onto IN &times; IN. (f is called a pair generator. Such functions are useful in recursive function and computability theory.) Then f cannot be computed by any program using only constructs x &larr; 0, x &larr; c, x &larr; x + y, x &larr; x &minus; y, x &larr; x * y, x &larr; x/y, skip l, if p(x) then skip l, and halt.
Life is universal!
Authors: Robert T. Wainwright
Venue: Proceedings of the 7th conference on Winter simulation - Volume 2 (1974)

The game of Life1 involves forms built out of simple birth and death rules which a computer puts through a series of rapid transformations. This game was invented by John Horton Conway and recently introduced in Scientific American by Martin Gardner. Many computers have been programmed to play the game of Life. In this paper we shall show how to return the compliment by making Life forms that can imitate computers. Then we shall see that many remarkable consequences follow from the existence of such constructions. Further we shall see that in Life there exists the possibility of organisms with the ability to duplicate themselves, to reproduce. It has even been suggested that the universe itself is space-time granular and that the future although completely deterministic is unpredic-table, being its own fastest simulation.
An interactive logic activity modelling program
Authors: H. B. Rigas, H. B. Jacoby, V. B. Hunt
Venue: Proceedings of the ACM annual conference - Volume 2 (1972)

Simulation of logic networks can be a valuable tool in such areas as teaching the principles of logic design, investigating hardware implementation of arithmetic algorithms, and verifying the validity of test sequences in fault diagnosis of various types of networks to mention only a few possible applications. To be useful for a large number of problems in these classes, the simulator should be both flexible in its application and convenient to use. A system is described here which allows a user to obtain realistic digital network simulations in batch mode, interactively from a teletype or graphics terminal or through some combination of these modes. The simulator does account for propagation time through discrete logic components but the timing facility may be over-ridden. A hierarchy of networks may be built up and saved, thus allowing gradual fabrication of a complete system hardware simulation.
Better techniques for developing large scale fortran programs
Authors: Lavern Ghan
Venue: Proceedings of the 1971 26th annual conference (1971)

Boeing has had considerable continuous experience in development of large computer aided design programs for aerospace vehicles and has encountered most of the development problems. This paper presents some of the techniques and ideas evolved by Boeing in dealing with the more prominent problems. Emphasis is placed on the use of higher level software, interprogram communications techniques, and good basic programming practices.
The future of natural language processing (Panel Discussion)
Authors: John M. Morris
Venue: Proceedings of the 1979 annual conference (1979)

Recent work in natural language processing has focused on the analysis of contextual cues present in written text. It has been argued that the detection of such cues does not reflect the methods used by humans engaged in the same task, since computer systems rely heavily on contrived micro-worlds and artificial scripts. Context detection under such conditions is said to be an oversimplification of the real-world process. The thesis of this paper is three-fold: First, it is argued that the methods of context detection differ radically for spoken language and written language; second, that the structure of written text is parasitic on that of spoken language; and third, that the task of determining context in written text is frequently more complex than the task of determining context in spoken language. A distinction is drawn between the NARRATIVE and the INTERACTIVE forms of language use.
An optimized ATPG
Authors: Samiha Mourad
Venue: Proceedings of the 17th Design Automation Conference (1980)

This paper describes a hierarchical approach to the detection of the critical faults of a digital board, i.e., those most likely to occur. The failure probabilities of the nodes of a board are estimated and used as weights in selecting the nodes for fault detection. The study has indicated both a saving in pattern generation and a higher fault detection per pattern. This approach introduces a new definition of fault coverage. The approach is also applicable to analog circuits. In addition, it allows for continual incorporation of field data, thus improving the estimation of the failure probabilities.
Determining equivalence of expressions in random polynomial time
Authors: Gaston H. Gonnet
Venue: Proceedings of the sixteenth annual ACM symposium on Theory of computing (1984)

We devise several procedures based on signatures (or hashing functions) to determine equivalence of expressions in Random Polynomial Time (also called Probabilistic Polynomial Time) (RPT). These procedures return as result: &ldquo;equivalent&rdquo; or &ldquo;not-equivalent&rdquo;. The result &ldquo;not-equivalent&rdquo; is always correct, while the result &ldquo;equivalent&rdquo; is correct with probability at least 1-&egr;. This probability depends on a random number generator and is independent of the problem being solved. In all our procedures, the value &egr; can be made arbitrarily small. This method works for determining equivalence over an important class of functions as well as answering other questions like linearity, polynomial dependence, squareness, independence, etc.
Some problems about polynomials
Authors: Maurice Mignotte
Venue: Proceedings of the third ACM symposium on Symbolic and algebraic computation (1976)

We consider the following topics: upper bounds for the roots of a polynomial, the minimum distance between distinct roots, Bernouilli's method, and factorization over the integers. Some problems are solved, others are left open.
The derivation of microcode by symbolic execution
Authors: John Wade Ulrich
Venue: Proceedings of the 13th annual workshop on Microprogramming (1980)

Given a description of a computer called the &ldquo;target&rdquo; and a micro processor called the &ldquo;host&rdquo; we would like to generate a micro program which when executed by the host will simulate the target. We accomplish this by first breaking the target down into a set of small segments. Then, logical conditions for an appropriate microcode are generated for each segment by a combination of symbolic execution and simplification. When completed, the segments are assembled into a working code by solving the set of logical conditions.
Machine language programming in an undergraduate computer science curriculum
Authors: Ian Sommerville
Venue: Proceedings of the seventh SIGCSE technical symposium on Computer science education (1977)

This paper examines the advantages and disadvantages of teaching machine language programming to computer science undergraduate students. A teaching language based on reverse Polish notation, but with high-level control constructs, is presented as an alternative to conventional assembly language. Experiences with using this language are described.
Formatting user manuals for use
Authors: Nichole J. Vick
Venue: Proceedings of the 2nd annual international conference on Systems documentation (1983)

Today's documentation specialist writes at a computer terminal, either at a stand-alone word processor or at a terminal of a computer system equipped with word processing software. In recent years, the capabilities of word processing software have expanded rapidly. As a result, most of us have&mdash;as online writers&mdash;tremendous flexibility in how we format the manuals we write. Format has come from the realm of the graphic artist in to the realities of the documentation specialist working with a word processor. What used to require typesetting and special graphic skills&mdash;which can be prohibitively expensive for limited-run, frequently updated manuals&mdash;is at our fingertips. Now we, as writers, must take full advantage of what we've got. That means applying many of the formatting techniques that visual communicators, such as graphic artists, have known for years. Then we will more fully function as technical communicators.
SIR: A statistical information retrieval system
Authors: C. D. Parsons
Venue: Proceedings of the 1964 19th ACM national conference (1964)

This paper describes the techniques and results of an information retrieval system utilizing an IBM 7094 installation at Phillips Petroleum Company. The Statistical Information Retrieval (SIR) system employs a -and-ldquo;co-ordinate concept-and-rdquo; with a logic based on the statistical probability that a desired document will be abstracted with a relatively high percentage of the identical or synonym keywords used in posing an inquiry concerning the document subjects. This approach to retrieval allows the use of an unlimited vocabulary, thus eliminating the need for a dictionary or thesaurus. The SIR programming incorporates a unique computing technique, vector manipulations and a search strategy which permit the system to operate efficiently on a large-scale computer. A bibliography and a representative example of the SIR program input and output are contained in an Appendix.