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

검색결과 252건 처리시간 0.021초

BcN 서비스 가입자 망 설계를 위한 타부서치 휴리스틱 알고리즘 개발 (Tabu Search Heuristic Algorithm for Designing Broadband Convergence Networks)

  • 이영호;윤현정;이순석;박노익
    • 대한산업공학회지
    • /
    • 제34권2호
    • /
    • pp.205-215
    • /
    • 2008
  • convergence networks (BcN). The problem seeks to minimize the total cost of switch and cable while satisfying the requirement of demand and quality of service (QoS). We develop mixed integer programming models to obtain the optimal switch location of the access network. We develop a Tabu Search (TS) heuristic algorithm for finding a good feasible solution within a reasonable time limit. We propose real networks with up to 25 nodes and 180 demands. In order to demonstrate the effectiveness of the proposed algorithm, we generate lower bounds from nonlinear QoS relaxation problem. Computational results show that the proposed heuristic algorithm provides upper bounds within 5% optimality gap in 10 seconds.

Adaptive Observer using Auto-generating B-splines

  • Baang, Dane;Stoev, Julian;Choi, Jin-Young
    • International Journal of Control, Automation, and Systems
    • /
    • 제5권5호
    • /
    • pp.479-491
    • /
    • 2007
  • This paper presents a new adaptive observer design method for a class of uncertain nonlinear systems by using spline approximation. This scheme leads to a simplified observer structure which requires only fixed number of integrations, regardless of the number of parameters to be estimated. This benefit can reduce the number of integrations of the observer filter dramatically. Moreover, the proposed adaptive observer automatically generates the required spline elements according to the varying output value and, as a result, does not requires the pre-knowledge of upper and lower bounds of the output. This is another benefit of our approach since the requirement for known output bounds have been one of the main drawbacks of practical universal approximation problems. Both of the benefits stem from the local support property, which is specific to splines.

구간값 모호집합에 기반을 둔 퍼지시스템의 신뢰도 분석 (Reliability Analysis of Fuzzy Systems Based on Interval Valued Vague Sets)

  • 이세열;조상엽;김용수
    • 한국지능시스템학회:학술대회논문집
    • /
    • 한국지능시스템학회 2008년도 춘계학술대회 학술발표회 논문집
    • /
    • pp.362-365
    • /
    • 2008
  • In the conventional fuzzy system reliability analysis, the reliabilities of the fuzzy systems and the components of fuzzy systems are represented by real values between zero and one, fuzzy numbers, vague sets, interval valued fuzzy sets, etc. This paper propose a method to represent and analyze the reliabilities of the fuzzy systems based on the internal valued vague sets defined in the universe of discourse [0, 1]. In the interval valued vague sets, the upper bounds and the lower bounds of the conventional vague sets are represented as the intervals, therefore it can allow the reliabilities of a fuzzy system to represent and analyze in a more flexible manner.

  • PDF

Performance Analysis for Flow Networks by Most Probable States

  • Lee, Seung-Min;Lee, Hee-Kyoung;Park, Dong-Ho
    • International Journal of Reliability and Applications
    • /
    • 제3권3호
    • /
    • pp.133-145
    • /
    • 2002
  • The traditional methods of evaluating the performance of a network by enumerating all possible states may quickly become computationally prohibitive, since the number of states grows exponentially as the number of components increases. In such cases, enumerating only the most probable states would provide a good approximation. In this paper, we propose a method which efficiently generates upper and lower bounds for coherent performance measures utilizing the most probable states. Compared with Yang and Kubat's method, our procedure significantly reduces the complexity and memory requirement per iteration for computing the bounds and thereby, achieves the given degree of accuracy or the coverage within a shorter time.

  • PDF

상태 발생확률 순서에 의한 네트워크 성능 분석 방법 연구

  • Lee, Hee-Kyoung;Park, Dong-Ho;Lee, Seung-Min
    • 한국신뢰성학회:학술대회논문집
    • /
    • 한국신뢰성학회 2002년도 정기학술대회
    • /
    • pp.289-296
    • /
    • 2002
  • The traditional methods of evaluating the performance of a network by enumerating all possible states may quickly become computationally prohibitive, since the number of states grows exponentially as the number of components increases. In such cases, enumerating only the most probable states would provide a good approximation. In this paper, we propose a method which efficiently generates upper and lower bounds for coherent performance measures utilizing the most probable states. Compared with Yang and Kubat's method, our procedure significantly reduces the complexity and memory requirement per iteration for computing the bounds and thereby, achieves the given degree of accuracy or the coverage within a shorter time.

  • PDF

임펼스성 잡음이 있을때 협대역 ISDN 가입자 전송로의 통신로 용량 한계 결정 (Determination of Channel Capacity Bounds of Narrow Band ISDN Subscriber Line in the Presence of Impulsive Noise)

  • 이종헌;성태경;진용옥
    • 대한전기학회:학술대회논문집
    • /
    • 대한전기학회 1987년도 전기.전자공학 학술대회 논문집(II)
    • /
    • pp.854-858
    • /
    • 1987
  • This paper considers impulsive noise which produce burst error in high speed(approx.160Kbps) data transmission like ISDN(Integrated Servise Digital Network) using PSTN(Public Switching Telephone Network). To begin with, we obtains the transfer function of subscriber line to calculate the variation of bandwidth when the gain of receiver is fixed and channel capacity of non-gaussian channel in upper-and lower bound, and evaluates the transmission capability. In this paper compares channel capacity bounds which obtains when probability density function of impulsive noise is Laplacian distribution function with impulsive noise generated by waveform synthesier.

  • PDF

TWO-SIDED ESTIMATES FOR TRANSITION PROBABILITIES OF SYMMETRIC MARKOV CHAINS ON ℤd

  • Zhi-He Chen
    • 대한수학회지
    • /
    • 제60권3호
    • /
    • pp.537-564
    • /
    • 2023
  • In this paper, we are mainly concerned with two-sided estimates for transition probabilities of symmetric Markov chains on ℤd, whose one-step transition probability is comparable to |x - y|-dϕj (|x - y|)-1 with ϕj being a positive regularly varying function on [1, ∞) with index α ∈ [2, ∞). For upper bounds, we directly apply the comparison idea and the Davies method, which considerably improves the existing arguments in the literature; while for lower bounds the relation with the corresponding continuous time symmetric Markov chains are fully used. In particular, our results answer one open question mentioned in the paper by Murugan and Saloff-Coste (2015).

Power-Space Functions in High Speed Railway Wireless Communications

  • Dong, Yunquan;Zhang, Chenshuang;Fan, Pingyi;Fan, Pingzhi
    • Journal of Communications and Networks
    • /
    • 제17권3호
    • /
    • pp.231-240
    • /
    • 2015
  • To facilitate the base station planning in high speed railway communication systems, it is necessary to consider the functional relationships between the base station transmit power and space parameters such as train velocity and cell radius. Since these functions are able to present some inherent system properties determined by its spatial topology, they will be referred to as the power-space functions in this paper. In light of the fact that the line-of-sight path persists the most power of the received signal of each passing train, this paper considers the average transmission rate and bounds on power-space functions based on the additive white Gaussian noise channel (AWGN) model. As shown by Monte Carlo simulations, using AWGN channel instead of Rician channel introduces very small approximation errors, but a tractable mathematical framework and insightful results. Particularly, lower bounds and upper bounds on the average transmission rate, as well as transmit power as functions of train velocity and cell radius are presented in this paper. It is also proved that to maintain a fixed amount of service or a fixed average transmission rate, the transmit power of a base station needs to be increased exponentially, if the train velocity or cell radius is increased, respectively.

M진 Sidel'nikov 수열의 $F_p$ 상에서의 선형복잡도와 1-오류 선형복잡도 (Linear Complexity and 1-Error Linear Complexity over $F_p$ of M-ary Sidel'nikov Sequences)

  • 정진호;양경철
    • 한국통신학회논문지
    • /
    • 제31권12C호
    • /
    • pp.1150-1156
    • /
    • 2006
  • 본 논문에서는 $M\geq3$이고 $p\equiv{\pm}1$ mod M인 경우에 대해서 주기가 $p^m-1$인 M진 Sidel'nikov 수열의 $F_p$ 상에서의 선형복잡도의 하계와 1-오류 선형복잡도의 상계를 유도한다. 특히 $m\geq4$이고 $p\equiv-1$ mod 3인 경우에는 3진 Sidel'nikov 수열의 정확한 1-오류 선형복잡도를 계산한다. 이 결과들을 바탕으로 선형복잡도와 1-오류 선형복잡도의 주기에 대한 비율의 근사적 특성을 제시한다.

BOUNDS FOR RADII OF CONVEXITY OF SOME q-BESSEL FUNCTIONS

  • Aktas, Ibrahim;Orhan, Halit
    • 대한수학회보
    • /
    • 제57권2호
    • /
    • pp.355-369
    • /
    • 2020
  • In the present investigation, by applying two different normalizations of the Jackson's second and third q-Bessel functions tight lower and upper bounds for the radii of convexity of the same functions are obtained. In addition, it was shown that these radii obtained are solutions of some transcendental equations. The known Euler-Rayleigh inequalities are intensively used in the proof of main results. Also, the Laguerre-Pólya class of real entire functions plays an important role in this work.