• Title/Summary/Keyword: Probability Constraint

Search Result 129, Processing Time 0.025 seconds

Solving Probability Constraint in Robust Optimization by Minimizing Percent Defective (불량률 최소화를 통한 강건 최적화의 확률제한조건 처리)

  • Lee, Kwang Ki;Park, Chan Kyoung;Kim, Geun Yeon;Lee, Kwon Hee;Han, Sang Wook;Han, Seung Ho
    • Transactions of the Korean Society of Mechanical Engineers A
    • /
    • v.37 no.8
    • /
    • pp.975-981
    • /
    • 2013
  • A robust optimization is only one of the ways to minimize the effects of variances in design variables on the objective functions at the preliminary design stage. To predict the variances and to formulate the probabilistic constraints are the most important procedures for the robust optimization formulation. Though several methods such as the process capability index and the six sigma technique were proposed for the prediction and formulation of the variances and probabilistic constraints, respectively, there are few attempts using a percent defective which has been widely applied in the quality control of the manufacturing process for probabilistic constraints. In this study, the robust optimization for a lower control arm of automobile vehicle was carried out, in which the design space showing the mean and variance sensitivity of weight and stress was explored before robust optimization for a lower control arm. The 2nd order Taylor expansion for calculating the standard deviation was used to improve the numerical accuracy for predicting the variances. Simplex algorithm which does not use the gradient information in optimization was used to convert constrained optimization into unconstrained one in robust optimization.

Efficient Spectrum Sensing for Cognitive Radio Sensor Networks via Optimization of Sensing Time (센싱 시간의 최적화를 통해 인지 무선 센서 네트워크를 위한 효율적인 스펙트럼 센싱)

  • Kong, Fanhua;Cho, Jinsung
    • Journal of KIISE
    • /
    • v.43 no.12
    • /
    • pp.1412-1419
    • /
    • 2016
  • In cognitive radio sensor networks (CRSNs), secondary users (SUs) can occupy licensed bands opportunistically without causing interferences to primary users (PUs). SUs perform spectrum sensing to detect the presence of PUs. Sensing time is a critical parameter for spectrum sensing that can yield a tradeoff between sensing performance and secondary throughput. In this study, we investigate new approaches for spectrum sensing by exploring the tradeoff from a) spectrum sensing for PU detection (SSPD) and b) spectrum sensing for secondary throughput (SSST). In the proposed scheme, the first sensing result of the current frame determines the dynamic performance of the second spectrum sensing. Energy constraint in CRSNs leads to maximized network energy efficiency via optimization of sensing time. Simulation results show that the proposed scheme of SSPD and SSST improves network performance in terms of energy efficiency and secondary throughput, respectively.

(Theoretical Performance analysis of 12Mbps, r=1/2, k=7 Viterbi deocder and its implementation using FPGA for the real time performance evaluation) (12Mbps, r=1/2, k=7 비터비 디코더의 이론적 성능분석 및 실시간 성능검증을 위한 FPGA구현)

  • Jeon, Gwang-Ho;Choe, Chang-Ho;Jeong, Hae-Won;Im, Myeong-Seop
    • Journal of the Institute of Electronics Engineers of Korea SC
    • /
    • v.39 no.1
    • /
    • pp.66-75
    • /
    • 2002
  • For the theoretical performance analysis of Viterbi Decoder for wireless LAN with data rate 12Mbps, code rate 1/2 and constraint length 7 defined in IEEE 802.11a, the transfer function is derived using Cramer's rule and the first-event error probability and bit error probability is derived under the AWGN. In the design process, input symbol is quantized into 16 steps for 4 bit soft decision and register exchange method instead of memory method is proposed for trace back, which enables the majority at the final decision stage. In the implementation, the Viterbi decoder based on parallel architecture with pipelined scheme for processing 12Mbps high speed data rate and AWGN generator are implemented using FPGA chips. And then its performance is verified in real time.

Advance Probabilistic Design and Reliability-Based Design Optimization for Composite Sandwich Structure (복합재 샌드위치 구조의 개선된 확률론적 설계 및 신뢰성 기반 최적설계)

  • Lee, Seokje;Kim, In-Gul;Cho, Wooje;Shul, Changwon
    • Composites Research
    • /
    • v.26 no.1
    • /
    • pp.29-35
    • /
    • 2013
  • Composite sandwich structure can improve the specific bending stiffness significantly and save the weight nearly 30 percent compared with the composite laminates. However, it has more inherent uncertainties of the material property caused by manufacturing process than metals. Therefore, the reliability-based probabilistic design approach is required. In this paper, the PMS(Probabilistic Margin of Safety) is calculated for the simplified fuselage structure made of composite sandwich to provide the probabilistic reasonable evidence that the classical design method based on the safety factor cannot ensure the structural safety. In this phase, the probability density function estimated by CMCS(Crude Monte-Carlo Simulation) is used. Furthermore, the RBDO(Reliability-Based Design Optimization) under the probabilistic constraint are performed, and the RBDO-MPDF(RBDO by Moving Probability Density Function) is proposed for an efficient computation. The examined results in this paper can be helpful for advanced design techniques to ensure the reliability of structures under the uncertainty and computationally inexpensive RBDO methods.

An Efficient Converter Placement in Wavelength-Routed WDM Networks with Sparse-Partial-Limited Wavelength Conversion (파장분할다중화 광통신망에서 산재-부분-제한영역 파장 변환기의 효율적인 배치 알고리듬)

  • Jeong, Han-You;Seo, Seung-Woo;Choi, Yoon-Ho
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.35 no.11B
    • /
    • pp.1596-1606
    • /
    • 2010
  • In this paper, we present a new analytical model that can precisely estimate the blocking performance of wavelength-routed WDM networks with sparse-partial-limited wavelength conversion (SPLWC). The proposed model accounts for the two sources of call blocking in a wavelength converter: range blocking originated from the limited conversion range of a wavelength converter; and capacity blocking induced from the limited number of wavelength converters. Based on the proposed model, we also present a new converter placement algorithm that minimizes the amount of wavelength conversion capability, while satisfying the given constraint on the network-wide blocking probability. From the numerical results obtained from the EON, we demonstrate that the blocking probability of the analytical model closely matches with that of the simulation. We also show that, by efficiently combining the existing sparse, partial, and limited wavelength conversion, the SPL WC can achieve the required blocking performance with the least amount of wavelength conversion cost.

Optimal Utilization of a Cognitive Shared Channel with a Rechargeable Primary Source Node

  • Pappas, Nikolaos;Jeon, Jeong-Ho;Ephremides, Anthony;Traganitis, Apostolos
    • Journal of Communications and Networks
    • /
    • v.14 no.2
    • /
    • pp.162-168
    • /
    • 2012
  • This paper considers the scenario in which a set of nodes share a common channel. Some nodes have a rechargeable battery and the others are plugged to a reliable power supply and, thus, have no energy limitations. We consider two source-destination pairs and apply the concept of cognitive radio communication in sharing the common channel. Specifically, we give high-priority to the energy-constrained source-destination pair, i.e., primary pair, and low-priority to the pair which is free from such constraint, i.e., secondary pair. In contrast to the traditional notion of cognitive radio, in which the secondary transmitter is required to relinquish the channel as soon as the primary is detected, the secondary transmitter not only utilizes the idle slots of primary pair but also transmits along with the primary transmitter with probability p. This is possible because we consider the general multi-packet reception model. Given the requirement on the primary pair's throughput, the probability p is chosen to maximize the secondary pair's throughput. To this end, we obtain two-dimensional maximum stable throughput region which describes the theoretical limit on rates that we can push into the network while maintaining the queues in the network to be stable. The result is obtained for both cases in which the capacity of the battery at the primary node is infinite and also finite.

Power Allocation and Subcarrier Assignment for Joint Delivery of Unicast and Broadcast Transmissions in OFDM Systems

  • Lee, Deokhui;So, Jaewoo;Lee, Seong Ro
    • Journal of Communications and Networks
    • /
    • v.18 no.3
    • /
    • pp.375-386
    • /
    • 2016
  • Most existing studies on broadcast services in orthogonal frequency division multiplexing (OFDM) systems have focused on how to allocate the transmission power to the subcarriers. However, because a broadcasting system must guarantee quality of service to all users, the performance of the broadcast service dominantly depends on the channel state of the user who has the lowest received signal-to-noise ratio among users. To reduce the effect of the worst user on the system performance, we propose a joint delivery scheme of unicast and broadcast transmissions in OFDM systems with broadcast and unicast best-effort users. In the proposed joint delivery scheme, the BS delivers the broadcast information using both the broadcast and unicast subcarriers at the same time in order to improve the performance of the broadcast service. The object of the proposed scheme is to minimize the outage probability of the broadcast service while maximizing the sum-rate of best-effort users. For the proposed joint delivery scheme, we develop an adaptive power and subcarrier allocation algorithm under the constraint of total transmission power. This paper shows that the optimal power allocation over each subcarrier in the proposed scheme has a multi-level water filling form. Because the power allocation and the subcarrier assignment problems should be jointly solved, we develop an iterative algorithm to find the optimal solution. Numerical results show that the proposed joint delivery scheme with adaptive power and subcarrier allocation outperforms the conventional scheme in terms of the outage probability of the broadcast service and the sum-rate of best-effort users.

Design and Performance evaluation of Fuzzy-based Framed Random Access Controller ($F^2RAC$) for the Integration of Voice ad Data over Wireless Medium Access Control Protocol (프레임 구조를 갖는 무선 매체접속제어 프로토콜 상에서 퍼지 기반의 음성/데이터 통합 임의접속제어기 설계 및 성능 분석)

  • 홍승은;최원석;김응배;강충구;임묘택
    • Proceedings of the IEEK Conference
    • /
    • 2000.11a
    • /
    • pp.189-192
    • /
    • 2000
  • This paper proposes a fuzzy-based random access controller with a superimposed frame structure (F$^2$RAC) fur voice/data-integrated wireless networks. F$^2$RAC adopts mini-slot technique for reducing contention cost, and these mini-slots of which number may dynamically vary from one frame to the next as a function of the traffic load are further partitioned into two regions for access requests coming from voice and data traffic with their respective QoS requirements. And F$^2$RAC is designed to properly determine the access regions and permission probabilities for enhancing the data packet delay while ensuring the voice packet dropping probability constraint. It mainly consists of the estimator with Pseudo-Bayesian algorithm and fuzzy logic controller with Sugeno-type of fuzzy rules. Simulation results prove that F$^2$RAC can guarantee QoS requirement of voice and provide the highest throughput efficiency and the smallest data packet delay amongst the different alternatives including PRMA[1], IPRMA[2], and SIR[3].

  • PDF

Development of Water Supply System under Uncertainty

  • Chung, Gun-Hui;Kim, Tae-Woong;Kim, Joong-Hoon
    • Proceedings of the Korea Water Resources Association Conference
    • /
    • 2009.05a
    • /
    • pp.2179-2183
    • /
    • 2009
  • As urbanization is progressed, the network for distributing water in a basin become complex due to the spatial expansion and parameter uncertainties of water supply systems. When a long range water supply plan is determined, the total construction and operation cost has to be evaluated with the system components and parameter uncertainties as many as possible. In this paper, the robust optimization approach of Bertsimas and Sim is applied in a hypothetical system to find a solution which remains feasible under the possible parameter uncertainties having the correlation effect between the uncertain coefficients. The system components to supply, treatment, and transport water are included in the developed water supply system and construction and expansion of the system is allowed for a long-range period. In this approach, the tradeoff between system robustness and total cost of the system is evaluated in terms of the degree of conservatism which can be converted to the probability of constraint violation. As a result, the degree of conservatism increases, the total cost is increased due to the installation of large capacity of treatment and transportation systems. The applied robust optimization technique can be used to determine a long-range water supply plan with the consideration of system failure.

  • PDF

A Send-ahead Policy for a Semiconductor Wafer Fabrication Process

  • Moon, Ilkyeong
    • Journal of the Korean Operations Research and Management Science Society
    • /
    • v.18 no.1
    • /
    • pp.119-126
    • /
    • 1993
  • We study a manufacturing process that is quite common in semiconductor wafer fabrication of semiconductor chip production. A machine is used to process a job consisting of J wafers. Each job requires a setup, and the i$_{th}$ setup for a job is sucessful with probability P$_{i}$. The setup is prone to failure, which results in the loss of expensive wafers. Therefore, a tiral run is first conducted on a small batch. If the set up is successful, the test is passed and the balance of the job can be processed. If the setup is unsuccessful, the exposed wafers are lost to scrap and the mask is realigned. The process then repeats on the balance of the job. We call this as send-ahead policy and consider general policies in which the number of wafers that are sent shead depend on the cost of the raw wafer, the sequence of success probabilities, and the balance of the job. We model this process and determine the expected number of good wafers per job,the expected time to process a job, and the long run average throughput. An algorithm to minimize the cost per good wafer subject to a demand constraint is provided.d.d.

  • PDF