• Journal of the Korea Society for Simulation
• /
• v.14 no.3
• /
• pp.91-100
• /
• 2005

Grid computing is widely applicable to various fields of industry including process control and manufacturing, military command and control, transportation management, and so on. In a viewpoint of application area, grid computing can be classified to three aspects that are computational grid, data grid and access grid. This paper focuses on computational grid which handles complex and large-scale computing problems. Computational grid is characterized by system dynamics which handles a variety of processors and jobs on continuous time. To solve problems of system complexity and reliability due to complex system dynamics, computational grid needs scheduling policies that allocate various jobs to proper processors and decide processing orders of allocated jobs. This paper proposes a service prediction-based job scheduling model and present its scheduling algorithm that is applicable for computational grid. The service prediction-based job scheduling model can minimize overall system execution time since the model predicts the next processing time of each processing component and distributes a job to a processing component with minimum processing time. This paper implements the job scheduling model on the DEVS modeling and simulation environment and evaluates its efficiency and reliability. Empirical results, which are compared to conventional scheduling policies, show the usefulness of service prediction-based job scheduling.

• Journal of the Korea Society for Simulation
• /
• v.14 no.3
• /
• pp.21-31
• /
• 2005

In state-of-the-art games, characters can move in a goal-directed manner so that they can move to the goal position without colliding obstacles. Many path-finding methods have been proposed and implemented for these characters and most of them use the A* search algorithm. When .the map is represented with a regular grid of squares or a navigation mesh, it often takes a long time for the A* to search the state space because the number of cells used In the grid or the mesh increases for higher resolution. Moreover the A* search on the grid often causes a zigzag effect, which is not optimal and realistic. In this paper we propose to use visibility graphs to improve the search time by reducing the search space and to find the optimal path. We also propose a method of taking into account the size of moving characters in the phase of planning to prevent them from colliding with obstacles as they move. Simulation results show that the proposed method performs better than the grid-based A* algorithm in terms of the search time and space and that the resulting paths are more realistic.

• Transactions of the Korean hydrogen and new energy society
• /
• v.33 no.5
• /
• pp.591-597
• /
• 2022

Recently, technologies for efficient power grid operation have become important due to climate change. For this reason, predicting power demand using deep learning is being considered, and it is necessary to understand the influence of characteristics of each region, industrial structure, and climate. This study analyzed the power demand of New Jersey in US, with a high urbanization rate and a large service industry, and West Virginia in US, a low urbanization rate and a large coal, energy, and chemical industries. Using recurrent neural network algorithm, the power demand from January 2020 to August 2022 was learned, and the daily and weekly power demand was predicted. In addition, the power grid operation based on the power demand forecast was discussed. Unlike previous studies that have focused on the deep learning algorithm itself, this study analyzes the regional power demand characteristics and deep learning algorithm application, and power grid operation strategy.

• Journal of Power Electronics
• /
• v.18 no.3
• /
• pp.841-852
• /
• 2018

This paper presents a dual-algorithm search method (GWO-GSO) combining grey wolf optimization (GWO) and golden-section optimization (GSO) to realize maximum power point tracking (MPPT) for photovoltaic (PV) systems. First, a modified grey wolf optimization (MGWO) is activated for the global search. In conventional GWO, wolf leaders possess the same impact on decision-making. In this paper, the decision weights of wolf leaders are automatically adjusted with hunting progression, which is conducive to accelerating hunting. At the later stage, the algorithm is switched to GSO for the local search, which play a critical role in avoiding unnecessary search and reducing the tracking time. Additionally, a novel restart judgment based on the quasi-slope of the power-voltage curve is introduced to enhance the reliability of MPPT systems. Simulation and experiment results demonstrate that the proposed algorithm can track the global maximum power point (MPP) swiftly and reliably with higher accuracy under various conditions.

• Journal of Positioning, Navigation, and Timing
• /
• v.3 no.1
• /
• pp.17-23
• /
• 2014

Satellite Based Augmentation Systems (SBAS) provide ionospheric corrections at geographically five degree-spaced Ionospheric Grid Points (IGPs) and confidence bounds, called Grid Ionospheric Vertical Errors (GIVEs), on the error of those corrections. Since the ionosphere is one of the largest error sources which may threaten the safety of a single frequency Global Navigation Satellite System (GNSS) user, the ionospheric correction and integrity bound algorithm is essential for the development of SBAS. The current single frequency based SBAS, already deployed or being developed, implement the ionospheric correction and error bounding algorithm of the Wide Area Augmentation System (WAAS) developed for use in the United States. However, the ionospheric condition is different for each region and it could greatly degrade the performance of SBAS if its regional characteristics are not properly treated. Therefore, this paper discusses key factors that should be taken into consideration in the development of the ionospheric correction and integrity bound algorithm optimized for the Korean SBAS. The main elements of the conventional GIVE monitor algorithm are firstly reviewed. Then, this paper suggests several areas which should be investigated to improve the availability of the Korean SBAS by decreasing the GIVE value.

• Journal of Korea Spatial Information System Society
• /
• v.11 no.3
• /
• pp.9-18
• /
• 2009

Recently, due to the advanced technologies of mobile devices and wireless communication, there are many studies on telematics and LBS(location-based service) applications. because moving objects usually move on spatial networks, their locations are updated frequently, leading to the degradation of retrieval performance. To manage the frequent updates of moving objects' locations in an efficient way, a new distributed grid scheme, called DS-GRID (distributed S-GRID), and k-NN(k-nearest neighbor) query processing algorithm was proposed[1]. However, the result of k-NN query processing technique may be invalidated as the location of query and moving objects are changed. Therefore, it is necessary to study on continuous k-NN query processing algorithm. In this paper, we propose both MCE-CKNN and MBP(Monitoring in Border Point)-CKNN algorithmss are S-GRID. The MCE-CKNN algorithm splits a query route into sub-routes based on cell and seproves retrieval performance by processing query in parallel way by. In addition, the MBP-CKNN algorithm stores POIs from the border points of each grid cells and seproves retrieval performance by decreasing the number of accesses to the adjacent cells. Finally, it is shown from the performance analysis that our CKNN algorithms achieves 15-53% better retrieval performance than the Kolahdouzan's algorithm.

• The Transactions of the Korean Institute of Power Electronics
• /
• v.20 no.6
• /
• pp.526-533
• /
• 2015

A new algorithm is proposed for the estimation of equivalent grid impedance at the point of common coupling of a grid-tie inverter output. The estimated impedance parameter can be used for the improvement of the performance and the stability of the distributed generation system. The estimation error is inevitable in the conventional estimation method because of the axis rotation due to PLL. In the conventional estimation error, the d-q voltage and current are used for the calculation of the impedance with active and reactive current injections. Conversely, in the proposed algorithm, the negative sequence current is injected, and then the negative sequence voltage is measured for the impedance estimation. As the positive and negative sequence current controller is independent and the PLL is based on the positive sequence component only, the estimation of the equivalent impedance can be achieved with high accuracy. Simulation and experimental results are compared to validate the proposed algorithm.

• 한국전산유체공학회:학술대회논문집
• /
• 2008.03a
• /
• pp.386-389
• /
• 2008

In this paper grid generation of unstructured quadrilateral surface grids is described. The current approach uses conventional Advancing Front Method which is used to generate unstructured triangular grids. Grid cell size control is done by using closeness-based global interpolation method controlled by pre-described control elements. Algorithm and procedure for quadrilateral grid generation using AFM method and cell size control method are described. Examples of quadrilateral grid generation are shown, and difficulties and problems related to the current approach are also discussed.

• 한국전산유체공학회:학술대회논문집
• /
• 2008.10a
• /
• pp.386-389
• /
• 2008

In this paper grid generation of unstructured quadrilateral surface grids is described. The current approach uses conventional Advancing Front Method which is used to generate unstructured triangular grids. Grid cell size control is done by using closeness-based global interpolation method controlled by pre-described control elements. Algorithm and procedure for quadrilateral grid generation using AFM method and cell size control method are described. Examples of quadrilateral grid generation are shown, and difficulties and problems related to the current approach are also discussed.

• Proceedings of the Korea Society for Simulation Conference
• /
• 2005.05a
• /
• pp.29-33
• /
• 2005

Grid computing is widely applicable to various fields of industry including process control and manufacturing, military command and control, transportation management, and so on. In a viewpoint of application area, grid computing can be classified to three aspects that are computational grid, data grid and access grid. This paper focuses on computational grid which handles complex and large-scale computing problems. Computational grid is characterized by system dynamics which handles a variety of processors and jobs on continuous time. To solve problems of system complexity and reliability due to complex system dynamics, computational grid needs scheduling policies that allocate various jobs to proper processors and decide processing orders of allocated jobs. This paper proposes the service prediction-based job scheduling model and present its algorithm that is applicable for computational grid. The service prediction-based job scheduling model can minimize overall system execution time since the model predicts a processing time of each processing component and distributes a job to processing component with minimum processing time. This paper implements the job scheduling model on the DEVSJAVA modeling and simulation environment and simulates with a case study to evaluate its efficiency and reliability Empirical results, which are compared to the conventional scheduling policies such as the random scheduling and the round-robin scheduling, show the usefulness of service prediction-based job scheduling.