• Journal of Korean Society for Geospatial Information Science
• /
• v.15 no.2 s.40
• /
• pp.43-49
• /
• 2007

In this study, a GIS spatial analysis method adopted fuzzy concept was introduced and land suitability analysis of waste landfill were conducted through this method. Previous studies conducted site evaluation and land suitability analysis by appling spatial overlay of conventional GIS that based on the boolean logic of crisp set. However these method can not consider the uncertainty of spatial data and the incongruity of data classification criteria, because these method handle spatial data based on the boolean logic of crisp set. As not provided trustable analysis result, conventional GIS spatial overlay method lacks opportunity for expanding use in reality. This study selected waste landfill as facility for analysis and applied fuzzy spatial analysis method as an objective approach. In the concrete contents of study, a series process with regard to the definition procedure of membership function for continuous data and the fuzzy input value generation of spatial data for fuzzy analysis is established. As a result, in this study we proposed a method that derive parameters for deciding the membership function of spatial data by considering the criterion of data classification and factor selection for land suitability analysis of waste landfill.

• KSCE Journal of Civil and Environmental Engineering Research
• /
• v.26 no.4D
• /
• pp.695-702
• /
• 2006

In GIS-based Spatial Decision-making Support System (SDSS), the Boolean logic by conventional simple overlay method contains two problems. One is losing lots of information in analysis process, the other is unable to reflect of weighting values between evaluated items. Therefore, evaluation system as Analytic Hierarchy Process (AHP) needs to improve these problems effectively. The purpose of this study is to provide the benefit of AHP method and GIS spatial analysis in site analysis for crop cultivation. First, the weighting value of AHP for topography, distribution grade of water, property of soil and slope items are evaluated throughout survey to experts of soil, crop and agricultural management fields. On the basis of these weighting value of AHP by items, site suitability analysis for black raspberry cultivation is performed. To estimate the benefit of AHP method, the current cultivating map of black raspberry is constructed in Ssangchi-myeon district. In comparison with site analysis of Boolean logic, site analysis of AHP method shows more realistic.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.15 no.9
• /
• pp.5744-5749
• /
• 2014

An extraction technique for a common logic expression is an extremely important part of multiple-output logic synthesis. This paper presents a new Boolean extraction technique using an exclusive-OR logic synthesis principle. The logic circuits produced only have AND, OR and NOT gates. Heuristic methods can also be applied to reduce the execution time and the number of literals. The experimental results showed improvements in the literal counts over the previous methods.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.5 no.1
• /
• pp.49-53
• /
• 1980

Since Zadeh had published the fuzzy set theory at 1965, it has been applied to many fields such as realizability of communication nets, automatic control, learning systems, switching circuits. In this paper, the method of applying a fuzzy logic to a pattern classification is studied and the difference of fuzzy logic from Boolean algebra is discussed. Classfication experiment is carried out 16 persons' photos of three families by fourty male and female observers and recognition rate 94% is obtained.

• Proceedings of the KIEE Conference
• /
• 2000.11d
• /
• pp.778-780
• /
• 2000

The 74181 is arithmetic logic units(ALU)/function generator. This circuit performs 16 binary arithmetic operations on two 4-bit words. And a full carry look-ahead scheme is made available in this device. The 74181 can also be utilized as a comparator. This circuit has been also designed to provide 16 possible functions of two Boolean variables without the use of external circuitry. This paper analyzes the function of the logic and the implementation adopted in the design of 74181. The understanding of the logic characteristics of this chip enables us to improve future applications.

• Journal of the Korean Institute of Telematics and Electronics A
• /
• v.29A no.2
• /
• pp.88-99
• /
• 1992

This paper presents an efficient method of mapping Boolean equations to a set of library gates. The proposed system performs technology mapping by graph covering. To select optimal area cover, a new cost function and local area optimization are proposed. Experimental results show that the proposed algorithm produces effective mapping using given library.

• Proceedings of the KIEE Conference
• /
• 1985.07a
• /
• pp.242-245
• /
• 1985

논리회로의 합성이란 minimize된 Boolean Expression을 실재로 존재라는 TTL IC로 Implement시키는 과정을 말한다. 즉, IC pin assignment 의 과정인 것이다. 본 논문에서는 논리회로를 합성하는 expert system의 초보적인 형태를 제안하고 있다.

• Journal of the Korean Society for information Management
• /
• v.7 no.1
• /
• pp.79-95
• /
• 1990

A retrieval technique was defined as a technique for comparing the document representations. So this study classified retrieval technique in terms of the charactristics of the retrieved set of documents and the representations that are used. The distinction is whether the set of retrieved documents contains only documents whose representations are an exact match with the query, or a partial match with query. For a partial match, the set of retrieved document will include also those that are an exact match with the query. Boolean-logic as one of the exact match retrieval techniques is in current in most of the large operational information retrieval systems despite of its problems and limitatlons. Partial match as an alternative technique has also various problems. Existing information retrieval systems are successful in aSSisting the user whose needs are well- defined (e.g. Boolean-logic), to retrieve relevant documents but it should be successful in providing retrieval assistance to the browser whose information requirements is ill-defined.

• Journal of the Korea Society of Computer and Information
• /
• v.11 no.1 s.39
• /
• pp.11-18
• /
• 2006

The logical analysis of data(LAD) is a Boolean-logic based data mining tool. A critical step in analyzing data by LAD is the pattern generation stage where useful knowledge and hidden structural information in data is discovered in the form of patterns. A conventional method for pattern generation in LAD is based on term enumeration that renders the generation of higher degree patterns practically impossible. In this paper, we present a novel optimization-based pattern generation methodology and propose two mathematical programming models, a mixed 0-1 integer and linear programming (MILP) formulation and a well-studied set covering problem (SCP) formulation for the generation of optimal and heuristic patterns, respectively. With benchmark datasets, we demonstrate the effectiveness of our models by automatically generating with ease patterns of high complexity that cannot be generated with the conventional approach.

• Journal of the Korea Society of Computer and Information
• /
• v.17 no.6
• /
• pp.83-92
• /
• 2012

This paper suggests an improved method of grouping minterms based on the Decimal-Valued Matrix (DVM) method. The DVM is a novel approach to Boolean logic minimization method which was recently developed by this author. Using the minterm-based matrix layout, the method captures binary number based minterm differences in decimal number form. As a result, combinable minterms can be visually identified. Furthermore, they can be systematically processed in finding a minimized Boolean expression. Although this new matrix based approach is visual-based, the suggested method in symmetric grouping cell values can become rather messy in some cases. To alleviate this problem, the enhanced DVM method that is based on multi-level groupings of combinable minterms is presented in this paper. Overall, since the method described here provides a concise visualization of minterm groupings, it facilitates a user with more options to explore different combinable minterm groups for a given Boolean logic minimization problem.