• Proceedings of the KIEE Conference
• /
• 1987.07a
• /
• pp.226-229
• /
• 1987

This paper was aimed to, using a new data structure, develop a set of algorithms to execute the output function of Digital System. These functions were represented as directed, acyclic graphs. by applying many restrictions on vertices on graph, the efficient manipulation of boolean function was accomplished. The results were as follows; 1. A canonical representation of a boolean function was created by the reduction algorithm. 2. The operation of two functions was accomplished using t he apply algorithm, according to the binary operator. 3. The arguments having 1 as the value nf function were enumerated using the satisfy algorithm. 4. Composing TTL 74181 4-bit ALU and 74182 look-ahead carry generator, the ALU having 4-bit and 16-bit as word size was implemented.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.12 no.7
• /
• pp.3251-3257
• /
• 2011

This paper presents a new Boolean extraction technique for logic synthesis. This method extracts kernel-kernel pairs as well as cokernel-kernel pairs. The given logic expressions can be translated into Boolean divisors and quotients with kernel-kernel pairs. Next, kernel intersection method provides the common sub-expressions for several logic expressions. Experimental results show the improvement in literal count over previous other extraction methods.

• Kyungpook Mathematical Journal
• /
• v.57 no.1
• /
• pp.85-97
• /
• 2017

The notions of regular uni-soft filters, uni-soft MV -filters and Boolean uni-soft filters are introduced, and related properties are investigated. Characterizations of regular uni-soft filters, uni-soft MV -filters and Boolean uni-soft filters are discussed.Relations between regular uni-soft filters and uni-soft MV -filters are considered. It is shown that the notion of a uni-soft MV -filter coincides with the notion of a regular uni-soft filter in BL-algebras.

• Language and Information
• /
• v.13 no.2
• /
• pp.47-57
• /
• 2009

It has been observed that not all negative polarity items (NPIs) are licensed in the same negative contexts, and different NPIs may be licensed by different negative expressions. This shows that Ladusaw's (1979) downward entailment is not precise enough to account for the distributional patterns of NPIs (van der Wouden, 1997; van der Wouden and Zwarts, 1993; Zwarts, 1986, among others). One well-known attempt to deal with this issue is to divide negative expressions into several subtypes. Using boolean semantics, Zwarts (1986; 1998) distinguishes three kinds of downward entailing licensors and accounts for heterogeneous NPI-licensing conditions by means of the semantic strength of negative expressions. This approach has been adopted to define Korean negation (Nam, 1994; Chung, 1993; Chung, 1997; Hwang, 2009). In this paper, however, we argue that the boolean semantic approach for negation is not adequate in characterizing the properties of Korean negative expressions and explaining the contexts of licensing Korean NPIs.

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

• Kyungpook Mathematical Journal
• /
• v.43 no.4
• /
• pp.539-545
• /
• 2003

We present a set of equations that axiomatizes the class of all lattice implication algebras. The construction is different from the one given in [7], and the proof is direct: i.e., it does not rely on results from outside the realm of the lattice implication algebras, such as the theory of BCK-algebras. Then we show that the lattice H implication algebras are nothing more than the familiar Boolean algebras. Finally we obtain some negative results for the embedding of lattice implication algebras into Boolean algebras.

• Journal of the Korean Mathematical Society
• /
• v.44 no.1
• /
• pp.169-178
• /
• 2007

We consider the set of $n{\times}n$ idempotent matrices and we characterize the linear operators that preserve idempotent matrices over Boolean algebras. We also obtain characterizations of linear operators that preserve idempotent matrices over a chain semiring, the nonnegative integers and the nonnegative reals.

• Honam Mathematical Journal
• /
• v.36 no.1
• /
• pp.187-198
• /
• 2014

The fuzzy idempotent matrices are important in various applications and have many interesting properties. Using the upper diagonal completion process, we have the zero patterns of fuzzy idempotent matrix, that is, Boolean idempotent matrices. And we give the construction of all fuzzy idempotent matrices for some dimention.

• The Pure and Applied Mathematics
• /
• v.11 no.1
• /
• pp.1-14
• /
• 2004

Due to the development of computer network and mobile communications, the security in image data and other related source are very important as in saving or transferring the commercial documents, medical data, and every private picture. Nonetheless, the conventional encryption algorithms are usually focusing on the word message. These methods are too complicated or complex in the respect of image data because they have much more amounts of information to represent. In this sense, we proposed an efficient secret symmetric stream type encryption algorithm which is based on Boolean matrix operation and the characteristic of image data.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2006.05a
• /
• pp.1325-1328
• /
• 2006

본 논문은 기계 가공시 형상의 인지 절차에 대해 기술한다. 주조와 단조 공정의 특성 중 한가지는 기계 가공시 원재료가 최종 형상에 매우 근접하다는 것이다. 이때 가공 형상 추출은 가공될 면을 인지하는 것과 가공면을 군집으로 그룹화 하는 두 단계로 수행될 수 있다. 이중 가공될 면을 인지하기 위한 기존의 방법은 3D Boolean difference operation을 수행하는 것이다. 그러나 3D Boolean difference operation의 계산적 난점 때문에 복잡한 형상에는 실용적이지 못하다. 본 논문의 목적은 가공 면을 인지하는 효율적인 알로리즘을 개발하는 것이다.