• Journal of the Korean Society of Combustion
• /
• v.16 no.2
• /
• pp.16-22
• /
• 2011

It is a challenging task to apply large detailed chemical mechanisms of fuel oxidation in simulation of complex combustion phenomena. There exist a few systematic methodologies to reduce detailed chemical mechanisms to smaller sizes involving less computational load. This research work concerns generation of a skeletal chemical mechanism by a directed relation graph with specified accuracy requirement. Two sequential stages for mechanism reduction are followed in a perfectly stirred reactor(PSR) for high temperature chemistry and to consider the autoignition delay time for low and high temperature chemistry. Reduction was performed for the detailed chemical mechanism of n-heptane consisting of 561 species and 2539 elementary reaction steps. Validation results show acceptable agreement for the autoignition delay time and the PSR calculation in wide parametric ranges of pressure, temperature and equivalence ratio.

• Journal of Korea Multimedia Society
• /
• v.24 no.10
• /
• pp.1326-1335
• /
• 2021

As part of the cell division method, we proposed a method for segmenting images generated by topography microscopes through deep learning-based feature generation and graph segmentation. Hybrid vector shapes preserve the overall shape and boundary information of cells, so most cell shapes can be captured without any post-processing burden. NIH-3T3 and Hela-S3 cells have satisfactory results in cell description preservation. Compared to other deep learning methods, the proposed cell image segmentation method does not require postprocessing. It is also effective in preserving the overall morphology of cells and has shown better results in terms of cell boundary preservation.

• IEMEK Journal of Embedded Systems and Applications
• /
• v.14 no.4
• /
• pp.219-226
• /
• 2019

One of the most widely studied protocols for tactical ad-hoc networks is Optimized Link State Routing Protocol (OLSR). As for OLSR research, most research work focus on reducing control traffic overhead and choosing relay point. In addition, because OLSR is mostly dependent on link detection and propagation, dynamic Hello timer become research challenges. However, different timer interval causes imbalance of link validity time by affecting link lifetime. To solve this problem, we propose a weighted topology graph model for constructing a robust network topology based on the link validity time. In order to calculate the link validity time, we use control message timer, which is set for each node. The simulation results show that the proposed mechanism is able to achieve high end-to-end reliability and low end-to-end delay in small networks.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.18 no.4
• /
• pp.709-714
• /
• 2023

A flexible planning system is an important element for the robot to perform various tasks. In this paper, we introduce an automated planning system architecture that can deal with the changing environment. PDDL is used for symbolic-based task planning, and a graph database is used for real-time environment information updates for automated PDDL generation. The proposed framework was verified through scenario-based experiments.

• Annual Conference on Human and Language Technology
• /
• 2021.10a
• /
• pp.597-601
• /
• 2021

주어진 정보를 자연어로 변환하는 작업은 대화 시스템의 핵심 모듈임에도 불구하고 학습 데이터의 제작 비용이 높아 공개된 데이터가 언어에 따라 부족하거나 없다. 이에 본 연구에서는 텍스트-투-그래프(text-to-graph) 작업인 관계 추출에 쓰이는 데이터의 입출력을 반대로 지정하여 그래프-투-텍스트(graph-to-text) 생성 작업에 이용하는 역 관계 추출(reverse relation extraction, RevRE) 기법을 소개한다. 이 기법은 학습 데이터의 양을 늘려 영어 그래프-투-텍스트 작업의 성능을 높이고 지식 묘사 데이터가 부재한 한국어에선 데이터를 재생성한다.

• Journal of Internet Computing and Services
• /
• v.15 no.6
• /
• pp.125-132
• /
• 2014

Since frequent pattern mining was proposed in order to search for hidden, useful pattern information from large-scale databases, various types of mining approaches and applications have been researched. Especially, frequent graph pattern mining was suggested to effectively deal with recent data that have been complicated continually, and a variety of efficient graph mining algorithms have been studied. Graph patterns obtained from graph databases have their own importance and characteristics different from one another according to the elements composing them and their lengths. However, traditional frequent graph pattern mining approaches have the limitations that do not consider such problems. That is, the existing methods consider only one minimum support threshold regardless of the lengths of graph patterns extracted from their mining operations and do not use any of the patterns' weight factors; therefore, a large number of actually useless graph patterns may be generated. Small graph patterns with a few vertices and edges tend to be interesting when their weighted supports are relatively high, while large ones with many elements can be useful even if their weighted supports are relatively low. For this reason, we propose a weight-based frequent graph pattern mining algorithm considering length-decreasing support constraints. Comprehensive experimental results provided in this paper show that the proposed method guarantees more outstanding performance compared to a state-of-the-art graph mining algorithm in terms of pattern generation, runtime, and memory usage.

• Journal of KIISE:Databases
• /
• v.27 no.2
• /
• pp.256-268
• /
• 2000

Multi-way spatial join is a nested expression of two or more spatial joins. It costs much to process multi-way spatial join, but there have not still reported the scheme of parallel processing of multi-way spatial join. In this paper, parallel processing of multi-way spatial join consists of parallel multi-way spatial filter and parallel spatial refinement. Parallel spatial refinement is executed by the following two steps. The first is the generation of a graph used for reducing duplication of both spatial objects and spatial operations from pairs candidate object table that are the results of multi-way spatial filter. The second is the parallel spatial refinement using that graph. Refinement using the graph is proved to be more efficient than the others. In task creation for parallel refinement, minimum duplication partitioning of the Spatial_Obicct_On_Node graph shows best performance.

• The Transactions of the Korea Information Processing Society
• /
• v.4 no.5
• /
• pp.1327-1336
• /
• 1997

Test generation from the communication protocol specified in I/OFSM protocol is based on the asumption that the specification S and implemenataiton I are storngly, connected,minmal and deterministic.In this paper,we identify why these asumptions are necessary for minimal test cases genration from I/OFSM protocol speci-fication,and we propose a graph Rewriting System and its application to the specification I/OFSM for verifying its storng cinnectivity.We prove that the suggested algorithm is more dffcient thah the traditional strongly connected compoment find algorithm.

• The Journal of the Korea Contents Association
• /
• v.13 no.6
• /
• pp.9-19
• /
• 2013

In this paper, we develop a Spatio-Temporal graph as of a key component of our knowledge representation Scheme. We design an integrated representation scheme to depict not only present and past but future in parallel with the spaces in an effective and intuitive manner. An event in general occupies not only a space but a time. Hence a crucial premise for the simulation of virtual situations is to position events in the multi-dimensional context, that is, 3-D space extended by the temporal dimension. Furthermore an event tends to have physical, social and mental aspects intertwined. As a result we need diverse information structures and functions to model entities and relations associated with events and to describe situations in different stances or perspectives of the virtual agents. These structures and functions are implemented in terms of integrated and intuitive representation schemes at different levels such as Ontology View, Instance View, ST View, Reality View. The resulting multi-dimensional comprehensive knowledge structure accommodates multi-layered virtual world developing in the time to maximize the diversity of situations in the historical context. The viability of this knowledge representation scheme is demonstrated with a typical scenario applied to a simulator implemented based on the ST Graph. The virtual stage based on the ST graph can be used to provide natural contexts for situated learning or next-generation simulation games.

• Journal of KIISE:Computer Systems and Theory
• /
• v.31 no.10
• /
• pp.603-609
• /
• 2004

Procedural texture has many advantages that its representation is extremely compact and unfixed in resolution. However, it can be difficult for an end-user having no programming skill to build and debug. This paper presents a new interactive design system for procedural texture generation. The user's interactive design process based on multi-layer operations is represented with a graph structure, which consists of the data node, the operation and the output. Since our system generates automatically a shading language, a user who is not acquainted with implicit concepts can make procedural texturing by using an intuitive and flexible interface. Simulation results showed that the proposed method can make a variety of texture patterns efficiently.