• Journal of the Korean housing association
• /
• v.18 no.2
• /
• pp.121-128
• /
• 2007

The investigation of the apartment housing as a dwelling type has become the most important and popular research subject to understand the housing culture in Korea. In their methods of typological analysis, it is found that most studies represent each unit plan as a simplified architectural drawing. This type of typology, however, has difficulties in processing a large scale of data set because each representation of a plan contain too many informations. To deal with this problem, this study suggests a new graph-theoretical method by which apartment plans can be represented in a more simple and effective way. This new method is also tested against the sample plans from Gangnam-gu area in Seoul to reveal the design logic hidden in plan configuration. Through a series of analyses, it is verified that there exist a design strategy that guides the particular pattern of zoning and allocation of each room in the plan.

• Proceedings of the Korea Society for Simulation Conference
• /
• 2001.10a
• /
• pp.248-254
• /
• 2001

This paper presents a progressive algorithm for reconstructing a 3D structure from a given 2D sketch drawing (edge-vertex graph without hidden line removal) according to the user's sketch order. While previous methods reconstruct a 3D structure at once, the proposed method progressively calculate a 3D structure by optimizing the coordinates of vertices of an object according to the sketch order. The progressive method reconstructs the most plausible 3D object quickly by applying 3D constraints that are derived from the relationship between the object and the sketch drawing in the optimization process. The progressive reconstruction algorithm is discussed, and examples from a working implementation are given.

• Journal of Computational Design and Engineering
• /
• v.3 no.1
• /
• pp.14-23
• /
• 2016

The problem of fitting B-spline curves to planar point clouds is studied in this paper. A novel method is proposed to deal with the most challenging case where multiple intersecting curves or curves with self-intersection are necessary for shape representation. A method based on Delauney Triangulation of data points is developed to identify connected components which is also capable of removing outliers. A skeleton representation is utilized to represent the topological structure which is further used to create a weighted graph for deciding the merging of curve segments. Different to existing approaches which utilize local shape information near intersections, our method considers shape characteristics of curve segments in a larger scope and is thus capable of giving more satisfactory results. By fitting each group of data points with a B-spline curve, we solve the problems of curve structure reconstruction from point clouds, as well as the vectorization of simple line drawing images by drawing lines reconstruction.

• Journal of the Korean School Mathematics Society
• /
• v.1 no.1
• /
• pp.151-163
• /
• 1998

In mathematics education, teaching-learning activity can be divided largely into the understanding the mathematical concepts, derivation of principles and laws, acquirement of the mathematical abilities. We utilize various media, teaching tools, audio-visual materials, manufacturing materials for understanding mathematical concepts. But sometimes we cannot define or explain correctly the concepts as well as the derivation of principles and laws by these materials. In order to solve the problem we can use the computer. In this paper, character and movement state of various quadratic function graph types can be used. Using the computers is more visible than other educational instruments like blackboards, O.H.Ps., etc. Then, students understand the mathematical concepts and the correct quadratic function graph correctly. Consquently more effective teaching-learning activity can be done. Usage of computers is the best method for improving the mathematical abilities because computers have functions of the immediate reaction, operation, reference and deduction. One of the important characters of mathematics is accuracy, so we use computers for improving mathematical abilities. This paper is about the program focused on the part of "the quadratic function graph", which exists in mathematical curriculum the middle school. When this program is used for students, it is expected the following educational effect. 1, Students will have positive thought by arousing interests of learning because this program is composed of pictures, animations with effectiveness of sound. 2. This program will cause students to form the mathematical concepts correctly. 3. By visualizing the process of drawing the quadratic function graph, students understand the quadratic function graph structually. 4. Through the feedback, the recognition ability of the trigonometric function can be improved. 5. It is possible to change the teacher-centered instruction into the student-centered instruction. For the purpose of increasing the efficiencies and qualities of mathmatics education, we have to seek the various learning-teaching methods. But considering that no computer can replace the teacher′s role, tearchers have to use the CIA program carefully.

• Nuclear Engineering and Technology
• /
• v.48 no.2
• /
• pp.386-403
• /
• 2016

The safety of nuclear power plants is analyzed by a probabilistic risk assessment, and the fault tree analysis is the most widely used method for a risk assessment with the event tree analysis. One of the well-known disadvantages of the fault tree is that drawing a fault tree for a complex system is a very cumbersome task. Thus, several graphical modeling methods have been proposed for the convenient and intuitive modeling of complex systems. In this paper, the reliability graph with general gates (RGGG) method, one of the intuitive graphical modeling methods based on Bayesian networks, is improved for the reliability analyses of dynamic systems that have various operation modes with time. A reliability matrix is proposed and it is explained how to utilize the reliability matrix in the RGGG for various cases of operation mode changes. The proposed RGGG with a reliability matrix provides a convenient and intuitive modeling of various operation modes of complex systems, and can also be utilized with dynamic nodes that analyze the failure sequences of subcomponents. The combinatorial use of a reliability matrix with dynamic nodes is illustrated through an application to a shutdown cooling system in a nuclear power plant.

• Journal of Korean Elementary Science Education
• /
• v.31 no.3
• /
• pp.321-333
• /
• 2012

The purpose of this study was to examine elementary school students' characteristics and difficulties in drawing and interpreting a line graph, and to present educational implications. Twenty five students(4th grader: 6, 5th grader: 9, and 6th grader: 10) at an elementary school participated in this study. We used a student's task which was about graphing on a given data table and interpreting his/her graph. The data table was on heating 200mL and 500mL of water and measuring their temperature at regular time intervals. We collected multiple source of data, and data analyzed based on the sub-variables of TOGS. The some results of this study are as follows: First, five children (20.0%), especially two of 10 sixth graders (20.0%), could not construct a line graph about a given data table. Second, twenty students (80.0%) had the ability on 'Scaling axes' and on 'Assigning variables to the axes', however, only a student understood why the time is on the longitudinal axis and the temperature is on the vertical axis. Third, in the case of 'Plotting points', twelve children (48.0%) could drew two graphs on a coordinate. Fourth, in the case of 'Selecting the corresponding value for Y (or X)', twenty student had little difficulty. on 'Describing the relationship between variables', seventeen students (68.0%) understood the relationship between time and temperature of water, and the relationship between temperature and amount of water. Finally, eleven students (44%) had the ability on 'Interrelating and extrapolation graphs.' Educational implications are also presented in this paper.

• Proceedings of the Korean Information Science Society Conference
• /
• 2011.06b
• /
• pp.485-487
• /
• 2011

우리는 그래프 그리기를 위한 셀룰러 오토마타 모델을 제안한다. 셀룰러 오토마타는 간단한 전이 규칙들의 집합을 정의함으로써 비교적 복잡한 자연현상이나 사회현상을 재현해낼 수 있는 특징을 갖고 있다. 우리는 기존에 Eades가 제안했던 하중-기초 그래프 그리기 알고리즘을 기반으로 하여 육각형 격자상에서의 그래프 그리기를 위한 셀룰러 오토마타 모델을 제안한다. 제안된 모델은 기존의 알고리즘에 비해 더 효율적인 연산과정을 거치게 되며 보다 대칭적인 그래프를 그려준다.

• 제어로봇시스템학회:학술대회논문집
• /
• 1992.10a
• /
• pp.1102-1107
• /
• 1992

Existing CAD systems do nto provide the advanced function for systematic checking of design and drafting errors in mechanical drawings. This paper describes a method for sytematic checking of global parts in mechanical drawings. The checking items are deficiency and redundancy of dimensions, input-errors in dimension figures and symbols, etc. Checking for deficiency and redundancy of global dimensions has been performed applying Graph Theory. This system has been applied to several examples and we have confirmed the feasibility of this checing method.

• Journal of Korea Multimedia Society
• /
• v.12 no.7
• /
• pp.893-902
• /
• 2009

Many People are collecting and managing variable information(Image, Graphic, Animation, Text, music files etc.) about personal interests and holding them in common. Most users are using Microsoft Explorer to make a folder and classify many files. but It's difficult to understand the relation of the data instinctively. To resolve this problem, we adopt information visualization method (especially tree-graph control interface). We suggest an interface that all user can drawing a Graph easily and rapidly. So user can see the relations of their data instinctively and control the relation directly with our sketch-based interface.

• Journal of KIISE:Computer Systems and Theory
• /
• v.30 no.3_4
• /
• pp.168-185
• /
• 2003

This paper presents a progressive algorithm that not only can narrow down the search domain in the course of face identification but also can fast reconstruct various 3D objects from a sketch drawing. The sketch drawing, edge-vertex graph without hidden line removal, which serves as input for reconstruction process, is obtained from an inaccurate freehand sketch of a 3D wireframe object. The algorithm is executed in two stages. In the face identification stage, we generate and classify potential faces into implausible, basis, and minimal faces by using geometrical and topological constraints to reduce search space. The proposed algorithm searches the space of minimal faces only to identify actual faces of an object fast. In the object reconstruction stage, we progressively calculate a 3D structure by optimizing the coordinates of vertices of an object according to the sketch order of faces. The progressive method reconstructs the most plausible 3D object quickly by applying 3D constraints that are derived from the relationship between the object and the sketch drawing in the optimization process. Furthermore, it allows the designer to change viewpoint during sketching. The progressive reconstruction algorithm is discussed, and examples from a working implementation are given.