• The Transactions of the Korea Information Processing Society
• /
• v.7 no.5
• /
• pp.1579-1586
• /
• 2000

This paper propose a method of shape analysis and representation for the handwritten Hangul character patterns. Each of the connected components composing a Hangul character is decomposed into many parts, and skeletons are extracted from the decomposed parts. Using the results, we represent the shape of Hangul characters using the attributed graph representation. A node of the attributed graph represents a part and an edge represents their relationships and they store valuable informations of the pattern shapes.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.14 no.10
• /
• pp.4007-4024
• /
• 2020

It is tremendously important to construct decision trees to use as a tool for knowledge representation from a given decision table. However, the usual algorithms may split the decision table based on each value, which is not efficient for numerical attributes. The methodology of this paper is to split the given decision table into binary groups as like the CART algorithm, that uses binary split to work for both categorical and numerical attributes. The difference is that it uses split for each attribute established by the directed acyclic graph in a dynamic programming fashion whereas, the CART uses binary split among all considered attributes in a greedy fashion. The aim of this paper is to study the effect of binary splits in comparison with each value splits when building the decision trees. Such effect can be studied by comparing the number of nodes, local and global misclassification rate among the constructed decision trees based on three proposed algorithms.

• Journal of Korea Multimedia Society
• /
• v.5 no.1
• /
• pp.114-119
• /
• 2002

Realtime assignment of railways is an important component in the railway control systems. To solve this problem, we must exactly represent the track topology. Graph is a proper data structure for representing general network topologies, but not Proper for track topologies. In this paper, we define a new data structure, railway graph, which can exactly represent topologies of railway networks. And we describe a path search algorithm in the defined railway graph, and a top-down approach for designing railway network by the Proposed graph.

• Journal of applied mathematics & informatics
• /
• v.26 no.5_6
• /
• pp.851-860
• /
• 2008

A countable locally finite triangulation is a strong triangulation if a representation of the graph contains no vertex- or edge-accumulation points. In this paper we exhibit the structure of an infinite strong triangulation and prove the existence of connected spanning subgraph with maximum degree 4 in such a graph

• Proceedings of the Korea Society for Industrial Systems Conference
• /
• 2008.10b
• /
• pp.651-655
• /
• 2008

Traditional slicing techniques make slices through dependence graphs. They also improve the accuracy of slices. However, traditional slicing techniques require many vertices and edges in order to express a data communication links. Therefore the graph becomes complicated, and size of the slices is larger. We propose the representation of a dynamic object-oriented program dependence graph so as to process the slicing of object-oriented programs that is composed of related programs in order to process certain jobs. The efficiency of the proposed efficient dynamic object-oriented program dependence graph technique is also compared with the dependence graph techniques discussed previously. As a result, this is certifying that an efficient dynamic object-oriented program dependence graph is more efficient in comparison with the traditional dynamic object-oriented program dependence graph.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2022.11a
• /
• pp.380-382
• /
• 2022

Extracting informative representation of molecules using graph neural networks(GNNs) is crucial in AI-driven drug discovery. Recently, the graph research community has been trying to replicate the success of self supervised in natural language processing, with several successes claimed. However, we find the benefit brought by self-supervised learning on applying varitional auto-encoders can be potentially effective on molecular data.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 1999.05a
• /
• pp.179-184
• /
• 1999

A Timing Diagram is almost used to represent the various signals such as an address bus, a data bus, and the control signals during design and analysis of a digital system. But if so, its representation is somewhat complicated and also it is difficult to analyze the operation of the system. In this paper, we proposed the representation method of timing diagrams with the EMFG(Extended Mark Flow Graph). In the EMFG representation of the system operation, the logical states due to the various signals of the system is graphically represented. Therefore the proposal method allows that it is easy to design as well as analyze the system. As examples applied, we represented the memory read cycle of $\mu$PD70320 CPU and the read cycle of MCM60256A memory with the EMFG.

• 전기의세계
• /
• v.17 no.2
• /
• pp.11-15
• /
• 1968

One of the most important methods used in the modern analysis of linear networks and systems is the signal flow graph technique, first introduced by S.J. Mason in 1953. In essence, the signal-flow graph technique is a graphical method of solving a set of simultaneous. It can, therefore, be regarded as an alternative to the substitution method or the conventional matrix method. Since a flow-graph is the pictorial representation of a set of equations, it has an obvious advantage, i.e., it describes the flow of signals from one point of a system to another. Thus it provides cause-and-effect relationship between signals. And it often significantly reduces the work involved, and also yields an easy, systematic manipulation of variables of interest. Mason's formula is very powerful, but it is applicable only when the desired quantity is the transmission gain between the source node and sink node. In this paper, author summarizes the signal-flow graph technique, and stipulates three rules for conversion of an arbitrary nonsource node into a source node. Then heuses the conversion rules to obtain various quantities, i.e., networks gains, functions and parameters, through simple graphical manipulations.

• Journal of the Korean Institute of Telematics and Electronics C
• /
• v.34C no.8
• /
• pp.79-87
• /
• 1997

For the representation of a complex object, the object is decomposed into several parts, and it is described by these decomposed parts and their relations. In genral, the parts can be the primitive elements that can not be decomposed further, or can be decomposed into their subparts. Therefore, the hierarchical description method is very natural and it si represented by a hierarchical attributed graph whose vertieces represent either primitive elements or graphs. This graphs also have verties which contain primitive elements or graphs. When some uncertainty exists in the hierarchical description of a complex object either due to noise or minor deformation, a probabilistic description of the object ensemble is necessary. For this purpose, in this paper, we formally define the hierarchical attributed random graph which is extention of the hierarchical random graph, and erive the equations for the entropy calculation of the hierarchical attributed random graph, and derive the equations for the entropy calculation of the hierarchical attributed random graph. Finally, we propose the application areas to use these concepts.

• Proceedings of the Korean Institute of Electrical and Electronic Material Engineers Conference
• /
• 2001.07a
• /
• pp.791-794
• /
• 2001

We described a method resonant mode identification in dielectric-disc loaded cylindrical cavity resonators. The characteristic equation is solved by using the ContourPlot graph of Mathematica. Contour graph method uses graphical method. It is comparable with numerical method. The numerical method is very difficult a mode identification. The analysis based on the approximated electromagnetic representation. This kinds of studies only concentrated on the calculation of resonant frequencies, and a mode identification of resonant frequencies have not been covered. But, the contour graph method to analyze the characteristic equations is simple and all parts of resonant frequency graph can be easily drawn, it is possible to calculate precise resonant frequencies and to identify the mode of resonant frequencies.