The notion of interval value fuzzy k-ideal of KU-semigroup was studied as a generalization of afuzzy k-ideal of KU-semigroup. Some results of this idea under homomorphism are discussed. Also, we presented some properties about the image (pre-image) for interval~ valued fuzzy~k-ideals of a KU-semigroup. Finally, the~ product of~ interval valued fuzzyk-ideals is established.
In this article, we aim to define a universal set consisting of the subscripts of the fuzzy differential equation (5) except the two elements and , subsets of that universal set are defined according to certain conditions. Then, we use the constructed universal set with its subsets for suggesting an analytical method which facilitates solving fuzzy initial value problems of any order by using the strongly generalized H-differentiability. Also, valid sets with graphs for solutions of fuzzy initial value problems of higher orders are found.
Modeling data acquisition systems (DASs) can support the vehicle industry in the development and design of sophisticated driver assistance systems. Modeling DASs on the basis of multiple criteria is considered as a multicriteria decision-making (MCDM) problem. Although literature reviews have provided models for DASs, the issue of imprecise, unclear, and ambiguous information remains unresolved. Compared with existing MCDM methods, the robustness of the fuzzy decision by opinion score method II (FDOSM II) and fuzzy weighted with zero inconsistency II (FWZIC II) is demonstrated for modeling the DASs. However, these methods are implemented in an intuitionistic fuzzy set environment that restricts the ability of experts to provide mem
... Show MoreIn this research two algorithms are applied, the first is Fuzzy C Means (FCM) algorithm and the second is hard K means (HKM) algorithm to know which of them is better than the others these two algorithms are applied on a set of data collected from the Ministry of Planning on the water turbidity of five areas in Baghdad to know which of these areas are less turbid in clear water to see which months during the year are less turbid in clear water in the specified area.
In this research two algorithms are applied, the first is Fuzzy C Means (FCM) algorithm and the second is hard K means (HKM) algorithm to know which of them is better than the others these two algorithms are applied on a set of data collected from the Ministry of Planning on the water turbidity of five areas in Baghdad to know which of these areas are less turbid in clear water to see which months during the year are less turbid in clear water in the specified area.
Abstract:
One of the important things provided by fuzzy model is to identify the membership functions. In the fuzzy reliability applications with failure functions of the kind who cares that deals with positive variables .There are many types of membership functions studied by many researchers, including triangular membership function, trapezoidal membership function and bell-shaped membership function. In I research we used beta function. Based on this paper study classical method to obtain estimation fuzzy reliability function for both series and parallel systems.
The aim of this paper is to study the Zariski topology of a commutative KU-algebra. Firstly, we introduce new concepts of a KU-algebra, such as KU-lattice, involutory ideal and prime ideal and investigate some basic properties of these concepts. Secondly, the notion of the topology spectrum of a commutative KU-algebra is studied and several properties of this topology are provided. Also, we study the continuous map of this topological space.
In This paper, we introduce the associated graphs of commutative KU-algebra. Firstly, we define the KU-graph which is determined by all the elements of commutative KU-algebra as vertices. Secondly, the graph of equivalence classes of commutative KU-algebra is studied and several examples are presented. Also, by using the definition of graph folding, we prove that the graph of equivalence classes and the graph folding of commutative KU-algebra are the same, where the graph is complete bipartite graph.