Achieving System Reliability with the Fewest Identical Components
Journal Title: Journal of Advances in Mathematics and Computer Science - Year 2017, Vol 24, Issue 6
Abstract
enerally, redundancy allocation problems are NP-hard. This paper presents an explicit polynomially bounded algorithm for a special class of redundancy allocation models.
Authors and Affiliations
Benedict Nmah
Keywords
Related Articles
- EP ID EP322577
- DOI 10.9734/JAMCS/2017/36521
- Views 106
- Downloads 0
The Generalized Reed-Muller Codes in a Modular Group Algebra
We study some properties of the modular group algebra of the additive group of a Galois ring over a nite eld. A description of the Generalized Reed-Muller codes in this group algebra is presented.
Design of DNA Based Biometric Security System for Examination Conduct
Biometrics is a technique of using characteristics and behavioral traits for identification of people this is more effective that common personal identification number(PIN) for an improved security technique. The basic p...
A Deterministic Model of ART on HIV Spread Outcomes: A Case Study in Tanzania
This is about understanding in a mathematical perspective, how the introduction of antiretroviral therapy (ART) is shaping the spread of HIV. A non-linear mathematical model for HIV transmission in a variable size popula...
Modelling Grammaticality-grading in Natural Language Systems Using a Vector Space Approach
There exist several natural language processing systems that focus on checking the grammaticality (grammatical correctness or incorrectness) of natural language texts. Studies however showed that most existing systems do...
A Novel Method for Compact Listing of All Particular Solutions of a System of Boolean Equations
Any system of ‘big’ Boolean equations can be reduced to a single Boolean equation {g(Z)=1}. We propose a novel method for producing a general parametric solution for such a Boolean equation without attempting to minimize...