• Korean Journal of Remote Sensing
• /
• v.21 no.5
• /
• pp.393-404
• /
• 2005

As multi-source spatial data fusion mainly deal with various types of spatial data which are specific representations of real world with unequal reliability and incomplete knowledge, proper data representation and uncertainty analysis become more important. In relation to this problem, this paper presents and applies an advanced data representation methodology for different types of spatial data such as categorical and continuous data. To account for the uncertainties of both categorical data and continuous data, fuzzy boundary representation and smoothed kernel density estimation within a fuzzy logic framework are adopted, respectively. To investigate the effects of those data representation on final fusion results, a case study for landslide hazard mapping was carried out on multi-source spatial data sets from Jangheung, Korea. The case study results obtained from the proposed schemes were compared with the results obtained by traditional crisp boundary representation and categorized continuous data representation methods. From the case study results, the proposed scheme showed improved prediction rates than traditional methods and different representation setting resulted in the variation of prediction rates.

• Journal of The Korean Association For Science Education
• /
• v.10 no.1
• /
• pp.57-64
• /
• 1990

In this study, novices' protocols were investigated on the basis of Mayer's analysis of mathematical problem solving. These protocols were obtained by Jae-Sool Kwon and Seong-Wang Lee(1988) by means of thinking aloud while 20 sophomore students in a department of physics education were solving physics problems on Newton's low of motion. The results of investiqation are as follows; (1) We proposed an effective method in analyzing protocols on physics porblem solving (2) We could find the defective types of knowledge of individuals who got an incorrect solution, through analyzing the cause of failure individually (3) The fact that many students considered first the frictional force as muntiplying the coefficient of friction by perpendicular force rather than as resistance of motion, was found And students' misconception on the coefficient of friction was found. (4) If such analyses of test items and protocols are used in physics education, they will be very useful for finding the faults of problem-solving process, and for setting and scoring subjective problems in physics

• 한국IT서비스학회:학술대회논문집
• /
• 2002.11a
• /
• pp.425-430
• /
• 2002

Over the years, several different approaches have been proposed to enhance the practice of software reuse. These approaches vary in reuse abstraction levels or application domains they focus on. However, it seems that they do not adequately meet the needs of software designers in planning and managing reuse. One reason may be the lack of conceptually well-established framework supporting work domain analysis and modeling. As a new viable solution to this problem, Sutcliffe and his colleagues developed Domain Theory , which is introduced in this paper. Utilizing multidisciplinary perspective, such as cognitive psychology, management science, human-computer interaction, and software engineering. it provides a schematic framework that defines a comprehensive library of generic and reusable models of domain knowledge in terms of generic tasks and meta-domains. It also provides useful methods and guidelines for software reuse, emphasizing the concept of abstraction process in a designer s mind. This paper firstly gives a brief overview of fundamentals of software reuse. Next, it explains the foundation of domain theory and discusses its applicability to software reuse. In particular, the taxonomy of meta-domains and the types of generic tasks are described in more detail. Finally, the future research framework, which primarily addresses the problem of how to apply the domain theory to various work domains, is proposed.

• Proceedings of the Korean Society for Bioinformatics Conference
• /
• 2005.09a
• /
• pp.267-271
• /
• 2005

The goal of data mining is to extract new and useful knowledge from large scale datasets. As the amount of available data grows explosively, it became vitally important to develop faster data mining algorithms for various types of data. Recently, an interest in developing data mining algorithms that operate on graphs has been increased. Especially, mining frequent patterns from structured data such as graphs has been concerned by many research groups. A graph is a highly adaptable representation scheme that used in many domains including chemistry, bioinformatics and physics. For example, the chemical structure of a given substance can be modelled by an undirected labelled graph in which each node corresponds to an atom and each edge corresponds to a chemical bond between atoms. Internet can also be modelled as a directed graph in which each node corresponds to an web site and each edge corresponds to a hypertext link between web sites. Notably in bioinformatics area, various kinds of newly discovered data such as gene regulation networks or protein interaction networks could be modelled as graphs. There have been a number of attempts to find useful knowledge from these graph structured data. One of the most powerful analysis tool for graph structured data is frequent subgraph analysis. Recurring patterns in graph data can provide incomparable insights into that graph data. However, to find recurring subgraphs is extremely expensive in computational side. At the core of the problem, there are two computationally challenging problems. 1) Subgraph isomorphism and 2) Enumeration of subgraphs. Problems related to the former are subgraph isomorphism problem (Is graph A contains graph B?) and graph isomorphism problem(Are two graphs A and B the same or not?). Even these simplified versions of the subgraph mining problem are known to be NP-complete or Polymorphism-complete and no polynomial time algorithm has been existed so far. The later is also a difficult problem. We should generate all of 2$^n$ subgraphs if there is no constraint where n is the number of vertices of the input graph. In order to find frequent subgraphs from larger graph database, it is essential to give appropriate constraint to the subgraphs to find. Most of the current approaches are focus on the frequencies of a subgraph: the higher the frequency of a graph is, the more attentions should be given to that graph. Recently, several algorithms which use level by level approaches to find frequent subgraphs have been developed. Some of the recently emerging applications suggest that other constraints such as connectivity also could be useful in mining subgraphs : more strongly connected parts of a graph are more informative. If we restrict the set of subgraphs to mine to more strongly connected parts, its computational complexity could be decreased significantly. In this paper, we present an efficient algorithm to mine frequent subgraphs that are more strongly connected. Experimental study shows that the algorithm is scaling to larger graphs which have more than ten thousand vertices.

• Proceedings of the Korean Society for Bioinformatics Conference
• /
• 2005.09a
• /
• pp.101-106
• /
• 2005

Recently, as the size of genetic knowledge grows faster, automated analysis and systemization into high-throughput database has become hot issue. One essential task is to recognize and identify genomic entities and discover their relations. However, ambiguity of name entities is a serious problem because of their multiplicity of meanings and types. So far, many effective techniques have been proposed to analyze documents. Yet, accuracy is high when the data fits the model well. The purpose of this paper is to design and implement a document classification system for identifying entity problems using text/data mining combination, supplemented by rich data mining algorithms to enhance its performance. we propose RTP ost system of different style from any traditional method, which takes fault tolerant system approach and data mining strategy. This feedback cycle can enhance the performance of the text mining in terms of accuracy. We experimented our system for classifying RB-related documents on PubMed abstracts to verify the feasibility.

• International Journal of Fuzzy Logic and Intelligent Systems
• /
• v.2 no.3
• /
• pp.179-184
• /
• 2002

Recently, internet-based applications can be found easily in various felds. Internet-based telerobot system becomes one of important applications of internet. Among many important technological issues on the internet-based telerobot, time-delay is inherently critical problem to be solved. Time-delay is classified as micro time-delay and macro time-delay in this paper. Algorithms for compensation of path-error and time-error are proposed for the both types of time-delays using fuzzy logic since fuzzy logic is one of the best tools to represent expert's knowledge. Simulation results show the validity of the proposed algorithms.

• Proceedings of the Korea Inteligent Information System Society Conference
• /
• 2001.01a
• /
• pp.219-223
• /
• 2001

Within a mechanical system such as an automotive the number of standard machine parts is increasing, so that the parts selection becomes more important than ever before. Selection of appropriate bearings in the preliminary design phase of a machine is also important. In this paper, three decision-making approaches are compared to find out a model that is appropriate to bearing selection problem. An artificial neural network, which is trained with real design cases, is used to select a bearing mechanism at the first step. Then, the subtype of the bearing is selected by the weighting factor method. Finally, types of peripherals such as lubrication methods are determined by a rule-based expert system.

• Proceedings of the KSME Conference
• /
• 2008.11a
• /
• pp.408-409
• /
• 2008

This paper presents a new development for topology optimization of heat-dissipating structure with forced convection. To cool down electric devices or machines, two types of convection models have been widely used: Natural convection model with a large Archimedes number and Forced convection with a small Archimedes number. Nowadays, many engineering application areas such as electrochemical conversion device or fuel cell devices adopt the forced convection to transfer generated heat. Therefore, to our knowledge, it becomes an important issue to design flow channels inside which generated heat transfer. Thus, this paper studies optimal topological designs considering fluid-heat interaction. To consider the effect of the advection in the heat transfer problem, the incompressible Navier-stokes equation is solved. This paper numerically studies the coupling phenomena and presents optimal channel design considering forced convection.

• Journal of Educational Research in Mathematics
• /
• v.19 no.1
• /
• pp.63-80
• /
• 2009

This paper has a purpose to find out the important points about linguistic factors suited to the assessment purpose and mathematics teaching/learning that a word-problem sentence has to possess. We also examine the degree of understanding of sentence and the perceptive/emotional reactions of students toward two different kinds of word-problem sentences that have same mathematical contents, but different linguistic structures. The objects of this thesis are 124 students from the third to sixth grade in an elementary school. We execute assessment of simple-sentence-word-problem and complex-sentence-word-problem that have same mathematical contexts, but different linguistic structures. Then we have compared and examined their own process of solving the two types word-problems and we make up questionnaire and have an interview with them. The conclusions are as followings: First, simple-sentence-word-problem is more successful to suggest an information for solving a problem than complex one. Second, it is hard to find the strategy for solving a problem in complex-sentence-word-problem than simple one. Third, students think that suggested information and mathematical knowledge are different according to the linguistic structure in the process of perceiving the information after reading a word-problem. Fourth, in spite of same sentence type, the negative mental reaction is showed greatly to complex-sentence-word-problem even before solving a problem.

• Korean Journal of Health Education and Promotion
• /
• v.17 no.1
• /
• pp.185-213
• /
• 2000

The purpose of this study is to analyze and compare dental hygine curriculum of three countries--Korea, U.S.A., and Japan--, focusing on the ways of organizing content. In this study, 30 curriculum documents of dental hygienist in U.S., Japan, and Korea were analyzed and discussed by a framework of analysis which was constructed referring to Tylerian curriculum model. Using this framework, three kinds of key components of curriculum document were compared according to specific elements of each component. More specifically, comparing those curriculum documents, we must consider the dimension of content organization. In this study, the problem of course organization was viewed on three dimensions: continuity, sequence, and integration of curriculum content. Based on the results of this study, the conclusions are as follows. 1. Courses of dental hygienist education should be organized so that the curriculum foster the cumulative and continuous learning. It will be accomplished by considering the essential procedures or sequence of dental hygiene activities. 2. When organizing curriculum elements, we should consider the continuity dimension of learning content. Continuity deals with the vertical manipulation or repetition of curriculum components. In other words, it accounts for the reappearance in the curriculum of certain major ideas or skills. Therefore, courses should be based on the level of the dental hygienist activities in order to ensure a continuity of learning experiences. 3. Dental hygienist curriculum must be organized in a way to integrate the logic of dental hygiene as a discipline with the process of dental hygiene performance. Integration refers to the linking of all types of knowledge and experiences contained within the curriculum design. It emphasizes horizontal relations among various content topics and themes involving all domains of knowledge recognized. Thus, courses of dental hygiene curriculum should be integrated to allow college students to obtain a unified view of knowledge and an in-depth meaning of the dental hygiene as a profession.