• Journal of the Korean Society of Manufacturing Process Engineers
• /
• v.10 no.5
• /
• pp.117-124
• /
• 2011

Tire's performance plays important roles in improving vehicle's performances. Tire makers carry out a lot of research to improve tire's performance. They are making effort to meet multi purposes using various optimization methods. Recently, the tire makers perform the shape optimization using approximation models, which are surrogate models obtained by statistical method. Generally, the reason why we increase sampling points during optimization process, is to get more reliable approximation models, but the more we adopt sampling points, the more we need time to test. So it is important to select approximation model and proper number of sampling points to balance between reliability and time consuming. In this research, we studied to compare two kind cases for a approximation construction. First, we compare RSM and Kriging which are Curve Fitting Method and Interpolation Method, respectively. Second, we construct approximation models using three different number of sampling points. And then, we recommend proper approximation model and orthogonal array adopt tire's design optimization.

• The Pure and Applied Mathematics
• /
• v.16 no.1
• /
• pp.85-98
• /
• 2009

Strong convergence theorems on viscosity approximation methods for finite nonexpansive mappings are established in Banach spaces. The main theorem generalize the corresponding result of Kim and Xu [10] to the viscosity approximation method for finite nonexpansive mappings in a reflexive Banach space having a uniformly Gateaux differentiable norm. Our results also improve the corresponding results of [7, 8, 19, 20].

• Proceedings of the Computational Structural Engineering Institute Conference
• /
• 2002.10a
• /
• pp.271-278
• /
• 2002

Structural optimization using improved higer-order convex approximation is proposed in this paper. The proposed method is a generalization of the convex approximation method. The order of the approximation function for each constraint is automatically adjusted in the optimization process. And also the order of each design variable is differently adjusted. This self-adjusted capability makes the approximate constraint values conservative enough to maintain the optimum design point of the approximate problem in feasible region. The efficiency of proposed algorithm, compared with conventional algorithm is successfully demonstrated in the Three-bar Truss example.

• ETRI Journal
• /
• v.32 no.4
• /
• pp.630-633
• /
• 2010

In this letter, we propose a novel polygonal approximation of digital curves that preserve original shapes. The proposed method first detects break points, which have two different consecutive vectors, and sets an initial dominant point set. The approximation is then performed iteratively by deleting a dominant point using a novel distance, which can measure both the distance and the angle acuteness. The experimental results show that the proposed method can preserve original shapes and is appropriate for various shapes, including slab-sided shapes.

• Communications of the Korean Mathematical Society
• /
• v.37 no.4
• /
• pp.1259-1267
• /
• 2022

In this paper we present a full circle approximation method using parametric polynomial curves with algebraic coefficients which are curvature continuous at both endpoints. Our method yields the n-th degree parametric polynomial curves which have a total number of 2n contacts with the full circle at both endpoints and the midpoint. The parametric polynomial approximants have algebraic coefficients involving rational numbers and radicals for degree higher than four. We obtain the exact Hausdorff distances between the circle and the approximation curves.

• Journal of the Korean Data and Information Science Society
• /
• v.17 no.3
• /
• pp.687-705
• /
• 2006

In this paper we consider GPH distribution that is defined as a distribution for sum of random number of random variables following exponential distribution. We establish approximation process of general distributions to GPH distributions and offer numerical results for various cases to show the accuracy of the approximation. We also propose analysis method of delay distribution of queueing systems using approximation to GPH distributions and offer numerical results for various queueing systems to show applicability of GPH approximation.

• Journal of Korean Institute of Industrial Engineers
• /
• v.28 no.1
• /
• pp.1-13
• /
• 2002

We study a multi-component production/inventory system in which individual components are made to meet various demand types. We assume that the demands arrive according to a Poisson process, but there is a fixed probability that a demand requests a particular kit of different components. Each component is produced by a flow line with several stations. The production of each component is operated by the CONWIP control mechanism. To analyse this system, we propose an approximation method based on aggregation method. In application of the aggregation method, a product-form approximation technique as well as a matrix-geometric method is used. Comparisons with simulation show that the approximation method provides fairly good results.

• Interaction and multiscale mechanics
• /
• v.2 no.3
• /
• pp.295-319
• /
• 2009

In this work, we discuss a reproducing kernel collocation method (RKCM) for solving $2^{nd}$ order PDE based on strong formulation, where the reproducing kernel shape functions with compact support are used as approximation functions. The method based on strong form collocation avoids the domain integration, and leads to well-conditioned discrete system of equations. We investigate the convergence and the computational complexity for this proposed method. An important result obtained from the analysis is that the degree of basis in the reproducing kernel approximation has to be greater than one for the method to converge. Some numerical experiments are provided to validate the error analysis. The complexity of RKCM is also analyzed, and the complexity comparison with the weak formulation using reproducing kernel approximation is presented.

• Journal of applied mathematics & informatics
• /
• v.32 no.3_4
• /
• pp.539-546
• /
• 2014

This paper introduces the approximation and a proposed method to deal the optimum location network selection problem such that the total cost is minimized. For the proposed method, we derived a feasible solution and the variance. To compare the performances of the approximation and the proposed method, computer simulation is also implemented. The result showed the solutions being optimum with 74% for the proposed method and 57% for the approximation. When the solutions is not optimum, maximum and average deviations are below 4% and 2% respectively. The results indicate a slightly better performance of the proposed method in a certain case.

• 제어로봇시스템학회:학술대회논문집
• /
• 1991.10a
• /
• pp.208-212
• /
• 1991

LQG/LTR method cannot applied to nonminimum phase plant. In this paper, we present a new approximation method which guaratee the approximation error equal to zero and exact loop transfer recovery. Zero structure of plant and approximated plant are considered in approximation procedure. It is shown that the properties of plant and approximated plant at pole and zero frequency response are exactly same. It is shown by example that the suggested method can avoide the NMP plant constraint arised in designing LQG/LTR.