• Title/Summary/Keyword: recovery probability

Search Result 126, Processing Time 0.031 seconds

Effects of electronic energy deposition on pre-existing defects in 6H-SiC

  • Liao, Wenlong;He, Huan;Li, Yang;Liu, Wenbo;Zang, Hang;Wei, Jianan;He, Chaohui
    • Nuclear Engineering and Technology
    • /
    • v.53 no.7
    • /
    • pp.2357-2363
    • /
    • 2021
  • Silicon carbide is widely used in radiation environments due to its excellent properties. However, when exposed to the strong radiation environment constantly, plenty of defects are generated, thus causing the material performance downgrades or failures. In this paper, the two-temperature model (2T-MD) is used to explore the defect recovery process by applying the electronic energy loss (Se) on the pre-damaged system. The effects of defect concentration and the applied electronic energy loss on the defect recovery process are investigated, respectively. The results demonstrate that almost no defect recovery takes place until the defect density in the damage region or the local defect density is large enough, and the probability of defect recovery increases with the defect concentration. Additionally, the results indicate that the defect recovery induced by swift heavy ions is mainly connected with the homogeneous recombination of the carbon defects, while the probability of heterogeneous recombination is mainly dependent on the silicon defects.

Modeling of a controlled retransmission scheme for loss recovery in optical burst switching networks

  • Duong, Phuoc Dat;Nguyen, Hong Quoc;Dang, Thanh Chuong;Vo, Viet Minh Nhat
    • ETRI Journal
    • /
    • v.44 no.2
    • /
    • pp.274-285
    • /
    • 2022
  • Retransmission in optical burst switching networks is a solution to recover data loss by retransmitting the dropped burst. The ingress node temporarily stores a copy of the complete burst and sends it each time it receives a retransmission request from the core node. Some retransmission schemes have been suggested, but uncontrolled retransmission often increases the network load, consumes more bandwidth, and consequently, increases the probability of contention. Controlled retransmission is therefore essential. This paper proposes a new controlled retransmission scheme for loss recovery, where the available bandwidth of wavelength channels and the burst lifetime are referred to as network conditions to determine whether to transmit a dropped burst. A retrial queue-based analysis model is also constructed to validate the proposed retransmission scheme. The simulation and analysis results show that the controlled retransmission scheme is more efficient than the previously suggested schemes regarding byte loss probability, successful retransmission rate, and network throughput.

Improved Conditional Differential Attacks on Round-Reduced Grain v1

  • Li, Jun-Zhi;Guan, Jie
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.12 no.9
    • /
    • pp.4548-4559
    • /
    • 2018
  • Conditional differential attack against NFSR-based cryptosystems proposed by Knellwolf et al. in Asiacrypt 2010 has been widely used for analyzing round-reduced Grain v1. In this paper, we present improved conditional differential attacks on Grain v1 based on a factorization simplification method, which makes it possible to obtain the expressions of internal states in more rounds and analyze the expressions more precisely. Following a condition-imposing strategy that saves more IV bits, Sarkar's distinguishing attack on Grain v1 of 106 rounds is improved to a key recovery attack. Moreover, we show new distinguishing attack and key recovery attack on Grain v1 of 107 rounds with lower complexity O($2^{34}$) and appreciable theoretical success probability 93.7%. Most importantly, our attacks can practically recover key expressions with higher success probability than theoretical results.

Modeling TCP Loss Recovery for Random Packet Losses (임의 패킷 손실에 대한 TCP의 손실 복구 과정 모델링 및 분석)

  • Kim, Beom-Joon;Kim, Dong-Yeon;Lee, Jai-Yong
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.28 no.4B
    • /
    • pp.288-297
    • /
    • 2003
  • The fast retransmit and fast recovery algorithm of TCP Reno, when multiple packets in the same window are lost, cannot recover them without RTO (Retransmission Timeout). TCP New-Reno can recover multiple lost packets by extending fast recovery using partial acknowledgement. If the retransmitted packet is lost again during fast recovery, however, RTO cannot be avoided. In this paper, we propose an algorithm called "Duplicate Acknowledgement Counting(DAC)" to alleviate this problem. DAC can detect the retransmitted packet loss by counting duplicate ACKs. Conditions that a lost packet can be recovered by loss recovery of TCP Reno, TCP New-Reno and TCP New-Reno using DAC are derived by modeling loss recovery behavior of each TCP. We calculate the loss recovery probability for random packet loss probability numerically, and show that DAC can improve loss recovery behavior of TCP New-Reno.

A Solution for Sourcing Decisions under Supply Capacity Risk (공급능력 리스크를 고려한 최적 구매계획 해법)

  • Jang, Won-Jun;Park, Yang-Byung
    • Journal of Korean Institute of Industrial Engineers
    • /
    • v.42 no.1
    • /
    • pp.38-49
    • /
    • 2016
  • This paper proposes a mathematical model-based solution for sourcing decisions with an objective of minimizing the manufacturer's total cost in the two-echelon supply chain with supply capacity risk. The risk impact is represented by uniform, beta, and triangular distributions. For the mathematical model, the probability vector of normal, risk, and recovery statuses are developed by using the status transition probability matrix and the equations for estimating the supply capacity under risk and recovery statuses are derived for each of the three probability distributions. Those formulas derived are validated using the sampling method. The results of the simulation study on the test problem show that the sourcing decisions using the proposed solution reduce the total cost by 1.6~3.7%, compared with the ones without a consideration of supply capacity risk. The total cost reduction increases approximately in a linear fashion as the probability of risk occurrence or reduction rate of supply capacity due to risk events is increased.

A Study on Classification and Recovery Method of Damaged Electronic Records (손상된 전자기록물 구분과 복원 방법에 관한 연구)

  • Kim, Jihun;Choi, Wonhyok
    • Journal of the Korea Institute of Information Security & Cryptology
    • /
    • v.29 no.1
    • /
    • pp.139-147
    • /
    • 2019
  • In this paper we propose a method to distinguish damaged electronic records and an electronic record recovery method according to damage type. The proposed classification engine and recovery engine classify damaged electronic records based on the form and structure of electronic records and increase the probability of recovery according to the damaged form. Through this process, we propose a method to minimize the electronic records that are destroyed and verify them through experiments.

Reweighted L1 Minimization for Compressed Sensing

  • Lee, Hyuk;Park, Sun-Ho;Shim, Byong-Hyo
    • Proceedings of the Korean Society of Broadcast Engineers Conference
    • /
    • 2010.07a
    • /
    • pp.61-63
    • /
    • 2010
  • Recent work in compressed sensing theory shows that m${\times}$n independent and identically distributed sensing matrices whose entries are drawn independently from certain probability distributions guarantee exact recovery of a sparse signal with high probability even if m${\ll}$n. In particular, it is well understood that the L1 minimization algorithm is able to recover sparse signals from incomplete measurements. In this paper, we propose a novel sparse signal reconstruction method that is based on the reweighted L1 minimization via support recovery.

  • PDF

An Analysis of System Fault (시스템 오류 분석)

  • Seong, Soon-Yong
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • v.9 no.2
    • /
    • pp.927-930
    • /
    • 2005
  • ACSR is a timed process algebra for the specification and analysis of real-time systems, which supports synchronous timed actions and asynchronous instantaneous events. PACSR is an extended ACSR with the notion of probabilities in selection operation. Using PACSR, this paper represents a system fault occurrence and recovery from the fault in the general resource alteration system. The result shows that system fault occurrence can be analyzed from the fault occurrence probability and the recovery probability.

  • PDF

A Study on the Service life of the Building Components in the Apartment Housing (공동주택 구성재의 내용년수 산정방법에 관한 연구)

  • Lee Kang-Hee;Chang Jung-Hee;Chae Chang-U
    • Journal of the Korean housing association
    • /
    • v.16 no.5
    • /
    • pp.67-74
    • /
    • 2005
  • The performance of building should be deteriorated with time while the building would maintain and manage the function and performance to get a living condition. For the efficient maintenance of the building, the repair cycle would be provided and applied during the service-life time. The service-life time of the building components would be needed to determine the repair time and the repair scope. The service-life time of the building components would be calculated with the 1st repair time and the recovery rate of the performance, considering the recovery rate after repaired. In this paper, the 1st repair time would be estimated with the normal probability distribution, choice probability and 3rd quadratic function. The recovery rate of the building components assumes various level according to the research target and utility area. The results of this study are as follows ; first, most of the components of the building work would range about 30 years in the service-life time and the components of the mechanical works range from 28 years to 37 years, those of the electrical works would be about 31 years.

Enhancements to the fast recovery Algorithm of TCP NewReno using rapid loss detection (빠른 손실 감지를 통한 TCP NewReno의 Fast Recovery 개선 알고리듬)

  • 김동민;김범준;김석규;이재용
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.29 no.7B
    • /
    • pp.650-659
    • /
    • 2004
  • Domestic wireless network environment is changing rapidly while adapting to meet service requirements of users and growth of market. As a result, reliable data transmission using TCP is also expected to increase. Since TCP assumes that it is used in wired networt TCP suffers significant performance degradation over wireless network where packet losses are not always result of network congestion. Especially RTO imposes a great performance degradation of TCP. In this paper, we propose DAC$^{+}$ and EFR in order to prevent performance degradation by quickly detecting and recovering loss without RTO during fast recovery. Compared with TCP NewReno, proposed scheme shows improvements in steady-state in terms of higher fast recovery Probability and reduced response time.