Optimal locally repairable codes with information locality are considered. constructed, whose length is also order-optimal respect to a new bound on the code derived in this article. The of constructed super-linear alphabet size, which improves upon well known pyramid codes, only linear size. recoverable erasure patterns analyzed for codes. Based patterns, we construct generalized sector-disk (...

Redundancy allocation problem is one of the most important problem in Reliability area. In this problem the reliability and availability of the systems maximized via allocating redundant components to sub-systems. a systems operates normally in its operational mode but fails in either opened or shorted modes. this paper presents a repairable k_out_of_n systems network model with common cause fa...

Optimizing incremental view maintenance is an important problem in data warehousing. One popular technique, view self-maintenance, proposed computing the required view updates without using the underlying base relations. Traditionally, self-maintainability of a view is determined solely based on the view definition, independent of the state of the base relations. However, this “compile-time” ap...

Counting processes are used in modelling of repairable systems. In Bayesian parameter inference the choice of fitted prior distributions and loss functions has great importance. This paper deals with studies of prior and posterior densities. Simulation enables comparisons of estimators obtained with different loss functions. Especially, in the case of a Weibull process, properties relative to p...

The process of deterioration of repairable systems with each repair is modeled using converging geometric-type processes. It is proved that the expectation of the number of repairs in each interval of time is infinite. A new regularization procedure is suggested and the corresponding optimization problem is discussed.