• 제목/요약/키워드: Recursive sequence

검색결과 63건 처리시간 0.021초

ON THE RECURSIVE SEQUENCE $x_{n+1}=\frac{a+bx_{n-1}}{A+Bx^k_n}$

  • Ahmed, A. M.;El-Owaidy, H. M.;Hamza, Alaa E.;Youssef, A. M.
    • Journal of applied mathematics & informatics
    • /
    • 제27권1_2호
    • /
    • pp.275-289
    • /
    • 2009
  • In this paper, we investigate the global behavior of the difference equation $x_{n+1}\;=\;\frac{a+bx_{n-1}}{A+Bx^k_n}$, n=0,1,..., where a,b,$B\;{\in}\;[0,\infty)$ and A, $k\;{\in}\;(0,\infty)$ with non-negative initial conditions.

  • PDF

Simple Recursive Approach for Detecting Spatial Clusters

  • Kim Jeongjin;Chung Younshik;Ma Sungjoon;Yang Tae Young
    • Communications for Statistical Applications and Methods
    • /
    • 제12권1호
    • /
    • pp.207-216
    • /
    • 2005
  • A binary segmentation procedure is a simple recursive approach to detect clusters and provide inferences for the study space when the shape of the clusters and the number of clusters are unknown. The procedure involves a sequence of nested hypothesis tests of a single cluster versus a pair of distinct clusters. The size and the shape of the clusters evolve as the procedure proceeds. The procedure allows for various growth clusters and for arbitrary baseline densities which govern the form of the hypothesis tests. A real tree data is used to highlight the procedure.

Temperature control of a batch polymerization reactor using nonlinear predictive control algorithm (비선형 예측제어 알고리즘을 이용한 회분식 중합 반응기의 온도제어)

  • 나상섭;노형준;이현구
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 제어로봇시스템학회 1996년도 한국자동제어학술회의논문집(국내학술편); 포항공과대학교, 포항; 24-26 Oct. 1996
    • /
    • pp.1000-1003
    • /
    • 1996
  • Nonlinear unified predictive control(UPC) algorithm was applied to the temperature control of a batch polymerization reactor for polymethylmethacrylate(PMMA). Before the polymerization reaction is initiated, the parameters of the process model are determined by the recursive least squares(RLS) method. During the reaction, nonlinearities due to generation of heat of reaction and variation of heat transfer coefficients are predicted through the nonlinear model developed. These nonlinearities are added to the process output from the linear process model. And then, the predicted process output is used to calculate the control output sequence. The performance of nonlinear control algorithm was verified by simulation and compared with that of the linear unified predictive control algorithm. In the experiment of a batch PMMA polymerization, nonlinear unified predictive control was implemented to regulate the temperature of the reactor, and the validity of the nonlinear model was verified through the experimental results. The performance of the nonlinear controller turned out to be superior to that of the linear controller for tracking abrupt changes in setpoint.

  • PDF

Vehicle Platooning Remote Control via State Estimation in a Communication Network (통신 네트워크에서 상태 추정에 의한 군집병합의 원격제어)

  • 황태현;최재원;김영호
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 제어로봇시스템학회 2000년도 제15차 학술회의논문집
    • /
    • pp.192-192
    • /
    • 2000
  • In this paper, a platoon merging is considered as a remote-controlled system with the state represented by a stochastic process. In this system, it becomes to encounter situations where a single decision maker controls a large number of subsystems, and observation and control signals are sent over a communication channel with finite capacity and significant transmission delays. Unlike classical estimation problem in which the observation is a continuous process corrupted by additive noise, there is a constraint that the observation must be coded and transmitted over a digital communication channel with finite capaci쇼. A recursive coder-estimator sequence is a state estimation scheme based on observations transmitted with finite communication capacity constraint. Using the coder-estimator sequence, the remote control station designs a feedback controller. In this paper, we introduce a stochastic model for the lead vehicle in a platoon of vehicles considering the angle between a road surface and a horizontal plane as a stochastic process. The simulation results show that the inter-vehicle distance and the deviation from the desired inter-vehicle distance are well regulated.

  • PDF

The adaptive reduced state sequence estimation receiver for multipath fading channels (이동통신 환경에서 적응상태 축약 심볼열 추정 수신기)

  • 이영조;권성락;문태현;강창언
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • 제22권7호
    • /
    • pp.1468-1476
    • /
    • 1997
  • In mobile communication systems, the Reduced State Sequence Estimation(RSSE) receiver must be able to track changes in the channel. This is carried out by the adaptive channel estimator. However, when the tentative decisions are used in the channel estimator, incorrect decisions can cause error propagation. This paper presents a new channel estimator using the path history in the Viterbi decoder for preventing error propagation. The selection of the path history in the Viterbi decoder for preventing error propagation. The selection of the path history for the channel estimator depends on the path metric as in the decoding of the Viterbi decoder in RSSE. And a discussion on the channel estimator with different adaptation algorithms such as Least Mean Square(LMS) algorithm and Recursive Least Square(RLS) algorithm is provided. Results from computer simulations show that the RSSE receivers using the proposed channel estimator have better performance than the other conventional RSSE receiver, and that the channel estimator with RLS algorithm is adequate for multipath fading channel.

  • PDF

Development of ordering chatbot that can process multiple keywords based on recursive slot-filling method (빈칸 되묻기 방식 기반 다중 키워드 처리가 가능한 주문용 챗봇 개발)

  • Choi, Hyeon-Jun;Bae, Seung-Ju;Jeong, Gu-Min
    • The Journal of Korea Institute of Information, Electronics, and Communication Technology
    • /
    • 제12권4호
    • /
    • pp.440-448
    • /
    • 2019
  • In this paper, we propose an ordering chatbot that can process multiple keywords based on recursive slot-filling method. In general, in case of an order service using chatbots, the whole order process is performed only according to the sequence defined by the developer. That is, among all the information needed for the whole order process, only one input can be processed at one time. In order to reduce processing step for the order, we propose a recursive slot-filling method which fills out multiple slots per one time by extracting multiple keywords. First, a keyword array for the order is created according to the order related information. Next, from the input sentence of a user, multiple keywords is extracted. Corresponding slots for a keyword array will be filled with the extracted keywords. Finally, recursive routine will be executed to fill out all the blank in the keyword array. The usability and validity of the proposed method will be shown from the implementation of a smartphone application.

ON THE DIFFERENCE EQUATION $x_{n+1}\;=\;{\alpha}\;+\;{\frac {x^p_n}{x^p_{n-1}}}$

  • Aloqeili, Marwan
    • 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.

ON THE RECURSIVE SEQUENCE X_{n+1} = $\alpha$ - (X_n/X_n-1)

  • YAN XING XUE;LI WAN TONG;ZHAO ZHU
    • 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.

COUNTING PROBLEMS IN GENERALIZED PAPER FOLDING SEQUENCES

  • Yun, Jung-Hee;Hahm, Nahm-Woo
    • Honam Mathematical Journal
    • /
    • 제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$.

Tests for Mean Change with the Modified Cusum Statistics

  • Kim, Jae-Hee;Kim, Na-Yeon
    • Journal of the Korean Data and Information Science Society
    • /
    • 제14권2호
    • /
    • pp.187-199
    • /
    • 2003
  • We deal with the problem of testing a sequence of independent normal random variables with constant, known or unknown, variance for no change in mean versus alternatives with a single change-point. Various tests based on the likelihood ratio and recursive residuals, score statistics and cusums are studied. Proposed tests are modified version of Buckley's cusum statistics. A comparison study of various change-point test statistics is done by Monte Carlo simulation with S-plus software.

  • PDF