• Journal of the Korean Society for information Management
• /
• v.29 no.4
• /
• pp.101-121
• /
• 2012

Since IR systems which adopt only Boolean IR model can not provide ranked search result, users have to conduct time-consuming checking process for huge result sets one by one. This study proposes a method to provide search results ranked by using coupling information between tags instead of index weight information in Boolean IR model. Because document queries are used instead of general user queries in the proposed method, key tags used as queries in a relevant document are extracted. A variety of groups of Boolean queries based on tag couplings are created in the process of extracting queries. Ranked search result can be extracted through the process of matching conducted with differential information among the query groups and tag significance information. To prove the usability of the proposed method, the experiment was conducted to find research trend analysis information on selected research information. Aslo, the service based on the proposed methods was provided to get user feedback for a year. The result showed high user satisfaction.

• Journal of Korea Society of Industrial Information Systems
• /
• v.16 no.5
• /
• pp.9-19
• /
• 2011

In many instances a concise form of logic is often required for building today's complex systems. The method described in this paper can be used for a wide range of industrial applications that requires Boolean type of logic minimization. Unlike some of the previous logic minimization methods, the proposed method can be used to better gain insights into the logic minimization process. Based on the decimal valued matrix, the method described here can be used to find an exact minimized solution for a given Boolean function. It is a visual based method that primarily relies on grouping the cell values within the matrix. At the same time, the method is systematic to the extent that it can also be computerized. Constructing the matrix to visualize a logic minimization problem should be relatively easy for the most part, particularly if the computer-generated graphs are accompanied.

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

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

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

• Journal of the Korean Society for Library and Information Science
• /
• v.33 no.2
• /
• pp.119-139
• /
• 1999

It Is the purpose of this research to analyse users' understanding how keyword and boolean search work in SELIS(SEoul Women's University Library and Information System) OPAC. Results of analyses of the subject, SELIS OPAC system processing, are: comprehension percentage of keyword extraction is $67(22.48\%)$ out of total 298 persons, no comprehension is $231(77.52\%)$ understanding of boolean OR In keyword search appears $115(22.48\%)$ out of 297, no understanding does $182(77.52\%)$ : comprehension of boolean AND is $98(33.11\%)$ out of 296, no understanding appears $198(66.89\%)$ understanding of using boolean and symbols is $109(36.49\%)$ out of 285, no understanding is $181(63.51\%)$ which Is lower percentage generally. And in SELIS OPAC system, in Intentional analyses to see any difference in understanding of keyword search between experience of keyword search or no, It shows no difference in interrelation $5\%$ level of significance, but In boolean search it does in interrelation $5\%$ level of significance.

• Journal of Information Processing Systems
• /
• v.8 no.1
• /
• pp.67-84
• /
• 2012

An important amount of clinical data concerning the medical history of a patient is in the form of clinical reports that are written by doctors. They describe patients, their pathologies, their personal and medical histories, findings made during interviews or during procedures, and so forth. They represent a source of precious information that can be used in several applications such as research information to diagnose new patients, epidemiological studies, decision support, statistical analysis, and data mining. But this information is difficult to access, as it is often in unstructured text form. To make access to patient data easy, our research aims to develop a system for extracting information from unstructured text. In a previous work, a rule-based approach is applied to a clinical reports corpus of infectious diseases to extract structured data in the form of named entities and properties. In this paper, we propose the use of a Boolean inference engine, which is based on a cellular automaton, to do extraction. Our motivation to adopt this Boolean modeling approach is twofold: first optimize storage, and second reduce the response time of the entities extraction.

• 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

• Korean Journal of Optics and Photonics
• /
• v.14 no.2
• /
• pp.166-168
• /
• 2003

By using gain saturation of semiconductor optical amplifiers (SOAs), an all-optical AND gate at 10 Gb/s has been successfully demonstrated. Firstly, Boolean (equation omitted) has been obtained using the first SOA with signal B and clock injection. Then, the all-optical AND gate is achieved using the second SOA with signals A and (equation omitted) injection.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.14 no.5
• /
• pp.630-634
• /
• 2004

According to the progress of an information-oriented society, more human friendly systems are required. The systems can be implemented by a kind of intelligent algorithms. In this paper we propose the possibility of the implementation of an intelligent algorithm from gene, behavior of human beings, which has some properties such as self organization and self regulation. The regulation of gene behavior is widely analyzed by Boolean network. Also the SORE (Self Organizable and Regulating Engine) is one of those algorithms. This paper does not report detailed research results; rather, it studies the feasibility of gene behavior in biocontrol systems based upon computer simulations.