• 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 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.15 no.6
• /
• pp.105-110
• /
• 2005

The linearized polynomial fan be regarded as a generalization of the identity function so that the inverse of the linearized polynomial is a generalization of e inverse function. Since the inverse function has so many good cryptographic properties, the inverse of the linearized polynomial is also a candidate of good Boolean functions. In particular, a construction method of vector resilient functions with high algebraic degree was proposed at Crypto 2001. But the analysis about the algebraic degree of the inverse of the linearized Polynomial. Hence we correct the inexact result and give the exact maximal algebraic degree.

• Journal of Applied and Pure Mathematics
• /
• v.5 no.1_2
• /
• pp.1-8
• /
• 2023

This study is on a Boolean B or Boolean lattice L in abstract algebra with closed binary operation *, complement and distributive properties. Both Binary operations and logic properties dominate this set. A lattice sheds light on binary operations and other algebraic structures. In particular, the construction of the elements of this L set from idempotent elements, our definition of k-order idempotent has led to the expanded definition of the definition of the lattice theory. In addition, a lattice offers clever solutions to vital problems in life with the concept of logic. The restriction on a lattice is clearly also limit such applications. The flexibility of logical theories adds even more vitality to practices. This is the main theme of the study. Therefore, the properties of the set elements resulting from the binary operation force the logic theory. According to the new definition given, some properties, lemmas and theorems of the lattice theory are examined. Examples of different situations are given.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2008.11a
• /
• pp.722-725
• /
• 2008

복합질환(complex disease)의 원인과 작용 모델을 찾기 위해 여러 가지 통계적인 방법들과 기계 학습(machine learning)의 방법 등이 사용되고 있다. 소수 SNP의 작용모델을 찾는 방법은 많이 알려져 있지만 다수 SNP의 작용 모델을 효과적으로 찾는 방법은 거의 연구되어 있지 않다. 본 연구에서는 원인 SNP들의 작용을 부울 식(boolean expression)으로 나타내고, 유전 알고리즘(genetic algorithm)을 이용하여 예측 정확도가 높은 부울 식을 구성하였으며 실제 자료와 생성된 자료에 대하여 제안한 모델의 성능을 측정하였다.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 1996.04a
• /
• pp.419-419
• /
• 1996

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 1996.10a
• /
• pp.198-198
• /
• 1996

• Journal of the Korean Society of Safety
• /
• v.35 no.1
• /
• pp.97-106
• /
• 2020

The objective of this paper is to suggest a new quantification method for multi-unit probabilistic safety assessment (PSA) that removes the overestimation error caused by the existing delete-term approximation (DTA) based quantification method. So far, for the actual plant PSA model quantification, a fault tree with negates have been solved by the DTA method. It is well known that the DTA method induces overestimated core damage frequency (CDF) of nuclear power plant (NPP). If a PSA fault tree has negates and non-rare events, the overestimation in CDF drastically increases. Since multi-unit seismic PSA model has plant level negates and many non-rare events in the fault tree, it should be very carefully quantified in order to avoid CDF overestimation. Multi-unit PSA fault tree has normal gates and negates that represent each NPP status. The NPP status means core damage or non-core damage state of individual NPPs. The non-core damage state of a NPP is modeled in the fault tree by using a negate (a NOT gate). Authors reviewed and compared (1) quantification methods that generate exact or approximate Boolean solutions from a fault tree, (2) DTA method generating approximate Boolean solution by solving negates in a fault tree, and (3) probability calculation methods from the Boolean solutions generated by exact quantification methods or DTA method. Based on the review and comparison, a new intersection removal by probability (IRBP) method is suggested in this study for the multi-unit PSA. If the IRBP method is adopted, multi-unit PSA fault tree can be quantified without the overestimation error that is caused by the direct application of DTA method. That is, the extremely overestimated CDF can be avoided and accurate CDF can be calculated by using the IRBP method. The accuracy of the IRBP method was validated by simple multi-unit PSA models. The necessity of the IRBP method was demonstrated by the actual plant multi-unit seismic PSA models.

• Journal of KIISE:Software and Applications
• /
• v.30 no.7_8
• /
• pp.659-671
• /
• 2003

This paper proposes a method of disambiguating the senses of words using decision lists, which consists of rules with confidence values. The rule of decision list is composed of a boolean function(=precondition) and a class(=sense). Decision lists classify the instance using the rule with the highest confidence value that is matched with it. Previous work disambiguated the senses using single feature decision lists, whose boolean function was composed of only one feature. However, this approach can be affected more severely by data sparseness problem and preprocessing errors. Hence, we propose multiple feature decision lists that have the boolean function consisting of more than one feature in order to identify the senses of words. Experiments are performed with 1 sense tagged corpus in Korean and 5 sense tagged corpus in English. The experimental results show that multiple feature decision lists are more effective than single feature decision lists in disambiguating senses.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.7A
• /
• pp.697-705
• /
• 2010

In Wireless Sensor Networks (WSNs), blanket (area) coverage analysis is generally carried to find the minimum number of active sensor nodes required to cover a monitoring interest area with the desired fractional coverage-threshold. Normally, the coverage analysis is performed using the stochastic geometry as a tool. The major component of such coverage analysis is the assumed sensing model. Hence, the accuracy of such analysis depends on the underlying assumption of the sensing model: how well the assumed sensing model characterizes the real sensing phenomenon. In this paper, we review the coverage analysis for different deterministic and probabilistic sensing models like Boolean and Shadow-fading model; and extend the analysis for Exponential and hybrid Boolean-Exponential model. From the analytical performance comparison, we demonstrate the redundancy (in terms of number of sensors) that could be resulted due to the coverage analysis based on the detection capability mal-characterizing sensing models.