• Title/Summary/Keyword: Upper sets

Search Result 201, Processing Time 0.028 seconds

Some Positive Dependent Orderings

  • Tae-Sung Kim;Song-Ho Kim
    • Journal of the Korean Statistical Society
    • /
    • v.25 no.2
    • /
    • pp.243-253
    • /
    • 1996
  • Let X and Y be random vectors in R$^{n}$ . A random vector X is 'more associated' than Y if and only if P(X $\in$ A ∩ B) - P(X $\in$ A)P(X $\in$ B) $\geq$ P(Y $\in$ A ∩ B)-P(Y $\in$ A)P(Y $\in$ B) for all open upper sets A and B. By requiring the above inequality to hold for some open upper sets A and B various notions of positive dependence orderings which are weaker than 'more associated' ordering are obtained. First a general theory is given and then the results are specialized to some concepts of a particular interest. Various properties and interrelationships are derived.

  • PDF

Another representation of hand written English alphabets by a sequence of fuzzy sets

  • Moon, Byung-Soo
    • International Journal of Fuzzy Logic and Intelligent Systems
    • /
    • v.3 no.2
    • /
    • pp.157-160
    • /
    • 2003
  • In this paper, we describe how to represent lower case hand-written English alphabets by a sequence of two to seven fuzzy sets. Each fuzzy set represents an arc segment of the character and each arc segment is assumed to be a part of an ellipse. The part of an ellipse is defined by five quantities; its short and long radii, its orientation angle, whether it is a part of the lower half or the upper half, and whether it is the full half or a part of a half. Hence, we use the Cartesian product of five fuzzy sets to represent each arc segment. We show that this representation is a translation, rotation, and scaling invariant and that it can be used to generate the hand-written English alphabets. The representation we describe is different from the one proposed earlier by the author and when compared with the previous representation, the one described in this paper simulates more closely the behavior of how one writes English characters.

SOFT INTERSECTION AND SOFT UNION k-IDEALS OF HEMIRINGS AND THEIR APPLICATIONS

  • Anjum, Rukhshanda;Lodhi, Aqib Raza Khan;Munir, Mohammad;Kausar, Nasreen
    • Korean Journal of Mathematics
    • /
    • v.30 no.2
    • /
    • pp.263-281
    • /
    • 2022
  • The main aim of this paper is to discuss two different types of soft hemirings, soft intersection and soft union. We discuss applications and results related to soft intersection hemirings or soft intersection k-ideals and soft union hemirings or soft union k-ideals. The deep concept of k-closure, intersection and union of soft sets, ∧-product and ∨-product among soft sets, upper 𝛽-inclusion and lower 𝛽-inclusion of soft sets is discussed here. Many applications related to soft intersection-union sum and soft intersection-union product of sets are investigated in this paper. We characterize k-hemiregular hemirings by the soft intersection k-ideals and soft union k-ideals.

AN EXTENSION OF SOFT ROUGH FUZZY SETS

  • Beg, Ismat;Rashid, Tabasam
    • Korean Journal of Mathematics
    • /
    • v.25 no.1
    • /
    • pp.71-85
    • /
    • 2017
  • This paper introduces a novel extension of soft rough fuzzy set so-called modified soft rough fuzzy set model in which new lower and upper approximation operators are presented together their related properties that are also investigated. Eventually it is shown that these new models of approximations are finer than previous ones developed by using soft rough fuzzy sets.

A SHORT REMARK ON CONTROL SYSTEMS

  • Chu, Hahng-Yun;Ku, Se-Hyun;Yoo, Seung Ki
    • Journal of the Chungcheong Mathematical Society
    • /
    • v.29 no.1
    • /
    • pp.165-170
    • /
    • 2016
  • Souza and Tozatti [7] introduce the notions of prolongations and prolongational limit sets on control systems. In this article, we prove the upper semicontinuity of first positive prolongations and first positive prolongational limit sets on control systems.

SOME NOTES ON STRONG LAW OF LARGE NUMBERS FOR BANACH SPACE VALUED FUZZY RANDOM VARIABLES

  • Kim, Joo-Mok;Kim, Yun Kyong
    • Korean Journal of Mathematics
    • /
    • v.21 no.4
    • /
    • pp.383-399
    • /
    • 2013
  • In this paper, we establish two types of strong law of large numbers for fuzzy random variables taking values on the space of normal and upper-semicontinuous fuzzy sets with compact support in a separable Banach space. The first result is SLLN for strong-compactly uniformly integrable fuzzy random variables, and the other is the case of that the averages of its expectations converges.

Intuitionistic Fuzzy Rough Approximation Operators

  • Yun, Sang Min;Lee, Seok Jong
    • International Journal of Fuzzy Logic and Intelligent Systems
    • /
    • v.15 no.3
    • /
    • pp.208-215
    • /
    • 2015
  • Since upper and lower approximations could be induced from the rough set structures, rough sets are considered as approximations. The concept of fuzzy rough sets was proposed by replacing crisp binary relations with fuzzy relations by Dubois and Prade. In this paper, we introduce and investigate some properties of intuitionistic fuzzy rough approximation operators and intuitionistic fuzzy relations by means of topology.

Similarity Measure Between Interval-valued Vague Sets (구간값 모호집합 사이의 유사척도)

  • Cho, Sang-Yeop
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.19 no.5
    • /
    • pp.603-608
    • /
    • 2009
  • In this paper, a similarity measure between interval-valued vague sets is proposed. In the interval-valued vague sets representation, the upper bound and the lower bound of a vague set are represented as intervals of interval-valued fuzzy set respectively. Proposed method combines the concept of geometric distance and the center-of-gravity point of interval-valued vague set to evaluate the degree of similarity between interval-valued vague sets. We also prove three properties of the proposed similarity measure. It provides a useful way to measure the degree of similarity between interval-valued vague sets.

An O($n^2log n$) Algorithm for the Linear Knapsack Problem with SUB and Extended GUB Constraints (단순상한 및 확장된 일반상한제약을 갖는 선형배낭문제의 O($n^2log n$) 해법)

    • Journal of the Korean Operations Research and Management Science Society
    • /
    • v.22 no.3
    • /
    • pp.1-9
    • /
    • 1997
  • We present an extension of the well-known generalized upper bound (GUB) constraint and consider a linear knapsack problem with both the extended GUB constraints and the simple upper bound (SUB) constraints. An efficient algorithm of order O($n^2log n$) is developed by exploiting structural properties and applying binary search to ordered solution sets, where n is the total number of variables. A numerical example is presented.

  • PDF

VARIATION OF ORBIT-COINCIDENCE SETS

  • Srivastava, Anjali
    • Journal of the Chungcheong Mathematical Society
    • /
    • v.15 no.1
    • /
    • pp.1-6
    • /
    • 2002
  • David Gavid [3] proved that in many familiar cases the upper semi-finite topology on the set of closed subsets of a space is the largest topology making the coincidence function continuous, when the collection of functions is given the graph topology. Considering G-spaces and taking the coincidence set to consist of points where orbits coincidence, we obtain G-version of many of his results.

  • PDF