ppxscal/embedding_network huggingface dataset:
Hypermedia, help and how-to
Authors: Rick Ells
Venue: Proceedings of the 16th annual ACM SIGUCCS Conference on User Services (1988)

Hypermedia will soon become a basic tool for providing information support for all sizes of computing systems. Documentation professionals will need to make an efficient transition to this new method of presenting information. Structural aspects of existing hardcopy documents and on-line help can serve as a guide, but some rethinking of how information is presented will be needed to take full advantage of the potential of hypermedia.
Description and performance of a class of orthogonal multiprocessor networks
Authors: Isaac D. Scherson, Peter F. Corbett
Venue: ACM SIGARCH Computer Architecture News (1989)

We describe a construction technique for orthogonal multiprocessors, based on a definition of the inner product and the orthogonality of binary vectors. Orthogonal networks include spanning bus hypermeshes. A measure of communications overhead in parallel processing systems is defined as a function of algorithm and architecture. Its dependence on the topology of the interconnection network is illustrated by the computation of average distance in a spanning bus hypermesh. The binary hypercube is a simple example of this type of network. The communications overhead can be incorporated in an expression for the expected speedup of a parallel processing system.
Teaching programming: a new approach based on analysis skills
Authors: Terrence W. Pratt
Venue: ACM SIGCSE Bulletin (1988)

A new approach is described to the teaching of introductory computer programming and computer science (the CS1 course). The approach is based on a new view of what &ldquo;programming&rdquo; is fundamentally about. The central feature of the approach is the teaching of skills in program analysis along with the traditional emphasis on skills in program synthesis. The approach was class tested in an earlier version in 1986, and the difficulties encountered in the class test led to two supporting changes in the course content: (1) data structures are introduced at the beginning of the course, and (2) the concept of program state is introduced as a key element in understanding programs.
Addressing, Routing, and Broadcasting in Hexagonal Mesh Multiprocessors
Authors: Ming-Syan Chen, Kang G. Shin
Venue: IEEE Transactions on Computers (1990)

A family of six-regular graphs, called hexagonal meshes or H-meshes, is considered as a multiprocessor interconnection network. Processing nodes on the periphery of an H-mesh are first wrapped around to achieve regularity and homogeneity. The diameter of a wrapped H-mesh is shown to be of O(p/sup 1/2/), where p is the number of nodes in the H-mesh. An elegant, distributed routing scheme is developed for wrapped H-meshes so that each node in an H-mesh can compute shortest paths from itself to any other node with a straightforward algorithm of O(1) using the addresses of the source-destination pair only, i.e. independent of the network's size. This is in sharp contrast with those previously known algorithms that rely on using routing tables. Furthermore, the authors also develop an efficient point-to-point broadcasting algorithm for the H-meshes which is proved to be optimal in the number of required communication steps. The wrapped H-meshes are compared against some other existing multiprocessor interconnection networks, such as hypercubes, trees, and square meshes. The comparison reinforces the attractiveness of the H-mesh architecture.
Syntactic graphs: a representation for the union of all ambiguous parse trees
Authors: Jungyun Seo, Robert F. Simmons
Venue: Computational Linguistics (1989)

In this paper, we present a new method of representing the surface syntactic structure of a sentence. Trees have usually been used in linguistics and natural language processing to represent syntactic structures of a sentence. A tree structure shows only one possible syntactic parse of a sentence, but in order to choose a correct parse, we need to examine all possible tree structures one by one. Syntactic graph representation makes it possible to represent all possible surface syntactic relations in one directed graph (DG). Since a syntactic graph is expressed in terms of a set of triples, higher level semantic processes can access any part of the graph directly without navigating the whole structure. Furthermore, since a syntactic graph represents the union of all possible syntactic readings of a sentence, it is fairly easy to focus on the syntactically ambiguous points. In this paper, we introduce the basic idea of syntactic graph representation and discuss its various properties. We claim that a syntactic graph carries complete syntactic information provided by a parse forest---the set of all possible parse trees.
Experience with ADAM synthesis system
Authors: Rajiv Jain, K. Kücükcakar, M. J. Mlinar, A. C. Parker
Venue: Proceedings of the 26th ACM/IEEE Design Automation Conference (1989)

The ADAM synthesis system consists of two major subsystems: the program tools which synthesize RTL designs from behavioral descriptions and the prediction tools which guide the designer in exploring the design space for a good design. In this paper, we demonstrate the necessity for predictions in narrowing the search space. With the aid of an example, we describe the interaction of a designer with the two subsystems in designing an RTL implementation which maximizes performance while meeting a given area constraint.
The benefits and advantages of APL
Authors: D. Julio, J. Mosland
Venue: Conference proceedings on APL as a tool of thought (1989)

Dominique Julio and Jo euml;l Mosland have been working for the last ten years in the research department of the Personnel Management of UAP (Union des Assurances de Paris). They use APL for several applications: prototyping, definition and testing of simulation models.This article defines an application whose major characteristic is the interfacing of several computer systems. These systems existed before in UAP and had to be rapidly interconnected, with limited human and financial resources. The choice fell very rapidly on APL, given its ease of development and maintenance.
Hypertexture
Authors: K. Perlin, E. M. Hoffert
Venue: ACM SIGGRAPH Computer Graphics (1989)

We model phenomena intermediate between shape and texture by using space-filling applicative functions to modulate density. The model is essentially an extension of procedural solid texture synthesis, but evaluated throughout a volumetric region instead of only at surfaces.We have been able to obtain visually realistic representations of such shape+texture (hypertexture) phenomena as hair, fur, fire, glass, fluid flow and erosion effects. We show how this is done, first by describing a set of base level functions to provide basic texture and control capability, then by combining these to synthesize various phenomena.Hypertexture exists within an intermediate region between object and not-object. We introduce a notion of generalized boolean shape operators to combine shapes having such a region.Rendering is accomplished by ray marching from the eye point through the volume to accumulate opacity along each ray. We have implemented our hypertexture rendering algorithms on a traditional serial computer, a distributed network of computers and a coarse-grain MIMD computer. Extensions to the rendering technique incorporating refraction and reflection effects are discussed.
An alternative to regular lecture classes: a theory seminar in computer algorithms
Authors: Michael Bozonie
Venue: ACM SIGCSE Bulletin (1989)

Not every student has the same experience base. Putting all students into the same class setting without regard to experiences can be catastrophic for experienced students, inexperienced students and instructors. A course approach, called a theory seminar, combines the strengths of regular classes, independent studies, and evaluations of prior experiences. A theory seminar has been developed for a computer algorithms course.
A test for &lambda;-confluence for certain prefix rewriting systems with applications to the generalized word problem
Authors: N. Kuhn, K. Madlener, F. Otto
Venue: Proceedings of the international symposium on Symbolic and algebraic computation (1990)

We apply rewriting techniques to the generalized word problem for groups. Let R be a finite string-rewriting system on an alphabet &Sgr; such that the monoid MR presented by (&Sgr;:R) is a group, and let U &sube; &Sgr;&rarr; be a finite set. The generalized word problem GWP is defined by GWP(w.U) if w &isin; <U>, where <U> is the subgroup of MR generated by U. With U we associate a prefix rewriting relation &rArr;P on &Sgr;* such that w &if;P &lgr; if GWP(w.U) holds. If &rArr;P is &lgr;-confluent then w &rArr; P &lgr; if w &isin; <U>. Then &rArr;P yields a decision procedure for GWP. For groups given through confluent string-rewriting systems R, we develop a necessary and sufficient condition for &rArr;P being &lgr;-confluent and show that this condition becomes decidable in case of R being length-reducing, in addition.
Test pattern generation for sequential MOS circuits by symbolic fault simulation
Authors: K. Cho, R. E. Bryant
Venue: Proceedings of the 26th ACM/IEEE Design Automation Conference (1989)

The COSMOS symbolic fault simulator generates test sets for combinational and sequential MOS circuits represented at the switch level. All aspects of switch-level networks including bidirectional transistors, stored charge, different signal strengths, and indeterminate (X) logic values are captured. To generate tests for a circuit, the program derives Boolean functions representing the behavior of the good and faulty circuits over a sequence of symbolic input patterns. It then determines a set of assignments to the input variables that will detect all faults. Symbolic simulation provides a natural framework for the user to supply an overall test strategy, letting the program determine the detailed conditions to detect a set of faults. Symbolic preprocessing of switch-level networks, combined with efficient Boolean manipulation makes this approach feasible.
An expert system for maintenance of riveting machines, vol. 1.
Authors: Patrick W. Daley, Osama K. Eyada
Venue: Proceedings of the 2nd international conference on Industrial and engineering applications of artificial intelligence and expert systems - Volume 1 (1989)

Rapid diagnosis and repair of riveting machine malfunctions are essential to meet critical production schedules at Boeing Military Airplanes. Repairs are often delayed because the maintenance technician assigned may lack the knowledge and experience required to quickly isolate and correct the problem. This paper presents an Expert Maintenance System for Riveters (EMSR) developed to assist inexperienced technicians with the diagnosis and repair of nine Boeing modified Gemcor 400/200A CNC riveters. EMSR has captured the expertise of Boeing's most skilled riveter maintenance technicians in an expert system created using Texas Instrument's Personal Consultant&trade; Plus development tool.
Volume rendering
Authors: Karen A. Frenkel
Venue: Communications of the ACM (1989)

Volumetric rendering speaks volumes for data 20 orders of magnitude apart&mdash;from human anatomy to neuroanatomy, and from electrostatic charges of macromolecules to failure analysis of manufactured parts.
Improving radiosity solutions through the use of analytically determined form-factors
Authors: D. R. Baum, H. E. Rushmeier, J. M. Winget
Venue: Proceedings of the 16th annual conference on Computer graphics and interactive techniques (1989)

Current radiosity methods rely on the calculation of geometric factors, known as form-factors, which describe energy exchange between pairs of surfaces in the environment. The most computationally efficient method for form-factor generation is a numerical technique known as the hemi-cube algorithm. Use of the hemi-cube is based on assumptions about the geometry of the surfaces involved. First, this paper examines the types of errors and visual artifacts that result when these assumptions are violated. Second, the paper shows that these errors occur more frequently in progressive refinement radiosity than in the originally proposed full matrix radiosity solution. Next, a new analytical technique for determining form-factors that is immune to the errors of the hemi-cube algorithm is introduced. Finally, a hybrid progressive refinement method that invokes the new technique to correctly compute form-factors when hemi-cube assumptions are violated is presented.
Optimal matrix algorithms on homogeneous hypercubes
Authors: G. C. Fox, W. Furmanski, D. W. Walker
Venue: Proceedings of the third conference on Hypercube concurrent computers and applications - Volume 2 (1989)

This paper describes a set of concurrent algorithms for matrix algebra, based on a library of collective communication routines for the hypercube. We show how a systematic application of scattering reduces load imbalance. A number of examples are considered (Gaussian elimination, Gauss-Jordan matrix inversion, the power method for eigenvectors, and tridiagonalisation by Householder's method), and the concurrent efficiencies are discussed.
Programming languages for distributed computing systems
Authors: Henri E. Bal, Jennifer G. Steiner, Andrew S. Tanenbaum
Venue: ACM Computing Surveys (CSUR) (1989)

When distributed systems first appeared, they were programmed in traditional sequential languages, usually with the addition of a few library procedures for sending and receiving messages. As distributed applications became more commonplace and more sophisticated, this ad hoc approach became less satisfactory. Researchers all over the world began designing new programming languages specifically for implementing distributed applications. These languages and their history, their underlying principles, their design, and their use are the subject of this paper. We begin by giving our view of what a distributed system is, illustrating with examples to avoid confusion on this important and controversial point. We then describe the three main characteristics that distinguish distributed programming languages from traditional sequential languages, namely, how they deal with parallelism, communication, and partial failures. Finally, we discuss 15 representative distributed languages to give the flavor of each. These examples include languages based on message passing, rendezvous, remote procedure call, objects, and atomic transactions, as well as functional languages, logic languages, and distributed data structure languages. The paper concludes with a comprehensive bibliography listing over 200 papers on nearly 100 distributed programming languages.
An Ontological Model of an Information System
Authors: Yair Wand, Ron Weber
Venue: IEEE Transactions on Software Engineering (1990)

An ontological model of an information system that provides precise definitions of fundamental concepts like system, subsystem, and coupling is proposed. This model is used to analyze some static and dynamic properties of an information system and to examine the question of what constitutes a good decomposition of an information system. Some of the major types of information system formalisms that bear on the authors' goals and their respective strengths and weaknesses relative to the model are briefly reviewed. Also articulated are some of the fundamental notions that underlie the model. Those basic notions are then used to examine the nature and some dynamics of system decomposition. The model's predictive power is discussed.
Some limitations of adjacency matrices in computer network analysis
Authors: E. L/ Witzke, S. D. Frese
Venue: ACM SIGCOMM Computer Communication Review (1988)

Adjacency matrices have been used to analyze problems with communications in organizations. Although this same approach can be applied to computer communication networks to determine their connectivity, it does have its limitations. This analysis method and its limitations will be discussed in this paper.
HyperIntelligence: the next frontier
Authors: Sudha Ram, David A. Carlson
Venue: Communications of the ACM (1990)

The authors discuss how mental models may be used to organize an individual's thoughts while forming a plan. A hypermedia system, SPRINT, is described which supports an explicit representation of a mental model as a network of associations among the elements of a strategic plan.
Some Consideration on Real-Time Behavior of Concurrent Programs
Authors: Alfonso Fuggetta, Carlo Ghezzi, Dino Mandrioli
Venue: IEEE Transactions on Software Engineering (1989)

Some basic semantic issues of a language for a reliable and provably correct real-time programs are discussed. The language is based on E.W. Dijkstra's guarded commands and on a proposal by V.H. Haase (1981). Haase's proposal is assessed, its semantic consistencies are shown, and corrections are proposed that give a sound basis for a real-time language based on guarded commands.
A model for electronic documents
Authors: Richard Koo
Venue: ACM SIGOIS Bulletin (1989)

A model for electronic documents is proposed. This model has two components: a directed acyclic graph structure and a set of constraints. These two components are used to describe the relationships among the data of documents. This model is more general than models previously proposed.
Differential equations of some orthogonal families in REDUCE
Authors: A. Ronveaux, G. Thiry
Venue: Journal of Symbolic Computation (1989)

We propose a REDUCE package giving the second-order differential equation satisfied by the family of polynomials @?p"n(x) orthogonal with respect to a weight which is a classical weight (Jacobi, Laguerre, Hermite) times an arbitrary polynomial.
Design issues and team support: experiences of an Ada tool vendor
Authors: B. Crawford, D. Baker
Venue: Proceedings of the conference on Tri-Ada '89: Ada technology in context: application, development, and deployment (1989)

Experiences, insights gained, and lessons learned in the course of developing two Ada-based graphic design support tools are summarized. The insights and lessons learned fall into two categories. The fist category involves support for various design methods and approaches, as well as the graphic notation used in providing that support. The second category involves other tool features that are required or desired by teams of software engineers designing mid-sized or large Ada systems.
On the Diagnosability of Multicomputer Systems with Homogeneous and Incomplete Tests
Authors: H. Krawczyk, W. E. Kozlowski
Venue: IEEE Transactions on Computers (1988)

A generalized PMC model, where only a subset of possible unit faults (the same for each unit) can be detected by unit tests, is considered. A category of visible faults is introduced and the necessary and sufficient condition for the new class of t/sub v/-diagnosable systems is determined. Moreover, an O( mod T mod ) diagnosis algorithm is presented.
Radical and conservative top-down development
Authors: G. Hill
Venue: ACM SIGSOFT Software Engineering Notes (1989)

This paper describes the conservative and radical approaches to top-down software development and makes a comparison of the two methods. This comparison discusses the advantages and disadvantages of each method and shows how they differ in affecting the development costs, efficiency, reliability, and maintainability of the resulting software. This paper also describes a hybrid approach to software development, which has successfully been used to obtain many of the benefits from both the conservative and radical methods of top-down software development.
Parallel polynomial computations by recursive processes
Authors: D. Bini, V. Pan
Venue: Proceedings of the international symposium on Symbolic and algebraic computation (1990)

Let lg stand for log2, lg(0)n = n, lg(h)n = lg lg(h-1)n, h = 1, &hellip;, lg*n, lg*n = min{h,lg(h)n &le; 1}. Given natural N, h, 1 &le; h &le; lg*N, and polynomial p(x), p(O) &ne; O, we compute r(x) = p(x)-1 mod xN for the cost OA(t, P), t = h lg N, P = (N/h)lg(h)N, under the PRAM arithmetic model, that is, we need O(t) steps and O(P) processors (with t and P as above), provided DFT(m) costs OA(lg m, m). For h = lg* N, the cost bounds turn into OA(lg N lg*N, N/lg*N). The results improve [G] and apply to various related computations [BP]. Basis observation. For i = 0, 1, &hellip;, vi(x) = r(x) mod xk2i, deg(vi(x)) &le; (i + 1)k2i - 2i+1 + 1 if vo(x) = r(x) mod xk; pi(x) p(x) mod xk2i, vi+1(x) = (2 - vi(x)pi(x))vi(x). Let 4 &le; &phgr; &le; n, lg(h)n, j = lg lg &phgr; be integers. Algorithm. Input: n, &phgr;, the coefficients of p(x) and r(x) mod xk, k = n/&phgr;. Output: r(x) mod x&ggr;, &ggr; = n/lg2&phgr;. 1. Set vo(x) = r(x) mod xk; compute vo(x), pi(x) = p(x) mod xk2i, i = 1,&hellip;, j - 1, j = lg &phgr; - 2lg lg &phgr;, at the &ggr;-th roots of 1 (k DFTs(&ggr;)). 2. Apply (1) pointwise, for i = 1, &hellip;, j - 1, to evaluate vj(x) at the &ggr;-th roots of 1. 3. Compute the coefficients of vj(x) (DFT(&ggr;)). Basis observation implies correctness of algorithm 1, whose cost is OA(logn,n). Apply the algorithm for &phgr; = lg(i), i = 0,1, &hellip; , J, J &le; 2h to compute the first &lceil;n/lg(h)n&rceil; coefficients of r(x). If lg(h)n < 1, apply steps 1-3 for j = lg(h+1)n, to compute r(x) mod xn for the additional cost OA(lg n,n(lgh+1)n)2) &le; OA(h lg n, n/h lg(h)n). Finally apply h steps of Sieveking-Kung's algorithm, starting with r(x) mod xn, and arrive at r(x) mod xN, for N = n2h. These steps cost OA(h lg N, N/h). Acknowledgement. NSF CCR-8805782. Reference [BP] Bini, D., and V. Pan, On polynomial and matrix computations, to appear. [G] Georgiev, R. E., Inversion of triangular Toeplitz matrices by using the fast Fourier transform, J. New Gener. Comput. Syst., vol. 2, 3, pp. 247-256, 1989.
An object-oriented requirements specifications method
Authors: S. C. Bailin
Venue: Communications of the ACM (1989)

Analyzing requirements for object-oriented software is examined in an alternative methodology from the more standard structured analysis approach. Through parallel processes of decomposing objects and allocating functions, the methodology is explained in detail.
Theoretical comparison of testing methods
Authors: R. Hamlet
Venue: ACM SIGSOFT Software Engineering Notes (1989)

Comparison of software testing methods is meaningful only if sound theory relates the properties compared to actual software quality. Existing comparisons typically use anecdotal foundations with no necessary relationship to quality, comparing methods on the basis of technical terms the methods themselves define. In the most seriously flawed work, one method whose efficacy is unknown is used as a standard for judging other methods! Random testing, as a method that can be related to quality (in both the conventional sense of statistical reliability, and the more stringent sense of software assurance), offers the opportunity for valid comparison.