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

• Honam Mathematical Journal
• /
• v.36 no.2
• /
• pp.291-303
• /
• 2014

In this paper, through a direct computation with subintervals partitioning [0, 1], we compute better a posteriori bounds for the average case error of the difference between the true value of $I(f)=\int_{0}^{1}f(x)dx$ with $f{\in}C^r$[0, 1] minus the composite trapezoidal rule and the composite trapezoidal rule minus the basic trapezoidal rule for $r{\geq}3$ by using zero mean-Gaussian.

• 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}$).

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.31 no.12C
• /
• pp.1150-1156
• /
• 2006

In this paper we derive some lower bounds on the linear complexity and upper bounds on the 1-error linear complexity over $F_p$ of M-ary Sidel'nikov sequences of period $p^m-1$ when $M\geq3$ and $p\equiv{\pm}1$ mod M. In particular, we exactly compute the 1-error linear complexity of ternary Sidel'nikov sequences when $p^m-1$ and $m\geq4$. Based on these bounds we present the asymptotic behavior of the normalized linear complexity and the normalized 1-error linear complexity with respect to the period.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.37 no.2B
• /
• pp.87-96
• /
• 2012

In this paper, we consider a 2-hop relay system where both the relay and destination nodes suffer from the arbitrary number of co-channel interferers. More specifically, assuming that the relay and access channels as well as interference channels are all subject to Rayleigh fading, we derive an exact closed-form expression for outage probability of the amplify-and-forward (AF) relay system, and furthermore compute its upper and lower bounds. Based on these bounds, we derive the upper and lower bounds on the average bit error rate (BER) of the AF relay system. We also confirm the accuracy of our derivation by investigating the performance gap between the performance bounds under consideration and simulation results.

• Journal of the Society of Naval Architects of Korea
• /
• v.40 no.5
• /
• pp.1-9
• /
• 2003

To predict the powering performance of full scale ships from the towing tank tests, resistance, propeller open water and self-propulsion tests are conducted. Model tests inevitably include the experimental error defined as the sum of two types of uncertainties, bias and precision errors. The induced errors in each element of model test are propagated through various routes and correlated with one another. The correlation coefficients are very important in the uncertainty analysis. The coefficient gives a direction(increase or decrease) for a value of error in individual elements. If the coefficient is not used accurately, the error bounds of the individual elements are overestimated or underestimated. In this study, the new methodology is applied to the uncertainty analysis of HMRI's towing tank tests, thus error bounds of each element is suggested and verified by several repetitive experiments.

• Journal of the Korean Institute of Telematics and Electronics A
• /
• v.31A no.9
• /
• pp.34-43
• /
• 1994

The unequal symbol error probability of TCM(trellis coded modulation) is analyzed and applied to the derivation of bit error probability of /RS/Trellis concatenated coded-modulation system. An upper bound of the symbol error probability of TCM concatenated with RS code is obtained by exploiting the unequal symbol error probability of TCM, and it is applied to the derivation of the upper bound of the bit error probability of the RS/Trellis concatenated coded-modulation system. Our upper bounds of the concatenated codes are tighter than the earlier established other upper bounds.

• Journal of applied mathematics & informatics
• /
• v.20 no.1_2
• /
• pp.157-169
• /
• 2006

We study properties concerning approximation of fuzzy-number-valued functions by fuzzy B-spline series. Error bounds in approximation by fuzzy B-spine series are obtained in terms of the modulus of continuity. Particularly simple error bounds are obtained for fuzzy splines of Schoenberg type. We compare fuzzy B-spline series with existing fuzzy concepts of splines.

• Journal of the Korean Society for Precision Engineering
• /
• v.15 no.5
• /
• pp.120-127
• /
• 1998

Differential inequalities occurring in problems of obstacle contact problems are recast into variational inequalities and analyzed by finite element methods. A new a posteriori error estimator, which is essential in adaptive finite element method, is introduced to capture the errors in finite element approximations of these variational inequalities. In order to construct a posteriori error estimates, saddle point problems are introduced using Lagrange parameters and upper bounds are provided. The global upper bound is localized by a special mixed formulation, which leads to upper bounds of the element errors. A numerical experiment is performed on an obstacle contact problem to check the effectivity index both in a local and a global sense.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.21 no.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.