ppxscal/embedding_network huggingface dataset:
The effects of program segmentation on job completion times in a multiprocessor computing system
Authors: Richard K. Dumas
Venue: Proceedings of the second conference on Applications of simulations (1968)

This paper is the result of a study to determine the relationship between job completion times in a multiprocessor system and the manner in which the component programs of the jobs are segmented. The nature of jobs consists of a set of functionally related programs some of which could or must be executed in parallel. Thus the work for the multiprocessor system is described in the form of a network of programs. A typical network may appear as in Figure 1. The nodes in Figure 1 act as &ldquo;and&rdquo; nodes for this study. For example, program E cannot be executed until programs B and C have been completed. Several networks may be in various stages of execution at any given time. In particular the study was concerned with minimizing the completion time of the highest priority network.
Golf competition between individuals
Authors: Francis Scheid,  Ph.D.
Venue: Proceedings of the 11th conference on Winter simulation - Volume 2 (1979)

In almost all golf competition handicapping is used to more or less equalize players' winning chances. It is recognized that in different types of competition different handicap allowances are necessary. This study used two methods, one of them extensive simulation, to determine optimum allowances for individual men's match and stroke play.
A GPSS simulation to determine congestion in an ethernet type local area network
Authors: Howard Blums, Frank Paccione
Venue: Proceedings of the 16th conference on Winter simulation (1984)

A large bank has approximately 1000 terminals in a single building which perform transactions on several computer systems concentrated in a single data center. Cabling, modems and switching are required to support each terminal connection. The current methods of communication have led to congestion in the building's cabling conduit system and high per terminal costs for switching facilities, modems and relocation of terminals. A bus type local area network is being considered as a solution to these problems, but due to the newness of this technology, experience with an installation of similar size and characteristics appears as yet unavailable. Congestion of the network due to contention for access to the bus is a major concern. We describe a relatively simple model of the workload and communications bus operation developed to study the frequency of bus contention. A GPSS simulation program and results are presented for this model. In addition, an even more simplified analytical queueing model is used to bound the frequency of contention for the bus and the result is compared with that of the simulation.
A CAD system for unified hardware-software design
Authors: Vàclav Rajlich
Venue: Proceedings of the 12th Design Automation Conference (1975)

The paper deals with a proposed CAD system for unified hardware-software design. The paper pays considerable attention to the relevant theory, namely parallel programming, structured parallel programming, resources allocation and hierarchical ordering of parallel processes.
Fundamental laws of computer system performance
Authors: J. P. Buzen
Venue: Proceedings of the 1976 ACM SIGMETRICS conference on Computer performance modeling measurement and evaluation (1976)

A number of laws are derived which establish relationships between throughput, response time, device utilization, space-time products and various other factors related to computer system performance. These laws are obtained by using the operational method of computer system analysis. The operational method, which differs significantly from the conventional stochastic modeling approach, is based on a set of concepts that correspond naturally and directly to observed properties of real computer systems. Except for measurement errors, the operational laws presented in this paper apply with complete precision to all collections of observational data, and they are similar to fundamental laws found in other areas of engineering and applied science.
COKO III and the future of inter-snap judgment communication
Authors: Edward W. Kozdrowicki, Dennis W. Cooper
Venue: Proceedings of the ACM annual conference (1973)

A grandmaster usually spends a lifetime collecting knowledge or information about the game. Some of this knowledge is given to COKO in the form of a 12,000 line FORTRAN program. Using this knowledge COKO plays very poorly but at the super rate of approximately one move/sec. The use of a brute force selective tree searching procedure yields an order of magnitude improvement in performance at the standard rate of 3 min./move. Perhaps three orders of magnitude additional improvement is needed to defeat the world champion, a gap which must be bridged, if ever, by programming more chess knowledge into the machine. In addition &ldquo;inter-snap judgment communication&rdquo; is described as a natural, powerful procedure frequently used by humans to guide their selective search and as a point of emphasis for future development.
Lambda calculus schemata
Authors: Michael J. Fischer
Venue: Proceedings of ACM conference on Proving assertions about programs (1972)

A lambda calculus schema is an expression of the lambda calculus augmented by uninterpreted constant and function symbols and thus is an abstraction of programming languages such as LISP which permit functions to be passed to or returned from other functions. We then consider two natural implementation strategies: the retention strategy in which all variable bindings are retained until no longer needed (implying the use of some sort of garbage collected store) and the deletion strategy, modelled after the usual stack implementation of ALGOL-60, in which variable bindings are destroyed when control leaves the procedure (or block) in which they were created. Berry shows that the deletion strategy implementation is not &ldquo;correct&rdquo; for a wide class of languages in the sense that it is not equivalent to natural extensions of the copy rule of ALGOL to such languages, whereas the retention strategy is correct in that sense. We show, however, that no real power is lost in restricting oneself to a deletion strategy implementation, for any program can be translated into an equivalent one which will work correctly under such an implementation. The proof makes no use of the particular primitive functions and data of the language and hence is true of the corresponding schemata under all interpretations.
Throughput-delay characteristics and stability considerations of the access channel in a mobile telephone system
Authors: Bengt Stavenow
Venue: ACM SIGMETRICS Performance Evaluation Review (1984)

In this paper a performance study of the access channel in a cellular mobile telephone system /1/ is presented. The method used in the Cellular System for multiplexing the population of mobile terminals over the access channel is a hybrid between the methods known as CSMA/CD and BTMA. In the paper we extend an analysis of CSMA/CD to accomodate the function of the particular random multiaccess protocol. Results are shown which illustrate the equilibrium channel performance and the approximate stability-througput-delay tradeoff. Finally an estimate of the average message delay is given.
Computers outside the fishbowl
Authors: Dale R. Maus
Venue: Proceedings of the 1975 annual conference (1975)

Computers have traditionally operated in a glass enclosed, air-conditioned environment...in a fishbowl. The computer center has been a mysterious closed area where technology reigned supreme. Now, with the advent of inexpensive, rugged hardware, computers have come out of the fishbowl into the cruel, real-time world. As the computer gets closer to the sensor, so the programmer must get closer to the engineer and the application. The new breed of programmers will have engineering backgrounds and interests. The panel will challenge these new engineering programmers by reviewing the uses of computers in industrial, automotive, airborne and military application. The panel will show that rapid advances in technology will cause a major impact in the design, use and programming of computers for hostile and real-time environments.
A cellular automaton for pattern recognition by parallel computation
Authors: Carl F. R. weiman
Venue: Proceedings of the ACM annual conference (1973)

A cellular automaton that recognizes arbitrary straight lines projected on grids has been designed. All cells interact simultaneously with their nearest neighbors. The interactions correspond to the rewriting algorithms of Rothstein's code for straight lines (see immediately preceding abstract). The logical design and number of states are fixed, i.e. independent of the slope and position of the line and the number of cells in the grid. Simple changes in the transition graph of this automaton yield other automata that recognize polygonal approximation of curves and detect such properties as topological connectivity. These designs are also fixed in the above sense. The code operations corresponding to line recognition can be interpreted as the application of a kind of Euclidean division algorithm to the slope of the line. Thus, the cellular automaton can be seen as a parallel computer whose fundamental operation is base-independent parallel division.
Computer learning through association
Authors: Robert W. Snelsire, Robert P. Roesser
Venue: Proceedings of the second conference on Applications of simulations (1968)

In this report a computer program is described which attempts to model the techniques by which human beings take information about an initially unknown environment and use it to develop rules for coping with the environment. The environment chosen is a simple game, similar to tic-tac-toe. The computer program and a randomly playing opponent alternately place their symbols on a three by three board. After nine such moves the program is told whether it won or lost the game according to a predetermined set of rules. The model is programmed to develop a strategy for successive games. As the computer plays more games the rules and strategy become more sophisticated. Two fundamental hypotheses were used in the implementation of the learning process. 1) Learning is achieved through association on simple observable phenomena (game results), to more complex concepts. This gives direction to the learning process. 2) Learning is based on a type of economic system in which concepts are developed only when their worth in playing an effective game exceeds their cost in complexity. The program was written in IPL-V and implemented on the IBM 7044 at the State University of New York at Buffalo.
An Interactive Visual Environment to Understand, Model and Exploit User Subjectivity in Image Retrieving Systems
Authors: Nadia Bianchi Berthouze, Toshikazu Kato
Venue: Proceedings of the 10th International Conference on Image Analysis and Processing (1999)

The research discussed in this paper focuses on the emergence of a multimedia language for human and technology to communicate over highly subjective concepts (such as impressions, feelings, and emotions). Nowadays technology is not just a tool for realizing tasks, it also serves as a medium for people to communicate. For that reason, the issue of endowing computers with the ability to understand and communicate emotion has become crucial. But how can we give such capability to a computer? And how can we transmit to a computer our emotion or our feelings. In this paper, we suggest to draw inspiration from human-human communication. Mutual understanding over emotional responses can be achieved through social interaction. We propose a dynamic interactionist framework for understanding and communicating highly subjective concepts such as visual impressions.
A class of number representations for parallel arithmetic
Authors: Algirdas Avizienis
Venue: Proceedings of the 1961 16th ACM national meeting (1961)

This presentation describes a new class of number representations which are called signed-digit representations. The primary objective of signed-digit representations is the elimination of carry-propagation chains during addition and subtraction in parallel arithmetic units of digital computers. This objective is attained by the use of redundant representation of the operands. In a conventional number representation with an integer radix r > 1 each digit is allowed to assume exactly r values: 0, 1, ..., r-1. In a redundant representation with the same radix r each digit is allowed to assume more than r values. Previous methods of carry elimination formed redundant representations by the combination of explicitly identified digits, such as stored carries or borrows, with conventional number representations. A difficulty in redundant representations of the stored-carry type is the lack of unique representation for the zero algebraic value of a number; the former sign digit (now indicator digit) does not always indicate the true sign of a number and overflow detection becomes more complicated. Furthermore, the number of states of one digital position is doubled by the binary stored-carry digit; this amount of redundancy is excessive.
Automated generation of testcase datasets
Authors: E. F. Miller,  Jr., R. A. Melton
Venue: Proceedings of the international conference on Reliable software (1975)

Software quality enhancement can be achieved in the near term through use of a systematic program testing methodology. The methodology attempts to relate functional software testcases with formal software specifications as a means to achieve correspondence between the software and its specifications. To do this requires generation of appropriate testcase data. Automatic testcase generation is based on a priori knowledge of two forms of internal structure information: a representation of the tree of subschema automatically identified from within each program text, and a representation of the iteration structure of each subschema. This partition of a large program allows for efficient and effective automatic testcase generation using straightforward backtracking techniques. During backtracking a number of simplifying, consolidating, and consistency analyses are applied. The result is either (1) early recognition of the impossibility of a particular program flow, or (2) efficient generation of input variable specifications which cause the testcase to traverse each portion of the required program flow. A number of machine output examples of the backtracking facility are given, and the general effectiveness of the entire process is discussed.
Incorporating the human factor in color CAD systems
Authors: Francine S. Frome
Venue: Proceedings of the 20th Design Automation Conference (1983)

Computer Aided Design (CAD) systems require the presentation of visual information of various kinds to users at workstations. This paper discusses how to make use of user studies and behavioral research to design more effective and productive CAD systems. Topics include: &bull; optimizing the color display of printed wiring boards, violations, messages, and menus; &bull; increasing workstation productivity by taking advantage of the characteristics of the human user; and &bull; deriving system abbreviations that are easy for users to learn and remember. The strategies of human factors research and how to make it most valuable by reducing design intervals, costs, and user errors are discussed.
Design of a user-microprogrammable building block
Authors: Michael Kraley, Randall Rettberg, Philip Herman, Robert Bressler, Anthony Lake
Venue: Proceedings of the 13th annual workshop on Microprogramming (1980)

A user-microprogrammable computer has been developed for use as a building block in general-purpose and dedicated computer systems. The architecture is designed to be easily microprogrammed and features a 32-bit, vertically oriented microinstruction. The processor has a 135-nanosecond cycle time, either 16- or 20-bit macro data paths, and 1024 hardware registers. A significant fraction of the processor bandwidth may be budgeted for I/O processing to allow the substitution of microcode for expensive peripheral controllers. Furthermore, the micromachine is well suited to the emulation of other computer architectures in that it provides a large writable microcode memory and a minimum of special processor data paths. The design goals and strategies which determined the machine architecture are discussed, as well as an overview of the architecture and hardware organization. Finally, we report a number of specific applications developed to date.
SLAM IITM tutorial
Authors: Jean J. O'Reilly, A. Alan B. Pritsker
Venue: Proceedings of the 15th conference on Winter simulation - Volume 1 (1983)

In 1979, the state-of-the-art in simulation languages was extended with the introduction of SLAMTM, the first language that provided three different modeling viewpoints in a single integrated framework.(5) SLAM permits discrete event, continuous, and network modeling perspectives and/or any combination of the three to be implemented in a single model. SLAM represented a significant breakthrough in simulation methods development, as it provided the flexibility to use the most appropriate world view for the system being studied. This improved upon the more traditional situation in which simulation modelers were restricted to the modeling perspective embodied in the language they were using. The success of this new approach was readily apparent.
The genealogical approach to the layout problem
Authors: Antoni A. Szepieniec, Ralph H.J.M. Otten
Venue: Proceedings of the 17th Design Automation Conference (1980)

The concept of the genealogical approach to the layout problem is presented. The system pursues the idea of flexible modules and is capable of dealing with arbitrarily complex tasks. The genealogical tree of the system provides a mainframe for organizing the information flow. Results of the system routines are described in terms of transitions between flexibility classes of modules.
Polynomial evaluation via the division algorithm the fast Fourier transform revisited
Authors: Charles M. Fiduccia
Venue: Proceedings of the fourth annual ACM symposium on Theory of computing (1972)

A polynomial p(x) can be evaluated at several points x1,...,xm by first constructing a polynomial d(x) which has x1,...,xm as roots, then dividing p(x) by d(x), and finally evaluating the remainder r(x) at x1,...,xm. This method is useful if the coefficient sequence of d(x) can be chosen to be sparse, thus simplifying the construction of r(x). The case m&equil;1 and d(x) &equil; x&minus;x1 is Horner's rule, while the case d(x) &equil; xm&minus;1 yields the fast Fourier transform algorithm.
Powers of graphs: A powerful approximation technique for bottleneck problems
Authors: Dorit S. Hochbaum, David B. Shmoys
Venue: Proceedings of the sixteenth annual ACM symposium on Theory of computing (1984)

In this paper we investigate a powerful, and yet simple, technique for devising approximation algorithms for a wide variety of NP-complete problems in routing, location, and communication network design. Each of the algorithms presented here delivers an approximate solution guaranteed to be within a constant factor of the optimal solution. In addition, for several of these problems we can show that unless P&eqil;NP, there does not exist a polynomial-time algorithm that has a better performance guarantee.
FORMAC an experimental formula manipulation Compiler
Authors: E. Bond, M. Auslander, S. Grisoff, R. Kenney, M. Myszewski, J. Sammet, R. Tobey, S. Zilles
Venue: Proceedings of the 1964 19th ACM national conference (1964)

FORMAC, (FORmula MAnipulation Compiler), is an experimental programming system which can assist scientists in the manipulation of mathematical expressions. It is an extension of FORTRAN IV, thus providing the capability of performing both numeric and non-numeric computations and manipulations in the same program.
An algebraic manipulator using SLIP
Authors: Lapidus, Arnold, Goldstein, Max, Greenspan, Samuel
Venue: Proceedings of the first ACM symposium on Symbolic and algebraic manipulation (1966)

A notation for representing algebraic expressions to be manipulated by a SLIP type list processor is described in detail. This notation allows Fortran type algebraic expressions to be represented in the form of list structures which will be used in a set of programs which are being developed.
The Master's Practicum: A bridge over the Industry/University Gap
Authors: Neil Webre
Venue: Proceedings of the fifth SIGCSE technical symposium on Computer science education (1975)

There has been a continuing discussion in the SIGCSE Bulletin over the &ldquo;gap&rdquo; between the subject matter and methodology of Computer Science curricula and the needs of industry (1, 2, 3, 7, 8). There have been both denials that a gap exists, and reaffirmations of its existence. Two of the proposals for a solution to the problem have called for direct contact between students and industry during the education process. Goddard (9) discussed the internship and cooperative program at both the undergraduate and graduate levels. The ACM curriculum recommendations for a Master of Information Systems degree(4) contain a course proposal for Systems Development Projects (course D3) which involves significant contact between students and industry. This paper discusses the need for professional training during the education process and our attempt to provide such training within a Computer Science Masters degree program by means of a course, the Master's Practicum.
An algorithm for the general Petri net reachability problem
Authors: Ernst W. Mayr
Venue: Proceedings of the thirteenth annual ACM symposium on Theory of computing (1981)

An algorithm is presented for the general Petri net reachability problem based on a generalization of the basic reachability construction which is symmetric with respect to the initial and final marking. Sets of transition sequences described by finite automata are used for approximations to firing sequences, and the approximation error is assessed by uniformly constructable Presburger expressions. The approximation algorithm is iterated until a sufficient criterion for reachability can be given, not-withstanding the remaining uncertainty.
Performance evaluation: Experimental computer science at its best
Authors: Peter J. Denning
Venue: Proceedings of the 1981 ACM SIGMETRICS conference on Measurement and modeling of computer systems (1981)

What is experimental computer science? This question has been widely discussed ever since the Feldman Report was published (1979 [18]). Many computer scientists believe that survival of their discipline is intimately linked to their ability to rejuvenate experimentation. The National Science Foundation instituted the Coordinated Experimental Research Program (CERP) in 1979 to help universities set up facilities capable of supporting experimental research. Other agencies of government are considering similar programs. Some industrial firms are offering similar help through modest cash grants and equipment discounts. What is experimental computer science? Surprisingly, computer scientists disagree on the answer. A few believe that computer science is in flux&mdash;making a transition from theoretical to experimental science&mdash;and, hence, no operational definition is yet available. Some believe that it is all the non-theoretical activities of computer science, especially those conferring &ldquo;hands-on&rdquo; experience. Quite a few believe that it is large system development projects&mdash;i.e., computer and software engineering&mdash;and they cite MIT's Multics, Berkeley's version of Bell Labs' UNIX, the ARPAnet, IBM's database System R, and Xerox's Ethernet-based personal computer network as examples. These beliefs are wrong. There are well-established standards for experimental science. The field of performance evaluation meets these standards and provides examples of experimental science for the rest of the computing field.