• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.45 no.2
• /
• pp.10-17
• /
• 2008

In this paper, we propose an efficient data replication strategy based on Peer-to-Peer which improves the performance of Data Grid system. The key idea of this replication strategy is to add the Peer-to-Peer concept for reducing data transmission restriction caused by hierarchical topology. And, it makes the nodes can store data replica to set a critical section at the storage of client level nodes. Therefore, it is possible to transmit the data replica between client level nodes and from client level nodes to upper data replication server. It is more effective to transmit data replica between client level nodes than transmitting data replica 1mm data server or data replication server with respect to minimize the transmission time. This results in improving the performance of Data Grid system. Through simulation, we show that the proposed data replication strategy based on Peer-to-Peer improves the performance of entire Data Grid environment compared to previous strategies.

• The Transactions of the Korean Institute of Electrical Engineers D
• /
• v.54 no.9
• /
• pp.539-546
• /
• 2005

This paper describes a method of building the probability grid map for an autonomous mobile robot using the ultrasonic DAF(data association filter). The DAF, which evaluates the association of each data with the rest and removes the data affected by the specular reflection effect, can improve the reliability of the data for the Probability grid map. This method is based on the evaluation of possibility that the acquired data are all from the same object. Namely, the data from specular reflection have very few possibilities of detecting the same object, so that they are excluded from the data cluster during the process of the DAF. Therefore, the uncertain data corrupted by the specular reflection and/or multi-path effect, are not used to update the probability map, and hence building a good quality of a grid map is possible even in a specular environment. In order to verify the effectiveness of the DAF, it was applied to the Bayesian model and the orientation probability model which are the typical ones of a grid map. We demonstrate the experimental results using a real mobile robot in the real world.

• Proceedings of the Korean Information Science Society Conference
• /
• 2007.06c
• /
• pp.336-340
• /
• 2007

We envisage that grid computing environments allow us to implement distributed data mining services, that is, those applications which analyze large sets of geographically distributed databases and information using the computational power and resources of a grid environment. This paper describes an experimental framework towards such a distributed data mining approach, including design considerations and a prototype implementation. Based on the "Knowledge Grid" architecture suggested by Cannataro et al., we identify four major components - user node, broker node, data node, and computation node - and define their individual roles. For implementing the prototype, we have investigated methods for utilizing distributed resources within a grid computing environment, e.g., communication and coordination among the various resources available.

• The KIPS Transactions:PartD
• /
• v.11D no.5
• /
• pp.1011-1020
• /
• 2004

A lot of work has been done to improve the I/O performance of such a system that store and manage a massive amount of data by distributing them across multiple disks and access them in parallel. Most of the previous work has focused on an efficient mapping from a grid ceil, which is determined bY the interval number of each dimension, to a disk number on the assumption that each dimension is split into disjoint intervals such that entire data space is GRID-like partitioned. However, they have ignored the effects of a GRID partitioning scheme on declustering performance. In this paper, we enhance the performance of mapping function based declustering algorithms by applying a good GRID par-titioning method. For this, we propose an estimation model to count the number of grid cells intersected by a range query and apply a GRID partitioning scheme which minimizes query result size among the possible schemes. While it is common to do binary partition for high-dimensional data, we choose less number of dimensions than needed for binary partition and split several times along that dimensions so that we can reduce the number of grid cells touched by a query. Several experimental results show that the proposed estimation model gives accuracy within 0.5% error ratio regardless of query size and dimension. We can also improve the performance of declustering algorithm based on mapping function, called Kronecker Sequence, which has been known to be the best among the mapping functions for high-dimensional data, up to 23 times by applying an efficient GRID partitioning scheme.

• The Journal of the Korea Contents Association
• /
• v.9 no.12
• /
• pp.877-885
• /
• 2009

In this paper, we propose the SINDI-Grid which is a high-performance framework for scientific and technological knowledge discovery using the grid computing. By using the advantages of the grid computing providing data repository of large-volume and high-speed computing power, the SINDI-Grid framework provides a variety of grid services for distributed data analysis and scientific knowledge processing. And the SINDI-Workflow tool exploits these services so that performs the design and execution for scientific and technological knowledge discovery applications which integrate various information processing algorithms.

• 한국전산유체공학회:학술대회논문집
• /
• 2006.10a
• /
• pp.193-198
• /
• 2006

It takes a lot of time and effort to generate grids for numerical analysis of problems with ground effect because the relative attitude and height of airfoil should be maintained to the ground as well as the inflow. A low Mach number preconditioned turbulent flow solver using the overlap grid technique has been developed and applied to the ground effect simulation. It has been validated that the present method using the multi-block grid gives us highly accurate solutions comparing with the experimental data of the RAE 101 airfoil in an unbounded condition. Present numerical method has been extended to simulate ground effect problems by using the overlapped grid system to avoid tedious work in generating multi-block grid system. An extended method using the overlapped grid has been verified and validated by comparing with results of multi-block method and experimental data as well. Consequently, the overlapped grid method can provide not only sufficiently accurate solutions but also the efficiency to simulate ground effect problems. It is shown that the pressure and aerodynamic centers move backward by the ground effect as the airfoil approaches to the ground.

• International Journal of Contents
• /
• v.6 no.1
• /
• pp.47-52
• /
• 2010

Skyline queries are an important new search capability for multi-dimensional databases. Most of the previous works have focused on processing skyline queries over static data set. However, most of the real applications deal with the dynamic data set. Since dynamic data set constantly changes as time passes, the continuous skyline computation over dynamic data set becomes ever more complicated. In this paper, we propose a multiple layer grids method for continuous skyline computation (MLGCS) that maintains multiple layer grids to manage the dynamic data set. The proposed method divides the work space into multiple layer grids and creates the skyline influence region in the grid of each layer. In the continuous environment, the continuous skyline queries are only handled when the updating data points are in the skyline influence region of each layer grid. Experiments based on various data distributions show that our proposed method outperforms the existing methods.

• Journal of Electrical Engineering and Technology
• /
• v.6 no.3
• /
• pp.375-383
• /
• 2011

This paper describes a real-time hardware simulator for a grid-tied Permanent Magnet Synchronous Generator (PMSG) wind power system, which consists of an anemometer, a data logger, a motor-generator set with vector drive, and a back-to-back power converter with a digital signal processor (DSP) controller. The anemometer measures real wind speed, and the data is sent to the data logger to calculate the turbine torque. The calculated torque is sent to the vector drive for the induction motor after it is scaled down to the rated simulator power. The motor generates the mechanical power for the PMSG, and the generated electrical power is connected to the grid through a back-to-back converter. The generator-side converter in a back-to-back converter operates in current control mode to track the maximum power point at the given wind speed. The grid-side converter operates to control the direct current link voltage and to correct the power factor. The developed simulator can be used to analyze various mechanical and electrical characteristics of a grid-tied PMSG wind power system. It can also be utilized to educate students or engineers on the operation of grid-tied PMSG wind power system.

• Proceedings of the KSRS Conference
• /
• 2003.11a
• /
• pp.1105-1107
• /
• 2003

Remote sensing data processing and analysis system can be developed based on the Grid Coverage Specification and this kind of system is also can be easily interoperate with GIS systems conforming OpenGIS specification. This paper proposes a method to implement easily and quickly the new grid coverages that provide new operations, or services, by reusing the existing grid coverage components, which is based on the fact that the pipeline constructed by grid coverages can be represented in one grid coverage. This method complements easily the deficiency of the existing grid coverage components and enables quick implementation of the new grid coverage that provides complex processing operations.

• The Journal of Korea Robotics Society
• /
• v.9 no.2
• /
• pp.104-110
• /
• 2014

Mapping is a fundamental element for robotic services. There are available many types of map data representation such as grid map, metric map, topology map, etc. As more robots are deployed for services, more chances of exchanging map data among the robots emerge and standardization of map data representation (MDR) becomes more valuable. Currently, activities in developing MDR standard are underway in IEEE Robotics and Automation Society. The MDR standard is for a common representation and encoding of the two-dimensional map data used for navigation by mobile robots. The standard focuses on interchange of map data among components and systems, particularly those that may be supplied by different vendors. This paper aims to introduce MDR standard and its application to map merging. We have applied the basic structure of the MDR standard to a grid map and Voronoi graph as a kind of topology map and performed map merging between two different maps. Simulation results show that the proposed MDR is suitable for map data exchange among robots.