• Title/Summary/Keyword: Recursive Formula

Search Result 66, Processing Time 0.019 seconds

A Study on the adaptive Connection Admission Control Method in ATM Networks (ATM망에서 적응적 연결수락제어 방법에 관한 연구)

  • 한운영;차균현
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.19 no.9
    • /
    • pp.1719-1729
    • /
    • 1994
  • In this paper, an adaptive CAC(Connection Admission Control) method is proposed. The adaptive CAC uses traffic estimates derived from both traffic parameter specified by user and cell flow measurements. Traffic estimation using user-specified parameters is performed at every moment of connection request or connection release by recursive formula which makes real-time calculation possible. Traffic estimation using cell flow measurement is carried out when the number of connected calls does not change during a measurement reflection period-renewal period. The most import ant thing for the traffic estimation using cell flow measurement is the determination of the length of a renewal period to trace a real traffic flow with an allowable time lag and the measurement reflection ratio(MRR) both to reduce the portion of overestimation and to avoid underestimation of real traffic flow. To solve these problems, the adaptive CAC updates renewal period and MRR adaptively according to the number of connections and the elapsed time after last connection or release respectively. Performance analysis for the proposed method is evaluated in several aspects for the cases of both homogeneous and heterogeneous bursty traffic. Numerical examples show the adaptive CAC method has the better performance compared with conventional CAC method based on burst model from the both utilization and QOS point of view.

  • PDF

ESD(Exponential Standard Deviation) Band centered at Exponential Moving Average (지수이동평균을 중심으로 하는 ESD밴드)

  • Lee, Jungyoun;Hwang, Sunmyung
    • Journal of Intelligence and Information Systems
    • /
    • v.22 no.2
    • /
    • pp.115-125
    • /
    • 2016
  • The Bollinger Band indicating the current price position in the recent price action range is obtained by adding/substracting the simple standard deviation (SSD) to/from the simple moving average (SMA). In this paper, we first compare the characteristics of the SMA and the exponential moving average (EMA) in the operator's point of view. A basic equation is obtained between the interval length N of the SMA operator and the weighting factor ${\rho}$ of the EMA operator, that makes the centers of the 1st order momentums of each operator impulse respoinse identical. For equivalent N and ${\rho}$, frequency response examples are obtained and compared by using the discrete time Fourier transform. Based on observation that the SMA operator reacts more excessively than the EMA operator, we propose a novel exponential standard deviation (ESD) band centered at the EMA and derive an auto recursive formula for the proposed ESD band. Practical examples for the ESD band show that it has a smoother bound on the price action range than the Bollinger Band. Comparisons are also made for the gap corrected chart to show the advantageous feature of the ESD band even in the case of gap occurrence. Trading techniques developed for the Bollinger Band can be straight forwardly applied to those for the ESD band.

The Lambert W Function in the Design of Minimum Mean Square-Error Quantizers for a Laplacian Source (램버트 W 함수를 사용한 라플라스 신호의 최소 평균제곱오차 양자화)

  • 송현정;나상신
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.27 no.6A
    • /
    • pp.524-532
    • /
    • 2002
  • This paper reports that the Lambert W function applies to a non-iterative design of minimum mean square-error scalar quantizers for a Laplacian source. Specifically, it considers a non-iterative design algorithm for optimum quantizers for a Laplacian source; it finds that the solution of the recursive nonlinear equation in the non-iterative design is elegantly expressed in term of the principal branch of the Lambert W function in a closed form; and it proves that the non-iterative algorithm applies only to exponential or Laplacian sources. The contribution of the paper is in the reduction of the time needed for the design and the increased accuracy in resulting quantization points and thresholds, because the algorithm is non-iterative and the Lambert W function can be evaluated as accurately as desired. Also, numerical results show how optimal quantization distortion converges monotonically to the Panter-Dite constant and help derive an approximation formula for the key parameters of optimum quantizers.

Journal PageRank Calculation in the Korean Science Citation Database (국내 인용 데이터베이스에서 저널 페이지랭크 측정 방안)

  • Lee, Jae-Yun
    • Journal of the Korean BIBLIA Society for library and Information Science
    • /
    • v.22 no.4
    • /
    • pp.361-379
    • /
    • 2011
  • This paper aims to propose the most appropriate method for calculating the journal PageRank in a domestic citation database. Korean journals show relatively high journal self-citation ratios and have many outgoing citations to external journals which are not included in the domestic citation database. Because the PageRank algorithm requires recursive calculation to converge, those two characteristics of domestic citation databases must be accounted for in order to measure the citation impact of Korean journals. Therefore, two PageRank calculation methods and four formulas for self-citation adjustment have been examined and tested for KSCD journals. The results of the correlation analysis and regression analysis show that the SCImago Journal Rank formula with the cr2 type self-citation adjustment method seems to be a more appropriate way to measure the relative impact of domestic journals in the Korean Science Citation Database.

Aeroelastic Tailoring of a Forward-Swept Wing Using One-dimensional Beam Analysis (1차원 보 해석을 활용한 전진익 항공기의 복합적층 날개 공력탄성학적 테일러링)

  • Choi, JaeWon;Lim, ByeongUk;Lee, SiHun;Shin, SangJoon
    • Journal of the Korean Society for Aeronautical & Space Sciences
    • /
    • v.48 no.8
    • /
    • pp.555-563
    • /
    • 2020
  • Foward-swept wings are known to possess superior aerodynamic performance compared to the conventional straight wings. However major concerns regarding forward-swept wings include divergence at lower airspeeds which require careful consideration at the design stage. As an endeavor to overcome such drawbacks, aeroelastic tailoring is attempted. In order to find an optimal ply sequence, recursive aeroelastic analyses is conducted and one-dimensional beam analysis coupled with simple aerodynamics is used for the improved computational efficiency and modelling convenience. The analysis used in this paper, DYMORE and analytic formula, both use one-dimensional beam model for the structure. Cross-sectional analysis for multi-cell NACA0015 airfoil section is conducted using VABS and oblique function is used for the sweep angle. Throughout the present aeroelastic tailoring, the maximum divergence speed of 290.2m/s is achieved which is increased by approximately 43% than that for the conventional ply configuration.

Finding the K Least Fare Routes In the Distance-Based Fare Policy (거리비례제 요금정책에 따른 K요금경로탐색)

  • Lee, Mi-Yeong;Baek, Nam-Cheol;Mun, Byeong-Seop;Gang, Won-Ui
    • Journal of Korean Society of Transportation
    • /
    • v.23 no.1
    • /
    • pp.103-114
    • /
    • 2005
  • The transit fare resulted from the renovation of public transit system in Seoul is basically determined based on the distance-based fare policy (DFP). In DFP, the total fare a passenger has to pay for is calculated by the basic-transfer-premium fare decision rule. The fixed amount of the basic fare is first imposed when a passenger get on a mode and it lasts within the basic travel distance. The transfer fare is additionally imposed when a passenger switches from one mode to another and the fare of the latter mode is higher than the former. The premium fare is also another and the fare of the latter begins to exceed the basic travel distance and increases at the proportion of the premium fare distance. The purpose of this study is to propose an algorithm for finding K number of paths, paths that are sequentially sorted based on total amount of transit fare, under DFP of the idstance-based fare policy. For this purpose, the link mode expansion technique is proposed in order to save notations associated with the travel modes. Thus the existing K shortest path algorithms adaptable for uni-modal network analysis are applicable to the analysis for inter-modal transportation networks. An optimality condition for finding the K shortest fare routes is derived and a corresponding algorithms is developed. The case studies demonstrate that the proposed algorithm may play an important role to provide diverse public transit information considering fare, travel distance, travel time, and number of transfer.