• 한국마린엔지니어링학회:학술대회논문집
• /
• 한국마린엔지니어링학회 2001년도 추계학술대회 논문집(Proceeding of the KOSME 2001 Autumn Annual Meeting)
• /
• pp.112-119
• /
• 2001

Parameter tuning methods by Ziegler-Nickels for control systems are generally classified into Z-N(1) and Z-N(2). The purpose of this paper is to describe what relations exist between methods of Z-N(1) and Z-N(2), or how Z-N(1) method can be originated from Z-N(2) method by analyzing one loop control system of P or PI controller and time delay process. The formulas of Z-N(1) consist of process parameters, L(time delay), $K_m$(gain) and $T_m$(time constant), but Z-N(2) method is based only on the ultimate gain $K_u$ and the ultimate period $T_u$ acquired normally by practical trial without any parameters of Z-N(1). In this paper, for the first step to seek mutual relations, the simple formulas of Z-N(2) are transformed into the formulas composed of the same parameters as Z-N(1) which is derived from the analysis of frequency characteristics. Then, the approximation of the actual ultimate frequency is proposed as important premise in the translation between Z-N(1) and (2). Such equalization and approximation brings a simple approximated formula which can explain how Z-N(1) is originated from the Z-N(2) in the form of formula. And a model system is adopted to compare the approximated formula to Z-N(1) and Z-N(2) methods, the results of which show the effectiveness of the proposals.

• East Asian mathematical journal
• /
• 제25권2호
• /
• pp.179-196
• /
• 2009

Let E be a uniformly convex Banach space and K a nonempty closed convex subset which is also a nonexpansive retract of E. For i = 1, 2, 3, let $T_i:K{\rightarrow}E$ be an asymptotically nonexpansive mappings with sequence ${\{k_n^{(i)}\}\subset[1,{\infty})$ such that $\sum_{n-1}^{\infty}(k_n^{(i)}-1)$ < ${\infty},\;k_{n}^{(i)}{\rightarrow}1$, as $n{\rightarrow}\infty$ and F(T)=$\bigcap_{i=3}^3F(T_i){\neq}{\phi}$ (the set of all common xed points of $T_i$, i = 1, 2, 3). Let {$a_n$},{$b_n$} and {$c_n$} are three real sequences in [0, 1] such that $\in{\leq}\;a_n,\;b_n,\;c_n\;{\leq}\;1-\in$ for $n{\in}N$ and some ${\in}{\geq}0$. Starting with arbitrary $x_1{\in}K$, define sequence {$x_n$} by setting {$$x_{n+1}=P((1-a_n)x_n+a_nT_1(PT_1)^{n-1}y_n)$$ $$y_n=P((1-b_n)x_n+a_nT_2(PT_2)^{n-1}z_n)$$ $$z_n=P((1-c_n)x_n+c_nT_3(PT_3)^{n-1}x_n)$$. Assume that one of the following conditions holds: (1) E satises the Opial property, (2) E has Frechet dierentiable norm, (3) $E^*$ has Kedec -Klee property, where $E^*$ is dual of E. Then sequence {$x_n$} converges weakly to some p${\in}$F(T).

• Journal of Advanced Marine Engineering and Technology
• /
• 제19권2호
• /
• pp.10-19
• /
• 1995

Heat trnasfer for absorbing and emitting media in laminar layer along the cylinders has been analyzed. Governing equation are transformed to local nonsimilarity equations by the dimensional analysis. The effects of the Stark number, Prandtl number, Optical radius and wall emissivity are mainly investigated. For the formal solution a numerical integration is performed and the results are compared with those obtained by P-1 and P-3 approximation. The results show that boundary layers consist of conduction-convection-radiation layer near the wall and convection-radiation layer far from the wall. As the Stark number of wall emissivity increases the local radiative heat flux is increased. The Pradtl number or curvature variations do not affect the radiative heat flux from the wall, but The Prandtl number or wall emissivity variations affect the conduction heat flux. Consequently the total heat flux from the wall are affected by the Prandtl number or wall emissivity variation.

• 한국정보과학회:학술대회논문집
• /
• 한국정보과학회 2005년도 한국컴퓨터종합학술대회 논문집 Vol.32 No.1 (A)
• /
• pp.901-903
• /
• 2005

본 논문에서는 평면 상에 두 볼록집합 P와 Q가 주어졌을 때, P를 강체운동 하에서 수평 이동 및 회전이동하여 Q와 겹치는 영역이 근사적으로 최대가 되는 알고리즘을 제시한다. 임의의 양의 상수 $\epsilon$이 주어졌을 때, 본 알고리즘은 가장 많이 겹치는 넓이의 $1-\epsilon$ 배를 보장하는 P의 강체운동을 $O((1/\epsilon)$ 번의 기하 질의 와 $O((1/{\epsilon}^2)log(1/$\epsilon)) 시간 내에 구할 수 있다. 특히 P와 Q가 볼록다각형 일 때, $O((1/\epsilon)log\;n+(1/{\epsilon}^2)log(1/\epsilon))$ 시간에 구한다. 만약 수평 이동만 사용할 경우는 $O((1/\epsilon)log\;n+(1/\epsilon)log(1/\epsilon))$ 시간에 구할 수 있다.

• Journal of Power Electronics
• /
• 제11권3호
• /
• pp.381-388
• /
• 2011

This article presents the development of a model for SiC power diodes based on the physics of the semiconductor. The model is able to simulate the behavior of the dynamics of the charges in the N- region based on the stored charge inside the SiC power diode, depending on the working regime of the device (turn-on, on-state, and turn-off). The optimal individual calculation of the ambipolar diffusion length for every phase of commutation allows for solving the ambipolar diffusion equation (ADE) using a very simple approach. By means of this methodology development a set of differential equations that models the main physical phenomena associated with the semiconductor power device are obtained. The model is developed in Pspice with acceptable simulation times and without convergence problems during its implementation.

• Journal of applied mathematics & informatics
• /
• 제27권1_2호
• /
• pp.441-452
• /
• 2009

In this paper, a fifth order numerical method is presented for solving singularly perturbed differential-difference equations with negative shift. In recent papers the term negative shift has been using for delay. Similar boundary value problems are associated with expected first exit time problem of the membrane, potential in models for neuron and in variational problems in control theory. In the numerical treatment for such type of boundary value problems, first we use Taylor approximation to tackle terms containing small shifts which converts it to a boundary value problem for singularly perturbed differential equation. The two point boundary value problem is transformed into general first order ordinary differential equation system. A discrete approximation of a fifth order compact difference scheme is presented for the first order system and is solved using the boundary conditions. Several numerical examples are solved and compared with exact solution. It is observed that present method approximates the exact solution very well.

• Communications for Statistical Applications and Methods
• /
• 제21권2호
• /
• pp.115-124
• /
• 2014

In this paper we derive a Berry-Esseen type bound for the kernel density estimator of a random left truncated model, in which each datum (Y) is randomly left truncated and is sampled if $Y{\geq}T$, where T is the truncation random variable with an unknown distribution. This unknown distribution is estimated with the Lynden-Bell estimator. In particular the normal approximation rate, by choice of the bandwidth, is shown to be close to $n^{-1/6}$ modulo logarithmic term. We have also investigated this normal approximation rate via a simulation study.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 2000년도 제15차 학술회의논문집
• /
• pp.494-494
• /
• 2000

This paper demonstrates that the largest Lyapunov exponent $\lambda$ of recurrent neural networks can be controlled by a gradient method. The method minimizes a square error $e_{\lambda}=(\lambda-\lambda^{obj})^2$ where $\lambda^{obj}$ is desired exponent. The $\lambda$ can be given as a function of the network parameters P such as connection weights and thresholds of neurons' activation. Then changes of parameters to minimize the error are given by calculating their gradients $\partial\lambda/\partialP$. In a previous paper, we derived a control method of $\lambda$via a direct calculation of $\partial\lambda/\partialP$ with a gradient collection through time. This method however is computationally expensive for large-scale recurrent networks and the control is unstable for recurrent networks with chaotic dynamics. Our new method proposed in this paper is based on a stochastic relation between the complexity $\lambda$ and parameters P of the networks configuration under a restriction. Then the new method allows us to approximate the gradient collection in a fashion without time evolution. This approximation requires only $O(N^2)$ run time while our previous method needs $O(N^{5}T)$ run time for networks with N neurons and T evolution. Simulation results show that the new method can realize a "stable" control for larege-scale networks with chaotic dynamics.

• 한국자기학회지
• /
• 제12권4호
• /
• pp.149-153
• /
• 2002

지구자기장 이하의 저자기장 측정에 있어서 소형이고 소비전력이 작으면서 장기적 안정성이 요구되는 분야에 flux-gate 마그네토미터를 많이 사용하고 있다. 또한 많은 저자기장 측정분야가 지구자기장의 크기측정보다는 지자장의 변화를 측정하는 경우가 많기 때문에, 본 연구에서 측정범위가 $\pm$1,000 nT, 5pT/√Hz (at 1 Hz)인 flux-gate센서를 사용 $\pm$50000 nT인 지구자기장을 순차적 근사법으로 보상한 후 지구자기장의 변화를 고감도로 측정할 수 있는 3-축의 flux-gate 마그네토미터를 개발하였다.

• 대한수학회보
• /
• 제47권4호
• /
• pp.777-785
• /
• 2010

Let X be a linear space and Y be a complete quasi p-norm space. We will show that for each function f : X $\rightarrow$ Y, which satisfies the inequality ${\parallel}{\Delta}_x^nf(y)\;-\;n!f(x){\parallel}\;{\leq}\;\varphi(x,y)$ for suitable control function $\varphi$, there is a unique monomial function M of degree n which is a good approximation for f in such a way that the continuity of $t\;{\mapsto}\;f(tx)$ and $t\;{\mapsto}\;\varphi(tx,\;ty)$ imply the continuity of $t\;{\mapsto}\;M(tx)$.