• Journal of the Korean Operations Research and Management Science Society
• /
• v.23 no.2
• /
• pp.1-13
• /
• 1998

The purpose of this paper is to formulate the three-dimensional loading problem and to develop an exact algorithm. The three-dimensional loading problem is not only to load as many boxes as possible, but also to ensure load stability. In this Paper, we propose formulation by zero-one integer programming. Further we propose as an algorithm the branch-and-bound enforced by efficient bounding criteria. As an upper bound, we use the solution of the Lagrangean relaxation problem which relaxes constraints of zero-one IP, and as a lower bound, we use a heuristic solution induced by the solution of the Lagrangean relaxation problem. Last, we show computational experiments on convergency of upper and lower bounds.

• Communications for Statistical Applications and Methods
• /
• v.6 no.2
• /
• pp.443-456
• /
• 1999

The estimation of mean lifetimes in presence of interval censoring with mixed replacement procedure are examined when the distribution s of lifetimes are exponential. it is assumed that due to physical restrictions and/or economic constraints the number of failures is investigated only at several inspection times during the lifetime test; thus there is interval censoring. Comparisons of mixed replacement designs are made with those with and without replacement The maximum likelihood estimator is found in an implicit form. The Cramer-Rao lower bound which is the asymptotic variance of the estimator is derived. The test conditions for minimizing the Cramer-Rao lower bound and minimizing the test costs within a desired width of the Cramer-Rao bound have been studied.

• 제어로봇시스템학회:학술대회논문집
• /
• 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 KIISE:Computer Systems and Theory
• /
• v.32 no.10
• /
• pp.499-506
• /
• 2005

The growth of networks increase the importance of electronic commerces. Since the fair exchange protocol is an important part of electronic commerces, a number of researches have been done in relation to the fair exchange protocol. As the contract signing protocol is a part of fair exchange protocol, many protocols have been proposed, but most of them were focused on two-party protocol. Only a few were on the multi-party contract signing protocol. So far the optimistic multi-party contract signing protocol presented by Baum-Waidner has the least number of rounds in asynchronous network[4]. But, the lower bound on the number of rounds required by any optimistic multi-party contract signing protocol has been not known. In this paper, we present a tight lower bound on the number of rounds for optimistic multi-party contract signing protocol.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.45 no.6
• /
• pp.27-33
• /
• 2008

Given a polynomial ${\hbar}(x){\in}F_q[x]$ of degree h, it is an important problem to determine the size of multiplicative subgroup of $\(F_q[x]/({\hbar(x))\)*$ generated by $x-s_1,\;x-s_2,\;{\cdots},\;x-s_n$, where $\{s_1,\;s_2,\;{\cdots},\;s_n\}{\sebseteq}F_q$, and for all ${\hbar}(x){\neq}0$. So far the best known asymptotic lower bound is $(rh)^{O(1)}\(2er+O(\frac{1}{r})\)^h$, where $r=\frac{n}{h}$ and e(=2.718...) is the base of natural logarithm. In this paper, we exploit the coding theory connection of this problem and prove a better lower bound $(rh)^{O(1)}\(2er+{\frac{e}{2}}{\log}r-{\frac{e}{2}}{\log}{\frac{e}{2}}+O{(\frac{{\log}^2r}{r})}\)^h$, where log stands for natural logarithm We also discuss about the limitation of this approach.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.44 no.5
• /
• pp.40-46
• /
• 2007

In this paper, the effect of a Doppler Spread caused by a mobile station (MS) is analyzed for transparent mobile multi-hop relays (MMR) systems based on orthogonal frequency division multiplexing (OFDM). The exact expression of interchannel interference (ICI) power and the upper bounds of ICI power are derived for OFDM systems with cooperative MMR or non-coopeartive throughput enhancement (TE) MMR. Also, the exact signal-to-interference ratio (SIR) and its lower bound as well as ICI power and its upper bound, derived in this paper, are evaluated by computer simulation with the OFDM parameter set used for mobile WiMax (WiBro) systems.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.9 no.7
• /
• pp.2371-2388
• /
• 2015

In this paper, we investigate the performance evaluation of three dimensional (3D) multiple-input multiple-output (MIMO) systems with an adjustable base station (BS) antenna tilt angle and zero-forcing (ZF) receivers in Ricean/Lognormal fading channels. In particular, we take the lognormal shadow fading, 3D antenna gain with antenna tilt angle and path-loss into account. First, we derive a closed-form lower bound on the sum rate, then we obtain the optimal BS antenna tilt angle based on the derived lower bound, and finally we present linear approximations for the sum rate in high and low-SNR regimes, respectively. Based on our analytical results, we gain valuable insights into the impact of key system parameters, such as the BS antenna tilt angle, the Ricean K-factor and the radius of cell, on the sum rate performance of 3D MIMO with ZF receivers.

• Transactions of the Korean Society of Mechanical Engineers
• /
• v.14 no.6
• /
• pp.1382-1390
• /
• 1990

Accurate load-carrying capacities and moment distributions of thin circular plates are obtained for clamped or simply-supported boundary condition under various concentrated circular loadings. The material is regarded as perfectly-plastic based on an arbitrary yield function such as the Tresca yield function, the Johansen yield function, and the farmily of .betha.-norms which possesses the von Mises yield function and the Frobenius norm. To obtain the lower bound solutions, a maximization formulation is derived and implemented for efficient numerical calculation with a finite difference method and the modified Newton's method. The numerical results demonstrate plastic collapse behavior of circular plates and provide their design criteria.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.22 no.1
• /
• pp.101-121
• /
• 1997

Consider a Jackson type closed queueing network in which each queue has a single exponential server. Assume that N customers are moving among .kappa. queues. We propose a candidata procedure which yields a lower bound of the network throughput which is sharper than those which are currently available : Let (.rho.$_{1}$, ... .rho.$_{\kappa}$) be the loading vector, let x be a real number with 0 .leq. x .leq. N, and let y(x) denote that y is a function of x and be the unique positive solution of the equation. .sum.$_{i = 1}$$^{\kappa}$y(x) .rho.$_{i}$ (N - y(x) x $p_{i}$ ) = 1 Whitt [17] has shown that y(N) is a lower bound for the throughput. In this paper, we present evidence that y(N -1) is also a lower bound. In dosing so, we are led to formulate a rather general conjecture on 'quot;Migrating Critical Points'quot; (MCP). The .MCP. conjecture asserts that zeros of successive derivatives of certain rational functions migrate at an accelerating rate. We provide a proof of MCP in the polynomial case and some other special cases, including that in which the rational function has exactly two real poles and fewer than three real zeros.tion has exactly two real poles and fewer than three real zeros.

• Journal of Advanced Navigation Technology
• /
• v.15 no.2
• /
• pp.234-240
• /
• 2011

In this paper, the performances of Cram$\acute{e}$r-Rao Lower Bound (CRLB) with Frequency Difference of Arrival (FDOA) measurements for Unmanned Aerial Vehicle (UAV) tracking are investigated. We focus on two cases: the influence on CRLB with FDOA measurements collected by time, and random distribution of Ground Stations (GSs). We derived the performance by gauging the size of CRLB through Complementary Cumulative Distribution Function (CCDF). From the simulation results, broader distribution of GSs and FDOA measurements by longer time bring about better performance.