• Communications of the Korean Mathematical Society
• /
• v.20 no.2
• /
• pp.405-409
• /
• 2005

In [1], Sharma and Goel obtained a bound for random error correcting codes with Lee weight considerations. The purpose of this paper is to first point out a discrepancy in this result and then give a correct version of the same, improving upon the bound tremendously.

• International Journal of CAD/CAM
• /
• v.4 no.1
• /
• pp.11-17
• /
• 2004

In this paper, an exponential bound of the distance between a Loop subdivision surface and its control mesh is derived based on the topological structure of the control mesh. The exponential bound is independent of the process of recursive subdivisions and can be evaluated without subdividing the control mesh actually. Using the exponential bound, we can predict the depth of recursion within a user-specified tolerance as well as the error bound after n steps of subdivision. The error-estimating approach can be used in many engineering applications such as surface/surface intersection, mesh generation, NC machining, surface rendering and the like.

• Bulletin of the Korean Mathematical Society
• /
• v.30 no.2
• /
• pp.229-238
• /
• 1993

Let M be an n-dimensional compact Riemannian manifold with boundary .part.M. We consider the Neumann eigenvalue problem on M of the equation (Fig.) where .upsilon. is the unit outward normal vector to the boundary .part.M. due to the importance of Poincare inequality for analysis on manifolds, one wishes to obtain the lower bound of the first non-zero eigenvalue .eta.$_{1}$ of (1.1). For the purpose of applications, it is important to relax the dependency of the lower bound on the geometric quantities. For general compact manifolds with convex boundary, Li-Yau [3] obtained the lower bound of .eta.$_{1}$. Recently, Roger Chen [1] investigated the lower bound of the first Neumann eigenvalue .eta.$_{1}$ on compact manifold M with nonconvex boundary. We investigate the lower bound .eta.$_{1}$ with the same conditions as those of Roger chen. But, using the different auxiliary function, we have the following theorem.

• ETRI Journal
• /
• v.15 no.3
• /
• pp.35-45
• /
• 1994

In this paper we develop an approximation formalism on the queue length distribution for general queueing models. Our formalism is based on two steps of approximation; the first step is to find a lower bound on the exact formula, and subsequently the Chernoff upper bound technique is applied to this lower bound. We demonstrate that for the M/M/1 model our formula is equivalent to the exact solution. For the D/M/1 queue, we find an extremely tight lower bound below the exact formula. On the other hand, our approach shows a tight upper bound on the exact distribution for both the ND/D/1 and M/D/1 queues. We also consider the $M+{\Sigma}N_jD/D/1$ queue and compare our formula with other formalisms for the $M+{\Sigma}N_jD/D/1$ and M+D/D/1 queues.

• 제어로봇시스템학회:학술대회논문집
• /
• 2004.08a
• /
• pp.429-432
• /
• 2004

In this paper, we derive the guaranteed bound of the horizon size for the stabilizing receding horizon control(RHC). From the convergence property of the solution to the Riccati equation, it is shown that the lower bound can be represented in terms of the parameters in the given system model, which makes an off-line calculation possible. Additionally, it is shown to be able to obtain the stabilizing RHC without respect to the final weighting matrix. The proposed guaranteed bound is obtained numerically via simulation.

• Journal of the Korean Society for Precision Engineering
• /
• v.21 no.12
• /
• pp.133-139
• /
• 2004

In general, the contact pressure to the die cannot be easily determined by using upper bound solution. Recently, the authors have proposed the method determining the contact pressure with the upper bound solution for the forming with the plane stain plastic deformation. In this paper, the method is applied to an axisymmetric forward extrusion process. The contact pressure to the die of the axisymmetric extrusion has been determined with the upper bound solution and compared with the result of rigid plastic FEM. The optimal semi-angles of die have been obtained minimizing the relative contact pressure to die fur the extrusion ratio.

• Industrial Engineering and Management Systems
• /
• v.3 no.2
• /
• pp.100-115
• /
• 2004

The network representation and branch and bound algorithm with efficient lower and upper bounding procedures are developed to determine a global optimal production schedule on a machine that minimizes sequence-dependent setup cost and earliness/tardiness penalties. Lower bounds are obtained based on heuristic and Lagrangian relaxation. Priority dispatching rule with local improvement procedure is used to derive an initial upper bound. Two dominance criteria are incorporated in a branch and bound procedure to reduce the search space and enhance computational efficiency. The computational results indicate that the proposed procedure could optimally solve the problem with up to 40 jobs in a reasonable time using a personal computer.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.8 no.10
• /
• pp.3557-3571
• /
• 2014

We develop a secret key generation scheme using phase estimation in ultra-wideband (UWB) wireless fading channels. Based on the reciprocity theorem, two terminals extract the phase of the channel as a common random source to generate secret bits. Moreover, we study the secret key rate by a pair of nodes observing correlated sources and communicating to achieve secret key agreement over public communication channels. As our main results, we establish a more practical upper bound from Cramer-Rao bound (CRB) and compare it with a universally theoretical upper bound on the shared maximum key rate from mutual information of correlated random sources. Derivation and numerical examples are presented to demonstrate the bound. Simulation studies are also provided to validate feasibility and efficiency of the proposed scheme.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.22 no.3
• /
• pp.81-98
• /
• 1997

Given a rooted tree T with profits and node demands, the capacitated subtree of a tree problem (GSTP) consists of finding a rooted subtree of maximum profit, subject to having total demand no larger than the given capacity H. We first define the so-called critical item for CSTP and find an upper bound on the optimal value of CSTP in O(n$^{2}$) time, where n is the number of nodes in T. We then present our branch and bound algorithm for solving CSTP and illustrate the algiruthm by using an example. Finally, we implement our branch-and-bound algorithm and compare the computational results with those for both CPLEX and a dynamic programming algorithm. The comparison shows that our branch-and-bound algorithm performs much better than both CPLEX and the dynamic programming algorithm, where n and H are the range of [50, 500] and [5000, 10000], respectively.

• 제어로봇시스템학회:학술대회논문집
• /
• 2005.06a
• /
• pp.1249-1253
• /
• 2005

This paper presents a method to model the path loss characteristics in microwave urban line-of-sight (LOS) propagation. We propose new upper- and lower-bound models for the LOS path loss using fuzzy linear regression (FLR). The spread of upper- and lower-bound of FLR depends on max and min value of a sample path loss data while the conventional upper- and lower-bound models, the spread of the bound intervals are fixed and do not depend on the sample path loss data. Comparison of our models to conventional upper- and lower-bound models indicate that improvements in accuracy over the conventional models are achieved.