http://chineseinput.net/에서 pinyin(병음)방식으로 중국어를 변환할 수 있습니다.
변환된 중국어를 복사하여 사용하시면 됩니다.
ON SOME PROPERTIES OF SOFT α-IDEALS
TOUQEER, M.,ASLAM MALIK, M. The Korean Society for Computational and Applied M 2015 Journal of applied mathematics & informatics Vol.33 No.5
The notion of soft α-ideals and α-idealistic soft BCI-algebras is introduced and their basic properties are discussed. Relations between soft ideals and soft α-ideals of soft BCI-algebras are provided. Also idealistic soft BCI-algebras and α-idealistic soft BCI-algebras are being related. The restricted intersection, union, restricted union, restricted difference and "AND" operation of soft α-ideals and α-idealistic soft BCI-algebras are established. The characterizations of (fuzzy) α-ideals in BCI-algebras are given by using the concept of soft sets. Relations between fuzzy α-ideals and α-idealistic soft BCI-algebras are discussed.
On some properties of soft $\alpha$-ideals
M. Touqeer,M. Aslam Malik 한국전산응용수학회 2015 Journal of applied mathematics & informatics Vol.33 No.5
The notion of soft $\alpha$-ideals and $\alpha$-idealistic soft BCI-algebras is introduced and their basic properties are discussed. Relations between soft ideals and soft $\alpha$-ideals of soft BCI-algebras are provided. Also idealistic soft BCI-algebras and $\alpha$-idealistic soft BCI-algebras are being related. The restricted intersection, union, restricted union, restricted difference and ``AND" operation of soft $\alpha$-ideals and $\alpha$-idealistic soft BCI-algebras are established. The characterizations of (fuzzy) $\alpha$-ideals in BCI-algebras are given by using the concept of soft sets. Relations between fuzzy $\alpha$-ideals and $\alpha$-idealistic soft BCI-algebras are discussed.
The quotient of product BCI-algebra via a fuzzy q-ideal
Young Hee Kim,Kyong Ah Oh 한국지능시스템학회 2006 한국지능시스템학회 학술발표 논문집 Vol.- No.-
For a fuzzy q-ideal of a BCI-algebra, the quotient of BCI-algebra is a quasi-associative BCI-algebra, but the inverse is not true. We investigate the condition that the inverse of the statement is true and generalize it for the quotient structure of product BCI-algebra.
전영배,Wieslaw A. Dudek 영남수학회 2008 East Asian mathematical journal Vol.24 No.2
As a generalization of BCI-algebras, the notion of pseudo-BCI algebras is introduced, and some of their properties are investigated. Characterizations of pseudo-BCI algebras are established. Some conditions for a pseudo-BCI algebra to be a pseudo-BCK algebra are given.
The Category of p-semisimple BCI-algebra
S .M. A.Zaidi,Shabbir Khan 경북대학교 자연과학대학 수학과 2003 Kyungpook mathematical journal Vol.43 No.2
In 1985, Tiande and Chang introduced the concept of p semisimple BCI-algebras. In this paper, we analyze properties of p semisimple BCI-algebras through categorical methods. We observe that the category of p semisimple BCI-algebras is a very nice category which is regular, normal, balanced, complete, abelian and equivalent to the category Ab of abelian groups.
Dudek, Wieslaw A.,Jun, Young-Bae The Youngnam Mathematical Society Korea 2008 East Asian mathematical journal Vol.24 No.2
As a generalization of BCI-algebras, the notion of pseudo-BCI algebras is introduced, and some of their properties are investigated. Characterizations of pseudo-BCI algebras are established. Some conditions for a pseudo-BCI algebra to be a pseudo-BCK algebra are given.
Design Considerations of Linear Algebra Processor for Wearable Brain-Computer Interface System
변우석,김도균,김성연,김지훈 한국과학기술원 반도체설계교육센터 2021 IDEC Journal of Integrated Circuits and Systems Vol.7 No.3
– In this paper, we introduced design considerations of a wearable brain-computer interface (BCI) that performs a target identification algorithm based on linear algebra. Steady-state visual evoked potential (SSVEP) based wearable BCI have been studied to enable paralyzed patients to communicate with others. However, performance indicators such as target identification accuracy and the information transfer rate (ITR) still need to be further improved for wearable devices. This paper discusses several considerations for designing algorithms and linear algebra accelerating hardware. In the case of target identification algorithms, a signal binarization technique and candidate reduction technique which are proposed in the previous works can be considered in single-channel SSVEP-based software implementations and multi-channel SSVEP processing in hardware to reduce computational complexity, respectively. For hardware architecture design, we introduced architectural considerations of processing element array that can effectively perform various linear algebra operations. In this paper, we introduced design considerations of a wearable brain-computer interface (BCI) that performs a target identification algorithm based on linear algebra. Steady-state visual evoked potential (SSVEP) based wearable BCI have been studied to enable paralyzed patients to communicate with others. However, performance indicators such as target identification accuracy and the information transfer rate (ITR) still need to be further improved for wearable devices. This paper discusses several considerations for designing algorithms and linear algebra accelerating hardware. In the case of target identification algorithms, a signal binarization technique and candidate reduction technique which are proposed in the previous works can be considered in single-channel SSVEP-based software implementations and multi-channel SSVEP processing in hardware to reduce computational complexity, respectively. For hardware architecture design, we introduced architectural considerations of processing element array that can effectively perform various linear algebra operations.
FSI-IDEALS AND FSC-IDEALS OF BCI-ALGEBRAS
Liu, Yong-Lin,Liu, San-Yang,Meng, Jie Korean Mathematical Society 2004 대한수학회보 Vol.41 No.1
The notions of FSI-ideals and FSC-ideals in BCI-algebras are introduced. The characterization properties of FSI-ideals and FSC-ideals are obtained. We investigate the relations between FSI-ideals (resp. FSC-ideals) and other fuzzy ideals, between FSI-ideals (resp. FSC-ideals) and BCI-algebras, and show that a fuzzy subset of a BCI-algebra is an FSI-ideal if and only if it is both an FSC-ideal and a fuzzy BCI-positive implicative ideal.
PSEUDO P-CLOSURE WITH RESPECT TO IDEALS IN PSEUDO BCI-ALGEBRAS
Hossein Moussaei,Habib Harizavi 한국전산응용수학회 2020 Journal of applied mathematics & informatics Vol.38 No.1
In this paper, for any non-empty subsets A, I of a pseudo BCI-algebra X, we introduce the concept of pseudo p-closure of $A$ with respect to I, denoted by A_I^{pc}, and investigate some related properties. Applying this concept, we state a necessary and sufficient condition for a pseudo BCI-algebra 1) to be a p-semisimple pseudo BCI-algebra; 2) to be a pseudo BCK-algebra. Moreover, we show that A_{0}^{pc} is the least positive pseudo ideal of X containing A, and characterize it by the union of some branches. We also show that the set of all pseudo ideals of X which A_I^{pc}=A, is a complete lattice. Finally, we prove that this notion can be used to define a closure operation.
PSEUDO P-CLOSURE WITH RESPECT TO IDEALS IN PSEUDO BCI-ALGEBRAS
MOUSSAEI, HOSSEIN,HARIZAVI, HABIB The Korean Society for Computational and Applied M 2020 Journal of applied mathematics & informatics Vol.38 No.1
In this paper, for any non-empty subsets A, I of a pseudo BCI-algebra X, we introduce the concept of pseudo p-closure of A with respect to I, denoted by A<sup>pc</sup><sub>I</sub>, and investigate some related properties. Applying this concept, we state a necessary and sufficient condition for a pseudo BCI-algebra 1) to be a p-semisimple pseudo BCI-algebra; 2) to be a pseudo BCK-algebra. Moreover, we show that A<sup>pc</sup><sub>{0}</sub> is the least positive pseudo ideal of X containing A, and characterize it by the union of some branches. We also show that the set of all pseudo ideals of X which A<sup>pc</sup><sub>I</sub> = A, is a complete lattice. Finally, we prove that this notion can be used to define a closure operation.