ppxscal/embedding_network huggingface dataset:
Systolic Tree Implementation of Data Structures
Authors: Jik H. Chang, Oscar H. Ibarra, Moon Jung Chung, Kotesh K. Rao
Venue: IEEE Transactions on Computers (1988)

Systolic tree architectures are presented for data structures such as stacks, queues, dequeues, priority queues, and dictionary machines. The stack, queue, and dequeue have a unit response time and a unit pipeline interval. The priority queue also has a unit response time, but the pipeline interval is 2. The response time and pipeline interval for the dictionary machine are O(log n) and O(1), respectively, where n is the number of data elements currently residing in the tree. In each node of the tree, the mechanism for controlling the transmission and distribution of data is finite state. This feature makes the designs presented here suitable for VLSI. If there are n data elements in the data structure, the depth of the tree is O(log n).
The State of Software Maintenance
Authors: N. F. Schneidewind
Venue: IEEE Transactions on Software Engineering (1987)

A state of software maintenance survey is presented, indicating the incongruity of the simultaneous existence of importance and neglect in this field. An overview is given of selected developments and activities covering the following topics:  The "Maintenance Problem."  Models.  Methods for improving maintenance.  Metrics.  Maintenance information management.  Standards.  Maintenance of existing code.  Surveys.
Nutcracker: an efficient and intelligent channel spacer
Authors: X.-M. Xiong, E. S. Kuh
Venue: Proceedings of the 24th ACM/IEEE Design Automation Conference (1987)

A new algorithm for channel spacing is discussed in this paper. In contrast to existing compaction algorithms, we rely on the geometric method and bypass the constraint graph during the whole spacing process. We propose an efficient way to enumerate all possible jogs. Therefore, for the given channel routing topology, our algorithm yields the minimal channel height with the incorporation of contacts sliding and automatic jog insertion. In the final output, only necessary jogs are inserted, and the total wire length is minimized.
Hierarchical Data Structures and Algorithms for Computer Graphics. Part I.
Authors: Hanan Samet, Robert E. Webber
Venue: IEEE Computer Graphics and Applications (1988)

The fundamentals of hierarchical data structures are reviewed and it is shown how they are used in the implementation of some basic operations in computer graphics. The properties of hierarchical structures are discussed, focusing on quadtrees and octrees. The latter are defined, some of the more common ways in which they are implemented are examined, and an explanation of the quadtree/octree complexity theorem is provided. Vector quadtrees and vector octrees are discussed. The performance of basic operations using quadtrees is considered.
Optimal dynamic solutions for fixed windowing problems
Authors: R Klein, O Nurmi, T Ottmann, D Wood
Venue: Proceedings of the second annual symposium on Computational geometry (1986)

Given a point set in plane and a fixed planar region (window) a window query consists of enumerating the points in a translate of the region. A recently presented result shows that a static data structure of optimal size enables window queries for convex regions in optimal time. We show that if the windows are (maybe non-convex) polygons another data structure of optimal size supports not only window queries in optimal time but also allows updating of the point set in optimal time.
APL in quality business management
Authors: Terence J. McKee
Venue: ACM SIGAPL APL Quote Quad (1986)

Companies monitor their processes so that they can identify actions that need to be taken. Measures such as monthly sales, expenses by category, inventory levels, days debt and computer service availability are recorded and reported. This paper introduces the application of quality control techniques to help you determine whether a process needs intervention. You will want to identify when a short term fluctuation becomes significant, when a longer term trend appears and most important, determine what sort of action is appropriate. There are many potential pitfalls in presentation techniques even when the correct information is being used. Some are mentioned, but are not the prime purpose of this paper. There are good examples in reference 1.
Using large families for handling priority requests
Authors: A Burns
Venue: ACM SIGAda Ada Letters (1987)

With ordinary task entries, requests are handled strictly in the order in which they arrive at the called task. To circumvent this rule, for prioritised requests, the Ada language provides entry families. Unfortunately the programming of a reliable algorithm for a large number of priority levels is non-trivial. This paper reviews the "solutions" usually given and derives an acceptable, if somewhat complex, algorithm. Suggestions for improvements in the facilities Ada provides are also presented.
Measurement-Based Analysis of Error Latency
Authors: R. Chillarege, R. K. Iyer
Venue: IEEE Transactions on Computers (1987)

This paper demonstrates a practical methodology for the study of error latency under a real workload. The method is illustrated with sampled data on the physical memory activity, gathered by hardware instrumentation on a VAX 11/780 during the normal workload cycle of the installation. These data are used to simulate fault occurrence and to reconstruct the error discovery process in the system. The technique provides a means to study the system under different workloads and for multiple days. An approach to determine the percentage of undiscovered errors is also developed and a verification of the entire methodology is performed. This study finds that the mean error latency, in the memory containing the operating system, varies by a factor of 10 to 1 (in hours) between the low and high workloads. It is found that of all errors occurring within a day, 70 percent are detected in the same day, 82 percent within the following day, and 91 percent within the third day. The increase in failure rate due to latency is not so much a function of remaining errors but is dependent on whether or not there is a latent error.
Design principles for the enhanced presentation of computer program source text
Authors: R. Baecker, A. Marcus
Venue: ACM SIGCHI Bulletin (1986)

In order to make computer programs more readable, understandable, appealing, memorable, and maintainable, the presentation of program source text needs to be enhanced over its conventional treatment. Towards this end, we present five basic design principles for enhanced program visualization and a framework for applying these principles to particular programming languages. The framework deals comprehensively with ten fundamental areas that are central to the structure of programming languages. We then use the principles and the framework to develop a novel design for the effective presentation of source text in the C programming language.
Positioning human factors in the user interface development chain
Authors: Jonathan Grudin, Susan F. Ehrlich, Rick Shriner
Venue: ACM SIGCHI Bulletin (1986)

Human factors professionals are not completely free to support the optimization of user interface design within the time span of individual software development projects. Interface design is constrained by conservative forces, such as the expectations of users of existing systems in the installed base and emerging de facto or formal standards. At the same time, human factors involvement with a particular product may ultimately have its greatest impact on future product releases. In this paper we explore an expanded time line for influencing product design. This time line brings middle- and upper-management concerns into focus, revealing critical opportunities for effectively positioning and applying human factors resources.
Selecting Software Test Data Using Data Flow Information
Authors: Sandra Rapps, Elaine J. Weyuker
Venue: IEEE Transactions on Software Engineering (1985)

This paper defines a family of program test data selection criteria derived from data flow analysis techniques similar to those used in compiler optimization. It is argued that currently used path selection criteria, which examine only the control flow of a program, are inadequate quate. Our procedure associates with each point in a program at which a variable is defined, those points at which the value is used. Several test data selection criteria, differing in the type and number of these associations, are defined and compared.
The computational view of nature: A liberal arts course in computer science
Authors: Nicholas Ourusoff
Venue: ACM SIGCSE Bulletin (1986)

A liberal arts course in computer science should convey a computational view of nature. This is best achieved by focusing on a few ideas.
MathScribe: a user interface for computer algebra systems
Authors: C. J. Smith, N. Soiffer
Venue: Proceedings of the fifth ACM symposium on Symbolic and algebraic computation (1986)

This paper describes MathScribe, a powerful user interface for computer algebra systems. The interface makes use of a bitmapped display, windows, menus, and a mouse. Significant new features of MathScribe are its display of both input and output in two-dimensional form, its ability to select previous expressions, and its computationally efficient manner of displaying large expressions.
Transistor sizing in CMOS circuits
Authors: M. A. Cirit
Venue: Proceedings of the 24th ACM/IEEE Design Automation Conference (1987)

The problem of optimally sizing transistors in a VLSI CMOS circuit is considered. Models and algorithms for performing optimization on a single path using RC-tree approximation are presented. The results of an automatic optimization procedure are discussed.
An Application of Computer Graphics and Networks to Anatomic Model and Prosthesis Manufacturing
Authors: Michael L. Rhodes, Yu-Ming Kuo, Stephen L. G. Rothman, Charles Woznick
Venue: IEEE Computer Graphics and Applications (1987)

Computer graphics has now matured in medical applications from 2D and 3D presentations for diagnosis and the planning of surgery and therapy to become the key step in making hand-held models of custom prostheses. The system described here delivers 3D shape information to create skeletal models, plan corrective surgery, and directly manufacture prostheses. Implants and anatomic models are manufactured using computed tomography (CT) image data and a system to generate Instructions for numerically controlled machines. The system combines clinical imaging, an algorithm for 3D edge detection, computer communications, and computer-aided and manufacturing (CAD/CAM). This integration of technologies brings recent advances in computer-aided design and manufacturing to the local community CT scanning clinic in a cost-effective manner. Via computer communications, several hundred remote medical imaging centers can have their CT scanners connected on-line to CAD/CAM facilities that one could not support alone. Operators of the remote CT scanners bear only the cost of computer communications equipment to being their patients this service. We use the clinical course of several patients in whom prostheses have been implanted to describe this technology.
Prime Implicants, Minimum Covers, and the Complexity of Logic Simplification
Authors: C. McMullen, J. Shearer
Venue: IEEE Transactions on Computers (1986)

We show that any Boolean function f which can be expressed in a sum-of-products form using m product terms can contain as many as 2m- 1 implicants but no more.
Data quality and due process in large interorganizational record systems
Authors: Kenneth C. Laudon
Venue: Communications of the ACM (1986)

As societies have become more dependent on information systems to conduct and record transactions between organizations and individuals, interorganizational computer systems have become a widely used method of coordinating the actions of independent organizations. This article examines the quality of data in one important interorganizational system&mdash;the criminal-record system of the United States.
An enhanced treatment of hidden lines
Authors: Tomihisa Kamada, Satoru Kawai
Venue: ACM Transactions on Graphics (TOG) (1987)

A new display scheme is presented in which three-dimensional objects are represented with a much higher degree of user control of the line-drawing format than those in conventional schemes. In this scheme, the attribute of a line is determined not at the time of definition but after the viewing transformation has been applied, taking the shielding environment of the line into consideration. The essential difference between our scheme and conventional hidden-line removal/indication lies in the treatment of the shielding environment. In conventional hidden-line removal/indication, only the visible/invisible information is available for the selection of the attribute of a line. In our scheme, the entire set of surfaces that hide a line can be used to determine the attribute of the line. A much higher degree of freedom in generating pictures is achieved owing to the treatment of the shielding environment. We also describe a system called GRIP, which implements the new scheme.
Cognition-sensitive design and user modeling for syntax-directed editors
Authors: Lisa Rubin Neal
Venue: ACM SIGCHI Bulletin (1986)

Syntax-directed editors were created with the intent of aiding in and improving the programming process. Despite their potential, they have not been successful, as evidenced by limited use. In general, they are perceived as being too difficult to use and the benefits of their use are outweighed by the difficulties.We believe that the cognitive styles and skills of the users have been ignored in the design process. In this paper we present some of our initial results which show that cognitive styles vary over a significant spectrum and that their consideration in the design of a syntax-directed editor will result in an intelligent tool that will be right for the cognitive skills and expertise of an individual user. In turn, an approach to design that takes cognitive variation into account would support the construction of syntax-directed editors which are successfully used.
On designing database schemes bounded or constant-time maintainable with respect to functional dependencies
Authors: E. P. F. Chan, H. J. Hernandez
Venue: Proceedings of the sixth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems (1987)

Under the weak instance model, to determine if a class of database schemes is bounded with respect to dependencies is fundamental for the analysis of the behavior of the class of database schemes with respect to query processing and updates. However, proving that a class of database schemes is bounded with respect to dependencies seems to be very difficult even for restricted cases. To resolve this problem, we need to develop techniques for characterizing bounded database schemes In this paper, we give a formal methodology for designing database schemes bounded with respect to functional dependencies using a new technique called extensibility. This methodology can also be used to design constant-time-maintainable database schemes
Tactical simulation in an object-oriented animated graphics environment
Authors: Mikel D. Petty, J. Michael Moshell, Charles E. Hughes
Venue: ACM SIGSIM Simulation Digest (1988)

Action Graphics (AG) combines the ideas of animated graphics, free-form spreadsheets and object-oriented programming to produce a problem solving and simulation environment.
Symbolic and algebraic computation research in Italy
Authors: P Gianni, A Miola, T Mora
Venue: ACM SIGSAM Bulletin (1987)

We like to fix the starting point of the research activities in Symbolic and Algebraic Computation (SAC) in Italy at the IFIP Working Conference on Symbol Manipulation Languages and Techniques held in Pisa in September 1966. This event in fact, stimulated early research conducted for several years by single researchers cooperating more with foreign colleagues than each other.
Star Local Area Networks: A Performance Study
Authors: A. E. Kamal
Venue: IEEE Transactions on Computers (1987)

In this paper we study local area networks based on the star topology. We consider different access protocols used for communication over star networks. The study is concerned with network performance. We present models for the analysis of existing star network protocols. We also propose a new access protocol for star networks. The protocol has a performance that is very close to perfect scheduling. It is based on using the semaphore mechanism for bandwidth sharing. We also present an exact performance model for this protocol.
Fault-Tolerant Distributed Algorithm for Election in Complete Networks
Authors: Hosame H. Abu-Amara
Venue: IEEE Transactions on Computers (1988)

Electron in asynchronous complete networks is considered for the case in which the links may fail intermittently and undetectably. Undetectable link failure is consistent with the standard model of distributed algorithms in which link delays can be arbitrary but finite. An algorithm is given that correctly solves the problem when the links fail before or during the execution of the algorithm. If n is the number of nodes in the network, f the maximum number of fault links, and r a design parameter, the algorithm uses no more than O(nrf+(nr/(r-1) log(n/(r-1)f))) messages, runs in time O(n/(r-1)) f, and uses at most O(log mod T mod ) bits per message, where mod T mod is the cardinality of the set of node identifiers.
Fortran programs on a personal computer
Authors: D. Guinier
Venue: ACM SIGPLAN Fortran Forum (1987)

Design and implementation of a one-pass FORTRAN 77 cleaner-translater to create source codes written in enhanced structured FORTRAN on large scale systems which can be directly used by personal computer compilers.
APL2 and AI: a study of search
Authors: Ed Eusebi, James A. Brown
Venue: ACM SIGAPL APL Quote Quad (1986)

The APL2 language and its environment offers a number of features which make it an effective vehicle for AI research and for the development of knowledge-based systems. In the language, general arrays can easily model various knowledge representations; it is easy to model parallel behavior; there are various ways to implement deductive reasoning: and there are some interesting features that support a functional style of programming. In the environment, editors, interactive graphics, and debugging tools provide excellent human interfaces; Fortran, REXX, and Assembler routines may transparently replace APL2 functions; relational tables which are subsets of APL2 arrays may be retrieved dynamically; and user-to-user shared variable processing can be used to model parallel behavior. In this paper, we will demonstrate the usage of APL2 for AI problems by presenting concise functional programs for searching a database of rules and facts. Various simple enhancements are shown which extend the scope of the programs to and/or, heuristic, bi-directional, and parallel search.
A Real-Time Processor for the Hough Transform
Authors: K. Hanahara, T. Maruyama, T. Uchiyama
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1988)

The Hough transform method for recognition can cope effectively with noisy backgrounds and gaps in boundaries. However, long computation time and large memory requirements have prevented it from being used in real-time applications. An architecture devised to solve those problems, with a focus on detecting straight lines, is presented. Examples are given of the use of an experimental hardware model for automatic inspection and measurement of objects in factories and laboratories. It took less than one second from picture input to straight line parameter reproduction for these examples.
Are search and decision programs computationally equivalent?
Authors: R M Karp, E Upfal, A Wigderson
Venue: Proceedings of the seventeenth annual ACM symposium on Theory of computing (1985)

From the point of view of sequential polynomial time computation, the answer to the question in the title is 'yes'. The process of self-reducibility is a linear time Turing (oracle) reduction from a given combinatorial search problem to an appropriately defined decision problem. However, from the point of view of fast parallel computation, the answer is not so clear. Many of the sequential algorithms that were 'marked off' as being &ldquo;inherently sequential&rdquo; embed within them the self-reducibility process. Can this inherently sequential process be parallelized? To study this problem, we define an abstract setting (namely that of an independence system) in which one, universal search problem captures all combinatorial search problems. We consider several natural decision and function oracles to which this search problem may be reduced. On the positive side, we give efficient probabilistic parallel reductions to these oracles. These reductions constitute a scheme for parallelizing search problems in case the oracles for these problems are themselves efficiently computable in parallel. We give examples of problems that did not yield to parallelism before, but can be parallelized using this scheme. On the negative side, we prove lower bounds on any determininistic parallel reductions to the same oracles. If p processors are used, the sequential (linear) running time cannot be enhanced by more than a factor of &Ogr;(log p) and hence for any polynomial number of processors the problem remains inherently sequential. This proves that randomization can be exponentially more powerful than determinism in our model, and suggests that NC &ne; Random NC. Finally, we state some intriguing conjectures and suggest new directions of research in complexity theory that arise from this work.
On the geodesic Voronoi diagram of point sites in a simple polygon
Authors: B. Aronov
Venue: Proceedings of the third annual symposium on Computational geometry (1987)

Given a simple polygon with n sides in the plane and a set of k point &ldquo;sites&rdquo; in its interior or on the boundary, compute the Voronol diagram of the set of sites using the internal &ldquo;geodesic&rdquo; distance inside the polygon as the metric. We describe an &Ogr;((n+k) log2(n+k)) time algorithm for solving this problem and sketch a faster &Ogr;((n+k) log(n+k)) algorithm for the case when the set of sites includes all reflex vertices of the polygon in question.
The construction of Huffman-equivalent prefix code in NC
Authors: Shang-Hua Teng
Venue: ACM SIGACT News (1987)

In this paper, we show that an optimal prefix code (Huffman-equivalent code) over Sigma; = {0,1,..., sigma;} for any n letters a1,...,an of frequency f1,...,fn can be constructed in O(log2n) time, using only polynomial number of processors. This is done by a uniform reduction of optimal prefix coding problem to a min-plus circuit value problem of polynomial size and linear degree. Thus we can use the parallel circuit evaluation algorithms presented in [7] and [8] to construct a time-efficient and processor-efficient parallel algorithm for optimal prefix coding problem.
Model-based recognition in robot vision
Authors: Roland T. Chin, Charles R. Dyer
Venue: ACM Computing Surveys (CSUR) (1986)

This paper presents a comparative study and survey of model-based object-recognition algorithms for robot vision. The goal of these algorithms is to recognize the identity, position, and orientation of randomly oriented industrial parts. In one form this is commonly referred to as the "bin-picking" problem, in which the parts to be recognized are presented in a jumbled bin. The paper is organized according to 2-D, 2&frac12;-D, and 3-D object representations, which are used as the basis for the recognition algorithms. Three central issues common to each category, namely, feature extraction, modeling, and matching, are examined in detail. An evaluation and comparison of existing industrial part-recognition systems and algorithms is given, providing insights for progress toward future robot vision systems.