In this paper, locally repairable codes with all-symbol locality are studied. Methods to modify already existing codes are presented. Also, it is shown that with high probability, a random matrix with a few extra columns guaranteeing the locality property, is a generator matrix for a locally repairable code with a good minimum distance. The proof of this gives also a constructive method to find...

We report a draft genome assembly of Streptomyces sp. strain Mg1, a competitive soil isolate with multiple secondary metabolite gene clusters.

this paper presents a discrete-time single-server finite buffer n threshold policy queue with renewal input and discretemarkovian service process. the server terminates service whenever the system becomes empty, and recommencesservice as soon as the number of waiting customers in the queue is n. we obtain the system-length distributionsat pre-arrival and arbitrary epochs using the supplementary...

Human submandibular/sublingual gland secretions contain a multimeric high molecular weight mucin (MG1) and a monomeric low molecular weight mucin (MG2). MG2 is the product of the MUC7 gene, whereas the gene for MG1 has not been identified. Previously, we isolated a clone (pSM2-1) from a human sublingual gland cDNA expression library using an antibody against deglycosylated MG1 (Troxler et al., ...

This paper presents a decomposition technique for the service station reliability in a discrete-time repairable Geom/G/1 queueing system, in which the server takes exhaustive service and multiple adaptive delayed vacation discipline. Using such a novel analytic technique, some important reliability indices and reliability relation equations of the service station are derived. Furthermore, the s...

Consider a single server queue in which the service station may breakdown according to a Poisson process with rates γ in busy time and γ’ in idle time respectively. After a breakdown, the service station will be repaired immediately and the repair time is assumed to have an exponential distribution with rate δ. Suppose the arrival time has an exponential distribution with rate λ, and the probab...

Constructing locally repairable codes achieving Singleton-type bound (we call them optimal codes in this paper) is a challenging task and has attracted great attention in the last few years. Tamo and Barg [14] first gave a breakthrough result in this topic by cleverly considering subcodes of Reed-Solomon codes. Thus, q-ary optimal locally repairable codes from subcodes of Reed-Solomon codes giv...

MTBF (mean time between failures) is the expected time between two successive failures of a system. Therefore, MTBF is a key reliability metric for systems that can be repaired or restored. MTTF (mean time to failure) is the expected time to failure of a system. Non-repairable systems can fail only once. Therefore, for a non-repairable system, MTTF is equivalent to the mean of its failure time ...

Systems often operate over a set of time periods, known as phases, in which their reliability structure varies and many include both repairable and nonrepairable components. Success for such systems is defined as the completion of all phases, known as a phased mission, without failure. An example of such a system is an aircraft landing gear system during a flight. The Binary Decision Diagram (B...