• The Journal of Asian Finance, Economics and Business
• /
• v.6 no.1
• /
• pp.129-139
• /
• 2019

The purpose of this research is to examine the effect of informational justice on post-recovery satisfaction, and the effect of post-recovery satisfaction on behavioral intentions in e-commerce, including further investigate the moderating effect of service failure severity. Using quantitative method, the population of this research are online customers in Indonesia, with non-probability sampling that will be done by purposive sampling method based on predetermined criterias, which are customers who were doing transactions in the Business to Consumer (B2C) online sites, experienced service failure in the last 6 months, submitted a complaint, and received a response. Sample of 317 online customers were gathered and analyzed using the Structural Equation Modeling. The results of this study indicated that 5 hypothesis are supported with data. As a conclusion, informational justice and post-recovery satisfaction has positive effect, while service failure severity acts as a moderator between post-recovery satisfaction and behavioral intentions. As a managerial implication, online store management needs to ensure the informational justice to make a post-recovery satisfaction. Therefore, online store management needs to ensure the informational justice to make a post-recovery satisfaction, increase repurchase and positive e-word of mouth intention, also work harder to recover services, especially in high service failure severity condition.

• Journal of Communications and Networks
• /
• v.6 no.3
• /
• pp.235-244
• /
• 2004

There have been a lot of approaches to evaluate and predict transmission control protocol (TCP) performance in a numerical way. Especially, under the recent advance in wireless transmission technology, the issue of TCP performance over wireless links has come to surface. It is because TCP responds to all packet losses by invoking congestion control and avoidance algorithms, resulting in degraded end-to-end performance in wireless and lossy systems. By several previous works, although it has been already proved that overall TCP performance is largely dependent on its loss recovery performance, there have been few works to try to analyze TCP loss recovery performance with thoroughness. In this paper, therefore, we focus on analyzing TCP's loss recovery performance and have developed a simple model that facilitates to capture the TCP sender's behaviors during loss recovery period. Based on the developed model, we can derive the conditions that packet losses may be recovered without retransmission timeout (RTO). Especially, we have found that TCP Reno can retransmit three packet losses by fast retransmits in a specific situation. In addition, we have proved that successive three packet losses and more than four packet losses in a window always invoke RTO easily, which is not considered or approximated in the previous works. Through probabilistic works with the conditions derived, the loss recovery performance of TCP Reno can be quantified in terms of the number of packet losses in a window.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.3B
• /
• pp.130-137
• /
• 2005

Wireless communication environment is changing rapidly as we use new wireless communication technology such as WiBro to access high speed Internet. As a result, reliable data transmission using TCP is also expected to increase. Since TCP assumes that it is used in wired network, TCP suffers significant performance degradation over wireless network where packet losses are related to non-congestion loss. Especially RTO imposes a great performance degradation of TCP. In this paper, we analyze the loss recovery probabilities based on previous researches, and use simulation results of our algorithm to show that it prevents performance degradation by quickly detecting and recovery losses without RTO during fast recovery.

• Journal of Radiation Industry
• /
• v.10 no.4
• /
• pp.199-204
• /
• 2016

The dependence of cell survival on exposure dose and the duration of the liquid-holding recovery (LHR) was obtained for diploid yeast cells irradiated with ionizing radiation of different linear energy transfer (LET) and recovering from radiation damage without and with various concentrations of cisplatin - the most widely used anticancer drug. The ability of yeast cells to recover from radiation damage was less effective after cell exposure to high-LET radiation, when cells were irradiated without drug. The increase in cisplatin concentration resulted in the disappearance of this difference whereas the fraction of irreversible damage was permanently enlarged independently of radiation quality. The probability of cell recovery was shown to be constant for various conditions of irradiation and recovery. A new mechanism of cisplatin action was suggested according with which the inhibition of cell recovery after exposure to ionizing radiations was completely explained by the production of irreversible damage.

• Journal of Digital Contents Society
• /
• v.6 no.1
• /
• pp.41-48
• /
• 2005

In this paper, we propose and evaluate symbol timing recovery algorithm for S-DMT cable modern, which supports more channels and better quality symmetric mutimedia service over HFC network. We adopt timing recovery algorithm of PN sequence insertion in time domain and evaluate the performance of it in various noise channel such as AWGN, ISI, impulse. We verified that performance of this algorithm is depends on the channel noise environment and sampling clock offset and that over 10 dB degradation of Eb/No is occurred at the timing failure probability of $10^3$ in the composite noise channel of AWGN, ISI, and impulse in comparison with impulse noise-alone channel. finally, we verified that this algorithm showed good timing failure probability in case of sampling clock optimization was performed in advance.

• Journal of Ocean Engineering and Technology
• /
• v.28 no.1
• /
• pp.69-76
• /
• 2014

Survivability assessments and vulnerability reductions are required in warship design. A warship's survivability is assessed by its susceptibility, vulnerability, and recoverability. In this paper, an integrated survivability assessment for a warship subjected to multiple hits is introduced. The methodology aims at integrating a survivability assessment into an early stage of warship design. The hull surface is idealized using typical geometries for RCS (Radar Cross Section) detection probability and susceptibility. The Vulnerability is evaluated by using the shot-line. The recoverability is estimated using a survival time analysis. This enables the variation of survivability to be assessed. Several parameters may be varied to determine their effects on the survivability. The susceptibility is assessed by the probability of detecting the radar cross section of the subject and the probability of being hit based on a probability density function. The vulnerability is assessed by the kill probability based on the vulnerable area of critical components, according to the component's layout and redundancy. Recoverability is assessed by the recovery time for damaged critical components.

• Journal of the Korean Society for Industrial and Applied Mathematics
• /
• v.19 no.1
• /
• pp.23-45
• /
• 2015

We consider counterparty risk in CDS rates. To do so, we use a multivariate jump diffusion process for obligors' default intensity, where jumps (i.e. magnitude of contribution of primary events to default intensities) occur simultaneously and their sizes are dependent. For these simultaneous jumps and their sizes, a homogeneous Poisson process. We apply copula-dependent default intensities of multivariate Cox process to derive the joint Laplace transform that provides us with joint survival/default probability and other relevant joint probabilities. For that purpose, the piecewise deterministic Markov process (PDMP) theory developed in [7] and the martingale methodology in [6] are used. We compute survival/default probability using three copulas, which are Farlie-Gumbel-Morgenstern (FGM), Gaussian and Student-t copulas, with exponential marginal distributions. We then apply the results to calculate CDS rates assuming deterministic rate of interest and recovery rate. We also conduct sensitivity analysis for the CDS rates by changing the relevant parameters and provide their figures.

• Journal of Communications and Networks
• /
• v.13 no.4
• /
• pp.393-399
• /
• 2011

We evaluate the link-level performance of cooperative multi-hop relaying networks with an maximum distance separable (MDS) code. The effect of the code on the link-level performance at the destination is investigated in terms of the outage probability and the spectral efficiency. Assuming a simple topology, we construct an absorbing Markov chain. Numerical results indicate that significant improvement can be achieved by incorporating an MDS code. MDS codes successfully facilitate recovery of the message block at a relaying node due to powerful error-correcting capability, so that it can reduce the outage probability. Furthermore, we evaluate the average number of hops where the message block can be delivered.

• Journal of Internet Computing and Services
• /
• v.7 no.1
• /
• pp.59-64
• /
• 2006

Harn al proposed a GKRS(Global Key Recovery System) that combines the functions of the key recovery authorities and the public key certification authorities(CA), Among other features, user dominance(i.e, a user is allowed to select his own public-private key pair and especially a public element for verifying the validity of the public-private key pair)is proposed by [1] for wide acceptance of GKRS. In this paper, we attack the RSA version of GKRS by showing that its user-dominance feature and the corresponding key verification scheme employed by the CA allow for fraud by users against CA. We propose more secure GKPS than original GKPS, The proposed system makes the probability of user fraud negligible small.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.13 no.10
• /
• pp.5058-5077
• /
• 2019

Traditional regenerating codes are designed to tolerate node failures with optimal bandwidth overhead. However, there are many types of partial failures inside the node, such as latent sector failures. Recently, proposed regenerating codes can also repair intra-node failures with node-level redundancy but incur significant bandwidth and I/O overhead. In this paper, we construct a new scheme of regenerating codes, called IR-RBT codes, which employs intra-node redundancy to tolerate intra-node failures and serve as the help data for other nodes during the repair operation. We propose 2 algorithms for assigning the intra-node redundancy and RBT-Helpers according to the failure probability of each node, which can flexibly adjust the helping relationship between nodes to address changes in the actual situation. We demonstrate that the IR-RBT codes improve the bandwidth and I/O efficiency during intra-node failure repair over traditional regenerating codes but sacrifice the storage efficiency.