Source author record

Philip J. Aston

Philip J. Aston appears in the imported research catalog. Authorship, coauthor and topic links are available while profile ownership is still unclaimed.

ResearcherUnclaimed source record

Catalog footprint

What is connected

3works
7topics
4close collaborators

Actions

Connect this record

Log in to claim

Research graph

See the researcher in context

Open full explorer

Inspect adjacent papers, topics, institutions and collaborators without losing the researcher page.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Published work

3 published item(s)

preprint2026arXiv

Uncertainty Reliability Under Domain Shift: An Investigation for Data-Driven Blood Pressure Estimation in Photoplethysmography

Uncertainty quantification (UQ) is critical for safety-critical domains like healthcare, yet it is rarely evaluated under realistic out-of-distribution (OOD) conditions. Here, we assessed predictive performance and uncertainty reliability for deep learning-based blood pressure (BP) estimation from photoplethysmography (PPG) signals under both in-distribution (ID) and OOD settings. Using an XResNet1D-50 trained on PulseDB and tested on four external datasets, we compared deep ensembles (DE) and Monte Carlo dropout (MCD) with Gaussian negative log-likelihood (GNLL) and mean squared error (MSE) losses, optionally followed by post-hoc recalibration via conformal prediction (CP), temperature scaling (TS), and isotonic regression (IR). The key findings of our study are as follows: (1) DE provides stronger predictive robustness under domain shift than MCD, an advantage that becomes clear primarily under external shift. (2) Recalibrated GNLL-based methods yield the best uncertainty calibration (e.g., GNLL+DE+CP for systolic blood pressure (SBP), GNLL+DE+TS for diastolic blood pressure (DBP)), while MSE-based uncertainty requires recalibration to become practically useful. (3) Across settings, CP and TS offer the most consistent gains, with IR remaining competitive in several cases. Overall, our results identify DE-based methods as most robust for predictive performance under domain shift, GNLL as strongest for native UQ, and recalibration as essential for making MSE-based uncertainty practical. These findings highlight the need to jointly assess predictive accuracy and calibration on external data for trustworthy cuffless BP estimation

preprint2012arXiv

Is Radioactive Decay Really Exponential?

Radioactive decay of an unstable isotope is widely believed to be exponential. This view is supported by experiments on rapidly decaying isotopes but is more difficult to verify for slowly decaying isotopes. The decay of 14C can be calibrated over a period of 12,550 years by comparing radiocarbon dates with dates obtained from dendrochronology. It is well known that this approach shows that radiocarbon dates of over 3,000 years are in error, which is generally attributed to past variation in atmospheric levels of 14C. We note that predicted atmospheric variation (assuming exponential decay) does not agree with results from modelling, and that theoretical quantum mechanics does not predict exact exponential decay. We give mathematical arguments that non-exponential decay should be expected for slowly decaying isotopes and explore the consequences of non-exponential decay. We propose an experimental test of this prediction of non-exponential decay for 14C. If confirmed, a foundation stone of current dating methods will have been removed, requiring a radical reappraisal both of radioisotope dating methods and of currently predicted dates obtained using these methods.

preprint2011arXiv

Computing the Invariant Measure and the Lyapunov Exponent for One-Dimensional Maps using a Measure-Preserving Polynomial Basis

We consider a generalisation of Ulam's method for approximating invariant densities of one-dimensional chaotic maps. Rather than use piecewise constant polynomials to approximate the density, we use polynomials of degree n which are defined by the requirement that they preserve the measure on n+1 neighbouring subintervals. Over the whole interval, this results in a discontinuous piecewise polynomial approximation to the density. We prove error results where this approach is used to approximate smooth densities. We also consider the computation of the Lyapunov exponent using the polynomial density and show that the order of convergence is one order better than for the density itself. Together with using cubic polynomials in the density approximation, this yields a very efficient method for computing highly accurate estimates of the Lyapunov exponent. We illustrate the theoretical findings with some examples.