ppxscal/embedding_network huggingface dataset:
Integrated projection illustrating
Authors: Tore Smestad, Kristian Andersen
Venue: ACM SIGSOFT Software Engineering Notes (1988)

This paper suggests "Integrated Projection Illustrating" as a concept to be used in connection with visual descriptions of some complexity. It is meant both as an explanatory framework for what has been done so far, and as a guiding tool for making more efficient and complete "packages" of visual information in general and of diagraming in software engineering in particular. Known principles and pieces of techniques are put together to make up a unified basis.
The design and building of Ench&egrave;re, a distributed electronic marketing system
Authors: Jean-Pierre Banâtre, Michel Banâtre, Guy Lapalme, Florimond Ployette
Venue: Communications of the ACM (1986)

Building and prototyping an agricultural electronic marketing system involved experimenting with distributed synchronization, atomic activity, and commit protocols and recovery algorithms.
On Distributed Computations with Limited Resources
Authors: H. R. Kanakia, R. A. Tobagi
Venue: IEEE Transactions on Computers (1987)

We consider two styles of executing a single job or an algorithm: either the job is subdivided into tasks, each of which is executed. on a separate processor, or the entire job is executed on a single processor, that has the same capacity as the sum of the processors in the earlier case. The algorithm is abstracted as consisting of a number of tasks with dependencies among them. Our model of dependencies among tasks allows sequential execution, parallel execution, synchronization, and spawning of tasks. The model assumes that the dependencies are known before the job begins, and a task in not preempted after its execution begins. With the usual assumptions such as exponential distribution of task execution times, and Poisson arrival of input data, we are able to show that the centralized execution completes the job faster than the decentralized execution only for a certain range of parameters of algorithms. We also give counterexamples that show that, contrary to popular belief, the reverse is true for some values of parameters of algorithms.
ARIADNE: pattern-directed inference and hierarchical abstraction in protein structure recognition
Authors: Richard H. Lathrop, Teresa A. Webster, Temple F. Smith
Venue: Communications of the ACM (1987)

The macro-molecular structural conformations of proteins exhibit higher order regularities whose recognition is complicated by many factors. ARIADNE searches for similarities between structural descriptors and hypothesized protein structure at levels more abstract than the primary sequence.
A relational approach to monitoring complex systems
Authors: Richard Snodgrass
Venue: ACM Transactions on Computer Systems (TOCS) (1988)

Monitoring is an essential part of many program development tools, and plays a central role in debugging, optimization, status reporting, and reconfiguration. Traditional monitoring techniques are inadequate when monitoring complex systems such as multiprocessors or distributed systems. A new approach is described in which a historical database forms the conceptual basis for the information processed by the monitor. This approach permits advances in specifying the low-level data collection, specifying the analysis of the collected data, performing the analysis, and displaying the results. Two prototype implementations demonstrate the feasibility of the approach.
Dealing with world-model-based programs
Authors: Giuseppina C. Gini, M. L. Gini
Venue: ACM Transactions on Programming Languages and Systems (TOPLAS) (1985)

We introduce POINTY, an interactive system for constructing world-model-based programs for robots. POINTY combines an interactive programming environment with the teaching-by-guiding methodology that has been successful in industrial robotics. Owing to its ability to control robots in real time, and to interact with the user, POINTY provides a friendly and powerful programming environment for robot applications. In the past few years, POINTY has been in use at Stanford to write, test, and debug various robot programs.
Ada language training with a COBOL translation model
Authors: K A Arnett, C M Butler
Venue: ACM SIGAda Ada Letters (1987)

The use of Ada outside of its original embedded systems area seems a certainty. Training Ada programmers is a key concern of those involved in the Ada effort, and there is much concern over professionalism of Ada programmers. While this paper does not suggest that elementary Ada training is sufficient for trained programmers with other language skills, it presents the results of an experiment focused towards providing elementary Ada language training for COBOL programmers. The results demonstrated that participants training with a computer model can learn the same amount of material as textbook trained participants in much less time.
Distrbution and Abstract Types in Emerald
Authors: Andrew Black, Norman Hutchinson, Eric Jul Henry Levy, Larry Carter
Venue: IEEE Transactions on Software Engineering (1987)

Emerald is an object-based language for programming distributed subsystems and applications. Its novel features include 1) a single object model that is used both for programming in the small and in the large, 2) support for abstract types, and 3) an explicit notion of object location and mobility. This paper outlines the goals of Em-erald, relates Emerald to previous work, and describes its type system and distribution support. We are currently constructing a prototype implementation of Emerald.
Generations of permutations with non-unique elements
Authors: T. J. Rolfe
Venue: ACM SIGNUM Newsletter (1988)

We wish to generate all unique permutations of a list of elements with possibly repeated items. We develop four algorithms to generate permutations, two from Knuth's Art of Computer Programming and two of our own devising. The last one developed also gives a numbering scheme for permutations that can be inverted to regenerate original permutations.
An Experience Using Two Covert Channel Analysis Techniques on a Real System Design
Authors: J. Thomas Haigh, Richard A. Kemmerer, John McHugh, William D. Young
Venue: IEEE Transactions on Software Engineering (1987)

This paper examines the application of two covert channel analysis techniques to a high level design for a real system, the Honeywell Secure Ada® Target (SAT). The techniques used were a version of the noninterference model of multilevel security due to Goguen and Meseguer and the shared resource matrix method of Kemmerer. Both techniques were applied to the Gypsy Abstract Model of the SAT. The paper discusses the application of the techniques and the nature of the covert channels discovered. The relative strengths and weaknesses of the two methods are discussed and criteria for an ideal covert channel tool are developed.
Logic programming
Authors: Michael R. Genesereth, Matthew L. Ginsberg
Venue: Communications of the ACM (1985)

Logic programming is programming by description. The programmer describes the application area and lets the program choose specific operations. Logic programs are easier to create and enable machines to explain their results and actions.
Post-mortem analysis of software engineering at Wang Institute
Authors: Richard E. Fairley
Venue: ACM SIGSOFT Software Engineering Notes (1988)

This paper contains the text of invited presentation by the author at the Software Engineering Education Conference, which was held in Pittsburgh on April 30 and May 1, 1987. Topics presented here include an overview of the Wang Institute programs in software engineering, an analysis of the strengths and weaknesses of the Master of Software Engineering curriculum, and a discussion of reasons for termination of the software engineering education programs at Wang Institute of Graduate Studies.
Generalised arrays and shortest path problems
Authors: Claudio Sandi
Venue: ACM SIGAPL APL Quote Quad (1986)

Real world problems are often formulated as flow optimization problems on large networks, with thousands of nodes but with a restricted number of arcs. The average number of arcs having a given node as origin or terminal node (node degree) may be limited even to a few units. Standard optimization methods, mainly matrix methods for complete or strongly connected graphs, may become unpractical; recent results have shown the superiority of advanced methods based on suitable data structures. In this study the classical shortest path problem, one of the basic techniques in network flow optimization, is approached, in APL environment, using: i) standard matrix methods, ii) methods that handle irregular structures element by element, and iii) advanced methods using generalized arrays. Preliminary results indicate which approach should be preferred, according to problem characteristics and size.
Modeling of parallel software for efficient computation communication overlap
Authors: J. S. Leu, D. P. Agrawal, J. Mauney
Venue: Proceedings of the 1987 Fall Joint Computer Conference on Exploring technology: today and tomorrow (1987)

A new medium grain model is proposed to model accurately the movement of data between various computational tasks of a user program to run on a parallel machine. Three different attributes are used to represent the communication activities that might exist among various tasks. a. Time taken to produce an outgoing data package for a dependent task. b. Dependent task execution duration without the arrival of the incoming data package. c. The communication time to send data package from one task to its dependent task. These parameters help in identifying possible computational overlap between interactive tasks, which leads to additional speedup besides the usual speedup that could be achieved from parallel execution of independent tasks, communication activities that might exist among various tasks. These parameters help in identifying possible computational overlap between interactive tasks, which leads to additional speedup besides the usual speedup that could be achieved from parallel execution of independent tasks.
An experimental coprocessor for implementing persistent objects on an IBM 4381
Authors: C. J. Georgiou, S. L. Palmer, P. L. Rosenfeld
Venue: ACM SIGARCH Computer Architecture News (1987)

In this paper we describe an experimental coprocessor for an IBM 4381 that is designed to facilitate the exploration of persistent objects.
Prediction of transport protocol performance through simulation
Authors: K Mills, M Wheatley, S Heatley
Venue: Proceedings of the ACM SIGCOMM conference on Communications architectures protocols (1986)

A five-layer simulation model of OSI protocols is described and applied to predict transport performance on a local area network (LAN). Emphasis is placed on time-critical applications typical of a small, flexible manufacturing system. The results predict that, with current technology, OSI protocols can provide 1.5 Mbps throughput, one-way delays between 6 and 10 ms, and response times between 15 and 25 ms. The results also indicate that CSMA/CD is a reasonable access method for time-critical applications on small, factory LANS, if loads of less than 40% are anticipated. For loads between 40% and 70%, a token passing access method provides better performance for time-critical applications.
An in-cache address translation mechanism
Authors: D. A. Wood, S. J. Eggers, G. Gibson, M. D. Hill, J. M. Pendleton
Venue: Proceedings of the 13th annual international symposium on Computer architecture (1986)

In the design of SPUR, a high-performance multiprocessor workstation, the use of large caches and hardware-supported cache consistency suggests a new approach to virtual address translation. By performing translation in each processor's virtually-tagged cache, the need for separate translation lookaside buffers (TLBs) is eliminated. Eliminating the TLB substantially reduces the hardware cost and complexity of the translation mechanism and eliminates the translation consistency problem. Trace-driven simulations show that normal cache behavior is only minimally affected by caching page table entries, and that in many cases, using a separate device would actually reduce system performance.
Performance analysis of a fault detection scheme in multiprocessor systems
Authors: Anton T. Dahbura, Krishan K. Sabnani, William J. Hery
Venue: Proceedings of the 1987 ACM SIGMETRICS conference on Measurement and modeling of computer systems (1987)

A technique is described for detecting and diagnosing faults at the processor level in a multiprocessor system. In this method, a process is assigned whenever possible to two processors: the processor that it would normally be assigned to (primary) and an additional processor which would otherwise be idle (secondary). Two strategies will be described and analyzed: one which is preemptive and another which is non-preemptive. It is shown that for moderately loaded systems, a sufficient percentage of processes can be performed redundantly using the system's spare capacity to provide a basis for fault detection and diagnosis with virtually no degradation of response time.
Benchmark Synthesis Using the LRU Cache Hit Function
Authors: Wing Shing Wong, Robert J. T. Morris
Venue: IEEE Transactions on Computers (1988)

The LRU cache hit function is used as a general characterization of locality of reference to address the synthesis question of whether benchmarks can be created that have a required locality of reference. Several results are given that show circumstances under which this synthesis can or cannot be achieved. An additional characterization called the warm-start cache hit function is introduced and shown to be efficiently computable. The operations of repetition and replication are used to form new programs, and their characteristics are derived. Using these operations, a general benchmark synthesis technique is obtained and demonstrated with an example.
Hypertext '87
Authors: Jakob Nielsen
Venue: ACM SIGCHI Bulletin (1988)

Hypertext '87 was the first large-scale meeting devoted to the hypertext concept. Before the workshop, hypertext had been considered a somewhat esoteric concept of interest to a few fanatics only. So just in case some readers don't know what hypertext is, let me start by defining it.
A plausibility-driven approach to computer architecture design
Authors: Ulises Agüero, Subrata Sasgupta
Venue: Communications of the ACM (1987)

A dilemma skirting the discipline of computer architecture concerns the plausibility of architectural designs. To counter the widely held perception that architecture is a nebulous entity is a proposal to view such designs as specifications of constraints to be satisfied.
Software maintenance documentation
Authors: Miheko L Ouchi
Venue: Proceedings of the 4th annual international conference on Systems documentation (1986)

This work aims at presenting a model for assisting in the development of Information System for software maintenance documentation. It seeks to emphasize the optimization of the functions related to the documentation, by employing automatic processes. In this study the system of documentation is based on a Data Dictionary structure, adequately designed for the organized storage of the information needed for the execution of the maintenance activities. Forms of the information input, updating and retrieval have been analysed with the intention of utilizing the basic software of support, as well as to consider the possibilities of the Dictionary interface with the Operating System file, throughout the modification of the application software.
John Reid reports: X3J3 meeting, August 1986
Authors: John Reid
Venue: ACM SIGPLAN Fortran Forum (1987)

The meeting was dominated by the themes of correctlng errors in the draft document (S8) and improving its readability, making the technical changes that were agreed at the previous meeting as part of the compromise that reduces the size of the language, and reacting to the ISO meeting held in the previous week. It now looks likely that a fresh letter ballot will be held on the version of S8 that includes all the changes made at this and the next meeting in November and that the February meeting will be devoted to processing the ballots. A straw roll-call ballot on how those members present at Halifax expected to vote in this ballot was 24-6, so it looks as if the compromise will obtain the two-thirds majority needed.
Generative communication in Linda
Authors: David Gelernter
Venue: ACM Transactions on Programming Languages and Systems (TOPLAS) (1985)

Generative communication is the basis of a new distributed programming langauge that is intended for systems programming in distributed settings generally and on integrated network computers in particular. It differs from previous interprocess communication models in specifying that messages be added in tuple-structured form to the computation environment, where they exist as named, independent entities until some process chooses to receive them. Generative communication results in a number of distinguishing properties in the new language, Linda, that is built around it. Linda is fully distributed in space and distributed in time; it allows distributed sharing, continuation passing, and structured naming. We discuss these properties and their implications, then give a series of examples. Linda presents novel implementation problems that we discuss in Part II. We are particularly concerned with implementation of the dynamic global name space that the generative communication model requires.
An Integrated Life-Cycle Model for Software Maintenance
Authors: Stephen S. Yau, Robin A. Nicholl, Jefrey J.-P. Tsai, Sying-Syang Liu
Venue: IEEE Transactions on Software Engineering (1988)

An integrated life-cycle model is presented for use in a software maintenance environment. The model represents information about the development and maintenance of software systems, emphasizing relationships between different phases of the software life cycle. It provides the basis for automated tools to assist maintenance personnel in making changes to existing software systems. The model is independent of particular specification, design, and programming languages because it represents only certain 'basic' semantic properties of software systems: control flow, data flow, and data structure. The software development processes by which one phase of the software life cycle is derived from another are represented by graph rewriting rules, which indicate how various components of a software system have been implemented. This approach permits analysis of the basic properties of a software system throughout the software life cycle. Examples are given to illustrate the integrated software life-cycle model during evolution.
Iteration Properties of Multivalued Switching Functions
Authors: C HHHHHHHHHHHH Reischer, D A Simovici
Venue: IEEE Transactions on Computers (1986)

The purpose of this correspondence is to survey the literature concerning the iterative properties of multivalued switching functions. These properties are important for the synthesis of switching circuits by cascades of simpler elements. Our presentation evolves around the graphs of transformations of finite sets. We discuss such topics as limitations of the computational capabilities of cascades, the existence of roots of given functions with respect to iteration powers, etc.
Outline of a knowledge base model for an intelligent information retrieval system
Authors: M. F. Bruandet
Venue: Proceedings of the 10th annual international ACM SIGIR conference on Research and development in information retrieval (1987)

We attempt in this paper to outline a method for the automatic construction of a knowledge base. We propose some methods and a domain knowledge model. A new idea is to conceive a system that is able to each phase of its construction to acquire domain knowledge from all new information that it is building, in particular the indexing terms; the last section is an attempt in this sense.
A Distributed Drafting Algorithm for Load Balancing
Authors: Lionel M. Ni, Chong-Wei Xu, Thomas B. Gendreau
Venue: IEEE Transactions on Software Engineering (1985)

It is desirable for the load in a distributed system to be balanced evenly. A dynamic process migration protocol is needed in order to achieve load balancing in a user transparent manner. A distributed algorthim for load balancing which is network topology independent is proposed in this paper. Different network topologies and low-level communications protocols affect the choice of only some system design parameters. The "drafting" algorithm attempts to compromise two contradictory goals: maximize the processor utilization and minimize the communication overhead. The main objective of this paper is to describe the dynamic process migration protocol based on the proposed drafting algorithm. A sample distributed system is used to further illustrate the drafting algorithm and to show how to define system design parameters. The system performance is measured by simulation experiments based on the sample system.
Socrates: a system to extract rules and knowledge from existing databases
Authors: F. M. Ferrara
Venue: Issue 104 (April 1988) (1988)

As a reference for both academic and industrial researchers, this new series reports the latest contributions of engineering, applied physics, and computer science to robotics. Each volume will focus one key topic in robotics research. The initial volume fully explores the applications of algorithm design and computational geometry to automatic planning and control functions.
Software safety: why, what, and how
Authors: Nancy G. Leveson
Venue: ACM Computing Surveys (CSUR) (1986)

Software safety issues become important when computers are used to control real-time, safety-critical processes. This survey attempts to explain why there is a problem, what the problem is, and what is known about how to solve it. Since this is a relatively new software research area, emphasis is placed on delineating the outstanding issues and research topics.
A rule-based object/task modelling approach
Authors: Qiming Chen
Venue: ACM SIGMOD Record (1986)

A rule-based object/task modelling approach is proposed which is characterized by specifying object behaviors and domain rules in terms of object-oriented logic programming, and specifying tasks and meta-rules in terms of network-oriented formalism. In addition the concepts of associations, virtual objects, multiple level integrity control and net expressions are introduced. The object-oriented logic programming system is extended for supporting the semantic modelling, and an explicit control knowledge representation mechanism is developed. This approach may be viewed as a step to the integration of object-oriented programming, logic programming, semantic modelling and event modelling, and to the combination of forward chaining and backward chaining techniques. Therefore, it can provide complementary benefits in deductive query support, integrity control, explicit control knowledge representation and intelligent user interface, and enhance the flexibility and extendibility of knowledge based systems to accommodate applications in multiple domains, towards a generalized, rule-based management of data, action and operational schemes. This approach is being designed and partially implemented on top of System C [Chen 85b] on a VAX computer.
Performability Analysis: Measures, an Algorithm, and a Case Study
Authors: R. M. Smith, Kishor S. Trivedi, A. V. Ramesh
Venue: IEEE Transactions on Computers (1988)

The behavior of the multiprocessor system is described as a continuous Markov chain, and a reward rate (performance measure) is associated with each state. The distribution of performability is evaluated for analytical models of a multiprocessor system using a polynomial-time algorithm that obtains the distribution of performability for repairable, as well as nonrepairable, systems with heterogeneous components with a substantial speedup over earlier work. Numerical results indicate that distributions of cumulative performance measures over finite intervals reveal behavior of multiprocessor systems not indicates by either steady-state or expected values alone.