• Economic and Environmental Geology
• /
• v.28 no.4
• /
• pp.425-431
• /
• 1995

Genetic algorithms are so named because they are analogous to biological processes. The model parameters are coded in binary form. The algorithm then starts with a randomly chosen population of models called chromosomes. The second step is to evaluate the fitness values of these models, measured by a correlation between data and synthetic for a particular model. Then, the three genetic processes of selection, crossover, and mutation are performed upon the model in sequence. Genetic algorithms share the favorable characteristics of random Monte Carlo over local optimization methods in that they do not require linearizing assumptions nor the calculation of partial derivatives, are independent of the misfit criterion, and avoid numerical instabilities associated with matrix inversion. An additional advantage over converntional methods such as iterative least squares is that the sampling is global, rather than local, thereby reducing the tendency to become entrapped in local minima and avoiding the dependency on an assumed starting model.

• Proceedings of the KIEE Conference
• /
• 2006.04a
• /
• pp.252-254
• /
• 2006

The recent improvement in the performance of digital processor, the application of control technology, which used in the HVDC(High Voltage Direct Current) system with the digital processors, has increased. Having this research development as the basis, this paper presents an achievement of progression by tuning the parameter of PI controller based on Genetic Algorithms(GAs) and by controlling with PI controller with a developed simulator by applying the Matrix operating function, voltage source switching element, modified nodal analysis which can include transformer and the backward Euler which does not create the problem of numerical oscillation. As a result, I expect this development in the simulator HVDC System to bring more application in the field of control technology research with an expanded practicality.

• Journal of applied mathematics & informatics
• /
• v.29 no.3_4
• /
• pp.697-712
• /
• 2011

We present in this paper two versions of a general correction procedure applied to a classical linear iterative method. This gives us the possibility, under certain assumptions, to obtain an extension of it to inconsistent linear least-squares problems. We prove that some well known extended projection type algorithms from image reconstruction in computerized tomography fit into one or the other of these general versions and are derived as particular cases of them. We also present some numerical experiments on two phantoms widely used in image reconstruction literature. The experiments show the importance of these extension procedures, reflected in the quality of reconstructed images.

• Management Science and Financial Engineering
• /
• v.16 no.1
• /
• pp.59-79
• /
• 2010

This paper considers bandwidth allocation and scheduling problems on Ethernet Passive Optical Networks (EPON). EPON is one of the good candidates for the optical access network. This paper formulates the bandwidth allocation problem as a nonlinear mathematical one and characterizes the optimal bandwidth allocation which maximizes weighted sum of throughput and fairness. Based upon the characterization, two heuristic algorithms are suggested with various numerical tests. The test results show that our algorithms can be used for efficient bandwidth allocation on the EPON. This paper also shows that the WSPT (Weighted Shortest Processing Time) rule is optimal for minimization the total delay time in transmitting the traffic of the given allocated bandwidth.

• Proceedings of the KIEE Conference
• /
• 1988.07a
• /
• pp.687-690
• /
• 1988

Algorithms that represent given pattern in the form of an ARG (Attributed relational graph) using not only structural relations but also symbolic or numerical attributes, and then recognize that pattern by graph matching process are presented in this paper. Based on definitions of pattern deformational models, algorithms that can find GPECI(Graph preserved error correcting isomorphism). SGECI(subgraph ECI) and DSECI(Double subgraph ECI) are proposed and comparisons among these algorithms are described. To be useful in performig practical tasks, efficient schemes for extraction of ARG representation fron raw image are needed. In this study, given patterns are restricted within objects having distinct skeleton, and then the information which is necessary for recognition and analysis is successfully extracted.

• Proceedings of the KIEE Conference
• /
• 2000.07d
• /
• pp.3007-3009
• /
• 2000

In this paper, we design a Multi-Fuzzy model by means of clustering method and genetic algorithms for a nonlinear system. In order to determine structure of the proposed Multi-Fuzzy model. HCM clustering method is used. The parameters of membership function of the Multi-Fuzzy are identified by genetic algorithms. We use simplified inference and linear inference as inference method of the proposed Multi-Fuzzy model and the standard least square method for estimating consequence parameters of the Multi-Fuzzy. Finally, we use some of numerical data to evaluate the proposed Multi-Fuzzy model and discuss about the usefulness.

• Structural Engineering and Mechanics
• /
• v.52 no.3
• /
• pp.445-468
• /
• 2014

In this paper a new particle swarm ray optimization algorithm is proposed for truss shape and size optimization with natural frequency constraints. These problems are believed to represent nonlinear and non-convex search spaces with several local optima and therefore are suitable for examining the capabilities of new algorithms. The proposed algorithm can be viewed as a hybridization of Particle Swarm Optimization (PSO) and the recently proposed Ray Optimization (RO) algorithms. In fact the exploration capabilities of the PSO are tried to be promoted using some concepts of the RO. Five numerical examples are examined in order to inspect the viability of the proposed algorithm. The results are compared with those of the PSO and some other existing algorithms. It is shown that the proposed algorithm obtains lighter structures in comparison to other methods most of the time. As will be discussed, the algorithm's performance can be attributed to its appropriate exploration/exploitation balance.

• Journal of Communications and Networks
• /
• v.6 no.2
• /
• pp.112-122
• /
• 2004

A nonlinear spectral-line method utilizing the fourth absolute moment of the receiver discrete Fourier transform output is proposed as a non-data-aided fine carrier frequency synchronization algorithm for OFDM receivers. A simple modification of the algorithm resulting in low implementation complexity is also developed. Analytic expressions are derived for the steady-state frequency error variances of the algorithms and verified to be very accurate via computer simulations over AWGN and frequency selective multipath channels. Numerical results show that the proposed algorithms provide reliable and excellent steady-state performance, especially with PSK modulation. Also, the proposed algorithms are insensitive to symbol timing offsets, only requiring a coarse symbol timing recovery.

• Proceedings of the KIEE Conference
• /
• 1996.11a
• /
• pp.172-174
• /
• 1996

This paper presents a new approach on genetic algorithms to economic dispatch problem for valve point discontinuities. Although it has been already shown that genetic algorithm was more powerful to economic dispatch problem for valve point discontinuities than other optimization algorithms, proposed approach in this paper on genetic algorithms improves the performance to solve economic dispatch problem for valve point discontinuities through combination in penalty function with death penalty, generation-apart elitism and heuristic crossover. Numerical results on an actural utility system consisted of 13 thermal units show that the proposed approach is faster and robuster than the classical genetic algorithm.

• Journal of the Korean Society for Industrial and Applied Mathematics
• /
• v.22 no.1
• /
• pp.75-89
• /
• 2018

This paper presents the numerical valuation of the arithmetic Asian option by using the operator-splitting method (OSM). Since there is no closed-form solution for the arithmetic Asian option, finding a good numerical algorithm to value the arithmetic Asian option is important. In this paper, we focus on a two-dimensional PDE. The OSM is famous for dealing with plural-dimensional PDE using finite difference discretization. We provide a detailed numerical algorithm and compare results with MCS method to show the performance of the method.