ppxscal/embedding_network huggingface dataset:
Pattern-based fault diagnosis using neural networks
Authors: W. E. Dietz, E. L. Kiech, M. Ali
Venue: Proceedings of the 1st international conference on Industrial and engineering applications of artificial intelligence and expert systems - Volume 1 (1988)

The detection and diagnosis of faults in real time are active areas of research in knowledge-based expert systems. Several methods of diagnosis have been applied to a variety of physical systems. Rule-based approaches have been applied successfully to some domains. However, encoding knowledge in rule bases raises many difficult knowledge acquisition issues; in addition, rule-based systems are often too slow to be effectively applied in a real-time environment. More advanced diagnostic systems may incorporate a simulation of the physical system in the knowledge base. Although simulation-based expert systems can exhibit powerful capabilities, simulating the domain properly may be difficult and too computationally intensive for real-time diagnosis. An effort is underway at The University of Tennessee Space Institute to develop diagnostic expert system methodologies based on the analysis of patterns of behavior of physical mechanisms. In this approach, fault diagnosis is conceptualized as the mapping or association of patterns of input data (e.g., from instrumentation) to patterns representing one or more fault conditions. Associative memories and neural networks are being investigated as a means of storing and retrieving fault scenarios, as they offer several powerful and useful features, including 1) general mapping capabilities, 2) resistance to noisy input data, 3) the ability to be trained in a supervised learning mode, and 4) the capability of operation with incomplete input. Pattern-based fault diagnosis and detection methodologies are currently being applied to jet and rocket engines. These domains are characterized by failure scenarios which may be catastrophic, and may occur over very short time periods. A requirement of the present study is that diagnoses be performed in real time, in order to allow time for effective action to be taken prior to possible engine destruction. This paper 1) outlines an architecture for a real-time pattern-based diagnostic expert system capable of accommodating noisy, incomplete, and possibly erroneous input data, and 2) presents results from prototype systems applied to jet and rocket engine fault diagnosis.
Behavior of Edges in Scale Space
Authors: Y. Lu, R. C. Jain
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1989)

An analysis is presented of the behavior of edges in scale space for deriving rules useful in reasoning. This analysis of liner edges at different scales in images includes the mutual influence of edges and identifies at what scale neighboring edges start influencing the response of a Laplacian or Gaussian operator. Dislocation of edges, false edges, and merging of edges in the scale space are examined to formulate rules for reasoning in the scale space. The theorems, corollaries, and assertions presented can be used to recover edges, and related features, in complex images. The results reported include one lemma, three theorems, a number of corollaries and six assertions. The rigorous mathematical proofs for the theorems and corollaries are presented. These theorems and corollaries are further applied to more general situations, and the results are summarized in six assertions. A qualitative description as well as some experimental results are presented for each assertion.
High contention in a stock trading database: a case study
Authors: Peter Peinl, Andreas Reuter, Harald Sammer
Venue: ACM SIGMOD Record (1988)

Though in general, current database systems adequately support application development and operation for online transaction processing (OLTP), increasing complexity of applications and throughput requirements reveal a number of weaknesses with respect to the data model and implementation techniques used. By presenting the experiences gained from a case study of a large, high volume stock trading system, representative for a broad class of OLTP applications, it is shown, that this particularly holds for dealing with high frequency access to a small number of data elements (hot spots). As a result, we propose extended data types and several novel mechanisms, which are easy to use and highly increase the expressional power of transaction oriented programming, that effectively cope with hot spots. Moreover, their usefulness and their ability to increased parallelism is exemplified by the stock trading application.
An Error Analysis for Surface Orientation from Vanishing Points
Authors: R. S. Weiss, H. Nakatani, E. M. Riseman
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1990)

Given two parallel lines in a plane, their images formed by central projection onto the viewing plane intersect at a vanishing point, which provides a constraint on the orientation of the plane. Two such independent constraints define a vanishing line and thereby determine the orientation of the plane uniquely. In order to effectively use this information, an estimate of its accuracy must be incorporated. In the approach suggested, line directions and surface normal vectors are represented as points on a Gaussian sphere, and the error bounds are computed as regions on the sphere. Information from multiple vanishing points and surfaces is combined by intersecting the corresponding regions. In addition, constraints based on real-world knowledge can be introduced to improve the accuracy. Some experimental results on natural images re presented to illustrate this method.
Efficient interprocedural analysis for program parallelization and restructuring
Authors: Zhiyuan Li, Pen-Chung Yew
Venue: Proceedings of the ACM/SIGPLAN conference on Parallel programming: experience with applications, languages and systems (1988)

An approach to efficient interprocedural analysis for program parallelization and restructuring is presented. Such analysis is needed for parallelizing loops which contain procedure calls. Our approach captures call effect on data dependencies by propagating the precise information of array subscripts from the called procedure. This allows the optimizing compiler to choose an efficient yet precise data dependence test scheme depending on the complexity of array reference patterns. The other existing methods do not provide such flexibility, hence may suffer from either imprecision or inefficiency. The paper also discusses usage of classical summary information in several important transformations for program parallelization. Experimental results are reported.
Phoenix: a safe in-memory file system
Authors: Jason Gait
Venue: Communications of the ACM (1990)

Phoenix contains two timestamped versions of the in-memory file system allowing for a reserve version that ensures safety for diskless computers with battery-powered memeory.
Radix-16 Signed-Digit Division
Authors: Tony M. Carter, James E. Robertson
Venue: IEEE Transactions on Computers (1990)

A two-stage algorithm for fixed point, radix-16 signed-digit division is presented. The algorithm uses two limited precision radix-4 quotient digit selection stages to produce the full radix-16 quotient digit. The algorithm requires a two-digit estimate of the (initial) partial remainder and a three-digit estimate of the divisor to correctly select each successive quotient digit. The normalization of redundant signed-digit numbers requires accommodation of some fuzziness at one end of the range of numeric values that are considered normalized. A set of general equations for determining the ranges of normalized signed-digit numbers is derived. Another set of general equations for determining the precisions of estimates of the divisor and dividend are derived. These two sets of equations permit design tradeoff analyses to be made with respect to the complexity of the model division. The specific case of a two-stage radix-16 signed-digit division is presented. The staged division algorithm used can be extended to other radices as long as the signed-digital number representation used has certain properties.
Generic binary trees in APL2
Authors: N. Thomson
Venue: Conference proceedings on APL as a tool of thought (1989)

The combination of APL2 constructs and direct definition notation makes the description and implementation of complex generic types easy and natural. This paper illustrates this with an APL2 paradigm for modelling binary trees. It considers the problems of constructing trees, inserting new items, searching for items, counting leaves, counting comparisons, and testing for equivalence.
A Family of Permutations for Concurrent Factorization of Block Tridiagonal Matrices
Authors: S. Utku, M. Salama, R. J. Melosh
Venue: IEEE Transactions on Computers (1989)

The inherent strong seriality of closely coupled systems is circumvented by defining a family of permutations for reordering equation sets whose matrix of coefficients is Hermitian block tridiagonal. The authors show how these permutations can be used to achieve relatively high concurrency in the Cholesky factorization of banded systems at the expense of introducing limited extra computations due to fill-in terms in the factors. Directed graphs are developed for the concurrent factorization of the transformed matrix of coefficients by the Cholesky algorithm. Expressions for speedup and efficiency are derived in terms of parameters of the permutation, set of equations, and machine architecture.
Estimating the Reliability of Regeneration-Based Replica Control Protocols
Authors: D. D. Long, J. L. Carroll, K. Stewart
Venue: IEEE Transactions on Computers (1989)

The accessibility of vital information can be enhanced by replicating the data on several sites and employing a consistency control protocol to manage the replicas. The reliability of a replicated data object depends on maintaining a viable set of current replicas. When storage is limited, it may not be feasible to simply replicate a data object at enough sites to achieve the desired level of reliability. Regeneration approximates the reliability provided by additional replicas for a modest increase in storage costs, and is applicable whenever a new replica of a data object can be created faster than a system failure can be repaired. Regeneration enhances reliability by creating new replicas on other sites in response to site failures. Several strategies for replica maintenance are considered, and the benefits of each are analyzed using simulation and both algebraic and numeric solutions to systems of differential equations.
The responsive system: a new challenge for AI
Authors: Harold Kurstedt, Kwang Lee, Pedro Mendes, Steven Berube
Venue: Proceedings of the 1st international conference on Industrial and engineering applications of artificial intelligence and expert systems - Volume 1 (1988)

I'm developing a responsive system as an intelligent front-end for computer-based management application programs. I intend for the responsive system to observe and understand the user, and interpret and carry out the user's wishes. I use the Management System Model (MSM) to provide a conceptual background to the responsive system. I operationalize the concept of a responsive system from three approaches: observing the human world, comparing responsiveness to other terms, and representing it in the MSM. I built a prototype, called MSLTRAIN, to accomplish the operational objectives of a responsive system. I'm improving MSLTRAIN through experiments meant to extract the meaning of responsiveness and to include that meaning in the MSLTRAIN system. The philosophy of operational responsiveness is evolving through experiment based on iterative design and the critical incident tool idea. Implementing a responsive system requires lots of artificial intelligence (AI) concepts and features. The new challenge for AI is to reason out and learn responsiveness &mdash; a human trait not easily found, let alone learned.
Statement of ethics in the use of computers
Authors: CORPORATE The Catholic Univ. of America's
Venue: ACM SIGUCCS Newsletter (1989)

The provision of computing resources at The Catholic University of America requires strictly legal and ethical utilization by all users. The computing facilities of the University are limited and should be used wisely and carefully. The following list, though not covering every situation, specifies some of the responsibilities that accompany computer usage, whether it is on the central computers, the networks of which CUA is a member, or on microcomputers. All users are expected to abide by these regulations.
Providing the requisite knowledge via software documentation
Authors: J. Pinto, E. Soloway
Venue: Proceedings of the SIGCHI conference on Human factors in computing systems (1988)

Software documentation should be useful to the programmer trying to understand a program. The key in that sentence was the word should: by and large documentation has a very bad reputation. We have been working on trying to improve documentation, in order that it may realize its potential. In this case study, we examine a programmer's use of documentation constructed along some specific guidelines. These guidelines, developed from our previous studies of documentation, are intended to help programmers draw causal connections between non-contiguous portions of programming plans in the program. This documentation appears to be helpful to a particular class of programmers, i.e., those who come to a program without the requisite background knowledge.
Building an Environment Model using Depth Information
Authors: Y. Roth-Tabak, Ramesh Jain
Venue: Computer (1989)

The environment model's volumetric level, where information about free and occupied space is represented explicitly, is considered. At this model level, updating operations use raw sensory data from range sensors or processed data from any stereo or other depth recovery technique. In addition, this type of model can be used directly by path planning and navigation modules as well as for object recognition and manipulation modules. A system that uses the sensor-built model mode, in which there is initially little or no knowledge available about the domain and a model is incrementally constructed using the information provided by a sensor, is demonstrated. This mode of operation makes it possible to deal with unknown or dynamic environments.
Fault Detection in Combinational Networks by Reed-Muller Transforms
Authors: T. R. Damarla, M. Karpovsky
Venue: IEEE Transactions on Computers (1989)

A new approach for fault detection in combinational networks based on Reed-Muller (RM) transforms is presented. An upper bound on the number of RM spectral coefficients required to be verified for detection of multiple stuck-at-faults and single bridging faults at the input lines of an n-input network is shown to be n. The time complexity (time required to test a network) for detection of multiple terminal faults and the storage required for storing the test are determined. An upper bound is found for the minimum number of test patterns required to detect a fault. The authors present standard tests based on this result, with a simple test generation procedure and upper bounds on minimal numbers of test patterns.
Finding minimum-cost circulations by canceling negative cycles
Authors: Andrew V. Goldberg, Robert E. Tarjan
Venue: Journal of the ACM (JACM) (1989)

A classical algorithm for finding a minimum-cost circulation consists of repeatedly finding a residual cycle of negative cost and canceling it by pushing enough flow around the cycle to saturate an arc. We show that a judicious choice of cycles for canceling leads to a polynomial bound on the number of iterations in this algorithm. This gives a very simple strongly polynomial algorithm that uses no scaling. A variant of the algorithm that uses dynamic trees runs in &Ogr;(nm(log n)min{log(nC), m log n}) time on a network of n vertices, m arcs, and arc costs of maximum absolute value C. This bound is comparable to those of the fastest previously known algorithms.
Explicit substitutions
Authors: M. Abadi, L. Cardelli, P.-L. Curien, J.-J. Levy
Venue: Proceedings of the 17th ACM SIGPLAN-SIGACT symposium on Principles of programming languages (1989)

The &lgr;&sgr;-calculus is a refinement of the &lgr;-calculus where substitutions are manipulated explicitly. The &lgr;&sgr;-calculus provides a setting for studying the theory of substitutions, with pleasant mathematical properties. It is also a useful bridge between the classical &lgr;-calculus and concrete implementations.
Papal visit press center
Authors: William Thorn, Ann Mallinger
Venue: ACM SIGUCCS Newsletter (1988)

When Pope John Paul II visited the United States from September 10 - 19, 1987 the media scramble for information could have overwhelmed the small communication offices of the 9 host dioceses. Marquette University's VAXCluster was used to ease that bottleneck with an innovative experiment, the Papal Visit Computer Press Center.
Traffic analysis of rectangular SW-banyan networks
Authors: R. M. Jenevein, T. Mookken
Venue: ACM SIGARCH Computer Architecture News (1988)

This paper describes an algorithm to route packets in Rectangular SW-Banyans. A packet switching scheme is modelled on single and double sided SW-Banyans and the results presented. Effects of queue lengths and processor configurations on performance are studied. Prevention of deadlocks in the network is discussed.
Engineering Design of the Convex C2
Authors: Tom Jones
Venue: Computer (1989)

The Convex C220 and C240 supercomputers are a family of 64-bit multiprocessors, tightly coupled through a shared main memory. Each processor contains an integrated vector processor. All processor features, including the vector processor, are controlled by a microcoded instruction set. The system is implemented in 100 K emitter-coupled logic, with a cycle time of 40 ns. The author shows some of the real-life problems faced by the design team and relates their approach to resolving them. He begins by comparing the C2 family to its predecessor, the C1. He describes the processes of product definition and technology selection, staffing and organizing the design team, and the design tool set. He examines the problems that arose during the execution of the initial concept.
An interval-based approach to exhaustive and incremental interprocedural data-flow analysis
Authors: Michael Burke
Venue: ACM Transactions on Programming Languages and Systems (TOPLAS) (1990)

We reformulate interval analysis so that it can he applied to any monotone data-flow problem, including the nonfast problems of flow-insensitive interprocedural analysis. We then develop an incremental interval analysis technique that can be applied to the same class of problems. When applied to flow-insensitive interprocedural data-flow problems, the resulting algorithms are simple, practical, and efficient. With a single update, the incremental algorithm can accommodate any sequence of program changes that does not alter the structure of the program call graph. It can also accommodate a large class of structural changes. For alias analysis, we develop an incremental algorithm that obtains the exact solution as computed by an exhaustive algorithm. Finally, we develop a transitive closure algorithm that is particularly well suited to the very sparse matrices associated with the problems we address.
Information retrieval from hypertext: update on the dynamic medical handbook project
Authors: M. E. Frisse, S. B. Cousins
Venue: Proceedings of the second annual ACM conference on Hypertext (1989)

This paper attempts to provide a perspective from which to develop a more complete theory of information retrieval from hypertext documents. Viewing hypertexts as large information spaces, we compare two general classes of navigation methods, classes we call local and global. We argue that global methods necessitate some form of &ldquo;index space&rdquo; conceptually separate from the hypertext &ldquo;document space&rdquo;. We note that the architectures of both spaces effect the ease with which one can apply various information retrieval algorithms. We identify a number of different index space and document space architectures and we discuss some of the associated trade-offs between hypertext functionality and computational complexity. We show how some index space architectures can be exploited for enhanced information retrieval, query refinement, and automated reasoning. Through analysis of a number of prototype systems, we discuss current limitations and future potentials for various hypertext information retrieval structures.
A Performance Bound of Multistage Combining Networks
Authors: G. Lee
Venue: IEEE Transactions on Computers (1989)

A bound on the delays in multistage combining networks is developed by considering an idealized combining under hot-spot traffic. It is concluded that multistage combining networks are stable, at least in theory, under hot-spot traffic. The author discusses some problems in achieving such stability in practice.
Microprogramming a watch: tools for a course in computer organization
Authors: Pierre A. von Kaenel
Venue: ACM SIGCSE Bulletin (1988)

This paper describes a software simulator of a digital watch programmable at the microprogram level and used for instructional purposes in a computer organization course. A special editor for writing microcode is also introduced.
Non-oblivious hashing
Authors: Amos Fiat, Moni Naor, Jeanette Schmidt, Alan Siegel
Venue: Proceedings of the twentieth annual ACM symposium on Theory of computing (1988)

Non-oblivious hashing, where the information gathered by performing &ldquo;unsuccessful&rdquo; probes determines the probe strategy, is introduced and used to obtain the following results for static lookup on full tables: An &Ogr;(1) worst case scheme that requires only logarithmic additional memory (improving on the [FKS84] linear space upper bound). An almost sure &Ogr;(1) probabilistic worst case scheme, without any additional memory (improving on previous logarithmic time upper bounds). Enhancements to hashing: Solving (a) and (b) in the multikey record environment, search can be performed under any key in time &Ogr;(1); finding the nearest neighbor, the rank, etc. in logarithmic time. Our non-oblivious upper bounds are much better than the appropriate oblivious lower bounds.
The Specification and Modeling of Computer Security
Authors: John McLean
Venue: Computer (1990)

A description is given of computer security models in general and the model of D. Bell and L. LaPadula (Tech. Rep. MTR-2997, Mitre Corp., 1976) in particular. The Bell and LaPadula (BLP) model is the backbone of the National Computer Security Center's evaluation process for trusted computer systems. Although discretionary access control is briefly addressed, the focus is on mandatory access control (MAC) in national security. However, the issues addressed are relevant to any setting in which MAC-like restrictions arise. It is shown that security is a fruitful research area for those interested in software specification, since some of the most difficult issues in specifying security have analogs in other domains. The limitations of the BLP model are examined. For example, it has little relevance for systems in which users can change their own security levels or those of their files, and it is inadequate for expressing requirements that certain operations cannot be performed by a single individual working alone. It is shown how BLP's limitations can be remedied by a framework of models, making it more useful to those interested in industrial security.