• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.7C
• /
• pp.594-597
• /
• 2010

This paper estimates belief-propagation (BP) decoding performance of moderate-length irregular low-density parity-check (LDPC) codes with sphere bounds. We note that for moderate-length($10^3{\leq}N{\leq}4\times10^3$) irregular LDPC codes, BP decoding performance, which is much worse than maximum likelihood (ML) decoding performance, is well matched with one of loose upper bounds, i.e., sphere bounds. We introduce the sphere bounding technique for particular codes, not average bounds. The sphere bounding estimation technique is validated by simulation results. It is also shown that sphere bounds and BP decoding performance of irregular LDPC codes are very close at bit-error-rates (BERs) $P_b$ of practical importance($10^{-5}{\leq}P_b{\leq}10^{-4}$).

• 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.

• 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.

• 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.

• Communications of the Korean Mathematical Society
• /
• v.12 no.2
• /
• pp.393-401
• /
• 1997

Let $A_1,A_2,\cdots,A_m$ and $B_1,B_2,\cdots,B_n$ be two sequences of events on a given probability space. Let $X_m$ and $Y_n$, respectively, be the number of those $A_i$ and $B_j$, which occur we establish new upper and lower bounds on the probability $P(X=r, Y=t)$ which improve upper bounds and classical lower bounds in terms of the bivariate binomial moment $S_{r,t},S_{r+1,t},S_{r,t+1}$ and $S_{r+1,t+1}$.

• 제어로봇시스템학회:학술대회논문집
• /
• 1991.10a
• /
• pp.52-54
• /
• 1991

In this paper, the robust stability, and the quadratic performance of linear uncertain systems are studied. A quadratic Lyapunov function candidate with time-varying matrix is derived to provide robust stability bounds. Also upper bounds of a quadratic performance is given under the assumption that the uncertain system is stable. Both the robust stability bounds and the upper bounds of a quadratic performance are obtained as solutions of a class of modified Lyapunov equations.

• Geomechanics and Engineering
• /
• v.11 no.4
• /
• pp.587-605
• /
• 2016

This study aimed to develop upper and lower bounds to predict the tunnel support pressure under the pile tip during the circular tunnel excavation. Most previous studies on the upper and lower bound methods were carried out for the single ground structures, e.g., retaining wall, foundation, ground anchor and tunnel, in the homogeneous ground conditions, since the pile-soil-tunnel interaction problem is very complicated and sophisticated to solve using those bound methods. Therefore, in the lower bound approach two appropriate stress fields were proposed for single pile and tunnel respectively, and then they were superimposed. In addition, based on the superimposition several failure mechanisms were proposed for the upper bound solution. Finally, these upper bound mechanisms were examined by shear strain data from the laboratory model test and numerical analysis using finite element method.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.24 no.62
• /
• pp.21-32
• /
• 2001

The two-dimensional guillotine cutting problem is to maximize sum of piece profits that cut from one stock rectangle and widely applied in the industry. The branch-and-bound method for this problem uses complementarily several upper bounds(the Gilmore and Gomoryp[8]'s two-dimensional knapsack function and the Hifi and Zissimopoulos[10]'s method using one-dimensional knapsack problem, etc) to reduce the number of searched nodes. These upper bounds has a shortcoming that does not consider the bound and layout of pieces simultaneously. In this paper, we propose an efficient upper bound which can complement the shortcoming of existing upper bounds. The proposed upper bound needs less memory spaces and computing time. Computational results show that the proposed upper bound significantly contribute to reduce the computational amount of time and number of searched nodes in tree.

• East Asian mathematical journal
• /
• v.18 no.2
• /
• pp.163-173
• /
• 2002

In this paper an inequality of Ostrowski type in terms of the lower and upper bounds of the first derivative is found.

• Journal of Institute of Control, Robotics and Systems
• /
• v.1 no.1
• /
• pp.20-24
• /
• 1995

In this paper we analyze the performance bounds of the optimal FIR filter in continuous time systems with modeling uncertainty. The performance bounds are presented by the estimation error convariance and they are here expressed by the upper bounds of the difference of the estimation error covariance between the real and nominal values in case of the system with model uncertainties whose upper bounds are imperfrctly known a priori. The performance bounds of the optimal FIR filter are compared with those of the Kalman filter via a numerical example applied to the estimation of the motion of an aircraft carrier at sea, which shows the former has better performances than the latter.