• Journal of Korea Society of Industrial Information Systems
• /
• v.12 no.2
• /
• pp.68-78
• /
• 2007

D-class is defined as a set of equivalent $n{\times}n$ boolean matrices according to a given equivalence relation. The D-class computation requires the multiplication of three boolean matrices for each of all possible triples of $n{\times}n$ boolean matrices. However, almost all the researches on boolean matrices focused on the efficient multiplication of only two boolean matrices and a few researches have recently been shown to deal with the multiplication of all boolean matrices. The paper suggests a mathematical theory that enables the efficient multiplication for all possible boolean matrix triples and the efficient computation of all D-classes, and discusses algorithms designed with the theory and their execution results.

• Korean Journal of Mathematics
• /
• v.28 no.2
• /
• pp.285-294
• /
• 2020

We study the complementary information set codes (for short, CIS codes) over 𝔽₄. They are strongly connected to correlation-immune functions over 𝔽₄. Also the class of CIS codes includes the self-dual codes. We find a construction method of CIS codes over 𝔽₄ and a criterion for checking equivalence of CIS codes over 𝔽₄. We complete the classification of all inequivalent CIS codes of length up to 8 over 𝔽₄.

• Journal of applied mathematics & informatics
• /
• v.5 no.3
• /
• pp.659-668
• /
• 1998

In this paper we introduce and study a new class of gen-eralized mildly nonlinear complementarity problems for fuzzy map-pings. We use the change of variabes technique to establish the equivalence between the generalized mildly nonlinear complementar-ity problems and the Wiener-Hopf equations. This equivalence is used to suggest and analyze a number of iterative algorithm for solv-ing the generalized mildly nonlinear complemetarity problems.

• Honam Mathematical Journal
• /
• v.26 no.4
• /
• pp.391-399
• /
• 2004

In this paper, we develop an iterative algorithm for solving a class of nonlinear mixed implicit variational inequalities in Hilbert spaces. The resolvent operator technique is used to establish the equivalence between variational inequalities and fixed point problems. This equivalence is used to study the existence of a solution of nonlinear mixed implicit variational inequalities and to suggest an iterative algorithm for solving variational inequalities. In our results, we do not assume that the mapping is strongly monotone.

• Journal of applied mathematics & informatics
• /
• v.7 no.1
• /
• pp.101-113
• /
• 2000

In this paper, we introduce and study a new class of variational inclusions, called the set-valued quasi variational inclusions. The resolvent operator technique is used to establish the equivalence between the set-valued variational inclusions and the fixed point problem. This equivalence is used to study the existence of a solution and to suggest a number of iterative algorithms for solving the set-valued variational inclusions. We also study the convergence criteria of these algorithms.

• Proceedings of the Korean Information Science Society Conference
• /
• 1998.10a
• /
• pp.386-388
• /
• 1998

Multiprotocol Label Switching(MPLS)는 기존 인터넷 라우팅에서 사용하는 longest prefix match 방식 대신에 short label exact match 방식을 사용함으로써 더 단순한 고속 포워딩 기술을 제공한다. 또한, 동일한 Forwarding Equivalence Class(FEC)에속하는 플로우들을 합성하여 하나의 레이블을 사용하는 방법 즉, Multipoint-to-point Tree(MPT)를 형성함으로써 확장설을 향상시켰다. 본 논문에선 현재 이슈가 괴고 있는 "IP address prefix"와 "host LSP"의 FEC타입과는 전송방식이 다른 브로드캐스팅을 위한"broadcast"FEC 타입을 제안하였으며, 브로드캐스트 패킷을 전송하는데 있어서 각각의Label Switched Path(LSP)제어 방식을 사용할 경우의 문제점을 분석하고, 유니캐스팅과 브로드캐스팅의 서로 다른 레이블 할당방식으로 인한 레이블 충돌을 해결하기 위해서 레이블 범위를 분류하여 사용하는 방식을 제안한다.해서 레이블 범위를 분류하여 사용하는 방식을 제안한다.

• Journal of applied mathematics & informatics
• /
• v.20 no.1_2
• /
• pp.465-478
• /
• 2006

In this paper, we introduce a new class of completely generalized strongly nonlinear quasivariational inequalities and establish its equivalence with a class of fixed point problems by using the resolvent operator technique. Utilizing this equivalence, we develop a three-step iterative scheme with errors, obtain a few existence theorems of solutions for the completely generalized non-linear strongly quasivariational inequality involving relaxed monotone, relaxed Lipschitz, strongly monotone and generalized pseudocontractive mappings and prove some convergence and stability results of the sequence generated by the three-step iterative scheme with errors. Our results include several previously known results as special cases.

• International Journal of Fuzzy Logic and Intelligent Systems
• /
• v.4 no.2
• /
• pp.249-253
• /
• 2004

When we decide the software quality on the basis of the software measurement, the transitive property which is a requirement for an equivalence relation is not always satisfied. Therefore, we propose a scheme for classifying the software quality that employs a tolerance relation instead of an equivalence relation. Given the experimental data set, the proposed scheme generates the tolerant classes for elements in the experiment data set, and generates the tolerant ranges for classifying the software quality by clustering the means of the tolerance classes. Through the experiment, we showed that the proposed scheme could product very useful and valid results. That is, it has no problems that we use as the criteria for classifying the software quality the tolerant ranges generated by the proposed scheme.

• Proceedings of the KIEE Conference
• /
• 1997.07b
• /
• pp.616-619
• /
• 1997

The spectrum-recovery scheme in Hadamard transform spectroscopy is commonly implemented with a fast Hadamard transform (FHT). When the Hadamard or simplex matrix corresponding to the mask does not have the same ordering as the Hadamard matrix corresponding to the FHT, a modification is required. When the two Hadamard matrices are in the same equivalence class, this modification can be implemented as a permutation scheme. This paper investigates permutation schemes for this application. This paper is to relieve the confusion about the applicability of existing techniques, reveals a new, more efficient method: and leads to an extension that allows a permutation scheme to be applied to any Hadamard or simplex matrix in the appropriate equivalence class.

• Communications of the Korean Mathematical Society
• /
• v.32 no.2
• /
• pp.353-359
• /
• 2017

Starting from a t-norm T, it is possible to construct a class of new t-norms, so-called T-generalized t-norm. The purpose of this paper is to describe some properties of this class of generalized t-norms. An algebraic structure as well as a binary relation among t-norms are also investigated. Some open problems are discussed as well.