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

• Proceedings of the Korea Information Processing Society Conference
• /
• 2019.05a
• /
• pp.615-618
• /
• 2019

Visual saliency detection is an important part in various vision-based applications. There are a myriad of techniques for saliency detection in color images. However, the number of methods for saliency detection in infrared images is inadequate. In this paper, we introduce a simple approach for pedestrian identification in infrared images using saliency. The input image is thresholded into several Boolean maps, an initial saliency map is then calculated as a weighted sum of created Boolean maps. The initial map is further refined by using thresholding, morphology operation, and Gaussian filter to produce the final, high-quality saliency map. The experiment showed that the proposed method produced high performance results when applied to real-life data.

• Journal of the Korean Society for Precision Engineering
• /
• v.13 no.3
• /
• pp.150-157
• /
• 1996

In this paper, to develop a smart CAD/CAM system for systematically performing from the 3-D solid shape design of products to the CNC cutting operation of products by a machining center, a B-Rep solid modeler is realized based on the half edge data structure. Because the B-Rep solid modeler has the various capabilities related to the solid definition functions such as the creation operation of primitives and the translational and rotational sweep operation, the solid manipulation functions such as the split operation and the Boolean set operation, and the solid inversion function for effectively using the data structure, the 3-D solid shape of products can be easily designed and constructed. Also, besides the automatic generation of CNC code, the B-Rep solid modeler can be used as a powerful tool for realizing the automatic generation of finite elements, the interfer- ence check between solids, the structural design of machine tools and robots and so on.

• 제어로봇시스템학회:학술대회논문집
• /
• 1989.10a
• /
• pp.805-812
• /
• 1989

An efficient diagnostic approach for real-time operation aiding expert system in chemical process plants is discussed. The approach is based on the hybrid of the simplified symptom tree(SST) and the fault consequence digraph(FCD), representation of propagation patterns of fault states. The SST generates fault hypothesis efficiently and the FCD resolve the real fault accurately. Frame based knowledge representation and object-oriented programming make diagnostic system general and efficient. Truth maintenance system enables robust pattern matching and provides enhanced explain facilities. A prototype expert system for supports operation of naphtha furnaces process, called OASYS, has been built and tested to demonstrate this methodology. Utilization of diversified process symbolic data, produced using dynamic normal standards, overcomes the problem of qualitative Boolean reasoning and enhance the applicability.

• Proceedings of the Korean Information Science Society Conference
• /
• 2004.10c
• /
• pp.616-618
• /
• 2004

기존의 멀티캐스트는 하나의 그룹 주소를 갖고 그 주소를 통해 여러 멤버 노드로의 데이터 송수신을 지원한다. 하지만 서로 연관된 많은 멀티캐스트 그룹이 존재 시 송신자의 각 그룹 관리가 힘들어지고, 노드의 잦은 멀티캐스트 그룹간 참가 및 탈퇴로 인해 지연시간이 생긴다. 또한 멀티캐스트 라우팅 테이블 유지에 많은 자원을 사용한다. 이에 서로 연관된 멀티캐스트 그룹간 불리언 연산을 통해 더 유연성 있는 운용을 가능하게 하는 기법을 제시하고 그에 따른 문제점과 해결방안을 살펴본다.

• Journal of the Chungcheong Mathematical Society
• /
• v.11 no.1
• /
• pp.13-26
• /
• 1998

The purpose of this note is to study the relation between Heyting algebra and t-algebra which is the dual concept of BCK-algebra. We define t-algebra with binary operation ${\rhd}$ which is a generalization of the implication in the Heyting algebra, and define a bounded ness and commutativity of it, and then characterize a Heyting algebra and a Boolean algebra as a bounded commutative t-algebra X satisfying $x=(x{\rhd}y){\rhd}x$ for all $x,y{\in}X$.

• 제어로봇시스템학회:학술대회논문집
• /
• 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.

• 전기의세계
• /
• v.28 no.11
• /
• pp.37-44
• /
• 1979

This paper deals with the computer program of finding the minimal sum-of-products for a switching function by using the MASK method derived from the characteristics of the Boolean algebra. The approach differs from the previous procedures in that all the prime implicants are determined only by the bit operation and the minimal sum-of-products are obtained by the modified Petrick method in this work. The important features are the relatively small amount of the run time and the less memory capacity to solve a problem, as compared to the previous computer programs.

• Journal of the Korean Society for Precision Engineering
• /
• v.10 no.1
• /
• pp.89-99
• /
• 1993

A solid modeller was developed in this paper. Representation scheme of modelling is nonmanifold B-rep. While namy B-rep modellers use edges as basic element of modelling, this modeller is triangle-based. New modelling element, split triangle that is composed of 3 pure half-edges and has no information about the adjoining triangles, was defined to enlarge the range of representation. Corresponding algorithms for Boolean set operations were also developed.

• Genomics & Informatics
• /
• v.14 no.4
• /
• pp.160-165
• /
• 2016

Over the past decade, the detection of gene-gene interactions has become more and more popular in the field of genome-wide association studies (GWASs). The goal of the GWAS is to identify genetic susceptibility to complex diseases by assaying and analyzing hundreds of thousands of single-nucleotide polymorphisms. However, such tests are computationally demanding and methodologically challenging. Recently, a simple but powerful method, named "BOolean Operation-based Screening and Testing" (BOOST), was proposed for genome-wide gene-gene interaction analyses. BOOST was designed with a Boolean representation of genotype data and is approximately equivalent to the log-linear model. It is extremely fast, and genome-wide gene-gene interaction analyses can be completed within a few hours. However, BOOST can not adjust for covariate effects, and its type-1 error control is not correct. Thus, we considered two-step approaches for gene-gene interaction analyses. First, we selected gene-gene interactions with BOOST and applied logistic regression with covariate adjustments to select gene-gene interactions. We applied the two-step approach to type 2 diabetes (T2D) in the Korea Association Resource (KARE) cohort and identified some promising pairs of single-nucleotide polymorphisms associated with T2D.