• 한국태양에너지학회:학술대회논문집
• /
• 2008.11a
• /
• pp.63-68
• /
• 2008

Efforts tp overcome the current challenge of global warming and abnormal temperature are being taken around the world. According to a report, average temperature of Korea has increased by about $0.8^{\circ}C$ for a century. In particular, temperature has rapidly increased since year 2000. Climate changes have brought remarkable changes in our lives. For example, agricultural field will see changes in crops and production. Energy used to maintain and manage architectures will be changed as well. In order to actively cope with rapidly changing global climate which drives changes from the basic behavior of our lives to subtle changes, international cooperation and researches are performed around the word. For instance, as a part of these global efforts, research on typical meterological data for computer simulation program to evaluate architecture energy performance is in progress in Korea. In order to conduct research on typical meterological data in format of data per time, reference regarding monthly maximum/minimum temperature time is required. Unfortunately, however, reference regarding maximum/minimum temperature time hasn't been defined in Korea. Therefore, this study aims to provide fundamental data essential for various researches by calculating maximum/minimum temperature time of major cities across Korea. According to the study, maximum temperature occurs at 3 p.m and minimum temperature occurs at 5 a.m or 6 a.m. respectively, in overall areas.

• Journal of computational fluids engineering
• /
• v.17 no.4
• /
• pp.32-40
• /
• 2012

Efficient Global Optimization (EGO) method is a global optimization technique which can select the next sample point automatically by infill sampling criteria (ISC) and search for the global minimum with less samples than what the conventional global optimization method needs. ISC function consists of the predictor and mean square error (MSE) provided from the kriging model which is a stochastic metamodel. Also the constrained EGO method can minimize the objective function dealing with the constraints under EGO concept. In this study the constrained EGO method applied to the RAE2822 airfoil shape design formulated with the constraint. But the noisy CFD data caused the kriging model to fail to depict the true function. The distorted kriging model would make the EGO deviate from the correct search. This distortion of kriging model can be handled with the interpolation(p=free) kriging model. With the interpolation(p=free) kriging model, however, the search of EGO solution was stalled in the narrow feasible region without the chance to update the objective and constraint functions. Then the accuracy of EGO solution was not good enough. So the three-step search method was proposed to obtain the accurate global minimum as well as prevent from the distortion of kriging model for the noisy constrained CFD problem.

• Atmosphere
• /
• v.17 no.2
• /
• pp.185-193
• /
• 2007

This study investigates urbanization effect in warming trend of surface air temperature over Korea. The data used in this study consist of the daily minimum and maximum temperatures during the period of 32 years(1968-1999) from 16 stations of KMA. To calculate magnitude and trend of urbanization effect, stations were classified into urban and rural stations using population statistics. Urban stations were defined as those with population densities greater than 1000 persons per kilometer squared in 1995. The others were defined as rural stations. The urban stations were also subdivided into two groups according to their population totals. For estimates of urban effect magnitude, temperature change was calculated by comparing 16-year mean values between 1968-83 and 1984-99. Then, the difference between each urban station and every rural station was calculated. During the analysis period of 32 years, maximum temperature increase is $1.22^{\circ}C$. In the total temperature increase, urban effect is estimated by 28.7%. For minimum temperature, it becomes larger by about 10% than that in maximum temperature. Therefore, urban effect in an increasing trend of minimum temperature is 38.9% in the change of $1.13^{\circ}C$.

• Journal of Institute of Control, Robotics and Systems
• /
• v.17 no.10
• /
• pp.1059-1066
• /
• 2011

This paper makes a close inquiry into ill-conditioning that may be occurred in wireless localization of the sensor nodes based on network signals in the wireless sensor network and provides the clue for solving the problem. In order to estimate the location of a node based on the range information calculated using the signal propagation time, LS (Least Squares) method is usually used. The LS method estimates the solution that makes the squared estimation error minimal. When a nonlinear function is used for the wireless localization, ILS (Iterative Least Squares) method is used. The ILS method process the LS method iteratively after linearizing the nonlinear function at the initial nominal point. This method, however, has a problem that the final solution may converge into a LM (Local Minimum) instead of a GM (Global Minimum) according to the deployment of the fixed nodes and the initial nominal point. The conditions that cause the problem are explained and an adaptive method is presented to solve it, in this paper. It can be expected that the stable location solution can be provided in implementation of the wireless localization methods based on the results of this paper.

• Journal of Korean Ophthalmic Optics Society
• /
• v.6 no.2
• /
• pp.121-127
• /
• 2001

While SVD and Gaussian elimination method were applied to the additive damped least squares(DLS), the convergence and the stability of the optimization process were examined in a triplet-type camera lens-system where the condition number is well conditioned. DLS with SVD method generated a suitable merit function but this merit function may be trapped in a local minimum by the nonlinearity of error function. Therefore, the least camera lens-system was further designed by the global optimization method is grid method, and this method is adopted to get merit function that convergent to global minimum without local minimum trapping.

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 2001.12a
• /
• pp.10-13
• /
• 2001

Nonlinear Function Approximation of Moduled Neural Network Using Genetic Algorithm Neural Network consists of neuron and synapse. Synapse memorize last pattern and study new pattern. When Neural Network learn new pattern, it tend to forget previously learned pattern. This phenomenon is called to catastrophic inference or catastrophic forgetting. To overcome this phenomenon, Neural Network must be modularized. In this paper, we propose Moduled Neural Network. Modular Neural Network consists of two Neural Network. Each Network individually study different pattern and their outputs is finally summed by net function. Sometimes Neural Network don't find global minimum, but find local minimum. To find global minimum we use Genetic Algorithm.

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

In this paper, we developed visual tracking algorithm using double active bar. The active bar model to represent the object can reduce the search space of energy surface and better performance than those of snake model. However, the contour will not find global equilibrium when driving force caused by image may be weak. To overcome this problem. Double active bar is proposed for finding the global minimum point without any dependence on initialization. To achieve the goal, an deformable model with two initial contours in attempted to search for a global minimum within two specific initial contours. This approach improve the performance of finding the contour of target. To evaluate the performance, some experiments are executed. We can achieved the good result for tracking a object on noisy image.

• Journal of the Korean Institute of Telematics and Electronics A
• /
• v.29A no.10
• /
• pp.49-56
• /
• 1992

A new global routing algorithm which dynamically adjusts its cost parameters depending on the given routing poroblem to find a near optimum solution has been developed. The proposed algorithm efficiently performs global routing on general area in which all the pin positions are given. This algorithm is composed of two phases`In the first phase, it routes each net by searching a minimum cost path while ignoring the channel capacity. In the second iterative phase, it rips up nets which pass the channel at which the horizontal or vertical routing density exceeds the capacity and then it reroutes them using a modified set of cost parameters. Applying the above phases, paths for nets are found such that routing density doesn't exceed the capacity in each channel and that nets are routed with minimum cost. Experimental results for several benchmark examples including difficult-4, difficult-8, difficult-16, Primary1 and Primary2 show that our method generates better results than other published ones.

• Transactions of the Korean Society of Mechanical Engineers A
• /
• v.23 no.7 s.166
• /
• pp.1223-1230
• /
• 1999

This paper addresses a novel optimization technique based on molecular dynamics simulation which has been utilized for physical model simulation at various disciplines. In this study, objective functions are considered to be potential functions, which depict molecular interactions. Comparisons of typical optimization method such as the steepest descent and the present method for several test functions are made. The present method shows applicability and stability in finding a global optimum.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.60 no.2
• /
• pp.389-397
• /
• 2011

The global dynamic window approach (DWA) is widely used to generate the shortest path of mobile robots considering obstacles and kinematic constraints. However, the dynamic constraints of robots should be considered to generate the minimum-time path. We propose a modified global DWA considering the dynamic constraints of robots. The reference path is generated using A* algorithm and smoothed by cardinal spline function. The trajectory is then generated to follows the reference path in the minimum time considering the robot dynamics. Finally, the local path is generated using the dynamic window which includes additional terms of speed and orientation. Simulation and experimental results are presented to verify the performance of the proposed method.