Zobrazeno 1 - 8
of 8
pro vyhledávání: '"Lucas Laird"'
Autor:
Niklas Smedemark-Margulies, Robin Walters, Heiko Zimmermann, Lucas Laird, Christian van der Loo, Neela Kaushik, Rajmonda Caceres, Jan-Willem van de Meent
Publikováno v:
PLoS Computational Biology, Vol 18, Iss 11, p e1010591 (2022)
Accurate epidemiological models require parameter estimates that account for mobility patterns and social network structure. We demonstrate the effectiveness of probabilistic programming for parameter inference in these models. We consider an agent-b
Externí odkaz:
https://doaj.org/article/5d632ab14b2043df9c08732b71d8b8fe
Publikováno v:
Scientific Reports, Vol 11, Iss 1, Pp 1-12 (2021)
Abstract COVID-19 epidemics have varied dramatically in nature across the United States, where some counties have clear peaks in infections, and others have had a multitude of unpredictable and non-distinct peaks. Our lack of understanding of how the
Externí odkaz:
https://doaj.org/article/4af6e01c390d4777963f86cf0d7b3f10
Autor:
Niklas Smedemark-Margulies, Robin Walters, Heiko Zimmermann, Lucas Laird, Christian van der Loo, Neela Kaushik, Rajmonda Caceres, Jan-Willem van de Meent
Publikováno v:
PLoS computational biology. 18(11)
Accurate epidemiological models require parameter estimates that account for mobility patterns and social network structure. We demonstrate the effectiveness of probabilistic programming for parameter inference in these models. We consider an agent-b
Publikováno v:
Scientific Reports
Scientific Reports, Vol 11, Iss 1, Pp 1-12 (2021)
Scientific Reports, Vol 11, Iss 1, Pp 1-12 (2021)
COVID-19 epidemics have varied dramatically in nature across the United States, where some counties have clear peaks in infections, and others have had a multitude of unpredictable and non-distinct peaks. Our lack of understanding of how the pandemic
Publikováno v:
Environmental Law, 1998 Dec 01. 28(4), 997-1054.
Externí odkaz:
https://www.jstor.org/stable/43266688
A subset of vertices in a graph is called resolving when the geodesic distances to those vertices uniquely distinguish every vertex in the graph. Here, we characterize the resolvability of Hamming graphs in terms of a constrained linear system and de
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::7541f3b739dc7079e9401b43d7519567
http://arxiv.org/abs/1907.05974
http://arxiv.org/abs/1907.05974
Autor:
Lucas, Laird J. llucas@advocateswest.org, Stellberg, Sarah sstellberg@advocateswest.org
Publikováno v:
Natural Resources & Environment. Summer2021, Vol. 36 Issue 1, p57-59. 3p.
Publikováno v:
Environmental Law (0046-2276). Winter1998, Vol. 28 Issue 4, p997. 0p.