• The Journal of Korean Association of Computer Education
• /
• v.15 no.1
• /
• pp.65-72
• /
• 2012

Generally, a logic function has many factored forms. The problem of finding more compact factored form is one of the basic operations in logic synthesis. In this paper, we present a new method for factoring Boolean functions to assist in educational logic designs. Our method for factorization is to implement two-cube Boolean division with supports of an expression. The number of literals in a factored form is a good estimate of the complexity of a logic function. Our empirical evaluation shows the improvements in literal counts over previous other factorization methods.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2001.10a
• /
• pp.421-424
• /
• 2001

본 논문은 설계 패턴의 효율적인 관리와 재사용을 위하여 패싯 방식을 이용한 패턴 분류와 패싯 항목과 패턴간의 관련성을 이용한 패턴 검색 시소러스를 구축하였다. 저장소에 패턴들의 관계성을 정의하고 새로운 패턴을 삽입 시 임의의 패턴과의 관계성을 지정해주면 시스템은 이 패턴에 연관된 패턴들을 보여주고 사용자는 패턴과의 관계성을 지정해 준다. 패턴 검색은 입력한 질의를 추론하여 검색할 수 있도록 부울 질의 형식을 사용하였다. 그리고 기존의 시소러스의 중복성과 복잡한 비교시간을 최소화하기 위하여 "Gamma 확장 + 패싯" 분류방법을 이용하여 패턴들을 분류하였고, 본 연구의 검색 결과가 보다 더 정확한 패턴이 검색될 수 있도록 하였다.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.17 no.3
• /
• pp.3-15
• /
• 2007

In this paper, we propose a simple scheme which produces a new S-box from a given S-box. We use well-known conversion technique between the polynomial functions over a finite field $F_{2^n}$ and the boolean functions from $F_2^n$ to $F_2$. We have applied this scheme to Rijndael S-box and obtained 29 new S-boxes, whose linear complexities are improved. We investigate their cryptographic properties via transform domain analysis.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.12 no.2
• /
• pp.65-76
• /
• 2002

Shin et al. proposed the new hash function with 160-bit output length at PKC'98. This hash function is based on the advantages of the existing hash functions, such as SHA-1, RIPEMD-160, HAVAL, and etc.$^{[1]}$ Recently, Han et al. cryptanalyzed the hash function proposed at PKC'98 and proposed the method finding a collision pair with $2^{-30}$ probability at FSE 2002, supposing that boolean functions satisfy SAC(Strict Avalanche Criterian).$^{[2]}$ This paper improves the method and shows that we can find a collision pair from the original version of the hash function with $2^{-37.13}$ probability through the improved method. And we point out that the problem of the function comes from shift values dependent on message.

• KSCE Journal of Civil and Environmental Engineering Research
• /
• v.26 no.4D
• /
• pp.695-702
• /
• 2006

In GIS-based Spatial Decision-making Support System (SDSS), the Boolean logic by conventional simple overlay method contains two problems. One is losing lots of information in analysis process, the other is unable to reflect of weighting values between evaluated items. Therefore, evaluation system as Analytic Hierarchy Process (AHP) needs to improve these problems effectively. The purpose of this study is to provide the benefit of AHP method and GIS spatial analysis in site analysis for crop cultivation. First, the weighting value of AHP for topography, distribution grade of water, property of soil and slope items are evaluated throughout survey to experts of soil, crop and agricultural management fields. On the basis of these weighting value of AHP by items, site suitability analysis for black raspberry cultivation is performed. To estimate the benefit of AHP method, the current cultivating map of black raspberry is constructed in Ssangchi-myeon district. In comparison with site analysis of Boolean logic, site analysis of AHP method shows more realistic.

• Proceedings of the IEEK Conference
• /
• 1998.06a
• /
• pp.799-802
• /
• 1998

본 논무은 HLS에서 CPLD 조건식을 고려한 RTL바인딩 기술로서 HDL로 기술된 회로의 스케쥴링을 한후 모듈 연산 간격을 고려하여 합당한 모듈을 선택하고 스케쥴링과 할당을 수행한 후 주어진 조건식에 맞도록 CPLD를 선정한다. 또한 할당된 결과의 모듈을 CPLD 내부의 CLB의 크기를 고려하여 부울식을 분할하고 최적의 CLB를 사용하여 회로를 구현할 수 있도록 binding 알고리즘을 제안하였다.

• Proceedings of the Korean Institute of Communication Sciences Conference
• /
• 2004.07a
• /
• pp.478-478
• /
• 2004

• Korean Journal of Logic
• /
• v.12 no.1
• /
• pp.1-24
• /
• 2009

이 논문에서 우리는 집합의 두 점 사이의 관계를 소개하고, '가깝다'와 '충분히 가깝다'의 위상적인 개념을 다양하게 정의할 수 있음을 보인다. 또한 직관주의 논리와 관계가 있는 De Morgan frame을 소개하고 pre-order에 의하여 정의된 동치관계로 만들어진 동치류들의 집합을 기저로 생성된 위상 공간이 extremally disconnected 임을 보인다.

• Journal of The Korean Association of Information Education
• /
• v.13 no.3
• /
• pp.341-349
• /
• 2009

In this paper, we proposed an Electric Circuit manipulation method to identify easily results of Digital Logic Circuits. Using this method for computer science educations, we can feasibly instruct and understand principles of a Digital Logic Circuit which is a basis of real Digital systems. Furthermore, we developed an PBL-based education program for Digital Logic Circuit concept and Boolean Algebra concept by applying the proposed Electric Circuit manipulation method and by explaining real life Digital Instrument examples. The experimental results are analyzed in views of the problem-solving ability and suitability of allocating degrees of difficulties to the developed Digital Logic Circuit problems.

• Journal of KIISE:Computing Practices and Letters
• /
• v.16 no.5
• /
• pp.601-605
• /
• 2010

In this paper, we propose a GBL(Game Based Learning) content of intelligent tutoring capability. The objective of our GBL content is to learn the Karnaugh Map which is generally used to simplify boolean functions. Our GBL content well-motivates learners with interesting game-based scenarios and also, through an intelligent tutoring module, gives learners adaptive feedbacks such as hints and explanations while maintaining learners' contextual immersion. Additionally, we identified significant improvement in terms of learning effectiveness by analyzing the test results of two (experimental and controlled) student groups learning the Karnaugh Map.