• 제목/요약/키워드: Probability Constraint

검색결과 129건 처리시간 0.025초

덮개 함수를 이용한 강건 최적설계의 제한 조건 단일화 (Unification of Constraints for Robust Optimization Using an Envelope Function)

  • 이정준;정도현;이병채
    • 대한기계학회논문집A
    • /
    • 제26권8호
    • /
    • pp.1719-1726
    • /
    • 2002
  • Design variables and design parameters are rarely deterministic in practice. Robust optimal design takes into consideration of the uncertainties in the design variables and parameters. Robust optimization methodology with probability constraints requires a lot of system analyses fer calculating failure probability of each constraint. By introducing an envelope function to reduce the number of constraints, efficiency of robust optimization techniques can be considerably improved. Through four illustrative examples, it is shown that the number of system analyses is greatly decreased while little differences in the optimum results are observed.

네트워크 제어 시스템을 위한 최적화된 매체 접근 확률 (Optimized Medium Access Probability for Networked Control Systems)

  • 박판근
    • 한국정보통신학회논문지
    • /
    • 제19권10호
    • /
    • pp.2457-2464
    • /
    • 2015
  • 무선 네트워크를 통한 네트워크 제어 시스템 (NCS: Networked Control Systems)은 다양한 제어 시스템의 효율성을 극대화 할 수 있는 잠재력을 가지고 있다. 본 연구에서는 네트워크 제어 시스템으로부터 이끌어낸 상태갱신주기(SUI: State Update Interval)라는 성능 메트릭을 정의한다. 제시된 상태갱신주기는 제어와 통신 시스템 계층 사이의 핵심적인 상호작용을 포함하고 있다. 제시된 성능 메트릭은 NCS를 위한 최적화 문제를 도출하는데 사용이 되었으며, 이러한 최적화 문제의 목적 함수는 상태갱신주기의 제한 요소를 만족하는 확률이며 변수는 매체접근 확률로 표현되었다. 본 연구에서는 제시된 최적화 문제의 최적 매체접근 확률이 유일한 해를 가진다는 것을 증명하였다. 또한 NCS를 위한 최적의 매체접근 확률은 전송률을 극대화하는 기존의 매체접근 확률보다 낮다는 결론을 도출하였다. 성능 분석 결과를 통하여 시스템의 안정도가 상태갱신주기를 고려한 최적의 매체접근 확률을 사용하였을 때가 전송률을 최대화하는 매체접근 확률을 사용 했을 때 보다 높다는 점을 보였다.

Competitive Influence Maximization on Online Social Networks under Cost Constraint

  • Chen, Bo-Lun;Sheng, Yi-Yun;Ji, Min;Liu, Ji-Wei;Yu, Yong-Tao;Zhang, Yue
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제15권4호
    • /
    • pp.1263-1274
    • /
    • 2021
  • In online competitive social networks, each user can be influenced by different competing influencers and consequently chooses different products. But their interest may change over time and may have swings between different products. The existing influence spreading models seldom take into account the time-related shifts. This paper proposes a minimum cost influence maximization algorithm based on the competitive transition probability. In the model, we set a one-dimensional vector for each node to record the probability that the node chooses each different competing influencer. In the process of propagation, the influence maximization on Competitive Linear Threshold (IMCLT) spreading model is proposed. This model does not determine by which competing influencer the node is activated, but sets different weights for all competing influencers. In the process of spreading, we select the seed nodes according to the cost function of each node, and evaluate the final influence based on the competitive transition probability. Experiments on different datasets show that the proposed minimum cost competitive influence maximization algorithm based on IMCLT spreading model has excellent performance compared with other methods, and the computational performance of the method is also reasonable.

M_CSPF: A Scalable CSPF Routing Scheme with Multiple QoS Constraints for MPLS Traffic Engineering

  • Hong, Daniel W.;Hong, Choong-Seon;Lee, Gil-Haeng
    • ETRI Journal
    • /
    • 제27권6호
    • /
    • pp.733-746
    • /
    • 2005
  • In the context of multi-protocol label switching (MPLS) traffic engineering, this paper proposes a scalable constraintbased shortest path first (CSPF) routing algorithm with multiple QoS metrics. This algorithm, called the multiple constraint-based shortest path first (M_CSPF) algorithm, provides an optimal route for setting up a label switched path (LSP) that meets bandwidth and end-to-end delay constraints. In order to maximize the LSP accommodation probability, we propose a link weight computation algorithm to assign the link weight while taking into account the future traffic load and link interference and adopting the concept of a critical link from the minimum interference routing algorithm. In addition, we propose a bounded order assignment algorithm (BOAA) that assigns the appropriate order to the node and link, taking into account the delay constraint and hop count. In particular, BOAA is designed to achieve fast LSP route computation by pruning any portion of the network topology that exceeds the end-to-end delay constraint in the process of traversing the network topology. To clarify the M_CSPF and the existing CSPF routing algorithms, this paper evaluates them from the perspectives of network resource utilization efficiency, end-to-end quality, LSP rejection probability, and LSP route computation performance under various network topologies and conditions.

  • PDF

An efficient Ambiguity searching method with constraints for attitude finding GPS receivers

  • Nam, Sung-Il;Son, Seok-Bo;Park, Chan-Sik;Lee, Sang-Jeong
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 제어로봇시스템학회 2001년도 ICCAS
    • /
    • pp.61.1-61
    • /
    • 2001
  • This paper describes an efficient ambiguity searching method using additional constraints in 3-dimentional attitude finding GPS receiver design. For determining the integer ambiguity, the baseline length constraint, the angle constraint, the velocity constraint and the attitude constraint can be used for reducing the searching space. This paper describes the searching space algebraically and graphically. It is confirmed that the described restrictions are reasonable and the speed and the probability of ambiguity fixing are improved when the restricted searching spaces are applied Moreover, it is possible to design receivers of better quality by applying the method proposed in this paper.

  • PDF

기계 구조의 강건 설계를 위한 최적화 기법의 개발 (Development of an Optimization Technique for Robust Design of Mechanical Structures)

  • 정도현;이병채
    • 대한기계학회논문집A
    • /
    • 제24권1호
    • /
    • pp.215-224
    • /
    • 2000
  • In order to reduce the variation effects of uncertainties in the engineering environments, new robust optimization method, which considers the uncertainties in design process, is proposed. Both design variables and system parameters are considered as random variables about their nominal values. To ensure the robustness of performance function, a new objective is set to minimize the variance of that function. Constraint variations are handled by introducing probability constraints. Probability constraints are solved by the advanced first order second moment (AFOSM) method based on the reliability theory. The proposed robust optimization method has an advantage that the second derivatives of the constraints are not required. The suggested method is examined by solving three examples and the results are compared with those for deterministic case and those available in literature.

제약조건과 사전확률이 고려된 선형비용모형의 수정검사정책 (Rectifying Inspection of Linear Cost Model with a Constraint and a $\alpha$-Optimal Acceptance Sampling)

  • 이도경;이근희
    • 산업경영시스템학회지
    • /
    • 제14권24호
    • /
    • pp.1-5
    • /
    • 1991
  • Various linear cost models have been proposed that can be used to determine a sampling plan by attributes. This paper is concerned with this sampling cost model when the probability that the number of nonconforming item is smaller than the break-even quality level is known. In addition to this situation, a constraint by AOQL is considered. Under these conditions, optimal sampling plan which minimize the average cost per lot is suggested.

  • PDF

Structural dynamic optimization with probability constraints of frequency and mode

  • Chen, Jian-Jun;Che, Jian-Wen;Sun, Huai-An;Ma, Hong-Bo;Cui, Ming-Tao
    • Structural Engineering and Mechanics
    • /
    • 제13권5호
    • /
    • pp.479-490
    • /
    • 2002
  • The structural dynamic optimization problem based on probability is studied. Considering the randomness of structural physical parameters and the given constraint values, we develop a dynamic optimization mathematical model of engineering structures with the probability constraints of frequency, forbidden frequency domain and the vibration mode. The sensitivity of structural dynamic characteristics based on probability is derived. Two examples illustrate that the optimization model and the method applied are rational and efficient.

OFDMA 시스템에서 실시간 트래픽 전송을 위한 효율적 스케쥴링 기법 (An Efficient Packet Scheduling Scheme to support Real-Time Traffic in OFDMA Systems)

  • 박정식;조호신
    • 한국통신학회논문지
    • /
    • 제32권1A호
    • /
    • pp.13-23
    • /
    • 2007
  • 본 논문에서는 OFDMA(Orthogonal Frequency Division Multiple Access) 시스템에서 실시간 트래픽 전송을 위한 효율적 패킷 스케줄링 기법을 제안한다. 본 방식은 패킷의 시간 지연 구속을 우선 만족시키면서 데이터 전송률도 향상시키는 기법으로 TEDC(Throughput Enhancement Under Delay-Constraint)라 불리운다. 사용자별 트래픽 특성에 따른 허용 지연 시간(Tolerable Delay Time TDT)을 정의하여 다양한 시간 지연 요구 조건을 차별화 하여 관리함으로써 무선 자원의 사용 효율을 향상시킨다. 논문에서 제안하는 TEDC 방식은 두 단계로 이루어진다. 첫 번째 단계에서는, 실시간 서비스를 위해 요구되는 시간 지연 구속을 만족하기 위해 잔여 허용 시간이 남지 않은 긴급한 사용자들에게 우선적으로 무선자원을 할당한다. 두 번째 단계에서는 첫 번째 단계에서 할당하고 남은 잉여 무선 자원에 대해서 자원의 활용도를 최대화하여 전체 데이터 전송률(Throughput)을 향상시킨다. 제안된 TEDC 방식의 성능은 기존의 자원할당 방식인 Round robin, M-LWDF, EXP 방식과 패킷 손실률, 데이터 전송률, 채널 활용도 측면에서 비교, 분석된다. 시뮬레이션 결과, TEDC 방식이 패킷 손실률, 데이터 전송률, 채널 활용도 측면에서 다른 자원 할당 방식보다 모두 우수한 성능을 보였다.

UNBIASED ADAPTIVE DECISION FEEDBACK EQUALIZATION

  • Shin, Hyun-Chool;Song, Woo-Jin
    • 대한전자공학회:학술대회논문집
    • /
    • 대한전자공학회 2000년도 제13회 신호처리 합동 학술대회 논문집
    • /
    • pp.65-68
    • /
    • 2000
  • It is well-known that the decision rule in the mini-mum mean-squares-error decision feedback equalizer(MMSE-DFE) is biased, and therefore suboptimum with respect to error probability. We present a new family of algorithms that solve the bias problem in the adaptive DFE. A novel constraint, called the constant-norm con-straint, is introduced unifying the quadratic constraint and the monic one. A new cost function based on the constant-norm constraint and Lagrange multiplier is defined. Minimizing the cost function gives birth to a new family of unbiased adaptive DFE. The simula-tion results demonstrate that the proposed method in-deed produce unbiased solution in the presence of noise while keeping very simple both in computation and im-plementation.

  • PDF