• Nonlinear Functional Analysis and Applications
• /
• v.28 no.3
• /
• pp.671-684
• /
• 2023

In this paper, we prove the generalized Hyers-Ulam stability of a general quintic functional equation, $\sum\limits_{k=0}^{6}(-1)^k{_6}C_kf(x+(3-k)y)=0$, by using the fixed point method.

• Fashion & Textile Research Journal
• /
• v.13 no.5
• /
• pp.661-671
• /
• 2011

This study was designed to produce rounded belt pattern and tight-skirt pattern drafting method using 3D body scan data. Subjects were thirty women in their early twenties. In order to figure out the optimum cutting points, namely, where darts are made, using CAD program, curve ratio inflection points on the horizontal curve of waist, abdomen, and hip to find 1 point in the front, two points in the back part. The average length from center front point to maximum curve ratio was 7.7 cm(46.3%) on the waist curve; 7.9 cm(39.4%) on the abdomen curve. And the average length from center back point to maximum curve ratio point was 6.9 cm(39.0%) for first dart and 11.2 cm(63.3%) for second dart on the waist curve; 8.9 cm(35.8%) for first dart and 15.7 cm(63.3%) for second dart on the hip curve respectively. The cutting lines from were made up by connecting curve inflection points. After divided using cutting lines, each patch was flattened onto the plane and all the technical design factors related with patternmaking were measured, such as dart amount, lifting amount of side waist point, etc. Based on the results of correlation analysis among these factors, regression analysis was done to produce equations to estimate the variables necessary to draw up pattern draft method; F1=F8+1.1, $F4=2.5{\times}F2+0.9$, $F5=0.9{\times}F4+1.0$, $F6=0.3{\times}F4+0.4$, $B1=0.9{\times}B8+2.3$, $B4=2.1{\times}B2+1.3$, $B5=0.9{\times}B4+3.5$, and $B6=0.3{\times}B4+0.4$.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.48 no.1
• /
• pp.122-131
• /
• 2011

A widely used single image-based 3D face reconstruction method, 3D morphable shape model, reconstructs an accurate 3D facial shape when 2D facial feature points are correctly extracted from an input face image. However, in the case that a user's cooperation is not available such as a real-time 3D face reconstruction system, this method can be vulnerable to the errors of automatic facial feature point extraction. In order to solve this problem, we automatically classify extracted facial feature points into two groups, erroneous and correct ones, and then reconstruct a 3D facial shape by using only the correctly extracted facial feature points. The experimental results showed that the 3D reconstruction performance of the proposed method was remarkably improved compared to that of the previous method which does not consider the errors of automatic facial feature point extraction.

• International Journal of CAD/CAM
• /
• v.8 no.1
• /
• pp.45-53
• /
• 2009

As the point sampling technology evolves rapidly, there has been increasing need in generating tool path from dense point set without creating intermediate models such as triangular meshes or surfaces. In this paper, we present a new tool path generation method from point set using Euclidean distance fields based on Algebraic Point Set Surfaces (APSS). Once an Euclidean distance field from the target shape is obtained, it is fairly easy to generate tool paths. In order to compute the distance from a point in the 3D space to the point set, we locally fit an algebraic sphere using moving least square method (MLS) for accurate and simple calculation. This process is repeated until it converges. The main advantages of our approach are : (1) tool paths are computed directly from point set without making triangular mesh or surfaces and their offsets, and (2) we do not have to worry about no local interference at concave region compared to the other methods using triangular mesh or surface model. Experimental results show that our approach can generate accurate enough tool paths from a point set in a robust manner and efficiently.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.26 no.11
• /
• pp.1660-1665
• /
• 2022

Recently, many industries are using three dimensional scanning technology. As the performance of the 3D scanner gradually improves, a sampling step to reduce a point data or a remove step to remove a part determined to be noise are generally performed in post processing. However, total point data by long time scanning cannot be processed at once in spite of performing such those additional processes. In general, a method using a multi threaded environment is widely used, but as the scanning process work time increases, the processing performance gradually decreases due to various environmental conditions and accumulated operations. This paper proposes a method to initially remove point data judged to be unnecessary by calculating accumulated fast point feature histogram values from coming point data of the 3D scanner in real time. The entire 3D scanning process can be reduced using this approach.

• The Transactions of the Korean Institute of Electrical Engineers B
• /
• v.54 no.5
• /
• pp.231-237
• /
• 2005

Many conventional multi-level inverters have detected switching faults by using the over voltage and current. However, fault detection of the switching elements is very difficult because the voltage and current due to each switching fault decrease more than the normal operation. Moreover, the dc-link unbalancing voltage causes a serious problem in the safety and reliability of system when the 3-level inverter faults occur Therefore, this paper proposes the simple fault diagnose method and the neutral-point-voltage control method that can protect the 3-level inverter system from the unbalancing voltage of the do-link capacitors when the faults of switching elements occur in the 3-level inverter that is very efficient in ac motor drives of the high voltage and high power applications. Through experiment results, the validity of the proposed method is demonstrated.

• Journal of the Korean Chemical Society
• /
• v.22 no.3
• /
• pp.128-132
• /
• 1978

The potentiometric end-point of redox titrations determined by nulling the second derivative of the titration curve by numerical differentiation method is analyzed by using an electronic digital computer. The error involved in the method is shown to be dependent on the location of the equivalence point in the titrant addition increment that encompasses the latter. The error increases as the equivalence point moves away from the mid-point of the increment toward a maximum value that is as great as a half of the increment. Therefore, when the numerical differentiation method is used to null the second derivative, the end-point should be compared with the steepest point of the titration curve or diluted titrant should be used in the vicinity of the end-point.

• Korean Management Science Review
• /
• v.11 no.3
• /
• pp.1-11
• /
• 1994

Recent advances in linear programming solution methodology have focused on interior point methods. This powerful new class of methods achieves significant reductions in computer time for large linear programs and solves problems significantly larger than previously possible. These methods can be examined from points of Fiacco and McCormick's barrier method, Lagrangian duality, Newton's method, and others. This study presents a primal-dual log barrier algorithm of interior point methods for linear programming. The primal-dual log barrier method is currently the most efficient and successful variant of interior point methods. This paper also addresses a Cholesky factorization method of symmetric positive definite matrices arising in interior point methods. A special structure of the matrices, called supernode, is exploited to use computational techniques such as direct addressing and loop-unrolling. Two dense matrix handling techniques are also presented to handle dense columns of the original matrix A. The two techniques may minimize storage requirement for factor matrix L and a smaller number of arithmetic operations in the matrix L computation.

• Journal of applied mathematics & informatics
• /
• v.27 no.3_4
• /
• pp.567-579
• /
• 2009

Recently, Peng et al. proposed a primal-dual interior-point method with new search direction and self-regular proximity for LP. This new large-update method has the currently best theoretical performance with polynomial complexity of O($n^{\frac{q+1}{2q}}\;{\log}\;{\frac{n}{\varepsilon}}$). In this paper we use this search direction to propose a primal-dual interior-point method for convex quadratic programming (QP). We overcome the difficulty in analyzing the complexity of the primal-dual interior-point methods for convex quadratic programming, and obtain the same polynomial complexity of O($n^{\frac{q+1}{2q}}\;{\log}\;{\frac{n}{\varepsilon}}$) for convex quadratic programming.

• Journal of Korean Institute of Industrial Engineers
• /
• v.19 no.4
• /
• pp.3-11
• /
• 1993

We propose a new dual simplex method using a primal interior point. The dropping variable is chosen by utilizing the primal feasible interior point. For a given dual feasible basis, its corresponding primal infeasible basic vector and the interior point are used for obtaining a decreasing primal feasible point The computation time of moving on interior point in our method takes much less than that od Karmarker-type interior methods. Since any polynomial time interior methods can be applied to our method we conjectured that a slight modification of our method can give a polynomial time complexity.