Zobrazeno 1 - 10
of 11
pro vyhledávání: '"Patrick J. Andersen"'
Autor:
Natalie Carvalho, Mark Stevenson, Patrick J. Andersen, Laxman Bablani, Jason Thompson, Ameera Katar, D. Ait Ouakrim, Patrick Abraham, Tony Blakely, M-A Boujaoude, Nick Wilson, Edifofon Akpan
Publikováno v:
JAMA Health Forum
This economic evaluation determines the optimal policy response to the COVID-19 pandemic in Victoria, Australia, using a net monetary benefit approach for policies ranging from aggressive elimination and moderate elimination to tight suppression and
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::42ab1be924f0ad7805411b22f8c5ec4f
http://europepmc.org/articles/PMC8796885
http://europepmc.org/articles/PMC8796885
Autor:
Patrick J. Andersen, Charl J. Ras
Publikováno v:
Journal of Combinatorial Optimization. 39:457-491
The geometric $\delta$-minimum spanning tree problem ($\delta$-MST) is the problem of finding a minimum spanning tree for a set of points in a normed vector space, such that no vertex in the tree has a degree which exceeds $\delta$, and the sum of th
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::15b3464deb770b33b5989df887e96999
https://doi.org/10.1007/s10878-019-00490-2
https://doi.org/10.1007/s10878-019-00490-2
Publikováno v:
Population Health Metrics, Vol 20, Iss 1, Pp 1-17 (2022)
Population Health Metrics
Population Health Metrics
BackgroundSimulation models can be used to quantify the projected health impact of interventions. Quantifying heterogeneity in these impacts, for example by socioeconomic status, is important to understand impacts on health inequalities.We aim to dis
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::014707cfaba547d3803aa19f0c19c7ac
https://doi.org/10.21203/rs.3.rs-253618/v1
https://doi.org/10.21203/rs.3.rs-253618/v1
Autor:
Natalie Carvalho, Driss Ait Ouakrim, Mark Stevenson, Marie-Anne Boujaoude, Jason Thompson, Laxman Bablani, Ameera Katar, Patrick J. Andersen, Patrick Abraham, Nick Wilson, Edifofon Akpan, Tony Blakely
ImportanceDetermining the best policy on social restrictions and lockdowns for the COVID-19 pandemic is challenging.ObjectiveTo determine the optimal policy response ranging from aggressive and moderate elimination, tight suppression (aiming for 1 to
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::ddf09a76f469a8a2ae0d90f548ce28d5
https://doi.org/10.1101/2021.01.11.21249630
https://doi.org/10.1101/2021.01.11.21249630
Autor:
Tony Blakely, Patrick Abraham, Ameera Katar, Laxman Bablani, Natalie Carvalho, Marie-Anne Boujaoude, Patrick J. Andersen, Nick Wilson, Edifofon Akpan
Publikováno v:
SSRN Electronic Journal.
Background: Countries can decide between one of three COVID-19 control strategies: 1) elimination (e.g., some island countries); 2) suppression, to low infection rates; 3) or mitigation, as per pandemic influenza strategies with ensuing herd immunity
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::80754f45b26796780ceb67809a52dca8
https://doi.org/10.2139/ssrn.3605136
https://doi.org/10.2139/ssrn.3605136
Autor:
Patrick J. Andersen, Charl J. Ras
Publikováno v:
Networks. 68:302-314
Given a graph G with edge lengths, the minimum bottleneck spanning tree (MBST) problem is to find a spanning tree where the length of the longest edge in tree is minimum. It is a well-known fact that every minimum spanning tree (MST) is a minimum bot
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::6f0af9a3e59095ae5968c321da877ab2
https://doi.org/10.1002/net.21710
https://doi.org/10.1002/net.21710
Autor:
Patrick J. Andersen, Charl J. Ras
Given a set of points in the Euclidean plane, the Euclidean \textit{$\delta$-minimum spanning tree} ($\delta$-MST) problem is the problem of finding a spanning tree with maximum degree no more than $\delta$ for the set of points such the sum of the t
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::de1ddddfbd6eff84b75cbacf6514529f
Autor:
Patrick J. Andersen
Publikováno v:
Bulletin of the Australian Mathematical Society. 101:170-171
We introduce the geometric $\delta$-minimum bottleneck spanning tree problem ($\delta$-MBST), which is the problem of finding a spanning tree for a set of points in a geometric space (e.g., the Euclidean plane) such that no vertex in the tree has a d
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::9bd99877c8166e4c747a4732ce165b68
https://doi.org/10.1017/s0004972719001126
https://doi.org/10.1017/s0004972719001126
Publikováno v:
Discrete Mathematics, Algorithms and Applications. :1650048
For a simple graph $G=(V,E)$ and for a pair of vertices $u,v \in V$, we say that a vertex $w \in V$ resolves $u$ and $v$ if the shortest path from $w$ to $u$ is of a different length than the shortest path from $w$ to $v$. A set of vertices ${R \subs
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::f233543f70581c39115ccad35af9f7c7
https://doi.org/10.1142/s1793830916500488
https://doi.org/10.1142/s1793830916500488
Autor:
Patrick J. Andersen, Megan Frary
Publikováno v:
MRS Proceedings. 991
Novel die-stacking schema using through-wafer vias may require thick electrodeposited copper and aggressive first-step chemical mechanical planarization (CMP). However, the effect of microstructural parameters, including surface orientation and grain
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::38f6296a0cbe899ba28a4fe59d483a61
https://doi.org/10.1557/proc-0991-c05-04
https://doi.org/10.1557/proc-0991-c05-04