Browsing by Author "Hamrawi, Hussam"

Now showing 1 - 8 of 8
  • No Thumbnail Available
    ItemMetadata only
    A convergence upper bound for the Perceptron algorithm
    (2008) Elizondo, David; Hamrawi, Hussam
  • No Thumbnail Available
    ItemMetadata only
    Measures of uncertainty for type-2 fuzzy sets.
    (IEEE, 2010) Hamrawi, Hussam; Coupland, Simon
  • No Thumbnail Available
    ItemMetadata only
    Non-specificity measures for type-2 fuzzy sets.
    (IEEE, 2009) Hamrawi, Hussam; Coupland, Simon
  • No Thumbnail Available
    ItemMetadata only
    A novel alpha-cut representation for type-2 fuzzy sets.
    (IEEE, 2010) Hamrawi, Hussam; Coupland, Simon; John, Robert, 1955-
  • No Thumbnail Available
    ItemMetadata only
    Parallel computation of type-2 fuzzy sets using alpha-cuts
    (IEEE, 2012) Hamrawi, Hussam; Coupland, Simon; John, Robert, 1955-
  • Thumbnail Image
    ItemOpen Access
    Type-2 Fuzzy Alpha-cuts
    (De Montfort University, 2011) Hamrawi, Hussam
    Systems that utilise type-2 fuzzy sets to handle uncertainty have not been implemented in real world applications unlike the astonishing number of applications involving standard fuzzy sets. The main reason behind this is the complex mathematical nature of type-2 fuzzy sets which is the source of two major problems. On one hand, it is difficult to mathematically manipulate type-2 fuzzy sets, and on the other, the computational cost of processing and performing operations using these sets is very high. Most of the current research carried out on type-2 fuzzy logic concentrates on finding mathematical means to overcome these obstacles. One way of accomplishing the first task is to develop a meaningful mathematical representation of type-2 fuzzy sets that allows functions and operations to be extended from well known mathematical forms to type-2 fuzzy sets. To this end, this thesis presents a novel alpha-cut representation theorem to be this meaningful mathematical representation. It is the decomposition of a type-2 fuzzy set in to a number of classical sets. The alpha-cut representation theorem is the main contribution of this thesis. This dissertation also presents a methodology to allow functions and operations to be extended directly from classical sets to type-2 fuzzy sets. A novel alpha-cut extension principle is presented in this thesis and used to define uncertainty measures and arithmetic operations for type-2 fuzzy sets. Throughout this investigation, a plethora of concepts and definitions have been developed for the first time in order to make the manipulation of type-2 fuzzy sets a simple and straight forward task. Worked examples are used to demonstrate the usefulness of these theorems and methods. Finally, the crisp alpha-cuts of this fundamental decomposition theorem are by definition independent of each other. This dissertation shows that operations on type-2 fuzzy sets using the alpha-cut extension principle can be processed in parallel. This feature is found to be extremely powerful, especially if performing computation on the massively parallel graphical processing units. This thesis explores this capability and shows through different experiments the achievement of significant reduction in processing time.
  • Thumbnail Image
    ItemOpen Access
    Type-2 Fuzzy Alpha-Cuts
    (IEEE, 2016) Coupland, Simon; Hamrawi, Hussam; John, Robert, 1955-
    Type-2 fuzzy logic systems make use of type-2 fuzzy sets. To be able to deliver useful type-2 fuzzy logic applications we need to be able to perform meaningful operations on these sets. These operations should also be practically tractable. However, type-2 fuzzy sets suffer the shortcoming of being complex by definition. Indeed, the third dimension, which is the source of extra parameters, is in itself the origin of extra computational cost. The quest for a representation that allow practical systems to be implemented is the motivation for our work. In this paper we define the alpha-cut decomposition theorem for type-2 fuzzy sets which is a new representation analogous to the alpha-cut representation of type-1 fuzzy sets and the extension principle. We show that this new decomposition theorem forms a methodology for extending mathematical concepts from crisp sets to type-2 fuzzy sets directly. In the process of developing this theory we also define a generalisation that allows us to extend operations from interval type-2 fuzzy sets or interval valued fuzzy sets to type-2 fuzzy sets. These results will allow for the more applications of type-2 fuzzy sets by expiating the parallelism that the research here affords.
  • No Thumbnail Available
    ItemMetadata only
    Type-2 fuzzy arithmetic using Alpha-planes.
    (European Society of Fuzzy Logic and Technology, 2009) Hamrawi, Hussam; Coupland, Simon