• Structural Engineering and Mechanics
• /
• v.65 no.4
• /
• pp.415-422
• /
• 2018

The Conjugate Finite-Step Length" (CFSL) algorithm is proposed to improve the efficiency and robustness of first order reliability method (FORM) for reliability analysis of highly nonlinear problems. The conjugate FORM-based CFSL is formulated using the adaptive conjugate search direction based on the finite-step size with simple adjusting condition, gradient vector of performance function and previous iterative results including the conjugate gradient vector and converged point. The efficiency and robustness of the CFSL algorithm are compared through several nonlinear mathematical and structural/mechanical examples with the HL-RF and "Finite-Step-Length" (FSL) algorithms. Numerical results illustrated that the CFSL algorithm performs better than the HL-RF for both robust and efficient results while the CFLS is as robust as the FSL for structural reliability analysis but is more efficient.

• Journal of applied mathematics & informatics
• /
• v.7 no.3
• /
• pp.739-763
• /
• 2000

We are concerned with mathematical analysis related to the bi-pointwise control for a mixed type of wave equation. In particular, we are interested in the systematic build-up of the bi-pointwise control actuators;one at the boundary and the other at the interior point simultaneously. The main purpose is to examine Hilbert Uniqueness Method for the setting of bi-pointwise control actuators and to establish relevant algorithm based on our analysis. After discussing the weak solution for the state equation, we investigate bi-pointwise control mechanism and relevant mathematical analysis based on HUM. We then proceed to set up an algorithm based on the conjugate gradient method to establish bi-pointwise control actuators to halt the system.

• Journal of Biomedical Engineering Research
• /
• v.6 no.2
• /
• pp.53-62
• /
• 1985

The position and time interval of wave components of the electrocardiogram are used as important data for physician's diagnosis. In case of using the existing definition of the onset of the wave component of the electrocardiogram, they have some problems of defining the precise position of the isoelectric line, of defining the limit of the gradient accepted as the onset, and of the gradient being changed by noise. Therefore, in this paper all time intervals and positions of wave components needed for data of diagnosis were obtained correctly by turning point data reduction algorithm and linear regression intersection algorithm, and the viability of the method of intersecting lines was established in comparison to the four methods of calculating the PR interval.

• Advances in robotics research
• /
• v.2 no.1
• /
• pp.1-11
• /
• 2018

To monitor the environment and determine the source of a pollutant gradient using a multiple robot swarm, we propose a hybrid algorithm that combines two bio-inspired algorithms mimicking chemotaxis and pheromones of bacteria. The algorithm is implemented in virtual robot agents in a simulator to evaluate their feasibility and efficiency in gradient maps with different sizes. Simulation results show that the chemotaxis controller guided robot agents to the locations with higher pollutant concentrations, while the pheromone marked in a virtual field increased the efficiency of the search by reducing the visiting redundancy. The number of steps required to reach the target point did not increase proportionally as the map size increased, but were less than those in the linear whole-map search method. Furthermore, the robot agents could function with simple sensor composition, minimum information about the map, and low calculation capacity.

• Journal of Korean Institute of Industrial Engineers
• /
• v.21 no.4
• /
• pp.541-553
• /
• 1995

An efficient algorithm is proposed for a buffer allocation in a continuous flow line. The problem is formulated as a non-linear programming with linear constraints. The concept of pseudo gradient and gradient projection is employed in developing the algorithm. Numerical experiments show that the algorithm gives the actual optimal solutions to the problems with single linear constraint limiting the total buffer capacity. Also, even in longer production lines, it gives quite good solutions to the problems with the general linear resource constraints within a few seconds.

• 제어로봇시스템학회:학술대회논문집
• /
• 2001.10a
• /
• pp.107.6-107
• /
• 2001

Genetic alogorithm(GA) is a well-known global optimization algorithm. However, as the searching bounds grow wider., performance of local optimization deteriorates. In this paper, we propose a hybrid algorithm which integrates the gradient algorithm and GA so as to reinforce the performance of local optimization. We apply this algorithm to the system identification of second order RLC circuit. Identification results show that the proposed algorithm gets the better and robust performance to find the exact values of RLC elements.

• Journal of the Chungcheong Mathematical Society
• /
• v.37 no.1
• /
• pp.41-55
• /
• 2024

The nonconvex and nonsmooth optimization problem has been widely applicable in image processing and machine learning. In this paper, we propose an extension of the proximal iteratively reweighted ℓ₁ algorithm for nonconvex and nonsmooth minmization problem. We assume the co-coerciveness of a term of objective function instead of Lipschitz gradient condition, which is generalized property of Lipschitz continuity. We prove the global convergence of the proposed algorithm. Numerical results show that the proposed algorithm converges faster than original proximal iteratively reweighed algorithm and existing algorithms.

• Journal of Korea Multimedia Society
• /
• v.4 no.3
• /
• pp.230-237
• /
• 2001

Adaptive filters are widely used for acoustic echo canceler, adaptive equalizer and adaptive noise canceler. Coefficients of adaptive filters are updated by NLMS algorithm. However, Coefficients are misaligned by ambient noises when they are adapted by NLMS algorithm. In this Paper, a method determined the adaptation constant by low-pass filtered instantaneous gradient vector of LMS algorithm using orthognality principles of optimal filter is proposed. At initial states, instantaneous gradient vector, that is the cross-correlation of input signals and estimation error signals, has large value because input signals are remained in estimation error signals. When an adaptive filter is conversed, the cross-correlation will be close to zero. It isn's affected by ambient noises because ambient noises are uncorrelated with input signals. Determining adaptation constant with the cross-correlation, adaptive filters can be robust to ambient noises and the convergence rate doesn't slower As results of computer simulations, it is shown that the performance of proposed algorithm is betted than that of conventional algorithms.

• Journal of Korea Water Resources Association
• /
• v.32 no.4
• /
• pp.489-499
• /
• 1999

This research investigated the applicapability of an improved algorithm to calculate the topographic index, ln($\alpha$/tan B), for the topography of Korea employing channel initiation threshold area(CIT) and an exponent for the gradient(H). hanjaechun subwatershed in Cheongdochun and Dongok subwatershed in Wichun test watershed were selected as study areas. The digital elevation models(DEM) of study areas have been made with the resolution from 10m to 100m. Application of CIT to the traditional algorithm provide reasonable computation method in considering channel pixel impact. Introduction of the gradient exponent(H) made it possible to obtain better flow convergence effect in concave topography comparing with the traditional multiple flow direction algorithm. The improved algorithm shows the capability to relax the overestimation problem of rising limb of hydrograph through reducing overestimated high value of topographic index.

• Journal of the Korean earth science society
• /
• v.38 no.4
• /
• pp.263-268
• /
• 2017

The determination algorithm of the location of a line source with strike and dip using the gravity gradient tensor on a single profile is proposed. We already proposed the determination of strike and dip in the previous paper and then, now we improved the algorithm to locate a line source after determining strike and dip. The strike and dip of the line source can be determined by rotating the gravity gradient tensor matrix as reducing 2 independent components. Using the ratio of remaining 2 components, the location can be determined by the least square manner of the pointing vectors on each observation point. A synthetic model is tested for proving the usefulness of the proposed algorithm.