• 제목/요약/키워드: Upper Bounds

검색결과 417건 처리시간 0.025초

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

  • 이한교;오현승
    • 산업경영시스템학회지
    • /
    • 제32권3호
    • /
    • pp.71-77
    • /
    • 2009
  • Using the results of the expected busy periods for the dyadic Min(N, D) and Max(N, D) operating policies in a controllable M/G/1 queueing model, an important relation between them is derived. The derived relation represents the complementary property between two operating policies. This implies that it could be possible to obtained desired system characteristics for one of the two operating policies from the corresponding known system characteristics for the other policy. Then, upper and lower bounds of expected busy periods for both dyadic operating policies are also derived.

시간지연 시스템에서의 불확실성 추정을 갖는 슬라이딩 모드제어 (Sliding Mode Control with Uncertainty Adaptation for Uncertain Input-Delay Systems)

  • 노영훈;오준호
    • 제어로봇시스템학회논문지
    • /
    • 제6권11호
    • /
    • pp.963-967
    • /
    • 2000
  • This paper deals with a sliding mode control with uncertainty adaptation for the robust stabilization of input-delay systems with unknown uncertainties. A sliding surface including a state predictor is employed to compensate for the effect of the input delay. The proposed method does not need a priori knowledge of upper bounds on the norm of uncertainties, but estimates those upper bounds by adaptation laws based on the sliding surface. Then, a robust control law with the uncertainty adaptation is derived to ensure the existence of the sliding mode. A numerical example is given to illustrate the design procedure.

  • PDF

A CLASS OF COMPLETELY MONOTONIC FUNCTIONS INVOLVING DIVIDED DIFFERENCES OF THE PSI AND TRI-GAMMA FUNCTIONS AND SOME APPLICATIONS

  • Guo, Bai-Ni;Qi, Feng
    • 대한수학회지
    • /
    • 제48권3호
    • /
    • pp.655-667
    • /
    • 2011
  • A class of functions involving divided differences of the psi and tri-gamma functions and originating from Kershaw's double inequality are proved to be completely monotonic. As applications of these results, the monotonicity and convexity of a function involving the ratio of two gamma functions and originating from the establishment of the best upper and lower bounds in Kershaw's double inequality are derived, two sharp double inequalities involving ratios of double factorials are recovered, the probability integral or error function is estimated, a double inequality for ratio of the volumes of the unit balls in $\mathbb{R}^{n-1}$ and $\mathbb{R}^n$ respectively is deduced, and a symmetrical upper and lower bounds for the gamma function in terms of the psi function is generalized.

BLOW-UP TIME AND BLOW-UP RATE FOR PSEUDO-PARABOLIC EQUATIONS WITH WEIGHTED SOURCE

  • Di, Huafei;Shang, Yadong
    • 대한수학회논문집
    • /
    • 제35권4호
    • /
    • pp.1143-1158
    • /
    • 2020
  • In this paper, we are concerned with the blow-up phenomena for a class of pseudo-parabolic equations with weighted source ut - △u - △ut = a(x)f(u) subject to Dirichlet (or Neumann) boundary conditions in any smooth bounded domain Ω ⊂ ℝn (n ≥ 1). Firstly, we obtain the upper and lower bounds for blow-up time of solutions to these problems. Moreover, we also give the estimates of blow-up rate of solutions under some suitable conditions. Finally, three models are presented to illustrate our main results. In some special cases, we can even get some exact values of blow-up time and blow-up rate.

Capacity Bound for Discrete Memoryless User-Relaying Channel

  • Moon, Ki-Ryang;Yoo, Do-Sik;Oh, Seong-Jun
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제6권3호
    • /
    • pp.855-868
    • /
    • 2012
  • In this paper, we consider the discrete memoryless user relaying channel (DMURC) in which a user-relay switches its operational mode symbol-by-symbol. In particular, we obtain upper and lower bounds on the channel capacity for the general DMURC and then show that these the upper and lower bounds coincide for degraded DMURC. It is also shown that the capacity of the degraded DMURC can be achieved using two separate codebooks corresponding to the two UR states. While the UR is assumed to switch states symbol-by-symbol, the results in this paper is the same as when the UR switches states packet-by-packet.

이동통신 채널에서의 RS/trellis 연접 부호변조 시스템의 비트오율 해석 (An analysis of bit error probability of RS/trellis concatenated coded-modulation systems for mobile radio channel)

  • 김왕길;이상곤;문상재
    • 한국통신학회논문지
    • /
    • 제21권6호
    • /
    • pp.1546-1553
    • /
    • 1996
  • The bit error probability of RS/trellis concatenated coded-modualtion system in the mobile radio channel is analyzed. A new upper bound to the symbol error probability of the inner TCM in the mobile radio channel is obtained by exploiting the unequal symbol error probability of the TCM. This bound is applied to the derivation of the upper bound to the bit error probability of the concatenated coded-modulation system. An efficient way of searching distance spectrum of the TCM in mobile radio channel is devised. Our new bounds are tighter than the earlier studied other bounds.

  • PDF

A simple plane-strain solution for functionally graded multilayered isotropic cylinders

  • Pan, E.;Roy, A.K.
    • Structural Engineering and Mechanics
    • /
    • 제24권6호
    • /
    • pp.727-740
    • /
    • 2006
  • A simple plane-strain solution is derived in this paper for the functionally graded multilayered isotropic elastic cylinder under static deformation. The solution is obtained using method of separation of variables and is expressed in terms of the summation of the Fourier series in the circumferential direction. While the solution for order n = 0 corresponds to the axisymmetric deformation, that for n = 2 includes the special deformation frequently utilized in the upper and lower bounds analysis. Numerical results for a three-phase cylinder with a middle functionally graded layer are presented for both axisymmetric (n = 0) and general (n = 2) deformations, under either the traction or displacement boundary conditions on the surface of the layered cylinder. The solution to the general deformation case (n = 2) is further utilized for the first time to find the upper and lower bounds of the effective shear modulus of the layered cylinder with a functionally graded middle layer. These results could be useful in the future study of cylindrical composites where FGMs and/or multilayers are involved.

구조적 파라미터 불확실성을 갖는 안정한 선형계에 대한 강인 포화 제어기 (Robust Saturation Controller for the Stable LTI System with Structured Real Parameter Uncertainties)

  • 임채욱;박영진;문석준;박윤식
    • 제어로봇시스템학회논문지
    • /
    • 제12권6호
    • /
    • pp.517-523
    • /
    • 2006
  • This paper is focused on a robust saturation controller for the stable linear time-invariant (LTI) system involving both actuator's saturation and structured real parameter uncertainties. Based on affine quadratic stability and multi-convexity concept, a robust saturation controller is newly proposed and the linear matrix inequality (LMI)-based sufficient existence conditions for this controller are presented. The controller suggested in this paper can analytically prescribe the lower and upper bounds of parameter uncertainties, and guarantee the closed-loop robust stability of the system in the presence of actuator's saturation. Through numerical simulations, it is confirmed that the proposed robust saturation controller is robustly stable with respect to parameter uncertainties over the prescribed range defined by the lower and upper bounds.

Improved Upper Bounds on Low Density Parity Check Codes Performance for the Input Binary AWGN Channel

  • Yu Yi;Lee, Moon-Ho
    • 대한전자공학회:학술대회논문집
    • /
    • 대한전자공학회 2002년도 하계종합학술대회 논문집(1)
    • /
    • pp.323-326
    • /
    • 2002
  • In this paper, we study the improved bounds on the performance of low-density parity-check (LDPC) codes over binary-input additive white Gaussian noise (AWGN) channels with belief propagation (BP) decoding in log domain. We define an extended Gallager ensemble based on a new method of constructing parity check matrix and make use of this way to improve upper bound of LDPC codes. At the same time, many simulation results are presented in this paper. These results indicate the extended Gallager ensembles based on Hamming codes have typical minimum distance ratio, which is very close to the asymptotic Gilbert Varshamov bound and the superior performance which is better than the original Gallager ensembles.

  • PDF

NOTE ON THE NEGATIVE DECISION NUMBER IN DIGRAPHS

  • Kim, Hye Kyung
    • East Asian mathematical journal
    • /
    • 제30권3호
    • /
    • pp.355-360
    • /
    • 2014
  • Let D be a finite digraph with the vertex set V (D) and the arc set A(D). A function f : $V(D){\rightarrow}\{-1,\;1\}$ defined on the vertices of a digraph D is called a bad function if $f(N^-(v)){\leq}1$ for every v in D. The weight of a bad function is $f(V(D))=\sum\limits_{v{\in}V(D)}f(v)$. The maximum weight of a bad function of D is the the negative decision number ${\beta}_D(D)$ of D. Wang [4] studied several sharp upper bounds of this number for an undirected graph. In this paper, we study sharp upper bounds of the negative decision number ${\beta}_D(D)$ of for a digraph D.