• The KIPS Transactions:PartA
• /
• v.11A no.1
• /
• pp.75-80
• /
• 2004

To interact database data with GRID system, implementation and installation of data manipulation module which manipulates database data and its index is required. Developing a search system searching data on web-based database, and integrating it with grid system, it is possible that searching data on web and use it directly on GRID system without independent data module. So, we can build easy and effective grid system, and the system could have more flexible architecture adapting data change. In this paper, we propose a searching system which interacting web-based database with GRID systems. We integrated the searching system with a bio god system which runs virtual screening jobs. As a result, UB Grid (Universal Bio Grid) is constructed. Developer could reduce time and effort required to integrate web data to GRID system, and user could use UB Grid system easily and effectively.

• Journal of KIISE:Computing Practices and Letters
• /
• v.16 no.2
• /
• pp.217-221
• /
• 2010

As the appearances of various new mobile devices and the explosive growth of mobile device users, many researches related to mobile P2P systems have been proceeded actively. In this paper, we propose a new search algorithm for the double-layered super peer system in the mobile environment. For the proposed search algorithm, we divide the entire experiment region into a grid of cells, each of which has the same size. The grid is configured properly by considering the communication range of a mobile device and the number of peers in the system. The proposed search algorithm is a partial flooding search method based on the directions of cells involved with the search. It reduces successfully the network traffic, but shows a low search hit ratio. To enhance the search hit ratio, we introduce a bridge-peer table for a super peer and utilize an n-way search. The experimental results show that the proposed algorithm made an average of 20~30% reduction in the number of message packets over the double-layered system. The success ratio was also improved about 2~5% over the double-layered system.

• 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.

• Journal of the Korean Society for Aeronautical & Space Sciences
• /
• v.39 no.11
• /
• pp.995-1004
• /
• 2011

Object X-ray method commonly used for hole search in overset grids requires huge amount of time due to complicated vector calculations to search the cross-points as well as time-consuming hole search algorithm with respect to background grids. Especially, when the grid system is in motion relative to the background, hole points should be searched at every time step, leading to hung computational burden. To cope with this difficulties, this study presents an efficient hole search algorithm mainly designed to reduce hole searching time. To this end, virtual surface with reduced grid points is suggested and logical operators are employed as a classification algorithm instead of complicated vector calculations. In addition, the searching process is further accelerated by designating hole points in a row rather than discriminating hole points with respect to each background grid points. If there exists a relative motion, the present algorithm requires much less time because only the virtual surface needs to be moved at every time step. The hole searching time has been systematically compared for a few selected geometries.

• Journal of the Korea Society of Computer and Information
• /
• v.20 no.1
• /
• pp.85-92
• /
• 2015

As computer game maps get more elaborate, path-finding by using $A^*$ algorithm in grid-based game maps becomes bottlenecks of the overall game performance. It is because the search space becomes large as the number of nodes increases with detailed representation in cells. In this paper we propose an efficient pathfinding method in which the computer game maps in a regular grid is converted into the polygon-based representation of the list of vertices and then the visibility information about vertices of polygons can be utilized. The conversion to the polygon-based map does not give any effect to the real-time query process because it is preprocessed offline. The number of visited nodes during search can be reduced dramatically by designing heuristics using visibility information of vertices that make the accuracy of the estimation enhanced. Through simulations, we show that the proposed methods reduce the search space and the search time effectively while maintaining the advantages of the grid-based method.

• Journal of Korean Association for Spatial Structures
• /
• v.15 no.2
• /
• pp.87-94
• /
• 2015

This paper aimed at modeling a fine triangular grid for network dome by using Harmony Search (HS) algorithm. For this purpose, an optimization process to find a fine regular triangular mesh on the curved surface was proposed and the analysis program was developed. An objective function was consist of areas and edge's length of each triangular and its standard deviations, and design variables were subject to the upper and lower boundary which was calculated on the nodal connectivity. Triangular network dome model, which was initially consist of randomly irregular triangular mesh, was selected for the target example and the numerical result was analyzed in accordance with the HS parameters. From the analysis results of adopted model, the fitness function has been converged and the optimized triangular grid could be obtained from the initially distorted network dome example.

• IEMEK Journal of Embedded Systems and Applications
• /
• v.18 no.3
• /
• pp.117-124
• /
• 2023

In the machine vision inspection equipment, diameter measurement is important process in inspection of cylindrical object. However, machine vision inspection equipment requires complex algorithm processing such as camera distortion correction and perspective distortion correction, and the increase in processing time and cost required for precise diameter measurement. In this paper, we proposed the algorithm for diameter measurement of cylindrical object using the laser displacement sensor. In order to fit circle for given four input outer points, grid search algorithms using root-mean-square error and mean-absolute error are applied and compared. To solve the limitations of the grid search algorithm, we finally apply the singular-value-decomposition based circle fitting algorithm. In order to compare the performance of the algorithms, we generated the pseudo data of the outer points of the cylindrical object and applied each algorithm. As a result of the experiment, the grid search using root-mean-square error confirmed stable measurement results, but it was confirmed that real-time processing was difficult as the execution time was 10.8059 second. The execution time of mean-absolute error algorithm was greatly improved as 0.3639 second, but there was no weight according to the distance, so the result of algorithm is abnormal. On the other hand, the singular-value-decomposition method was not affected by the grid and could not only obtain precise detection results, but also confirmed a very good execution time of 0.6 millisecond.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.60 no.8
• /
• pp.1467-1472
• /
• 2011

This paper presents an optimal operation of microgrid systems and considering a tie-lines capacities that concerned each grid. The microgrid system consists of a wind turbine, a diesel generator, and a fuel cell. An one day load profile and wind resource for wind turbine generator were used for the study. For the grid interconnection, tie-line capacities were applied as constraints. The capacity constraints of tie-lines in production cost analysis are very important issues in the operation and planning of microgrid. In optimization, the Harmony Search (HS) algorithm is used for solving the problem of microgrid system operation which a various generation resources are available to meet the customer load demand with minimum operating cost. The application of HS algorithm to optimal operation of microgrid proves its effectiveness to determine optimally the generating resources without any differences of load mismatch.

• Environmental Engineering Research
• /
• v.24 no.4
• /
• pp.559-565
• /
• 2019

In order to alleviate the environmental pressure caused by production process of thermal power plants, the application of cleaner production is imperative. To estimate the implementation effects of cleaner production in thermal plants and optimize the strategy duly, it is of great significance to take a comprehensive evaluation for sustainable development. In this paper, a hybrid model that integrated the analytic hierarchy process (AHP) with least squares support vector machine (LSSVM) algorithm optimized by grid search (GS) algorithm is proposed. Based on the establishment of the evaluation index system, AHP is employed to pre-process the data and GS is introduced to optimize the parameters in LSSVM, which can avoid the randomness and inaccuracy of parameters' setting. The results demonstrate that the combined model is able to be employed in the comprehensive evaluation of the cleaner production in the thermal power plants.

• Journal of Korean Society for Geospatial Information Science
• /
• v.4 no.2 s.8
• /
• pp.173-180
• /
• 1996

In a grid based data transformation, the different gridding methods provide different interpretations of scattered data because each method calculate grid node values using a different weighted mathematical algorithms. Therefore, it is necessary to review the interpolated characteristics of some gridding methods according to search distance, search area and search options before determing the best method with a data set. For this, in this paper, six different gridding methods with the same search conditions are applied to a scattered data obtained from sterro-plotter. The interpolated characteristics of the scattered geographic data considered through comparison of coincidence between the data point and the grid node being interpolated. And also, shows the real application of gridding methods through calculating volumes and creating cross sections.