• Journal of applied mathematics & informatics
• /
• 제25권1_2호
• /
• pp.375-382
• /
• 2007

We Study, firstly, the dynamics of the difference equation $x_{n+1}\;=\;{\alpha}\;+\;{\frac{x^p_n}{x^p_{n-1}}}$, with $p\;{\in}\;(0,\;1)\;and\;{\alpha}\;{\in}\;[0,\;{\infty})$. Then, we generalize our results to the (k + 1)th order difference equation $x_{n+1}\;=\;{\alpha}\;+\;{\frac{x^p_n}{nx^p_{n-k}}$, $k\;=\;2,\;3,\;{\cdots}$ with positive initial conditions.

• Journal of applied mathematics & informatics
• /
• 제17권1_2_3호
• /
• pp.269-282
• /
• 2005

We study the global asymptotic stability, global attractivity, boundedness character, and periodic nature of all positive solutions and all negative solutions of the difference equation $$x_{n+1}\;=\;{\alpha}-{\frac{x_{n-1}}{x_{n}},\;n=0,1,\;{\cdots}$$, where ${\alpha}\;\in\; R$ is a real number, and the initial conditions $x_{-1},\;x_0$ are arbitrary real numbers.

• 충청수학회지
• /
• 제8권1호
• /
• pp.153-159
• /
• 1995

In this paper, we study the inclusion realtion between recursive sets. And we prove that if $\overline{R(f)}{\backslash}R(f)$ is not empty, then it is infinite, and we characterize the necessary and sufficent condition for which $\overline{R(f)}{\backslash}R(f)$ is countable.

• 대한수학회지
• /
• 제38권5호
• /
• pp.1061-1068
• /
• 2001

We write down explicity a recursive formula of one-pointed gravitational Gromov-Witten invariants and reduce the computation of them to a combinatoric problem which is not solved yet. The one-pointed invariants were played important role in Givental’s program in mirror symmetry. In section 3, we describe the combinatoric problem which can be read independently.

• 호남수학학술지
• /
• 제34권3호
• /
• pp.423-438
• /
• 2012

In this paper, we discuss numbers of downwards and upwards in generalized paper folding sequences. We compute the exact number of downwards and upwards in $R^n_p$ and $(R_pR_q)^n$ by using the properties of recursive sequences where n, p and q are natural numbers with $p{\geq}2$ and $q{\geq}2$.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 1997년도 한국자동제어학술회의논문집; 한국전력공사 서울연수원; 17-18 Oct. 1997
• /
• pp.629-632
• /
• 1997

This paper presents the design method of controller which is combined Genetic Algorithms with the Generalized minimum variance self tuning controller. It is shown that the controllers adapts to changes in the system parameters with time delays and noises. The self tuning effect is achieved through the recursive least square algorithm at the parameter estimation stage and also through the Robbins-Monro algorithm at the stage of optimizing a polynomial parameters. The computer simulation results are presented to illustrate the procedure and to show the performance of the control system.

• 전자공학회논문지B
• /
• 제31B권7호
• /
• pp.58-65
• /
• 1994

A recursive on-line algorithm for orthogonal ARMA identification is proposed for linear MIMO systems with unknown parameters time delay and order. This algorithm is based on the Gram-Schmidt orthogonalization of basis functions, and extended to a recursiveform by using new functions of two dimensional autocorrelations and crosscorrelations of inputs and outputs. This proposed algorithm can also cope with slowly time-varying or order-varying systems. Various simulations reveal the performance of the algorithm.

• East Asian mathematical journal
• /
• 제34권1호
• /
• pp.59-67
• /
• 2018

We present new recurrence formulas for the raw and central moments of a compound binomial random variable. Our approach involves relating two compound binomial random variables that have parameters with a difference of 1 for the number of trials, but which have the same parameters for the success probability for each trial. As a consequence of our recursions, the raw and central moments of a binomial random variable are obtained in a recursive manner without the use of Stirling numbers.

• 호남수학학술지
• /
• 제38권1호
• /
• pp.71-84
• /
• 2016

The aim of this work is to compute the volume of the graph polytope associated with various type of finite simple graphs composed of paths and stars. Recurrence relations are obtained using the recursive volume formula (RVF) which was introduced in Lee and Ju ([3]). We also discussed the relationship between the volume of the graph polytopes and the number of linear extensions of the associated posets for given bipartite graphs.

• 전력전자학회:학술대회논문집
• /
• 전력전자학회 2013년도 추계학술대회 논문집
• /
• pp.200-201
• /
• 2013

This paper investigates a new approach for Li-Ion battery state-of-charge (SOC) estimation using sliding mode observer (SMO) technique including parameters aging compensation via recursive least squares (RLS). The main advantages of this approach would be low computational load, easiness of implementation along with the robustness of the method for internal battery model parameters estimation. The proposed algorithm was first tested on a set of acquired battery data using implementation in Simulink and later developed as C-code module for firmware application.