• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 2003.09a
• /
• pp.447-450
• /
• 2003

In this research, we propose an automatic knowledge acquisition and composite knowledge expression mechanism based on machine learning and relational database. Most of traditional approaches to develop a knowledge base and inference engine of expert systems were based on IF-THEN rules, AND-OR graph, Semantic networks, and Frame separately. However, there are some limitations such as automatic knowledge acquisition, complicate knowledge expression, expansibility of knowledge base, speed of inference, and hierarchies among rules. To overcome these limitations, many of researchers tried to develop an automatic knowledge acquisition, composite knowledge expression, and fast inference method. As a result, the adaptability of the expert systems was improved rapidly. Nonetheless, they didn't suggest a hybrid and generalized solution to support the entire process of development of expert systems. Our proposed mechanism has five advantages empirically. First, it could extract the specific domain knowledge from incomplete database based on machine learning algorithm. Second, this mechanism could reduce the number of rules efficiently according to the rule extraction mechanism used in machine learning. Third, our proposed mechanism could expand the knowledge base unlimitedly by using relational database. Fourth, the backward inference engine developed in this study, could manipulate the knowledge base stored in relational database rapidly. Therefore, the speed of inference is faster than traditional text -oriented inference mechanism. Fifth, our composite knowledge expression mechanism could reflect the traditional knowledge expression method such as IF-THEN rules, AND-OR graph, and Relationship matrix simultaneously. To validate the inference ability of our system, a real data set was adopted from a clinical diagnosis classifying the dermatology disease.

• Korean Institute of Interior Design Journal
• /
• v.16 no.5
• /
• pp.38-46
• /
• 2007

In the late 1970s, the method of quantitative and scientific space structural analysis based on graph theory was introduced to the process of space design, which arranges design and functional elements, as relying heavily on intuition could produce errors due to unverified experiences and prejudices of the designer. As the method of space analysis is complex and hard to express visually and requires repetitive operations, it was discussed theoretically only. However, with the development of computer performance and graphic in recent years, visualization became possible. But the method of visual structural analysis of space is at the level of two dimensions and it is not easy to get accurate data when it is applied to limited three dimensional space such as an interior space. For the visual structural analysis of space, this study presents 4 indices including visibility volume level, pure visibility connection frequency, effective visibility connection frequency, and path visibility connection frequency. This study also presents space division using three dimensional arrangement rather than the existing vector operation method and raytracing algorithm at the lattice constant. Based on this, an analysis tool for the visible regions of three dimensional space that is capable of evaluating at multiple points by using three dimensional game engine and presentation tool that allows the analyzer to interpret the data effectively is made. It is applied to 2 prototype models by displacing Z axis, and the results are compared with UCL Depthmap to verify the validity of data and evaluate its usefulness as a multidimensional, multi-view space analysis tool.

• Journal of KIISE:Computer Systems and Theory
• /
• v.37 no.1
• /
• pp.27-34
• /
• 2010

Web crawlers are fundamental programs which iteratively download web pages by following links of web pages starting from a small set of initial URLs. Previously several web crawling orderings have been proposed to crawl popular web pages in preference to other pages, but some graph search techniques whose characteristics and efficient implementations had been studied in graph theory community have not been applied yet for web crawling orderings. In this paper we consider various graph search techniques including lexicographic breadth-first search, lexicographic depth-first search and maximum cardinality search as well as well-known breadth-first search and depth-first search, and then choose effective web crawling orderings which have linear time complexity and crawl popular pages early. Especially, for maximum cardinality search and lexicographic breadth-first search whose implementations are non-trivial, we propose linear-time web crawling orderings by applying the partition refinement method. Experimental results show that maximum cardinality search has desirable properties in both time complexity and the quality of crawled pages.

• Korean Journal of Computational Design and Engineering
• /
• v.14 no.2
• /
• pp.69-76
• /
• 2009

The development of a simulation system requires many sub modules such as a dynamic module, a visualization module, etc. If a different freeware is used for each sub modules, it is hard to develop the simulation system by incorporating them because they use their own data structures. To solve this problem, a high-level data structure, called Dynamics Scene Graph Data structure (DSGD) is proposed, by wrapping data structures of two freeware; an Open Dynamics Engine (ODE) for the dynamic module and an Open Scene Graph (OSG) for the visualization module. Finally, to evaluate the applicability of the proposed data structure, it is applied to the block erection simulation in shipbuilding. The result shows that it can be used for developing the simulation system.

• Proceedings of the KIEE Conference
• /
• 1988.07a
• /
• pp.963-966
• /
• 1988

This paper describes the development of a prototype expert system, which is designed to analyze loom production efficiency by employing a loom monitoring system. The problem field of the prototype expert system is the loom failure analysis which has a great effect on prouction efficiency, and the characteristic graph in which the loom failure causes are classified and organized, is used in the analysis. The knowledge for characteristic graph is organized, and an effective inference engine- is developed. The developed system is tested and modified using hypothetical loom failure causes, and the feasibility of the expert system application to extend the functions of the loom monitoring system is proved.

• Journal of Institute of Convergence Technology
• /
• v.3 no.1
• /
• pp.25-29
• /
• 2013

The purpose of this paper is to determine the fuel change and weight change impact on the fuel economy and emission characteristic of ICE (Internal Combustion Engine) vehicle. According to fuel type, fuel consumption and emission characteristics were measured and fuel used in this paper was gasoline, diesel, and LPG. Four vehicles with different weight were tested and the fuel economy were compared and analyzed by using scatter graph. Test was carried out using chassis dynamometer, CVS (Constant Volume Sampler), and emission measurement system. Diesel vehicle less emited $CO_2$ compared to gasoline and LPG. Even if same $CO_2$ between gasoline and LPG, there are difference fuel economy depending on carbon proportion of specific fuel. The heavier weight of vehicle, the worse of fuel economy and Better fuel economy performance on highway driving mode.

• Proceedings of the Korean Information Science Society Conference
• /
• 2001.04b
• /
• pp.22-24
• /
• 2001

A new GIS software Spatial Database Engine(SDE) has been developed to integrated with spatial database that combines conventional and spatially related data. As we known well in the traditional relation database system, the query evaluation techniques are a well-researched subject, many useful and efficient algorithms have been proposed, but in the spatial database system, it is a litter difference with the traditionally ones. Based on the Query Graph Model(QGM), we implemented our own query evaulation plan in the SDE, which can deal with the full functionality query statement SELECT-FROM-WHERE_GROUPBY-HAVING, and treat the spatial data and non-spatial data seamlessly. We proposed a novel multi way join algorithm base on nest loop that may be attractive.

• Proceedings of the Korean Information Science Society Conference
• /
• 2000.04b
• /
• pp.295-297
• /
• 2000

전문가 검색 엔진은 전문가 시스템과 같은 목적에서 특정 전문 분야에 대한 특수한 정보를 수집 검색하기 위한 검색 엔진을 내용이다. 본 논문은 전문가 검색 엔진을 만드는 과정에서 초기 작업에 해당하는 웹 정보 수집에 대한 논문이다. 본 논문은 웹 페이지에서 하이퍼링크와 참조되는 웹 페이지에 대한 표면 지식을 이용하여, 홈페이지 그래프를 작성한다. 그리고 나서 홈페이지 그래프와 사전에 미리 준비된 개념 그래프를 이용하여, 웹 페이지 수집 중 특정 전문 분야에 해당하는 웹 페이지인지를 판별하여 사용자가 수집하고자 하는 분야에 대한 웹 페이지만을 수집한다. 본 논문은 이에 대한 개념, 설계 및 구현과 앞으로의 개선 상황을 제안한다.

• Journal of the Korea Society of Computer and Information
• /
• v.10 no.1 s.33
• /
• pp.59-66
• /
• 2005

The organization of the web is progressively more being used to improve search and analysis of information on the web as a large collection of heterogeneous documents. Most people begin at a Web search engine to find information. but the user's pertinent search results are often greatly diluted by irrelevant data or sometimes appear on target but still mislead the user in an unwanted direction. One of the intentional, sometimes vicious manipulations of Web databases is a intentionally biased web page like Google bombing that is based on the PageRank algorithm. one of many Web structuring techniques. In this thesis, we regard the World Wide Web as a directed labeled graph that Web pages represent nodes and link edges. In the Present work, we define the label of an edge as having a link context and a similarity measure between link context and target page. With this similarity, we can modify the transition matrix of the PageRank algorithm. By suggesting a motivating example, it is explained how our proposed algorithm can filter the Web intentionally biased web Pages effective about $60\%% rather than the conventional PageRank.

• International Journal of CAD/CAM
• /
• v.6 no.1
• /
• pp.173-181
• /
• 2006

In this paper, an integration framework of Geometric Constraint Solving Engine and AutoCAD is presented, and a dynamic geometric constraint system is introduced. According to inherent orientation features of geometric entities and various Object Snap results of AutoCAD, the' proposed system can automatically construct an under-constrained geometric constraint model during interactive drawing. And then the directed constraint graph in a geometric constraint model is realtime modified in order to produce an optimal constraint solving sequence. Due to the open object-oriented characteristics of AutoCAD, a set of user-defined entities including basic geometric elements and graphics constraint relations are defined through derivation. And the custom-made Object Reactor and Command Reactor are also constructed. Several powerful characteristics are achieved based on these user-defined entities and reactors, including synchronously processing geometric constraint information while saving and opening DWG files, visual constraint relations, and full adaptability to Undo/Redo operations. These characteristics of the proposed system can help the designers more easily manage geometric entities and constraint relations between them.