• Journal of the Chungcheong Mathematical Society
• /
• v.5 no.1
• /
• pp.111-121
• /
• 1992

A new method(EVF method) is applied to get lower bounds to frequencies of rotating uniform beams which are clamped or simply supported at one end and free at the other. For the upper bounds, the Rayleigh-Ritz method is employed. Numerical results are presented.

• Journal of applied mathematics & informatics
• /
• v.4 no.1
• /
• pp.211-222
• /
• 1997

In this paper we present a probabilistic approach for the estimation of realistic error bounds appearing in the execution of basic algebraic floating point operations. Experimental results are carried out for the extended product the extended sum the inner product of random normalised numbers the product of random normalised ma-trices and the solution of lower triangular systems The ordinary and probabilistic bounds are calculated for all the above processes and gen-erally in all the executed examples the probabilistic bounds are much more realistic.

• 제어로봇시스템학회:학술대회논문집
• /
• 1986.10a
• /
• pp.68-72
• /
• 1986

Upper bounds of the perturbed Co-semigroups of the infinite dimensional systems are investigated by using the algebraic Riccati equation(ARE). In the case that the solution P of the ARE is strictly positive, the perturbed semigroups are uniformly bounded. A sufficient condition for the solution P to be strictly positive is provided. The uniform boundedness plays an important role in extending approximately weak stability to weak stability on th whole space. Exponential Stability of the perturbed semigroups is studied by using the Young's inequlity. Some further discussions on the uniform boundedness of the perturbed semigroups are given.

• Journal of applied mathematics & informatics
• /
• v.22 no.1_2
• /
• pp.49-65
• /
• 2006

A robust numerical method for a singularly perturbed second-order ordinary differential equation having two parameters with a discontinuous source term is presented in this article. Theoretical bounds are derived for the derivatives of the solution and its smooth and singular components. An appropriate piecewise uniform mesh is constructed, and classical upwind finite difference schemes are used on this mesh to obtain the discrete system of equations. Parameter-uniform error bounds for the numerical approximations are established. Numerical results are provided to illustrate the convergence of the numerical approximations.

• ETRI Journal
• /
• v.32 no.6
• /
• pp.972-975
• /
• 2010

In this letter, we consider the lossy coding of a non-uniform binary source based on GF(q)-quantized low-density generator matrix (LDGM) codes with check degree $d_c$=2. By quantizing the GF(q) LDGM codeword, a non-uniform binary codeword can be obtained, which is suitable for direct quantization of the non-uniform binary source. Encoding is performed by reinforced belief propagation, a variant of belief propagation. Simulation results show that the performance of our method is quite close to the theoretic rate-distortion bounds. For example, when the GF(16)-LDGM code with a rate of 0.4 and block-length of 1,500 is used to compress the non-uniform binary source with probability of 1 being 0.23, the distortion is 0.091, which is very close to the optimal theoretical value of 0.074.

• Journal of Communications and Networks
• /
• v.10 no.1
• /
• pp.5-9
• /
• 2008

Researchers have investigated many upper bound techniques applicable to error probabilities on the maximum likelihood (ML) decoding performance of turbo-like codes and low density parity check (LDPC) codes in recent years for a long codeword block size. This is because it is trivial for a short codeword block size. Previous research efforts, such as the simple bound technique [20] recently proposed, developed upper bounds for LDPC codes and turbo-like codes using ensemble codes or the uniformly interleaved assumption. This assumption bounds the performance averaged over all ensemble codes or all interleavers. Another previous research effort [21] obtained the upper bound of turbo-like code with a particular interleaver using a truncated union bound which requires information of the minimum Hamming distance and the number of codewords with the minimum Hamming distance. However, it gives the reliable bound only in the region of the error floor where the minimum Hamming distance is dominant, i.e., in the region of high signal-to-noise ratios. Therefore, currently an upper bound on ML decoding performance for turbo-like code with a particular interleaver and LDPC code with a particular parity check matrix cannot be calculated because of heavy complexity so that only average bounds for ensemble codes can be obtained using a uniform interleaver assumption. In this paper, we propose a new bound technique on ML decoding performance for turbo-like code with a particular interleaver and LDPC code with a particular parity check matrix using ML estimated weight distributions and we also show that the practical iterative decoding performance is approximately suboptimal in ML sense because the simulation performance of iterative decoding is worse than the proposed upper bound and no wonder, even worse than ML decoding performance. In order to show this point, we compare the simulation results with the proposed upper bound and previous bounds. The proposed bound technique is based on the simple bound with an approximate weight distribution including several exact smallest distance terms, not with the ensemble distribution or the uniform interleaver assumption. This technique also shows a tighter upper bound than any other previous bound techniques for turbo-like code with a particular interleaver and LDPC code with a particular parity check matrix.

• Proceedings of the KIEE Conference
• /
• 1991.07a
• /
• pp.678-681
• /
• 1991

In this paper, we propose a robust linear time-invariant feedback compensator design methodology for multivariable system which have both matched and mismatched uncertainties. In order to attack the problem of designing robust compensators guaranteeing uniform ultimate boundedness of every closed-loop system response within an arbitrarily small ball centered at the zero state based solely on the knowledge of the upper norm-bounds of uncertainties, we use an approach based upon the comparison theorem which is an effective approach in studying augmented feedback control systems with both mismatched and matched uncertainties. Through the approach, we draw some sufficient conditions for robust stability, and we give a simple example.

• Journal of applied mathematics & informatics
• /
• v.28 no.1_2
• /
• pp.109-130
• /
• 2010

In this paper, a numerical method for a weakly coupled system of two singularly perturbed convection-diffusion second order ordinary differential equations with the mixed type boundary conditions is presented. Parameter-uniform error bounds for the numerical solution and also to numerical derivative are established. Numerical results are provided to illustrate the theoretical results.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.9 no.1
• /
• pp.126-148
• /
• 2015

Different from the existing works on coverage problems in wireless sensor networks (WSNs), this paper considers the exposure-path prevention problem by using the percolation theory in three dimensional (3D) WSNs, which can be implemented in intruder detecting applications. In this paper, to avoid the loose bounds of critical density, a bond percolation-based scheme is proposed to put the exposure-path problem into a 3D uniform lattice. Within this scheme, the tighter bonds of critical density for omnidirectional and directional sensor networks under random sensor deployment-a 3D Poisson process are derived. Extensive simulation results show that our scheme generates tighter bounds of critical density with no exposure path in 3D WSNs.

• International Journal of Concrete Structures and Materials
• /
• v.3 no.1
• /
• pp.47-56
• /
• 2009

The first diagonal cracking and ultimate shear load of reinforced girder made of ultra high performance fiber reinforced concrete (UHPFRC) were investigated in this paper. Eleven girders were tested in which eight girders failed in shear. A simplified formulation for the first diagonal cracking load was proposed. An analytical model to predict the ultimate shear load was formulated based on the two bounds theory. A fiber reinforcing parameter was constituted based on the random assumption of steel fiber uniform distribution. The predicted values were compared with the conventional predictions and the test results. The proposed equation can be used for the first cracking status analysis, while the proposed equations for computing the ultimate shear strength can be used for the ultimate failure status analysis, which can also be utilized for numerical limit analysis of reinforced UHPFRC girder. The established fiber reinforcing theoretical model can also be a reference for micro-mechanics analysis of UHPFRC.