• 대한수학회보
• /
• 제55권4호
• /
• pp.1179-1187
• /
• 2018

We study the class of rings R with the property that for $x{\in}R$ at least one of the elements x and 1 + x are tripotent. We prove that a commutative ring has this property if and only if it is a subring of a direct product $R_0{\times}R_1{\times}R_2$ such that $R_0/J(R_0){\cong}{\mathbb{z}}_2$, for every $x{\in}J(R_0)$ we have $x^2=2x$, $R_1$ is a Boolean ring, and $R_3$ is a subring of a direct product of copies of ${\mathbb{z}}_3$.

• 한국산학기술학회논문지
• /
• 제12권8호
• /
• pp.3715-3722
• /
• 2011

본 논문에서는 논리합성을 위한 부울 공통식 추출 방법을 제안한다. 제안하는 방법은 주어진 각 논리식들에서 제수/2-큐브 몫들과 2-큐브 몫 쌍들을 산출하고, 이들을 이용해서 2-큐브 몫 행렬을 만든다. 2-큐브 몫들과 행렬로부터 후보식들을 찾고, 다음 이 후보식들의 교집합에 의해 여러 논리식에서 사용되는 공통식을 산출한다. 실험 결과 제안하는 방법은 기존의 방법들보다 전체 논리식의 리터럴 개수를 줄일 수 있었다.

• International Journal of Contents
• /
• 제10권3호
• /
• pp.41-46
• /
• 2014

A cause-effect graph considers only the desired external behavior of a system by identifying input-output parameter relationships in the specification. When testing a software system with cause-effect graphs, it is important to derive a moderate number of tests while avoiding loss in fault detection ability. Pairwise testing is known to be effective in determining errors while considering only a small portion of the input space. In this paper, we present a new testing technique that generates pairwise tests from a cause-effect graph. We use a Boolean Satisbiability (SAT) solver to generate pairwise tests from a cause-effect graph. The Alloy language is used for encoding the cause-effect graphs and its SAT solver is applied to generate the pairwise tests. Using a SAT solver allows us to effectively manage constraints over the input parameters and facilitates the generation of pairwise tests, even in the situations where other techniques fail to satisfy full pairwise coverage.

• 한국산학기술학회논문지
• /
• 제11권6호
• /
• pp.2214-2218
• /
• 2010

대용량 데이터에서 의미있고 유용한 지식을 추출하는 기법 중의 하나인 연관규칙은 데이터베이스에 존재하는 속성들 사이에 유사성 또는 패턴을 기술하여 사용자에게 데이터에 관한 유용한 정보를 줄 수 있다. 기존에 연구되어 온 연관규칙은 이진(boolean) 데이터베이스에 존재하는 유무에 대한 규칙으로 발견하는 것에 대해서 주로 연구되어왔다. 본 논문에서는 정량적 속성의 데이터를 기호적 속성 값으로 바꾼 후 연관규칙을 추출함으로써, 퍼지개념을 사용한 퍼지 연관규칙을 이용한 지능적 질의 처리 시스템을 제안하고자 한다.

• 대한수학회보
• /
• 제46권5호
• /
• pp.845-856
• /
• 2009

A block of an orthomodular lattice L is a maximal Boolean subalgebra of L. A site is a subalgebra of an orthomodular lattice L of the form S = A $\cap$ B, where A and B are distinct blocks of L. An orthomodular lattice L is called with finite sites if |A $\cap$ B| < $\infty$ for all distinct blocks A, B of L. We prove that there exists a weakly path-connected orthomodular lattice with finite sites which is not path-connected and if L is an orthomodular lattice such that the height of the join-semilattice [ComL]$\vee$ generated by the commutators of L is finite, then L is pathconnected.

• 한국지능시스템학회논문지
• /
• 제14권5호
• /
• pp.630-634
• /
• 2004

According to the progress of an information-oriented society, more human friendly systems are required. The systems can be implemented by a kind of intelligent algorithms. In this paper we propose the possibility of the implementation of an intelligent algorithm from gene, behavior of human beings, which has some properties such as self organization and self regulation. The regulation of gene behavior is widely analyzed by Boolean network. Also the SORE (Self Organizable and Regulating Engine) is one of those algorithms. This paper does not report detailed research results; rather, it studies the feasibility of gene behavior in biocontrol systems based upon computer simulations.

• 한국통신학회논문지
• /
• 제7권1호
• /
• pp.25-28
• /
• 1982

본 논문에서는 조합논리회로의 기호적 신뢰도 계정식을 구하는 한 방법을 제시하였다. 한 회로의 모든 입력이(0,1) 값을 갖는 확율변수로 나타내어지고 출력이 부울 적의합(sum of product)식으로 표시되어 지면 출력확률의 계정은 sharp 산법이라고 명명되는 부울 대수 산법에 의하여 기호적으로 계정된다.

• 대한전기학회논문지:전력기술부문A
• /
• 제48권10호
• /
• pp.1344-1348
• /
• 1999

This paper proposes concurrent event propagation technique for timing analysis. The technique makes it possible to find several input vectors and sensitizable paths at the same time. The concurrent event propagation technique is based on the event driven simulation and the timing analysis technique with boolean equations. The technique propagates as many events as possible at the same time while preventing propagation of boolean terms which do not sensitize paths. Since events do not propagate through false paths, the longest path which successfully propagates events to one of the primary outputs is one of the longest sensitizable paths. The technique can speed up timing analysis by unifying path sensitization and maximum delay calculation.

• 대한전자공학회논문지
• /
• 제18권1호
• /
• pp.25-34
• /
• 1981

부울 미분의 개념을 응용하여, Allen-Givone implementation oriented algebra에 의한 다치 논리 회로내의 결함을 해석했다. 회로내의 모든 라인을 그 성질에 따라 다섯 가지 유형으로 분류하였으며 각 유형별로 완전한 테스트 세트를 표현하는 식을 유도하고 증명했다. 이들 식의 실제 응용예의 결과는 진리표와의 비교에 따라 옳음이 확인되었다.

• Journal of applied mathematics & informatics
• /
• 제4권1호
• /
• pp.147-166
• /
• 1997

The convergence of the power sequence of an $n{\times}n$ fuzzy matrix has been studied. Some theoretical necessary and sufficient con-ditions have been established for the power sequence to be convergent generally. Furthermore as one of our main concerns the convergence index was studied in detail especially for some special types of Boolean matrices. Also it has been established that the convergence index is bounded by $(n-1)^2+1$ from above for an arbitrary $n{\times}n$ fuzzy matrix if its power sequence converges. Our method is concentrated on the limit behavior of the power se-quence. It helped us to make our proofs be simpler and more direct that those in pure algebraic methods.