Zobrazeno 1 - 10
of 24
pro vyhledávání: '"Luis G. Diaz"'
Autor:
Beau Bruneau, Kristin Surdam, Amy Bland, Amy Krueger, Andrew Wise, Ani Cotarlan, Asher Leviton, Elena Jouravleva, Grace Fitzgerald, Heather N. Frost, Honora F. Cutler, Joshua Buddle, Luis G. Diaz, Michele Cohen, Nancy A. Sacco, Ryan Washington, Susan Mauermann, Victor Chen, Andrea Bastek
Publikováno v:
Contemporary Clinical Trials Communications, Vol 40, Iss , Pp 101291- (2024)
Background: This Site Feasibility Task Force convened to assess the complex and burdensome process of site feasibility in clinical trials. The objective was to create mutual understanding of challenges and provide suggestions for improving collaborat
Externí odkaz:
https://doaj.org/article/d23830b9612b476b8897b8a2ef239bfc
Publikováno v:
Complexity, Vol 2019 (2019)
In this paper, we deal with one of the main computational questions in network models: the predecessor-existence problems. In particular, we solve algebraically such problems in sequential dynamical systems on maxterm and minterm Boolean functions. W
Externí odkaz:
https://doaj.org/article/5f1469cf9f1249bda01f0ad94a7b945b
Publikováno v:
Mathematics, Vol 8, Iss 10, p 1812 (2020)
In this work, we solve the problem of the coexistence of periodic orbits in homogeneous Boolean graph dynamical systems that are induced by a maxterm or a minterm (Boolean) function, with a direct underlying dependency graph. Specifically, we show th
Externí odkaz:
https://doaj.org/article/00a1c1a84f634fdcbde027c9e77e4eb1
Publikováno v:
Complexity, Vol 2017 (2017)
In this work, we provide conditions to obtain fixed point theorems for parallel dynamical systems over graphs with (Boolean) maxterms and minterms as global evolution operators. In order to do that, we previously prove that periodic orbits of differe
Externí odkaz:
https://doaj.org/article/5eed3aa46beb44e0a3dd67ad76427bb1
Publikováno v:
Applied Mathematics and Computation. 361:874-888
In this work, we give a characterization of attractors in parallel deterministic network models, which evolve by means of maxterm and minterm Boolean functions and provide a method to obtain their basins of attraction. In order to do that, we disting
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::2be4bc02eb75ca722d4ceee58a8a92ab
https://doi.org/10.1016/j.amc.2019.05.048
https://doi.org/10.1016/j.amc.2019.05.048
Publikováno v:
International Journal of Computer Mathematics. 97:467-481
In this article, we show how to determine attractors in sequential dynamical systems on maxterm and minterm Boolean functions and their corresponding basins of attraction. Furthermore, we make poss...
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::d3149e6a239da62c17ff6d801f3af4f2
https://doi.org/10.1080/00207160.2019.1647338
https://doi.org/10.1080/00207160.2019.1647338
Publikováno v:
Complexity, Vol 2019 (2019)
In this paper, we deal with one of the main computational questions in network models: the predecessor-existence problems. In particular, we solve algebraically such problems in sequential dynamical systems on maxterm and minterm Boolean functions. W
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::231d6e09097b3502a9786575dbe2d926
https://doi.org/10.1155/2019/6280960
https://doi.org/10.1155/2019/6280960
Publikováno v:
Journal of Computational and Applied Mathematics. 348:26-33
In this work, we solve the classical predecessor problems for parallel dynamical systems on maxterm and minterm Boolean functions. Actually, we solve analytically the predecessor existence problem by giving a characterization to have a predecessor fo
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::4eb3df0a923ec90f40ec1159d27bbb9c
https://doi.org/10.1016/j.cam.2018.08.015
https://doi.org/10.1016/j.cam.2018.08.015
Publikováno v:
Journal of Computational and Applied Mathematics. 405:113084
It is well known that periodic orbits with any period can appear in sequential dynamical systems over undirected graphs with a Boolean maxterm or minterm function as global evolution operator. Indeed, fixed points cannot coexist with periodic orbits
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::9eecaaa4ffb4e3d5b3178c2500bffe0d
https://doi.org/10.1016/j.cam.2020.113084
https://doi.org/10.1016/j.cam.2020.113084
Publikováno v:
Mathematics
Volume 8
Issue 10
Mathematics, Vol 8, Iss 1812, p 1812 (2020)
Volume 8
Issue 10
Mathematics, Vol 8, Iss 1812, p 1812 (2020)
In this work, we solve the problem of the coexistence of periodic orbits in homogeneous Boolean graph dynamical systems that are induced by a maxterm or a minterm (Boolean) function, with a direct underlying dependency graph. Specifically, we show th
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::fca6a419f049c7fa90531603569f5b6f