ppxscal/embedding_network huggingface dataset:
XVISION: a comprehensive software system for image processing research, education, and applications
Authors: Marcelo Teran, John Rasure, Danielle Argiro, Stephanie Hallett, Ron Neher, Mark Young, Scott Wilson
Venue: Proceedings of the 1st annual ACM SIGGRAPH symposium on User Interface Software (1988)

XVision is a software system for image processing research, education and applications. Xyvision utilizes the X Window System Version 11, which provides a network transparent windowing environment and software portability. Xyvision is designed to facilitate: data and algorithm exchange of new computer vision/image processing techniques, image processing training and education, development of turn key vision solutions for various application areas (automation, medicine, biology, astronomy, etc). XVision is a comprehensive system because it supports generation of new programs (extendibility), and integration, maintenance, modification and documentation of existing programs; and it includes: three user interfaces; a menuing system, a quick command line interface that can be customized and a standardized UNIX&Dagger;-like command line interface. A visual programming language, xvglyph, is under development. tutorials, manual pages, experiments, automated demonstrations and other supplemental documentation. an image processing library written in C, interactive image display and enhancement, image editing and creation, 2D, 3D, and contour plotting, and data creation/display via user specified functions. The Xyvision project started in February of 1987 with its first release in August of 1987. This paper describes the second version which incorporates changes suggested by many of the users (over 30 different institutions) of Xyvision Version 1.0 [1]. One of the most important design goals of the Xyvision project is to provide for easy growth and extendibility. This has been accomplished by clearly defining software levels, software systems and their standard interfaces, and by providing programming tools and a variety of user interfaces for the Xyvision user/maintainer.
An expert system for diagnosis and maintaining the AT T 3B4000 computer: an architectural description
Authors: James A. Kavicky, George D. Kraft
Venue: Proceedings of the 2nd international conference on Industrial and engineering applications of artificial intelligence and expert systems - Volume 1 (1989)

Major computer vendors have concentrated on enhancing diagnostic and maintainability aspects of their computer systems to permit a prompt repair interval with a minimal amount of technical support interaction. This paper proposes an architectural description for an automated diagnostic and recovery expert system. The authors obtained sufficient domain knowledge of both the AT T 3B4000 Computer and the AT T technical support organization and chose the 3B4000 Computer as a vehicle for the research concepts presented. The architectural description presents a concept based on the information provided by AT T and does not necessarily reflect actual implementation plans within AT T.The expert system would be capable of intercepting on-line and off-line messages generated on the 3B4000 Computer. Captured messages would be used by the expert system to define recovery actions that would be automatically or manually executed. The recovery mechanism first references on-line general and technical documents. In addition, various established support data bases and an expert knowledge base are referenced. The combination of documented information and expert knowledge guide the recovery mechanism toward a solution set tailored to correct system errors. This multi-level depth reasoning approach expedites expert system deployment by utilizing established information first, while knowledge-base rules and facts are added in parallel to enhance diagnostic and recovery accurary. The same knowledge and data facilities also would be available to system administration and field support personnel for either accessing user documentation and expert knowledge, or updating documented information and/or expanding knowledge base rules.
Automatic generation of test scripts from formal test specifications
Authors: M. Balcer, W. Hasling, T. Ostrand
Venue: ACM SIGSOFT Software Engineering Notes (1989)

TSL is a language for writing formal test specifications of the functions of a software system. The test specifications are compiled into executable test scripts that establish test environments, assign values to input variables, perform necessary setup and cleanup operations, run the test cases, and check the correctness of test results. TSL is a working system that has been used to test commercial software in a production environment.
Finding Idle Machines in a Workstation-Based Distributed System
Authors: M. M. Theimer, K. A. Lantz
Venue: IEEE Transactions on Software Engineering (1989)

The authors describe the design and performance of scheduling facilities for finding idle hosts in a workstation-based distributed system. They focus on the tradeoffs between centralized and decentralized architectures with respect to scalability, fault tolerance, and simplicity of design, as well as several implementation issues of interest when multicast communication is used. They conclude that the principal tradeoff between the two approaches is that a centralized architecture can be scaled to a significantly greater degree and can more easily monitor global system statistics whereas a decentralized architecture is simpler to implement.
Using histories to implement atomic objects
Authors: Tony P. Ng
Venue: ACM Transactions on Computer Systems (TOCS) (1989)

In this paper we describe an approach to implementing atomicity. Atomicity requires that computations appear to be all-or-nothing and executed in a serialization order. The approach we describe has three characteristics. First, it utilizes the semantics of an application to improve concurrency. Second, it reduces the complexity of application-dependent synchronization code by analyzing the process of writing it. Third, our approach hides the protocol used to arrive at a serialization order from the applications. As a result, different protocols can be used without affecting the applications. Our approach uses a history abstraction. The history captures the ordering relationship among concurrent computations. By determining what types of computations exist in the history and their parameters, a computation can determine whether it can proceed.
A utility-theoretic analysis of expected search length
Authors: P. Bollmann, V. V. Raghavan
Venue: Proceedings of the 11th annual international ACM SIGIR conference on Research and development in information retrieval (1988)

In this paper the expected search length, which is a measure of retrieval system performance, is investigated from the viewpoint of axiomatic utility theory. Necessary and sufficient criteria for the expected search length to be an ordinal scale and sufficient criteria that it is a ratio scale are given.
On laziness and optimality in lambda interpreters: tools for specification and analysis
Authors: John Field
Venue: Proceedings of the 17th ACM SIGPLAN-SIGACT symposium on Principles of programming languages (1989)

In this paper, I introduce a new formal system, ACCL, based on Curien's Categorical Combinators [Cur86a]. I show that ACCL has properties not possessed by Curien's original combinators that make it particularly appropriate as the basis for implementation and analysis of a wide range of reduction schemes using shared environments, closures, or &lgr;-terms. As an example of the practical utility of this formalism, I use it to specify a simple lazy interpreter for the &lgr;-calculus, whose correctness follows trivially from the properties of ACCL. I then describe a labeled variant of ACCL, ACCLL, which can be used as a tool to determine the degree of &ldquo;laziness&rdquo; possessed by various &lgr;-reduction schemes. In particular, ACCLL is applied to the problem of optimal reduction in the &lgr;-calculus. A reduction scheme for the &lgr;-calculus is optimal if the number of redex contractions that must be performed in the course of reducing any &lgr;-term to a normal form (if one exists) is guaranteed to be minimal. Results of L&eacute;vy [L&eacute;v78,L&eacute;v80] showed that for a natural class of reduction strategies allowing shared redexes, optimal reductions were, at least in principle, possible. He conjectured that an optimal reduction strategy might be realized in practice using shared closures and environments as well as shared &lgr;-terms. I show, however, using ACCLL, a practical optimal reduction scheme for arbitrary &lgr;-terms using only shared environments, closures, or terms is unlikely to exist.
Teaching recursion using fractals in Prolog
Authors: Bruce S. Elenbogen, Martha R. O'Kennon
Venue: ACM SIGCSE Bulletin (1988)

Recursion has traditionally been a difficult concept for students to understand, both as a control structure and as an analytical tool. This paper explores recursion using Prolog (whose predominate control structure is recursion) and through fractals which possess a visually recursive form. We discuss several simple Turbo Prolog programs which demonstrate recursion graphically and whose resultant figures are fractals whose recursive nature is particularly easy to analyze in the Turbo Prolog environment.
An algorithm based on queue migration for mutual exclusion in computer networks
Authors: J. Place
Venue: Proceedings of the 17th conference on ACM Annual Computer Science Conference (1989)

A non-symmetric algorithm is presented that achieves mutual exclusion in a decentralized computer network by exchanging messages and a synchronization queue. The algorithm is unique in the sense that the number of messages required to achieve mutual exclusion is a function of the workload enabling it to provide acceptable performance in a lightly loaded system with a significant improvement as the workload increases. The algorithm outperforms other previously proposed algorithms in a heavily loaded system, is robust and comparatively easy to implement.
A paradigm for building diagnostic expert systems by specializing generic device and reasoning models
Authors: Martin Hofmann, Glen Collins, Juan Vargas, John Bourne, A. Brodersen
Venue: Proceedings of the 1st international conference on Industrial and engineering applications of artificial intelligence and expert systems - Volume 1 (1988)

This paper describes a generic schematic knowledge representation, acquisition, and manipulation system (SKRAM) applied to diagnostic problem solving in analog circuits. SKRAM is a general purpose declarative, schema-oriented system composed of five layers: (1) an object-oriented implementation layer, (2) a logical layer defining object features, i.e., relations and attributes, (3) an epistemological layer at which schemata are introduced as knowledge packages, (4) a semantic or conceptual layer where meaning is attached to schemata by defining an interpretation mechanism, and (5) a domain layer containing objects and schemata which represent knowledge of the application domain. SKRAM supports the acquisition and maintenance of general and specific knowledge and constructs models of the entities in the application domain, e.g., models of the structure and function of electronic circuits. An example of the use of the declarative representation in the domain of analog circuits is given and the architecture is contrasted with other architectures in similar and related domains.
Syntactic closures
Authors: Alan Bawden, Jonathan Rees
Venue: Proceedings of the 1988 ACM conference on LISP and functional programming (1988)

In this paper we describe syntactic closures. Syntactic closures address the scoping problems that arise when writing macros. We discuss some issues raised by introducing syntactic closures into the macro expansion interface, and we compare syntactic closures with other approaches. Included is a complete implementation.
GAMMON: A Load Balancing Strategy for Local Computer Systems with Multiaccess Networks
Authors: K. M. Baumgartner, B. W. Wah
Venue: IEEE Transactions on Computers (1989)

The authors present an efficient load balancing strategy, GAMMON (global allocation from maximum to minimum in constant time), for distributed computing systems connected by multiaccess local area networks. The broadcast capability of these networks is utilized to implement an identification procedure at the applications level for the maximally and the minimally loaded processors. The search technique has an average overhead which is independent of the number of participating stations. An implementation of GAMMON on a network of Sun workstations is described. Its performance is found to be better than that of other known methods.
A Spectral Lower Bound Technique for the Size of Decision Trees and Two-Level AND/OR Circuits
Authors: Y. Brandman, A. Orlitsky, J. Hennessy
Venue: IEEE Transactions on Computers (1990)

A universal lower-bound technique for the size and other implementation characteristics of an arbitrary Boolean function as a decision tree and as a two-level AND/OR circuit is derived. The technique is based on the power spectrum coefficients of the n dimensional Fourier transform of the function. The bounds vary from constant to exponential and are tight in many cases. Several examples are presented.
DYNAJUST: an efficient automatic routing technique optimizing delay conditions
Authors: Y. Fujihara, Y. Sekiyama, Y. Ishibashi, M. Yanaka
Venue: Proceedings of the 26th ACM/IEEE Design Automation Conference (1989)

A new routing technique DYNAJUST, Dynamic Wire Length Adjustment, is described. It accurately realizes specified wire lengths to fulfill delay conditions. The implementation, based on the combination of shortest path algorithms, is proposed to achieve a high completion ratio in a short processing time. The technique is useful in practical situations where high accuracy is required of many nets.
Systolic Gaussian Elimination Over GF(p) with Partial Pivoting
Authors: B. Hochet, P. Quintin, Y. Robert
Venue: IEEE Transactions on Computers (1989)

A systolic architecture is proposed for the triangularization by means of the Gaussian elimination algorithm of large dense n*n matrices over GF(p), where p is a prime number. The solution of large dense linear systems over GF(p) is the major computational step in various algorithms issuing from arithmetic number theory and computer algebra. The proposed architecture implements the elimination with partial pivoting, although the operation of the array remains purely systolic. Extension of the array to the complete solution of a linear system Ax=b over GF(p) is also considered.
Business planning in technical documentation organizations
Authors: D. Mongeau
Venue: Proceedings of the 7th annual international conference on Systems documentation (1989)

Business planning is a process of deciding what an organization will do to be successful, and how it will do it. Business planning can benefit any organization that wants to control its future and to succeed. However, a literature review and some practical experience at AT T Bell Laboratories suggests that technical documentation organizations have virtually ignored the application of business planning, both as a means of creating their futures and as a means of advancing their profession. The business planning process involves creating an organizational mission; diagnosing the organization's strengths, weaknesses, opportunities, and risks; setting goals; developing objectives and action plans; developing a financial plan; and writing, sharing, and implementing the plan. Following these steps in the Bell Labs Publication Center, we have seen our budget and staff grow and our client base diversify.
A simple bounded disorder file organization with good performance
Authors: David B. Lomet
Venue: ACM Transactions on Database Systems (TODS) (1988)

A bounded-disorder (BD) file is one in which data are organized into nodes that are indexed, e.g., by means of a B-tree. The data nodes are multibucket nodes that are accessed by hashing. In this paper we present two important improvements to the BD organization as originally described. First, records in a data node that overflow their designated primary bucket are stored in a single overflow bucket which is itself a bucket of the data node. Second, when file space needs to be increased, partial expansions are used that employ elastic buckets. Analysis and simulation results demonstrate that this variant of the BD organization has utilization, random access performance, and file growth performance that can be competitive with good extendible hashing methods, while supporting high-performance sequential access. The simplicity of the organization results in simple algorithms for realizing the organization.
Utilization as a dependent variable in MIS research
Authors: Andrew W. Trice, Michael E. Treacy
Venue: ACM SIGMIS Database (1988)

Utilization of an information system is an important and frequently measured is the conduit through which informationtechnology can affect performance. This paper addresses measurement issues associated with utilization variables. The discussion is motivated by a review of the literature and an examination of four relevant reference theories. It is asserted that utilization can be measured effectively if the measures chosen correspond to the measures suggested by an appropriate reference theory.
Computing Euclidean maximum spanning trees
Authors: C. Monma, M. Paterson, S. Suri, F. Yao
Venue: Proceedings of the fourth annual symposium on Computational geometry (1988)

An algorithm is presented for finding a maximum-weight spanning tree of a set of n points in the Euclidean plane, where the weight of an edge (pi, pj) equals the Euclidean distance between the points pi and pj. The algorithm runs in time &Ogr; (n logn) and requires &Ogr; (n) space. If the points are vertices of a convex polygon (given in order along the boundary), then our algorithm requires only a linear amount of time and space. These bounds are the best possible in the algebraic computation-tree model. We also establish various properties of maximum spanning trees that can be exploited to solve other geometric problems.
Petri-Net-Based Modeling and Evaluation of Pipelined Processing of Concurrent Database Queries
Authors: K. P. Mikkilineni, Y. C. Chow, S. Y. W. Su
Venue: IEEE Transactions on Software Engineering (1988)

A description is given of a Petri-net-based methodology for modeling and evaluation of pipelined processing of concurrent database queries in an integrated data network (IDN). An extended Petri-net model is presented and used to model two key approaches to concurrent database query processing in the IDN, namely, pipelined and data-flow-based execution of queries and intermediate data sharing among concurrent queries. Database operations are categorized, and the models for the data flow and control flow in them are presented. A general-purpose Petri-net simulator has been developed using event-driven programming techniques and used to simulate the execution of the Petri-net models of some test queries. The results validate the results of a previous analytical evaluation in which the advantages of pipeline and intermediate data sharing were established. Since all the essential details of query processing in the IDN have been simulated, the results of this simulation study are believed to present closely the workings of the actual system.
Modeling data for the summary database
Authors: Richard J. Orli
Venue: ACM SIGMIS Database (1990)

Summarization abstracts information and so reduces flexibility. The challenge of summary database design is providing adequately flexible information to meet the needs of the business process it serves. This article addresses this challenge by examining the basic forms of summarization as a set of model record forms, each with advantages and disadvantages. The function of information implied by these forms is described in terms of the business process model. This model is the basis of a proposed data scheme that organizes information "top-down" into the core of a flexible, effective, summary database design.
Parallel architecture for OPS5
Authors: P. L. Butler, J. D. Allen,  Jr., D. W. Bouldin
Venue: Proceedings of the 15th Annual International Symposium on Computer architecture (1988)

An architecture that captures some of the inherent parallelism of the OPS5 expert system language has been designed and implemented at Oak Ridge National Laboratory. A central feature of this architecture is a network bus over which a single host processor broadcasts messages to a set of parallel rule processors. This transmit-only bus is implemented by a memory-mapped scheme which permits the rule processors to be decoded in parallel. All OPS5 rule matching processes and most of the processes associated with conflict resolution are executed by the parallel rule processors. The host performs the tasks associated with the firing of a rule selected by the conflict resolution process. Performance data are presented for the prototype system which comprises a host processor and 64 parallel rule processors, each embodying a Motorola MC68000 microprocessor and 512 Kbytes of unshared memory.
Reusable motion synthesis using state-space controllers
Authors: Michiel van de Panne, Eugene Fiume, Zvonko Vranesic
Venue: Proceedings of the 17th annual conference on Computer graphics and interactive techniques (1990)

The use of physically-based techniques for computer animation can result in realistic object motion. The price paid for physically-based motion synthesis lies in increased computation and information requirements.1 We introduce a new approach to realistic motion specification based on state-space controllers. A user specifies a motion by defining a goal in terms of a set of destination states. A state-space controller is then constructed, which provides an optimal-control solution that guides the object from an arbitrary starting configuration to a goal. Motions are optimized with respect to time and control energy. Becasue controllers are specified in terms of destination states only, it is easy to reuse the same controller to produce different motions (from different starting states), or to create a complex sequence of motions by concatenating several controllers. An implementation of state-space controllers is presented, in which realistic motions can be produced in real time. Several examples will be considered.
Automatic production of controller specifications from control and timing behavioral descriptions
Authors: S. Hayati, A. Parker
Venue: Proceedings of the 26th ACM/IEEE Design Automation Conference (1989)

This paper presents a method for the generation of controller specifications from high-level behavioral descriptions in control and timing graph form. Input descriptions may contain multiple timing constraints, asynchronous and synchronous inputs, data dependent internal loops, and parallel and conditional branches. The timing graph model is transformed automatically to a state table specification of a synchronous finite state machine. The specification method is effective not only for independent data processors, but also for processors constrained by interface requirements and performing I/O protocol translation. The method has been programmed and tested on selected examples. Results from one example are given along with a comparison with results on the same example from another system.