ppxscal/embedding_network huggingface dataset:
On the Equivalence of Cost Functions in the Design of Circuits by Cost-Table
Authors: J. T. Butler, K. A. Schueller
Venue: IEEE Transactions on Computers (1990)

In the cost-table approach to logic design, a function is realized as a combination of functions from a table. The objective of the synthesis is to find the least-cost realization, where realization cost is the sum of the costs of the functions used plus the cost of combining them. The costs of cost-table functions are defined by a cost function which represents chip area, speed, power dissipation, or a combination of these factors. It is shown that there is an arbitrarily large set S of cost functions which yield the same cost-table. This implies, for example, that every minimal realization of any function over a cost function in S is independent of the actual cost function used. With any cost function, if the cost of combining functions from a cost-table F is sufficiently large, the realizations behave as if the cost function belonged to S. That is, any minimal realization of a function f, using cost-table F, is one of the minimal realizations of f using F and a cost function in S. The interpretation of these results is that there are not as many distinct cost-tables as originally thought.
Knowledge-Based Computer Vision-Integrated Programming Language and Data Management System Design
Authors: A. M. Goodman, R. M. Haralick, L. G. Shapiro
Venue: Computer (1989)

Properties that are needed in a language for programming computer vision tasks are described, and a new object-oriented programming language and data management system approach is suggested. An example from automatic pose estimation is used to illustrate the necessity for the properties in a language system, it is indicated where other languages and data management systems fail to provide these properties, and the type constructors used in the authors' system and features of the language semantics of their system are discussed.
Type-dependent parameter inference
Authors: Gordon V. Cormack, Andrew K. Wright
Venue: ACM SIGPLAN Notices (1990)

An algorithm is presented to infer the type and operation parameters of polymorphic functions. Operation parameters are named and typed at the function definition, but are selected from the set of overloaded definitions available wherever the function is used. These parameters are always implicit, implying that the complexity of using a function does not increase with the generality of its type.
A design tool used to quantitatively evaluate student projects
Authors: Calvin Selig, Sallie Henry
Venue: ACM SIGCSE Bulletin (1988)

In the last decade, the field of Computer Science has undergone a revolution. It has started the move from a mysterious art form to a detailed science. The vehicle for this progress has been the rising popularity of the field of Software Engineering. This innovative area of computer science has brought about a number of changes in the way we think of, and work with, the development of software. Due to this renovation, a field that started with little or no design techniques and unstructured, unreliable software has progressed to a point where a plethora of techniques exist to improve the quality of a program design as well as that of the resultant software. The popularity of structured design and coding techniques prove that there is widespread belief that the overall product produced using these ideas is somehow better, and statistics seem to indicate that this belief is true. Until recently, however, there existed no technique for quantitatively showing one program better than its functional equivalent. In the past few years, the use of software quality metrics seems to indicate that such a comparison is not only possible, but is also valid. The advent of Software Engineering has demanded that most universities offer a Software Engineering course which entails a &ldquo;Real-World&rdquo; group project. Students participating in the class design a system using a program design language (PDL). Other students then write code from the design and finally the design team integrates the modules into a working system. For a complete description of the class see [HENS83] and [TOMJ87].
Automated reasoning in geometries using the characteristic set method and Gr&ouml;bner basis method
Authors: S-C. Chou
Venue: Proceedings of the international symposium on Symbolic and algebraic computation (1990)

This is an overview of the applications of the characteristic set method and the Gr&ouml;bner basis method to automated reasoning in elementary geometries, differential geometries, and mechanics. Though I shall try to be objective, it will reflect mainly my knowledge of the subject.
Performance Characterization of Quorum-Consensus Algorithms for Replicated Data
Authors: M. Ahamad, M. H. Ammar
Venue: IEEE Transactions on Software Engineering (1989)

The authors develop a model and define performance measures for a replicated data system that makes use of a quorum-consensus algorithm to maintain consistency. They consider two measures: the proportion of successfully completed transactions in systems where a transaction aborts if data is not available, and the mean response time in systems where a transaction waits until data becomes available. Based on the model, the authors show that for some quorum assignment there is an optimal degree of replication beyond which performance degrades. There exist other quorum assignments which have no optimal degree of replication. The authors also derive optimal read and write quorums which maximize the proportion of successful transactions.
High-Level Test Generation for VLSI
Authors: Debashis Bhattacharya, Brian T. Murray, J. P. Hayes
Venue: Computer (1989)

The authors survey high-level approaches to test generation for VLSI circuits, which can significantly reduce test generation time while still providing good fault coverage. High-level approaches view the circuit with less structural detail, that is, from a more abstract viewpoint and often hierarchically. The authors first review some basic circuit and fault models and the two most widely known test-generation algorithms as a basis for comparison between high-level and low-level techniques. The authors then examine the more important high-level approaches, which fall into two broad classes, namely algorithmic and heuristic.
Adaptive radiosity textures for bidirectional ray tracing
Authors: Paul S. Heckbert
Venue: Proceedings of the 17th annual conference on Computer graphics and interactive techniques (1990)

We present a rendering method designed to provide accurate, general simulation of global illumination for realistic image synthesis. Separating surface interaction into diffuse plus specular, we compute the specular component on the fly, as in ray tracing, and store the diffuse component (the radiosity) for later-reuse, similar to a radiosity algorithm. Radiosities are stored in adaptive radiosity textures (rexes)1 that record the pattern of light and shadow on every diffuse surface in the scene. They adaptively subdivide themselves to the appropriate level of detail for the picture being made, resolving sharp shadow edges automatically.We use a three-pass, bidirectional ray tracing algorithm that traces rays from both the lights and the eye. The "size pass" records visibility information on diffuse surfaces; the "light pass" progressively traces rays from lights and bright surfaces to deposit photons on diffuse surfaces to construct the radiosity textures; and the "eye pass" traces rays from the eye, collecting light from diffuse surfaces to make a picture.
Singular points of algebraic curves
Authors: Takis Sakkalis, Rida Farouki
Venue: Journal of Symbolic Computation (1990)

Given an irreducible algebraic curve f(x,y)=0 of degree n>=3 with rational coefficients,we describe algorithms for determinig whether the curve is singular, and if so, isolating its singular points, computing their multiplicities, and counting the number of distinct tangents at each. The algorithms require only rational arithmetic operations on the coefficients of f(x,y)=0, and avoid the need for more abstract symbolic representations of the singular point coordinates.
The VMP multiprocessor: initial experience, refinements, and performance evaluation
Authors: D. R. Cheriton, A. Gupta, P. D. Boyle, H. A. Goosen
Venue: Proceedings of the 15th Annual International Symposium on Computer architecture (1988)

VMP is an experimental multiprocessor being developed at Stanford University, suitable for high-performance workstations and server machines. Its primary novelty lies in the use of software management of the per-processor caches and the design decisions in the cache and bus that make this approach feasible. The design and some uniprocessor trace-driven simulations indicating its performance have been reported previously. In this paper, we present our initial experience with the VMP design based on a running prototype as well as various refinements to the design. Performance evaluation is based both on measurement of actual execution as well as trace-driven simulation of multiprocessor executions from the Mach operating system.
Supercomputers in computational ocean acoustics
Authors: D. Lee, M. H. Schultz, F. Saied
Venue: Proceedings of the 1989 ACM/IEEE conference on Supercomputing (1989)

In this paper, we report on some computational experience in solving ocean acoustic propagation problems in three dimensions on supercomputers. The underlying Helmholtz equation is transformed into a parabolic-type equation in the Lee-Saad-Schultz model [5], which has a natural alternating direction implicit (ADI) implementation. We give estimates of the computing power required to solve problems with realistic sound velocity profiles. We then give performance results for the CRAY X-MP and for the computational kernel on the Intel hypercube (iPSC/2). We conclude with some remarks about architectural enhancements that would be beneficial to our application.
Geometric Precision in Noise-Free Digital Images
Authors: D. I. Havelock
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1989)

A basis for determining the best possible precision for the position of a given object in a digital image is developed. The approach is general, being independent of object-form and providing a performance bound on all position estimation schemes. The central concepts in the development are the locale and total variation of the image function. An easily computed bound for the smallest attainable RSM position estimation error is developed. The best possible estimate is given by the centroids of the locales. The analysis of geometric precision using locales shows how object position-uncertainty depends on the object's position. Visual inspection of the easily generated locale pattern gives a qualitative impression of the spatial distribution of geometric precision. The analytic techniques developed provide avenues for both qualitative and quantitative evaluation of target forms and position estimation schemes in terms of their precision mensuration capabilities.
Semantic data models
Authors: Joan Peckham, Fred Maryanski
Venue: ACM Computing Surveys (CSUR) (1988)

Semantic data models have emerged from a requirement for more expressive conceptual data models. Current generation data models lack direct support for relationships, data abstraction, inheritance, constraints, unstructured objects, and the dynamic properties of an application. Although the need for data models with richer semantics is widely recognized, no single approach has won general acceptance. This paper describes the generic properties of semantic data models and presents a representative selection of models that have been proposed since the mid-1970s. In addition to explaining the features of the individual models, guidelines are offered for the comparison of models. The paper concludes with a discussion of future directions in the area of conceptual data modeling.
An evolution-based approach to partitioning ASIC systems
Authors: Y. Saab, V. Rao
Venue: Proceedings of the 26th ACM/IEEE Design Automation Conference (1989)

In the design of application specific integrated circuits (ASIC), it is often required to partition a logic complex into smaller subcomplexes satisfying a number of constraints. Due to the complexity of the problem, most existing algorithms try to optimize on only one constraint. In this paper, we use the concept of evolution to derive a partitioning algorithm capable of handling a number of constraints. Our algorithm provides a uniform multi-way partitioning scheme, obtains good partitions, and has a fast execution time.
Methodologies for a real-time intelligent supervisory system for a hot strip mill finisher
Authors: Yutaka Miyabe, Csabe Biegl, Kazuhiko Kawamura
Venue: Proceedings of the 1st international conference on Industrial and engineering applications of artificial intelligence and expert systems - Volume 1 (1988)

This paper describes methodologies and the architecture used in a prototype intelligent supervisory system for hot strip finishing mills in steel manufacturing. The prototype system incorporates a knowledge-based supervisory layer in its top level. The supervisor gathers information from critical areas and warns the operator on abnormalities. The system takes advantage of an emerging artificial intelligence (AI) toolset in a virtually parallel processing environment and couples symbolic and numeric computation in real time. The toolset allows the user to construct a hierarchy of Autonomous Communicating Objects (ACOs) [10], each of which may have some intelligent supervisory function and communicate with each other. The supervisory system is a prototype system using a simulated plant. The system has two separate diagnostic modules which are activated by messages from the simulated plant The modules detect sensor failures using traditional signal processing schemes and inference by rules representing the knowledge of the process. A sensor is not considered to be failed until detected by both modules. This can solve some practical difficulties in implementing adequately sensitive fault diagnosis. The supervisory system has a result interpreter which analyzes the plant behavior when no serious sensor failure is detected. The interpreter consists of heuristic rules which pursue forward chaining, and subordinate modules for primitive diagnostic algorithms which can be executed concurrently. It has a fault propagation digraph for each physical perspective of the plant, a category, and invokes subordinate modules by supplying digraphs. Supervising these insufficiently informed but &ldquo;functionally accurate&rdquo; modules, the diagnostic module determines an essential category without which the current plant problems can not be explained. The combination of the rule-based deduction and the reachability matrix-based approach offers a practical methodology for the plant diagnosis.
Multistage Interconnection Network Reliability
Authors: J. T. Blake, K. S. Trivedi
Venue: IEEE Transactions on Computers (1989)

The authors examine the reliability of a unique-path multistage interconnection network (MIN) and a fault-tolerant scheme aimed at improving system reliability. They derive closed-form expressions for the time-dependent reliability of the 8*8 and 16*16 shuffle-exchange multistage interconnection networks (SENs) and SENs with an addition state (SEN+). These expressions are derived without any assumptions regarding the underlying component-lifetime distributions. They derive a tight reliability lower bound that is useful for the analysis of larger networks. They provide numerical results for networks as large as 1024*1024.
A lower bound on the size of universal sets for planar graphs
Authors: M. Chrobak, H. Karloff
Venue: ACM SIGACT News (1989)

A F aacute;ry embedding of a planar graph G is an embedding of G into the plane, no edges crossing, with each edge embedded as a straight line segment. A set AC IR2 is said to be n-universal if every n-node planar graph has a F aacute;ry embedding into A. We show that any n-universal set has size at least 1.098n, for sufficiently large n.
Probabilistic and genetic algorithms in document retrieval
Authors: M. Gordon
Venue: Communications of the ACM (1988)

Document retrieval systems are built to provide inquirers with computerized access to relevant documents. Such systems often miss many relevant documents while falsely identifying many non-relevant documents. Here, competing document descriptions are associated with a document and altered over time by a genetic algorithm according to the queries used and relevance judgments made during retrieval.
Coverage Modeling for Dependability Analysis of Fault-Tolerant Systems
Authors: J. B. Dugan, K. S. Trivedi
Venue: IEEE Transactions on Computers (1989)

Several different models for predicting coverage in a fault-tolerant system, including models for permanent, intermittent, and transient errors, are discussed. Markov, semi-Markov, nonhomogeneous Markov, and extended stochastic Petri net models for computing coverage are developed. Two types of events that interfere with recovery are examined; and methods for modeling such events, whether they are deterministic or random, are given. The sensitivity of system reliability/availability to the coverage parameter and the sensitivity of the coverage parameter to various error-handling strategies are investigated. It is found that a policy of attempting transient recovery upon detection of an error (as opposed to automatically reconfiguring the affected component out of the system) can actually increase the unreliability of the system.
Planning and implementing an internship program for undergraduate computer science students
Authors: Ted Mims, Raymond Folse, Andrea Martin
Venue: ACM SIGCSE Bulletin (1988)

This paper describes successful efforts to implement an internship program in Computer Science. Details for planning, implementing, maintaining, and evaluating the program are presented.
Higher-dimensional Voronoi diagrams in linear expected time
Authors: R. A. Dwyer
Venue: Proceedings of the fifth annual symposium on Computational geometry (1989)

This work is the first to validate theoretically the suspicions of many researchers &mdash; that the &ldquo;average&rdquo; Voronoi diagram is combinatorially quite simple and can be constructed quickly. Specifically, assuming that dimension d is fixed, and that n input points are chosen independently from the uniform distribution on the unit d-ball, it is proved that the expected number of simplices of the dual of the Voronoi diagram is &THgr;(n) (exact constants are derived for the high-order term), and a relatively simple algorithm exists for constructing the Voronoi diagram in &THgr;(n) time. It is likely that the methods developed in the analysis will be applicable to other related quantities and other probability distributions.
An analytical cache model
Authors: A. Agarwal, J. Hennessy, M. Horowitz
Venue: ACM Transactions on Computer Systems (TOCS) (1989)

Trace-driven simulation and hardware measurement are the techniques most often used to obtain accurate performance figures for caches. The former requires a large amount of simulation time to evaluate each cache configuration while the latter is restricted to measurements of existing caches. An analytical cache model that uses parameters extracted from address traces of programs can efficiently provide estimates of cache performance and show the effects of varying cache parameters. By representing the factors that affect cache performance, we develop an analytical model that gives miss rates for a given trace as a function of cache size, degree of associativity, block size, subblock size, multiprogramming level, task switch interval, and observation interval. The predicted values closely approximate the results of trace-driven simulations, while requiring only a small fraction of the computation cost.
Information systems skills requirements: 1980 1988
Authors: O. H. Cheney
Venue: Proceedings of the ACM SIGCPR conference on Management of information systems personnel (1988)

This study reports on a follow-up survey of 31 information systems managers to determine the changes in skills requirements and projected IS manpower needs since 1980. While the original study focused only on the nation's largest organizations, the respondents in this follow-up survey are employed by organizations of varying size most of which are located in the Southeast. Data were gathered via personal interviews and questionnaires.
A parallel branch and bound algorithm for test generation
Authors: S. Patil, P. Banerjee
Venue: Proceedings of the 26th ACM/IEEE Design Automation Conference (1989)

For circuits of VLSI complexity, test generation time can be prohibitive. Most of the time is consumed by hard-to-detect (HTD) faults which might remain undetected even after a large number of backtracks. We identify the problems inherent in a uniprocessor implementation of a test generation algorithm and propose a parallel test generation algorithm which tries to achieve a high fault coverage for HTD faults in a reasonable amount of time. A dynamic search space allocation strategy is used which ensures that the search spaces allocated to different processors are disjoint. The parallel test generation algorithm has been implemented on an Intel iPSC/2 hypercube. Results are presented using the ISCAS combinational benchmark circuits which conclusively prove that parallel processing of HTD faults does indeed result in high fault coverage which is otherwise not achievable by a uniprocessor algorithm in limited CPU time. The parallel algorithm exhibits superlinear speedups in some cases due to search anomalies.
Reliability of Systems with Markov Transfer of Control, II
Authors: K. Siegrist
Venue: IEEE Transactions on Software Engineering (1988)

A software/hardware system is considered that can be decomposed into a finite number of modules. It is assumed that control of the system is transferred among the modules according to a Markov process. Each module has an associated reliability that gives the probability that the module will operate correctly when called and will transfer control successfully when finished. The measure of reliability considered is the mean number of transitions until failure, starting in a designated initial state. This measure of system reliability is studied in terms of the module reliability and the transition probabilities. Methods of predicting system reliability are obtained and special branching and sequential systems are studied.
Design of Self-Checking Sequential Machines
Authors: S. Dhawan, R. C. De Vries
Venue: IEEE Transactions on Computers (1988)

The authors present the design of self-checking sequential machines using standard memory elements, i.e. D, T, or JK flip-flops. The design approach involves cascading the three parts of a sequential machine, i.e. excitation, memory elements, and the output circuit. Parity is used to detect and transmit errors from one part to the next. The conditions for testing D, T, and JK flip-flops and for transmitting errors from their inputs to their outputs are presented; these are shown to exist in normal operation when the design procedure is used. SR flip-flops are found not to have the properties necessary for designing self-checking sequential machines.