ppxscal/embedding_network huggingface dataset:
Designing for designers: an analysis of design practice in the real world
Authors: Mary Beth Rosson, Susanne Maass, Wendy A. Kellogg
Venue: ACM SIGCHI Bulletin (1986)

Twenty-two designers were interviewed about their design of interactive systems. They were asked to select a recent project having a significant user interface component, and were probed about the general design process involved, how the design of the user interface fit into that process, and their personal strategies for exploring ideas. Analysis of their responses pointed to two models of the design process. The relationship of these models to the type of user testing done and the strategies used for generating ideas is discussed, especially with respect to the implications for developing tools to support design.
A locally adaptive data compression scheme
Authors: Jon Louis Bentley, Daniel D. Sleator, Robert E. Tarjan, Victor K. Wei
Venue: Communications of the ACM (1986)

A data compression scheme that exploits locality of reference, such as occurs when words are used frequently over short intervals and then fall into long periods of disuse, is described. The scheme is based on a simple heuristic for self-organizing sequential search and on variable-length encodings of integers. We prove that it never performs much worse than Huffman coding and can perform substantially better; experiments on real files show that its performance is usually quite close to that of Huffman coding. Our scheme has many implementation advantages: it is simple, allows fast encoding and decoding, and requires only one pass over the data to be compressed (static Huffman coding takes two passes).
Algorithmic Phase Diagrams
Authors: R. Hockney
Venue: IEEE Transactions on Computers (1987)

Algorithmic phase diagrams are a neat and compact representation of the results of comparing the execution time of several algorithms for the solution of the same problem. As an example we show the recent results of Gannon and Van Rosendale on the solution of multiple tridiagonal systems of equations in the form of such diagrams. The act of preparing these diagrams has revealed an unexpectedly complex relationship between the best algorithm and the number and size of the tridiagonal systems, which was not evident from the algebraic formulae in the original paper. Even so, for a particular computer, one diagram suffices to predict the best algorithm for all problems that are likely to be encountered-the prediction being read directly from the diagram without complex calculation.
Implementation of gateways for high performance fiber optic networking
Authors: S. J. Talabac, D. H. Walters
Venue: Proceedings of the 1987 Fall Joint Computer Conference on Exploring technology: today and tomorrow (1987)

This paper describes the design and development of a high performance, full host gateway providing ISO/OSI network datagram service between heterogeneous, fiber optic, LANs. Development of this high performance gateway is in response to requirements of the NASA Space Station Data Management System (DMS). Scientific payloads aboard the Space Station polar orbiting platforms (POPs) will utilize the DMS as a means of communicating instrument data to and from on-board processors and the space-ground communications link. The payloads are characterized by high rate, high volume, packetized telemetry data streams. Performance is thus the dominant design consideration. Key hardware and software design issues are presented followed by the baseline design selected and built for NASA.
Extending Multiversion Time-Stamping Protocols to Exploit Type Information
Authors: M. Herlihy
Venue: IEEE Transactions on Computers (1987)

Atomic transactions are a widely accepted approach to implementing and reasoning about fault-tolerant distributed programs. This paper shows how multiversion time-stamping protocols for atomicity can be extended to induce fewer delays and restarts by exploiting semantic information about objects such as queues, directories, or counters. This technique relies on static preanalysis of conflicts between operations, and incurs no additioiwal runtime overhead. This technique is deadlock-free, and it is applicable to objects of arbitrary type.
An application oriented approach to view updates
Authors: Johannes Klein, Andreas Reuter
Venue: Proceedings of the ACM SIGOIS and IEEECS TC-OA 1988 conference on Office information systems (1988)

Views are an indispensable mechanism for providing flexible database access in a workstation environment. On the other hand, views created from more than one base relation have complex and in some cases contradicting update semantics. In this paper we suggest to distinguish between object types as the units for data manipulation and views as the data structures materializing these objects. Hence, the same view can represent different object types, and depending on which of them the user is granted access, we can infer simple and coherent semantics, even for complex view definitions.
The quadcode and its arithmetic
Authors: Shu-Xiang Li, Murray H. Loew
Venue: Communications of the ACM (1987)

The quadcode is a hierarchical data structure for describing digital images. It has the following properties: (1) straightforward representation of dimension, size, and the relationship between an image and its subsets; (2) explicit description of geometric properties, such as location, distance, and adjacency; and (3) ease of conversion from and to raster representation. The quadcode has applications to computer graphics and image processing because of its ability to focus on selected subsets of the data and to allow utilization of multiple resolutions in different parts of the image. A related approach is the quadtree. Samet recently presented a thorough survey of the literature in that field [7]. Gargantini [2] and Abel and Smith [1] presented linear quadtrees and linear locational keys that are efficient labeling techniques for quadtrees. In those papers the geometric concepts of the image are discussed by using the tree as an interpretive medium, and the approaches and procedures are based on traversal of the nodes in the tree. In this paper we present the quadcode system, which is a direct description of the image, and discuss the geometric concepts in terms of the coded images themselves.
Stochastic High-Level Petri Nets and Applications
Authors: Chuang Lin Dan Christian Marinescu
Venue: IEEE Transactions on Computers (1988)

A class of stochastic Petri nets called stochastic high-level Petri nets (SHLPNs) is proposed. SHLPNs are high-level Petri nets augmented with exponentially distributed firing times. SHLPNs generally lead to models with a smaller state space. A computer marking concept is introduced that allows a considerable reduction of the number of states and induces a correct grouping of states in the Markov-domain SHLPN models of multiprocessor systems. The main advantage of modeling homogeneous systems using SHLPNs is that the resulting models are simpler and more intuitive and have a smaller number of states, as shown by examples.
The influence of cultural and social aspects on the Japanese software development environment
Authors: D. Tajima, T. Matsubara
Venue: Proceedings of the 1987 Fall Joint Computer Conference on Exploring technology: today and tomorrow (1987)

This paper presents a study on the type of software development environment currently dominating the Japanese software industry, in particular examining how this environment is influenced by cultural and social aspects of Japanese society. Some of the early problems facing software development in Japan are reviewed, followed by a description of the successful &ldquo;software factory&rdquo; approach to these problems, which is an attempt to treat intangible software products as tangible industrial products utilizing quality control and personnel management procedures adopted from Japan's successful hardware industry. Finally, a look is taken at a proposed ideal software development environment influenced by both Japanese/Oriental philosophy and holistic thinking, which aims at providing harmony between the creative efforts of individual software engineers and overall project objectives.
Implementation of physical units
Authors: Geoff Baldwin
Venue: ACM SIGPLAN Notices (1987)

This paper describes an implementation of strong typing with physical units. The typing system of a commercial Pascal compiler was minimally extended to allow compile-time checking of expressions involving physical units to ensure that the familiar semantics of dimensional analysis are not violated. The key concepts and mechanisms are described, as are the differences between ordinary type checking and that for physical units.
Comments on "Detection of Mutual Inconsistency in Distributed Systems"
Authors: K. V. S. Ramarao
Venue: IEEE Transactions on Software Engineering (1987)

In the above paper,1authors have given a technique for the detection of mutual inconsistency among the copies of a file, in presence of network partitioning. This technique involves maintaining a "version vector" with each file in a partition. Here, we show that it is impossible to maintain the version vectors when arbitrary reconfigurations can occur after a network partitioning.
Parallel text search methods
Authors: Gerard Salton, Chris Buckley
Venue: Communications of the ACM (1988)

A comparison of recently proposed parallel text search methods to alternative available search strategies that use serial processing machines suggests parallel methods do not provide large-scale gains in either retrieval effectiveness or efficiency.
A Fault-Tolerant Systolic Sorter
Authors: Yoon-Hwa Choi, Miroslaw Malek
Venue: IEEE Transactions on Computers (1988)

A fault-tolerant systolic sorter design is proposed. An algorithm-based fault tolerance is achieved by testing the invariants of a systolic sorter during normal operation. Transient and permanent computation errors can be detected by using error-checking code and some redundant cells. A block with a single faulty cell can be located. Small hardware overhead and negligible time overhead are shown to be the major advantages of the method. A hierarchical structure is suggested as an efficient architecture for realizing the method. An offline fault-testing method for permanent stuck-at faults is presented.
AI: Just how scattered is the literature?
Authors: W. J. Mills
Venue: Issue 99 (January 1987) (1987)

It is a commonplace that the literature of Al is scattered. This paper presents evidence as to the extent of that scatter and explores some of the implications for how best to locate relevant literature.
A numerical code generation facility for REDUCE
Authors: Barbara L. Gates
Venue: Proceedings of the fifth ACM symposium on Symbolic and algebraic computation (1986)

Many scientific problems require mathematical modeling and symbolic derivation to produce formulas which are evaluated numerically. Computer algebra systems can be used effectively in the symbolic derivation phase and subsequently to generate numerical code. This paper describes the design of the GENTRAN code generation facility for REDUCE.
A note on a study of cases
Authors: Karen Sparck Jones, Branimir Boguraev
Venue: Computational Linguistics (1987)

This note describes and illustrates a study of deep cases using a large sample of sentences. The purpose of the note is to draw attention to the value of the source material used for those interested in casebased representations of sentence meaning, and to indicate the potential utility of the study results.
A Fault-Tolerant FFT Processor
Authors: Yoon-Hwa Choi, Miroslaw Malek
Venue: IEEE Transactions on Computers (1988)

A method is proposed for achieving fault tolerance by introducing a redundant stage for a special-purpose fast Fourier transform (FFT) processor. A concurrent error-detection technique, called recomputing by alternate path, is used to detect errors during normal operation. Once an error is detected, a faulty butterfly can be located with log (N+5) additional cycles. The method has 100% detection and location capability, regardless of the magnitude of the roundoff errors. A gracefully degraded reconfiguration using a redundant stage is introduced. This technique ensures a high improvement in reliability and availability. Hardware overhead is O(1/log N) with some additional comparators and switches. The method can be applied to other algorithms implementable on the butterfly structure.
UIMS support for direct manipulation interfaces
Authors: S E Hudson
Venue: ACM SIGGRAPH Computer Graphics (1987)

Recently direct manipulation interfaces have received a lot of attention. The direct manipulation paradigm seems to offer significant advantages, particularly for novice users. In this paper we will consider what direct manipulation is, what this means to user interface management systems, and what we should do about it. We will conclude that to support direct manipulation, syntax should be de-emphasized and decentralized, the presentation component of the system should be made more flexible than most exiting systems, and feedback, particularly semantic feedback, is very important and should be supported in a much more automatic fashion.
Partitioning Polyhedral Objects into Nonintersecting Parts
Authors: Segal Segal, Carlo H. Sequin
Venue: IEEE Computer Graphics and Applications (1988)

An algorithm is described for partitioning intersecting polyhedrons into disjoint pieces and, more generally, removing intersections from sets of planar polygons embedded in three space. Polygons, or faces, need not be convex and may contain multiple holes. Intersections are removed by considering pairs of faces and slicing the faces apart along their regions of intersection. To reduce the number of face pairs examined, bounding boxes around groups of faces are checked for overlap. The intersection algorithm also computes set-theoretic operations on polyhedrons. Information gathered during face cutting is used to determine which portions of the original boundaries may be present in the result of an intersection, a union, or a difference of solids. The method includes provisions to detect and in some cases overcome, the effects of numerical inaccuracy on the topological decisions that the algorithm must make. The regions in which ambiguous results are possible are flagged so that the user can take appropriate action.
Essential properties of IPSEs
Authors: M Lehman, W Turski
Venue: ACM SIGSOFT Software Engineering Notes (1987)

The phrase 'Integrated Project (or Programming) Support Environment' and its acronym IPSE are being increasingly used to describe a class of systems consisting of a collection of tools to be used in program development or evolution (maintenance). If the terms 'Integrated', 'Environment' and 'IPSE' are to be meaningful, their use should be restricted to systems that satisfy appropriate criteria. In particular, a clear distinction must be made between IPSE and, to coin a term, ICSE, where 'C' stands for 'coding'. The latter term is seen as applying to, for example, a collection consisting of an appropriate editor, a compiler, a linkage editor, a loader and a run time system.
Organization and management of the information center: case studies
Authors: Mary Sumner
Venue: Proceedings of the twenty-first annual conference on Computer personnel research (1985)

This paper provides case studies of thirteen St. Louis based information centers. The objectives of the paper are to describe the responsibilities of information center professionals, to identify tools and resources for end user computing, to describe users and user-developed applications, and to identify policies relating to end user application development. The findings reflect the growth of information center resources and staff in response to rising demand for support of end user computing . Most user-developed applications were queries, reports, and analyses of production data extracts, as well as microcomputer based applications involving personal and departmental data. Informal policies and guidelines for user applications have been defined, but as yet most of these applications have not impacted the application development backlog.
An alternate design for Fortran 8X
Authors: J. Fullerton
Venue: ACM SIGPLAN Fortran Forum (1987)

The current language revision effort by the ANSI X3J3 committee is suffering from substantial discord among the member organizations [13, 5] and the user community. The largest stumbling blocks appear to be the size [12] and complexity of the draft language. Both of these can be substantially reduced by a careful redesign of the language.
Computing size-independent matrix problems on systolic array processors
Authors: J. J. Navarro, J. M. Llaberia, M. Valero
Venue: ACM SIGARCH Computer Architecture News (1986)

A methodology to transform dense to band matrices is presented in this paper. This transformation, is accomplished by triangular blocks partitioning, and allows the implementation of solutions to problems with any given size, by means of contraflow systolic arrays, originally proposed by H.T. Kung. Matrix-vector and matrix-matrix multiplications are the operations considered here.The proposed transformations allow the optimal utilization of processing elements (PEs) of the systolic array when dense matrix are operated. Every computation is made inside the array by using adequate feedback. The feedback delay time depends only on the systolic array size.
Height-balanced trees of order (β, γ, δ)
Authors: Shou-Hsuan S. Huang
Venue: ACM Transactions on Database Systems (TODS) (1985)

We study restricted classes of B-trees, called H(&bgr;, &ggr;, &dgr;) trees. A class is defined by three parameters: &bgr;, the size of a node; &ggr;, the minimal number of grandsons a node must have; and &dgr;, the minimal number of leaves bottom nodes must have. This generalizes the brother condition of 2-3 brother trees in a uniform way to B-trees of higher order. The class of B-trees of order m is obtained by choosing &bgr; = m, &ggr; = (m/2)2 and &dgr; = m/2. An algorithm to construct H-trees for any given number of keys is given in Section 1. Insertion and deletion algorithms are given in Section 2. The costs of these algorithms increase smoothly as the parameters are increased. Furthermore, it is proved that the insertion can be done in time O(&bgr; + log N), where N is the number of nodes in the tree. Deletion can also be accomplished without reconstructing the entire tree. Properties of H-trees are given in Section 3. It is shown that the height of H-trees decreases as &ggr; increases, and the storage utilization increases significantly as &dgr; increases. Finally, comparisons with other restricted classes of B-trees are given in Section 4 to show the attractiveness of H-trees.
Accessing bit fields in FORTRAN-77
Authors: Manny Hayes
Venue: Communications of the ACM (1986)

By incorporating bit-manipulation routines into Fortran-77, it is now possible to manipulate bits or partial word operands without having to write assembly-coded subroutines. Because the routines are now acceptable to Fortran-77 compilers, the accessing code is now portable to other Fortran Machines.
Automated layout generation using gate matrix approach
Authors: Y.-C. Chang, S.-C. Chang L.-H. Hsu
Venue: Proceedings of the 24th ACM/IEEE Design Automation Conference (1987)

This paper presents a software system ALSUGMA for automated gate matrix layout generation. Its structured Net-List and Realization Matrix models which are different from previous interval graph approach are introduced. Algorithms to minimize and realize the gate matrix layout are also presented with examples. Empirical results showed good performance in terms of both speed and layout quality. Folding technique for such layout style is also introduced.
Experimenting with EPILOG: some results and preliminary conclusions
Authors: M. J. Wise
Venue: Proceedings of the 13th annual international symposium on Computer architecture (1986)

The EPILOG language and model of computation are briefly described, together with four multiprocessor architectures on which it is proposed to run the model: a form of chordal network and a slight variant of Wu and Feng's Baseline and Reverse Baseline networks. Results are reported for the simulated execution of some EPILOG programs on these architectures. Finally, some tentative conclusions are drawn and some possible avenues for future research are indicated.
A formal lexicon in the Meaning-Text Theory: (or how to do lexica with words)
Authors: Igor A. Mel'čuk, Alain Polguère
Venue: Computational Linguistics (1987)

The goal of this paper is to present a particular type of lexicon, elaborated within a formal theory of natural language called Meaning-Text Theory (MTT). This theory puts strong emphasis on the development of highly structured lexica. Computational linguistics does of course recognize the importance of the lexicon in language processing. However, MTT probably goes further in this direction than various well-known approaches within computational linguistics; it assigns to the lexicon a central place, so that the rest of linguistic description is supposed to pivot around the lexicon. It is in this spirit that MTT views the model of natural language: the Meaning-Text Model, or MTM. It is believed that a very rich lexicon presenting individual information about lexemes in a consistent and detailed way facilitates the general task of computational linguistics by dividing it into two more or less autonomous subtasks: a linguistic and a computational one. The MTM lexicon, embodying a vast amount of linguistic information, can be used in different computational applications.We will present here a short outline of the lexicon in question as well as of its interaction with other components of the MTM, with special attention to computational implications of the Meaning-Text Theory.
New applications of failure functions
Authors: D. S. Hirschberg, L. L. Larmore
Venue: Journal of the ACM (JACM) (1987)

Presented are several algorithms whose operations are governed by a principle of failure functions: When searching for an extremal value within a sequence, it suffices to consider only the subsequence of items each of which is the first possible improvement of its predecessor. These algorithms are more efficient than their more traditional counterparts.
A design rule independent cell compiler
Authors: J. S. J. Chen
Venue: Proceedings of the 24th ACM/IEEE Design Automation Conference (1987)

To achieve fast turn around, appropriate performance and efficient silicon area in ASIC design, it is desirable to have the capability of generating new customized cells overnight. A design rule independent cell compiler which is capable of generating nearly optimal layout and all the desirable user interfaces such as automatic place and route database, data sheet, SPICE information and the layout verification mode I for any user specified cell I is reported in this paper. The algorithms used for cell synthesis are also discussed in this paper.
The design of the REXX language
Authors: M Cowlishaw
Venue: ACM SIGPLAN Notices (1987)

One way of classifying computer languages is by two classes: languages needing skilled programmers, and personal languages used by an expanding population of general users. REstructured eXtended eXecutor (REXX) is a flexible personal language designed with particular attention to feedback from its users. It has proved to be effective and easy to use, yet it is sufficiently general and powerful to fulffil the needs of many demanding professional applications. REXX is system and hardware independent, so that it has been possible to integrate it experimentally into several operating systems. Here REXX is used for such purposes as command and macro programming, prototyping, education, and personal programming. This paper introduces REXX and describes the basic design principles that were followed in developing it.