ppxscal/embedding_network huggingface dataset:
Anticipatory monitoring and control in a process environment
Authors: L. Tsoukalas, G. W. Lee, M. Ragheb
Venue: Proceedings of the 2nd international conference on Industrial and engineering applications of artificial intelligence and expert systems - Volume 1 (1989)

A methodology for the synthesis of engineering Anticipatory Systems is presented. It accounts for both random and fuzzy aspects of uncertainty introduced in process control, and develops mathematical measures of performance. The random, probabilistic component quantifies the uncertainty of occurrence of an event. The fuzzy, possibilistic component quantifies the imprecision in the meaning of an event. Facts about the system are represented as fuzzy information granules of the form: g = (number of carts carrying parts) is (small) is (likely).The performance measures are used as an input to the diagnostic and control functions which are assumed by a Production-Rule System. Using a fuzzified Bayes formula as the link between present and future states, a model-based system estimates at any time t, current performance as well as anticipated performance at time t + &Dgr;t. A control action can be taken at time t, based on both current and anticipated performance. Accordingly, the system can change its current state on the basis of both the current and the anticipated future state. The agency for the prediction is a model of the system and/or its environment which is internal to the system.The synthesis of such system is demonstrated using a model of a nuclear reactor. The model of the reactor is constructed using procedural programming methods and is coupled to a symbolic program which assumes the overall control function.
Analysis of memory referencing behavior for design of local memories
Authors: G. D. McNiven, E. S. Davidson
Venue: ACM SIGARCH Computer Architecture News (1988)

Memory referencing behavior is analyzed via the study of traces for the purpose of developing new local memory structures and management techniques. A novel trace processing technique called flattening reduces the dependence of the results on the underlying compiler and architecture on which the trace was generated, and partitions each memory location into its constituent values. The referencing patterns of each value in the resulting trace is described via statistics such as interreference time, lifetime, etc. The referencing patterns of the entire trace are described via histograms showing the distributions of the statistics for the individual values. The results of this analysis indicate the use of a program controlled cache to efficiently reduce the traffic from the cache to main memory. By using program control, the future knowledge of the compiler can be imparted to the cache, allowing the rejection of dead values and early replacement of values with long interreference times.
Deploying expert systems in Ada
Authors: S. D. Lee, B. Allen
Venue: Proceedings of the conference on Tri-Ada '89: Ada technology in context: application, development, and deployment (1989)

As the Department of Defense Ada mandate begins to be enforced actively, interest in deploying expert systems in Ada has increased. This paper introduces a prototype Ada-based expert system tool called ART/Ada. This prototype was built to support research into the language and operational issues of expert systems in Ada. ART/Ada allows applications of a conventional expert system tool called ART-IM (Automated Reasoning Tool for Information Management) to be deployed in various Ada environments with efficient use of time and space. ART-IM, a C-based expert system tool, is used to generate Ada source code which is compiled and linked with an Ada-based inference engine to produce an Ada executable image. The future research directions call for improved support, for real-time embedded and distributed expert systems. ART/Ada will be used to implement several prototype expert systems for the Space Station Freedom Program testbeds.
Putting a local information system online using pre-packaged software
Authors: Jennie Dautermann
Venue: ACM SIGDOC Asterisk Journal of Computer Documentation (1990)

Many small organizations have the need for information storage and retrieval systems which they dream of putting on-line for ease of access. Such a project designed with modest equipment and pre-packaged software can achieve three important objectives: allow users to design their own access tools clarify the information needs of a community improve information access. These goals may be sufficient in themselves in many situations, but they may also become interim steps which prepare users for involvement in larger institutional projects at some later time by enabling them to think through their information needs in concrete and manageable terms. During an information management project with the nursing department of a Midwest community hospital, a standard PC data base became the vehicle for introducing each of these benefits to the department and for preparing the department to participate in a larger main frame project already in progress in their hospital.
Estimation of Classifier Performance
Authors: K. Fukunaga, R. R. Hayes
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1989)

An expression for expected classifier performance previously derived by the authors is applied to a variety of error estimation methods and a unified and comprehensive approach to the analysis of classifier performance is presented. After the error expression is introduced, it is applied to three cases: (1) a given classifier and a finite test set; (2) given test distributions a finite design set; and (3) finite and independent design and test sets. For all cases, the expected values and variances of the classifier errors are presented. Although the study of Case 1 does not produce any new results, it is important to confirm that the proposed approach produces the known results, and also to show how these results are modified when the design set becomes finite, as in Cases 2 and 3. The error expression is used to compute the bias between the leave-one-out and resubstitution errors for quadratic classifiers. The effect of outliers in design samples on the classification error is discussed. Finally, the theoretical analysis of the bootstrap method is presented for quadratic classifiers.
Updating databases in the weak instance model
Authors: P. Atzeni, R. Torlone
Venue: Proceedings of the eighth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems (1989)

Database updates have recently received much more attention than in the past. In this trend, a solid foundation is provided to the problem of updating databases through interfaces based on the weak instance model. Insertions and deletions of tuples are considered. As a preliminary tool, a lattice on states is defined, based on the information content of the various states. Potential results of an insertion are states that contain at least the information in the original state and that in the new tuple. Sometimes there is no potential result, and in the other cases there may be many of them. We argue that the insertion is deterministic if the state that contains the information common to all the potential results (the greatest lower bound, in the lattice framework) is itself a potential result. Effective characterizations for the various cases exist. A symmetric approach is followed for deletions, with fewer cases, since there are always potential results; determinism is characterized consequently.
Random instances of a graph coloring problem are hard
Authors: Ramarathnam Venkatesan, Leonid Levin
Venue: Proceedings of the twentieth annual ACM symposium on Theory of computing (1988)

NP-complete problems should be hard on some (may be extremely rare) instances. But on generic instances many such problems (especially related to random graphs) have been proven easy. We show the intractability of random instances of a graph coloring problem by modifying the NP-completeness theorem.
The relation between problems in large-scale concurrent systems and distributed databases
Authors: G. Agha
Venue: Proceedings of the first international symposium on Databases in parallel and distributed systems (2000)

We first describes the state of the art in models of concurrency. The models are analyzed along two dimensions: communication and computation. The paper then discusses some problems which make it difficult to realize large-scale concurrent systems. Such problems include compositionality, heterogeneity, debugging, resource management, and concurrency control. Some useful comparisons are drawn to problems in distributed databases and it is argued that solutions to these problems cross disciplinary boundaries. Finally, the paper discusses trends in building concurrent computers and provides some expectations for the future.
An investigation of the performance of a distributed functional digital simulator
Authors: P. Chawla, H. W. Carter
Venue: ACM SIGDA Newsletter (1989)

The increased use of Hardware Description Languages (HDLs) in the process of designing digital systems has spawned an increased interest in the development of simulation systems for these HDLs. Unfortunately, the size and complexity of most contemporary digital systems is such that obtaining meaningful HDL simulation results may require days or even weeks of processing time. Thus, there is a growing need to speed-up the HDL simulation of digital systems at all levels of design abstractions. One promising approach is to depart from the von Neuman style of computation and use a general-purpose mutiprocessor system to simulate digital systems. As part of the research supported by SIGDA/DATC Design Automation Graduate Scholarship, we implemented a prototype distributed multi-level functional HDL simulator. The technique that we use to speed-up simulation is based on the Virtual Time algorithm.
End-user KESSU
Authors: Eeva-Liisa Kaski
Venue: ACM SIGAPL APL Quote Quad (1990)

Since 1982, when the Finnish macro-economic model (KESSU) was presented in Heidelberg, its DP system has undergone substantial changes: it now runs wholly in APL both on mainframe and in micros (PC/AT, PS2/80). A short history of the model used by the Finnish Ministry of Finance and its ADP history is presented in the paper. The present version of the model management system is less complicated for the user than a teller machine. Behind the deceptively simple menu facade runs a complicated and powerful model, whose successive generations had been used as an instrument for economic policy design during a quarter of a century. The system has common modules containing the model logic and environment dependent variable modules that conceal interpreter specific features such as device controls. This technique allows the use of KESSU in different environments, from PCs to IBM 3090s. Next version of the model is in the pipeline and it's introduction will take place in near future. Some technical improvements such as generation of executable APL code from a very concise vector notation will be presented in the paper.
Blending parametric surfaces
Authors: Daniel J. Filip
Venue: ACM Transactions on Graphics (TOG) (1989)

A blending surface is a surface that smoothly connects two given surfaces along two arbitrary curves, one on each surface. This is particularly useful in the modeling operations of filleting a sharp edge between joining surfaces or connecting disjoint surfaces. In this paper we derive a new surface formulation for representing surfaces which are blends of parametric surfaces. The formulation has the advantage over the traditional rational polynomial approach in that point and normal values have no gaps between the blending surface and the base surfaces. Shape control parameters that control the cross-sectional shape of the blending surface are also available. In addition, the base surfaces are not restricted to any particular type of surface representation as long as they are parametrically defined and have a well-defined and continuous normal vector at each point. The scheme is extensible to higher orders of geometric continuity, although we concentrate on G1.
I-NET mechanism for issuing multiple instructions
Authors: L. Wang, C. L. Wu
Venue: Proceedings of the 1988 ACM/IEEE conference on Supercomputing (1988)

Conventional instruction issuing methods use hardware control mechanism to issue instructions in multiple-functional-unit systems. They reach physical limitations due to the complexity of issuing logic when they intend to issue multiple instructions per cycle. A new method, I-NET, is presented in this paper to overcome this shortcoming. I-NET uses a post-compiler to detect the data dependencies among instructions. The detected data dependence is then attached to the instruction code to form an instruction unit which can be executed independently with one another. These &ldquo;pre-decoded&rdquo; instruction units are fetched from the memory and sent to functional units directly. It achieve a maximal instruction issuing rate by avoiding a lengthy decoding procedure in the hardware. The performance study has shown I-NET to be a very promising method in exploring massive parallelism of a program in a multiple-functional-unit system.
Developing and marketing a comprehensive network training program on a University campus
Authors: J. Martin, B. B. Miller
Venue: Proceedings of the 17th annual ACM SIGUCCS conference on User Services (1989)

Our director says, &ldquo;Networking is the Instruction Research Computer Center's most important activity.&rdquo; Five years ago microcomputers changed the course of computer history, perhaps history itself. Some say that it was a revolution. Networking will be the new computer revolution, and for many of us, it has already arrived. The frustrations that were experienced by skilled mainframe support personnel as they tried to learn about microcomputers is now being repeated as people sign up, sign on, and send information around the world. User services receives a call, &ldquo;I have a new modem and I cannot connect to the network.&rdquo; The possibilities for trouble shooting this problem are enormous. With networking, the variables increase and the potential for easy solutions are not as likely. Users have a variety of ways that they can connect to networks using any combination of modems, software, and computers. Looking at problems from the users perspective, failures can occur at the hardware level, software design, software implementation, the physical cables connecting the computer and modem, the telephone line, the receiving modem, the mainframe connecting the user with a network, keyboard mapping, the lines between nodes of the network and the gateways of the networks themselves. How can central computer centers provide education, consultation, and documentation for such a wide variety of user needs? The answers are not easy but the key to success is to work to reduce the number of variables and develop courses that help the user develop networking skills in the least restrictive environment.
An Optimal Transformation for Discriminant and Principal Component Analysis
Authors: J. Duchene, S. Leclercq
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1988)

A general method is proposed to describe multivariate data sets using discriminant analysis and principal-component analysis. First, the problem of finding K discriminant vectors in an L-class data set is solved and compared to the solution proposed in the literature for two-class problems and the classical solution for L-class data sets. It is shown that the method proposed is better than the classical method for L classes and is a generalization of the optimal set of discriminant vectors proposed for two-class problems. Then the method is combined with a generalized principal-component analysis to permit the user to define the properties of each successive computed vector. All the methods were tested using measurements made on various kinds of flowers (IRIS data).
An expert system for conceptual design
Authors: T. Ichiko
Venue: Proceedings of the 2nd international conference on Industrial and engineering applications of artificial intelligence and expert systems - Volume 1 (1989)

With the use of expert system technologies, our aim is to construct an interactive design aid environment with a highly semantic description facility and a logically effective verification facility for increasing software productivity oriented toward reutilization. This paper discusses current design issues and expert system technologies introduction to its design method in large scale engineering system, especially from the viewpoint of software conceptual design. Some simulation results applied in an expert system for conceptual design which was developed in the research for reducing the restriction of conventional software data design process found as a typical design issue, are shown as an application example, including next forthcoming directions of intelligent design aids research based on highly parallel network concept (CSP based) for efficient process communication.
An automatically generated, realistic compiler for imperative programming language
Authors: U. F. Pleban, P. Lee
Venue: Proceedings of the ACM SIGPLAN 1988 conference on Programming Language design and Implementation (1988)

We describe the automatic generation of a complete, realistic compiler from formal specifications of the syntax and semantics of Sol/C, a nontrivial imperative language &ldquo;sort of like C.&rdquo; The compiler exhibits a three pass structure, is efficient, and produces object programs whose performance characteristics compare favorably with those produced by commercially available compilers. To our knowledge, this is the first time that this has been accomplished.
Computer support for transcribing recorded activity
Authors: R. H. Trigg
Venue: ACM SIGCHI Bulletin (1989)

For many researchers studying human activity, the diverse media and technologies used for recording, viewing and analysis place heavy demands on analysts who want to stay "close" to their primary data. At the same time, the analyses themselves can require very different representational media, posing difficulties for researchers wanting to juxtapose and compare multiple perspectives on their work. The tool described here is intended to address some of these issues by providing an extensible computer environment in which multiple chronologically organized representations of a single sequence of activity can be edited, juxtaposed, and aligned.
A &ldquo;course&rdquo; for data modelling
Authors: Ronald S. King
Venue: ACM SIGCSE Bulletin (1988)

What direction or path of learning should data modelling take? This author suggests a &ldquo;course&rdquo; for data modelling to follow. Artificial intelligence, databases, and programming languages are attempting to meet demands requiring a higher level of conceptual thinking than ever before. Likewise special tools and techniques are needed for that level of thought. Therefore data modelling methodologies are designed to provide an abstract level of system descriptions. A course based upon the comparative study of these various data modelling principles is described in this paper. This course stresses a transition from intuitive to formal development of data models. Such an approach facilitates the investigation of the concept of equivalence for data models, application models, and operations defined on data models.
Amalgamating regulation- and case-based advice systems through suggested answers
Authors: D. E. Wolstenholme
Venue: Proceedings of the 2nd international conference on Artificial intelligence and law (1989)

This paper proposes a method whereby regulation- and case-based systems may be amalgamated in logic-based advice systems through the use of suggested answers, originally used in a non-legal domain. These are based on relationships, declared at the meta-level, between generalized cases and the vague concepts of the regulations; satisfaction of the conditions derived from cases is not, however, seen as implying that the vague concepts hold, merely as being indicative of them. The resulting systems allow the user free interpretation of the vague concepts, but provide help with interpretation, if required, based on the cases; they also provide clear separation of regulations and cases.
The relational model for database management: version 2
Authors: E. F. Codd
Venue:  (1990)

From the Preface (See Front Matter for full Preface) An important adjunct to precision is a sound theoretical foundation. The relational model is solidly based on two parts of mathematics: firstorder predicate logic and the theory of relations. This book, however, does not dwell on the theoretical foundations, but rather on all the features of the relational model that I now perceive as important for database users, and therefore for DBMS vendors. My perceptions result from 20 years of practical experience in computing and data processing (chiefly, but not exclusively, with large-scale customers of IBM), followed by another 20 years of research. I believe that this is the first book to deal exclusively with the relational approach. It does, however, include design principles in Chapters 21 and 22. It is also the first book on the relational model by the originator of that model. All the ideas in the relational model described in this book are mine, except in cases where I explicitly credit someone else. In developing the relational model, I have tried to follow Einstein's advice, "Make it as simple as possible, but no simpler." I believe that in the last clause he was discouraging the pursuit of simplicity to the extent of distorting reality. So why does the book contain 30 chapters and two appendixes? To answer this question, it is necessary to look at the history of research and development of the relational model.
A knowledge-based decision support system for flexible manufacturing
Authors: D. H. Norrie, R. Fauvel, B. R. Gaines, M. Mowchenko
Venue: Proceedings of the 2nd international conference on Industrial and engineering applications of artificial intelligence and expert systems - Volume 1 (1989)

A decision support system is under development for planning in flexible manufacturing, using a consortium of knowledge-based systems utilizing expert system, database, and simulation techniques. An object-oriented approach is incorporated. There are six basic modules: machine selection optimizer; database; production flow analyzer; rapid modelling techniques system; FMS simulator; supervisor.The prototype of the machine selection optimizer has been developed, tested, and is under evaluation.
Experience of constructing a fault localisation expert system using an AI toolkit
Authors: Robert Inder
Venue: Proceedings of the 1st international conference on Industrial and engineering applications of artificial intelligence and expert systems - Volume 1 (1988)

The paper briefly outlines the operation of community clubs, a method of organising collaborative research which has proved effective within the UK government's Alvey programme, and focuses on one of the projects organised by the DAPES (the Data Processing Expert Systems) club: namely an expert system for localising a fault within a network of data communications equipment. Coming from a DP background, club members were particularly interested in methodical approaches to the implementation, maintenance and documentation of expert systems. They chose to construct an intermediate representation based on the KADS methodology (which is briefly described), which was then used as the basis of two parallel implementations. The paper concentrates on the description one of these implementations, which used a specialised AI toolkit (Inference ART). It describes the performance of the final system and the way it is constructed. It also comments on the performance offered by the toolkit, and compares the system with a second implementation carried out in parallel using a PC-based shell.