• Journal of Information Processing Systems
• /
• 제9권1호
• /
• pp.1-30
• /
• 2013

The capitalization of know-how, knowledge management, and the control of the constantly growing information mass has become the new strategic challenge for organizations that aim to capture the entire wealth of knowledge (tacit and explicit). Thus, knowledge mapping is a means of (cognitive) navigation to access the resources of the strategic heritage knowledge of an organization. In this paper, we present a new mapping approach based on the Boolean modeling of critical domain knowledge and on the use of different data sources via the data mining technique in order to improve the process of acquiring knowledge explicitly. To evaluate our approach, we have initiated a process of mapping that is guided by machine learning that is artificially operated in the following two stages: data mining and automatic mapping. Data mining is be initially run from an induction of Boolean case studies (explicit). The mapping rules are then used to automatically improve the Boolean model of the mapping of critical knowledge.

• 대한전자공학회논문지
• /
• 제21권4호
• /
• pp.43-51
• /
• 1984

부울함수의 간소화법에서 Quine Mcclustey법은 최소항들의 2진수 표현의 구조를 조사하는 방법을 쓰고 있다. 이 논문에서는 10진수로 표현한 최소항을 가지고 그들간의 큐브관계와 간소화에 따르는 제규칙을 정리로 간추려 표현하고 증명하였으며, 이들을 바탕으로 새로운 알고리즘의 부울함수 간소화법을 제안하였다. 예제를 들어 손작업의 방법을 보였고 아울러 이 과정을 FORTRAN 프로그램으로 작성하였다. 프로그램은 여분항을 포함하여 100개까지의 최소항을 가진 부울함수에 대하여 진성주항을 찾아 인쇄하도록 작성하였는데(배열을 크게 잡으면 그 이상도 가능함), 모든 경우에 손작업과 일치하는 결과를 얻었다.

• 정보처리학회논문지A
• /
• 제15A권1호
• /
• pp.9-16
• /
• 2008

본 논문에서는 논리합성을 위한 공통식 추출 방법을 새롭게 제안한다. 제안하는 방법은 주어진 각 논리식들에서 2개의 큐브만으로 구성된 2-큐브 논리식 쌍을 추출한다. 2개의 큐브로 구성된 논리식 쌍들로부터 2-큐브 행렬을 만들고, 여기에 2-큐브 논리식의 보수를 추가하여 확장된 2-큐브 행렬과 압축 2-큐브 행렬을 만든다. 다음, 공통식 추출을 위해 압축 2-큐브 행렬을 분석한다. 그리디 방법(greedy method)에 의해 가장 많은 리터럴 개수를 줄일 수 있는 공통식을 선택한다. 실험결과 여러 벤치마크 회로에 대하여 제안한 방법을 논리회로 합성도구에 활용할 경우 기존 합성도구보다 리터럴 개수를 줄일 수 있음을 보였다.

• 대한수학회지
• /
• 제51권1호
• /
• pp.113-123
• /
• 2014

The term rank of a matrix A over a semiring $\mathcal{S}$ is the least number of lines (rows or columns) needed to include all the nonzero entries in A. In this paper, we characterize linear operators that preserve the sets of matrix ordered pairs which satisfy extremal properties with respect to term rank inequalities of matrices over nonbinary Boolean semirings.

• 논리연구
• /
• 제9권2호
• /
• pp.1-30
• /
• 2006

This paper investigates algebraic semantics for some weak Boolean (wB) logics, which may be regarded as left-continuous t-norm based logics (or monoidal t-norm based logics (MTLs)). We investigate as infinite-valued logics each of wB-LC and wB-sKD, and each corresponding first order extension $wB-LC\forall$ and $wB-sKD\forall$. We give algebraic completeness for each of them.

• 한국지능시스템학회논문지
• /
• 제16권3호
• /
• pp.338-348
• /
• 2006

We classify the 3-classes In the semigroup M$_5$(F) of all 5$\times$5 Boolean matrices over F=(0,1).

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2000년도 추계종합학술대회 논문집(2)
• /
• pp.337-340
• /
• 2000

In this paper, we put forth a procedure that target low power logic synthesis based on XOR representation of Boolean functions, and the results of synthesis procedure are a multi-level XOR form with minimum switching activity. Specialty, this paper show a method to extract the common cubes or kernels by Boolean matrix and rectangle covering, and to estimate the power consumption in terms of the extracted common sub-functions.

• 대한수학회논문집
• /
• 제18권2호
• /
• pp.207-214
• /
• 2003

There exist two distinct Symmetric differences in a non Boolean orthomodular lattics. Let L be an orthomodular lattice. Then L is a Boolean algebra if and only if one symmetric difference is equal to the other. An orthomodular lattice L is Boolean if and only if one of two symmetric differences of L is associative.

• Journal of applied mathematics & informatics
• /
• 제18권1_2호
• /
• pp.197-204
• /
• 2005

For two distinct rank-1 matrices A and B, a rank-1 matrix C is called a separating matrix of A and B if the rank of A + C is 2 but the rank of B + C is 1 or vice versa. In this case, rank-1 matrices A and B are said to be separable. We show that every pair of distinct Boolean rank-l matrices are separable.

• 대한수학회보
• /
• 제58권2호
• /
• pp.515-526
• /
• 2021

Denote by ��+ the set of probability measures supported on ℝ+. Suppose V�� is the variance function of the Cauchy-Stieltjes Kernel (CSK) family ��-(��) generated by a non degenerate probability measure �� ∈ ��+. We determine the formula for variance function under boolean multiplicative convolution power. This formula is used to identify the relation between variance functions under the map ${\nu}{\mapsto}{\mathbb{M}}_t({\nu})=({\nu}^{{\boxtimes}(t+1)})^{{\uplus}{\frac{1}{t+1}}}$ from ��+ onto itself.