• 제목/요약/키워드: bounds

검색결과 1,351건 처리시간 0.022초

Asymptotics in Load-Balanced Tandem Networks

  • 이지연
    • 한국데이터정보과학회:학술대회논문집
    • /
    • 한국데이터정보과학회 2003년도 추계학술대회
    • /
    • pp.155-162
    • /
    • 2003
  • A tandem network in which all nodes have the same load is considered. We derive bounds on the probability that the total population of the tandem network exceeds a large value by using its relation to the stationary distribution. These bounds imply a stronger asymptotic limit than that in the large deviation theory.

  • PDF

Confidence Bounds for Superiority

  • Jeon, Jong-Woo;Kim, Woo-Chul;Jeong, Gyu-Jin
    • 품질경영학회지
    • /
    • 제16권2호
    • /
    • pp.10-17
    • /
    • 1988
  • The problem of making confidence statements is considered about the means of treatments with t largest sample values among k available treatments. These confidence bounds are used in selecting a fixed number of superior treatments. An illustrative example is also provided.

  • PDF

ON PERTURBED TRAPEZOIDAL AND MIDPOINT RULES

  • Cerone, P.
    • Journal of applied mathematics & informatics
    • /
    • 제9권2호
    • /
    • pp.593-605
    • /
    • 2002
  • Explicit hounds are obtained for the perturbed, or corrected, trapezoidal and midpoint rules in terms of the Lebesque norms of the second derivative of the function. It is demonstrated that the bounds obtained are the same for both rules although the perturbation or the correction term is different.

Notes on Upper and Lower Bounds of Odds Ratio

  • Woo, Jung-Soo
    • Journal of the Korean Data and Information Science Society
    • /
    • 제11권1호
    • /
    • pp.31-35
    • /
    • 2000
  • We shall give upper and lower bounds of the odds ratio of an event by a slight condition of the conditional probability of events.

  • PDF

Asymptotics in Load-Balanced Tandem Networks

  • Lee, Ji-Yeon
    • Journal of the Korean Data and Information Science Society
    • /
    • 제14권3호
    • /
    • pp.715-723
    • /
    • 2003
  • A tandem network in which all nodes have the same load is considered. We derive bounds on the probability that the total population of the tandem network exceeds a large value by using its relation to the stationary distribution. These bounds imply a stronger asymptotic limit than that in the large deviation theory.

  • PDF

ON ESTIMATION OF ROOT BOUNDS OF POLYNOMIALS

  • Kim, Hye-Kyung;Park, Young-Kou
    • 한국수학교육학회지시리즈B:순수및응용수학
    • /
    • 제4권1호
    • /
    • pp.77-85
    • /
    • 1997
  • In this work we will show that, in the sense of the Maximum overestimation factor, the absolute root bound functional derived from the new formula for the divided difference is better than the other known results in this area.

  • PDF