• 제목/요약/키워드: Recovery probability

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

Translucent Cryptography의 취약점 개선 (The Improvement of Translucent Cryptography)

  • 김종희;이필중
    • 한국통신학회논문지
    • /
    • 제27권12C호
    • /
    • pp.1276-1281
    • /
    • 2002
  • 키 복구 시스템의 대안으로 Bellare와 Rivest가 translucent cryptography의 개념을 소개하였다. Translucent cryptography란 사용자간의 암호 통신을 제3자가 확률 p(0$\leq$p$\leq$1)로 복구할 수 있는 시스템이다. 이 시스템에서는 사용자의 비공개키를 사전에 위탁할 필요가 없으며, p의 값을 조정함으로써 사용자와 복구 기관 사이의 균형을 조정할 수 있다. 예를 들어, p의 값을 0.4로 한다면 복구 기관은 사용자간의 암호 메시지 100개 중 40개를 복구할 수 있게 된다. 본 논문에서는 translucent cryptography에서 사용자가 손쉽게 복구 기관을 속여 복구 기관이 p의 확률만큼 복호화할 수 없는 문제점을 지적하고, 이에 대한 개선책을 제안한다.

요통환자(腰痛患者) 재활(再活) 프로그램 평가(評價)를 위한 통계적(統計的) 모형(模型) (Use of a Statistical Model for Low Back Pain Rehabilitation Program Evaluation)

  • 정민근
    • 대한산업공학회지
    • /
    • 제14권2호
    • /
    • pp.63-70
    • /
    • 1988
  • Recently a new regime, called "back school" is advocated for the purpose of rapidly and economically returning a patient to full functional fitness and normal occupational activities. Assuming that this functional and vocational restoration is a goal of a regabilitation program, it is apparent that early recovery and higher success rate are major concern. In this study, a mixture model is developed and used to evaluate the recovery process of low back pain (LBP) patients in a rehabilitation program. The model provides (1) the probability of being recovered, and (2) the rate of recovery. Patients with gradual onset, with higher education, or of young age tend to show better prognosis.

  • PDF

STABLE AND ROBUST ℓp-CONSTRAINED COMPRESSIVE SENSING RECOVERY VIA ROBUST WIDTH PROPERTY

  • Yu, Jun;Zhou, Zhiyong
    • 대한수학회지
    • /
    • 제56권3호
    • /
    • pp.689-701
    • /
    • 2019
  • We study the recovery results of ${\ell}_p$-constrained compressive sensing (CS) with $p{\geq}1$ via robust width property and determine conditions on the number of measurements for standard Gaussian matrices under which the property holds with high probability. Our paper extends the existing results in Cahill and Mixon from ${\ell}_2$-constrained CS to ${\ell}_p$-constrained case with $p{\geq}1$ and complements the recovery analysis for robust CS with ${\ell}_p$ loss function.

A Bluetooth Scatternet Reformation Algorithm

  • Lee Han-Wook;Kauh Sang-Ken
    • Journal of Communications and Networks
    • /
    • 제8권1호
    • /
    • pp.59-69
    • /
    • 2006
  • Bluetooth is reputed as a wireless networking technology supplying ad-hoc networks between digital devices. In particular, Bluetooth scatternet is an essential part of dynamic ad-hoc networks. Yet, there have not been sufficient researches performed on scatternet environment. This paper proposes a scatternet reformation algorithm for ad-hoc networks for instances where some nodes enter or leave the scatternet. The proposed algorithm is a general algorithm that can be applied to many types of Bluetooth scatternet regardless of the topology. The proposed algorithm is made for two reformation cases, i.e., nodes leaving and nodes entering. For the reformation when nodes leave a scatternet, the recovery node vector (RNV) algorithm is proposed. It has short reformation setup delay because the process involves a single page process (not including inquiry process). For the reformation when nodes enter a scatternet, the entry node algorithm is proposed. This is a simple and easily implementable algorithm. In this paper, real hardware experiments are carried out to evaluate the algorithm's performance where the reformation setup delay, the reformation setup probability and the data transfer rate are measured. The proposed algorithm has shown improvement in the reformation setup delay and probability.

중복구조 실시간 시스템에서의 고장 극복 및 최적 체크포인팅 기법 (Fault Recovery and Optimal Checkpointing Strategy for Dual Modular Redundancy Real-time Systems)

  • 곽성우
    • 대한전자공학회논문지TC
    • /
    • 제44권7호통권361호
    • /
    • pp.112-121
    • /
    • 2007
  • 본 논문에서는 중복 구조 시스템을 이용하여 각 프로세서에서의 출력을 비교하여 효율적으로 고장을 탐지하고, 체크포인팅 기법을 적용하여 과도 고장뿐 아니라 영구적 고장을 극복하기 위한 방법을 제안한다. 매 체크포인터에서는 각 프로세서로부터의 출력과 과거 체크포인터에 저장된 데이터를 불러와 서로 비교한 후 과거 체크포인터로 회귀할지 태스크의 수행을 계속 수행할지 결정한다. 과도 고장과 영구 고장이 발생할 수 있는 상황에서 제안된 체크포인팅 기법을 탑재한 중복 구조 시스템을 마코프 모델을 이용하여 모델링한다. 마코프 모델로부터 실시간 태스크가 데드라인 이내에서 성공적으로 수행을 끝낼 확률을 계산하고, 이 확률식을 이용하여 중복구조 시스템에 탑재할 체크포인터 구간을 최적화한다. 최적화된 체크포인터 구간은 태스크의 성공적 수행 확율을 최대화 하도록 선정하였다.

How to incorporate human failure event recovery into minimal cut set generation stage for efficient probabilistic safety assessments of nuclear power plants

  • Jung, Woo Sik;Park, Seong Kyu;Weglian, John E.;Riley, Jeff
    • Nuclear Engineering and Technology
    • /
    • 제54권1호
    • /
    • pp.110-116
    • /
    • 2022
  • Human failure event (HFE) dependency analysis is a part of human reliability analysis (HRA). For efficient HFE dependency analysis, a maximum number of minimal cut sets (MCSs) that have HFE combinations are generated from the fault trees for the probabilistic safety assessment (PSA) of nuclear power plants (NPPs). After collecting potential HFE combinations, dependency levels of subsequent HFEs on the preceding HFEs in each MCS are analyzed and assigned as conditional probabilities. Then, HFE recovery is performed to reflect these conditional probabilities in MCSs by modifying MCSs. Inappropriate HFE dependency analysis and HFE recovery might lead to an inaccurate core damage frequency (CDF). Using the above process, HFE recovery is performed on MCSs that are generated with a non-zero truncation limit, where many MCSs that have HFE combinations are truncated. As a result, the resultant CDF might be underestimated. In this paper, a new method is suggested to incorporate HFE recovery into the MCS generation stage. Compared to the current approach with a separate HFE recovery after MCS generation, this new method can (1) reduce the total time and burden for MCS generation and HFE recovery, (2) prevent the truncation of MCSs that have dependent HFEs, and (3) avoid CDF underestimation. This new method is a simple but very effective means of performing MCS generation and HFE recovery simultaneously and improving CDF accuracy. The effectiveness and strength of the new method are clearly demonstrated and discussed with fault trees and HFE combinations that have joint probabilities.

2방향 지진하중을 받는 세굴된 교각기초의 파괴확률분석 (Failure Probability of Scoured Pier Foundation under Bi-directional Ground Motions)

  • 김상효;마호성;이상우;김영훈
    • 한국지진공학회:학술대회논문집
    • /
    • 한국지진공학회 2002년도 추계 학술발표회 논문집
    • /
    • pp.300-307
    • /
    • 2002
  • Bridge foundation failure considering the effect of local scour around pier foundations under hi-directional seismic excitations is examined in probabilistic perspectives. The seismic responses of bridges with deep foundations are evaluated with a simplified mechanical model, which can consider the local scour effect around the deep foundation in addition to many other components. The probabilistic characteristics of local scour depths are estimated by using the Monte Carlo simulation. The probabilistic characteristics of basic random variables used in the Monte Carlo simulation are determined from the actual hydraulic data collected in middle size streams in Korea. The failure condition of deep foundation is assumed as bearing capacity failure of the ground below the foundation base. The probability of foundation failure of a simply supported bridge with various scour conditions and hi-directional seismic excitations are examined. It is found that the local scour and the recovery duration are critical factors in evaluating the probability of foundation failure. Moreover, the probability of foundation failure under hi-directional seismic excitations is much higher than under uni-directional seismic excitations. Therefore, it is reasonable to consider hi-directional seismic excitations in evaluating the seismic safety of bridge systems scoured by a flood.

  • PDF

무선 LAN에서의 고속 복구 백오프 기법 (A Fast Recovery Backoff Mechanism for Wireless LAN)

  • 윤희돈;김태현;조성환
    • 한국인터넷방송통신학회논문지
    • /
    • 제10권6호
    • /
    • pp.307-315
    • /
    • 2010
  • IEEE 802.11의 성능 개선을 위한 많은 연구가 있었다. 이 연구들의 대다수는 혼잡 윈도우 크기를 초기화시키는 것을 대신하여 혼잡 윈도우 크기를 천천히 감소시키는 것에 초점을 맞추고 있다. 혼잡 윈도우의 크기를 천천히 감소시키는 것이 충돌 확률을 감소시키고 채널 처리율을 증가시킨다. DEF와 공존하는 이기종 네트워크에서, 이러한 방법은 좋은 결과를 얻기 어렵다. 예를 들어, Gentle DCF(GDCF)는 단일 환경에서 좋은 성능을 보이지만, DCF를 포함하는 이기종 환경에서는 프레임을 거의 전송할 수 없다. 이것은 윈도우 크기를 천천히 감소시키는 것이 전송확률을 감소시키기 때문이다. 이 논문에서 이 문제를 해결하기 위해 고속 복구 DCF(FRDCF) 기법을 제안한다. FRDCF에서는 전송 확률을 높게 유지시키기 위해 DCF의 리셋 방법을 그대로 사용하고, 무선 LAN의 성능을 향상시키기 위해 새로운 카운터를 사용한다. 제안한 FRDCF가 이기종 무선 LAN에서 GDCF와 비교하여 좋은 성능을 갖는 것을 검증하였다.

급성기 안면마비 (Bell's palsy) 환자의 예후 및 치료율에 대한 임상고찰 80례 (The Clinical observation of acute Bell's palsy 80 Case)

  • 원재선;주경옥;조아름;김지현;김창환
    • 한방안이비인후피부과학회지
    • /
    • 제23권2호
    • /
    • pp.151-162
    • /
    • 2010
  • Objective : Bell's palsy is common and has many clinic study. but bell's palsy prognosis is not enough specific. So this study was evaluated bell's palsy prognosis, treatment number, sequela of normal group and bad prognosis group. Methods : From June 2009 to June 2010, patients who visited Dong-seo Oriental Medicine ENT. A clinic study was done on patient who were diagnosed bell's palsy, onset 2weeks within when first visited OPD and treated 3 times over in Dong-seo Oriental Medicine Cental. To evaluate grade of paralysis, House-Brackman Scale was used. We classified treatment numbers of each HB-Scale group, normal gIVroup and bad prognosis group. Results : The distribution of Onset HB-Scale : Gr II 26.25%, Gr III 67.5%, Gr IV 6.25% Onset HB-Scale Gr II patients completely recover 100% Onset HB-Scale Gr III patients completely recover 64.8%, improved 27.8%, nothing change 7.4% Onset HB-Scale Gr IV patients completely recover 40%, improved 60% Onset HB-Scale Gr II & IV patients recovery percentage make no difference of normal group (Group A) and bad prognosis. Onset HB-Scale Gr III patients completely recover Group A 66.7%, Group B 52.9%, improved Group A 23.2%, Group 35.3%, noting change Group A 5.1%, Group B 11.8% Onset HB-Scale Gr II patients has no sequela. Onset HB-Scale Gr III & IV patients has tendency that they treat more times, more improving and less sequela probability Conclusion : Onset HB-Scale is the indicator of acute bell's palsy prognosis.

Recovery-Key Attacks against TMN-family Framework for Mobile Wireless Networks

  • Phuc, Tran Song Dat;Shin, Yong-Hyeon;Lee, Changhoon
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제15권6호
    • /
    • pp.2148-2167
    • /
    • 2021
  • The proliferation of the Internet of Things (IoT) technologies and applications, especially the rapid rise in the use of mobile devices, from individuals to organizations, has led to the fundamental role of secure wireless networks in all aspects of services that presented with many opportunities and challenges. To ensure the CIA (confidentiality, integrity and accessibility) security model of the networks security and high efficiency of performance results in various resource-constrained applications and environments of the IoT platform, DDO-(data-driven operation) based constructions have been introduced as a primitive design that meet the demand of high speed encryption systems. Among of them, the TMN-family ciphers which were proposed by Tuan P.M., Do Thi B., etc., in 2016, are entirely suitable approaches for various communication applications of wireless mobile networks (WMNs) and advanced wireless sensor networks (WSNs) with high flexibility, applicability and mobility shown in two different algorithm selections, TMN64 and TMN128. The two ciphers provide strong security against known cryptanalysis, such as linear attacks and differential attacks. In this study, we demonstrate new probability results on the security of the two TMN construction versions - TMN64 and TMN128, by proposing efficient related-key recovery attacks. The high probability characteristics (DCs) are constructed under the related-key differential properties on a full number of function rounds of TMN64 and TMN128, as 10-rounds and 12-rounds, respectively. Hence, the amplified boomerang attacks can be applied to break these two ciphers with appropriate complexity of data and time consumptions. The work is expected to be extended and improved with the latest BCT technique for better cryptanalytic results in further research.