• Title/Summary/Keyword: Probability Constraint

Search Result 129, Processing Time 0.032 seconds

Detection Probability Improvement of Bias Error of GPS Carrier Measurement using Baseline Constraint (기저선 제한조건을 이용한 GPS 반송파 바이어스 오차의 검출확률 향상)

  • Lee, Eun-Sung;Chun, Se-Bum;Lee, Young-Jea;Kang, Tea-Sam;Jee, Gyu-In
    • Journal of the Korean Society for Aeronautical & Space Sciences
    • /
    • v.32 no.9
    • /
    • pp.88-93
    • /
    • 2004
  • A method is suggested for validating the existence of bias error on GPS carrier measurement. The baseline constraint is used as an addition measurement, which augments the original measurement equation. The detection probability is calculated on both cases. The first case is using GPS carrier measurement only, the second case is using GPS carrier and a baseline constraint. The improvement of the detection probability is shown, and the advantage of using baseline constraint is described statistically, the results of the simulation is shown and analyzed.

Development of an Efficient Optimization Technique for Robust Design by Approximating Probability Constratints (확률조건의 근사화를 통한 효율적인 강건 최적설계 기법의 개발)

  • Jeong, Do-Hyeon;Lee, Byeong-Chae
    • Transactions of the Korean Society of Mechanical Engineers A
    • /
    • v.24 no.12
    • /
    • pp.3053-3060
    • /
    • 2000
  • Alternative formulation is presented for robust optimization problems and an efficient computational scheme for reliability estimation is proposed. Both design variables and design parameters considered as random variables about their nominal values. To ensure the robustness of objective performance a new cost function bounding the performance and a new constraint limiting the performance variation are introduced. The constraint variations are regulated by considering the probability of feasibility. Each probability constraint is transformed into a sub-optimization problem and then is resolved with the modified advanced first order second moment(AFOSM) method for computational efficiency. The proposed robust optimization method has advantages that the mean value and the variation of the performance function are controlled simultaneously and the second order sensitivity information is not required even in case of gradient based optimization. The suggested method is examined by solving three examples and the results are compared with those for deterministic case and those available in literature.

Underlay Cooperative Cognitive Networks with Imperfect Nakagami-m Fading Channel Information and Strict Transmit Power Constraint: Interference Statistics and Outage Probability Analysis

  • Ho-Van, Khuong;Sofotasios, Paschalis C.;Freear, Steven
    • Journal of Communications and Networks
    • /
    • v.16 no.1
    • /
    • pp.10-17
    • /
    • 2014
  • This work investigates two important performance metrics of underlay cooperative cognitive radio (CR) networks: Interference cumulative distribution function of licensed users and outage probability of unlicensed users. These metrics are thoroughly analyzed in realistic operating conditions such as imperfect fading channel information and strict transmit power constraint, which satisfies interference power constraint and maximum transmit power constraint, over Nakagami-m fading channels. Novel closed-form expressions are derived and subsequently validated extensively through comparisons with respective results from computer simulations. The proposed expressions are rather long but straightforward to handle both analytically and numerically since they are expressed in terms of well known built-in functions. In addition, the offered results provide the following technical insights: i) Channel information imperfection degrades considerably the performance of both unlicensed network in terms of OP and licensed network in terms of interference levels; ii) underlay cooperative CR networks experience the outage saturation phenomenon; iii) the probability that the interference power constraint is satisfied is relatively low and depends significantly on the corresponding fading severity conditions as well as the channel estimation quality; iv) there exists a critical performance trade-off between unlicensed and licensed networks.

Muli-path Constraint-based Routing Algorithms for MPLS Traffic Engineering (MPLS 트래픽 엔지니어링을 위한 다중경로 Constraint-based 라우팅 알고리즘)

  • Lee, Jae-Young;Kim, Byung-Chul
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.29 no.5B
    • /
    • pp.508-519
    • /
    • 2004
  • This paper proposed two multi-path constraint-based routing algorithms for Internet traffic engineering using MPLS. In normal constraint-based shortest path first (CSPF) routing algorithm, there is a high probability that it cannot find the required path through networks for a large bandwidth constraint that is one of the most important constraints for traffic engineering, The proposed algorithms can divide the bandwidth constraint into two or more sub-constraints and find a constrained path for each sub-constraint, if there is no single path satisfying the whole constraint. Extensive simulations show that they enhance the success probability of path setup and the utilization of network resources.

Enhancement of Computational Efficiency of Reliability Optimization Method by Approximate Evaluation of Sub-Optimization Problem (부 최적화 문제의 근사적인 계산을 통한 신뢰도 최적설계 방범의 효율개선)

  • Jeong, Do-Hyeon;Lee, Byeong-Chae
    • Transactions of the Korean Society of Mechanical Engineers A
    • /
    • v.25 no.10
    • /
    • pp.1597-1604
    • /
    • 2001
  • Alternative computational scheme is presented fur reliability based optimal design using a modified advanced first order second moment (AFOSH) method. Both design variables and design parameters are considered as random variables about their nominal values. Each probability constraint is transformed into a sub -optimization problem and then is resolved with the modified Hasofer- Lind-Rackwitz-Fiessler (HL-RF) method for computational efficiency and convergence. A method of design sensitivity analysis for probability constraint is presented and tested through simple examples. The suggested method is examined by solving several examples and the results are compared with those of other methods.

Cell Association Scheme for Uplink Heterogeneous Cellular Networks (이기종 셀룰러 네트워크에서의 상향 링크 셀 접속 기법)

  • Lee, Hyung Yeol;Sang, Young Jin;Park, Jin Bae;Kim, Kwang Soon
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.38A no.5
    • /
    • pp.393-400
    • /
    • 2013
  • In conventional single-tier networks, downlink based association is the best association scheme for the uplink association because all macro base stations have the same physical specification. However, in uplink heterogeneous cellular networks, a downlink based cell association cannot be the best for uplink any more because of the difference of physical specification between the different base station. In this paper, we will propose a uplink based cell association scheme, and devise performance metric for describing a uplink performance in heterogeneous cellular networks. Then, we will discuss the necessity of the uplink based association by observing outage probability, delay constraint outage probability, delay constraint outage capacity.

Distributed Multi-Hop Relay Scheme to Reduce Delay-Constrained Broadcast Outage Probability (전달 시간 제한이 있는 브로드캐스트 아웃티지 확률을 감소시키는 분산적인 다중 홉 중계 기법)

  • Ko, Byung Hoon;Byun, Ilmu;Rhee, Duho;Jeon, Ki Jun;Kim, Beom Mu;Lee, Seong Ro;Kim, Kwang Soon
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.38C no.2
    • /
    • pp.219-226
    • /
    • 2013
  • Distributed multi-hop relay scheme to reduce delay-constrained outage probability for broadcast network is proposed. We consider multi-hop relay scheme, which is similar to distributed beamforming, where multiple nodes simultaneously relay packets, and we propose channel access control and power control for relaying nodes to satisfy energy constraint. Compared with flooding which is multi-hop relay scheme used for ZigBee, the proposed scheme is better in terms of outage probability and average reception throughput.

A Study on Periodic Review Inventory System under Stochastic Budget Constraint (확률적 예산 제약을 고려한 주기적 재고관리 정책에 대한 연구)

  • Lee, Chang-Yong;Lee, Dongju
    • Journal of Korean Society of Industrial and Systems Engineering
    • /
    • v.37 no.1
    • /
    • pp.165-171
    • /
    • 2014
  • We develop an optimization algorithm for a periodic review inventory system under a stochastic budget constraint. While most conventional studies on the periodic review inventory system consider a simple budget limit in terms of the inventory investment being less than a fixed budget, this study adopts more realistic assumption in that purchasing costs are paid at the time an order is arrived. Therefore, probability is employed to express the budget constraint. That is, the probability of total inventory investment to be less than budget must be greater than a certain value assuming that purchasing costs are paid at the time an order is arrived. We express the budget constraint in terms of the Lagrange multiplier and suggest a numerical method to obtain optional values of the cycle time and the safety factor to the system. We also perform the sensitivity analysis in order to investigate the dependence of important quantities on the budget constraint. We find that, as the amount of budget increases, the cycle time and the average inventory level increase, whereas the Lagrange multiplier decreases. In addition, as budget increases, the safety factor increases and reaches to a certain level. In particular, we derive the condition for the maximum safety factor.

Performance Improvement of Wald Test for Resolving GPS Integer Ambiguity Using a Baseline-Length Constraint

  • Lee Eun-Sung;Chun Se-Bum;Lee Young-Jae;Kang Tea-Sam;Jee Gyu-In;Abdel-Hafez Mamoun F.
    • International Journal of Control, Automation, and Systems
    • /
    • v.4 no.3
    • /
    • pp.333-343
    • /
    • 2006
  • In this paper, the baseline-length information is directly modeled as a measurement for the Wald test, which speeds up the resolution convergence of the integer ambiguity of GPS carrier phase measurements. The convergent speed improvement is demonstrated using numerical simulation and real experiments. It is also shown that the integer ambiguities can be resolved using only four actual satellite measurements with very reasonable convergence speed, if the baseline-length information is used just like one additional observable satellite measurement. Finally, it is shown that the improvement of convergence speed of the Wald test is due to the increase of the probability ratio with the use of the baseline-length constraint.

A Robust Design Using Approximation Model and Probability of Success (근사모델 및 성공확률을 이용한 강건설계)

  • Song, Byoung-Cheol;Lee, Kwon-Hee
    • Journal of the Korean Society of Manufacturing Process Engineers
    • /
    • v.7 no.3
    • /
    • pp.3-11
    • /
    • 2008
  • Robust design pioneered by Dr. G. Taguchi has been applied to versatile engineering problems for improving quality. Since 1980s, the Taguchi method has been introduced to numerical optimization, complementing the deficiencies of deterministic optimization, which is often called the robust optimization. In this study, the robust optimization strategy is proposed by considering the robustness of objective and constraint functions. The statistics of responses in the functions are surrogated by kriging models. In addition, objective and/or constraint function is represented by the probability of success, thus facilitating robust optimization. The mathematical problem and the two-bar design problem are investigated to show the validity of the proposed method.

  • PDF