Identificador persistente para citar o vincular este elemento:
http://hdl.handle.net/10553/72524
Título: | Complex stochastic boolean systems: generating and counting the binary n-tuples intrinsically less or greater than u | Autores/as: | González, Luis | Clasificación UNESCO: | 1208 Probabilidad | Palabras clave: | Order graph Probabilities Complex stochastic boolean systems Hamming weight Intrinsic order, et al. |
Fecha de publicación: | 2009 | Publicación seriada: | Lecture notes in engineering and computer science | Conferencia: | World Congress on Engineering and Computer Science (WCECS 2009) | Resumen: | A complex stochastic Boolean system (CSBS) is a system depending 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 n-tuples u = (u(1), ..., u(n)) is an element of {0, 1}(n). In this context, for every fixed binary n-tuple u, this paper presents two simple algorithms-exclusively based on the vector of positions of the 1-bits (0-bits, respectively) in u for rapidly generating (and counting) all the binary n-tuples v whose occurrence probabilities Pr {v} are always less than or equal to (greater than or equal to, respectively) Pr{u}. Results are illustrated with the intrinsic order graph and they obey to a nice duality property (interchange 0s by 1s and "more probable" by "less probable"). | URI: | http://hdl.handle.net/10553/72524 | ISBN: | 978-988-17012-6-8 | ISSN: | 2078-0958 | Fuente: | WCECS 2009: World Congress on Engineering and Computer Science [ISSN 2078-0958], v. I, p.195-200, (2009) |
Colección: | Actas de congresos |
Los elementos en ULPGC accedaCRIS están protegidos por derechos de autor con todos los derechos reservados, a menos que se indique lo contrario.