• Journal of Digital Convergence
• /
• v.12 no.12
• /
• pp.285-292
• /
• 2014

Intelligent systems are systems that mainly use knowledge rather than data or information. Therefore, knowledge representation is an important factor for intelligent system construction. Conceptual graph is a logical knowledge representation language which has graphical form and it can represent knowledge efficiently. It is, however, cumbersome to use conceptual graphs directly for programming. Various tools were developed to overcome this difficulties. In this paper, we survey on functions and characteristics of conceptual graph tools that can be utilized for constructing intelligent systems by using conceptual graphs. The result of this survey will be very helpful to use conceptual graphs for development of intelligent systems.

• Journal of Internet Computing and Services
• /
• v.2 no.4
• /
• pp.69-81
• /
• 2001

This paper describes a parallel programming environment to help programmer to write parallel programs. Parallel program must be write according to the character of the various hardware or program. So it is difficult for the programs to write the parallel programmer. In this paper, we propose and implement a parallel programming environment using graph type intermediate representation form, and graph user interface is provided for programmer to get parallel programs easily, This parallel environment supports special functions using graph type intermediate representation form. The special functions involve program editing. data dependence analysis, loop transformation. CFG, PDG, HTG. This parallel environment helps users make parallelism and optimization easy through showing the intermediate code with graph.

• 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 The Korean Association For Science Education
• /
• v.39 no.5
• /
• pp.655-668
• /
• 2019

In this study, we investigated the middle school students' processes of scientific graph construction from the perspective of the problem solving process. Ten 9th graders participated in this study. They constructed a scientific graph based on pictorial data depicting precipitation reaction. The think-aloud method was used in order to investigate their thinking processes deeply. Their activities were videotaped, and semi-structured interviews were also conducted. The analysis of the results revealed that their processes of scientific graph construction could be classified into four types according to the problem solving strategy and the level of representations utilized. Students using the structural strategy succeeded in constructing scientific graph regardless of the level of representation utilized, by analyzing the data and identifying the trend based on the propositional knowledge about the target concept of the graph. Students of random strategy-higher order representation type were able to succeed in constructing scientific graph by systematically analyzing the characteristics of the data using various representations, and considering the meaning of the graph constructed in terms of the scientific context. On the other hand, students of random strategy-lower order representation type failed to construct correct scientific graph by constructing graph in a way of simply connecting points, and checking the processes of graph construction only without considering the scientific context. On the bases of the results, effective methods for improving students' ability to construct scientific graphs are discussed.

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

We described a method resonant mode identification in dielectric-rod loaded cylindrical cavity resonators. Resonant frequency of dielectric loaded cavity is calculated by analyzing the characteristic equation. The characteristic equation is solved by using the ContourPlot graph of Mathematica. As the result of comparing calculation value and experimental value of resonant frequencies, we know that the field representation of non-decaying mode is exact. The contour graph method is not a method using approximated representation of electromagnetic field variation at the outer area of dielectric in the resonators but a method using exact representation.

• ETRI Journal
• /
• v.29 no.4
• /
• pp.507-515
• /
• 2007

Skeleton transform of which the medial axis transform is the most popular has been proposed as a useful shape abstraction tool for the representation and modeling of human posture. This paper explains this proposition with a description of the areas in which skeletons could serve to enable the representation of shapes. We present algorithms for two-dimensional posture modeling using the developed simplified shock graph (SSG). The efficacy of SSG extracted feature vectors as shape descriptors are also evaluated using three different classifiers, namely, decision tree, multilayer perceptron, and support vector machine. The paper concludes with a discussion of the issues involved in using shock graphs to model and classify human postures.

• Journal of KIISE
• /
• v.45 no.1
• /
• pp.15-21
• /
• 2018

Low-Rank Representation (LRR) based methods are widely used in many practical applications, such as face clustering and object detection, because they can guarantee high prediction accuracy when used to constructing graphs in graph - based semi-supervised learning. However, in order to solve the LRR problem, it is necessary to perform singular value decomposition on the square matrix of the number of data points for each iteration of the algorithm; hence the calculation is inefficient. To solve this problem, we propose an improved and faster LRR method based on the recently published Fast LRR (FaLRR) and suggests ways to introduce and optimize additional constraints on the underlying optimization goals in order to address the fact that the FaLRR is fast but actually poor in classification problems. Our experiments confirm that the proposed method finds a better solution than LRR does. We also propose Fast MLRR (FaMLRR), which shows better results when the goal of minimizing is added.

• Proceedings of the Korea Society for Simulation Conference
• /
• 2003.06a
• /
• pp.73-78
• /
• 2003

This paper proposes the simulator synthesis scheme which is based on the exploration of the total design space in attributed AND-OR graph. Attributed AND-OR graph is a systematic design space representation formalism which enables to represent all the design space by decomposition rule and specialization rule. In addition, attributes attached to the design entity provides flexible modeling. Based on this design space representation scheme, a pruning algorithm which can transform the total design space into sub-design space that satisfies the user requirements is given. We have shown the effectiveness of our framework by (ⅰ) constructing the design space of superscalar processor in attributed AND-OR graph (ⅱ) pruning it to obtain the ARM9 processor architecture. (ⅲ) modeling the components of the architecture and (ⅳ) simulating the ARM9 model.

• Journal of Korean Institute of Industrial Engineers
• /
• v.31 no.1
• /
• pp.10-19
• /
• 2005

The minimum spanning tree (MST) problem is one of the traditional optimization problems. Unlike the MST, the degree constrained minimum spanning tree (DCMST) of a graph cannot, in general, be found using a polynomial time algorithm. So, finding the DCMST of a graph is a well-known NP-hard problem of importance in communications network design, road network design and other network-related problems. So, it seems to be natural to use evolutionary algorithms for solving DCMST. Especially, when applying an evolutionary algorithm to spanning tree problems, a representation and search operators should be considered simultaneously. This paper introduces a new tree representation scheme and a genetic operator for solving combinatorial tree problem using evolutionary algorithms. We performed empirical comparisons with other tree representations on several test instances and could confirm that the proposed method is superior to other tree representations. Even it is superior to edge set representation which is known as the best algorithm.

• Journal of KIISE:Databases
• /
• v.29 no.5
• /
• pp.347-357
• /
• 2002

Graphs have provided a powerful methodology to solve a lot of real-world problems, and therefore there have been many proposals on the graph representations and algorithms. But, because most of them considered only memory-based graphs, there are still difficulties to apply them to large-scale problems. To cope with the difficulties, this paper proposes a graph representation and graph algorithms based on the well-developed relational database theory. Graphs are represented in the form of relations which can be visualized as relational tables. Each vertex and edge of a graph is represented as a tuple in the tables. Graph algorithms are also defined in terms of relational algebraic operations such as projection, selection, and join. They can be implemented with the database language such as SQL. We also developed a library of basic graph operations for the management of graphs and the development of graph applications. This database approach provides an efficient methodology to deal with very large- scale graphs, and the graph library supports the development of graph applications. Furthermore, it has many advantages such as the concurrent graph sharing among users by virtue of the capability of database.