• 제목/요약/키워드: lower bounds

검색결과 376건 처리시간 0.026초

FTTH-PON 가입자망 설계에서 Splitter Location-Allocation 문제 (A Splitter Location-Allocation Problem in Designing FTTH-PON Access Networks)

  • 박찬우;이영호;한정희
    • 한국경영과학회지
    • /
    • 제36권2호
    • /
    • pp.1-14
    • /
    • 2011
  • In this paper, we deal with an access network design problem of fiber-to-the-home passive optical network (FTTH-PON). The FTTH-PON network design problem seeks to minimize the total cost of optical splitters and cables that provide optical connectivity between central office and subscribers. We develop a flow-based mixed integer programming (MIP) model with nonlinear link cost. By developing valid inequalities and preprocessing rules, we enhance the strength of the proposed MIP model in generating tight lower bounds for the problem. We develop an effective Tabu Search (TS) heuristic algorithm that provides good quality feasible solutions to the problem. Computational results demonstrate that the valid inequalities and preprocessing rules are effective for improving the LP-relaxation lower bound and TS algorithm finds good quality solutions within reasonable time bounds.

하한을 이용한 효율적인 최소차수순서화 (An Efficient Minimum Degree Ordering Method Using the Lower Bounds of Degrees)

  • 박찬규;박순달
    • 한국경영과학회지
    • /
    • 제23권4호
    • /
    • pp.21-31
    • /
    • 1998
  • Ordering is used to reduce the amount of fill-ins in the Cholesky factor of an symmetric definite matrix. One of most efficient ordering methods is the minimum degree ordering method. In this paper. we propose the two techniques to improve the performance of the minimum degree ordering which are implemented using clique storage structure. One is node absorption which is a generalized version of clique absorption. The other technique is using the lower bounds of degree to suspend the degree updates of nodes. finally, we provide computational results on the problems on NETLIB. These results show that the proposed techniques reduce the number of degree updates and the computational time considerably.

  • PDF

Outage Analysis and Power Allocation for Distributed Space-Time Coding-Based Cooperative Systems over Rayleigh Fading Channels

  • Lee, In-Ho
    • Journal of information and communication convergence engineering
    • /
    • 제15권1호
    • /
    • pp.21-27
    • /
    • 2017
  • In this research, we study the outage probability for distributed space-time coding-based cooperative (DSTC) systems with amplify-and-forward relaying over Rayleigh fading channels with a high temporal correlation where the direct link between the source and the destination is available. In particular, we derive the upper and lower bounds of the outage probability as well as their corresponding asymptotic expressions. In addition, using only the average channel powers for the source-to-relay and relay-to-destination links, we propose an efficient power allocation scheme between the source and the relay to minimize the asymptotic upper bound of the outage probability. Through a numerical investigation, we verify the analytical expressions as well as the effectiveness of the proposed efficient power allocation. The numerical results show that the lower and upper bounds tightly correspond to the exact outage probability, and the proposed efficient power allocation scheme provides an outage probability similar to that of the optimal power allocation scheme that minimizes the exact outage probability.

조정가능한 M/G/1 대기모형에 Min(N, D)와 Max(N, D) 운용방침이 적용될 때 busy period 기대값의 상한과 하한 유도 (Derivations of Upper and Lower Bounds of the Expected Busy Periods for the Min(N, D) and Max(N, D) Operating Policies in a Controllable M/G/1 Queueing Model)

  • 이한교;오현승
    • 산업경영시스템학회지
    • /
    • 제32권3호
    • /
    • pp.71-77
    • /
    • 2009
  • Using the results of the expected busy periods for the dyadic Min(N, D) and Max(N, D) operating policies in a controllable M/G/1 queueing model, an important relation between them is derived. The derived relation represents the complementary property between two operating policies. This implies that it could be possible to obtained desired system characteristics for one of the two operating policies from the corresponding known system characteristics for the other policy. Then, upper and lower bounds of expected busy periods for both dyadic operating policies are also derived.

Rate Bounds for MIMO Relay Channels

  • Lo, Caleb K.;Vishwanath, Sriram;Heath, Jr., Robert W.
    • Journal of Communications and Networks
    • /
    • 제10권2호
    • /
    • pp.194-203
    • /
    • 2008
  • This paper considers the multi-input multi-output (MIMO) relay channel where multiple antennas are employed by each terminal. Compared to single-input single-output (SISO) relay channels, MIMO relay channels introduce additional degrees of freedom, making the design and analysis of optimal cooperative strategies more complex. In this paper, a partial cooperation strategy that combines transmit-side message splitting and block-Markov encoding is presented. Lower bounds on capacity that improve on a previously proposed non-cooperative lower bound are derived for Gaussian MIMO relay channels.

A CLASS OF COMPLETELY MONOTONIC FUNCTIONS INVOLVING DIVIDED DIFFERENCES OF THE PSI AND TRI-GAMMA FUNCTIONS AND SOME APPLICATIONS

  • Guo, Bai-Ni;Qi, Feng
    • 대한수학회지
    • /
    • 제48권3호
    • /
    • pp.655-667
    • /
    • 2011
  • A class of functions involving divided differences of the psi and tri-gamma functions and originating from Kershaw's double inequality are proved to be completely monotonic. As applications of these results, the monotonicity and convexity of a function involving the ratio of two gamma functions and originating from the establishment of the best upper and lower bounds in Kershaw's double inequality are derived, two sharp double inequalities involving ratios of double factorials are recovered, the probability integral or error function is estimated, a double inequality for ratio of the volumes of the unit balls in $\mathbb{R}^{n-1}$ and $\mathbb{R}^n$ respectively is deduced, and a symmetrical upper and lower bounds for the gamma function in terms of the psi function is generalized.

BLOW-UP TIME AND BLOW-UP RATE FOR PSEUDO-PARABOLIC EQUATIONS WITH WEIGHTED SOURCE

  • Di, Huafei;Shang, Yadong
    • 대한수학회논문집
    • /
    • 제35권4호
    • /
    • pp.1143-1158
    • /
    • 2020
  • In this paper, we are concerned with the blow-up phenomena for a class of pseudo-parabolic equations with weighted source ut - △u - △ut = a(x)f(u) subject to Dirichlet (or Neumann) boundary conditions in any smooth bounded domain Ω ⊂ ℝn (n ≥ 1). Firstly, we obtain the upper and lower bounds for blow-up time of solutions to these problems. Moreover, we also give the estimates of blow-up rate of solutions under some suitable conditions. Finally, three models are presented to illustrate our main results. In some special cases, we can even get some exact values of blow-up time and blow-up rate.

Capacity Bound for Discrete Memoryless User-Relaying Channel

  • Moon, Ki-Ryang;Yoo, Do-Sik;Oh, Seong-Jun
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제6권3호
    • /
    • pp.855-868
    • /
    • 2012
  • In this paper, we consider the discrete memoryless user relaying channel (DMURC) in which a user-relay switches its operational mode symbol-by-symbol. In particular, we obtain upper and lower bounds on the channel capacity for the general DMURC and then show that these the upper and lower bounds coincide for degraded DMURC. It is also shown that the capacity of the degraded DMURC can be achieved using two separate codebooks corresponding to the two UR states. While the UR is assumed to switch states symbol-by-symbol, the results in this paper is the same as when the UR switches states packet-by-packet.

A simple plane-strain solution for functionally graded multilayered isotropic cylinders

  • Pan, E.;Roy, A.K.
    • Structural Engineering and Mechanics
    • /
    • 제24권6호
    • /
    • pp.727-740
    • /
    • 2006
  • A simple plane-strain solution is derived in this paper for the functionally graded multilayered isotropic elastic cylinder under static deformation. The solution is obtained using method of separation of variables and is expressed in terms of the summation of the Fourier series in the circumferential direction. While the solution for order n = 0 corresponds to the axisymmetric deformation, that for n = 2 includes the special deformation frequently utilized in the upper and lower bounds analysis. Numerical results for a three-phase cylinder with a middle functionally graded layer are presented for both axisymmetric (n = 0) and general (n = 2) deformations, under either the traction or displacement boundary conditions on the surface of the layered cylinder. The solution to the general deformation case (n = 2) is further utilized for the first time to find the upper and lower bounds of the effective shear modulus of the layered cylinder with a functionally graded middle layer. These results could be useful in the future study of cylindrical composites where FGMs and/or multilayers are involved.

구조적 파라미터 불확실성을 갖는 안정한 선형계에 대한 강인 포화 제어기 (Robust Saturation Controller for the Stable LTI System with Structured Real Parameter Uncertainties)

  • 임채욱;박영진;문석준;박윤식
    • 제어로봇시스템학회논문지
    • /
    • 제12권6호
    • /
    • pp.517-523
    • /
    • 2006
  • This paper is focused on a robust saturation controller for the stable linear time-invariant (LTI) system involving both actuator's saturation and structured real parameter uncertainties. Based on affine quadratic stability and multi-convexity concept, a robust saturation controller is newly proposed and the linear matrix inequality (LMI)-based sufficient existence conditions for this controller are presented. The controller suggested in this paper can analytically prescribe the lower and upper bounds of parameter uncertainties, and guarantee the closed-loop robust stability of the system in the presence of actuator's saturation. Through numerical simulations, it is confirmed that the proposed robust saturation controller is robustly stable with respect to parameter uncertainties over the prescribed range defined by the lower and upper bounds.