• Proceedings of the Korea Water Resources Association Conference
• /
• 2017.05a
• /
• pp.334-334
• /
• 2017

Representative particle sizes(RPS) are commonly used for particle size distribution of heterogeneous sediment such as bed material. RPS can provide not only information of mean characteristics of sediment, but also other properties like sorting, skewness, kurtosis. For sediment including sand and clay material, RPS is estimated through two steps. The first is experimental step for calculating weight of each size class, the next is interpolation step to get RPS by using the graph plot. At the second step, graph method known as direct reading of value along the interpolation line in the graph plot is commonly used. This method is often time-consuming job. In this study we developed a new program to get RPS by using MS Excel. Simple linear and semi-log interpolation are used. When compared with conventional graph method(direct reading), simple linear shows 5.31%, while semi-log 1.29% of relative difference. We developed MS Excel program for estimation of RPS automatically.

• Journal of The Korea Institute of Healthcare Architecture
• /
• v.19 no.4
• /
• pp.47-60
• /
• 2013

Purpose: This study examines construction core plans for the users of vertical-typed general hospitals to effectivly use the flow line. Methods: The study sampled representative 9 hospitals, calculated the depth value through Convex Map of Space Syntax and Justified Graph according to the determination of form of construction cire, and analyzed its functional connectivity. Results: The analysis of the connectivity between operation core part and emergency part of core space with high importance in the hospitals showed that the types of hospital and hospital have the lowest depth value in the spatial phase diagram, where central treatment part and outpatient part are arranged well vertically. Elevators for patients at these hospitals are close to operation and emergency parts actually separated from the elevators for passengers. For shortening of flow line of patients and private movement environment, however, it is desirable to arrange the elevators for patients to be adjacent to the operation parts and to arrange the emergent patient entrances more effectively to separate them from the flow line of visitors and guardians. Implications: Consideration should be taken into account for the effective flow line design. This study hopefully may serve as a stepping stone for the standard design of horizontal/vertical flow line.

• Journal of Intelligence and Information Systems
• /
• v.17 no.4
• /
• pp.279-292
• /
• 2011

Movie is a representative media that can transmit stories to audiences. Basically, a story is described by characters in the movie. Different from other simple videos, movies deploy narrative structures for explaining various conflicts or collaborations between characters. These narrative structures consist of 3 main acts, which are beginning, middle, and ending. The beginning act includes 1) introduction to main characters and backgrounds, and 2) conflicts implication and clues for incidents. The middle act describes the events developed by both inside and outside factors and the story dramatic tension heighten. Finally, in the end act, the events are developed are resolved, and the topic of story and message of writer are transmitted. When story information is extracted from movie, it is needed to consider that it has different weights by narrative structure. Namely, when some information is extracted, it has a different influence to story deployment depending on where it locates at the beginning, middle and end acts. The beginning act is the part that exposes to audiences for story set-up various information such as setting of characters and depiction of backgrounds. And thus, it is necessary to extract much kind information from the beginning act in order to abstract a movie or retrieve character information. Thereby, this paper proposes a novel method for extracting the beginning boundaries. It is the method that detects a boundary scene between the beginning act and middle using the accumulation graph of characters. The beginning act consists of the scenes that introduce important characters, imply the conflict relationship between them, and suggest clues to resolve troubles. First, a scene that the new important characters don't appear any more should be detected in order to extract a scene completed the introduction of them. The important characters mean the major and minor characters, which can be dealt as important characters since they lead story progression. Extra should be excluded in order to extract a scene completed the introduction of important characters in the accumulation graph of characters. Extra means the characters that appear only several scenes. Second, the inflection point is detected in the accumulation graph of characters. It is the point that the increasing line changes to horizontal line. Namely, when the slope of line keeps zero during long scenes, starting point of this line with zero slope becomes the inflection point. Inflection point will be detected in the accumulation graph of characters without extra. Third, several scenes are considered as additional story progression such as conflicts implication and clues suggestion. Actually, movie story can arrive at a scene located between beginning act and middle when additional several scenes are elapsed after the introduction of important characters. We will decide the ratio of additional scenes for total scenes by experiment in order to detect this scene. The ratio of additional scenes is gained as 7.67% by experiment. It is the story inflection point to change from beginning to middle act when this ratio is added to the inflection point of graph. Our proposed method consists of these three steps. We selected 10 movies for experiment and evaluation. These movies consisted of various genres. By measuring the accuracy of boundary detection experiment, we have shown that the proposed method is more efficient.

• Journal of KIISE:Computer Systems and Theory
• /
• v.34 no.12
• /
• pp.665-682
• /
• 2007

Line drawing is a widely used style in non-photorealistic rendering because it generates expressive descriptions of object shapes with a set of strokes. Although various techniques for line drawing of 3D objects have been developed, line drawing of 2D images has attracted little attention despite interesting applications, such as image stylization. This paper presents a robust and effective technique for generating line drawings from 2D images. The algorithm consists of three parts; filtering, linking, and stylization. In the filtering process, it constructs a likelihood function that estimates possible positions of lines in an image. In the linking process, line strokes are extracted from the likelihood function using clustering and graph search algorithms. In the stylization process, it generates various kinds of line drawings by applying curve fitting and texture mapping to the extracted line strokes. Experimental results demonstrate that the proposed technique can be applied to the various kinds of line drawings from 2D images with detail control.

• Design Convergence Study
• /
• v.14 no.4
• /
• pp.133-150
• /
• 2015

In this study, we proposed Interactive Visualization methods that can be analyzed relations between nations in various viewpoints such as period, issue using total 5211 of the UN General Assembly voting data.For this research, we devised a similarity matrix between nations and developed two visualization method based similarity matrix. The first one is Network Graph Visualization that can be showed relations between nations which participated in the vote of the UN General Assembly like Social Network Graph by year. and the second one is Proximity based Circular Visualization that can be analyzed relations between nations focus on one nation or Changes in voting patterns between nations according to time. This study have a great signification. that's because we proposed Proximity based Circular Visualization methods which merged Line and Circle Graph for network analysis that never tried from other cases of studies that utilize conventional voting data and made it. We also derived co-operatives of each visualization through conducting a comparative experiment for the two visualization. As a research result, we found that Proximity based Circular Visualization can be better analysis each node and Network Graph Visualization can be better analysis patterns for the nations.

• 제어로봇시스템학회:학술대회논문집
• /
• 1997.10a
• /
• pp.860-863
• /
• 1997

FCM(Fuzzy Cognitive Map) is a fuzzy signed directed graph for representing causal reasoning which has fuzziness between causal concepts. Authors have already proposed FCM-based fault diagnostic scheme. However, the previously proposed scheme has the problem of lower diagnostic resolution. In order to improve the diagnostic resolution, a new diagnostic scheme based on extended FCM which incorporates the concept of fuzzy number into FCM is developed in this paper. Furthermore, an enhanced TAM(Temporal Associative Memory) recall procedure and pattern matching scheme are also proposed.

• Proceedings of the KIEE Conference
• /
• 1995.11a
• /
• pp.219-221
• /
• 1995

This paper proposes a model for simulation and performance evaluation of distributed computer systems(DCS). The model is composed of operating system(OS), resource, task, environment submodel. Task Flow Graph(TFG) is suggested to describe the relation between tasks. This paper considers task response time, the scheduler's ready queue length, utilization of each resource as performance indices. The distributed system of Continuous Annealing Line(CAL) in iron process is simulated with the proposed model.

• Journal of the Institute of Convergence Signal Processing
• /
• v.3 no.2
• /
• pp.89-95
• /
• 2002

Global routing is to assign each net to routing regions to accomplish the required interconnections. The most popular algorithms for global routing inlcude maze routing algorithm, line-probe algorithm, shortest path based algorithm, and Steiner tree based algorithm. In this paper we propose weighted network heuristic(WNH) as a minimal Steiner tree search method in a routing graph and a genetic algorithm based on WNH for the global routing. We compare the genetic algorithm(GA) with simulated annealing(SA) by analyzing the results of each implementation.

• Fibers and Polymers
• /
• v.6 no.2
• /
• pp.156-161
• /
• 2005

The gray line-profile method is introduced to find fabric density. Some patterned fabrics like stripe design as well as solid fabrics of basic weave structures are used to verify the efficiency and accuracy of the method. The approach is compared with Fourier transform method. Although the gray line-profile method is concise, it shows good results in both solid and patterned fabrics. In addition, it does not require a pre-processing or filtering technique in space or frequency domain to enhance the image suitable for the analysis. However, the approach is slightly influenced by the filter size for finding the local minimums of profile graph.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.33B no.9
• /
• pp.124-134
• /
• 1996

Korean has a large set of characters, and has a two-dimensional formation: each character is composed of graphemes in two dimensions. Whereas connections between characters are rare, connections inside a grapheme and between graphemes happen frequently and these connections generate many cursive strokes. To deal with the large character set and the cursive strokes, using the graphemes as a recognition unit is an efffective approach, because it naturally accommodates the structural characteristics of the characters. In this paper, we propose a grapheme-based on-line recognition method for cursive korean characters. Our method uses a TDNN recognition engine to segment cursive strokes into graphemes and a graph-algorithmic postprocessor based on korean grapheme composition rule and viterbi search algorithm to find the best recognition score path. We experimented the method on freely hand-written charactes and obtained a recognition rate of 94.5%.