639 research outputs found
Computer-aided HAZOP of batch processes
The modern batch chemical processing plants have a tendency of increasing
technological complexity and flexibility which make it difficult to control the
occurrence of accidents. Social and legal pressures have increased the demands
for verifying the safety of chemical plants during their design and operation.
Complete identification and accurate assessment of the hazard potential in the
early design stages is therefore very important so that preventative or protective
measures can be integrated into future design without adversely affecting
processing and control complexity or capital and operational costs. Hazard and
Operability Study (HAZOP) is a method of systematically identifying every
conceivable process deviation, its abnormal causes and adverse hazardous
consequences in the chemical plants. [Continues.
Working Notes from the 1992 AAAI Workshop on Automating Software Design. Theme: Domain Specific Software Design
The goal of this workshop is to identify different architectural approaches to building domain-specific software design systems and to explore issues unique to domain-specific (vs. general-purpose) software design. Some general issues that cut across the particular software design domain include: (1) knowledge representation, acquisition, and maintenance; (2) specialized software design techniques; and (3) user interaction and user interface
Recommended from our members
Neural Diagrammatic Reasoning
Diagrams have been shown to be effective tools for humans to represent and reason about
complex concepts. They have been widely used to represent concepts in science teaching, to
communicate workflow in industries and to measure human fluid intelligence. Mechanised
reasoning systems typically encode diagrams into symbolic representations that can be
easily processed with rule-based expert systems. This relies on human experts to define the
framework of diagram-to-symbol mapping and the set of rules to reason with the symbols.
This means the reasoning systems cannot be easily adapted to other diagrams without
a new set of human-defined representation mapping and reasoning rules. Moreover such
systems are not able to cope with diagram inputs as raw and possibly noisy images. The
need for human input and the lack of robustness to noise significantly limit the applications
of mechanised diagrammatic reasoning systems.
A key research question then arises: can we develop human-like reasoning systems that
learn to reason robustly without predefined reasoning rules? To answer this question, I
propose Neural Diagrammatic Reasoning, a new family of diagrammatic reasoning
systems which does not have the drawbacks of mechanised reasoning systems. The new
systems are based on deep neural networks, a recently popular machine learning method
that achieved human-level performance on a range of perception tasks such as object
detection, speech recognition and natural language processing. The proposed systems are
able to learn both diagram to symbol mapping and implicit reasoning rules only from data,
with no prior human input about symbols and rules in the reasoning tasks. Specifically I
developed EulerNet, a novel neural network model that solves Euler diagram syllogism
tasks with 99.5% accuracy. Experiments show that EulerNet learns useful representations
of the diagrams and tasks, and is robust to noise and deformation in the input data. I
also developed MXGNet, a novel multiplex graph neural architecture that solves Raven
Progressive Matrices (RPM) tasks. MXGNet achieves state-of-the-art accuracies on two
popular RPM datasets. In addition, I developed Discrete-AIR, an unsupervised learning
architecture that learns semi-symbolic representations of diagrams without any labels.
Lastly I designed a novel inductive bias module that can be readily used in todayâs deep
neural networks to improve their generalisation capability on relational reasoning tasks.EPSRC Studentship and Cambridge Trust Scholarshi
A formal foundation for ontology alignment interaction models
Ontology alignment foundations are hard to find in the literature. The abstract nature of the topic and the diverse means of practice makes it difficult to capture it in a universal formal foundation. We argue that such a lack of formality hinders further development and convergence of practices, and in particular, prevents us from achieving greater levels of automation. In this article we present a formal foundation for ontology alignment that is based on interaction models between heterogeneous agents on the Semantic Web. We use the mathematical notion of information flow in a distributed system to ground our three hypotheses of enabling semantic interoperability and we use a motivating example throughout the article: how to progressively align two ontologies of research quality assessment through meaning coordination. We conclude the article with the presentation---in an executable specification language---of such an ontology-alignment interaction model
Automating Diagrammatic Proofs of Arithmetic Arguments
Centre for Intelligent Systems and their ApplicationsThis thesis is on the automation of diagrammatic proofs, a novel approach to mechanised mathematical reasoning. Theorems in automated theorem proving are usually proved by formal logical proofs. However, there are some conjectures which humans can prove by the use of geometric operations on diagrams that somehow represent these conjectures, so called diagrammatic proofs. Insight is often more clearly perceived in these diagrammatic proofs than in the algebraic proofs. We are investigating and automating such diagrammatic reasoning about mathematical theorems.Concrete rather than general diagrams are used to prove ground instances of a universally quantified theorem. The diagrammatic proof in constructed by applying geometric operations to the diagram. These operations are in the inference steps of the proof. A general schematic proof is extracted from the ground instances of a proof. it is represented as a recursive program that consists of a general number of applications of geometric operations. When gien a particular diagram, a schematic proof generates a proof for that diagram. To verify that the schematic proof produces a correct proof of the conjecture for each ground instance we check its correctness in a theory of diagrams. We use the constructive omega-rule and schematic proofs to make a translation from concrete instances to a general argument about the diagrammatic proof.The realisation of our ideas is a diagrammatic reasoning system DIAMOND. DIAMOND allows a user to interactively construct instances of a diagrammatic proof. It then automatically abstracts these into a general schematic proof and checks the correctness of this proof using an inductive theorem prover
Resources-Events-Agents Design Theory: A Revolutionary Approach to Enterprise System Design
Enterprise systems typically include constructs such as ledgers and journals with debit and credit entries as central pillars of the systemsâ architecture due in part to accountants and auditors who demand those constructs. At best, structuring systems with such constructs as base objects results in the storing the same data at multiple levels of aggregation, which creates inefficiencies in the database. At worst, basing systems on such constructs destroys details that are unnecessary for accounting but that may facilitate decision making by other enterprise functional areas. McCarthy (1982) proposed the resources-events-agents (REA) framework as an alternative structure for a shared data environment more than thirty years ago, and scholars have further developed it such that it is now a robust design theory. Despite this legacy, the broad IS community has not widely researched REA. In this paper, we discuss REAâs genesis and primary constructs, provide a history of REA research, discuss REAâs impact on practice, and speculate as to what the future may hold for REA-based enterprise systems. We invite IS researchers to consider integrating REA constructs with other theories and various emerging technologies to help advance the future of information systems and business research
A meta-language for systems architecting
Thesis (Ph. D.)--Massachusetts Institute of Technology, Engineering Systems Division, 2005.This electronic version was submitted by the student author. The certified thesis is available in the Institute Archives and Special Collections.Includes bibliographical references (leaves 164-168).(cont.) To demonstrate its practical value in large-scale engineering systems, the research applied OPN to two space exploration programs and one aircraft design problem. In our experiments, OPN was able to significantly change the modeling and architectural reasoning process by automating a number of manual model construction, manipulation, and simulation tasks.The aim of this research is to design an executable meta-language that supports system architects' modeling process by automating certain model construction, manipulation and simulation tasks. This language specifically addresses the needs in systematically communicating architects' intent with a wide range of stakeholders and to organize knowledge from various domains. Our investigation into existing architecting approaches and technologies has pointed out the need to develop a simple and intuitive, yet formal language, that expresses multiple layers of abstractions, provides reflexive knowledge about the models, mechanizes data exchange and manipulation, while allowing integration with legacy infrastructures. A small set of linguistic primitives, stateful objects and processes that transform them were identified as both required and sufficient building blocks of the meta-language, specified as an Object-Process Network (OPN). To demonstrate the applicability of OPN, a software environment has been developed and applied to define meta-models of large-scale complex system architectures such as space transportation systems. OPN provides three supporting aspects of architectural modeling. As a declarative language, OPN provides a diagrammatic formal language to help architects specify the space of architectural options. As an imperative language, OPN automates the process of creating architectural option instances and computes associated performance metrics for those instances. As a simulation language, OPN uses a function-algebraic model to subsume and compose discrete, continuous, and probabilistic events within one unified execution engine.by Hsueh-Yung Benjamin Koo.Ph.D
- âŠ