• Proceedings of the Korea Concrete Institute Conference
• /
• 1998.10a
• /
• 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
• /
• v.8 no.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
• /
• v.26 no.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.

• Journal of the Korea Society for Simulation
• /
• v.3 no.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.

• Journal of Advanced Navigation Technology
• /
• v.8 no.1
• /
• pp.26-37
• /
• 2004

Consistent and realistic error covariance information is important for position estimation, error analysis, fault detection, and integer ambiguity resolution for differential GNSS. In designing a position domain carrier-smoothed-code filter where incremental carrier phases are used for time-propagation, formulation of consistent error covariance information is not easy due to being bounded and temporal correlation of propagation noises. To provide consistent and correct error covariance information, this paper proposes two recursive filter algorithms based on carrier-smoothed-code techniques: (a) the stepwise optimal position projection filter and (b) the stepwise unbiased position projection filter. A Monte-Carlo simulation result shows that the proposed filter algorithms actually generate consistent error covariance information and the neglection of carrier phase noise induces optimistic error covariance information. It is also shown that the stepwise unbiased position projection filter is attractive since its performance is good and its computational burden is moderate.

• Structural Engineering and Mechanics
• /
• v.76 no.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
• /
• v.14 no.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.

• Journal of KIISE:Software and Applications
• /
• v.34 no.6
• /
• pp.503-518
• /
• 2007

Normalization transforms one parent genotype to be consistent with the other before crossover. In this paper, we explain how normalization alleviates the difficulties caused by non-synonymously redundant encodings in genetic algorithms. We define the encodings with maximally non-synonymous property and prove that the encodings induce uncorrelated search spaces. Extensive experiments for a number of problems show that normalization transforms the uncorrelated search spaces to correlated ones and leads to significant improvement in performance.

• Korean Journal of Remote Sensing
• /
• v.21 no.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.

• Communications of the Korean Mathematical Society
• /
• v.25 no.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.