• 대한전기학회:학술대회논문집
• /
• 대한전기학회 2001년도 추계학술대회 논문집 전기기기 및 에너지변환시스템부문
• /
• pp.74-77
• /
• 2001

The saturated winding inductances of a transformer are determined using the instantaneous magnetic saturation curve. The instantaneous curve is obtained from no load saturation curve in rms form by a direct piecewise linearized approach, then it is represented by a four-term ploynominal approximation. The saturated differential, effective and apparent winding inductances are computed from this curve, and these inductances are compared with the measured magnetizing inductance. The results show that the relation of $L_d<L_e<L_a$ exists and the computed apparent inductance is more close to the measured inductance.

• 한국수학교육학회지시리즈E:수학교육논문집
• /
• 제23권3호
• /
• pp.625-642
• /
• 2009

우리나라 학교수학에서는 접선에 대한 개념을 학년별로 다양하게 제시하고 있다. 학년이 올라감에 따라 이전 학년에서 학습했던 개념을 점차 수정하면서 최종적으로는 할선의 극한으로서의 접선의 개념에 도달한다. 이 연구에서는 선형 사로서의 접선 개념을 도입하고 이에 대한 수학 교육학적 의미에 대하여 고찰한다. 이 개념이 비선형 문제의 국소적 측면을 다룰 때 이를 선형화 시켜서 바라보는 현대 수학의 중요한 관점을 내포하고 있음을 살펴본다. 이 개념의 교수학적 변환으로서 접선을 이용하여 제곱근의 값을 근사적으로 구하는 방법을 알아보고, 이를 통하여 접선 개념의 학습에 대한 긍정적인 태도, 흥미, 동기 부여 등의 정의적인 요소들을 증진시킬 수 있음을 논의한다. 또한, 이 개념을 통하여 첨점이 있는 그래프에서 첨점의 좌우에서 서로 다른 접선이 생길 경우 학생들이 가질 수 있는 오류의 의미 분석 및 그 해소 방안을 모색한다.

• 한국소성가공학회:학술대회논문집
• /
• 한국소성가공학회 2004년도 춘계학술대회 논문집
• /
• pp.19-22
• /
• 2004

A scheme of shape optimization by new approximation approach is applied to design of a flow guide in three-dimensional extrusion processes. The optimization scheme is presented to reduce computation time fur the optimization process and applied to an H-section extrusion problem for verifying the efficiency and the usefulness. The object of optimization is to minimize the deviation of exit velocity and control points of a Bezier curve describing the shape of the flow guide are regarded as design variables. The effectiveness of the proposed scheme is then demonstrated through the applied example.

• Fibers and Polymers
• /
• 제6권4호
• /
• pp.348-354
• /
• 2005

These days consumers' various demands are accelerating research on apparel manufacturing system including automatic measurement, pattern generation, and clothing simulation. Accordingly, methods of reconstructing human body from point-clouds measured using a three dimensional scanning device are required for apparel CAD system to support these functions. In particular, we present in this study a human body reconstruction method focused on two issues, which are the decision of the number of control point for each sectional curve with error bound and the local knot removal for reducing the unusual concentration of control points. The approximation of sectional curves with error bounds as an approximation criterion leads all sectional curves to their own particular shapes apart from the number of control points. In addition, the application of the local knot removal to construction of human body sectional curves reduces the unusual concentration of control points effectively. The results may be used to produce an apparel CAD system as an automatic pattern generation system and a clothing simulation system through the low level control of NUBS or NURBS.

• Kyungpook Mathematical Journal
• /
• 제58권2호
• /
• pp.333-346
• /
• 2018

An approximation scheme utilizing Bezier curves is considered for solving time-delayed optimal control problems with terminal inequality constraints. First, the problem is transformed, using a $P{\acute{a}}de$ approximation, to one without a time-delayed argument. Terminal inequality constraints, if they exist, are converted to equality constraints. A computational method based on Bezier curves in the time domain is then proposed for solving the obtained non-delay optimal control problem. Numerical examples are introduced to verify the efficiency and accuracy of the proposed technique. The findings demonstrate that the proposed method is accurate and easy to implement.

• 호남수학학술지
• /
• 제37권4호
• /
• pp.487-504
• /
• 2015

For a smooth plane curve, the curvature can be characterized by the rate of change of the angle between the tangent vector and a fixed vector. In this article we prove that the curvature of a space curve can also be given by the rate of change of the locally defined angle between the tangent vector at a point and the nearby point. By using height functions, we introduce turning angle of a space curve and characterize the curvature by the rate of change of the turning angle. The main advantage of the turning angle is that it can be used to characterize the curvature of discrete curves. For this purpose, we introduce a discrete turning angle and a discrete curvature called visual curvature for space curves. We can show that the visual curvature is an approximation of curvature for smooth curves.

• 한국CDE학회논문집
• /
• 제15권3호
• /
• pp.178-188
• /
• 2010

This paper addresses the problem of determining if two surfaces intersect tangentially or transversally in a mathematically consistent manner and approximating an intersection curve. When floating point arithmetic is used in the computation, due to the limited precision, it often happens that the decision for tangential and transversal intersection is not clear cut. To handle this problem, in this paper, interval arithmetic is proposed to use, which provides a mathematically consistent way for such decision. After the decision, the intersection is traced using the validated ODE solver, which runs in interval arithmetic. Then an iterative method is used for computing the accurate intersection point at a given arc-length of the intersection curve. The computed intersection points are then approximated by using a B-spline curve, which is provided as one instance of intersection curve for further geometric processing. Examples are provided to demonstrate the proposed method.

• 한국CDE학회논문집
• /
• 제4권4호
• /
• pp.312-317
• /
• 1999

An inflection point on a curve is a point where the curvature vanishes. An inflection point is useful for various geometric operations such as the approximation of curves and intersection points between curves or curve approximations. An inflection point on planar Bezier curves can be easily detected using a hodograph and a derivative of hodograph, since the closed from of hodograph is known. In the case of rational Bezier curves, for the detection of inflection point, it is needed to use the first and the second derivatives have higher degree and are more complex than those of non-rational Bezier curvet. This paper presents three methods to detect inflection points of rational Bezier curves. Since the algorithms avoid explicit derivations of the first and the second derivatives of rational Bezier curve to generate polynomial of relatively lower degree, they turn out to be rather efficient. Presented also in this paper is the theoretical analysis of the performances of the algorithms as well as the experimental result.

• 한국수학교육학회지시리즈B:순수및응용수학
• /
• 제12권4호
• /
• pp.275-287
• /
• 2005

Geometric invariants are basic tools for geometric processing and computer vision. In this paper, we give a linear approximation for the differentiation of the binormal vector field of a space curve by using the forward and backward differences of discrete binormal vectors. Two kind of discrete torsion, say, back-ward torsion $T_b$ and forward torsion $T_f$ can be defined by the dot product of the (backward and forward) discrete differentiation of binormal vectors that are linear approximations of torsion. Using Frenet formula and Taylor series expansion, we give error estimations for the discrete torsions. We also give numerical tests for a curve. Notably the average of $T_b$ and $T_f$ looks more stable in errors.

• 한국진공학회지
• /
• 제16권1호
• /
• pp.1-6
• /
• 2007

우리는 O/Fe(100)의 원자적 구조와 MgO/Fe(100) 표면의 계면의 구조를 LEED I/V curve를 이용하여 분석하였다. 산소를 Fe(100) 표면에 흡착시켰을 때 Fe 표면의 첫 번째 층간 간격은 약 16 % 정도 팽창하는 것을 확인하였다. 1ML MgO를 Fe(100) 표면에 성장하였을 때, MgO의 O가 Fe의 on-top 위치에 자라나는 것을 확인하였고, MgO/Fe 계면의 층간 간격이 확장되는 것을 확인하였다. AIA(average intensity mixing approximation) 계산을 사용하여 단층 MgO 성장한 Fe(100) 계의 계면구조는 MgO/FeO/Fe(100)와 MgO/Fe(100)의 계면구조를 갖는 것을 확인하였다. 이것은 확장된 FeO 층의 존재를 보이고 MgO/FeO/Fe(100)와 MgO/Fe(100) 두가지 계면 구조의 공존을 보인 EELS 실험 결과를 뒷받침 한다.