• Journal of Animal Science and Technology
• /
• v.55 no.5
• /
• pp.359-365
• /
• 2013

Estimate breeding value can be used as single trait animal model was developed directly using the Fortran language program. The program is based on data computed by using the indirect method repeatedly. The program develops a common algorithm and imprves efficiency. Algorithm efficiency was compared between the two programs. Estimated using the solution is easy to farm and brand the service, pedigree data base was associated with the development of an improved system. The existing program that uses the single trait animal model and the comparative analysis of efficiency is weak because the estimation of the solution and the conventional algorithm programmed through regular formulation involve many repetition; therefore, the newly developed algorithm was conducted to improve speed by reducing the repetition. Single trait animal model was used to analyze Gauss-Seidel iteration method, and the aforesaid two algorithms were compared thorough the mixed model equation which is used the most commonly in estimating the current breeding value by applying the procedures such as the preparation of information necessary for modelling, removal of duplicative data, verifying the parent information of based population in the pedigree data, and assigning sequential numbers, etc. The existing conventional algorithm is the method for reading and recording the data by utilizing the successive repetitive sentences, while new algorithm is the method for directly generating the left hand side for estimation based on effect. Two programs were developed to ensure the accurate evaluation. BLUPF90 and MTDFREML were compared using the estimated solution. In relation to the pearson and spearman correlation, the estimated breeding value correlation coefficients were highest among all traits over 99.5%. Depending on the breeding value of the high correlation in Model I and Model II, accurate evaluation can be found. The number of iteration to convergence was 2,568 in Model I and 1,038 in Model II. The speed of solving was 256.008 seconds in Model I and 235.729 seconds in Model II. Model II had a speed of approximately 10% more than Model I. Therefore, it is considered to be much more effective to analyze large data through the improved algorithm than the existing method. If the corresponding program is systemized and utilized for the consulting of farm and industrial services, it would make contribution to the early selection of individual, shorten the generation, and cultivation of superior groups, and help develop the Hanwoo industry further through the improvement of breeding value based enhancement, ultimately paving the way for the country to evolve into an advanced livestock country.

• Advances in nano research
• /
• v.8 no.3
• /
• pp.255-264
• /
• 2020

Buckling and post-buckling cases are often occurred in aorta artery because it affected by higher pressure. Also, its stability has a vital importance to humans and animals. The loss of stability in arteries may lead to arterial tortuosity and kinking. In this paper, post-buckling analysis of aorta artery is investigated under axial compression loads on the basis of Euler-Bernoulli beam theory by using finite element method. It is known that post-buckling problems are geometrically nonlinear problems. In the geometrically nonlinear model, the Von Karman nonlinear kinematic relationship is employed. Two types of support conditions for the aorta artery are considered. The considered non-linear problem is solved by using incremental displacement-based finite element method in conjunction with Newton-Raphson iteration method. The aorta artery is modeled as a cylindrical tube with different average diameters. In the numerical results, the effects of the geometry parameters of aorta artery on the post-buckling case are investigated in detail. Nonlinear deflections and critical buckling loads are obtained and discussed on the post-buckling case.

• Journal of Broadcast Engineering
• /
• v.16 no.4
• /
• pp.669-679
• /
• 2011

In this paper, we propose a POCS based irregularly sampled image interpolation method exploiting non-local block-based wavelet shrinkage denoising algorithm. The method provides convex sets to improve the performance. The Delaunay triangulation interpolation is first applied to interpolate the missing pixels of the irregularly sampled image into the regular grids. Then, the non-local block-based wavelet shrinkage denoising algorithm is applied, and the originally observed pixels are enforced. After iteration is performed, the denoising algorithm for non-edge areas is applied to acquire the final result. The experimental results show that the proposed method outperforms the conventional methods.

• The Journal of the Acoustical Society of Korea
• /
• v.14 no.3
• /
• pp.90-96
• /
• 1995

A new method for autoregressive parameter estimation from noisy observation sequence is presented. This method, termed the AP method, is a result of an attempt to make use of the adaptive predictor which is a simple and reliable way of parameter estimation. It is shown theoretically that, for noisy input, the parameter vector computed from the prediction sequence is closer to that of the original sequence than the noisy input sequence is, under the spectral distortion criterion. Simulation results with the Kalman filter as a noise reduction filter and real speech data supported the theory. Roughly speaking, the performance of the parameter set obtained by the AP method is better than noisy one but worse than the EM iteration results. When the simplicity is considered, it could provide a useful alternative to more complicated parameter estimation methods in some applications.

• Journal of Internet Computing and Services
• /
• v.6 no.1
• /
• pp.51-64
• /
• 2005

In this paper, we introduce a system for evaluating similarity of C program source code using method which compares syntax-trees each others. This method supposes two characteristic features as against other systems. It is not sensitive for program style such as indentation, white space, and comments, and changing order of control structure like sentences, code block, procedures, and so on. Another is that it can detect a syntax-error cause of using paring technique, We introduce algorithms for similarity evaluation method and grouping method that reduces the number of comparison, In the examination section, we show a test result of program similarity evaluation and its reduced iteration by grouping algorithm.

• Journal of computational fluids engineering
• /
• v.2 no.1
• /
• pp.1-7
• /
• 1997

A FA-FD hybrid method, developed for solving three-dimensional incompressible Navier-Stokes equations, is applied to calculate three-dimensional laminar flows through a square duct with a 90° bend. The method discretizes the convective terms in the primary flow direction with 3rd-order upwind finite-differences and the convective and diffusive terms in the transverse directions with the two-dimensional finite analytic method. The non-staggered grid system is used and the pressure-velocity coupling is achieved by a global iteration procedure based on the PISO algorithm. Detailed comparisons between the computed solutions and the available experimental data are given mainly for the velocity distributions at cross-sections in a 90° bend of a square duct with both fully developed and developing entry flows. Although the computational result shows generally a good agreement with the experimental data, there are some significant discrepancies underlining the necessity of more accurate numerical methods as well as reliable experimental data for their validation.

• Journal of the Computational Structural Engineering Institute of Korea
• /
• v.18 no.4 s.70
• /
• pp.385-393
• /
• 2005

This paper established the dynamic model of a flexible Timoshenko beam capable of geometrical nonlinearities subject to large overall motions by using the finite element method. Equations of motion are derived by using Hamilton principle and are formulated in terms of finite elements in which the nonlinear constraint equations are adjoined to the system using Lagrange multipliers. The Newmark direct integration method and the Newton-Raphson iteration are employed here for the numerical study which is to demonstrate the efficiency of the proposed formulation.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.23 no.9A
• /
• pp.2355-2364
• /
• 1998

In conventional fractal decoding procedure, the reconstructed image is obtained by a rpredefined number of iterations starting with an arbitrary initial image. Its convergence speed depends on the selection of the initial image. It should be solved to get high speed convergence. In this paper, we theoretically reveal that conventional method is approximately decomposed into the decoding of the DC and AC components. Based on this fact, we proposed a novel fast fractal decoding algorithm made up of two steps. The averaged-image considered as an optimal initial image is estimated in the first step. In the second step, the reconstructe dimag eis genrated from the output image obtained in the first step. From the simulations, it is shown that the output image of the first step approximately converges to the averaged-image with only 15% calculations for one iteration of conventional method. And the proposed method is faster than various decoding mehtods and evenly equal to conventioanl decoding with the averaged-image. In addition, the proposed method can be applied to the compressed data resulted from the various encoding methods because it does not impose any constraints in the encoding procedure to get high decoding speed.

• Journal of the Korea Society of Computer and Information
• /
• v.16 no.6
• /
• pp.61-70
• /
• 2011

In this paper, it is realized an image filter for a noise elimination using a recurrent neural networks with fuzzy. The proposed fuzzy neural networks structure is to converge weights and the number of iteration for a certain value by using basically recurrent neural networks structure and is simplified computation and complexity of mathematics by applying the hybrid fuzzy membership function operator. In this paper, the proposed method, the recurrent neural networks applying fuzzy which is collected a certain value, has been proved improving average 0.38dB than the conventional method, the generalied recurrent neural networks, by using PSNR. Also, a result image of the proposed method was similar to the original image than a result image of the conventional method by comparing to visual images.

• Nuclear Engineering and Technology
• /
• v.33 no.1
• /
• pp.25-33
• /
• 2001

To determine the pin power distribution without disassembling, HANARO fuel assemblies are gamma-scanned and then the distribution is reconstructed tv using the tomography method. The iterative least squares method (ILSM and the wavelet singular value decomposition method (WSVD) are chosen to solve the problem. An optimal convergence criterion is used to stop the iteration algorithm to overcome the potential divergence in ILSM. WSVD gives better results than ILSM , and the average values from the two methods give the best results. The RMSE (root mean square errors) to the reference data are 5.1, 6.6, 5.0, 6.5, and 6.4% and the maximum relative errors are 10.2, 13.7, 12.2, 13.6, and 14.3%, respectively. It is found that the effect of random positions of the pins is important. Although the effect can be accommodated by the iterative calculations simulating the random positions, the use of experimental equipment with a slit covering the whole range of the assembly horizontally is recommended to obtain more accurate results. We made a new apparatus using the results of this study and are conducting an experiment in order to obtain more accurate results.