• 제목/요약/키워드: basic probability assignment

검색결과 15건 처리시간 0.018초

A comprehensive evaluation method study for dam safety

  • Jia, Fan;Yang, Meng;Liu, Bingrui;Wang, Jianlei;Gao, Jiaorong;Su, Huaizhi;Zhao, Erfeng
    • Structural Engineering and Mechanics
    • /
    • 제63권5호
    • /
    • pp.639-646
    • /
    • 2017
  • According to the multi-index system of dam safety assessment and the standard of safety, a comprehensive evaluation model for dam safety based on a cloud model is established to determine the basic probability assignment of the Dempster-Shafer theory. The Dempster-Shafer theory is improved to solve the high conflict problems via fusion calculation. Compared with the traditional Dempster-Shafer theory, the application is more extensive and the result is more reasonable. The uncertainty model of dam safety multi-index comprehensive evaluation is applied according to the two theories above. The rationality and feasibility of the model are verified through application to the safety evaluation of a practical arch dam.

A novel evidence theory model and combination rule for reliability estimation of structures

  • Tao, Y.R.;Wang, Q.;Cao, L.;Duan, S.Y.;Huang, Z.H.H.;Cheng, G.Q.
    • Structural Engineering and Mechanics
    • /
    • 제62권4호
    • /
    • pp.507-517
    • /
    • 2017
  • Due to the discontinuous nature of uncertainty quantification in conventional evidence theory(ET), the computational cost of reliability analysis based on ET model is very high. A novel ET model based on fuzzy distribution and the corresponding combination rule to synthesize the judgments of experts are put forward in this paper. The intersection and union of membership functions are defined as belief and plausible membership function respectively, and the Murfhy's average combination rule is adopted to combine the basic probability assignment for focal elements. Then the combined membership functions are transformed to the equivalent probability density function by a normalizing factor. Finally, a reliability analysis procedure for structures with the mixture of epistemic and aleatory uncertainties is presented, in which the equivalent normalization method is adopted to solve the upper and lower bound of reliability. The effectiveness of the procedure is demonstrated by a numerical example and an engineering example. The results also show that the reliability interval calculated by the suggested method is almost identical to that solved by conventional method. Moreover, the results indicate that the computational cost of the suggested procedure is much less than that of conventional method. The suggested ET model provides a new way to flexibly represent epistemic uncertainty, and provides an efficiency method to estimate the reliability of structures with the mixture of epistemic and aleatory uncertainties.

일부 중년 여성에서 구령 유무에 따른 가슴압박소생술의 질과 피로도 비교 (Comparison on the Quality and fatigue of hands-Only CPR According to the Presence or Absence of Verbal counting by Some Middle-aged Women)

  • 김건남;최성수;최성우
    • 한국산학기술학회논문지
    • /
    • 제14권3호
    • /
    • pp.1320-1329
    • /
    • 2013
  • 일반인 중 심정지를 목격할 가능성이 가장 높은 중년층 여성들을 대상으로 숫자를 세는 방법에 따른 가슴압박소생술의 질과 피로도를 비교하여 최초반응자로서의 역할을 위한 심폐소생술 교육 프로그램을 마련하는데 기초자료를 제공하고자 한다. 3시간의 기본인명구조술 교육을 실시한 후, 확률할당을 통해 45명씩 두 그룹으로 배정하였다. 가슴압박소생술 도중 큰소리로 숫자를 세는 그룹 A, 숫자를 세지 않는 그룹 B로 나누어 인체모형에 2분간의 연구를 진행 하였다. 두 그룹간 가슴압박의 질은 유의한 차이를 보이지 않으면서 가슴압박의 중단시간이 단축되었고, 시간의 경과에 따라 흉부압박의 깊이가 줄어드는 빈도 또한 의미 있게 낮았다. 또한 가슴압박소생술 후 본인이 느끼는 피로도 또한 의미 있게 낮았다.

Fault-Tolerant Event Detection in Wireless Sensor Networks using Evidence Theory

  • Liu, Kezhong;Yang, Tian;Ma, Jie;Cheng, Zhiming
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제9권10호
    • /
    • pp.3965-3982
    • /
    • 2015
  • Event detection is one of the key issues in many wireless sensor network (WSN) applications. The uncertainties that are derived from the instability of sensor node, measurement noise and incomplete sampling would influence the performance of event detection to a large degree. Many of the present researches described the sensor readings with crisp values, which cannot adequately handle the uncertainties inhered in the imprecise sensor readings. In this paper, a fault-tolerant event detection algorithm is proposed based on Dempster-Shafer (D-S) theory (also called evidence theory). Instead of crisp values, all possible states of the event are represented by the Basic Probability Assignment (BPA) functions, with which the output of each sensor node are characterized as weighted evidences. The combination rule was subsequently applied on each sensor node to fuse the evidences gathered from the neighboring nodes to make the final decision on whether the event occurs. Simulation results show that even 20% nodes are faulty, the accuracy of the proposed algorithm is around 80% for event region detection. Moreover, 97% of the error readings have been corrected, and an improved detection capability at the boundary of the event region is gained by 75%. The proposed algorithm can enhance the detection accuracy of the event region even in high error-rate environment, which reflects good reliability and robustness. The proposed algorithm is also applicable to boundary detection as it performs well at the boundary of the event.

OBS WDM 망에서 비 할당된 채널 개방시간을 이용한 효율적인 채널 스케줄링 기법 (Efficient Channel Scheduling Technique Using Release Time Unscheduled Channel Algorithm in OBS WDM Networks)

  • 조석만;김선명;최덕규
    • 한국통신학회논문지
    • /
    • 제30권10A호
    • /
    • pp.912-921
    • /
    • 2005
  • Optical Burst Switched (OBS)는 If over WDM 망에서 테라비트 전송을 하기 위한 진보된 기술이다. OBS의 핵심 기술 중 하나는 데이터 버스트(DB : Data Burst)의 경쟁을 막기 위한 채널 스케쥴링 이다. OBS망에서 버스트의 제어패킷(CHP : Control Header Packet)과 데이터 버스트는 시간 간격(Time Gap)을 가지고 전송된다. 버스트 스위치 노드에 CHP가 도착하면 데이터 버스트을 위해 스케줄링 알고리즘을 사용하여 파장/채널(wavelength/channel)과 같은 자원을 예약하여 광전광(O/E/O)변환 없이 데이터 버스트를 전송해준다. 데이터 버스트를 위해 채널 스케줄링 과정에서 버스트간의 경쟁과 시간 간격이 발생되어 자원의 사용율과 버스트 손실 확률이 떨어진다. 기존에 제안된 방법들은 이러한 문제를 해결하기 위하여 많은 연구가 되어 지고 있다. 본 논문에서는 데이터 할당에서 발생되는 데이터간 간격과 데이터 손실에 중점을 두어 버스트 손실 확률과 자원 사용율을 극대화하기 위하여 버스트의 개방 시간)Release Time)을 이용한 채널 스케줄링 알고리즘 RTUC(Release Time Unscheduled Channel)을 제안한다. 시뮬레이션 결과 기존에 제안된 스케쥴링 알고리즘(LAUC, LAUC-VF)보다 버스트의 생존(Survival)과 효율적인 자원 사용 및 지연에서 개선된 성능을 확인하였다. 하지만, 로드가 적었을 경우 상대적으로 기존의 스케줄링 알고리즘보다 성능저하가 확인되었고, 로드가 증가했을 경우에는 데이터 손실 면에서 우수함을 확인하였다.