ppxscal/embedding_network huggingface dataset:
Cluster oriented architecture for the mapping of parallel processor networks to high performance applications
Authors: F-D. Kübler, F. Lücking
Venue: Proceedings of the 2nd international conference on Supercomputing (1988)

Massively parallel computer architectures have been discussed since the very beginning of electronic computing. The major design goal was clearly getting a superior system performance. Today, with supercomputers, most commonly used, this has changed to match the computing power of supercomputers for a fraction of their costs. Up to now most parallel computer systems have been build up by university institutes for research work with few commercial success. The recent progress in computer architecture design has made parallel processor networks much more feasible. Due to combinatorical problems in processor interconnection networks, cluster oriented approaches are the most favorable way for designing parallel systems. This requires a special interconnection hardware as well as mapping algorithms. In this paper we will present our new parallel cluster oriented computer system based on the INMOS transputer technology. This system includes a special network manager supported by dedicated hardware to make use of advanced dynamic mapping strategies in an efficient and flexible way.
A system for computer music performance
Authors: David P. Anderson, Ron Kuivila
Venue: ACM Transactions on Computer Systems (TOCS) (1990)

A computer music performance system (CMPS) is a computer system connected to input devices (including musical keyboards or other instruments) and to graphic and audio output devices. A human performer generates input events using the input devices. The CMPS responds to these events by computing and performing sequences of output actions whose intended timing is determined algorithmically. Because of the need for accurate timing of output actions, the scheduling requirements of a CMPS differ from those of general-purpose or conventional real-time systems. This paper describes the scheduling facilities of FORMULA, a CMPS used by many musicians. In addition to providing accurate timing of output action sequences, FORMULA provides other basic functions useful in musical applications: (1) per-process virtual time systems with independent relationships to real time; (2) process grouping mechanisms and language-level control structures with time-related semantics, and (3) integrated scheduling of tasks (such as compiling and editing) whose real-time constraints are less stringent than those of output action computations.
The next generation of manufacturing simulation
Authors: C. Fuller
Venue: Proceedings of the 21st conference on Winter simulation (1989)

Emerging manufacturing systems (FMS) pose a significant problem for traditional material flow and discrete event simulators. The decomposition level in the traditional paradigm is too coarse to provide adaptive process selection and cost-based routing. Also, increased complexity within the manufacturing work cell has reduced the accuracy and confidence level of the input parameters to the simulation, such as cycle times. Thus, the simulation paradigm for industrial material flow and manufacturing processes must be revised.The focus of this paper is three-fold. First is an analysis of the problems facing the traditional manufacturing simulation methodology as a result of the new manufacturing techniques. Second is an explanation of the need for a continuous event, physically based workcell simulation functionality tightly integrated with a discrete simulation model that has been extended to properly handle the requirements for flexible processing and routing logic. Lastly, the paper addresses the future of factory floor simulation in the context of the emerging distributed control system of the FMS.
Design of a distributed implementation of ABCL/I
Authors: J.-P. Briot, J. de Ratuld
Venue: Proceedings of the 1988 ACM SIGPLAN workshop on Object-based concurrent programming (1988)

In this paper we describe the design decisions leading to a distributed implementation of the ABCL language. We shortly review the ABCL (Actor Based Concurrent Language) computation model. We discuss some slight changes we bring to the current ABCL/1 language in order to distribute objects among several machines. Identification, reference, allocation and communication are the four concepts which need some evolution. The status of a first prototype implementation on a network of workstations (Lisp/Suns+Ethernet) is reported.
TCDL - an expert system language for wargaming
Authors: J. L. Sowers, P. E. Rubin
Venue: Proceedings of the 21st conference on Winter simulation (1989)

This paper discusses the design and implementation of the Tactical Control Directive Language (TCDL). TCDL is a special-purpose language designed for use within the Enhanced Naval Warfare Gaming System (ENWGS). It was developed to support the concept of Tactical Control Directives (TCDs) and to allow their use within the wargaming model. A TCD is a possibly complex series of actions which simulate decisions made by a Naval officer in response to a specified situation. For example, an aircraft carrier detecting the presence of unknown aircraft will launch fighters and, dependent on the actions of the unknown aircraft, will execute a variety of possible responses. While this and other doctrines could easily be implemented by the ENWGS development team as part of the base software system, it is more desirable for the users of the wargaming system to be able to develop TCDs. TCDL provides a language in which users who are generally neither programmers nor simulationists can combine ENWGS low-level wargaming primitives and conditions into complex operations. This capability effectively extends the ENWGS user interface and may in turn be used to build even more complex operations. Since the introduction of TCDs into ENWGS, many of the air operations missions (Rubin and Sowers, 1988) have been implemented via TCDs.We discuss the features of the TCDL compiler and how the language constructs assist in the production of code that integrates into a larger body of existing software. Also discussed are the advantages of the rule-based language in this type of environment, along with implementation problems such as assigning priorities to the various rules by the compiler. Examples of the language are shown along with a discussion of how the wargaming simulation is affected.
An Extended Domain-Based Model of Software Reliability
Authors: S. N. Weiss, E. J. Weyuker
Venue: IEEE Transactions on Software Engineering (1988)

A definition of software reliability is proposed in which reliability is treated as a generalization of the probability of correctness of the software in question. A tolerance function is introduced as a method of characterizing an acceptable level of correctness. This in turn is used, together with the probability function defining the operational input distribution, as a parameter of the definition of reliability. It is shown that the definition can be used to provide many natural models of reliability by varying the tolerance function and that it may be reasonably approximated using well-chosen test sets. It is also shown that there is an inherent limitation to the measurement of reliability using finite test sets.
An interactive tool for register-level structure optimization
Authors: D. W. Knapp
Venue: Proceedings of the 26th ACM/IEEE Design Automation Conference (1989)

This paper presents a program named RLEXT (Register Level Exploration Tool), which allows a user to manually modify a register-level datapath design. The allowed operations are addition and deletion of components and connections. Any component not an i/o port, a register, or an addressable memory may be added or deleted. Any wire or connection of a pin to a wire may be added or deleted. The unique aspect of RLEXT is that the continued ability of the datapath to support its behavioral specifications is guaranteed: that is, if the user makes changes that would impair the datapath's ability to carry out the desired function, RLEXT will automatically repair the datapath so that it is once again able to express the specified behavior.
MASA: a multithreaded processor architecture for parallel symbolic computing
Authors: R. H. Halstead,  Jr., T. Fujita
Venue: ACM SIGARCH Computer Architecture News (1988)

MASA is a &ldquo;first cut&rdquo; at a processor architecture intended as a building block for a multiprocessor that can execute parallel Lisp programs efficiently. MASA features a tagged architecture, multiple contexts, fast trap handling, and a synchronization bit in every memory word. MASA's principal novelty is its use of multiple contexts both to support multithreaded execution&mdash;interleaved execution from separate instruction streams&mdash;and to speed up procedure calls and trap handling in the same manner as register windows. A project is under way to evaluate MASA-like architectures for executing programs written in Multilisp.
Parallel univariate polynomial factorization on shared-memory multiprocessors
Authors: P. S. Wang
Venue: Proceedings of the international symposium on Symbolic and algebraic computation (1990)

Using parallelism afforded by shared-memory multiprocessors to speed up systems for polynomial factorization is discussed. The approach is to take the fastest known factoring algorithm for practical purposes and parallelize key parts of it. The univariate factoring algorithm consists of two major tasks (a) factoring modulo small integer primes and (b) EEZ lifting and recovery of true factors. A C coded system PFACTOR that implements (a) in parallel is described in detail. PFACTOR is a stand-alone parallel factorizer that can take input from a file, a pipe or a socket connection over a network. It can also be used interactively as a UNIX command. PFACTOR consists of parallel selection of primes, automatic balancing of work, parallel Berlekamp algorithm, and parallel reconciliation of degrees of factors modulo different primes. Actual timings on the Encore Multimax show the effectiveness of the approach. Work on part (b) is still on going.
A grid-based tool for knowledge acquisition: validation with multiple experts
Authors: M. L. G. Shaw
Venue: Issue 108 (April 1989) (1989)

Knowledge Support System Zero (KSS0) is a system providing an integrated set of tools for knowledge acquisition for knowledge based-systems. Elicit provides facilities for eliciting the important dimensions of an expert's thinking on a topic; Exchange extends this to share entities and attributes between experts and elicits differences in perspective and terminology as well as disagreements on the topic. SOCIO processes results from several experts to reveal the similarities and differences in the concept systems of different experts, or the same experts at different times, construing a domain defined through common entities or attributes. It can be used to focus discussion between experts on those differences between them which require resolution, enabling them to be classified in terms of differing terminologies, levels of abstraction, disagreements, and so on. It provides a framework for identifying consensus, correspondence, conflict, and contrast in a knowledge acquisition system with multiple experts.
Using symbolic execution for verification of Ada tasking programs
Authors: Laura K. Dillon
Venue: ACM Transactions on Programming Languages and Systems (TOPLAS) (1990)

A method is presented for using symbolic execution to generate the verification conditions required for proving correctness of programs written in a tasking subset of Ada. The symbolic execution rules are derived from proof systems that allow tasks to be verified independently in local proofs, which are then checked for cooperation. The isolation nature of this approach to symbolic execution of concurrent programs makes it better suited to formal verification than the more traditional interleaving approach, which suffers from combinatorial problems. The criteria for correct operation of a concurrent program include partial correctness, as well as more general safety properties, such as mutual exclusion and freedom from deadlock.
The Testability of Generalized Counters Under Multiple Faulty Cells
Authors: Abhijit Chatterjee, Jacob A. Abraham
Venue: IEEE Transactions on Computers (1990)

The testability of a class of circuits called generalized counters is investigated under a more powerful fault model than examined in earlier work. It is assumed that any number of full adders in a generalized counter can assume an incorrect function under fault, as long as the function remains combinational. The testability of the overall class of generalized counters is examined and it is shown that under a restricted fault model it is possible to detect all multiple faults with a test set that grows linearly with the number of counter inputs. It is then shown that for a subset of the class of generalized counters it is possible to detect multiple faults with a larger number of tests, linear to the number of counter inputs, when the restrictions on the fault model are relaxed.
How to invent distributed implementation schemes of an object-based concurrent language: a transformational approach
Authors: Etsuya Shibayama
Venue: ACM SIGPLAN Notices (1988)

A design and verification technique for implementation schemes of distributed software is presented. In this technique, first, the specification is modelled by a concurrent object system, that is, one which is constituted of computational agents with capability of concurrent execution and message passing. Then, such a concurrent object system is transformed into another concurrent object system, which models a sophisticated implementation scheme. Our transformation technique is mainly based on fusing and splitting concurrent objects. The correctness of transformation rules can be proven formally.
Computer-aided study of a problem in hermitian matrix theory
Authors: Man Kam Kwong, Mary Beth Dever
Venue: Journal of Symbolic Computation (1990)

Let A be any nxn positive definite matrix and B any nxn non-negative definite matrix. In anearlier paper, it was shown that for each n there is a real number t"n>2 such that if t
Finite buffers for fast multicast
Authors: P. B. Danzig
Venue: Proceedings of the 1989 ACM SIGMETRICS international conference on Measurement and modeling of computer systems (1989)

When many or all of the recipients of a multicast message respond to the multicast's sender, their responses may overflow the sender's available buffer space. Buffer overflow is a serious, known problem of broadcast-based protocols, and can be troublesome when as few as three or four recipients respond. We develop analytical models that calculate the expected number of buffer overflows that can be used to estimate the number of buffers necessary for an application. The common cure for buffer overflow requires that recipients delay their responses by some random amount of time in order to increase the minimum spacing between response messages, eliminate collisions on the network, and decrease the peak processing demand at the sender. In our table driven algorithm, the sender tries to minimize the multicast's latency, the elapsed time between its initial transmission of the multicast and its reception of the final response, given the number of times (rounds) it is willing to retransmit the multicast. It includes in the multicast the time interval over which it anticipates receiving the response, the round timeout. We demonstrate that the latency of single round multicasts exceeds the latency of multiple round multicasts. We show how recipients minimize the sender's buffer overflows by independently choosing their response times as a function of the round's timeout, sender's buffer size, and the number of other recipients.
Toward a Symbolic Representation of Intensity Changes in Images
Authors: A. F. Korn
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1988)

The symbolic representation of gray-value variations is studied, with emphasis on the gradient of the image function. The goal is to relate the results of this analysis to the structure of the picture, which is determined by the physics of the image generation process. Candidates for contour points are the maximal magnitudes of the gray-value gradient for different scales in the direction of the gradient. Based on the output of such a bank of gradient filters, a procedure is proposed to select automatically a suitable scale, and with that, the size of the right convolution kernel. The application of poorly adapted filters, which make the exact localization of gray-value corners or T-, X-, and Y-junctions more difficult, is thus avoided. Possible gaps at such junctions are discussed for images of real scenes, and possibilities for the closure of some of these gaps are demonstrated when the extrema of the magnitudes of the gray-value gradients are used.
Training adult learners - a new face in end users
Authors: Julie Scott
Venue: ACM SIGUCCS Newsletter (1988)

Most people find the new age of computers both a blessing and a curse. While excited by the prospect of great quantities of information being available at one's fingertips, developing the skills and the tools to effectively access this material can be frightening and stressful. From this growth of data opportunities a new end user has evolved who is motivated by a different set of circum-stances than those encountered by users of the past. This new kind of end user is interested in learning and obtaining only the skills and tools needed for solving specific problems. Only when other problems arise which may need different skills and tools will the end user be motivated to learn and obtain them.
Video in applied cognitive research for human-centered design
Authors: Renate J. Roske-Hofstrand
Venue: ACM SIGCHI Bulletin (1989)

Video constitutes one of the most direct and contextually rich means for capturing observable behavior in human-computer interaction. However, a major shortfall of this type of visual medium lies in its failure to directly capture those aspects of user behavior that can predictably be associated with human cognition. Goal-directed cognitive user processes such as those that occur in problem-solving, decision-making, and planning activities are by their nature not subject to recording on camera. Traditionally, cognitive researchers have inferred user planning and intent structures by abstracting from relatively long sequences of behavioral cues captured by video protocols.
The infinite state acceptor and its application to AI
Authors: Edward A. Isper,  Jr.
Venue: Issue 107 (January 1989) (1989)

The infinite state acceptor is presented and is shown to be more powerful than the Turing machine for purposes of accepting strings. The role of abstraction in the design of such machines is discussed. It will be argued that such an acceptor is not merely an eccentric extrapolation of current models but is useful for the description of the behavior of devices whose complexity is nontrivial.
Formulations and benefits of the law of demeter
Authors: K. J. Lienberherr
Venue: ACM SIGPLAN Notices (1989)

Our initial ideas on preventive maintenance of object-oriented systems were presented in [LHR88] which describes a set of guidelines called the "Law of Demeter". As a result of this publication we have received much feedback, as well as a detailed critique from [Sak89]. In this paper we expand on the initial ideas and present a new perspective with which to view the Law. This perspective is based on client/supplier relationships between methods and classes and allows a cleaner description of the benefits of the Law. This paper is also a reply to [Sak89] which was pointing out that the formulation of the Law for C++ needs additional work.At first sight, the idea of any rules or principles being superimposed on the creative mind seems more likely to hinder than to help, but this is really quite untrue in practice. Disciplined thinking focusses inspiration rather than blinkers it.
Character Scaling by Contour Method
Authors: A. Namane, M. A. Sid-Ahmed
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1990)

Advancement in digital-image processing hardware has given the printing industry novel facilities for capturing fonts and has provided new grounds for character scaling, which is an important issue in typesetting and graphical text. An algorithm for digital character scaling by a contour method is developed and implemented. The algorithm is based on scaling the contour of the character through a transformation. Cubic splines are used to interpolate the discrete samples of the contour character. Final results show no jaggies. The algorithm is applied to Arabic fonts and compared to two other algorithms: replication and telescoping template. The superior performance of the contour method is attributed to the cubic spline fitting, which gives better smoothness to the edge of the character.
Bisimulation through probabilistic testing (preliminary report)
Authors: K. G. Larsen, A. Skou
Venue: Proceedings of the 16th ACM SIGPLAN-SIGACT symposium on Principles of programming languages (1989)

We propose a language for testing concurrent processes and examine its strength in terms of the processes that are distinguished by a test. By using probabilistic transition systems as the underlying semantic model, we show how a testing algorithm with a probability arbitrary close to 1 can distinguish processes that are not bisimulation equivalent. We also show a similar result (in a slightly stronger form) for a new process relation called 2/3-bisimulation &mdash; lying strictly between that of simulation and bisimulation. Finally, the ultimately strength of the testing language is shown to identify an even stronger process relation, called probabilistic bisimulation.
With microscope and tweezers: the worm from MIT's perspective
Authors: Jon A. Rochlis, Mark W. Eichin
Venue: Communications of the ACM (1989)

The actions taken by a group of computer scientists at MIT during the worm invasion represents a study of human response to a crisis. The authors also relate the experiences and reactions of other groups throughout the country, especially in terms of how they interacted with the MIT team.
Rapid modeling: how it assists manufacturing competitiveness
Authors: R. Suri
Venue: Proceedings of the 21st conference on Winter simulation (1989)

The Rapid Modeling Technique (RMT) allows manufacturing analysts to quickly build new models for various manufacturing scenarios, as well as to rapidly explore a large number of "what-ifs" for each scenario. A set of integrated tools further extends RMT to allow the efficient investigation of decisions in virtually all stages of the design and operation of manufacturing systems. The use of these tools leads to cost-effective and timely analysis of manufacturing decisions, and hence to greater productivity and competitive position of the manufacturing enterprise. We present a set of five compatible tools for rapid modeling and analysis of manufacturing systems. Spreadsheets form the basic tool for simple calculations. RMT tools allow the user to study the dynamics of manufacturing systems using efficient mathematics: whole models can be built in hours and each "what-if" is analyzed in minutes. Translators allow almost instantaneous conversion of the analytical model into simulation code. Simulation Languages provide very detailed modeling abilities. Finally, Animation gives analysts the ability to present their results to co-workers and management in a convincing manner. We describe instances of these tools as well as the way in which they are integrated to form a compatible toolkit.