• Title/Summary/Keyword: Simple Bounds

Search Result 92, Processing Time 0.029 seconds

A Study of Departure Process on the Open and Nested Population Constrained Tandem Queueing Network with Constant Service Times (사용자 제한이 적용되는 2계층 대기행렬 네트워크 구조의 이탈과정에 관한 분석)

  • Rhee, Young
    • Journal of the Korean Operations Research and Management Science Society
    • /
    • v.34 no.4
    • /
    • pp.113-121
    • /
    • 2009
  • In this paper, we consider the departure process from the open and nested tandem Queueing network with population constraint and constant service times. It is known that the Queueing network can be transformed into a simple Queueing network which can be easy to analyze. Using this simple Queueing network, upper and lower bounds on the interdeparture time are obtained. We prove that the variance of the interdeparture time is bounded within these two bounds. Validation against simulation data is shown that how it works the variance of the interdeparture time within two bounds. These bounds can be applied to obtain the better variance of the interdeparture time using a suitable method.

Robust Stability Bounds for Discrete-Time Regulators with Computation Delays (연산지연을 가진 이산시간 레규레이터에 대한 강인한 안정성 유계)

  • 배종일
    • Journal of Advanced Marine Engineering and Technology
    • /
    • v.22 no.2
    • /
    • pp.174-180
    • /
    • 1998
  • Robust stability of discrete-time regulators which utilize state predictors to compensate computation delays is considered. Novel expressions for the return difference matrices and the complementary sensitivity matrices at the input and the output of the regulator are found to obtain simple bounds for unstructured perturbations. Robust stability for pertubations of the system matrix and /or the gain matrix is also considered. under certain restriction on the nominal system simple bounds for the pertubations are obtained directly from the characteristic equation. It is shown that as far as the effect of the computation delays concerns these bounds have explicit relation to those for the unstructured pertubations.

  • PDF

Upper Bounds of Maximum Likelihood (ML) Decoding Performance of a few Irregular LDPC Codes (몇 개의 불규칙한 LDPC 부호의 Maximum Likelihood(ML) 복호에 대한 성능의 상향 한계와 정점 성능 감쇠 분석)

  • Chung, Kyu-Hyuk
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.34 no.11C
    • /
    • pp.1025-1028
    • /
    • 2009
  • This paper presents upper bounds of Maximum Likelihood (ML) decoding performance of a few irregular LDPC codes using the simple bound and ML input output weight distributions and it is shown that contrary to general opinion that as block length becomes longer, BP decoding performance becomes simply closer to ML decoding performance, before peak degradation, as block length becomes longer, BP decoding performance falls behind ML decoding performance more and after peak degradation, general opinion holds.

On Bounds for Moments of Unimodal Distributions

  • Sharma, R.;Bhandaria, R.
    • Communications for Statistical Applications and Methods
    • /
    • v.21 no.3
    • /
    • pp.201-212
    • /
    • 2014
  • We provide a simple basic method to find bounds for higher order moments of unimodal distributions in terms of lower order moments when the random variable takes value in a given finite real interval. The bounds for moments in terms of the geometric mean of the distribution are also derived. Both continuous and discrete cases are considered. The bounds for the ratio and difference of moments are obtained. The special cases provide refinements of several well-known inequalities, such as Kantorovich inequality and Krasnosel'skii and Krein inequality.

LDPC Codes' Upper Bounds over the Waterfall Signal-to-Noise Ratio (SNR) Region

  • Chung, Kyu-Hyuk
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.33 no.11C
    • /
    • pp.880-882
    • /
    • 2008
  • This paper presents LDPC codes' upper bounds over the waterfall SNR region. The previous researches have focused on the average bound or ensemble bound over the whole SNR region and showed the performance differences for the fixed block size. In this paper, the particular LDPC codes' upper bounds for various block sizes are calculated over the waterfall SNR region and are compared with BP decoding performance. For different block sizes the performance degradation of BP decoding is shown.

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

A Study on the Approximating Reliability Analysis of communication Networks (통신망의 신뢰도 근사해석에 관한 연구)

  • 유재영;오영환
    • Proceedings of the Korean Institute of Communication Sciences Conference
    • /
    • 1991.10a
    • /
    • pp.145-149
    • /
    • 1991
  • In this paper, an algorithm is proposed to analyze the approximating reliability of the capacity considered communication networks. In the case ofthe former methods to evaluate the source-to-termianl node reliability, it is very difficult to contract and delete the jointed terms in the simple path group. Therefore, the reliability bounds are used and compared to the exact reliability by TURBO PROLOG, the natural lanquage of artficial intelligence. In the reliability bounds, the upper bound used the valid cutset that isthe group of simple path and the lower bound used the minimal cutset by complement operation and the esact reiability is compared to this reliability bounds.

Derivations of Upper and Lower Bounds of the Expected Busy Periods for a Controllable M/G/1 Queueing Model Operating Under the Triadic Max(N, T, D) Policy (삼변수 Max(N, T, D) 운용방침이 적용되는 조정가능한 M/G/1 대기모형의 busy period 기대값의 상한과 하한 유도)

  • Rhee, Hahn-Kyou
    • Journal of Korean Society of Industrial and Systems Engineering
    • /
    • v.34 no.1
    • /
    • pp.67-73
    • /
    • 2011
  • Using the known result of the expected busy period for a controllable M/G/1 queueing model operating under the triadic Max (N, T, D) policy, its upper and lower bounds are derived to approximate its corresponding actual value. Both bounds are represented in terms of the expected busy periods for the dyadic Min (N, T), Min (N, D) and Min (T, D) and simple N, T and D operating policies. All three input variables N, T and D are equally contributed to construct such bounds for better estimation.

Derivations of Upper and Lower Bounds of the Expected Busy Periods for the Triadic Min(N, T, D) Operating Policy applied to a Controllable M/G/1 Queueing Model (조정가능한 M/G/1 대기모형에 삼변수 Min(N, T, D) 운용방침이 적용될 때 busy period 기댓값의 상한과 하한 유도)

  • Rhee, Hahn-Kyou
    • Journal of Korean Society of Industrial and Systems Engineering
    • /
    • v.33 no.2
    • /
    • pp.97-104
    • /
    • 2010
  • Using the known result of the expected busy period for the triadic Min (N, T, D) operating policy applied to a controllable M/G/1 queueing model, its upper and lower bounds are derived to approximate its corresponding actual value. Both bounds are represented in terms of the expected busy periods for the dyadic Min (N, T), Min (N, D) and Min (T, D) and simple N, T and D operating policies. All three input variables N, T and D are equally contributed to construct such bounds for better approximations.

Upper and Lower Bounds of the Expected Busy Period for the Triadic Med(N, T, D) Policy (삼변수 Med(N, T, D) 운용방침에 따른 Busy Period 기대값의 상한과 하한 유도)

  • Rhee, Hahn-Kyou
    • Journal of Korean Society of Industrial and Systems Engineering
    • /
    • v.36 no.1
    • /
    • pp.58-63
    • /
    • 2013
  • Using the known result of the expected busy period for the triadic Med (N, T, D) operating policies applied to a controllable M/G/1 queueing model, its upper and lower bounds are derived to approximate its corresponding actual values. Both bounds are represented in terms of the expected busy periods for the dyadic Min (N, T), Min (N, D) and Min (T, D) or Max (N, T), Max (N, D) and Max (T, D) with the simple N, T and D operating policies without using any other types of triadic operating policies such as Min (N, T, D) and Max (N, T, D) policies. All three input variables N, T and D are equally contributed to construct such bounds for estimation of the expected busy period.