Please use this identifier to cite or link to this item:
http://hdl.handle.net/10553/44519
| Title: | Generalized top and bottom binary n-tuples | Authors: | González, L. | UNESCO Clasification: | 1208 Probabilidad 110202 Algebra de Boole |
Keywords: | Bottom binary n-tuples Complementary binary n-tuples Complex stochastic Boolean systems Generalized bottom binary n-tuples Generalized top binary n-tuples, et al |
Issue Date: | 2008 | Project: | Simulacion Numerica de Campos de Viento Orientados A Procesos Atmofericos. Diagnostico y Prediccion de Recursos Eolicos y Solares. |
Conference: | 6th International Conference on Engineering Computational Technology, ECT 2008 | Abstract: | A complex stochastic Boolean system (CSBS) depends on an arbitrary number n of random Boolean variables. The behavior of a CSBS is determined by the ordering between the occurrence probabilities Pr {u} of the 2 n associated binary strings u ∈ {0, 1} n. In this context, a binary n-tuple is called top (bottom, respectively) if its occurrence probability is always among the 2 n-1largest (smallest, respectively) ones. In this paper we generalize these n-tuples by defining and studying the k-top and k-bottom binary n-tuples, i.e., those whose occurrence probabilities are always among the k largest (smallest, respectively) ones (1 < k < 2 n). These results can be applied to the reliability analysis of many different technical systems, arising from diverse fields of Engineering. © 2008 Civil-Comp Press. | URI: | http://hdl.handle.net/10553/44519 | ISBN: | 978-1-905088-24-9 | Source: | Proceedings of the 6th International Conference on Engineering Computational Technology. |
| Appears in Collections: | Actas de congresos |
Items in accedaCRIS are protected by copyright, with all rights reserved, unless otherwise indicated.