A parallel (2, n – 2)-system is investigated here where two units start their operation simultaneously and any one of them is replaced instantaneously upon its failure by one of the (2; n – 2) warm standbys. We assume availability of n non-identical, non-repairable units. The unit-lifetimes in full operational mode and in partial operational mode have general distribution functions Gi and Hi (i...

SUMMARY The top-scoring pair (TSP) and top-scoring triplet (TST) algorithms are powerful methods for classification from expression data, but analysis of all combinations across thousands of human transcriptome samples is computationally intensive, and has not yet been achieved for TST. Implementation of these algorithms for the graphics processing unit results in dramatic speedup of two orders...

A one-unit repairable system, supported by r repair facilities and s spare units, fails when all units are down and are undergoing or awaiting repair. Under the perfect repair policy and instantaneous commencement of repair and installation to operation, the limiting average availability of the system is obtained when the lifetime has a density function and the repair time is exponentially dist...

This paper addresses a simple, yet fundamental question in the design of peer-to-peer systems: What does it mean when we say “availability” and how does this understanding impact the engineering of practical systems? We argue that existing measurements and models do not capture the complex timevarying nature of availability in today’s peer-to-peer environments. Further, we show that unforeseen ...

This chapter describes the concept of information availability (IAV) which is considered an important element of information security. IAV is defined as the ability to make information and related resources accessible as needed, when they are needed, where they are needed. In the view of the authors, this notion encompasses more than just making sure that the information technology (IT) infrast...

Calendar Availability draft-daboo-calendar-availability-03 Abstract This document specifies a new iCalendar calendar component that allows the publication of available and unavailable time periods associated with a calendar user. This component can be used in standard iCalendar free-busy lookups, including iTIP free-busy requests, to generate repeating blocks of available or busy time with exce...