• Journal of the Korean Institute of Telematics and Electronics
• /
• v.22 no.2
• /
• pp.25-30
• /
• 1985

This paper proposes an algorithm to simplify Boolean functions into near minimal sum-of-products for Programmable Logic Arrays. In contrast to the conventional procedures, where the execution time depends on the number of variables, the execution time by this procedure depends on the degree of consensus of base minterms. Thus as the number of variables is increased, the difference of CPU time becomes larger using this new Procedure than using other procedures and consequently the executable range of input function increasing. The algorithm has been implemented on CYEER 170-740 and it's results were compared with those using Arvalo's algorithm.

• Journal for History of Mathematics
• /
• v.12 no.1
• /
• pp.32-44
• /
• 1999

This paper is a sequel to [8]. Development of modern logic was initiated by Boole and Morgan. Boolean logic is one of their completed works. Cantor created the set theory along with cardinal and ordinal numbers. His theory on infinite sets brought about a remarkable development on modern mathematical theory, but generated many paradoxes (e.g. Russell Paradox) that in turn motivated mathematicians to solve them. Further, mathematicians attempted to construct sound foundations for Mathematics. As a result three important schools of thought were formed in relation to fundamentals of mathematics for the resolution of paradoxes of set theory, namely logicism developed by Russell and Whitehead, intuitionism lead by Brouwer and formalism contended by Hilbert and Bernays. In this paper, we examine the logic for intuitionism which is originated by Brouwer in 1908 and study Heyting algebra.

• Proceedings of the Korea Institutes of Information Security and Cryptology Conference
• /
• 1997.11a
• /
• pp.315-321
• /
• 1997

본 논문에서는 임의의 부울함수(Boolean function)에 대한 진리표나 출력 시퀀스로부터 논리곱의 배타적 합(exclusive-or sum of products; ESOP)형의 부울함수를 구성하는 알고리듬을 제안한다. 기존에 알려진 카르노맵이나 Quine HcClusky법에 의하여 구해지는 부울함수는 논리곱의 합(sum of product; SOP) 형으로 주어지며 이들 수식은 부정(NOT)논리를 포함하는 경우가 있다. 제안된 알고리듬에 의하여 구해지는 부울함수는 구조적인 등가성을 판별하는데 편리하므로 해쉬함수용 부울함수의 개발에 이용될 수 있다.

• 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.

• 제어로봇시스템학회:학술대회논문집
• /
• 1987.10b
• /
• pp.407-412
• /
• 1987

A large scale programmable controller is developed which adopts a multiprocessor structure. The developed programmable controller consists of the programmer, the system controller, and the input-output unit. The structure and characteristics of the system controller will be described. The PC has a special hardware scheme to solve the Boolean logic instructions of the sequence control programs. The multiprocessor structure and the special hardware enables, the real time operation and the high speed scanning which is prerequisite to the large scale, programmable controller even for many I/O points.

• Journal of the Korean Society for Library and Information Science
• /
• v.32 no.4
• /
• pp.249-274
• /
• 1998

It is the analyses of replies showed n the questionnaire consisted of four kinds of matters to see level of knowledge among SELIS (SEoul Women's University Library and Information System) OPAC users of keyword/boolean search. The result of this analyses is : in SELIS search, users who prefer keyword search than any other, who satisfy work of retrieval by means of boolean operator, and who think it easier, show lusher level of knowledge than those who deny it in the questionnaire. Knowledges Presented in the survey are ; characteristics of keyword search, single or double keys, using boolean operator in keyword, knowledge of index, knowledge of stop list, uncontrolled term. keyword search technique, right truncation, correct application of boolean logic operator, and selecting major subject in keyword browsing. The above mentioned knowledges will work as important factors n keyword/boolean search, OPAC. For successful search it requires conceptional knowledge of information retrieval processing, or inquiry word transformation how to search required information, and semantic ability to get result questioned In the given system, when and how to apply the characteristics of the system, and scientific record for user's inquiry, or fundamental computer technology and syntax knowledge to make search word in detail. But so far now important knowledge considered as user's online index search, has been emphasized on knowledge of scientific record, and has been lag of semantic and conceptional knowledge. So, it is recommendable for online index user to train to concentrate semantic knowledge, syntax ability, and conceptional knowledge, rather than scientific technique too much.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.29B no.11
• /
• pp.56-64
• /
• 1992

The sum-of-product type MVL (Multiple-valued logic) functions can be directly transformed into the exclusive-sum-of-literal-product(ESOLP) type MVL functions with a substitution of the OR operator with the exclusive-OR(XOR) operator. This paper presents an algorithm that can reduce the number of minterms for the purpose of minimizing the hardware size and the complexity of the circuit in the realization of ESOLP-type MVL functions. In Boolean algebra, the joinable true minterms can form the cube, and if some cubes form a cube-chain with adjacent cubes by the insertion of false cubes(or, false minterms), then the created cube-chain can become a large cube which includes previous cubes. As a result of the cube grouping, the number of minterms can be reduced artificially. Since ESOLP-type MVL functions take the MIN/XOR structure, a XOR circuit and a four-valued MIN/XOR dynamic-CMOS PLA circuit is designed for the realization of the minimized functions, and PSPICE simulation results have been also presented for the validation of the proposed algorithm.

• Journal of the Korean Institute of Landscape Architecture
• /
• v.30 no.1
• /
• pp.1-10
• /
• 2002

The purpose of this article is to examine land use change in the fringe area of a metropolitan city through multi-temporal data analysis. Change detection has been regarded as one of the most important applications for utilization of remotely sensed imageries. Conventionally, two images were used for change detection, and Arithmetic calculators were generally used on the process. Meanwhile, multi-temporal change detection for a large number of images has been carried out. In this paper, a digital land-use map and three Landsat TM data were utilized for the multi-temporal change detection Each urban area map was extracted as a base map on the process of multi-temporal change detection. Each urban area map was converted to bit image by using boolean logic. Various urban change types could be obtained by stacking the urban area maps derived from the multi-temporal data using Geographic Information System(GIS). Urban change type map was created by using the process of piling up the bit images. Then the urban change type map was compared with each land cover map for the change detection. Dalseo-gu of Daegu city and Hwawon-eup of Dalsung-gun, the fringe area of Daegu Metropolitan city, were selected for the test area of this multi-temporal change detection method. The districts are adjacent to each other. Dalseo-gu has been developed for 30 yeais and so a large area of paddy land has been changed into a built-up area. Hwawon-eup, near by Dalseo-gu, has been influenced by the urbanization of Dalseo-gu. From 1972 to 1999, 3,507.9ha of agricultural area has been changed into other land uses, while 72.7ha of forest area has been altered. This agricultural area was designated as a 'Semi-agricultural area'by the National landuse Management Law. And it was easy for the preserved area to be changed into a built-up area once it would be included as urban area. Finally, the method of treatment and management of the preserved area needs to be changed to prevent the destruction of paddy land by urban sprawl on the urban fringe.

• Journal of Korean Society for Geospatial Information Science
• /
• v.8 no.2 s.16
• /
• pp.117-127
• /
• 2000

The economic development and the development of medical treatment by scientific technology development progressed the level of national people life and improved average life gradually. In this reason, old people who have finance power would like to receive a comport and high level service, though paying proper expense. In this study, receiving this requirement, we focused that silver town have reasonable and comfortable residing environment in developing rural and rest form silver town objecting external area of Chon-Ju city, and selected land suitability. Through the learning of the neural network theory in the method of land suitability, we applied in the full of study area and improved a flexible determination making as giving each class value in each cell. Also, we compare a method of land suitability using the neural network theory, and it's analysis with a method of land suitability by the duplication method of Boolean Logic have been used In Geo Spatial Information System(GSIS) and proved the Boolean Logic's lose of values and the propriety.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.23 no.6
• /
• pp.711-718
• /
• 2019

BDD is a well-known alternative to the conventional Boolean logic method in fault tree analysis. As the size of fault tree increases, the calculation time and computer resources for BDD dramatically increase. A new failure path search and path restructure method is proposed for efficient calculation of CS and MCS from BDD. Failure path grouping and bottom-up path search is proved to be efficient in failure path search in BDD and path restructure is also proved to be used in order to reduce the number of CS comparisons for MCS extraction. With these newly proposed methods, the top event probability can be calculated using the probability by ASDMP(Approximate Sum of Disjoint MCS Products), which is shown to be equivalent to the result by the conventional MCUB(Minimal Cut Upper Bound) probability.