Yong Ho Yon - Academia.edu (original) (raw)

Papers by Yong Ho Yon

Hacettepe Journal of Mathematics and Statistics, Feb 1, 2012

The aim of this paper is to introduce the notion of derivations of subtraction algebras. We defin... more The aim of this paper is to introduce the notion of derivations of subtraction algebras. We define a derivation of a subtraction algebra X as a function d on X satisfying d(x − y) = (d(x) − y) ∧ (x − d(y)) for all x, y ∈ X. Then it is characterized as a function d satisfying d(x − y) = d(x) − y for all x, y ∈ X. Also we define a simple derivation as a function da on X satisfying da(x) = x−a for all x ∈ X. Then every simple derivation is a derivation and every derivation can be partially a simple derivation on intervals. For any derivation d of a subtraction algebra X, Ker(d) and Im(d) are ideals of X, and X/Ker(d) ∼ = Im(d) and X/Im(d) ∼ = Ker(d). Finally, we show that every subtraction algebra X is embedded in Im(d) × Ker(d) for any derivation d of X.

Liberal Arts Innovation Center

Gödel and Łukasiewicz proposed the three-valued logic by adding the third logical situation, whic... more Gödel and Łukasiewicz proposed the three-valued logic by adding the third logical situation, which includes uncertainty and ambiguity, to the classical two logical values, true or false. These logical systems were generalized to the many types of many valued logics, and especially, Gödel’s many valued logic was developed to Heyting algebra and Łukasiewicz’s one to lattice implication algebra. In this paper, we introduce the many valued logics of Gödel and Łukasiewicz, and Heyting’s algebra and lattice implication algebra that are generalizations of Gödel’s and Łukasiewicz’s logic, respectively. Also, we research the properties and relationship of Heyting algebras and lattice implication algebras, especially by defining another implication on a finite lattice implication algebra, we prove finite implication algebra is a special case of Heying algebras.

In this paper, a construction of a congruence having a given filter is presented. Also as a gener... more In this paper, a construction of a congruence having a given filter is presented. Also as a generalization of an BE-algebra homomorphism, the notion of a relation on BE-algebra, called an BE-relation is introduced and some fundamental properties to BE-algebras are discussed.

Journal of Convergence Information Technology, 2018

Cloud services are readily available through a variety of media, attracting a lot of attention fr... more Cloud services are readily available through a variety of media, attracting a lot of attention from users. However, there are various security damages that abuse the privacy of users who use cloud services, so there is not enough technology to prevent them. In this paper, we propose a protection model to safeguard user 's privacy in a cloud environment so as not to illegally exploit user' s privacy. The proposed model randomly manages the user 's signature to strengthen the role of the middle manager and the cloud server. In the proposed model, the user's privacy information is provided illegally by the cloud server to the user through the security function and the user signature. Also, the signature of the user can be safely used by bundling the random number of the multiplication group and the one-way hash function into the hash chain to protect the user's privacy. As a result of the performance evaluation, the proposed model achieved an average improvement of data processing time of 24.5% compared to the existing model and the efficiency of the proposed model was improved by 13.7% than the existing model because the user 's privacy information was group managed.

Scientiae mathematicae Japonicae, 2011

ABSTRACT

The aim of this paper is to introduce the notion of derivations of subtraction algebras. We defin... more The aim of this paper is to introduce the notion of derivations of subtraction algebras. We define a derivation of a subtraction algebra X as a function d on X satisfying d(x − y) = (d(x) − y) ∧ (x − d(y)) for all x, y ∈ X. Then it is characterized as a function d satisfying d(x− y) = d(x)− y for all x, y ∈ X. Also we define a simple derivation as a function da on X satisfying da(x) = x−a for all x ∈ X. Then every simple derivation is a derivation and every derivation can be partially a simple derivation on intervals. For any derivation d of a subtraction algebra X, Ker(d) and Im(d) are ideals of X, and X/Ker(d) ∼= Im(d) and X/Im(d) ∼= Ker(d). Finally, we show that every subtraction algebra X is embedded in Im(d)×Ker(d) for any derivation d of X.

Sphere-packing problem은 주어진 공간에 가능한 한 많은 구(sphere)를 채울 수 있는 배열을 찾는 문제이고 covering problem은 이에 쌍대적인... more Sphere-packing problem은 주어진 공간에 가능한 한 많은 구(sphere)를 채울 수 있는 배열을 찾는 문제이고 covering problem은 이에 쌍대적인 최적화의 문제로 코딩이론에 적용된다. 본 논문에서는 이진 코드이론에서의 가중치(weight)와 해밍거리(Hamming distance)에 대한 개념을 부울 대수(Boolean algebra)의 개념으로 일반화한다. 부울 대수에서의 가중치와 이를 이용하여 거리함수를 정의하고, 이들의 기본적인 성질들을 밝힌다. 또한, 부울 대수에서의 sphere-packing bound와 Gilbert-Varshamov bound의 정리를 증명한다. 【A sphere-packing problem is to find an arrangement of the spheres to fill as large area of the given space as possible, and covering problems are optimization problems which are dual problems to the packing problems. We generalize the concepts of the weight and the Hamming distance for a binary code to those of Boolean algebra. In this paper, we define a weight and a distance on a Boolean algebra and research some properties of the weight and the distance. Also, we prove the notions of the sphere-packing bound and the Gilbert-Varshamov bound on Boolean algebra.】

The aim of this paper is to study the properties of dual BCK-algebra and to prove that the MV-alg... more The aim of this paper is to study the properties of dual BCK-algebra and to prove that the MV-algebra is equvalent to the bounded commutative dual BCK-algebra.

Hacettepe Journal of Mathematics and Statistics, 2012

The aim of this paper is to introduce the notion of derivations of sub- traction algebras. We def... more The aim of this paper is to introduce the notion of derivations of sub- traction algebras. We define a derivation of a subtraction algebra X as a function d on X satisfying d(x − y) = (d(x) − y) ∧ (x − d(y)) for all x,y ∈ X. Then it is characterized as a function d satisfying d(x−y) = d(x)−y for all x,y ∈ X. Also we define a simple derivation as a function da on X satisfying da(x) = x−a for all x ∈ X. Then every simple derivation is a derivation and every derivation can be partially a simple derivation on intervals. For any derivation d of a subtraction al- gebra X, Ker(d) and Im(d) are ideals of X, and X/Ker(d) ∼ Im(d) and X/Im(d) ∼ Ker(d). Finally, we show that every subtraction algebra X is embedded in Im(d) × Ker(d) for any derivation d of X.

Liberal Arts Innovation Center, 2019

Iranian Journal of Fuzzy Systems, 2005

In this paper, we apply the Biswas' idea of anti fuzzy subgroups to ideals of near-rings. We ... more In this paper, we apply the Biswas' idea of anti fuzzy subgroups to ideals of near-rings. We introduce the notion of anti fuzzy ideals of near-rings, and investigate some related properties.

Journal of Convergence Information Technology, 2019

Lattice implication algebra was introduced in [1] as a bounded lattice equipped with a logical im... more Lattice implication algebra was introduced in [1] as a bounded lattice equipped with a logical implication "→" and an involution "′". This algebra is one of many-valued logical systems with a conjunction and a disjunction and a logical implication, which has many interesting properties as algebraic structure and has been studied in many literatures on the algebraic viewpoint[2-6]. The many-valued lattice logic is closely related to computer science dealing with decision making, inference system and artificial intelligence, etc. Lattice implication algebra is a generalization of fuzzy sets with Łukasiewicz fuzzy implication[7]. So it can be used to simplify the logical operations of fuzzy sets, and for the

Convergence Society for SMB, 2017

With the emergence of the fourth industrial revolution, more and more attempts have been made to ... more With the emergence of the fourth industrial revolution, more and more attempts have been made to apply IoT technology to the manufacturing process and launch the product. In this paper, we propose IoT authentication scheme based on hash chain which can easily apply IoT device to small and medium enterprises in Korea. In the proposed method, the companies that installed IoT devices suitable for the manufacturing environment are selected to maintain the linkage between IoT devices so that product information and release information can be efficiently collected and managed during the entire manufacturing process. In addition, the proposed scheme is characterized in that it does not require an additional encryption / decryption algorithm because the authentication information of the IoT device is constructed based on a hash chain. As a result of the performance evaluation, the efficiency of the manufacturing process was improved by 18.5% and the processing of the manufacturing process with the IoT device was shortened by 20.1% on the average according to the application of the IoT device. In addition, the labor cost reduction costs in the manufacturing process decreased by an average of 30.7%.

Applicable Analysis and Discrete Mathematics, 2018

We introduce the notion of bitonic algebras as a generalization of dual BCCalgebras, and define t... more We introduce the notion of bitonic algebras as a generalization of dual BCCalgebras, and define the notion of (r,l)-derivations, (l,r)-derivations and generalized (r,l) and (l,r)-derivations on the bitonic algebras. Then we study the properties of the derivations and the generalized derivations on the bitonic algebras and the commutative bitonic algebras. Finally, we show that every generalized derivation of commutative bitonic algebras is a derivation.

Convergence Society for SMB, 2017

Journal of applied mathematics & informatics, 2015

International Journal of Contents, 2011

Quantum mechanics is a branch of physics for a mathematical description of the particle wave, and... more Quantum mechanics is a branch of physics for a mathematical description of the particle wave, and it is applied to information technology such as quantum computer, quantum information, quantum network and quantum cryptography, etc. In 1936, Garrett Birkhoff and John von Neumann introduced the logic of quantum mechanics (quantum logic) in order to investigate projections on a Hilbert space. As another type of quantum logic, orthomodular implication algebra was introduced by Chajda et al. This algebra has the logical implication as a binary operation. In pure mathematics, there are many algebras such as Hilbert algebras, implicative models, implication algebras and dual BCK-algebras (DBCK-algebras), which have the logical implication as a binary operation. In this paper, we introduce the definitions and some properties of those algebras and clarify the relations between those algebras. Also, we define the implicative poset which is a generalization of orthomodular implication algebras and DBCK-algebras, and research properties of this algebraic structure.

Communications of the Korean Mathematical Society, 2014

In this paper, we introduce the notion of f-derivations from a semilattice S to a lattice L, as a... more In this paper, we introduce the notion of f-derivations from a semilattice S to a lattice L, as a generalization of derivation and fderivation of lattices. Also, we define the simple f-derivation from S to L, and research the properties of them and the conditions for a lattice L to be distributive. Finally, we prove that a distributive lattice L is isomorphic to the class SD f (S, L) of all simple f-derivations on S to L for every ∧-homomorphism f : S → L such that f (x 0) ∨ f (y 0) = 1 for some x 0 , y 0 ∈ S, in particular, L ∼ = SD f (S, L) for every ∧-homomorphism f : S → L such that f (x 0) = 1 for some x 0 ∈ S.

International Journal of Algebra and Statistics, 2013

We introduce the notion of interval-valued fuzzy bi-ideals with respect to the interval Min-norm ... more We introduce the notion of interval-valued fuzzy bi-ideals with respect to the interval Min-norm Min i (briefly, Min i-fuzzy bi-ideals) in semigroups, and we characterize Min i-fuzzy bi-ideals by upper level sets and show that every bi-ideal of a semigroup X can be realized as an upper level ideal of a Min i-fuzzy bi-ideal of X. Finally, we establish the theorems of the homomorphic image and the inverse image.

Hacettepe Journal of Mathematics and Statistics, Feb 1, 2012

The aim of this paper is to introduce the notion of derivations of subtraction algebras. We defin... more The aim of this paper is to introduce the notion of derivations of subtraction algebras. We define a derivation of a subtraction algebra X as a function d on X satisfying d(x − y) = (d(x) − y) ∧ (x − d(y)) for all x, y ∈ X. Then it is characterized as a function d satisfying d(x − y) = d(x) − y for all x, y ∈ X. Also we define a simple derivation as a function da on X satisfying da(x) = x−a for all x ∈ X. Then every simple derivation is a derivation and every derivation can be partially a simple derivation on intervals. For any derivation d of a subtraction algebra X, Ker(d) and Im(d) are ideals of X, and X/Ker(d) ∼ = Im(d) and X/Im(d) ∼ = Ker(d). Finally, we show that every subtraction algebra X is embedded in Im(d) × Ker(d) for any derivation d of X.

Liberal Arts Innovation Center

Gödel and Łukasiewicz proposed the three-valued logic by adding the third logical situation, whic... more Gödel and Łukasiewicz proposed the three-valued logic by adding the third logical situation, which includes uncertainty and ambiguity, to the classical two logical values, true or false. These logical systems were generalized to the many types of many valued logics, and especially, Gödel’s many valued logic was developed to Heyting algebra and Łukasiewicz’s one to lattice implication algebra. In this paper, we introduce the many valued logics of Gödel and Łukasiewicz, and Heyting’s algebra and lattice implication algebra that are generalizations of Gödel’s and Łukasiewicz’s logic, respectively. Also, we research the properties and relationship of Heyting algebras and lattice implication algebras, especially by defining another implication on a finite lattice implication algebra, we prove finite implication algebra is a special case of Heying algebras.

In this paper, a construction of a congruence having a given filter is presented. Also as a gener... more In this paper, a construction of a congruence having a given filter is presented. Also as a generalization of an BE-algebra homomorphism, the notion of a relation on BE-algebra, called an BE-relation is introduced and some fundamental properties to BE-algebras are discussed.

Journal of Convergence Information Technology, 2018

Cloud services are readily available through a variety of media, attracting a lot of attention fr... more Cloud services are readily available through a variety of media, attracting a lot of attention from users. However, there are various security damages that abuse the privacy of users who use cloud services, so there is not enough technology to prevent them. In this paper, we propose a protection model to safeguard user 's privacy in a cloud environment so as not to illegally exploit user' s privacy. The proposed model randomly manages the user 's signature to strengthen the role of the middle manager and the cloud server. In the proposed model, the user's privacy information is provided illegally by the cloud server to the user through the security function and the user signature. Also, the signature of the user can be safely used by bundling the random number of the multiplication group and the one-way hash function into the hash chain to protect the user's privacy. As a result of the performance evaluation, the proposed model achieved an average improvement of data processing time of 24.5% compared to the existing model and the efficiency of the proposed model was improved by 13.7% than the existing model because the user 's privacy information was group managed.

Scientiae mathematicae Japonicae, 2011

ABSTRACT

The aim of this paper is to introduce the notion of derivations of subtraction algebras. We defin... more The aim of this paper is to introduce the notion of derivations of subtraction algebras. We define a derivation of a subtraction algebra X as a function d on X satisfying d(x − y) = (d(x) − y) ∧ (x − d(y)) for all x, y ∈ X. Then it is characterized as a function d satisfying d(x− y) = d(x)− y for all x, y ∈ X. Also we define a simple derivation as a function da on X satisfying da(x) = x−a for all x ∈ X. Then every simple derivation is a derivation and every derivation can be partially a simple derivation on intervals. For any derivation d of a subtraction algebra X, Ker(d) and Im(d) are ideals of X, and X/Ker(d) ∼= Im(d) and X/Im(d) ∼= Ker(d). Finally, we show that every subtraction algebra X is embedded in Im(d)×Ker(d) for any derivation d of X.

Sphere-packing problem은 주어진 공간에 가능한 한 많은 구(sphere)를 채울 수 있는 배열을 찾는 문제이고 covering problem은 이에 쌍대적인... more Sphere-packing problem은 주어진 공간에 가능한 한 많은 구(sphere)를 채울 수 있는 배열을 찾는 문제이고 covering problem은 이에 쌍대적인 최적화의 문제로 코딩이론에 적용된다. 본 논문에서는 이진 코드이론에서의 가중치(weight)와 해밍거리(Hamming distance)에 대한 개념을 부울 대수(Boolean algebra)의 개념으로 일반화한다. 부울 대수에서의 가중치와 이를 이용하여 거리함수를 정의하고, 이들의 기본적인 성질들을 밝힌다. 또한, 부울 대수에서의 sphere-packing bound와 Gilbert-Varshamov bound의 정리를 증명한다. 【A sphere-packing problem is to find an arrangement of the spheres to fill as large area of the given space as possible, and covering problems are optimization problems which are dual problems to the packing problems. We generalize the concepts of the weight and the Hamming distance for a binary code to those of Boolean algebra. In this paper, we define a weight and a distance on a Boolean algebra and research some properties of the weight and the distance. Also, we prove the notions of the sphere-packing bound and the Gilbert-Varshamov bound on Boolean algebra.】

The aim of this paper is to study the properties of dual BCK-algebra and to prove that the MV-alg... more The aim of this paper is to study the properties of dual BCK-algebra and to prove that the MV-algebra is equvalent to the bounded commutative dual BCK-algebra.

Hacettepe Journal of Mathematics and Statistics, 2012

The aim of this paper is to introduce the notion of derivations of sub- traction algebras. We def... more The aim of this paper is to introduce the notion of derivations of sub- traction algebras. We define a derivation of a subtraction algebra X as a function d on X satisfying d(x − y) = (d(x) − y) ∧ (x − d(y)) for all x,y ∈ X. Then it is characterized as a function d satisfying d(x−y) = d(x)−y for all x,y ∈ X. Also we define a simple derivation as a function da on X satisfying da(x) = x−a for all x ∈ X. Then every simple derivation is a derivation and every derivation can be partially a simple derivation on intervals. For any derivation d of a subtraction al- gebra X, Ker(d) and Im(d) are ideals of X, and X/Ker(d) ∼ Im(d) and X/Im(d) ∼ Ker(d). Finally, we show that every subtraction algebra X is embedded in Im(d) × Ker(d) for any derivation d of X.

Liberal Arts Innovation Center, 2019

Iranian Journal of Fuzzy Systems, 2005

In this paper, we apply the Biswas' idea of anti fuzzy subgroups to ideals of near-rings. We ... more In this paper, we apply the Biswas' idea of anti fuzzy subgroups to ideals of near-rings. We introduce the notion of anti fuzzy ideals of near-rings, and investigate some related properties.

Journal of Convergence Information Technology, 2019

Lattice implication algebra was introduced in [1] as a bounded lattice equipped with a logical im... more Lattice implication algebra was introduced in [1] as a bounded lattice equipped with a logical implication "→" and an involution "′". This algebra is one of many-valued logical systems with a conjunction and a disjunction and a logical implication, which has many interesting properties as algebraic structure and has been studied in many literatures on the algebraic viewpoint[2-6]. The many-valued lattice logic is closely related to computer science dealing with decision making, inference system and artificial intelligence, etc. Lattice implication algebra is a generalization of fuzzy sets with Łukasiewicz fuzzy implication[7]. So it can be used to simplify the logical operations of fuzzy sets, and for the

Convergence Society for SMB, 2017

With the emergence of the fourth industrial revolution, more and more attempts have been made to ... more With the emergence of the fourth industrial revolution, more and more attempts have been made to apply IoT technology to the manufacturing process and launch the product. In this paper, we propose IoT authentication scheme based on hash chain which can easily apply IoT device to small and medium enterprises in Korea. In the proposed method, the companies that installed IoT devices suitable for the manufacturing environment are selected to maintain the linkage between IoT devices so that product information and release information can be efficiently collected and managed during the entire manufacturing process. In addition, the proposed scheme is characterized in that it does not require an additional encryption / decryption algorithm because the authentication information of the IoT device is constructed based on a hash chain. As a result of the performance evaluation, the efficiency of the manufacturing process was improved by 18.5% and the processing of the manufacturing process with the IoT device was shortened by 20.1% on the average according to the application of the IoT device. In addition, the labor cost reduction costs in the manufacturing process decreased by an average of 30.7%.

Applicable Analysis and Discrete Mathematics, 2018

We introduce the notion of bitonic algebras as a generalization of dual BCCalgebras, and define t... more We introduce the notion of bitonic algebras as a generalization of dual BCCalgebras, and define the notion of (r,l)-derivations, (l,r)-derivations and generalized (r,l) and (l,r)-derivations on the bitonic algebras. Then we study the properties of the derivations and the generalized derivations on the bitonic algebras and the commutative bitonic algebras. Finally, we show that every generalized derivation of commutative bitonic algebras is a derivation.

Convergence Society for SMB, 2017

Journal of applied mathematics & informatics, 2015

International Journal of Contents, 2011

Quantum mechanics is a branch of physics for a mathematical description of the particle wave, and... more Quantum mechanics is a branch of physics for a mathematical description of the particle wave, and it is applied to information technology such as quantum computer, quantum information, quantum network and quantum cryptography, etc. In 1936, Garrett Birkhoff and John von Neumann introduced the logic of quantum mechanics (quantum logic) in order to investigate projections on a Hilbert space. As another type of quantum logic, orthomodular implication algebra was introduced by Chajda et al. This algebra has the logical implication as a binary operation. In pure mathematics, there are many algebras such as Hilbert algebras, implicative models, implication algebras and dual BCK-algebras (DBCK-algebras), which have the logical implication as a binary operation. In this paper, we introduce the definitions and some properties of those algebras and clarify the relations between those algebras. Also, we define the implicative poset which is a generalization of orthomodular implication algebras and DBCK-algebras, and research properties of this algebraic structure.

Communications of the Korean Mathematical Society, 2014

In this paper, we introduce the notion of f-derivations from a semilattice S to a lattice L, as a... more In this paper, we introduce the notion of f-derivations from a semilattice S to a lattice L, as a generalization of derivation and fderivation of lattices. Also, we define the simple f-derivation from S to L, and research the properties of them and the conditions for a lattice L to be distributive. Finally, we prove that a distributive lattice L is isomorphic to the class SD f (S, L) of all simple f-derivations on S to L for every ∧-homomorphism f : S → L such that f (x 0) ∨ f (y 0) = 1 for some x 0 , y 0 ∈ S, in particular, L ∼ = SD f (S, L) for every ∧-homomorphism f : S → L such that f (x 0) = 1 for some x 0 ∈ S.

International Journal of Algebra and Statistics, 2013

We introduce the notion of interval-valued fuzzy bi-ideals with respect to the interval Min-norm ... more We introduce the notion of interval-valued fuzzy bi-ideals with respect to the interval Min-norm Min i (briefly, Min i-fuzzy bi-ideals) in semigroups, and we characterize Min i-fuzzy bi-ideals by upper level sets and show that every bi-ideal of a semigroup X can be realized as an upper level ideal of a Min i-fuzzy bi-ideal of X. Finally, we establish the theorems of the homomorphic image and the inverse image.