• Proceedings of the KIEE Conference
• /
• 1997.07c
• /
• pp.927-929
• /
• 1997

In this paper, a new expert system scheme, called Logic Based Expert System (LBES), is proposed for real time fault diagnosis of power system. In LBES, Expertise is represented by logical connectives and converted into a Boolean function. The set of Prime Implicants (PIs) of the Boolean function contains all the sound inference results which can be obtained from the expertise. Therefore, off-line inference is possible by off-line PI identification, which reduces the on-line inference time considerably and makes it possible to utilize-the LBES in real-time environment.

• Journal of Information Management
• /
• v.24 no.3
• /
• pp.1-30
• /
• 1993

Providing users who intend to retrieve document information in korean natural language with direct access to retrieval systems, a korean question processing system was developed in which korean natural language was translated into boolean search statements, which are the most frequently used in current information retrieval systems.

• Journal of Information Management
• /
• v.24 no.3
• /
• pp.73-100
• /
• 1993

In attempting to respond to boolean retrieval system's limitations, this paper presents the design of a retrieval system using fuzzy logic. The fuzzy retrieval system introduces the weights of terms in the documents and in the query and makes use of them to determine how much relevant a document is to the given query. After comparing and analyzing the previous researches, an effective model of the fuzzy retrieval system is suggested and the performance of the system is evaluated through actual examples.

• Proceedings of the Korea Institutes of Information Security and Cryptology Conference
• /
• 1992.11a
• /
• pp.131-138
• /
• 1992

공용키 암호법의 대표적인 것으로 El Gamal 암호법과 RSA 암호법이 있는데, RAS 암호법은 정수의 인수분해가 어렵다는 것에 안전성을 둔 반면에 El Gamal 암호법은 discrete logarithm을 푸는 것이 어렵다는데 안전성을 두고 있다. (6) 그런데 유한체상의 멱승과 곱셈이 효율적으로 수행이 된다면 El Gamal 암호법이 유용하다는 사살을 알게 되었다. 그런데 Copperxmith의 이산로그 알고리즘을 이용하면 n〉1000이 되어야 El Gamal 암호법이 안전성을 보장 받을 수 있으나 이 경우 복잡도의 증가로 인한 gate수의 급속한 증가로 고속연산전용 VLSI 설계시 어려움이 있다. (3) 그래서 본 논문은 복잡도를 줄일 수 있는 정규기저들의 탐색에 연구의 중점을 두었다.

• Korean Journal of Computational Design and Engineering
• /
• v.11 no.4
• /
• pp.235-245
• /
• 2006

This paper proposes a CSG-based representation scheme for heterogeneous objects including multi-material objects and Functionally Graded Materials (FGMs). In particular, this scheme focuses on the construction of complicated heterogeneous objects guaranteeing desired material continuities at all the interfaces. In order to create various types of heterogeneous primitives, we first describe methods for specifying material composition functions such as geometry-independent, geometry-dependent functions. Constructive Material Composition (CMC) and corresponding heterogeneous Boolean Operators (e.g. material union, difference, intersection. and partition) are then proposed to illustrate how material continuities are dealt with. Finally, we describe the model hierarchy and data structure for computer representation. Even though the proposed scheme alone is sufficient for modeling all sorts of heterogeneous objects, the proposed scheme adopts a hybrid representation between CSG and decomposition. That is because hybrid representation can avoid the unnecessary growth of binary trees.

• Journal of Korea Society of Industrial Information Systems
• /
• v.18 no.1
• /
• pp.25-35
• /
• 2013

Automatically deriving only individual don't-care minterms that can effectively reduce a Boolean logic expressions are being investigated. Don't-care conditions play an important role in optimizing logic design. The type of unknown don't-care minterms that can always reduce the number of product terms in Boolean expression are referred as single hypothetical don't-care (S-HDC) minterms. This paper describes the Quasi Quine-McCluskey method that systematically derives S-HDC minterms. For the most part, this method is similar to the original Quine-McCluskey method in deriving the prime implicants. However, the Quasi Quine-McCluskey method further derives S-HDC minterms by applying so-called a combinatorial comparison operation. Upon completion of the procedure, the designer can review generated S-HDC minterms to test its appropriateness for a particular application.

• The Transactions of the Korea Information Processing Society
• /
• v.6 no.3
• /
• pp.766-772
• /
• 1999

With the increase of portable system and high-density IC, power consumption of VLSI circuits is very important factor in design process. Power estimation is required in order to estimate the power consumption. A simple and correct solution of power estimation is to use circuit simulation. But it is very time consuming and inefficient way. Probabilistic method has been proposed to overcome this problem. Transition density using probability was an efficient method to estimate power consumption using BDD and Boolean difference. But it is difficult to build the BDD and compute complex Boolean difference. In this paper, we proposed Propowest. Propowest is building a digraph of circuit, and easy and fast in computing transition density by using modified COP algorithm. Propowest provides an efficient way for power estimation.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2014.11a
• /
• pp.849-852
• /
• 2014

Reverse engineering of gene regulatory network is a challenging task in computational biology. To detect a regulatory relationship among genes from time series data is called reverse engineering. Reverse engineering helps to discover the architecture of the underlying gene regulatory network. Besides, it insights into the disease process, biological process and drug discovery. There are many statistical approaches available for reverse engineering of gene regulatory network. In our paper, we propose pairwise mutual information for the reverse engineering of a gene regulatory network from time series data. Firstly, we create random boolean networks by the well-known $Erd{\ddot{o}}s-R{\acute{e}}nyi$ model. Secondly, we generate artificial time series data from that network. Then, we calculate pairwise mutual information for predicting the network. We implement of our system on java platform. To visualize the random boolean network graphically we use cytoscape plugins 2.8.0.

• Journal of the Optical Society of Korea
• /
• v.9 no.3
• /
• pp.111-118
• /
• 2005

In this paper, a new optical parallel binary arithmetic processor (OPBAP) capable of computing arbitrary n-bit look-ahead carry full-addition is proposed and implemented. The conventional Boolean algebra is considered to implement OPBAP by using two schemes of optical logic processor. One is space-variant optical logic gate processor (SVOLGP), the other is shadow-casting optical logic array processor (SCOLAP). SVOLGP can process logical AND and OR operations different in space simultaneously by using free-space interconnection logic filters, while SCOLAP can perform any possible 16 Boolean logic function by using spatial instruction-control filter. A dual-rail encoding method is adopted because the complement of an input is needed in arithmetic process. Experiment on OPBAP for an 8-bit look-ahead carry full addition is performed. The experimental results have shown that the proposed OPBAP has a capability of optical look-ahead carry full-addition with high computing speed regardless of the data length.

• Kyungpook Mathematical Journal
• /
• v.45 no.4
• /
• pp.481-489
• /
• 2005

We first show that any complete MV-algebra whose Boolean subalgebra of idempotent elements is atomic, called a complete MV-algebra with atomic center, is isomorphic to a product of unit interval MV-algebra 1's and finite linearly ordered MV-algebras of A(m)-type $(m{\in}{\mathbb{Z}}^+)$. Secondly, for a semi-simple MV-algebra A, we introduce a completion ${\delta}(A)$ of A which is a complete, MV-algebra with atomic center. Under their intrinsic topologies $(see\;{\S}3)$ A is densely embedded into ${\delta}(A)$. Moreover, ${\delta}(A)$ has the extension universal property so that complete MV-algebras with atomic centers are epireflective in semi-simple MV-algebras