• Title/Summary/Keyword: bounds

Search Result 1,343, Processing Time 0.031 seconds

The Decision of Bounds for Consecutive k out of n Structure with Sink-Source Pole

  • Oh, Chung Hwan;Kim, Bok Mahn
    • Journal of Korean Society for Quality Management
    • /
    • v.21 no.2
    • /
    • pp.93-101
    • /
    • 1993
  • The derived expressions and computations of the system reliability in the consecutive k out of n failure structure with sink-source pole are discussed and a decisive lower and upper bounds as well as exact system reliability are presented in this paper. Good bounds of the system reliability can be easily computed and are illustrated in the numerical example.

  • PDF

Bootstrap Confidence Bounds for P(X>Y) in 1-Way Random Effect Model with Equal Variances

  • Kim, Dal Ho;Cho, Jang Sik
    • Journal of Korean Society for Quality Management
    • /
    • v.24 no.1
    • /
    • pp.87-95
    • /
    • 1996
  • We construct bootstrap confidence bounds for reliability, R=P(X>Y), where X and Y are independent normal random variables. 1-way random effect models with equal variances are assumed for the populations of X and Y. We compare the accuracy of the proposed bootstrap confidence bounds and classical confidence bound for small samples via Monte Carlo simulation.

  • PDF

COEFFICIENT BOUNDS FOR CLOSE-TO-CONVEX FUNCTIONS ASSOCIATED WITH VERTICAL STRIP DOMAIN

  • Bulut, Serap
    • Communications of the Korean Mathematical Society
    • /
    • v.35 no.3
    • /
    • pp.789-797
    • /
    • 2020
  • By considering a certain univalent function in the open unit disk 𝕌, that maps 𝕌 onto a strip domain, we introduce a new class of analytic and close-to-convex functions by means of a certain non-homogeneous Cauchy-Euler-type differential equation. We determine the coefficient bounds for functions in this new class. Relevant connections of some of the results obtained with those in earlier works are also provided.

Optimal Location of Facilities with Upper and tower Capacity Hounds (용량의 상한과 하한이 주어진 설비의 최적 입지 선정)

  • 차동완;민대환;윤문길
    • Journal of the Korean Operations Research and Management Science Society
    • /
    • v.8 no.1
    • /
    • pp.19-26
    • /
    • 1983
  • This paper deals with the problem of locating facilities with upper and lower capacity bounds in a single level physical distribution system at minimum total costs. Several known schemes for location problems with upper capacity bounds only are successfully extended to our case and then implemented into our branch ana bound solution procedure. Computational experiments with twelve test problems suggest the effectiveness of our approach by showing that only a small amount of additional computation is required for our problem as compared to that for the problems with upper capacity bounds.

  • PDF

A robust generalized predictive control which guarantees $H_{\infty}$ norm bounds ($H_{\infty}$노옴조건을 만족하는 강인한 일반형예측제어기)

  • 이영일;김용호;권욱현
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 1996.10b
    • /
    • pp.556-559
    • /
    • 1996
  • In this paper, we suggest a H center .inf. generalized predictive control(H center GPC) which guarantees $H_{\infty}$-norm bounds. THe suggested control is obtained by solving the min-max problem in nonrecursive forms. The stability conditions of the suggested control are derived in a somewhat simple form and it is not required for the derived solution to be a saddle point solution. It is also shown that the suggested control guarantees the $H_{\infty}$-norm bounds under the same conditions of stability.

  • PDF

Reliability computation technique for ball bearing under the stress-strength model

  • Nayak, S.;Seal, B.
    • International Journal of Reliability and Applications
    • /
    • v.17 no.1
    • /
    • pp.51-63
    • /
    • 2016
  • Stress function of ball bearing is function of multiple stochastic factors and this system is so complex that analytical expression for reliability is difficult to obtain. To address this pressing problem, in this article, we have made an attempt to approximate system reliability of this important item based on reliability bounds under the stress strength setup. This article also provides level of error of this item. Numerical analysis has been adopted to show the closeness between the upper and lower bounds of this item.

Saturation impulses for dynamically loaded structures with finite-deflections

  • Zhao, Ya-Pu;Yu, T.X.;Fang, J.
    • Structural Engineering and Mechanics
    • /
    • v.3 no.6
    • /
    • pp.583-592
    • /
    • 1995
  • The concept of "Saturation Impulse" for rigid, perfectly plastic structures with finite-deflections subjected to dynamic loading was put forward by Zhao, Yu and Fang (1994a). This paper extends the concept of Saturation Impulse to the analysis of structures such as simply supported circular plates, simply supported and fully clamped square plates, and cylindrical shells subjected to rectangular pressure pulses in the medium load range. Both upper and lower bounds of nondimensional saturation impulses are presented.

Tightening Throughput Bounds for Finite Tandem Queues via Duality

  • Tcha, Dong-Wan;Lee, Won-Taek
    • Journal of the Korean Operations Research and Management Science Society
    • /
    • v.15 no.2
    • /
    • pp.63-69
    • /
    • 1990
  • This note shows that the throughput bounds for two-stage tandem queueing systems with finite buffers, obtained by the existing methods, can significantly betightened via duality.

  • PDF

NEW BOUNDS ON THE OVERFLOW PROBABILITY IN JACKSON NETWORKS

  • Lee, Ji-Yeon
    • Journal of the Korean Statistical Society
    • /
    • v.32 no.4
    • /
    • pp.359-371
    • /
    • 2003
  • We consider the probability that the total population of a stable Jackson network reaches a given large value. By using the fluid limit of the reversed network, we derive new upper and lower bounds on this probability, which are sharper than those in Glasserman and Kou (1995). In particular, the improved lower bound is useful for analyzing the performance of an importance sampling estimator for the overflow probability in Jackson tandem networks. Bounds on the expected time to overflow are also obtained.