ppxscal/embedding_network huggingface dataset:
The design of an automated assistant for acquiring strategic knowledge
Authors: T. Gruber, P. Cohen
Venue: Issue 108 (April 1989) (1989)

Knowledge acquisition is the transfer and transformation of expertise from knowledge sources in the world (mainly people) into a form that can be executed by a knowledge-based system to perform an expert task. It is widely acknowledged that the knowledge acquisition problem is a significant barrier to the development of knowledge-based systems. The research reported here focuses on the problem of acquiring strategic knowledge: knowledge used by an agent to decide what action to perform next, where the actions are external events that effect both what is believed by the agent and the state of the world.
An extended frame language
Authors: F. P. Block, N. C. Chan
Venue: Conference proceedings on Object-oriented programming systems, languages and applications (1989)

This paper describes several extensions to the traditional frame based programming semantics. We generalize the treatment of slots to include frame-like semantics; in addition we allow slots to be referenced by complex terms, whereas previously described frame based systems typically allow only scalar slot references. The resulting frame system naturally accommodates complex data structures and provides an extremely powerful mechanism for specifying complex relationships between objects represented by frames.
An Approach to Software Product Testing
Authors: C. U. Munoz
Venue: IEEE Transactions on Software Engineering (1988)

An approach is presented that uses the following techniques: automatic test case generation, self-checking test cases, black box test cases, random test cases, sampling, a form of exhaustive testing, correctness measurements, and the correction of defects in the test cases instead of in the product (defect circumvention). The techniques are cost-effective and have been applied to very large products.
Storing text retrieval systems on CD-ROM: compression and encryption considerations
Authors: Shmuel T. Klein, Abraham Bookstein, Scott Deerwester
Venue: ACM Transactions on Information Systems (TOIS) (1989)

The emergence of the CD-ROM as a storage medium for full-text databases raises the question of the maximum size database that can be contained by this medium. As an example, the problem of storing the Tr&eacute;sor de la Langue Fran&ccidel;aise on a CD-ROM is examined in this paper. The text alone of this database is 700 megabytes long, more than a CD-ROM can hold. In addition, the dictionary and concordance needed to access these data must be stored. A further constraint is that some of the material is copyrighted, and it is desirable that such material be difficult to decode except through software provided by the system. Pertinent approaches to compression of the various files are reviewed, and the compression of the text is related to the problem of data encryption: Specifically, it is shown that, under simple models of text generation, Huffman encoding produces a bit-string indistinguishable from a representation of coin flips.
Using tuple space communication in distributed object-oriented languages
Authors: Satoshi Matsuoka, Satoru Kawai
Venue: ACM SIGPLAN Notices (1988)

When Object-Oriented languages are applied to distributed problem solving, the form of communication restricted to direct message sending is not flexible enough to naturally express complex interactions among the objects. We transformed the Tuple Space Communication Model[29] for better affinity with Object-Oriented computation, and integrated it as an alternative method of communication among the distributed objects. To avoid the danger of potential bottleneck, we formulated an algorithm that makes concurrent pattern matching activities within the Tuple Space possible.
Prefix algorithms for tridiagonal systems on hypercube multiprocessors
Authors: O. Egecioglu, C. K. Koc, A. J. Laub
Venue: Proceedings of the third conference on Hypercube concurrent computers and applications - Volume 2 (1989)

The recursive doubling algorithm as developed by Stone can be used to solve a tridiagonal linear system of size n on a parallel computer with n processors using &Ogr; ( log n ) parallel arithmetic steps. Here we describe a limited processor version of the recursive doubling algorithm for the solution of tridiagonal linear systems using &Ogr; ( n / p + log p ) parallel arithmetic steps on a parallel computer with p < n processors. The main technique relies on fast parallel prefix algorithms, which can be efficiently mapped on the hypercube architecture using the binary-reflected Gray code. For pn this algorithm achieves linear speed-up and constant efficiency over its sequential implementation as well as over the sequential LU decomposition algorithm. These results are confirmed by numerical experiments obtained on an Intel iPSC/d5 hypercube multiprocessor.
Compiling issues for supercomputers
Authors: M. Gikar, C. Polychronopoulos
Venue: Proceedings of the 1988 ACM/IEEE conference on Supercomputing (1988)

Accurate and fast methods for computing data dependencies are vital to the efficiency of vectorizing and parallelizing compilers. Program transformations employed by these compilers are effective only if dependencies are computed as accurately as possible. In this paper we consider two issues for supercomputer compilers. First, we discuss in detail exact and inexact tests for computing data dependencies and focus on the linearization scheme. We then discuss a program transformation call loop spreading which allows us to execute in parallel adjacent loops with interloop dependencies.
A unified approach to loop-free routing using distance vectors or link states
Authors: J. J. Garcia-Luna-Aceves
Venue: ACM SIGCOMM Computer Communication Review (1989)

We present a unified approach for the dynamic computation of shortest paths in a computer network using either distance vectors or link states. We describe a distributed algorithm that provides loop-free paths at every instant and extends or improves algorithms introduced previously by Chandy and Misra, Jaffe and Moss, Merlin and Segall, and the author. Our approach treats the problem of distributed shortest-path routing as one of diffusing computations, which was first proposed by Dijkstra and Scholten. We verify the loop-freedom of the new algorithm, and also demonstrate that it converges to the correct routing entries a finite time after an arbitrary sequence of topological changes. We analyze the complexity of the new algorithm when distance vectors and link states are used, and show that using distance vectors is better insofar as routing overhead is concerned.
The cascade fault tolerance message system
Authors: H. Al-Jabar, S. Rotenstreich
Venue: Proceedings of the 17th conference on ACM Annual Computer Science Conference (1989)

This paper addresses the problem of constructing a highly reliable message delivery system in a distributed environment. It presents a fault tolerance algorithm that guarantees the delivery of a message to its destination despite faults in one or more nodes in the system. The algorithm is distinguished by not using extra hardware or checkpoint facilities that are common to many algorithm of its type. Instead, it maintains an appropriate number of cascading copies of the message in nodes where the message passes. In case of fault, the algorithm locates a copy of the message closest to the destination, and resumes delivery of the message from this location. This special mechanism makes the algorithm suitable to systems without disks, real-time systems, and systems where message transmission time must be minimal.
Simulation assisted design and installation of a flexible assembly system
Authors: J. L. Ballard, S. Jagannathan, R. Hartline, B. Derksen
Venue: Proceedings of the 21st conference on Winter simulation (1989)

The successful implementation of a Flexible Manufacturing/Assembly System can be an effective means of reducing labor, resources and work-in-process inventory. It can increase equipment utilizations, improve quality and result in increased throughput. Simulation is an effective tool for analyzing critical system components and their inter-relationships; consequently, ensuring systems design meets throughput requirements at reduced costs. This paper presents an approach to the design, specification and implementation of a Flexible Assembly System (FAS) using simulation. It presents a practical approach for designing manufacturing systems involving uncertainties. Two simulation models are discussed:(1) a GPSS/H model and(2) a PCMODEL model.The GPSS/H model was used during the early FAS design and specification stage. The PCMODEL model was used to "sell" the proposed FAS configuration to management. The FAS has been successfully implemented.
An object-oriented expert system for coal-fired MHD power plant fault monitoring and diagnosis
Authors: Eddie S. Washington, Moonis Ali
Venue: Proceedings of the 2nd international conference on Industrial and engineering applications of artificial intelligence and expert systems - Volume 1 (1989)

Abnormal process behaviors observed through sensor data values are symptomatic of process faults. It has been demonstrated that pattern recognition techniques that associate faults with the symptoms they produce can be successfully applied in performing on-line automated fault detection and diagnosis [1-3]. This paper describes an object-oriented implementation of a knowledge-based expert system designed to aid power plant operators by performing automated sensor based fault detection and diagnosis. This object-oriented implementation replaces a rule-based backward chaining implementation of a Plant Intelligent Supervisory Control Expert System (PISCES) developed earlier at the University of Tennessee Space Institute [4-9]. All references to PISCES in this paper refer to the new object-oriented implementation. The earlier version will be referred to as a rule-based system.
Passes, sweeps, and visits in attribute grammars
Authors: Joost Engelfriet, Gilberto Filé
Venue: Journal of the ACM (JACM) (1989)

Theoretical results are presented on multi-pass (both left-to-right and alternating), multi-sweep, and multi-visit attribute grammars. For each of these, a pure type and a simple type are distinguished: The pure attribute grammars are defined by nondeterministic attribute evaluators, and the simple ones by the corresponding (usual) deterministic evaluators. The time complexity of deciding membership in these classes of attribute grammars is studied. In general, this is harder for the pure classes than for the simple ones, for which it is either polynomial or NP-complete. The expressive power of the eight classes is compared by studying the translations they can compute. It is shown that sweeps are more powerful than passes, and visits are more powerful than sweeps.
Performance of the Firefly RPC
Authors: Michael D. Schroeder, Michael Burrows
Venue: ACM Transactions on Computer Systems (TOCS) (1990)

In this paper we report on the performance of the remote procedure call (RPC) implementation for the Firefly multiprocessor and analyze the implementation to account precisely for all measured latency. From the analysis and measurements, we estimate how much faster RPC could be if certain improvements were made. The elapsed time for an intermachine call to a remote procedure that accepts no arguments and produces no results is 2.66 ms. The elapsed time for an RPC that has a single 1440-byte result (the maximum result that will fit in a single packet) is 6.35 ms. Maximum intermachine throughput of application program data using RPC is 4.65 Mbits/s, achieved with four threads making parallel RPCs that return the maximum-size result that fits in a single RPC result packet. CPU utilization at maximum throughput is about 1.2 CPU seconds per second on the calling machine and a little less on the server. These measurements are for RPCs from user space on one machine to user space on another, using the installed system and a 10 Mbit/s Ethernet. The RPC packet exchange protocol is built on IP/UDP, and the times include calculating and verifying UDP checksums. The Fireflies used in the tests had 5 MicroVAX II processors and a DEQNA Ethernet controller.
An overview of DARK
Authors: R. van Scoy, J. Bamberger, R. Firth
Venue: ACM SIGAda Ada Letters (1989)

Ada is now being mandated for a large number of DoD development projects as the sole programming language to be used for developing software. Many of these projects are trying to build distributed real-time systems. Many project managers and contractors are anxious to support this effort, to reap the advantages of Ada, and to use the newer techniques of software engineering that Ada can support. This transition, however, has not always been smooth; some serious problems have been encountered. This paper discusses several of thes e problems and describes a prototype software artifact, called the Distributed Ada Real-Time Kernel (DARK), built to address these concerns and to support execution of real-time Ada applications in a distributed, embedded environment. This prototype is not intended to solve all the problems of real-time, embedded systems, but it does provide one viable, near-term option demonstrating that Ada can be used in real-time systems today.
Deadlock Detection in Distributed Systems
Authors: M. Sfinghal
Venue: Computer (1989)

The author describes a series of deadlock detection techniques based on centralized, hierarchical, and distributed control organizations. The point of view is that of practical implications. An up-to-date and comprehensive survey of deadlock detection algorithms is presented, their merits and drawbacks are discussed, and their performances (delays as well as message complexity) are compared. Related issues such as correctness of the algorithms, performance of the algorithms, and deadlock resolution, which require further research are examined.
Expert systems and ICAI in tax law: killing two birds with one AI stone
Authors: D. M. Sherman
Venue: Proceedings of the 2nd international conference on Artificial intelligence and law (1989)

The author describes five separate projects he has undertaken in the intersection of computer science and Canadian income tax law. They are: A computer-assisted instruction (CAI) course for teaching income tax, programmed using conventional CAI techniques; A &ldquo;document modeling&rdquo; computer program for generating the documentation for a tax-based transaction and advising the lawyer-user as to what decisions should be made and what the tax effects will be, programmed in a conventional language; A prototype expert system for determining the income tax effects of transactions and tax-defined relationships, based on a PROLOG representation of the rules of the Income Tax Act; An intelligent CAI (ICAI) system for generating infinite numbers of randomized quiz questions for students, computing the answers, and matching wrong answers to particular student errors, based on a PROLOG representation of the rules of the Income Tax Act; and A Hypercard stack for providing information about income tax, enabling both education and practical research to follow the user's needs path. The author shows that non-AI approaches are a way to produce packages quickly and efficiently. Their primary disadvantage is the massive rewriting required when the tax law changes. AI approaches based on PROLOG, on the other hand, are harder to develop to a practical level but will be easier to audit and maintain. The relationship between expert systems and CAI is discussed.
Feature Point Correspondence in the Presence of Occlusion
Authors: V. Salari, I. K. Sethi
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1990)

Occlusion and poor feature point detection are two of the main difficulties in the use of multiple frames for establishing correspondence of feature points. A formulation of the correspondence problem as an optimization problem is used to handle these difficulties. Modifications to an existing iterative optimization procedure for solving the formulation of the correspondence problem are discussed. Experimental results are presented to show the merits of the formulation.
Finite Prolate Spheroidal Sequences and their Applications II: Image Feature Description and Segmentation
Authors: R. Wilson, M. Spann
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1988)

The problem of uncertainty in image feature description is discussed, and it is shown how finite prolate spheroidal sequences can be used in the construction of feature descriptions that combine spatial and frequency-domain locality in an optimal way. Methods of constructing such optimal feature sets, which are suitable for graphical implementation, are described, and some generalizations of the quadtree concept are presented. These methods are illustrated by examples from image processing applications, including feature extraction and texture description. The problem of image segmentation is discussed, and the importance of scale invariance in overcoming the limitations imposed by uncertainty is demonstrated. A novel texture segmentation algorithm that is based on a combination of the new feature description and multiresolution techniques is described and shown to give accurate segmentations on a range of synthetic and natural textures.
A Performance Analysis of Minimum Laxity and Earliest Deadline Scheduling in a Real-Time System
Authors: J. Hong, X. Tan, D. Towsley
Venue: IEEE Transactions on Computers (1989)

A study is made of the performance of a real-time system in which jobs all have deadlines for either the beginning or the end of service. In the first case the authors analyze the minimum laxity (ML) scheduling policy when there are c processors, and in the latter case they analyze the preemptive-resume earliest deadline (ED) scheduling policy when there is one server. In both cases, the analysis assumes a Poisson arrival process, exponential service times that are not known to the scheduler, and exponential laxities or deadlines, and families of upper and lower bounds on the fraction of jobs that miss their deadlines are developed. The pessimistic bounds are of special interest because they correspond to a family of implementable policies, ML(n) and ED(n), n a positive integer 1, for which the performance approaches that of ML and ED as n increases, but at the cost of increasing overhead.
Thermochemical prediction program aided with EXAPL and APL2 data structure
Authors: Toshio Nishikawa
Venue: Conference proceedings on APL as a tool of thought (1989)

A prediction program to calculate thermochemical data, such as enthalpy of formation for organic compounds, is implemented in an APL environment. APL's multi-dimensional array is best matched to chemical atom's multivalency property.APL2 can achieve powerful scientific computaion with dynamic array access and complex number processing. The coding effort is eased with EXAPL.
Being Stingy with Multipliers
Authors: Robert Michael Owens, M. J. Irwin
Venue: IEEE Transactions on Computers (1990)

It is shown that from an implementation point of view it is often the case that the chip area occupied by a VLSI signal processor is dominated and, therefore, largely determined by the area which must be devoted to multipliers. Therefore, signal processors which have high multiplier utilization (i.e. attain a higher throughput for a given number of multipliers) are of interest because it is possible for them to also attain good VLSI area utilization. Several signal processing architectures which have optimal multiplier utilization, are presented. These architectures are compared to several more conventional alternatives. It is also shown how the architectures achieve better multiplier utilization and, hence VLSI area utilization without suffering a degradation in utilization of other sources (e.g. adders and interconnect).
From Gamma 2 to Gamma E.T.: The Birth of Electronic Computing at Bull
Authors: Bruno Leclerc
Venue: IEEE Annals of the History of Computing (1990)

In 1949 the bull company created a team of electronics engineers. Two of them traveled to the U.S.A. in order to become acquainted with recent achievements in electronic computing. In 1951, they developed the Gamma 2 calculator, based on germanium diodes and delay lines and designed to be connected to the Bull BS tabulator for business applications. A commercial version, the Gamma 3, marketed in 1952, became a bestseller. Different models followed, including in 1956 the drum-augmented "Gamma E.T.," Bull's first stored-program computer.
Iteration for applicative languages
Authors: A. L. Furtado, P. A. S. Velosa
Venue: ACM SIGPLAN Notices (1988)

The mathematical notion of function exponentiation is used to introduce an iteration construct suitable to applicative languages. The elements of the construct are explained as well as its evaluation. A prototype Prolog implementation is included to illustrate the discussion.
Neutral Learning of Constrained Nonlinear Transformations
Authors: J. Barhen, S. Gulati, M. Zak
Venue: Computer (1989)

Two issues that are fundamental to developing autonomous intelligent robots, namely rudimentary learning capability and dexterous manipulation, are examined. A powerful neural learning formalism is introduced for addressing a large class of nonlinear mapping problems, including redundant manipulator inverse kinematics, commonly encountered during the design of real-time adaptive control mechanisms. Artificial neural networks with terminal attractor dynamics are used. The rapid network convergence resulting from the infinite local stability of these attractors allows the development of fast neural learning algorithms. Approaches to manipulator inverse kinematics are reviewed, the neurodynamics model is discussed, and the neural learning algorithm is presented.
Descriptive names in X.500
Authors: G. W. Neufeld
Venue: Symposium proceedings on Communications architectures protocols (1989)

This paper presents a new name form for the OSI X.500 directory system. The primary function of the directory is to provide a name-to-object look-up facility for OSI objects. The directory consists of a set of agents and a database which is distributed among the agents. The directory database is structured as a tree where each node, or entry, corresponds to an object. An entry consists of a set of attributes where one or more attributes are designated as the object name relative to the entry's immediate superior. X.500 defines a name as an ordered sequence of entry names starting from the root and terminating at the object. Therefore, a user must know the names of all the superiors of an object. In contrast, the descriptive name form is an unordered set of attributes. Only enough attributes need be given to distinguish the object from other objects. As a result, users do not have to know or understand the underlying hierarchy of the directory in order to do name look-up.
Image Flow Segmentation and Estimation by Constraint Line Clustering
Authors: B. G. Schunck
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1989)

Image flow is the velocity field in the image plane caused by the motion of the observer, objects in the scene, or apparent motion, and can contain discontinuities due to object occlusion in the scene. An algorithm that can estimate the image flow velocity field when there are discontinuities due to occlusions is described. The constraint line clustering algorithm uses a statistical test to estimate the image flow velocity field in the presence of step discontinuities in the image irradiance or velocity field. Particular emphasis is placed on motion estimation and segmentation in situations such as random dot patterns where motion is the only cue to segmentation. Experimental results on a demanding synthetic test case and a real image are presented. A smoothing algorithm for improving the velocity field estimate is also described. The smoothing algorithm constructs a smooth estimate of the velocity field by approximating a surface between step discontinuities. It is noted that the velocity field estimate can be improved using surface reconstruction between velocity field boundaries.