ppxscal/embedding_network huggingface dataset:
On building software process models under the lamppost
Authors: W. Curtis, H. Krasner, V. Shen, N. Iscoe
Venue: Proceedings of the 9th international conference on Software Engineering (1987)

Most software process models are based on the management tracking and control of a project. The popular alternatives to these models such as rapid prototyping and program transformation are built around specific technologies, many of which are still in their adolescence. Neither of these approaches describe the actual processes that occur during the development of a software system. That is, these models focus on the series of artifacts that exist at the end of phases of the process, rather than on the actual processes that are conducted to create the artifacts. We conducted a field study of large system development projects to gather empirical information about the communication and technical decision-making processes that underlie the design of such systems. The findings of this study are reviewed for their implications on modeling the process of designing large software systems. The thesis of the paper is that while there are many foci for process models, the most valuable are those which capture the processes that control the most variance in software productivity and quality.
Coping with deeply nested control structures
Authors: G R Perkins, R W Norman, S Danicic
Venue: ACM SIGPLAN Notices (1987)

Over the past three or four years SIGPLAN Notices has published a number of papers on the problem of deeply nested IF-THEN-ELSE structures. We maintain that the current editorial ban on proposals for new control structures is correct, not only for reasons of space in SIGPLAN Notices, but on the grounds that programmers (like any other workers) should resist the temptation to blame their tools when they come up with poor products.Here, we briefly indicate a few techniques for dealing with deeply nested structures, and suggest that working programmers develop other such techniques and publish papers about them, rather than merely ask the language designers for yet more constructs.
Performance of a parallel algorithm for standard cell placement on the Intel hypercube
Authors: M. Jones, P. Banerjee
Venue: Proceedings of the 24th ACM/IEEE Design Automation Conference (1987)

In this paper, we present a parallel simulated annealing algorithm for standard cell placement that is targeted to run on the Intel Hypercube. We present a novel tree broadcasting strategy that is used extensively in our algorithm for updating cell locations in the parallel environment. Studies on the performance of our algorithm on example industrial circuits show that it is faster and gives better final placement results than the uniprocessor simulated annealing algorithms.
Practical in-place merging
Authors: B.-C. Huang, M. A. Langston
Venue: Proceedings of the 1987 Fall Joint Computer Conference on Exploring technology: today and tomorrow (1987)

We present a novel, yet straightforward linear-time algorithm for merging two sorted lists in a fixed amount of additional space. Constant of proportionality estimates and empirical testing reveal that this procedure is reasonably competitive with merge routines free to squander unbounded additional memory, making it particularly attractive whenever space is a critical resource.
An alternative approach to recursive fibonacci sequences
Authors: Michael Cox
Venue: ACM SIGCSE Bulletin (1987)

Generating a tera of a Fibonacci sequence is often discussed in introductory programming courses as an example where the recursive form has a very desirable simple beauty, but where the price of recursion is too high in terms of time and space. By generalizing to any Fibonacci sequence, another recursive formula can be used that saintains simple for a and understanding and yet is fast and requires reasonable resources.
Modeling the storage architectures of commercial database systems
Authors: D. S. Batory
Venue: ACM Transactions on Database Systems (TODS) (1985)

Modeling the storage structures of a DBMS is a prerequisite to understanding and optimizing database performance. Previously, such modeling was very difficult because the fundamental role of conceptual-to-internal mappings in DBMS implementations went unrecognized. In this paper we present a model of physical databases, called the transformation model, that makes conceptual-to-internal mappings explicit. By exposing such mappings, we show that it is possible to model the storage architectures (i.e., the storage structures and mappings) of many commercial DBMSs in a precise, systematic, and comprehendible way. Models of the INQUIRE, ADABAS, and SYSTEM 2000 storage architectures are presented as examples of the model's utility. We believe the transformation model helps bridge the gap between physical database theory and practice. It also reveals the possibility of a technology to automate the development of physical database software.
Geometrical compaction in one dimension for channel routing
Authors: J. Royle, M. Palczewski, H. VerHeyen, N. Naccache, J. Soukup
Venue: Proceedings of the 24th ACM/IEEE Design Automation Conference (1987)

A channel router which is to be effective for general-purpose automatic routing must be able to use different sets of routing criteria priorities, in a controllable manner. We present an approach to channel routing with compaction in which channel compaction is adaptable to several routing criteria priorities. We show how overall channel routing performance can be improved by taking advantage of this versatility in channel compaction. We indicate some routing capabilities which cannot be effectively achieved by simply post-processing the output of a traditional gridded channel router. Our solution to this problem is outlined and some results obtained from our router are compared with those of other published channel routers.
An Information-Based Model for Failure-Handling in Distributed Database Systems
Authors: F. Y. Chin, K. V. S. Ramarao
Venue: IEEE Transactions on Software Engineering (1987)

We consider the failure atomicity problem of distributed transactions in conjunction with the maximization of database availability. We propose a new information-based model for the distributed transaction-execution, which explicitly expresses the information at each stage during a protocol. In addition to rederiving certain existing results, we prove a fundamental relation among the site failures and the network partitioning. We propose a realistic model for site failures under which we show that the costs of commit and termination protocols can be greatly reduced. Finally, we explore the possible recovery strategies for a failed site and show how they are improved under our site failure model.
A Scheme to Enforce Data Dependence on Large Multiprocessor Systems
Authors: Chuan-Qi Zhu, Pen-Chung Yew
Venue: IEEE Transactions on Software Engineering (1987)

Enforcement of data dependence in parallel algorithms requires certain synchronization primitives. For simple data dependence, synchronization primitives like Full/Empty bit in HEP machine [5] can be very effective. However, if data dependence cannot be determined at compile time, or if very complicated, more efficient synchronization schemes and algorithms are needed.
Design implications of a task-driven approach to unstructured cognitive tasks in office work
Authors: Sidney E. Harris, Harvey J. Brightman
Venue: ACM Transactions on Information Systems (TOIS) (1985)

Previous research in modeling office activities has been primarily oriented toward office work that is structured and organized. In this paper we report on efforts to develop a new methodology for needs assessment evaluation. We use the Critical Task Method to identify the &ldquo;bottleneck cognitive tasks&rdquo; of principals with an unstructured work profile. Data were collected on the computer-support needs of faculty researchers, and the findings indicate that a &ldquo;knowledge-based&rdquo; design offers the most promise for delivering effective support. In addition, the systems design suggests the integration of text, data, voice, and images.
Toughness and Delaunay triangulations
Authors: M. Dillencourt
Venue: Proceedings of the third annual symposium on Computational geometry (1987)

We show that nondegenerate Delaunay triangulations satisfy a combinatorial property called 1-toughness. A graph with set of sites S is 1-tough if for any set P &sube; S, c(S - P) &le; |S|, where c(S - P) is the number of components of the subgraph induced by the complement of P and |P| is the number of sites in P. We also show that, under the same conditions, the number of interior components of S - P is at most |P| - 2. These appear to be the first nontrivial properties of a purely combinatorial nature to be established for Delaunay triangulations. We give examples to show that these bounds can be attained, and we state and prove several corollaries. In particular, we show that maximal planar graphs inscribable in a sphere are 1-tough.
A matrix-algebraic solution to two Km servers in a loop
Authors: Appie van de Liefvoort, Lester Lipsky
Venue: Journal of the ACM (JACM) (1986)

An explicit steady-state solution is given for any queuing loop made up of two general servers, whose distribution functions have rational Laplace transforms. The solution is in matrix geometric form over a vector space that is itself a direct or Kronecker product of the internal state spaces of the two servers. The algebraic properties of relevant entities in this space are given in an appendix. The closed-form solution yields simple recursive relations that in turn lead to an efficient algorithm for calculating various performance measures such as queue length and throughput. A computational-complexity analysis shows that the algorithm requires at least an order of magnitude less computational effort than any previously reported algorithm.
Some reflections on early history
Authors: J C R Licklider
Venue: Proceedings of the ACM Conference on The history of personal workstations (1986)

The ideas and developments reviewed briefly are mainly from six sources: (1) the M.I.T. Lincoln Laboratory during the middle and late 1950s, (2) Bolt Beranek and Newman in 1957-1962, (3) the ARPA program in 1962-1964, (4) IBM Research in 1964-1966, (5) Ivan Sutherland's lab at Harvard in 1967, and (6) Project MAC at M.I.T. in 1968-1972. For instance, there were (1) cloud filter stations with light guns and light pens, (2) a single 1024x1024 scope display time-shared four ways and a workstation for studying technical documents, (3) Rand tablets. Teagher tables, and Bernstein's horizontal text-editing display onto which both the human editor and the computer editor could write (and understand each other), (4) a computer system especially for computer-based education and a powerful vector graphics display system, (5) a PDP-1-based, single-user workstation with four display screens, a paper tape unit, a magnetic tape unit, a printer, and the beginnings of Sutherland's virtual space displays, and (6) graphics over the ARPANET and a multi-window workstation based on the Evans and Sutherland LDS-1. One of the key insights to be offered explains why workstations have vertical instead of horizontal (desk-like) display surfaces. Part of the plot is that, when, in the 50s or 60s, a cathode-ray tube was mounted face-up, some of the phosphor fell down onto the electron gun and caused a short circuit. Another part is that Fredkin and DEC simply got mixed up about which way the PDP-1 display ought to swivvel.
The Cubical Ring Connected Cycles: A Fault Tolerant Parallel Computation Network
Authors: Prithviraj Banerjee
Venue: IEEE Transactions on Computers (1988)

The cube-connected cycles network is suitable for realization in VLSI, since it satisfies the properties of degree boundedness of the nodes (=3), and regularity of layout. Another network called the cubical ring-connected cycles (CRCC) is proposed that has all the desirable features of the cube-connected cycle (CCC) and is single-cycle fault tolerant as well. The degree of each processor is less than or equal to four, the number of processors increases from 2/sup r+s/ to 2/sup r/(2/sup 2/+1), for integers r and s, and the number of links increases by a factor of one-third over the corresponding CCC. Reliability improvements of the CRCC network over the CCC are studied. A regular layout scheme suitable for VLSI implementation of the CRCC is presented. Reconfiguration techniques under failures of processors in the CRCC are discussed.
Implementation of a debugging aid for logic errors in Pascal programs
Authors: Trevor Lukey, Kenneth Loose, David R. Hill
Venue: ACM SIGCSE Bulletin (1987)

This paper describes a debugging utility with some tutorial capabilities. It is designed to assist novice programmers in finding logic errors in syntactically correct programs. Flow and use analysis techniques are employed to aid in the recognition of some instances of incorrect code sequence, improper variable use and improper nesting of constructs. The utility is menu driven with built in facilities for displaying user source programs and debugging information in a multiple window format.
The student consultant...supporting the microcomputer labs
Authors: Nancy J. Bauer
Venue: Proceedings of the 15th annual ACM SIGUCCS conference on User Services (1987)

Efficient and effective support of the microcomputer labs consists of one major component, the student consultant. Student employees must be familiar with the wide base of software and hardware supported by the Computer Center. The student staff is also responsible for maintaining the physical security of the software and hardware within the labs. Motivating the student employee and providing a state-of-the-art computing environment requires creativity to accommodate the stagnant budget. This paper outlines the importance of scheduling, training staff and maintaining the microcomputer labs at Indiana State University.
Generating Essential Primes for a Boolean Function with Multiple-Valued Inputs
Authors: Y. S. Kuo
Venue: IEEE Transactions on Computers (1987)

Detecting essential primes is important in multiple-valued logic minimization. In this correspondence, we present a fast algorithm that can generate all essential primes without generating a prime cover of the Boolean function. A new consensus operation called asymmetric consensus (acons) is defined. In terms of acons, we prove a necessary and sufficient condition for detecting essential primes for a Boolean function with multiple-valued inputs. The detection of essential primes can be performed by using a tautology checking algorithm. We exploit the unateness of a Boolean function to speed up tautology checking. The notion of unateness considered is more general than that has appeared in the literature.
Imperfect random sources and discrete controlled processes
Authors: D. Lichtenstein, N. Linial, M. Saks
Venue: Proceedings of the nineteenth annual ACM symposium on Theory of computing (1987)

We consider a simple model for a class of discrete control processes, motivated in part by recent work about the behavior of imperfect random sources in computer algorithms. The process produces a string of characters from {0, 1} of length n and is a &ldquo;success&rdquo; or &ldquo;failure&rdquo; depending on whether the string produced belongs to a prespecified set L. In an uninfluenced process each character is chosen by a fair coin toss, and hence the probability of success is |L|/2n. We are interested in the effect on the probability of success in the presence of a player (controller) who can intervene in the process by specifying the value of certain characters in the string. We answer the following questions in both worst and average case: (1) how much can the player increase the probability of success given a fixed number of interventions? (2) in terms of |L| what is the expected number of interventions needed to guarantee success? In particular our results imply that if |L|/2n = 1/w(n) where w(n) tends to infinity with n (so the probability of success with no interventions is o(1)) then with &Ogr;(&radic;nlogw(n)) interventions the probability of success is 1-o(1). Our main results and the proof techniques are related to a well-known theorem of Kruskal, Katona, and Harper in extremal set theory.
AI related dissertations
Authors: Susanne M. Humphrey, Bob Krovetz
Venue: Issue 102 (October 1987) (1987)

The following are citations selected by title and abstract as being related to Al, resulting from a computer search, using the BRS Information Technologies retrieval service, of the Dissertation Abstracts International (DAI) database produced by University Microfilms International.The online file includes abstracts, which are not published in this listing, but the citations below do include the DAI reference for finding the abstract in the published DAI. Other elements of the citation are author; university, degree, and, if available, number of pages; title; UM order number and year-month of DAI; and DAI subject category chosen by the author of the dissertation. References are sorted first by the initial DAI subject category and second by the author. In addition the database includes masters abstracts, denoted by MAI (Masters Abstracts International) instead of DAI as the reference to the abstract in the published MAI.Unless otherwise specified, paper or microform copies of dissertations may be ordered from University Microfilms International, Dissertation Copies, Post Office Box 1764, Ann Arbor, MI 48106; telephone for U.S. (except Michigan, Hawaii, Alaska): 1-800-521-3042, for Canada; 1-800-268-6090. Price lists and other ordering and shipping information are in the introduction to the published DAI.
Technology transfer: commercializing university research
Authors: S. A. Szygenda, M. Wilson
Venue: Proceedings of the 1987 Fall Joint Computer Conference on Exploring technology: today and tomorrow (1987)

Technology transfer strategies have been increasing rapidly in the past six years, driven by economic development concerns. Those strategies include new programs to commercialize university research. The Center for Technology Development and Transfer is a new program with a strong mandate to transfer technology to existing businesses or through the creation of new businesses.
Medical cognitive graphics
Authors: W. G. Cole
Venue: ACM SIGCHI Bulletin (1986)

Medical inference problems that seem too complex for intuitive solution can be made tractable if the problem information is presented in the form of a graphic display. The medical cognitive graphics approach to aiding complex problem solving conceives of a medical professional as a person trying to form a mental model of the patient's situation. Appropriate computer graphics make mental models easier to form and easier to explore. This paper develops the notion of medical cognitive graphics via two examples drawn from medical diagnosis and monitoring.
Metric data models and associated search strategies
Authors: Lev Goldfarb
Venue: ACM SIGIR Forum (1986)

I believe that the concept of a metric (or a dissimilarity measure) defined on a set of records is one of the most fundamental concepts related to information retrieval, although historically, the first science to introduce this concept as a basic one was, perhaps, numerical taxonomy. In the metric model the concept of the most relevant record should be interpreted as that of the closest (with respect to the chosen metric) record.
APL2 implementations of unification
Authors: James A. Brown, Ramiro Guerreiro
Venue: ACM SIGAPL APL Quote Quad (1987)

This paper defines unification, the pattern matching process used in logic programming, and presents various alternatives for constructing algorithms
Note on blended linear multistep formulas
Authors: Robert D. Skeel, Thu V. Vu
Venue: ACM Transactions on Mathematical Software (TOMS) (1986)

The blended linear multistep methods of Skeel and Kong (1977) are fairly simply expressed in Nordsieck form, but the underlying multistep method turns out to be much more complicated.
Optimal attack and reinforcement of a network
Authors: William H. Cunningham
Venue: Journal of the ACM (JACM) (1985)

In a nonnegative edge-weighted network, the weight of an edge represents the effort required by an attacker to destroy the edge, and the attacker derives a benefit for each new component created by destroying edges. The attacker may want to minimize over subsets of edges the difference between (or the ratio of) the effort incurred and the benefit received. This idea leads to the definition of the &ldquo;strength&rdquo; of the network, a measure of the resistance of the network to such attacks. Efficient algorithms for the optimal attack problem, the problem of computing the strength, and the problem of finding a minimum cost &ldquo;reinforcement&rdquo; to achieve a desired strength are given. These problems are also solved for a different model, in which the attacker wants to separate vertices from a fixed central vertex.
Convexity algorithms in parallel coordinates
Authors: Alfred Inselberg, Mordechai Reif, Tuval Chomut
Venue: Journal of the ACM (JACM) (1987)

With a system of parallel coordinates, objects in RN can be represented with planar &ldquo;graphs&rdquo; (i.e., planar diagrams) for arbitrary N [21]. In R2, embedded in the projective plane, parallel coordinates induce a point &larr; &rarr; line duality. This yields a new duality between bounded and unbounded convex sets and hstars (a generalization of hyperbolas), as well as a duality between convex union (convex merge) and intersection. From these results, algorithms for constructing the intersection and convex merge of convex polygons in O(n) time and the convex hull on the plane in O(log n) for real-time and O(n log n) worst-case construction, where n is the total number of points, are derived. By virtue of the duality, these algorithms also apply to polygons whose edges are a certain class of convex curves. These planar constructions are studied prior to exploring generalizations to N-dimensions. The needed results on parallel coordinates are given first.
Teaching programming algorithms aided by computer graphics
Authors: Bruce R. Maxim, Bruce S. Elenbogen
Venue: Proceedings of the eighteenth SIGCSE technical symposium on Computer science education (1987)

Effects of operations on abstract data objects are often difficult for students to comprehend. Visual models can be helpful to students, when the connections among the data object models, virtual machine representations of data objects, and algorithms operating on the data objects are made clear to the students.This paper discusses the design criteria used to develop a series of Pascal programs, implemented on widely used microcomputers, which make use of graphics to illustrate the effects of programming algorithms on common data structures. These programs were designed to be used in classroom demonstrations and by individual students working in the computing laboratory.1A non-machine specific design of an algorithm teacher is proposed. It is a programmed environment to help students in a beginning computer science course learn problem solving skills. This paper provides an overview of the problem, a motivation and justification, followed by a brief description of what the program should provide the student.
Displaying IDL instances
Authors: Richard Thomas Snodgrass
Venue: ACM SIGPLAN Notices (1987)

Debugging a complex system can be aided by displaying the internal data structures manipulated by the system. We examine one generic Unix tool and four IDL-specific tools, focussing on their functionality and ability to handle large data structures gracefully.