• Journal of IKEEE
• /
• v.17 no.3
• /
• pp.339-345
• /
• 2013

In this paper, the probabilistic exclusion based orthogonal matching pursuit (PEOMP) algorithm for the sparse signal reconstruction is proposed. Some of recent greedy algorithms such as CoSaMP, gOMP, BAOMP improved the reconstruction performance by deleting unsuitable atoms at each iteration. They still often fail to converge to the solution because the support set could not escape from a local minimum. PEOMP helps to escape by excluding a random atom in the support set according to a well-chosen probability function. Experimental results show that PEOMP outperforms several OMP based algorithms and the $l_1$ optimization method in terms of exact reconstruction probability.

• Journal of Korea Multimedia Society
• /
• v.7 no.11
• /
• pp.1531-1539
• /
• 2004

In this paper, we propose an efficient method for locating human lips. Based on Point Distribution Model and Principle Component Analysis, a lip shape model is built. Lip boundary model is represented based on the concatenated gray level distribution model. We calculate the distribution of shape parameters using Gaussian mixture. The problem to locate lip is simplified as the minimization problem of matching object function. The Down Hill Simplex Algorithm is used for the minimization with Gaussian Mixture for setting initial condition and refining estimate of lip shape parameter, which can refrain iteration from converging to local minima. The experiments have been performed for many images, and show very encouraging result.

• Transactions of the Korean Society of Mechanical Engineers B
• /
• v.21 no.12
• /
• pp.1624-1634
• /
• 1997

A numerical study on two-dimensional unsteady transonic cascade flow has been performed by adopting dual time stepping and the k-.omega. turbulence model. An explicit 4 stage Runge-Kutta scheme for the compressible Navier-Stokes equations and an implicit Gauss-Seidel iteration scheme for the k-.omega. turbulence model are proposed for fictitious time stepping. This mixed time stepping scheme ensures the stability of numerical computation and exhibits a good convergence property with less computation time. Typical steady-state convergence accelerating schemes such as local time stepping, residual smoothing and multigrid combined with dual time stepping shows good convergence properties. Numerical results are presented for unsteady laminar flow past a cylinder and turbulent shock buffeting problem for bicircular arc cascade flow is discussed.

• Journal of the Korean Society of Combustion
• /
• v.8 no.3
• /
• pp.15-23
• /
• 2003

Partial quenching structure of turbulent diffusion flames in a turbulent mixing layer is investigated by the method of flame hole dynamics in order to develop a prediction model for turbulent flame lift off. The essence of flame hole dynamics is derivation of the random walk mapping, from the flame-edge theory, which governs expansion or contraction of flame holes initially created by local quenching events. The numerical simulation for flame hole dynamics is carried out in two stages. First, a direct numerical simulation is performed for constant-density fuel-air channel mixing layer to obtain the turbulent flow and mixing fields, from which a time series of two dimensional scalar dissipation rate array is extracted at a fixed virtual flame surface horizontally extending from the end of split plate to the downstream. Then, the Lagrangian simulation of the flame hole random walk mapping projected to the scalar dissipation rate array yields temporally evolving turbulent extinction process and its statistics on partial quenching characteristics. The statistical results exhibit that the chance of partial quenching is strongly influenced by the crossover scalar dissipation rate while almost unaffected by the iteration number of the mapping that can be regarded as a flame-edge speed.

• Journal of Navigation and Port Research
• /
• v.33 no.9
• /
• pp.635-644
• /
• 2009

The optimum design of power yacht belongs to the nonlinear constrained optimization problems. The determination of scantlings for the bow structure is a very important issue with in the whole structural design process. The derived design results are obtained by the use of real-coded micro-genetic algorithm including evaluation from Lloyd's Register small craft guideline, so that the nominal limiting stress requirement can be satisfied. In this study, the minimum volume design of bow structure on the power yacht was carried out based on the finite element analysis. The target model for optimum design and local structural analysis is the bow structure of a power yacht. The volume of bow structure and the main dimensions of structural members are chosen as an objective function and design variable, respectively. During optimization procedure, finite element analysis was performed to determine the constraint parameters at each iteration step of the optimization loop. optimization results were compared with a pre-existing design and it was possible to reduce approximately 19 percents of the total steel volume of bow structure from the previous design for the power yacht.

• The Transactions of the Korean Institute of Electrical Engineers A
• /
• v.48 no.3
• /
• pp.234-240
• /
• 1999

This paper presents a new approach for large-scale generator maintenance scheduling optimizations. The generator preventive maintenance scheduling problems are typical discrete dynamic n-dimensional vector optimization ones with several inequality constraints. The considered objective function to be minimized a subset of{{{{ { R}^{n } }}}} space is the variance (i.g., second-order momentum) of operating reserve margin to levelize risk or reliability during a year. By its nature of the objective function, the optimal solution can only be obtained by enumerating all combinatorial states of each variable, a task which leads to computational explosion in real-world maintenance scheduling problems. This paper proposes a new priority search mechanism based on each generator's discrete sensitivity value which was analytically developed in this study. Unlike the conventional capacity-based priority search, it can prevent the local optimal trap to some extents since it changes dynamically the search tree in each iteration. The proposed method have been applied to two test systems (i.g., one is a sample system with 10 generators and the other is a real-world lage scale power system with 280 generators), and the results anre compared with those of the conventional capacith-based search method and combinatorial optimization method to show the efficiency and effectiveness of the algorithm.

• Proceedings of the KIEE Conference
• /
• summer
• /
• pp.36-38
• /
• 2004

This paper presents an application of parallel hybrid Genetic Algorithm-Tabu Search (GA-TS) algorithm to search an optimal solution of a recokiguration in distribution system. In parallel hybrid CA-TS, after CA operations, stings which are not emerged in the past population are selected in the reproduction procedure. After reproduction operation, if there are many strings which are in the past population, we add new random strings into the population, if there's no improvement for the predetermined iteration, local search procedure is executed by TS for the strings with high fitness function value. To show the usefulness of the proposed method, developed algorithm has been tested and compared on a distribution system in the reference paper.

• Proceedings of the KIEE Conference
• /
• summer
• /
• pp.446-448
• /
• 2004

This paper presents an application of parallel hybrid Genetic Algorithm-Tabu Search (GA-TS) algorithm to search an optimal solution of a service restoration in distribution system. In parallel hybrid GA-TS, after GA operations, strings which are not emerged in the past population are selected in the reproduction procedure. After reproduction operation, if there are many strings which are in the past population, we add new random strings into the population. If there's no improvement for the predetermined iteration, local search procedure is executed by f for the strings with high fitness function value. To show the usefulness of the proposed method, developed algorithm has been tested and compared on a practical distribution system in Korea.

• Journal of the Earthquake Engineering Society of Korea
• /
• v.26 no.6
• /
• pp.227-235
• /
• 2022

For a member model in nonlinear structural analysis, a lumped plastic model that idealizes its flexural bending, shear, and axial behaviors by springs with the nonlinear hysteretic model is widely adopted because of its simplicity and transparency compared to the other rigorous finite element methods. On the other hand, a challenging task in its numerical solution is to satisfy the equilibrium condition between nonlinear flexural bending and shear springs connected in series. Since the local forces between flexural and shear springs are not balanced when one or both springs experience stiffness changes (e.g., cracking, yielding, and unloading), the additional unbalanced force due to overshooting or undershooting each spring force is also generated. This paper introduces an iterative scheme for numerical solutions satisfying the equilibrium conditions between flexural bending and shear springs. The effect of equilibrium iteration on analysis results is shown by comparing the results obtained from the proposed method to those from the conventional scheme, where the equilibrium condition is not perfectly satisfied.

• Advances in Computational Design
• /
• v.9 no.2
• /
• pp.115-136
• /
• 2024

Stochastic optimization methods have been extensively studied for structural optimization in recent decades. In this study, a novel algorithm named the CA-SA method, is proposed for topology optimization of steel double-layer grid structures. The CA-SA method is a hybridized algorithm combining the Simulated Annealing (SA) algorithm and the Cellular Automata (CA) method. In the CA-SA method, during the initial iterations of the SA algorithm, some of the preliminary designs obtained by SA are placed in the cells of the CA. In each successive iteration, a cell is randomly chosen from the CA. Then, the "local leader" (LL) is determined by selecting the best design from the chosen cell and its neighboring ones. This LL then serves as the leader for modifying the SA algorithm. To evaluate the performance of the proposed CA-SA algorithm, two square-on-square steel double-layer grid structures are considered, with discrete cross-sectional areas. These numerical examples demonstrate the superiority of the CA-SA method over SA, and other meta-heuristic algorithms reported in the literature in the topology optimization of large-scale skeletal structures.