• International Journal of Fuzzy Logic and Intelligent Systems
• /
• v.11 no.2
• /
• pp.71-76
• /
• 2011

The problem of decision making under imprecise environments are widely spread in real life decision situations. We present a method of object recognition from imprecise multi observer data, which extends the work of Roy and Maji [J Compu. Appl. Math. 203(2007) 412-418] to generalized intuitionistic fuzzy soft set theory. The method involves the construction of a comparison table from a generalized intuitionistic fuzzy soft set in a parametric sense for decision making.

• Annals of Fuzzy Mathematics and Informatics
• /
• v.16 no.3
• /
• pp.333-336
• /
• 2018

One of the well known results in general topology says that every compact subset of a Hausdorff space is closed. This result in soft topology is not true in general as demonstrated throughout this note. We begin this investigation by showing that [Theorem 3.34, p.p.23] which proposed by Varol and $Ayg{\ddot{u}}n$ [7] is invalid in general, by giving a counterexample. Then we derive under what condition this result can be generalized in soft topology. Finally, we evidence that [Example 3.22, p.p. 20] which introduced in [7] is false, and we make a correction for this example to satisfy a condition of soft Hausdorffness.

• Honam Mathematical Journal
• /
• v.32 no.1
• /
• pp.17-27
• /
• 2010

In this paper we apply the notion of soft sets introduced by Molodtsov to the theory of BF-algebras. Soft BF-subalgebras and homomorphisms in soft BF-algebras are discussed.

• Honam Mathematical Journal
• /
• v.31 no.3
• /
• pp.335-349
• /
• 2009

Soft set theory by Molodtsov is applied to ideals in BCC-algebras. The notion of soft BCC-ideals of soft BCC-algebras and idealistic soft BCC-algebras are introduced, and several examples are provided. Relations between a fuzzy BCC-ideal and an idealistic soft BCC-algebra are given, and the characterization of idealistic soft BCC-algebras is established.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.37A no.10
• /
• pp.841-849
• /
• 2012

This paper proposes an low-complexity soft-output multiple-input multiple-output (soft-MIMO) detection algorithm for achieving soft-output maximum-likelihood (soft-ML) performance under max-log approximation. The proposed algorithm is based on a parallel tree-search (PTS) applying a channel ordering by a sorted-QR decomposition (SQRD) with altered sort order. The empty-set problem that can occur in calculation of log-likelihood ratio (LLR) for each bit is solved by inserting additional nodes at each search level. Since only the closest node is inserted among nodes with opposite bit value to a selected node, the proposed node insertion scheme is very efficient in the perspective of computational complexity. The computational complexity of the proposed algorithm is approximately 37-74% of that of existing algorithms, and from simulation results for a $4{\times}4$ system, the proposed algorithm shows a performance degradation of less than 0.1dB.

• Honam Mathematical Journal
• /
• v.40 no.3
• /
• pp.457-486
• /
• 2018

In several fields the soft set theory has a very vast range uses and applications. A soft group is a proper family of subgroups and a fuzzy soft group is a proper family of fuzzy subgroups. Here in this paper the concept of lattice ordered fuzzy soft groups is introduced. Also its some properties are studied and discussed. In addition, the defintion of lattice order fuzzy soft right (left) cosets and lattice order soft product of fuzzy soft subgroups and some related results are discussed to clear these ideas.

• Communications of the Korean Mathematical Society
• /
• v.28 no.1
• /
• pp.11-24
• /
• 2013

The notion of intersectional soft sets is introduced, and several examples are given. The application of intersectional soft sets to BCK/BCI-algebras is discussed.

• Journal of applied mathematics & informatics
• /
• v.33 no.3_4
• /
• pp.459-467
• /
• 2015

The notion of int-soft implicative filters of a BE-algebra is introduced, and related properties are investigated. The problem of clas- sifying int-soft positive implicative by their γ-inclusive filter is solved. We provide conditions for a soft set to be an int-soft filter. We make a new int-soft implicative filter from old one.

• Bulletin of the Korean Mathematical Society
• /
• v.53 no.5
• /
• pp.1483-1495
• /
• 2016

The notion of int-soft (implicative) filters in lattice implication algebras is introduced, and related properties are investigated. Characterizations of int-soft (implicative) filters are discussed. Conditions for an int-soft filter to be an int-soft implicative filter are provided. Extension property for int-soft implicative filters is established.

• Kyungpook Mathematical Journal
• /
• v.54 no.1
• /
• pp.143-153
• /
• 2014

The notion of double-framed soft filters of a CI-algebra is introduced, and related properties are investigated. Further characterization of a double-framed soft filter is considered, and conditions for a double-framed soft set to be a double-framed soft filter are provided. Finally a new double-framed soft filter from old one is established.