of the bachelor's thesis Abstract: Locally repairable codes (LRCs) are error correcting codes used in distributed data storage. A traditional approach is to look for codes which simultaneously maximize error tolerance and minimize storage space consumption. However, this tends to yield codes for which error correction requires an unrealistic amount of communication between storage nodes. LRCs s...

Many of the most promising applications for mobile robots require very high reliability. The current generation of mobile robots is, for the most part, highly unreliable. The few mobile robots that currently demonstrate high reliability achieve this reliability at a high financial cost. In order for mobile robots to be more widely used, it will be necessary to find ways to provide high mission ...

The paper studies a model of repairable systems which is exible enough to incorporate the standard imperfect repair and many other models from the literature. Palm stationarity of virtual ages, inter-failure times and degrees of repair is studied. A Loynes type scheme and Harris recurrent Markov chains combined with coupling methods are used. Results on the weak, total variation and moment conv...

We consider a one-unit repairable system under continuous monitoring and a perfect repair policy, with instantaneous commencement of repair and installation to operation. For arbitrary continuous failure time and repair time distributions, we study the problems of point estimation, one-sided confidence interval estimation and hypothesis testing for the limiting availability, based on a random s...