Checkpoint/restart is an important mechanism for system fault tolerance. It saves the state of an executing program periodically and recovers it after a failure. As many applications involve file operations, supporting file rollbacks is essential for checkpoint/restart. Complete backup can restore files to the correct state, but its cost is too high. In this paper we propose a behavior based file checkpointing strategy (BBFC), which provides a correct recovery of file data and ensures consistency between file state and other states of a process when a rollback is done by restarting the program from the last checkpoint. BBFC classifies details of the file operation behaviors and provides a guidance on what to be saved during file checkpointing according to those behaviors. It dramatically minimizes the overhead of file checkpointing due to the reduction of file data which need to be saved. And it is transparent and easy to use.

The problem is concerned about computing virtual coordinates for greedy routing in a wireless ad hoc network. Consider a set of wireless nodes S densely deployed inside a geometric domain R2. Nodes within communication range can directly communicate with each other. We ask whether one can compute a set of virtual coordinates for S such that greedy routing has guaranteed delivery. In particular, each node forwards the message to the neighbor whose distance to the destination, computed under the virtual coordinates and some metric function d, is the smallest. If such a neighbor can always be found, greedy routing successfully delivers the message to the destination. The problem can be phrased as finding a greedy embedding of S in some geometric space, such that greedy routing always succeeds. In the setting of this entry, we assume that the nodes are a dense sample of the domain such that

Introduction. This paper presents a study protocol for a comparative effectiveness evaluation of abiraterone acetate against enzalutamide in clinical practice, two cancer drugs given to patients suffering from advanced prostate cancer. Method and analysis. The protocol designs a comparative-effectiveness analysis of abiraterone acetate against enzalutamide. With the substantial number of covariates a two-step procedure is suggested in choosing relevant covariates in the matching design. In the first step, an exploratory factor analysis reduces the dimension of a large set of continuous covariates to nine factors. In the second step, we reduce the dimension of the covariates, interactions and second order terms for the continuous covariates using propensity score estimation. The final design makes use of a genetic matching algorithm. The study protocol provides a detailed statistical analysis plan of the analysis sample derived from the matching design. The analysis will make use of linear regression and robust inference adjusted for multisignificance testing. Discussion. As in a randomised experiment the focus is on the design of the assignment to treatment. This allows the publication of this preanalysis plan before having access to outcome data. This means that the p values will be correct if the maintained assumption of uncounfoundedness is valid. Given that is p-hacking is substantial problem in empirical research, this is a substantial strength of this study. However, while design yields, balance on the observed covariates one cannot discard the possibility that unobserved confounders are not balanced. For that reason, sensitivity tests for the maintained assumption of uncounfoundedness are presented. Ethics and dissemination. The study was approved by the Regional Ethical Review Board in Uppsala, Sweden (Dnr 2017/482). Results will be published in a peer-reviewed journal and distributed to relevant stakeholders in healthcare.

No abstract uploaded!

No abstract uploaded!