Derivation of a Scalable Solution for the Problem of Factoring an n-bit Integer

Alsalami

2020

JAMCS

In order to assess the performance indexes of some practical systems having fixed channel capacities, such as telecommunication networks, power transmission systems or commodity pipeline systems, we propose various types of techniques for analyzing a capacitated network. These include Karnaugh maps, capacity-preserving network reduction rules associated with delta-star transformations, and a generalization of the max-flow min-cut theorem. All methods rely on recognizing the network capacity function as a random pseudo-Boolean function of link successes; a fact that allows the expected value of this function to be easily obtainable from its sum-of-products expression. This network capacity has certain advantages for representation of nonbinary discrete random functions, mostly employed in the analysis of flow networks. Five tutorial examples demonstrate the afore-mentioned methods and illustrate their computational advantages over the exhaustive state enumeration method.

Section: Nomenclaturementioning

confidence: 99%

Section: A Map Proceduresmentioning

confidence: 99%

See 1 more Smart Citation

A Tutorial Exposition of Various Methods for Analyzing Capacitated Networks

Alsalami

2020

JAMCS

“…Our work herein combines the probability and multi-value notions by adapting the map to multi-valued reliability calculations. We modify a regular form of the binary eight-variable Karnaugh map (of 2 8 = 256 cells) [62][63][64] for use as a map of 256 = 4 4 cells representing four variables that are four-valued each.…”

mentioning

confidence: 99%

“…2-11 is a Karnaugh map of four four-valued inputs , , and . This map is considerably large as it has 4 4 = 256 cells, and is simply an adaptation of a map of eight binary variables that has the same number of cells (2 8 = 256), introduced earlier in[62][63][64]. Each of the maps inFigs.…”

mentioning

confidence: 99%

Reliability Analysis of a Commodity-Supply Multi-State System Using the Map Method

Alsayegh

2019

JAMCS

A multi-state k-out-of-n: G system is a multi-state system whose multi-valued success is greater than or equal to a certain value j (lying between 1 (the lowest non-zero output level) and M (the highest output level)) whenever at least km components are in state m or above for all m such that 1 ≤ m ≤ j. This paper is devoted to the analysis of a commodity-supply system that serves as a standard gold example of a non-repairable multi-state k-out-of-n: G system with independent non-identical components. We express each instance of the multi-state system output as an explicit function of the multi-valued inputs of the system. The ultimate outcome of our analysis is a Multi-Valued Karnaugh Map (MVKM), which serves as a natural, unique, and complete representation of the multi-state system. To construct this MVKM, we use “binary” entities to relate each of the instances of the output to the multi-valued inputs. These binary entities are represented via an eight-variable Conventional Karnaugh Map (CKM) that is adapted to a map representing four variables that are four-valued each. Despite the relatively large size of the maps used, they are still very convenient, thanks to their regular structure. No attempt was made to draw loops on the maps or to seek minimal formulas. The maps just served as handy tools for combinatorial representation and for collectively implementing the operations of ANDing, ORing, and complementation. The MVKM obtained serves as a means for symbolic analysis yielding results that agree numerically with those obtained earlier. The map is a useful tool for visualizing many system properties, and is a valuable resource for computing a plethora of Importance Measures for the components of the system.

Utilization of Symmetric Switching Functions in the Symbolic Reliability Analysis of Multi-State k-out-of-n Systems

Int J Math, Eng, Manag Sci

2019

Symmetric switching functions (SSFs) play a prominent role in the reliability analysis of a binary k-out-of-n: G system, which is a dichotomous system that is successful if and only if at least k out of its n components are successful. The aim of this paper is to extend the utility of SSFs to the reliability analysis of a multi-state k-out-of-n: G system, which is a multi-state system whose multi-valued success is greater than or equal to a certain value j (lying between 1 (the lowest output level) and M (the highest output level)) whenever at least km components are in state m or above for all m such that 1 ≤ m ≤ j. This paper is devoted to the analysis of non-repairable multi-state k-out-of-n: G systems with independent non-identical components. The paper utilizes algebraic techniques of multiple-valued logic (together with known properties of SSFs) to evaluate each of the multiple levels of the system output as an individual binary or propositional function of the system multi-valued inputs. The formula of each of these levels is then written as a probability–ready expression, thereby allowing its immediate conversion, on a one-to-one basis, into a probability or expected value. The symbolic reliability analysis of a commodity-supply system (which serves as a standard gold example of a multi-state k-out-of-n: G system) is completed successfully herein, yielding results that have been checked symbolically, and also were shown to agree numerically with those obtained earlier.