ppxscal/embedding_network huggingface dataset:
Jet engine technical advisor (JETA)
Authors: Suhayya Abu-Hakima, Philippe Davidson, Mike Halasz, Sieu Phan
Venue: Proceedings of the 2nd international conference on Industrial and engineering applications of artificial intelligence and expert systems - Volume 1 (1989)

The paper describes a generalized knowledge-based tool for diagnosis which is currently being applied to jet engine maintenance. A domain dependent diagnostic tree is created for a particular jet engine by filling in an empty hypothesis frame for each diagnostic node in the tree. The knowledge in the tree is reasoned about using a generalized and explicit reasoning strategy. This strategy can be guided by rules specific to the activation of a particular diagnostic hypothesis in the tree.The user interacts with the system through a window interface which features definitions, glossary information, schematics and explanations of session reasoning, which are all linked to the knowledge contained in the system. A demonstration prototype which runs under the ART (LISP-based) environment on Symbolics 3620 and Sun 3/60 workstations was completed in December 1988. The preliminary prototype diagnoses a subset of the acceleration faults on the General Electric J85-CAN-15 jet engine and is being field tested and evaluated by potential users.
Fast online/offline netlist compilation of hierarchical schematics
Authors: L. G. Jones
Venue: Proceedings of the 26th ACM/IEEE Design Automation Conference (1989)

We present fast techniques for creating the netlist underlying a hierarchical schematic design. The methods can be used either for creating the netlist as a data structure for further online processing or for creating the netlist as a file for use with other offline design tools that are downstream from the compilation process. The methods we present have been used successfully in the implementation of a hierarchical schematic capture system that supports both netlist compilation and switch-level logic simulation.
PRAM Processor Allocation: A Hidden Bottleneck in Sublogarithmic Algorithms
Authors: A. van Gelder
Venue: IEEE Transactions on Computers (1989)

The problem of dynamic processor allocation in PRAMs (programmable random-access memories) is discussed, and differentiated from that of static allocation. The version of the PRAM considered, also called the CREW model is a parallel computer with global memory accessible in unit time; it allows concurrent reads, but requires exclusive writes. Two dynamic processor allocation problems for P processors are distinguished. One, called assignment from numbers, has an Omega (log P) lower bound, even when the number of tasks is O( square root P). The second, called assignment from leaders, has faster solutions. A constant-time solution for O( square root P) tasks is known; it is generalized to O(P/sup 1-1/k/) tasks in time O(k). Handling O(P) tasks requires a different approach and an algorithm that runs in time O(log log P) is proposed which is asymptotically optimal within a constant factor. The implications of these two versions of dynamic allocation on sublogarithmic merge algorithms are discussed.
Token Relabeling in a Tagged Token Data-Flow Architecture
Authors: J.-L. Gaudoit, Y.-H. Wei
Venue: IEEE Transactions on Computers (1989)

A direct structure access approach called token relabeling scheme is presented in which all array operations can be performed without the use of any intermediary structure memory. The graph constructs for both approaches are described. Four numerical algorithms including fast Fourier transform, bitonic sort, LU decomposition, and matrix multiplication are implemented in both approaches. Token relabeling is directly applicable to arrays which are entirely consumed. Graph constructs which allow partial consumption are also designed. The effectiveness and efficiency of this parallel random access construct verifies the feasibility and applicability of the token relabeling scheme. A deterministic simulation of Arvind and K.P. Gostelow's tagged-token data-flow architecture (1982) is undertaken to validate the graph designs and evaluate the performance of the graphs. It is shown that the direct access graphs present better performance with regard to execution time, speedup, and resource utilization.
Development of a large, concept-oriented database for information retrieval
Authors: R. H. Ledwith
Venue: Proceedings of the 11th annual international ACM SIGIR conference on Research and development in information retrieval (1988)

The development of concept-oriented databases using AI knowledge representation schemes is proposed as a step towards improving the precision and recall of information retrieval systems. Currently underway is the augmentation of a 238,000 citation database, Chemical Abstracts (CA) Volume 105, by addition of detailed conceptual information in the form of frames and hierarchies. The initial text data is parsed using natural language processing (NLP) techniques to create frames describing the semantics of the index entries in the database, with the slots in the frames being pointers into a very large semantic network of conceptual objects (956,000 objects). To examine the resultant knowledge base (KB), a simple hypertext system is proposed, with the conceptual information serving as pathways to connect related citations.
Copy elimination in functional languages
Authors: K. Gopinath, J. L. Hennessy
Venue: Proceedings of the 16th ACM SIGPLAN-SIGACT symposium on Principles of programming languages (1989)

Copy elimination is an important optimization for compiling functional languages. Copies arise because these languages lack the concepts of state and variable; hence updating an object involves a copy in a naive implementation. Copies are also possible if proper targeting has not been carried out inside functions and across function calls. Targeting is the proper selection of a storage area for evaluating an expression. By abstracting a collection of functions by a target operator, we compute targets of function bodies that can then be used to define an optimized interpreter to eliminate copies due to updates and copies across function calls. The language we consider is typed lambda calculus with higher-order functions and special constructs for array operations. Our approach can eliminate copies in divide and conquer problems like quicksort and bitonic sort that previous approaches could not handle. We also present some results of implementing a compiler for a single assignment language called SAL on some small but tough programs. Our results indicate that it is possible to approach a performance comparable to imperative languages like Pascal.
Disk referencing patterns in a distributed microcomputer UNIX environment
Authors: John F. Čigas
Venue: Proceedings of the 1988 ACM SIGSMALL/PC symposium on ACTES (1988)

In this paper we examine the physical disk referencing patterns of a network of homogeneous microcomputers accessing a common, remote file server. Each client executes a simulated workload based on actual measured workloads. The measurements are of the physical referencing patterns, but logical device information is included to allow some analysis at the file system level as well. We examine the correct placement of temporary files and the effect of statically caching common files at the client machines. Through simulations, we also estimate the performance of a dynamic cache to determine its organization, size, and placement.
Recognizing Immediacy in an N-Tree Hierarchy and its Application to Protection Groups
Authors: R. S. Sandhu
Venue: IEEE Transactions on Software Engineering (1989)

The benefits of providing access control with groups of users as the unit of granularity are enhanced if the groups are organized in a hierarchy (partial order) by the subgroup relation >or=, where g>or=h signifies that every member of group g is thereby also a member of group h. It is often useful to distinguish the case when g is an immediate subgroup of h, that is when g>h and there is no group k such that g>k>h. The class of partial orders called n-trees was recently defined by using rooted trees and inverted rooted trees as basic partial orders and combining these recursively by refinement. Any n-tree hierarchy can be expressed as the intersection of two linear orderings, so it is possible to assign a pair of integers l(x) and r(x) to each group x such that g>or=h if and only if l(g)>or=l(h) and r(g)>or=r(h). The author shows how to extend this representation of n-trees by assigning four additional integers to each group so that it is also easily determined whether or not g is an immediate subgroup of h.
Performance of the world's fastest distributed operating system
Authors: Robbert van Renesse, Hans van Staveren, Andrew S. Tanenbaum
Venue: ACM SIGOPS Operating Systems Review (1988)

Distributed operating systems have been in the experimental stage for a number of years now, but few have progressed to the point of actually being used in a production environment. It is our belief that the reason lies primarily with the performance of these systems---they tend to be fairly slow compared to traditional single computer systems. The Amoeba system has been designed with high performance in mind. In this paper some performance measurements of Amoeba are presented and comparisons are made with UNIX on the SUN, as well as with some other interesting systems. In particular, short remote procedure calls take 1.4 msec and long data transfers achieve a user-to-user bandwidth of 677 kbytes/sec. Furthermore, the file server is so fast that it is limited by the communication bandwidth to 677 kbytes/sec. The real speed of the file server is too high to measure. To the best of our knowledge, these are the best figures yet reported in the literature for the class of hardware used.
Suggesting what to do next
Authors: Claudio Gutierrez, Juan Carlos Hidalgo
Venue: Proceedings of the 1988 ACM SIGSMALL/PC symposium on ACTES (1988)

AISA (Artificial Intelligence Systems of Administration) is an ongoing research project whose long-term goal is development of an intelligent assistant to a business executive or administrator. The intelligent assistant will remove much of the burden of administrative chores from its human user and provide guidance, advice, and assistance in problem solving and decision making. This paper provides an overview of the system, with emphasis on the module that proposes the next item to which an administrator should give attention and suggests the appropriate action to perform with respect to that item. Expertise in the domain is represented by Horn-clause declarative knowledge and can be expanded incrementally. This work illustrates that sophisticated AI techniques can be successfully applied using microcomputers. It also addresses an increasingly important area of application, that of efficient multi-agent cooperation and communication in the administrative domain.
The memoirs of two survivors: or the evaluation of a computer system for cooperative work
Authors: Gro Bjerknes, Tone Bratteteig
Venue: Proceedings of the 1988 ACM conference on Computer-supported cooperative work (1988)

The paper you hold in your hands tells the story of the last evaluation meeting in the Florence project. The Florence project dealt with use of computers in nurses' daily work, and in the project a small and rather simple computer system was developed. The computer system was intended to support cooperative aspects of the nurses' work. During the evaluation meeting it turned out that the nurses find the system useful, even though they cannot fully explain why. Thus we may say that we survived The Ultimate Test of the computer system.
Hermite interpolation of rational space curves using real algebraic surfaces
Authors: C. Bajaj, I. Ihm
Venue: Proceedings of the fifth annual symposium on Computational geometry (1989)

We present a simple characterization of the lowest degree, implicitly defined, real algebraic surfaces, which smoothly contain any given number of points and algebraic space curves, of arbitrary degree. The characterization is constructive, yielding efficient algorithms for generating families of such algebraic surfaces. Smooth containment of space curves yields C1-continuous surface fitting, and is a generalization of standard Hermite interpolation applied to fitting curves through point data, equating derivatives at those points. We deal with the containment and matching of &ldquo;normals&rdquo; (vectors orthogonal to tangents), possibly varying along the entire span of the space curves. Such Hermite interpolated surfaces prove useful as &ldquo;blending&rdquo; or &ldquo;joining&rdquo; surfaces for solid models as well as &ldquo;fleshing&rdquo; surfaces for curved wireframe models.
A practical sieve algorithm finding prime numbers
Authors: Xuedong Luo
Venue: Communications of the ACM (1989)

Based on the sieve of Eratosthenes, a faster and more compact algorithm is presented for finding all primes between 2 and N.
Experience with test generation for real protocols
Authors: D. Sidhu, T. Leung
Venue: Symposium proceedings on Communications architectures and protocols (1988)

This paper presents results on the application of four protocol test sequence generation techniques (T-, U-, D-, and W-methods) to the NBS Class 4 transport protocol (TP4). The ability of a test sequence to decide whether a protocol implementation conforms to its specification depend on the range of faults that it can capture. The study shows that a test sequence produced by the T-method has a poor fault detection capability whereas test sequences produced by the U-, D- and W-methods have comparable (superior to that for T-method) fault coverage on several classes of randomly generated machines. The lengths of test sequences produced by the four methods tend to be different. The length of a test sequence produced by the T-method (W-method) is the smallest (largest). The length of a test sequence from the U-method is smaller than that for the D-method and lengths for both are greater than that for the T-method and less than that for the W-method.
Partial Shape Recognition: A Landmark-Based Approach
Authors: N. Ansari, E. J. Delp
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1990)

A method of recognizing partially occluded objects is presented in which each object is represented by a set of landmarks. Given a scene consisting of partially occluded objects, a model object in the scene is hypothesized by matching the landmarks of the model with those in the scene. A measure of similarity between two landmarks is needed to perform this matching. A local shape measure, sphericity, is introduced. It is shown that any invariant function under a similarity transformation is a function of the sphericity. To match landmarks between the model and the scene, a table of compatibility is constructed. A technique, known as hopping dynamic programming, is described to guide the landmark matching through the compatibility table. The location of the model in the scene is estimated with a least-squares fit among the matched landmarks. A heuristic measure is then computed to decide if the model is in the scene.
Perspectives on the academic preparation of MIS professionals
Authors: R. H. Trent
Venue: Proceedings of the ACM SIGCPR conference on Management of information systems personnel (1988)

To a greater extent than other functional areas, the MIS function is experiencing pressures originating from an amalgam of ongoing technical, organizational, and environmental trends. Information technology continues to change rapidly. The role of information in achieving organization objectives is becoming more critical. The intensity of competition is increasing both nationally and internationally. Although perhaps not at the same pace, academic programs designed to prepare MIS professionals have also developed and changed in response to those pressures. The number of undergraduate and graduate degree programs is still on an upward trend, but the nature of academic institutions has, to some extent, made the response to needed curriculum revision slower than practitioners might wish. The panel identified the following issues related to the academic preparation of MIS professionals: &bull; Organizations are increasingly recognizing the potential of information technology to add value to products and services and to improve relationships between an enterprise and its customers and suppliers. &bull; MIS jobs are undergoing fundamental changes. Some technical skills are becoming obsolete and are being replaced with new ones, e.g., the ability to use computer aided software engineering tools and artificial intelligence technology. &bull; MIS professionals must become more business oriented. This means they must possess more highly developed business skills in order to compete successfully. &bull; MIS professionals must possess considerable political, organizational, and communication skills rather than just technical competence. &bull; Users of information systems are more knowledgeable about computer capabilities. They are thus more demanding and require more sophisticated systems. &bull; MIS professionals must take greater responsibility for their own career development. &bull; MIS professionals should adopt an &ldquo;infopreneuring attitude&rdquo; and become more flexible, adaptable, and versatile in responding to technological developments and competitive pressures. &bull; Colleges and universities must continuously examine and update the content of their MIS curricula to keep pace with environmental, technological, and organizational change. &bull; Graduate studies for MIS professionals should be balanced among technical, political, organizational, communication, and business theory and skills. &bull; The linkage between academic preparation and professional practice could be improved through closer cooperation between businesses and colleges and universities.
Analysis and Implementation of Branch-and-Bound Algorithms on a Hypercube Multicomputer
Authors: J. Quinn
Venue: IEEE Transactions on Computers (1990)

The feasibility of implementing best-first (best-bound) branch-and-bound algorithms on hypercube multicomputers is discussed. The computationally-intensive nature of these algorithms might lead a causal observer to believe that their parallelization is trivial. However, as the number of processors grows, two goals must be satisfied to some degree in order to maintain a reasonable level of efficiency. First, processors must be kept busy doing productive work (i.e. exploring worthwhile subproblems). Second, the number of interprocessor communications must be minimized along the critical path in the state-space tree from the original problem to the subproblem yielding a solution. It is difficult to improve performance in one of these areas without degrading performance in the other. Analytical models for the execution time of loosely synchronous and asynchronous parallel branch-and-bound algorithms are presented, and the models are validated with data from the execution of five algorithms that solve the traveling salesperson problem.
Designing minimal documentation using a GOMS model: a usability evaluation of an engineering approach
Authors: Richard Gong, Jay Elkerton
Venue: Proceedings of the SIGCHI conference on Human factors in computing systems: Empowering people (1990)

The Minimal Manual proposed by Carroll, Smith-Kerker, Ford, and Mazur [6] has been demonstrated to improve the performance of novices learning a word processing system. However, little research exists to suggest a practical methodology for implementing the important features of a minimal manual. Using the GOMS model, we incrementally modified a manual to include certain minimal manual features: reduced verbiage, focus on real tasks, and error recovery support. An evaluation of the manuals with novice users demonstrated significant improvements in learning performance when the manual was modified to be task-oriented with explicit procedural steps for accomplishing real tasks.
The Mississippi supercomputer project or what's a nice machine like you doing ina place like Mississippi?
Authors: Krista Vernon
Venue: Proceedings of the 16th annual ACM SIGUCCS Conference on User Services (1988)

The news that there is a supercomputer on the Oxford campus of the University of Mississippi is almost always met initially with disbelief and then with interest, envy, and sometimes with considerable relief that it is Ole Miss which is having to cope! The experiences of the Office of Computing and Information Systems at the University before, during, and after the installation of the supercomputer system may be of interest to other universities contemplating major changes. In March of 1987, the Computer Center was notified that the state of Mississippi was probably to be the recipient of a large gift from a major oil company. The gift consisted of a Control Data Corporation Cyber 205, a CDC frontend computer, and assorted peripherals and equipment, such as printers and air conditioning units. Six months after the final paperwork was signed, the computers were installed and were operational in a completely newly renovated building on a campus which had never been a CDC installation, having been first a DEC 10 site and then an Amdahl 470 V/8 site. What happens to the User Services Area of a university computer center when a major new resource is introduced, one which requires completely new thinking in the areas of operating systems, user interface, languages, and algorithm design? The support staff must be trained, new personnel must be located, hired, and trained; complacent users must be recruited, anxious users must be encouraged and assisted, and expectations must be adjusted. Because of the publicity surrounding such a generous gift, there were immediate requests for accounts and access. There were misconceptions about using the machine; some users expected just to log on and pick up where they left off on their Amdahl CMS accounts. There was a dearth of some manuals and an excess of others. The user services staff and the systems support staff were scrambling to attend training classes, to train each other, and to train users. This paper will discuss how the Computer Center met the challenges which were encountered in setting up the physical site and organizing the support staff, how they were able to adjust their user support efforts for the supercomputer users, and how this machine has affected future plans, well as how Mississippi, one of the nation's poorest states, became the owner of a supercomputer.
Dynamic computational geometry on parallel computers
Authors: L. Boxer, R. Miller
Venue: Proceedings of the third conference on Hypercube concurrent computers and applications - Volume 2 (1989)

This paper surveys our parallel algorithms for determining geometric properties of systems of moving objects. The properties investigated include nearest (farthest) neighbor, closest (farthest) pair, collision, convex hull, diameter, and containment. The models of computation include the CREW PRAM, mesh, and hypercube.
The SimKit system: knowledge-based simulation and modeling tools in KEE
Authors: M. Stelzner, J. Dynis, F. Cummins
Venue: Proceedings of the 21st conference on Winter simulation (1989)

The SimKitTM system is an integrated set of general-purpose simulation and modeling tools built in and on the Knowledge Engineering Environment R (KEER) software development system. SimKit is used to build "knowledge-based" simulations. By knowledge-based, we mean an approach that utilizes a variety of techniques that have emerged from artificial intelligence including: &bull; The LISP programming environment &bull; High-resolution bitmap graphics &bull; Object-oriented programming &bull; Frame-based knowledge representation with inheritance &bull; Active values or "demons" &bull; Rule-based reasoning. Knowledge-based simulations are more understandable, interactive, accessible, and extensible than simulations built using "conventional" techniques. In addition, knowledge-based simulations can easily be integrated with other knowledge system applications.