Zobrazeno 1 - 10
of 7 730
pro vyhledávání: '"Swanepoel, A."'
Autor:
Fourment, Mathieu, Macaulay, Matthew, Swanepoel, Christiaan J, Ji, Xiang, Suchard, Marc A, Matsen IV, Frederick A
Bayesian inference has predominantly relied on the Markov chain Monte Carlo (MCMC) algorithm for many years. However, MCMC is computationally laborious, especially for complex phylogenetic models of time trees. This bottleneck has led to the search f
Externí odkaz:
http://arxiv.org/abs/2406.18044
Autor:
Vinaya Manchaiah, Eldré W. Beukes, Gerhard Andersson, Emily Bateman, De Wet Swanepoel, Kristin Uhler, Vinay
Publikováno v:
Clinics and Practice, Vol 14, Iss 4, Pp 1615-1624 (2024)
Background: This study aimed to examine whether individuals with chronic tinnitus report more positive experiences following internet-based cognitive behavioral therapy (CBT). Methods: A mixed-methods design was used, nested in clinical trials evalua
Externí odkaz:
https://doaj.org/article/f33fe925b3d54f9c864f1b2df4abccf6
Publikováno v:
Frontiers in Sustainable Food Systems, Vol 8 (2024)
The dairy industry in South Africa is currently grappling with significant challenges, including escalating costs and diminishing profit margins. However, these difficulties also create a pivotal opportunity for the sector to embrace sustainable prac
Externí odkaz:
https://doaj.org/article/286882349044499c95bd2e61c6ea5ed2
Autor:
Chané Fourie, Faheema Mahomed-Asmail, Ilze Oosthuizen, Vinaya Manchaiah, Charlotte Vercammen, De Wet Swanepoel
Publikováno v:
Frontiers in Audiology and Otology, Vol 2 (2024)
IntroductionUnderstanding hearing aid wearer experiences in real-world settings is important to provide responsive and individualized hearing care. This study aimed to describe real-life benefits of hearing aids (HAs), as reported by hearing aid wear
Externí odkaz:
https://doaj.org/article/99bbd839ed47402ca34108c5636b6af4
Publikováno v:
Emerald Emerging Markets Case Studies, 2024, Vol. 14, Issue 1, pp. 1-32.
Externí odkaz:
http://www.emeraldinsight.com/doi/10.1108/EEMCS-08-2023-0293
Autor:
Swanepoel, Christiaan, Fourment, Mathieu, Ji, Xiang, Nasif, Hassan, Suchard, Marc A, Matsen IV, Frederick A, Drummond, Alexei
Probabilistic programming frameworks are powerful tools for statistical modelling and inference. They are not immediately generalisable to phylogenetic problems due to the particular computational properties of the phylogenetic tree object. TreeFlow
Externí odkaz:
http://arxiv.org/abs/2211.05220
Autor:
Fourment, Mathieu, Swanepoel, Christiaan J., Galloway, Jared G., Ji, Xiang, Gangavarapu, Karthik, Suchard, Marc A., Matsen IV, Frederick A.
Gradients of probabilistic model likelihoods with respect to their parameters are essential for modern computational statistics and machine learning. These calculations are readily available for arbitrary models via automatic differentiation implemen
Externí odkaz:
http://arxiv.org/abs/2211.02168
Autor:
Lavollée, Jérémy, Swanepoel, Konrad
A matchstick graph is a plane graph with edges drawn as unit-distance line segments. Harborth introduced these graphs in 1981 and conjectured that the maximum number of edges for a matchstick graph on $n$ vertices is $\lfloor 3n-\sqrt{12n-3} \rfloor$
Externí odkaz:
http://arxiv.org/abs/2209.09800
Publikováno v:
Audiology Research, Vol 14, Iss 2, Pp 342-358 (2024)
The aim of this study was to examine the relationship between an American English Digits in Noise (DIN) test and commonly used audiological measures to evaluate the DIN test’s ability to detect hearing loss and validate hearing aid fitting. QuickSI
Externí odkaz:
https://doaj.org/article/d44dcf45c7cf4c47b0af94fc11279eb7
Autor:
Lavollée, Jérémy, Swanepoel, Konrad J.
A matchstick graph is a crossing-free unit-distance graph in the plane. Harborth (1981) proposed the problem of determining whether there exists a matchstick graph in which every vertex has degree exactly $5$. In 1982, Blokhuis gave a proof of non-ex
Externí odkaz:
http://arxiv.org/abs/2206.03956