48,710 research outputs found

    Ordinal sums of triangular norms on a bounded lattice

    Full text link
    The ordinal sum construction provides a very effective way to generate a new triangular norm on the real unit interval from existing ones. One of the most prominent theorems concerning the ordinal sum of triangular norms on the real unit interval states that a triangular norm is continuous if and only if it is uniquely representable as an ordinal sum of continuous Archimedean triangular norms. However, the ordinal sum of triangular norms on subintervals of a bounded lattice is not always a triangular norm (even if only one summand is involved), if one just extends the ordinal sum construction to a bounded lattice in a na\"{\i}ve way. In the present paper, appropriately dealing with those elements that are incomparable with the endpoints of the given subintervals, we propose an alternative definition of ordinal sum of countably many (finite or countably infinite) triangular norms on subintervals of a complete lattice, where the endpoints of the subintervals constitute a chain. The completeness requirement for the lattice is not needed when considering finitely many triangular norms. The newly proposed ordinal sum is shown to be always a triangular norm. Several illustrative examples are given

    On the constructions of t-norms and t-conorms on some special classes of bounded lattices

    Get PDF
    summary:Recently, the topic related to the construction of triangular norms and triangular conorms on bounded lattices using ordinal sums has been extensively studied. In this paper, we introduce a new ordinal sum construction of triangular norms and triangular conorms on an appropriate bounded lattice. Also, we give some illustrative examples for clarity. Then, we show that a new construction method can be generalized by induction to a modified ordinal sum for triangular norms and triangular conorms on an appropriate bounded lattice, respectively. And we provide some illustrative examples

    On the construction of t-norms (t-conorms) by using interior (closure) operator on bounded lattices

    Get PDF
    summary:Recently, the topic of construction methods for triangular norms (triangular conorms), uninorms, nullnorms, etc. has been studied widely. In this paper, we propose construction methods for triangular norms (t-norms) and triangular conorms (t-conorms) on bounded lattices by using interior and closure operators, respectively. Thus, we obtain some proposed methods given by Ertuğrul, Karaçal, Mesiar [15] and Çaylı [8] as results. Also, we give some illustrative examples. Finally, we conclude that the introduced construction methods can not be generalized by induction to a modified ordinal sum for t-norms and t-conorms on bounded lattices

    Edge detection on DICOM image using triangular norms in Type-2 fuzzy

    Get PDF
    In image processing, edge detection is an important venture. Fuzzy logic plays a vital role in image processing to deal with lacking in quality of an image or imprecise in nature. This present study contributes an authentic method of fuzzy edge detection through image segmentation. Gradient of the image is done by triangular norms to extract the information. Triangular norms (T norms) and triangular conorms (T conorms) are specialized in dealing uncertainty. Therefore triangular norms are chosen with minimum and maximum operators for the purpose of morphological operations. Also, mathematical properties of aggregation operator to represent the role of morphological operations using Triangular Interval Type-2 Fuzzy Yager Weighted Geometric (TIT2FYWG) and Triangular Interval Type-2 Fuzzy Yager Weighted Arithmetic (TIT2FYWA) operators are derived. These properties represent the components of image processing. Here Edge detection is done for DICOM image by converting into 2D gray scale image, using Type-2 fuzzy MATLAB and which is the novelty of this work

    Bounds on supremum norms for Hecke eigenfunctions of quantized cat maps

    Full text link
    We study extreme values of desymmetrized eigenfunctions (so called Hecke eigenfunctions) for the quantized cat map, a quantization of a hyperbolic linear map of the torus. In a previous paper it was shown that for prime values of the inverse Planck constant N=1/h, such that the map is diagonalizable (but not upper triangular) modulo N, the Hecke eigenfunctions are uniformly bounded. The purpose of this paper is to show that the same holds for any prime N provided that the map is not upper triangular modulo N. We also find that the supremum norms of Hecke eigenfunctions are << N^epsilon for all epsilon>0 in the case of N square free.Comment: 16 pages. Introduction expanded; comparison with supremum norms of eigenfunctions of the Laplacian added. Bound for square free N adde

    Metrics and T-Equalities

    Get PDF
    AbstractThe relationship between metrics and T-equalities is investigated; the latter are a special case of T-equivalences, a natural generalization of the classical concept of an equivalence relation. It is shown that in the construction of metrics from T-equalities triangular norms with an additive generator play a key role. Conversely, in the construction of T-equalities from metrics this role is played by triangular norms with a continuous additive generator or, equivalently, by continuous Archimedean triangular norms. These results are then applied to the biresidual operator ET of a triangular norm T. It is shown that ET is a T-equality on [0, 1] if and only if T is left-continuous. Furthermore, it is shown that to any left-continuous triangular norm T there correspond two particular T-equalities on F(X), the class of fuzzy sets in a given universe X; one of these T-equalities is obtained from the biresidual operator ETT by means of a natural extension procedure. These T-equalities then give rise to interesting metrics on F(X)

    A new perspective on traffic control management using triangular interval type-2 fuzzy sets and interval neutrosophic sets

    Get PDF
    Controlling traffic flow on roads is an important traffic management task necessary to ensure a peaceful and safe environment for people. The number of cars on roads at any given time is always unknown. Type-2 fuzzy sets and neutrosophic sets play a vital role in dealing efficiently with such uncertainty. In this paper, a triangular interval type-2 Schweizer and Sklar weighted arithmetic (TIT2SSWA) operator and a triangular interval type-2 Schweizer and Sklar weighted geometric (TIT2SSWG) operator based on Schweizer and Sklar triangular norms have been studied, and the validity of these operators has been checked using a numerical example and extended to an interval neutrosophic environment by proposing interval neutrosophic Schweizer and Sklar weighted arithmetic (INSSWA) and interval neutrosophic Schweizer and Sklar weighted geometric (INSSWG) operators. Furthermore, their properties have been examined; some of the more important properties are examined in detail. Moreover, we proposed an improved score function for interval neutrosophic numbers (INNs) to control traffic flow that has been analyzed by identifying the junction that has more vehicles. This improved score function uses score values of triangular interval type-2 fuzzy numbers (TIT2FNs) and interval neutrosophic numbers

    Construction of k-Lipschitz triangular norms and conorms from empirical data

    Full text link
    This paper examines the practical construction of k-Lipschitz triangular norms and conorms from empirical data. We apply a characterization of such functions based on k-convex additive generators and translate k-convexity of piecewise linear strictly decreasing functions into a simple set of linear inequalities on their coefficients. This is the basis of a simple linear spline-fitting algorithm, which guarantees k-Lipschitz property of the resulting triangular norms and conorms.<br /
    corecore