Slicing Strategies for the Generalised Type-2 Mamdani Fuzzy Inferencing System

The final publication is available at Springer via http://dx.doi.org/[insert DOI]".As a three-dimensional object, there are a number of ways of slicing a generalised type-2 fuzzy set. In the context of the Mamdani Fuzzy Inferencing System, this paper concerns three accepted slicing strategies, the vertical slice, the wavy slice, and the horizontal slice or alpha -plane. Two ways of de ning the generalised type-2 fuzzy set, vertical slices and wavy slices, are presented. Fuzzi cation and inferencing is presented in terms of vertical slices. After that, the application of all three slicing strategies to defuzzi cation is described, and their strengths and weaknesses assessed

Learning of Type-2 Fuzzy Logic Systems using Simulated Annealing.

This thesis reports the work of using simulated annealing to design more efficient fuzzy logic systems to model problems with associated uncertainties. Simulated annealing is used within this work as a method for learning the best configurations of type-1 and type-2 fuzzy logic systems to maximise their modelling ability. Therefore, it presents the combination of simulated annealing with three models, type-1 fuzzy logic systems, interval type-2 fuzzy logic systems and general type-2 fuzzy logic systems to model four bench-mark problems including real-world problems. These problems are: noise-free Mackey-Glass time series forecasting, noisy Mackey-Glass time series forecasting and two real world problems which are: the estimation of the low voltage electrical line length in rural towns and the estimation of the medium voltage electrical line maintenance cost. The type-1 and type-2 fuzzy logic systems models are compared in their abilities to model uncertainties associated with these problems. Also, issues related to this combination between simulated annealing and fuzzy logic systems including type-2 fuzzy logic systems are discussed. The thesis contributes to knowledge by presenting novel contributions. The first is a novel approach to design interval type-2 fuzzy logic systems using the simulated annealing algorithm. Another novelty is related to the first automatic design of general type-2 fuzzy logic system using the vertical slice representation and a novel method to overcome some parametrisation difficulties when learning general type-2 fuzzy logic systems. The work shows that interval type-2 fuzzy logic systems added more abilities to modelling information and handling uncertainties than type-1 fuzzy logic systems but with a cost of more computations and time. For general type-2 fuzzy logic systems, the clear conclusion that learning the third dimension can add more abilities to modelling is an important advance in type-2 fuzzy logic systems research and should open the doors for more promising research and practical works on using general type-2 fuzzy logic systems to modelling applications despite the more computations associated with it

Shingle 2.0: generalising self-consistent and automated domain discretisation for multi-scale geophysical models

The approaches taken to describe and develop spatial discretisations of the domains required for geophysical simulation models are commonly ad hoc, model or application specific and under-documented. This is particularly acute for simulation models that are flexible in their use of multi-scale, anisotropic, fully unstructured meshes where a relatively large number of heterogeneous parameters are required to constrain their full description. As a consequence, it can be difficult to reproduce simulations, ensure a provenance in model data handling and initialisation, and a challenge to conduct model intercomparisons rigorously. This paper takes a novel approach to spatial discretisation, considering it much like a numerical simulation model problem of its own. It introduces a generalised, extensible, self-documenting approach to carefully describe, and necessarily fully, the constraints over the heterogeneous parameter space that determine how a domain is spatially discretised. This additionally provides a method to accurately record these constraints, using high-level natural language based abstractions, that enables full accounts of provenance, sharing and distribution. Together with this description, a generalised consistent approach to unstructured mesh generation for geophysical models is developed, that is automated, robust and repeatable, quick-to-draft, rigorously verified and consistent to the source data throughout. This interprets the description above to execute a self-consistent spatial discretisation process, which is automatically validated to expected discrete characteristics and metrics.Comment: 18 pages, 10 figures, 1 table. Submitted for publication and under revie

A Process Modelling Framework Based on Point Interval Temporal Logic with an Application to Modelling Patient Flows

This thesis considers an application of a temporal theory to describe and model the patient journey in the hospital accident and emergency (A&E) department. The aim is to introduce a generic but dynamic method applied to any setting, including healthcare. Constructing a consistent process model can be instrumental in streamlining healthcare issues. Current process modelling techniques used in healthcare such as flowcharts, unified modelling language activity diagram (UML AD), and business process modelling notation (BPMN) are intuitive and imprecise. They cannot fully capture the complexities of the types of activities and the full extent of temporal constraints to an extent where one could reason about the flows. Formal approaches such as Petri have also been reviewed to investigate their applicability to the healthcare domain to model processes. Additionally, to schedule patient flows, current modelling standards do not offer any formal mechanism, so healthcare relies on critical path method (CPM) and program evaluation review technique (PERT), that also have limitations, i.e. finish-start barrier. It is imperative to specify the temporal constraints between the start and/or end of a process, e.g., the beginning of a process A precedes the start (or end) of a process B. However, these approaches failed to provide us with a mechanism for handling these temporal situations. If provided, a formal representation can assist in effective knowledge representation and quality enhancement concerning a process. Also, it would help in uncovering complexities of a system and assist in modelling it in a consistent way which is not possible with the existing modelling techniques. The above issues are addressed in this thesis by proposing a framework that would provide a knowledge base to model patient flows for accurate representation based on point interval temporal logic (PITL) that treats point and interval as primitives. These objects would constitute the knowledge base for the formal description of a system. With the aid of the inference mechanism of the temporal theory presented here, exhaustive temporal constraints derived from the proposed axiomatic system’ components serves as a knowledge base. The proposed methodological framework would adopt a model-theoretic approach in which a theory is developed and considered as a model while the corresponding instance is considered as its application. Using this approach would assist in identifying core components of the system and their precise operation representing a real-life domain deemed suitable to the process modelling issues specified in this thesis. Thus, I have evaluated the modelling standards for their most-used terminologies and constructs to identify their key components. It will also assist in the generalisation of the critical terms (of process modelling standards) based on their ontology. A set of generalised terms proposed would serve as an enumeration of the theory and subsume the core modelling elements of the process modelling standards. The catalogue presents a knowledge base for the business and healthcare domains, and its components are formally defined (semantics). Furthermore, a resolution theorem-proof is used to show the structural features of the theory (model) to establish it is sound and complete. After establishing that the theory is sound and complete, the next step is to provide the instantiation of the theory. This is achieved by mapping the core components of the theory to their corresponding instances. Additionally, a formal graphical tool termed as point graph (PG) is used to visualise the cases of the proposed axiomatic system. PG facilitates in modelling, and scheduling patient flows and enables analysing existing models for possible inaccuracies and inconsistencies supported by a reasoning mechanism based on PITL. Following that, a transformation is developed to map the core modelling components of the standards into the extended PG (PG*) based on the semantics presented by the axiomatic system. A real-life case (from the King’s College hospital accident and emergency (A&E) department’s trauma patient pathway) is considered to validate the framework. It is divided into three patient flows to depict the journey of a patient with significant trauma, arriving at A&E, undergoing a procedure and subsequently discharged. Their staff relied upon the UML-AD and BPMN to model the patient flows. An evaluation of their representation is presented to show the shortfalls of the modelling standards to model patient flows. The last step is to model these patient flows using the developed approach, which is supported by enhanced reasoning and scheduling

Geometric Fuzzy Logic Systems

There has recently been a significant increase in academic interest in the field oftype-2 fuzzy sets and systems. Type-2 fuzzy systems offer the ability to model and reason with uncertain concepts. When faced with uncertainties type-2 fuzzy systems should, theoretically, give an increase in performance over type-l fuzzy systems. However, the computational complexity of generalised type-2 fuzzy systems is significantly higher than type-l systems. A direct consequence of this is that, prior to this thesis, generalised type-2 fuzzy logic has not yet been applied in a time critical domain, such as control. Control applications are the main application area of type-l fuzzy systems with the literature reporting many successes in this area. Clearly the computational complexity oftype-2 fuzzy logic is holding the field back. This restriction on the development oftype-2 fuzzy systems is tackled in this research. This thesis presents the novel approach ofdefining fuzzy sets as geometric objects - geometric fuzzy sets. The logical operations for geometric fuzzy sets are defined as geometric manipulations of these sets. This novel geometric approach is applied to type-I, type-2 interval and generalised type-2 fuzzy sets and systems. The major contribution of this research is the reduction in the computational complexity oftype-2 fuzzy logic that results from the application of the geometric approach. This reduction in computational complexity is so substantial that generalised type-2 fuzzy logic has, for the first time, been successfully applied to a control problem - mobile robot navigation. A detailed comparison between the performance of the generalised type-2 fuzzy controller and the performance of the type-l and type-2 interval controllers is given. The results indicate that the generalised type-2 fuzzy logic controller outperforms the other robot controllers. This outcome suggests that generalised type-2 fuzzy systems can offer an improved performance over type-l and type-2 interval systems

FastJet user manual

FastJet is a C++ package that provides a broad range of jet finding and analysis tools. It includes efficient native implementations of all widely used 2-to-1 sequential recombination jet algorithms for pp and e+e- collisions, as well as access to 3rd party jet algorithms through a plugin mechanism, including all currently used cone algorithms. FastJet also provides means to facilitate the manipulation of jet substructure, including some common boosted heavy-object taggers, as well as tools for estimation of pileup and underlying-event noise levels, determination of jet areas and subtraction or suppression of noise in jets.Comment: 69 pages. FastJet 3 is available from http://fastjet.fr

CALF: Categorical Automata Learning Framework

Automata learning is a popular technique used to automatically construct an automaton model from queries, and much research has gone into devising specific adaptations of such algorithms for different types of automata. This thesis presents a unifying approach to many existing algorithms using category theory, which eases correctness proofs and guides the design of new automata learning algorithms. We provide a categorical automata learning framework---CALF---that at its core includes an abstract version of the popular L* algorithm. Using this abstract algorithm we derive several concrete ones. We instantiate the framework to a large class of Set functors, by which we recover for the first time a tree automata learning algorithm from an abstract framework, which moreover is the first to cover also algebras of quotiented polynomial functors. We further develop a general algorithm to learn weighted automata over a semiring. On the one hand, we identify a class of semirings, principal ideal domains, for which this algorithm terminates and for which no learning algorithm previously existed; on the other hand, we show that it does not terminate over the natural numbers. Finally, we develop an algorithm to learn automata with side-effects determined by a monad and provide several optimisations, as well as an implementation with experimental evaluation. This allows us to improve existing algorithms and opens the door to learning a wide range of automata