• Journal of the Korea Society of Computer and Information
• /
• v.19 no.3
• /
• pp.109-117
• /
• 2014

This paper revises the Quine-McCluskey Algorithm to circuit minimization problems. Quine-McCluskey method repeatedly finds the prime implicant and employs additional procedures such as trial-and-error, branch-and-bound, and Petrick's method as a means of circuit minimization. The proposed algorithm, on the contrary, produces an implicant chart beforehand to simplify the search for the prime implicant. In addition, it determines a set cover to streamline the search for $1^{st}$ and $2^{nd}$ essential prime implicants. When applied to 3-variable and 4-variable experimental data, the proposed algorithm has indeed proved to obtain the optimal solutions much more simply and accurately than the Quine-McCluskey method.

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

• KIPS Transactions on Computer and Communication Systems
• /
• v.4 no.12
• /
• pp.391-398
• /
• 2015

This paper devises a performance improvement and evaluation process of circuit minimization algorithms for mentorship education of distinguished informatics gifted secondary students. In the process, students learn that there are several alternative equivalent circuits for a target function and recognize the necessity for formalized circuit minimization methods. Firstly, they come at the concept of circuit minimization principle from Karnaugh Map which is a manual methodology. Secondly, they explore Quine-McCluskey algorithm which is a computational methodology. Quine-McCluskey algorithm's time complexity is high because it uses set operations. To improve the performance of Quine-McCluskey algorithm, we encourage them to adopt a bit-wise data structure instead of integer array for sets. They will eventually see that the performance achievement is about 36%. The ultimate goal of the process is to enlarge gifted students' interest and integrated knowledge about computer science encompassing electronic switches, logic gates, logic circuits, programming languages, data structures and algorithms.

• Proceedings of the Korean Society of Computer Information Conference
• /
• 2014.01a
• /
• pp.373-376
• /
• 2014

최근 모바일 기기 및 무선기기의 발달로 인하여 센서 네트워크가 다양한 분야에서 응용되고 있다. 따라서 센서에서 실시간으로 발생하는 스트리밍 데이터에서 이벤트를 감지하고 분석하는 것은 중요한 연구 분야로 부각되고 있다. 단순 이벤트의 발생 조건을 빠르게 판별하기 위해 비트맵 인덱스 기반 복합 이벤트 검출 기법 등 여러 가지 방법들이 사용되고 있지만, 아직까지 이기종 센서에서 발생하는 각기 다른 형태의 데이터를 융합하여 이벤트를 검출하는 복합 이벤트 처리에 대한 연구는 미비한 실정이다. 본 논문에서는 각기 다른 형태를 가지는 스트리밍 데이터에 멤버쉽 함수를 적용하여 퍼지화 함으로서 이기종 센서에서 발생하는 데이터를 융합 처리가능하며, Quine-Mccluskey 감축기법을 통하여 규칙의 신뢰도 및 속도가 향상된 의사결정을 하는 고속 이벤트 탐지기법을 제안한다.

• Korean Journal of Logic
• /
• v.14 no.1
• /
• pp.77-102
• /
• 2011

This paper is about the problems that Quine's criterion of ontological commitment creates for Nominalists. Quine's clear criterion of ontological commitment, summarized as "to be is to be the value of a variable", means that when we accept a sentence to be true, we are committed to the existence of things that must exist for the sentence to be true. The criterion causes problems for Nominalists. According to Quine's criterion, Nominalists who consider "Humility is a virtue" as true should accept the existence of the property, humility. However, Nominalists are reluctant to accept that properties such as humility exist, although they wish to accept what is meant by "humility is a virtue". The way out of this predicament is presenting a paraphrase which delivers what Nominalists wanted to say through the original sentence without ontological commitment to the property. Several attempts were made to paraphrase such sentences, only to fail. In this paper, successful paraphrases will be presented to cope with previously discussed difficulties. Beforehand, several issues involved in the Quine's criterion will be clarified. Also, Lewis's critical objection that we should give up the business of paraphrase will be discussed.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.41 no.4
• /
• pp.51-58
• /
• 2004

This paper proposes a new artificial immune approach to on-line hardware test which is the most indispensable technique for fault tolerant hardware. A novel algorithm of generating tolerance conditions is suggested based on the principle of the antibody diversity. Tolerance conditions in artificial immune system correspond to the antibody in biological immune system. In addition, antigen presenting cell (APC) is realized by Quine-McCluskey method in this algorithm and tolerance conditions are generated through GA (Genetic Algorithm). The suggested method is applied to the on-line monitoring of a typical FSM (a decade counter) and its effectiveness is demonstrated by the computer simulation.

• Journal of the Korean Mathematical Society
• /
• v.29 no.1
• /
• pp.127-140
• /
• 1992

• Journal of the Korea Society of Computer and Information
• /
• v.20 no.4
• /
• pp.95-102
• /
• 2015

This paper proposes a simple algorithm for circuit minimization. There are currently two effective heuristics for circuit minimization, namely manual Karnaugh maps and computable Quine-McCluskey algorithm. The latter, however, has a major defect: the runtime and memory required grow $3^n/n$ times for every increase in the number of variables n. The proposed algorithm, however, extracts the prime implicants (PI) that cover minterms of a given Boolean function by deriving an implicants table based on frequency. From a set of the extracted prime implicants, the algorithm then eliminates redundant PIs again based on frequency. The proposed algorithm is therefore capable of minimizing circuits polynomial time when faced with an increase in n. When applied to various 3-variable and 4-variable cases, it has proved to swiftly and accurately obtain the optimal solutions.

• Korean Journal of Logic
• /
• v.16 no.2
• /
• pp.233-271
• /
• 2013

Quinean "ontology" mislead us because it has been used ambiguously even in his single article. It can mean what there is, ie. ontological states of affairs, on what there is, ie. a study of them, or on on what there is, ie. meta-ontology. So it is natural to be confused when we try to fully understand what does Quine do by talking about ontological commitment and criterion of it. We will discriminate these ontologies, and clarity the scope and the task of ontology as a discipline. Ontology is on what there is, meta-ontology is a study on ontology. Ontological commitment is a kind of ontological assertion within ontology, the criterion of ontological commitment is located in meta-ontological level. As a result of this clarification, we can remove some obstacles to get a good grip on Quinean criterion of ontological commitment. Also, we are able to recognize ontological descent, the way by which Quinean substantive ontology proceed.

• Korean Journal of Logic
• /
• v.8 no.1
• /
• pp.1-22
• /
• 2005

This paper provides a comparison of three fundamentally different approaches to the issue of ontological commitment. It argues that despite superficial similarities on either side, Buridan's approach provides an intriguing third alternative to the two commonly recognized modern approaches.