ppxscal/embedding_network huggingface dataset:
Selective and Focused Invariant Recognition Using Distributed Associative Memories (DAM)
Authors: W. Pölzleitner, H. Wechsler
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1990)

A method of 2-D object recognition based on the Moore-Penrose distributed associative memory is presented. Using known relationships between DAMs and regression analysis, the selectivity of the association weights is improved in an iterative way be discarding from further consideration response vectors deemed to be insignificant. Such selectivity allow the system to focus on the significant associations and to reduce crosstalk effects. The same formalism that allows the significance of the association weights to be computed also provides for a reject option. Experiments incorporating the proposed method onto an invariant recognition system prove the feasibility and benefits of the recognition scheme.
The heuristic arilaunch trainer
Authors: James V. Leonard, Angela K. Scharf, George W. Zobrist
Venue: Proceedings of the 21st annual symposium on Simulation (1988)

When the United States Navy introduced the Harpoon Anti-Ship Missile to the VP squadrons, handling and positional training was provided. Not in the package was a means of providing positive feedback type training to the Airlaunch Officer. Methods existed to simulate the Harpoon flight trajectory. The P-3C mission computer has a data extract feature which records hundreds of time correlatable flight and geographic/metric parameters. The Heuristic Airlaunch trainer takes all these existing features and puts them together to provide a training concept that, thru simulation, provides positive feedback to the Harpoon Airlaunch Officer.
Boundary Detection by Constrained Optimization
Authors: D. Geman, S. Geman, C. Graffigne, P. Dong
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1990)

A statistical framework is used for finding boundaries and for partitioning scenes into homogeneous regions. The model is a joint probability distribution for the array of pixel gray levels and an array of labels. In boundary finding, the labels are binary, zero, or one, representing the absence or presence of boundary elements. In partitioning, the label values are generic: two labels are the same when the corresponding scene locations are considered to belong to the same region. The distribution incorporates a measure of disparity between certain spatial features of block pairs of pixel gray levels, using the Kolmogorov-Smirnov nonparametric measures of difference between the distributions of these features. The number of model parameters is minimized by forbidding label configurations, which are assigned probability zero. The maximum a posteriori estimator of boundary placements and partitionings is examined. The forbidden states introduce constraints into the calculation of these configurations. Stochastic relaxation methods are extended to accommodate constrained optimization.
A Systematic (12,8) Code for Correcting Single Errors and Detecting Adjacent Errors
Authors: Jay W. Schwartz, Jack Keil Wolf
Venue: IEEE Transactions on Computers (1990)

A parity check matrix is given for a systematic (12,8) binary code which connects all single errors and detects eight of the nine double adjacent errors within any of the three 4-b nibbles. It is shown that no (12,8) binary systematic parity check code can correct all 12 single errors and simultaneously detect all nine double adjacent errors within 4-b nibbles. A (12,8) binary systematic parity check code is given that corrects all 12 single errors and simultaneously detects eight of the nine double adjacent errors within 4-b nibbles.
Polychannel systems for mass digital communications
Authors: David K. Gifford
Venue: Communications of the ACM (1990)

A new type of distributed computer system looks toward the time when computers will be used by everyone everywhere.
Automatic Recognition of Intermittent Failures: An Experimental Study of Field Data
Authors: Ravishankar K. Iyer, Luke T. Young
Venue: IEEE Transactions on Computers (1990)

A methodology is proposed for recognizing the symptoms of persistent problems in large systems. The system error rate is used to identify the error states among which relationships may exist. Statistical techniques are used to validate and quantify the strength of the relationship among these error states. As input, the approach takes the raw error logs containing a single entry for each error that is detected as an isolated event. As output, it produces a list of symptoms that characterize persistent errors. Thus, given a failure, it is determined whether the failure is an intermittent manifestation of a common fault or whether it is an isolated (transient) incident. The technique is shown to work on two CYBER systems and on IBM 3081 multiprocessor system. Comparisons to real failure/repair information obtained from field engineers show that, in about 85% of the cases, the error symptoms recognized by this approach correspond to real problems. The remaining 15% of the cases, although not directly supported by field data, are confirmed as being valid problems.
Using expert systems components to enhance reliability analysis tools
Authors: William B. Frakes, D. H. Myers
Venue: Proceedings of the 1st international conference on Industrial and engineering applications of artificial intelligence and expert systems - Volume 1 (1988)

In this paper we discuss the use of expert system components to enhance reliability analysis software tools. The discussion focuses on two expert systems built to enhance STAR and SUPER, reliability analysis tools developed at AT T Bell Laboratories. STAR is used to select a model to fit life data. SUPER is used to model system reliability. The expert components were developed using AVIEN, an expert system development tool that allows easy integration of expert system components into C based software.
The revised ARPANET routing metric
Authors: A. Khanna, J. Zinky
Venue: ACM SIGCOMM Computer Communication Review (1989)

The ARPANET routing metric was revised in July 1987, resulting in substantial performance improvements, especially in terms of user delay and effective network capacity. These revisions only affect the individual link costs (or metrics) on which the PSN (packet switching node) bases its routing decisions. They do not affect the SPF (&ldquo;shortest path first&rdquo;) algorithm employed to compute routes (installed in May 1979). The previous link metric was packet delay averaged over a ten second interval, which performed effectively under light-to-moderate traffic conditions. However, in heavily loaded networks it led to routing instabilities and wasted link and processor bandwidth. The revised metric constitutes a move away from the strict delay metric: it acts similar to a delay-based metric under lightly loads and to a capacity-based metric under heavy loads. It will not always result in shortest-delay paths. Since the delay metric produced shortest-delay paths only under conditions of light loading, the revised metric involves giving up the guarantee of shortest-delay paths under light traffic conditions for the sake of vastly improved performance under heavy traffic conditions.
Solving symbolic equations with PRESS
Authors: Leon Sterling, Alan Bundy, Lawrence Byrd, Richard O'Keefe, Bernard Silver
Venue: Journal of Symbolic Computation (1989)

We describe a program, PRESS, (PRolog Equation Solving System) for solving symbolic, transcendental, non-differential equations in one or more variables. PRESS solves autonomously, i.e. without guidance from the user. The methods used for solving equations are described, together with the service facilities. The principal technique, metal-level inference, appears to be relevant to the broader field of symbolic and algebraic manipulation.
Sorting n Objects with a k-Sorter
Authors: R. Beigel, J. Gill
Venue: IEEE Transactions on Computers (1990)

A k-sorter is a device that sorts k objects in unit time. The complexity of an algorithm that uses a k-sorter is defined as the number of applications of the k-sorter. In this measure, the complexity of sorting n objects is between n log n/k log k and 4n log n/k log k, up to first-order terms in n and k.
A module generator for optimized CMOS buffers
Authors: A. J. Al-Khalili
Venue: Proceedings of the 26th ACM/IEEE Design Automation Conference (1989)

A module generator for CMOS buffers have been written in C. The generator optimizes buffer design with respect to a user specified objective function both in terms of performance and layout. Speed, area, power consumption, power-delay, AT and AT2 are selectively optimized before the layout is produced. Such layout is generated in various configurations depending on load size. Technology file is easily updatable.
Full text indexing based on lexical relations an application: software libraries
Authors: Y. S. Maarek, F. Z. Smadja
Venue: ACM SIGIR Forum (1989)

In contrast to other kinds of libraries, software libraries need to be conceptually organized. When looking for a component, the main concern of users is the functionality of the desired component; implementation details are secondary. Software reuse would be enhanced with conceptually organized large libraries of software components. In this paper, we present GURU, a tool that allows automatical building of such large software libraries from documented software components. We focus here on GURU's indexing component which extracts conceptual attributes from natural language documentation. This indexing method is based on words' co-occurrences. It first uses EXTRACT, a co-occurrence knowledge compiler for extracting potential attributes from textual documents. Conceptually relevant collocations are then selected according to their resolving power, which scales down the noise due to context words. This fully automated indexing tool thus goes further than keyword-based tools in the understanding of a document without the brittleness of knowledge based tools. The indexing component of GURU is fully implemented, and some results are given in the paper.
Solving systems of algebraic equations by a general elimination method
Authors: Hidetsune Kobayashi, Tetsuro Fujise, Akio Furukawas
Venue: Journal of Symbolic Computation (1988)

A method of factorisation of a U-resultant into linear factors is given. Using this method we can obtain solutions and their multiplicities of a system of algebraic equations, provided the system of algebraic equations has finitely many solutions. We directly calculate a matrix A which gives all solutions of the system by using a Grobner basis of the ideal generated by the polynomials of the system of algebraic equations.
A flexible VLSI core for an adaptable architecture
Authors: H. Mulder, P. Stravers
Venue: Proceedings of the 22nd annual workshop on Microprogramming and microarchitecture (1989)

Two major limitations concerning the design of cost-effective application-specific architectures are the recurrent costs of system-software development and hardware implementation, in particular VLSI implementation, for each architecture. The SCalable ARChitecture Experiment (SCARCE) aims to provide a framework for application-specific processor design. The framework allows scaling of functionality, implementation complexity, and performance. The SCARCE framework consists and will consist of: an architecture framework defining the constraints for the design of application-specific architectures; tools for synthesizing architectures from application or application-area; VLSI cell libraries and tools for quick generation of application-specific processors; a system-software platform which can be retargeted quickly to fit the application-specific architecture; This paper concentrates on the micro-architecture framework of SCARCE and outlines the process of generating VLSI processors.
CC-modula: a modula-2 tool to teach concurrent programming
Authors: R. Morales-Fernandez, J. J. Moreno-Navarro
Venue: ACM SIGCSE Bulletin (1989)

The present work shows an educational experience at University level in the field of concurrent programming. CC-Modula, a tool to teach concurrent programming using a single language, is presented. It could also be considered as a contribution to the development of methods to implement concurrent mechanisms, in the frame of centralized and distributed operating systems.CC-Modula is a Modula-2 package that allows the use of the best known abstract mechanisms of concurrency. CC-Modula handles parallelism between processes and contains mechanisms to synchronize them. Mechanisms based on shared storage as well as mechanisms based on message passing that implement the CSP schema are included.
A Ray tracing algorithm for progressive radiosity
Authors: J. R. Wallace, K. A. Elmquist, E. A. Haines
Venue: ACM SIGGRAPH Computer Graphics (1989)

A new method for computing form-factors within a progressive radiosity approach is presented. Previously, the progressive radiosity approach has depended on the use of the hemi-cube algorithm to determine form-factors. However, sampling problems inherent in the hemi-cube algorithm limit its usefulness for complex images. A more robust approach is described in which ray tracing is used to perform the numerical integration of the form-factor equation. The approach is tailored to provide good, approximate results for a low number of rays, while still providing a smooth continuum of increasing accuracy for higher numbers of rays. Quantitative comparisons between analytically derived form-factors and ray traced form-factors are presented.
Can the field of MIS be disciplined?
Authors: Claude Banville, Maurice Landry
Venue: Communications of the ACM (1989)

Preoccupations about the present and future evolution of MIS as a scientific field seem to be gaining popularity among researchers. The authors contend that most models used by the investigators of the MIS field have been based on an inappropriate monistic view of science.
Manipulation of structured values in object-oriented databases
Authors: C. Lécluse, P. Richard
Venue: Proceedings of the second international workshop on Database programming languages (1989)

We define a query algebra for object-oriented databases that fully supports abstract data types and object identity while providing associative access to objects, including a join capability that respects the discipline of data abstraction. The structure of the algebra and the abstract access to objects offer opportunities for query optimization. The algebraic operations take an abstract view of objects and access typed collections of objects only through the public interface defined for the type. The algebra supports access to relationships implied by the structure of the objects, ai well as the definition and creation of new relationships between objects. We introduce two notions of object equality to support the creation of new objects by the algebraic operations.
Regular attribute grammars and finite state machines
Authors: N. P. Chapman
Venue: ACM SIGPLAN Notices (1989)

A regular attribute grammar is an attribute grammar with an underlying context-free grammar which is right or left linear. The restriction to regular underlying grammars restricts the possible dependencies between attributes; this in turn permits efficient algorithms for attribute evaluation. An algorithm for performing attribute evaluation in parallel with a single scan of the input by a deterministic finite state machine is developed. Special cases of regular attribute grammars for which the algorithm uses very little space are identified. Several examples are included.
Simulation and analysis of a pipeline processor
Authors: P. G. Emma, J. W. Knight, J. H. Pomerence, T. R. Puzak, R. N. Rechtschaffen
Venue: Proceedings of the 21st conference on Winter simulation (1989)

In this paper we describe a software simulator (a timer) that is used to model a wide range of pipeline processors. A set of performance equations is developed that allow a user to separate the performance of a processor into its infinite-cache and finite-cache performance values. We then use the timer to study the performance of two different machine organizations. Performance curves are presented that help a user compare the performance of each organization (in terms of MIPS and cycles per instruction) to the cycle time chosen to implement the design.
Modeling the effects of instruction queue loading on a static instruction stream micro-architecture
Authors: J. H. Jacobs, A. K. Uht, R. C. Ord
Venue: Proceedings of the 21st annual workshop on Microprogramming and microarchitecture (1988)

Increased processor performance requires the exploitation of the parallelism that exists within the instruction stream and within the processor itself: A static instruction stream micro-architecture, CONDEL, extracts and uses the machine instruction level concurrency implicit in the instruction stream. A major source of intraprocessor parallelism is the overlap of instruction execution with instruction loading. The effect of several methods of utilizing the execution/loading parallelism within the static instruction stream machine are studied: pipelining, buffered pipelining, branch buffering and instruction load limiting. The results of incorporating the different methods into the micro-architecture are shown. In addition, the results provide a more realistic performance comparison with conventional machine designs than the upper limits presented in previous work.
Facilitating the development of representations in hypertext with IDE
Authors: D. S. Jordan, D. M. Russell, A.-M. S. Jensen, R. A. Rogers
Venue: Proceedings of the second annual ACM conference on Hypertext (1989)

Hypertext systems are used for a variety of representational tasks, many that involve fairly formalized structures. Because hypertext systems are generally intended for developing informal (unstructured data) and semi-formal (semantic networks) structures, developing more formal structures can be difficult. Regular patterns in structures must often be recreated from primitive elements (individual nodes and links) resulting in a high overhead cost. In this paper we describe the Instructional Design Environment, or IDE, a hypertext system application that facilitates the rapid and accurate creation of regular network patterns in hypertext. IDE focuses on the task of instructional design, but its facilities are general and useful to many representation tasks. IDE features structure accelerators that provide simple menu interfaces to (1) define network structures out of patterns of typed node and link connections, (2) create new node types that contain structured content, and (3) tailor the interface for creating cards, links and structures to focus attention during different stages of the representation task. These mechanisms allow the user to tailor the hypertext environment to better meet his or her representational needs. We also report on the field use of IDE by instructional designers.
APL as a tool for computations in growth studies
Authors: T. Nummi
Venue: Conference proceedings on APL as a tool of thought (1989)

The aim of this paper is to introduce some computational ideas for carrying out the multivariate growth curve analysis. In longitudinal studies missing data is often involved. Therefore handling of incomplete data is an important part of the analysis. Here we introduce a technique for estimating growth curve parameters based on the least squares approach. It was shown that many computational problems in growth curve analysis can be solved easily using APL.
Building a backtracking facility in smalltalk without kernel support
Authors: Wilf R. LaLonde, Mark Van Gulik
Venue: Conference proceedings on Object-oriented programming systems, languages and applications (1988)

Languages like Snobol, Prolog, and Icon were designed with backtracking facilities from the outset and these facilities are deeply intertwined with the implementation. Retrofitting a backtracking facility in a language that wasn't designed for it has never been achieved. We report on an experiment to retrofit Smalltalk with a backtracking facility. The facility is provided through a small number of primitives written in the language (no modifications to the kernel were made). The ability to do this is a direct result of the power provided by the objectification of contexts.
Edward Reid:some comments on Fortran 8X
Authors: Edward Reid
Venue: ACM SIGPLAN Fortran Forum (1989)

During the public review period on Fortran 8X, I submitted rather extensive comments (totalling about 31 pages) which are obviously too long for full publication in Fortran Forum. I have summarized some parts of the comments that may be of interest to Forum readers.
A logic for object-oriented logic programming
Authors: M. Kifer, J. Wu
Venue: Proceedings of the eighth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems (1989)

We present a logic for reasoning about complex objects, which is a revised and significantly extended version of Maier's O-logic [Mai86]. The logic naturally supports complex objects, object identity, deduction, is tolerant to inconsistent data, and has many other interesting features. It elegantly combines the object-oriented and value-oriented paradigms and, in particular, contains all of the predicate calculus as a special case. Our treatment of sets is also noteworthy: it is more general than ELPS [Kup87] and COL [AbG87], yet it avoids the semantic problems encountered in LDL [BNS87]. The proposed logic has a sound and complete resolution-based proof procedure.
Efficient distributed event-driven simulations of multiple-loop networks
Authors: B. D. Lubachevsky
Venue: Communications of the ACM (1989)

Simulating asynchronous multiple-loop networks is commonly considered a difficult task for parallel programming. Two examples of asynchronous multiple-loop networks are presented in this article: a stylized queuing system and an Ising model. In both cases, the network is an n &times; n grid on a torus and includes at least an order of n2 feedback loops. A new distributed simulation algorithm is demonstrated on these two examples. The algorithm combines three elements: (1) the bounded lag restriction; (2) minimum propagation delays; and (3) the so-called opaque periods. We prove that if N processing elements (PEs) execute the algorithm in parallel and the simulated system exhibits sufficient density of events, then, on average, processing one event would require O(log N) instructions of one PE. Experiments on a shared memory MIMD bus computer (Sequent's Balance) and on a SIMD computer (Connection Machine) show speed-ups greater than 16 on 25 PEs of a Balance and greater than1900 on 214 PEs of a Connection Machine.
Program plagiarism revisited: current issues and approaches
Authors: Marguerite K. Summers, William B. Evans, James J. Fletcher, Cindy Hanchey, Leslie J. Waguespack
Venue: ACM SIGCSE Bulletin (1988)

Since the first courses were offered in programming, plagiarism has been a perplexing problem. Detection techniques, administrative procedures, and penalties vary greatly. Instructors face an increasingly legalistic system when prosecuting plagiarism cases. Panel members will discuss the prevention, detection, and prosecution aspects of program plagiarism and will present legal and administrative views of the problem.