ppxscal/embedding_network huggingface dataset:
The USC system factory project
Authors: W. Scacchi
Venue: ACM SIGSOFT Software Engineering Notes (1989)

Developing the next generation of large-scale software systems will change the patterns of work in system development organizations. We therefore expect the major systems engineering problems to be solved will require organizational solutions that accomodate advanced software development tools, flexible manufacturing techniques for system life cycle engineering, and knowledge-intensive strategies for managing large system development projects. Over the past seven years, we have created an experimental organizational environment for developing large software systems that allow us to encounter these problems, and find effective solutions or interventions. We call this organizational environment the System Factory. We have developed and evolved the System Factory through seven generations of graduate student staff, totaling more than 500 in number. In this report, we describe what the System Factory is, the problems we have investigated, the results and example products of this research, potential future applications of the System Factory approach, and finally our experiences in transferring this technology.
Compile-Time Program Restructuring in Multiprogrammed Virtual Memory Systems
Authors: S. J. Hartley
Venue: IEEE Transactions on Software Engineering (1988)

An evaluation is made of a way to reduce the cost of program restructuring by having a compiler determine the program's packing in virtual address space from an analysis of its source code. Two features of this method are the duplication of code modules in virtual address space and the inline substitution of the code for a called procedure. This compile-time restructuring algorithm is evaluated using the instruction-only address traces from a collection of programs. In a simulation of a virtual memory system using disks as secondary storage devices, the method is not successful, since it leads to a higher optimum space-time execution cost than that of the unrestructured program. The algorithm did reduce program space-time execution cost for some arbitrarily chosen memory allocations smaller than the optimum. This could be useful in a multiuser, multiprogrammed environment.
Shape From Texture: Integrating Texture-Element Extraction and Surface Estimation
Authors: D. Blostein, N. Ahuja
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1989)

A method is presented for identifying texture elements while simultaneously recovering the orientation of textured surfaces. A multiscale region detector, based on measurements in a Del /sup 2/G (Laplacian-of-Gaussian) scale space, is used to construct a set of candidate texture elements. True elements are selected from the set of candidate elements by finding the planar surface that best predicts the observed areas of the latter. Results are shown for a variety of natural textures, including waves, flowers, rocks, clouds, and dirt clods.
Machine Vision Algorithms for Automated Inspection Thin-Film Disk Heads
Authors: Jorge L. C. Sanz, Dragutin Petkovic
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1988)

Machine vision algorithms and a supporting architecture that were integrated in a fully automated prototype system for disk head inspection are presented. Some specific methods are elaborated on, including the computation of the Hough transform and multicode masks in pipeline architectures, object segmentation in textured backgrounds, and matching of extracted defects with inspection specifications. Extensive experimental results are given.
Optimization of an automated manufacturing system simulation model using simulated annealing
Authors: E. M. Manz, J. Haddock, J. Mittenthal
Venue: Proceedings of the 21st conference on Winter simulation (1989)

The purpose of this study is to investigate the feasibility of using a simulated annealing algorithm in conjunction with a simulation model to find the optimal parameter levels at which to operate the system being simulated. In particular, we discuss an effort to use simulated annealing to find a combination of input parameter values for an automated manufacturing system which optimizes a nonconvex, nonconcave objective function of the input parameters.This paper contains a brief description of an automated manufacturing system used to assemble three products. The problem objective is to maximize profit as a function of the levels of three parameters - batch size of arriving products, distribution of products in the batches, and machine output buffer size. Simulated annealing is then used to search for the optimal combination of input parameter levels. By experimenting with the simulated annealing parameters, the algorithm parameters are chosen such that the annealing program will consistently find the global optimum after evaluating approximately 36% of the input variable combinations.
IMCL language and its implementation on the personal computer
Authors: P. Kokol, B. Vucelic, M. Mernik, I. Rozman, V. Zumer
Venue: ACM SIGSMALL/PC Notes (1988)

The use of traditional industrial controllers has been a common practice for successfully controlling processes in industrial plants for a long time. However, these old-fashioned controllers (Figure 1) are unfortunately inflexible and much too slow and unreliable for critical applications, and not "user friendly." Still worse, programming them is tedious, lengthy and difficult. LSI and VLSI technology with their 16- and 32-bit processors has permitted a new approach to the design and use of industrial controllers (Figure 2). The shift from MAD (Manually Aided Design) to CAD has been the most important result of this shift to date. But finally, newly emerging concepts of parallel computing, applicative languages and non-yon Neumann architecture have awakened our hopes of employing the computer to liberate the human (Figure 3).
On recognisable properties of associative algebras
Authors: Tatiana Gateva-Ivanova, Victor Latyshev
Venue: Journal of Symbolic Computation (1988)

The paper considers computer algebra in a non-commutative setting. So far, suchinvestigations have been centred on the use of algorithms for equality and of universal properties of algebras. Here, the foundation of all computations is the presentation of the algebra under investigation by a finite number of generators subject to a finite number of defining relations, which satisfy the additional property of forming a Grobner (or standard) basis. Such algebras are called s.f.p.-for standard finite presentation. It is shown that various algebraic properties, such as being finite-dimensional, nilpotent, nil, algebraic are algorithmically recognisable. When the defining relations are words in the generators, this is also shown to be the case, for the properties of being semi-simple, prime, semi-prime, etc.
A trade-off between information and communication in broadcast protocols
Authors: Baruch Awerbuch, Oded Goldreich, Ronen Vainish, David Peleg
Venue: Journal of the ACM (JACM) (1990)

This paper concerns the message complexity of broadcast in arbitrary point-to-point communication networks. Broadcast is a task initiated by a single processor that wishes to convey a message to all processors in the network. The widely accepted model of communication networks, in which each processor initially knows the identity of its neighbors but does not know the entire network topology, is assumed. Although it seems obvious that the number of messages required for broadcast in this model equals the number of links, no proof of this basic fact has been given before. It is shown that the message complexity of broadcast depends on the exact complexity measure. If messages of unbounded length are counted at unit cost, then broadcast requires &THgr;(&uharl;V&uharr;) messages, where V is the set of processors in the network. It is proved that, if one counts messages of bounded length, then broadcast requires &THgr;(&uharl;E&uharr;) messages, where E is the set of edges in the network. Assuming an intermediate model in which each vertex knows the topology of the network in radius &rgr; &ge; 1 from itself, matching upper and lower bounds of &THgr;(min{&uharl;E&uharr;, &uharl;V&uharr;1+&THgr;(l)/&rgr;}) is proved on the number of messages of bounded length required for broadcast. Both the upper and lower bounds hold for both synchronous and asynchronous network models. The same results hold for the construction of spanning trees, and various other global tasks.
The Nonuniform Distribution of Instruction-Level and Machine Parallelism and its Effect on Performance
Authors: N. P. Jouppi
Venue: IEEE Transactions on Computers (1989)

A methodology for quickly estimating machine performance is developed. A first-order estimate is based on the average degree of machine parallelism. A second-order model corrects for the effects of nonuniformities in instruction-level and machine parallelism and is shown to be accurate to within 15% for three widely different machine pipelines: the CRAY-1, the MultiTitan, and a dual-issue superscalar machine.
FACET: a CAE system for RF analogue simulation including layout
Authors: R. F. Milsom, K. J. Scott, S. G. Clark, J. C. McEntegart, S. Ahmed, F. N. Soper
Venue: Proceedings of the 26th ACM/IEEE Design Automation Conference (1989)

FACET, a CAE system for RF analogue simulation is described. Layout-dependent effects such as parasitic electromagnetic coupling are included. The method of analysis provides accurate electrical modelling of multilayer PCB structures with a large number of arbitrarily-oriented tracks and printed components, without excessive demands on CPU and memory. This is achieved by building in knowledge of the frequencies of interest and the expected charge and current distributions. FACET is linked automatically to a layout CAD system and a circuit analysis package.
Experience with Multiple Processor Versions of Concurrent C
Authors: Robert F. Cmelik, Narain H. Gehani, William D. Roome
Venue: IEEE Transactions on Software Engineering (1989)

Concurrent C, a superset of C providing parallel programming facilities, is considered. A uniprocessor version of Concurrent C was first implemented. After experience with this version, the Concurrent C implementation was extended to run on two types of multiple processor systems: a set of computers connected by a local area network (the distributed version) and a shared-memory multiprocessor (the multiprocessor version). Experience with implementing and using these versions of Concurrent C is described. Specifically, the language changes triggered by the multiple processor implementations, some sample programs, a comparison of the execution times on various systems, and the suitability of these multiple processor architectures are discussed.
The SEI education program: the challenge of teaching future software engineers
Authors: N. E. Gibbs
Venue: Communications of the ACM (1989)

As the technical foundations of software production emerge, software engineers run the risk of obsolescence&mdash;now.
A massively parallel algorithm for fault simulation on the connection machine
Authors: V. Narayanan, V. Pitchumani
Venue: Proceedings of the 26th ACM/IEEE Design Automation Conference (1989)

A massively parallel algorithm for fault simulation on the Connection Machine is presented. This algorithm achieves two to three orders of magnitude speedup over the one presented in [1]. The fault simulation methodology used here is combination of parallel fault simulation [2] and PPSFP [3]. Simulation rates of over 2.7 billion gate evaluations per second have been achieved.
Computing primitive elements of extension fields
Authors: Kazuhiro Yokoyama, Masayuki Noro, Taku Takeshima
Venue: Journal of Symbolic Computation (1989)

Several mathematical results and new computational methods are presented for primitive elements and their minimal polynomials of algebraic extension fields. For a field Q(@a"1,...,@a"t) obtained by adjoining algebraic numbers @a"1,...@a"t to the rational number field Q, it is shown that there exists at least one vector =(s"1,...,s"t) of integers in a specially selected set of (-1)N vectors such that s"1@a"1+s"2@a"2+...+s"t@a"t is a primitive element, where N is the degree of Q(@a"1,...,@a"t) over Q. Furthermore, a method is presented for directly calculating such a vector, that gives a primitive element. Finally, for a given polynomial f over Q, a new method is presented for computing a primitive element of the splitting field of f and its minimal polynomial over Q.
Life before the chips: simulating digital video interactive technology
Authors: Douglas Dixon
Venue: Communications of the ACM (1989)

Advances in computers, such as DVI technology, are driven by new hardware functionality&mdash;more magic in the silicon. But before the chips came the ideas, and years of visual and interactive technical simulations to evaluate product designs and build the support necessary to develop them.
The Accuracy of the Clock Synchronization Achieved by TEMPO in Berkeley UNIX 4.3BSD
Authors: R. Gusella, S. Zatti
Venue: IEEE Transactions on Software Engineering (1989)

The authors discuss the upper and lower bounds on the accuracy of the time synchronization achieved by the algorithm implemented in TEMPO, the distributed service that synchronizes the clocks of the University of California, Berkeley, UNIX 4.3BSD systems. The accuracy is shown to be a function of the network transmission latency; it depends linearly upon the drift rate of the clocks and the interval between synchronizations. TEMPO keeps the clocks of the VAX computers in a local area network synchronized with an accuracy comparable to the resolution of single-machine clocks. Comparison with other clock synchronization algorithms shows that TEMPO, in an environment with no Byzantine faults, can achieve better synchronization at a lower cost.
Message routing schemes in a hypercube machine
Authors: D. Raghupathy, M. R. Leuze, S. R. Schach
Venue: Proceedings of the third conference on Hypercube concurrent computers and applications: Architecture, software, computer systems, and general issues - Volume 1 (1988)

The aim of this study is to determine efficient routing schemes for message passing in a hypercube machine. Two different algorithms are considered, namely static routing in which the path of a message is predetermined by the addresses of the source and destination nodes, and dynamic routing where the decision as to the next node in the path is made by the current node on the basis of local information regarding queue lengths. In addition, various different prioritization schemes are compared for both static and dynamic routing. The results show that dynamic routing can be up to twice as efficient as static routing, provided priority is given to messages which have only a few hops to traverse or were transmitted early in the computation sequence.
Debugging parallel programs in parallel
Authors: Robert Rubin, Larry Rudolph, Dror Zernik
Venue: Proceedings of the 1988 ACM SIGPLAN and SIGOPS workshop on Parallel and distributed debugging (1988)

There often exists a large gap between the user's conceptual picture of a parallel machine and the real machine, and between the user's expectations for program execution and the real process of execution. A monitoring and debugging machine can be used to bridge this gap. The Makbilan machine described here creates and maintains in real time a picture of the system that displays different layers of the machine. It can display hardware performance (such as bus accesses, memory references), operating-system abstractions (such as dynamic process tree or resource allocation), and special-purpose animations of the program (designed by the programmer in a constraint-based graphical environment). This paper introduces the design of a non-intrusive monitor with a constraint-based graphic display machine, and is event-driven. The Makbilan machine on which the parallel programs run is under construction, and the monitor is thus designed and simulated in concordance with hardware specifications. The contributions of this paper are: The use of interesting events to integrate a monitor, a debugger and an animation tool for parallel algorithms. A non-intrusive architecture for monitoring executing programs. A flexible animation tool and a set of animations that can be used to understand the parallel structures of parallel algorithms and their execution on a parallel machine.
Function Points in the Estimation and Evaluation of the Software Process
Authors: Graham C. Low, D. R. Jeffery
Venue: IEEE Transactions on Software Engineering (1990)

The authors report the results of an empirical research project on the consistency and limitations of the number of function points as an a priori measure of system size rather than the traditional lines-of-code measure. They conclude that function points are a more consistent a priori measure of system size. The results also indicate that the function-point estimate of size is lower for analysts experienced both in software development and in function-point estimation.
An Object Model for Image Recognition
Authors: H. V. Jagadish, L. O'Gorman
Venue: Computer (1989)

The use of object-oriented database principles to help model an image for computer vision, specifically, for line-image analysis, is described. The resulting representation, called thin line code (TLC), is general across known applications and extensible to new applications. TLC's advantages, and also some difficulties it has in strictly adhering to traditional notions of object orientation, are addressed. A review of relevant aspects of object modeling is included.
Rendering and animation of gaseous phenomena by combining fast volume and scanline A-buffer techniques
Authors: D. S. Ebert, Richard E. Parent
Venue: Proceedings of the 17th annual conference on Computer graphics and interactive techniques (1990)

This paper describes a new technique that efficiently combines volume rendering and scanline a-buffer techniques. This technique is useful for combining all types of volume-rendered objects with scanline rendered objects and is especially useful for rendering scenes containing gaseous phenomena such as clouds, fog, and smoke. The rendering and animation of these phenomena has been a difficult problem in computer graphics.A new algorithm for realistically modeling and animating gaseous phenomena is presented, providing true three-dimensional volumes of gas. The gases are modeled using turbulent flow based solid texturing to define their geometry and are animated based on turbulent flow simulations. A low albedo illumination model is used that takes into consideration self-shadowing of the volumes.
IBM system/370 channel programming using APL
Authors: Thomas J. Pritchard
Venue: ACM SIGAPL APL Quote Quad (1990)

This paper describes how disk, tape and other devices attached to an IBM System/370 class machine running the VM operating system can be programmed directly from APL. The techniques rely on a few surprisingly simple APL functions and a simple auxiliary processor.
Replacing version-control with job-control
Authors: G. M. Clemm
Venue: ACM SIGSOFT Software Engineering Notes (1989)

Version-control is a mechanism for managing the multiple versions of the software objects that are created during the software development process. Traditionally, version-control consists of providing tools for generating a branching tree of versions, with facilities for reserving a given version for modification. In the Workshop System the focus of version-control is shifted from the objects produced during the software process to the software process itself. Objects called jobs are created in a project database to explicitly instantiate the process information. The Workshop System then provides operations for manipulating jobs, with these manipulations providing the functionality normally associated with version-control.
Specifying composite illustrations with communicative goals
Authors: D. D. Seligmann, S. Feiner
Venue: Proceedings of the 2nd annual ACM SIGGRAPH symposium on User interface software and technology (1989)

IBIS (Intent-Based Illustration System) generates illustrations automatically, guided by communicative goals. Communicative goals specify that particular properties of objects, such as their color, size, or location are to be conveyed in the illustration. IBIS is intended to be part of an interactive multimedia explanation generation system. It has access to a knowledge base that contains a collection of objects, including information about their geometric properties, material, and location. As the goals are interpreted by a rule-based control component, the system generates a precise definition of the final illustration. If IBIS determines that a set of goals cannot be satisfied in a single picture, then it attempts to create a composite illustration that has multiple viewports. For example, a composite illustration may contain a nested inset illustration showing an object in greater detail than is possible in the parent picture. Each component illustration is defined by its placement, size, viewing specification, lighting specification, and list of objects to be displayed and their graphical style.
Composite objects revisited
Authors: Won Kim, Elisa Bertino, Jorge F. Garza
Venue: ACM SIGMOD Record (1989)

In object-oriented systems, an object may recursively reference any number of other objects. The references, however, do not capture any special relationships between objects. An important semantic relationship which may be superimposed on a reference is the IS-PART-OF relationship between a pair of objects. A set of objects related by the IS-PART-OF relationship is collectively called a composite object. An earlier paper [KIM87b] presented a model of composite objects which has been implemented in the ORION object-oriented database system at MCC. Although the composite-object feature has been found quite useful, the model suffers from a number of serious shortcomings, primarily because it overloads a number of orthogonal semantics on the references. In this paper, first we present a more general model of composite objects which does not suffer from these shortcomings. Further, [KIM87b] made an important contribution by exploring the use of composite objects as a unit for versions, physical clustering, and concurrency control. The extended model of composite objects necessitates non-trivial changes to the results of [KIM87b]. This paper describes the new results on the use of composite objects as a unit of not only versions, physical clustering and concurrency control, but also authorization.
Vector and parallel processing of the nuclear reactor transient analysis code RELAPS
Authors: M. Ishiguro, M. Makino, N. Shinozawa
Venue: Proceedings of the 1988 ACM/IEEE conference on Supercomputing (1988)

An experiment of vector processing and multi-tasking of nuclear reactor transient analysis code RELAP5 has been made at Japan Atomic Energy Research Institute. Vector processing and multi-tasking of the RELAP5 were achieved by using the independency of the spatial meshes. The vectorization ratio is 83% The performance ratio in the vector mode to that in the scalar mode is about 3 on the FACOM VP-100. For multi-tasking, the spatial meshes are halfed and each group of meshes is processed on different processor. The effect of multi-tasking was estimated from the CPU time on the FACOM VP-100, which is single processor system. The improvement of wall clock time will be about 1.6 for parallelized subroutines. The total improvement of wall clock time will be about 1.2 because of parallelization ratio 45%.