• International Journal of Fuzzy Logic and Intelligent Systems
• /
• v.14 no.1
• /
• pp.57-65
• /
• 2014

In this paper, we investigate the properties of L-lower approximation operators as a generalization of fuzzy rough set in complete residuated lattices. We study relations lower (upper, join meet, meet join) approximation operators and Alexandrov L-topologies. Moreover, we give their examples as approximation operators induced by various L-fuzzy relations.

• International Journal of Fuzzy Logic and Intelligent Systems
• /
• v.14 no.3
• /
• pp.222-230
• /
• 2014

In this paper, we investigate the properties of join and meet preserving maps in complete residuated lattice using Zhang's the fuzzy complete lattice which is defined by join and meet on fuzzy posets. We define L-upper (resp. L-lower) approximation operators as a generalization of fuzzy rough sets in complete residuated lattices. Moreover, we investigate the relations between L-upper (resp. L-lower) approximation operators and L-fuzzy preorders. We study various L-fuzzy preorders on $L^X$. They are considered as an important mathematical tool for algebraic structure of fuzzy contexts.

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 1998.06a
• /
• pp.63-68
• /
• 1998

This paper proposes fuzzy regression analysis with non-symmetric fuzzy coefficients. By assuming non-symmetric triangular fuzzy coefficients and applying the quadratic programming fomulation, the center of the obtained fuzzy regression model attains more central tendency compared to the one with symmetric triangular fuzzy coefficients. For a data set composed of crisp inputs-fuzzy outputs, two approximation models called an upper approximation model and a lower approximation model are considered as the regression models. Thus, we also propose an integrated quadratic programming problem by which the upper approximation model always includes the lower approximation model at any threshold level under the assumption of the same centers in the two approximation models. Sensitivities of Weight coefficients in the proposed quadratic programming approaches are investigated through real data.

• ETRI Journal
• /
• v.15 no.3
• /
• pp.35-45
• /
• 1994

In this paper we develop an approximation formalism on the queue length distribution for general queueing models. Our formalism is based on two steps of approximation; the first step is to find a lower bound on the exact formula, and subsequently the Chernoff upper bound technique is applied to this lower bound. We demonstrate that for the M/M/1 model our formula is equivalent to the exact solution. For the D/M/1 queue, we find an extremely tight lower bound below the exact formula. On the other hand, our approach shows a tight upper bound on the exact distribution for both the ND/D/1 and M/D/1 queues. We also consider the $M+{\Sigma}N_jD/D/1$ queue and compare our formula with other formalisms for the $M+{\Sigma}N_jD/D/1$ and M+D/D/1 queues.

• Journal of applied mathematics & informatics
• /
• v.31 no.1_2
• /
• pp.221-228
• /
• 2013

The method of upper and lower solutions and the generalized quasilinearization technique is developed for the existence and approximation of solutions to boundary value problems for higher order fractional differential equations of the type $^c\mathcal{D}^qu(t)+f(t,u(t))=0$, $t{\in}(0,1),q{\in}(n-1,n],n{\geq}2$ $u^{\prime}(0)=0,u^{\prime\prime}(0)=0,{\ldots},u^{n-1}(0)=0,u(1)={\xi}u({\eta})$, where ${\xi},{\eta}{\in}(0,1)$, the nonlinear function f is assumed to be continuous and $^c\mathcal{D}^q$ is the fractional derivative in the sense of Caputo. Existence of solution is established via the upper and lower solutions method and approximation of solutions uses the generalized quasilinearization technique.

• Kyungpook Mathematical Journal
• /
• v.55 no.3
• /
• pp.549-562
• /
• 2015

In this paper we introduce the pointfree version of rough sets. For this we consider a lattice L instead of the power set P(X) of a set X. We study the properties of lower and upper pointfree approximation, precise elements, and their relation with prime elements. Also, we study lower and upper pointfree approximation as a Galois connection, and discuss the relations between partitions and Galois connections.

• Communications of the Korean Mathematical Society
• /
• v.21 no.4
• /
• pp.653-664
• /
• 2006

As a generalization of ideals in subtraction algebras, the notion of rough ideals is discussed.

• Journal of applied mathematics & informatics
• /
• v.25 no.1_2
• /
• pp.551-562
• /
• 2007

This paper concerns a relationship between rough sets, intuitionistic fuzzy sets and ring theory. We consider a ring as a universal set and we assume that the knowledge about objects is restricted by an intuitionistic fuzzy ideal. We apply the notion of intutionistic fuzzy ideal of a ring for definitions of the lower and upper approximations in a ring. Some properties of the lower and upper approximations are investigated.

• 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.

• Korean Journal of Mathematics
• /
• v.29 no.1
• /
• pp.81-89
• /
• 2021

In this paper, we introduce the notions of a distance function, Alexandrov topology and ⊖-upper (⊕-lower) approximation operator based on complete co-residuated lattices. Under various relations, we define (⊕, ⊖)-fuzzy rough set on complete co-residuated lattices. Moreover, we study their properties and give their examples.