• Journal of KIISE:Computer Systems and Theory
• /
• v.33 no.7
• /
• pp.448-453
• /
• 2006

We extend a parallel depth-first search (DFS) algorithm for planar graphs to deal with (non-planar) solid grid graphs, a subclass of non-planar grid graphs. The proposed algorithm takes time O(log n) with $O(n/sqrt{log\;n})$ processors in Priority PRAM model. In our knowledge, this is the first deterministic NC algorithm for a non-planar graph class.

• School Mathematics
• /
• v.1 no.2
• /
• pp.555-569
• /
• 1999

The graph unit(chapter) is a good example of a topic in elementary school mathematics for which computer use can be incorporated as part of the instruction. Teaching graph can be facilitated by using the graphing utilities of computers, which make it possible to observe the property of many types of graphs. This study was concerned with utilizing an educational software Graphers as an instructional tool in teaching to help young students gain a better understanding of graph concepts. For this purpose, three types of instructional activities using Graphers were shown in the paper. Graphers is a data-gathering tool for creating pictorial data chosen from several data sets. They can represent their data on a table or with six types of graphs such as Pictograph, Bar Graph, Line Graph, Circle Graph, Grid Plot and Loops. They help students to select the graph(s) which are the most appropriate for the purpose of analyzing data while comparing various types of graphs. They also let them modify or change graphs, such as adding grid lines, changing the axis scale, or adding title and labels. Eventually, students have a chance to interpret graphs meaningfully and in their own way.

• The Transactions of the Korean Institute of Electrical Engineers D
• /
• v.51 no.12
• /
• pp.577-582
• /
• 2002

The objective of this paper is to produce a weighted graph map for path-planning of an autonomous mobile robot(AMR) based on the measurements from a single ultrasonic sensor, which are acquired when the autonomous mobile robot explores unknown indoor circumstance. The AMR navigates in th unknown space by following the wall and gathers the range data using the ultrasonic sensor, from which the occupancy grid map is constructed by associating the range data with occupancy certainties. Then, the occupancy grid map is converted to a weighted graph map suing morphological image processing and thinning algorithms. the path- planning for autonomous navigation of a mobile robot can be carried out based on the occupancy grid map. These procedures are implemented and tested using an AMR, and primary results are presented in this paper.

• 제어로봇시스템학회:학술대회논문집
• /
• 1996.10b
• /
• pp.900-903
• /
• 1996

The objective of this paper is to make the weighted graph map for path planning using the ultrasonic sensor measurements that are acquired when an A.M.R (autonomous mobile robot) explores the unknown circumstance. First, The A.M.R navigates on unknown space with wall-following and gathers the sensor data from the environments. After this, we constructs the occupancy grid map by interpreting the gathered sensor data to occupancy probability. For the path planning of roadmap method, the weighted graph map is extracted from the occupancy grid map using morphological image processing and thinning algorithm. This methods is implemented on an A.M.R having a ultrasonic sensor.

• Journal of the Korean Association of Geographic Information Studies
• /
• v.26 no.3
• /
• pp.12-36
• /
• 2023

Graph databases, which store different types of data and their relationships modeled as a graph, can be effective in managing and analyzing real estate spatial data linked by complex relationships. However, they are not widely used due to the limited spatial functionalities of graph databases. In this study, we propose a uniform grid-based real estate spatial data management approach using a graph database to respond to various real estate-related spatial questions. By analyzing the real estate community to identify relevant data and utilizing national point numbers as unit grids, we construct a graph schema that linking diverse real estate data, and create a test database. After building a test database, we tested basic topological relationships and spatial functions using the Jackpine benchmark, and further conducted query tests based on various scenarios to verify the appropriateness of the proposed method. The results show that the proposed method successfully executed 25 out of 29 spatial topological relationships and spatial functions, and achieved about 97% accuracy for the 25 functions and 15 scenarios. The significance of this study lies in proposing an efficient data integration method that can respond to real estate-related spatial questions, considering the limited spatial operation capabilities of graph databases. However, there are limitations such as the creation of incorrect spatial topological relationships due to the use of grid-based indexes and inefficiency of queries due to list comparisons, which need to be improved in follow-up studies.

• Journal of KIISE:Computer Systems and Theory
• /
• v.31 no.3_4
• /
• pp.152-159
• /
• 2004

The Grid system is an emerging computing infrastructure that will substitute for existing distributed systems. However end users have a difficulty in using the Grid because of its complicated usage, which is an inherent characteristic from the heterogeneous mechanism of the Grid. In this paper, we present the JCML(Job Control Markup Language) and its GUI-based editor, which not only provide users with ease of use, improved working environment, but assist users to execute their jobs efficiently The JCML is a job control language that improves the RSL of Globus, which defines global services in Grid. The JCML is designed to support flexibility among various Grid services using standard XML. And it makes use of a graph representation method, GXL(Graph eXchange Language), to specify detailed job properties and dependencies among jobs using nodes and edges. The JCML editor provides users with GUI-based interface. With the JCML editor, a complicated job order can be easily completed using very simple manipulations with a mouse, such as a drag-and-drop.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.9 no.8
• /
• pp.907-914
• /
• 2014

A heuristic search algorithm is proposed to plan a collision free path for robots in an indoor environment. The proposed algorithm is to find a collision free path in the gridded configuration space by proposed heuristic graph search algorithm. The proposed algorithm largely consists of two parts : tunnel searching and path searching in the tunnel. The tunnel searching algorithm finds a thicker path from start grid to goal grid in grid configuration space. The tunnel is constructed with large grid defined as a connected several minimum size grids in grid-based configuration space. The path searching algorithm then searches a path in the tunnel with minimum grids. The computational time of the proposed algorithm is less than the other graph search algorithm and we analysis the time complexity. To show the validity of the proposed algorithm, some numerical examples are illustrated for robot.

• Kyungpook Mathematical Journal
• /
• v.60 no.2
• /
• pp.349-359
• /
• 2020

We study perfect 2-colorings of regular graphs. In particular, we consider the 4-regular case. We obtain a characterization of perfect 2-colorings of toroidal grids.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.42 no.4
• /
• pp.923-931
• /
• 2017

A power grid is one of the most complex networks and is critical infrastructure for society. To understand the characteristics of a power grid, complex network analysis has been used from the early 2000s mainly for US and European power grids. However, since the power grids of different countries might have different structures, the Korean power grid needs to be examined through complex network analysis. This paper performs the analysis for the Korean power grid, especially for high-voltage transmission networks. In addition, statistical and small-world characteristics for the Korean power grid are analyzed. Generally, the Korean power grid has similar characteristics to other power grids, but some characteristics differ because the Korean power grid is concentrated in the capital area.

• Journal of KIISE:Computer Systems and Theory
• /
• v.29 no.7
• /
• pp.411-421
• /
• 2002

In this Paper we propose a new Image analysis algorithm for microarray processing and a method to locate the position of the grid cell using the topology of the grid spots. Microarray is a device which enables a parallel experiment of 10 to 100 thousands of test genes in order to measure the gene expression. Because of the huge data obtained by a experiment automated image analysis is needed. The final output of this microarray experiment is a set of 16-bit gray level image files which consist of grid-structured spots. In this paper we propose one algorithm which located the address of spots (spot indices) using graph structure from image data and a method which determines the precise location and shape of each spot by measuring the inclination of grid structure. Several experiments are given from real data sets.