• 한국콘크리트학회:학술대회논문집
• /
• 한국콘크리트학회 1998년도 가을 학술발표논문집(II)
• /
• pp.468-473
• /
• 1998

The objective of this paper is to develop a consistent algorithm for the finite element analysis for behavior of concrete under cyclic loading using viscoplastic-damage model. For modeling the behavior of concrete under cyclic loading, consistent algorithms of rate-dependent viscoplastic-damage are employed with a Willam-Warnke 5-parameter failure criterion which can consider the softening behavior of concrete and consistent tangent moduli are derived. Using finite element program implemented with the developed algorithms, the algorithms are verified and the behaviors of concrete under cylic loading are simulated and compared with experimental data.

• Journal of applied mathematics & informatics
• /
• 제8권1호
• /
• pp.9-26
• /
• 2001

In some previous papers the author extended two algorithms proposed by Z. Kovarik for approximate orthogonalization of a finite set of linearly independent vectors from a Hibert space, to the case when the vectors are rows (not necessary linearly independent) of an arbitrary rectangular matrix. In this paper we describe combinations between these two methods and the classical Kaczmarz’s iteration. We prove that, in the case of a consistent least-squares problem, the new algorithms so obtained converge ti any of its solutions (depending on the initial approximation). The numerical experiments described in the last section of the paper on a problem obtained after the discretization of a first kind integral equation ilustrate the fast convergence of the new algorithms. AMS Mathematics Subject Classification : 65F10, 65F20.

• Communications for Statistical Applications and Methods
• /
• 제26권3호
• /
• pp.273-293
• /
• 2019

We consider the problem of model selection in multiple linear regression with outliers and non-normal error distributions. In this article, the robust model selection criterion is proposed based on the robust estimation method with the least absolute deviation (LAD). The proposed criterion is shown to be consistent. We suggest proposed criterion based algorithms that are suitable for a large number of predictors in the model. These algorithms select only relevant predictor variables with probability one for large sample sizes. An exhaustive simulation study shows that the criterion performs well. However, the proposed criterion is applied to a real data set to examine its applicability. The simulation results show the proficiency of algorithms in the presence of outliers, non-normal distribution, and multicollinearity.

• 한국시뮬레이션학회논문지
• /
• 제3권1호
• /
• pp.89-98
• /
• 1994

In this paper, a criteria for selecting an appropriate load redistribution algorithm is devised so that a fault-tolerance distributed system can operte at its optimal efficience. To present the guideline for selecting redistributing algorithms, simulation models of fault-tolerant system including redistribution algorithms are developed using SLAM II. The job arrival rate, service rate, failure and repair rate of nodes, and communication delay time due to load migration are used as parameters of simulation. The result of simulation shows that the job arrival rate and the failure rate of nodes are not deciding factors in affecting the relative efficiency of algorithms. Algorithm B shows relatively a consistent performance under various environments, although its performance is between those of other algorithms. If the communication delay time is longer than average job processing time, the performance of algorithm B is better than others. If the repair rate is relatively small or communication delay time is longer than service time, algorithm A leads to good performance. But in opposite environments, algorithm C is superior to other algorithms.

• 한국항행학회논문지
• /
• 제8권1호
• /
• pp.26-37
• /
• 2004

차분 위성 항법에 있어서 빈번한 동적 변화를 수반하는 항체에 대하여 편향되지 않은 위치 추정치를 생성하기 위해서는 위상 평활화 코드 필터가 널리 사용되고 있다. 위치추정, 오차해석, 고장진단, 그리고 미지정수 결정 등 보정위성항법시스템의 다양한 응용분야에 있어서 정확한 오차공분산 정보는 중요한 역할을 담당한다. 반면, 기존의 위상 평활화 코드 필터 알고리즘들은 대부분 누적위상 측정오차에 의한 시전달 오차를 무시하므로 실재에 비하여 낙관적인 오차공분산 정보를 생성할 위험성을 내포하고 있다. 위상 평활화 코드 기법의 활용에 있어서 일관성 있고 적절한 오차공분산 정보를 생성하기 위하여 본 논문에서는 Stepwise Optimal Position Projection Filter와 Stepwise Unbiased Position Projection Filter 알고리즘을 제안하였다. 제안된 필터는 기존의 필터에 비하여 누적위상의 특성에 기인하는 시전달 오차의 특성을 정확하고 상세하게 고려하여 주며 잦은 가시위성의 변화도 함께 고려할 수 있는 장점을 가진다. 몬테카를로 시뮬레이션에 의하여 수신기 Kalman 필터, 기존의 위상 평활화 코드 필터, 그리고 제안된 두 필터들의 성능을 비교 분석 하였다.

• Structural Engineering and Mechanics
• /
• 제76권6호
• /
• pp.799-821
• /
• 2020

The optimum design of truss structures is one of the significant categories in structural optimization that has widely been applied by researchers. In the present study, new mathematical programming called Consistent Approximation (CONAP) method is utilized for the simultaneous optimization of the size and shape of truss structures. The CONAP algorithm has already been introduced to optimize some structures and functions. In the CONAP algorithm, some important parameters are designed by employing design sensitivities to enhance the capability of the method and its consistency in various optimum design problems, especially structural optimization. The cross-sectional area of the bar elements and the nodal coordinates of the truss are assumed to be the size and shape design variables, respectively. The displacement, allowable stress and the Euler buckling stress are taken as the design constraints for the problem. In the proposed method, the primary optimization problem is replaced with a sequence of explicit sub-problems. Each sub-problem is efficiently solved using the sequential quadratic programming (SQP) algorithm. Several truss structures are designed by employing the CONAP method to illustrate the efficiency of the algorithm for simultaneous shape and size optimization. The optimal solutions are compared with some of the mathematical programming algorithms, the approximation methods and metaheuristic algorithms those reported in the literature. Results demonstrate that the accuracy of the optimization is improved and the convergence rate speeds up.

• Journal of the Korean Society for Industrial and Applied Mathematics
• /
• 제14권1호
• /
• pp.43-56
• /
• 2010

The representative numerical algorithms to solve the time dependent Navier-Stokes equations are projection type methods. Lots of projection schemes have been developed to find more accurate solutions. But most of projection methods [4, 11] suffer from inconsistency and requesting unknown datum. E and Liu in [5] constructed the gauge method which splits the velocity $u=a+{\nabla}{\phi}$ to make consistent and to replace requesting of the unknown values to known datum of non-physical variables a and ${\phi}$. The errors are evaluated in [9]. But gauge method is not still obvious to find out suitable combination of discrete finite element spaces and to compute boundary derivative of the gauge variable ${\phi}$. In this paper, we define 4 gauge algorithms via combining both 2 decomposition operators and 2 boundary conditions. And we derive variational derivative on boundary and analyze numerical results of 4 gauge algorithms in various discrete spaces combinations to search right discrete space relation.

• 한국정보과학회논문지:소프트웨어및응용
• /
• 제34권6호
• /
• pp.503-518
• /
• 2007

정규화는 교차 연산 전에 두 부모해 사이의 일관성을 유지하기 위하여 한 부모해를 다른 부모해에 맞추어 변환하는 연산이다. 본 논문은 비유사 중복 인코딩이 유전 알고리즘의 성능을 떨어뜨리는 이유와 정규화 연산이 비유사 중복 인코딩에 의해 유발되는 문제점들을 어떻게 완화하는지 설명한다. 이를 위해 완전 비유사 중복 인코딩을 정의하고, 완전 비유사 중복 인코딩에 의해 적합도와 거리의 상관성이 없는 탐색 공간이 만들어짐을 증명한다. 또한, 완전 비유사 중복 인코딩을 사용하는 다수의 문제들에 대한 실험을 바탕으로, 정규화를 통해 상관성이 없는 탐색 공간이 상관성이 있는 탐색 공간으로 변화되어 유전알고리즘의 성능이 향상됨을 보인다.

• 대한원격탐사학회지
• /
• 제21권3호
• /
• pp.173-188
• /
• 2005

The present study aims to derive and compare narrow and broad bandwidths of ocean color sensor’s algorithms for the study of monitoring highly dynamic coastal oceanic environmental parameters using high-resolution imagery acquired from Multi-spectral Camera (MSC) on KOMPSAT-2. These algorithms are derived based on a large data set of remote sensing reflectances ($R_{rs}$) generated by using numerical model that relates $b_b/(a + b_b)$ to $R_{rs}$ as functions of inherent optical properties, such as absorption and backscattering coefficients of six water components including water, phytoplankton (chl), dissolved organic matter (DOM), suspended sediment (SS) concentration, heterotropic organism (he) and an unknown component, possibly represented by bubbles or other particulates unrelated to the first five components. The modeled $R_{rs}$ spectra appear to be consistent with in-situ spectra collected from Korean waters. As Kompsat-2 MSC has similar spectral characteristics with Landsat-5 Thematic Mapper (TM), the model generated $R_{rs}$ values at 2 ㎚ interval are converted to the equivalent remote sensing reflectances at MSC and TM bands. The empirical relationships between the spectral ratios of modeled $R_{rs}$ and chlorophyll concentrations are established in order to derive algorithms for both TM and MSC. Similarly, algorithms are obtained by relating a single band reflectance (band 2) to the suspended sediment concentrations. These algorithms derived by taking into account the narrow and broad spectral bandwidths are compared and assessed. Findings suggest that there was less difference between the broad and narrow band relationships, and the determination coefficient $(r^2)$ for log-transformed data [ N = 500] was interestingly found to be $(r^2)$ = 0.90 for both TM and MSC. Similarly, the determination coefficient for log-transformed data [ N = 500] was 0.93 and 0.92 for TM and MSC respectively. The algorithms presented here are expected to make significant contribution to the enhanced understanding of coastal oceanic environmental parameters using Multi-spectral Camera.

• 대한수학회논문집
• /
• 제25권1호
• /
• pp.149-160
• /
• 2010

Among the distance based algorithms in phylogenetic tree reconstruction, the neighbor-joining algorithm has been a widely used and effective method. We propose a new algorithm which counts the number of consistent quartets for cherry picking with tie breaking. We show that the success rate of the new algorithm is almost equal to that of neighbor-joining. This gives an explanation of the qualitative nature of neighbor-joining and that of dissimilarity maps from DNA sequence data. Moreover, the new algorithm always reconstructs correct trees from quartet consistent dissimilarity maps.