Redundancy technique is known as a way to enhance the reliability and availability of non-reparable systems, but for repairable systems, another factor is getting prominent called as the number of maintenance resources. In this study, availability optimization of series-parallel systems is modelled by using Markovian process by which the number of maintenance resources is located into the obje...

With the popularity of multilevel design in large scale systems, reliability redundancy allocation on multilevel systems is becoming attractive to researchers. Multilevel redundancy allocation problem (MLRAP) is not only NP-hard, but also qualifies as hierarchy optimization problem. Exact method could not tackle MLRAP very well, so heuristic and meta-heuristic methods are often used to solve it...

Reliability optimization problem has a wide application in engineering area. One of the most important problems in reliability is redundancy allocation problem (RAP). In this research, we worked on a RAP with repairable components and k-out-of-n sub-systems structure. The objective function was to maximize system reliability under cost and weight constraints. The aim was determining optimal com...

Bi-objective optimization of the availability allocation problem in a series–parallel system with repairable components is aimed in this paper. The two objectives of the problem are the availability of the system and the total cost of the system. Regarding the previous studies in series–parallel systems, the main contribution of this study is to expand the redundancy allocation problems to syst...

This work discusses implementation of partial redundancy elimination using the value flow graph, a syntactic program representation modeling semantic equivalences. It allows the combination of simple syntactic partial redundancy elimination with a powerful semantic analysis. This yields an optimization that is computationally optimal and simpler than traditional semantic methods. A source-to-so...

The gradient geometry-optimization procedure is reformulated in terms of redundant internal coordinates. By replacing the matrix inverse with the generalized inverse, the usual NewtonRaphson-type algorithms can be formulated in exactly the same way for redundant and nonredundant coordinates. Optimization in redundant coordinates is particularly useful for bridged polycyclic compounds and cage s...

We consider the problem of decomposing the total mutual information conveyed by a pair of predictor random variables about a target random variable into redundant, unique and synergistic contributions. We focus on the relationship between “redundant information” and the more familiar informationtheoretic notions of “common information.” Our main contribution is an impossibility result. We show ...

Among the diierent r/n redundancies, it is necessary to distinguish between the (classic) case of active redundancies (hot standby) and the case of passive redundancies (cold standby) presenting failures at calling instant. This paper deals with passive redundancy including such solicitation failures: redundancy elements only operate in case of the failure of initial elements and have a non neg...