Search NASA⌕ Search

SEARCH · Search NASA

Results for “sampling algorithms”

Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 1,225 records · Page 68

Entropy-Bayesian Inversion of Time-Lapse Tomographic GPR data for Monitoring Dielectric Permittivity and Soil Moisture Variations

In this study, we evaluate the possibility of monitoring soil moisture variation using tomographic ground penetrating radar travel time data through Bayesian inversion, which is integrated with entropy memory function and pilot point concepts, as well as efficient sampling approaches. It is critical to accurately estimate soil moisture content and variations in vadose zone studies. Many studies have illustrated the promise and value of GPR tomographic data for estimating soil moisture and associated changes, however, challenges still exist in the inversion of GPR tomographic data in a manner that quantifies input and predictive uncertainty, incorporates multiple data types, handles non-uniqueness and nonlinearity, and honors time-lapse tomograms collected in a series. To address these challenges, we develop a minimum relative entropy (MRE)-Bayesian based inverse modeling framework that non-subjectively defines prior probabilities, incorporates information from multiple sources, and quantifies uncertainty. The framework enables us to estimate dielectric permittivity at pilot point locations distributed within the tomogram, as well as the spatial correlation range. In the inversion framework, MRE is first used to derive prior probability distribution functions (pdfs) of dielectric permittivity based on prior information obtained from a straight-ray GPR inversion. The probability distributions are then sampled using a Quasi-Monte Carlo (QMC) approach, and the sample sets provide inputs to a sequential Gaussian simulation (SGSim) algorithm that constructs a highly resolved permittivity/velocity field for evaluation with a curved-ray GPR forward model. The likelihood functions are computed as a function of misfits, and posterior pdfs are constructed using a Gaussian kernel. Inversion of subsequent time-lapse datasets combines the Bayesian estimates from the previous inversion (as a memory function) with new data. The memory function and pilot point design takes advantage of the spatial-temporal correlation of the state variables. We first apply the inversion framework to a static synthetic example and then to a time-lapse GPR tomographic dataset collected during a dynamic experiment conducted at the Hanford Site in Richland, WA. We demonstrate that the MRE-Bayesian inversion enables us to merge various data types, quantify uncertainty, evaluate nonlinear models, and produce more detailed and better resolved estimates than straight-ray based inversion; therefore, it has the potential to improve estimates of inter-wellbore dielectric permittivity and soil moisture content and to monitor their temporal dynamics more accurately.

58 GEOSCIENCES↗

"Eztrack": A single-vehicle deterministic tracking algorithm

A variety of surveillance operations require the ability to track vehicles over a long period of time using sequences of images taken from a camera mounted on an airborne or similar platform. In order to be able to see and track a vehicle for any length of time, either a persistent surveillance imager is needed that can image wide fields of view over a long time-span or a highly maneuverable smaller field-of-view imager is needed that can follow the vehicle of interest. The algorithm described here was designed for the persistence surveillance case. In turns out that most vehicle tracking algorithms described in the literature[1,2,3,4] are designed for higher frame rates (> 5 FPS) and relatively short ground sampling distances (GSD) and resolutions ({approx} few cm to a couple tens of cm). But for our datasets, we are restricted to lower resolutions and GSD's ({ge}0.5 m) and limited frame-rates ({le}2.0 Hz). As a consequence, we designed our own simple approach in IDL which is a deterministic, motion-guided object tracker. The object tracking relies both on object features and path dynamics. The algorithm certainly has room for future improvements, but we have found it to be a useful tool in evaluating effects of frame-rate, resolution/GSD, and spectral content (eg. grayscale vs. color imaging ). A block diagram of the tracking approach is given in Figure 1. We describe each of the blocks of the diagram in the upcoming sections.

42 ENGINEERING↗

Tumor trailing strategy for intensity-modulated radiation therapy of moving targets

Internal organ motion during the course of radiation therapy of cancer affects the distribution of the delivered dose and, generally, reduces its conformality to the targeted volume. Previously proposed approaches aimed at mitigating the effect of internal motion in intensity-modulated radiation therapy (IMRT) included expansion of the target margins, motion-correlated delivery (e.g., respiratory gating, tumor tracking), and adaptive treatment plan optimization employing a probabilistic description of motion. We describe and test the tumor trailing strategy, which utilizes the synergy of motion-adaptive treatment planning and delivery methods. We regard the (rigid) target motion as a superposition of a relatively fast cyclic component (e.g., respiratory) and slow aperiodic trends (e.g., the drift of exhalation baseline). In the trailing approach, these two components of motion are decoupled and dealt with separately. Real-time motion monitoring is employed to identify the 'slow' shifts, which are then corrected by applying setup adjustments. The delivery does not track the target position exactly, but trails the systematic trend due to the delay between the time a shift occurs, is reliably detected, and, subsequently, corrected. The ''fast'' cyclic motion is accounted for with a robust motion-adaptive treatment planning, which allows for variability in motion parameters (e.g., mean and extrema of the tidal volume, variable period of respiration, and expiratory duration). Motion-surrogate data from gated IMRT treatments were used to provide probability distribution data for motion-adaptive planning and to test algorithms that identified systematic trends in the character of motion. Sample IMRT fields were delivered on a clinical linear accelerator to a programmable moving phantom. Dose measurements were performed with a commercial two-dimensional ion-chamber array. The results indicate that by reducing intrafractional motion variability, the trailing strategy enhances relevance and applicability of motion-adaptive planning methods, and improves conformality of the delivered dose to the target in the presence of irregular motion. Trailing strategy can be applied to respiratory-gated treatments, in which the correction for the slow motion can increase the duty cycle, while robust probabilistic planning can improve management of the residual motion within the gate window. Similarly, trailing may improve the dose conformality in treatment of patients who exhibit detectable target motion of low amplitude, which is considered insufficient to provide a clinical indication for the use of respiratory-gated treatment (e.g., peak-to-peak motion of less than 10 mm). The mechanical limitations of implementing tumor trailing are less rigorous than those of real-time tracking, and the same technology could be used for both.

62 RADIOLOGY AND NUCLEAR MEDICINE↗

Scientific data interpolation with low dimensional manifold model

Here, we propose to apply a low dimensional manifold model to scientific data interpolation from regular and irregular samplings with a significant amount of missing information. The low dimensionality of the patch manifold for general scientific data sets has been used as a regularizer in a variational formulation. The problem is solved via alternating minimization with respect to the manifold and the data set, and the Laplace–Beltrami operator in the Euler–Lagrange equation is discretized using the weighted graph Laplacian. Various scientific data sets from different fields of study are used to illustrate the performance of the proposed algorithm on data compression and interpolation from both regular and irregular samplings.

97 MATHEMATICS AND COMPUTING↗

SU-F-T-148: Are the Approximations in Analytic Semi-Empirical Dose Calculation Algorithms for Intensity Modulated Proton Therapy for Complex Heterogeneities of Head and Neck Clinically Significant?

Purpose: Evaluate the differences in dose distributions between the proton analytic semi-empirical dose calculation algorithm used in the clinic and Monte Carlo calculations for a sample of 50 head-and-neck (H&N) patients and estimate the potential clinical significance of the differences. Methods: A cohort of 50 H&N patients, treated at the University of Texas Cancer Center with Intensity Modulated Proton Therapy (IMPT), were selected for evaluation of clinical significance of approximations in computed dose distributions. H&N site was selected because of the highly inhomogeneous nature of the anatomy. The Fast Dose Calculator (FDC), a fast track-repeating accelerated Monte Carlo algorithm for proton therapy, was utilized for the calculation of dose distributions delivered during treatment plans. Because of its short processing time, FDC allows for the processing of large cohorts of patients. FDC has been validated versus GEANT4, a full Monte Carlo system and measurements in water and for inhomogeneous phantoms. A gamma-index analysis, DVHs, EUDs, and TCP and NTCPs computed using published models were utilized to evaluate the differences between the Treatment Plan System (TPS) and FDC. Results: The Monte Carlo results systematically predict lower dose delivered in the target. The observed differences can be as large as 8 Gy, and should have a clinical impact. Gamma analysis also showed significant differences between both approaches, especially for the target volumes. Conclusion: Monte Carlo calculations with fast algorithms is practical and should be considered for the clinic, at least as a treatment plan verification tool.

60 APPLIED LIFE SCIENCES↗

TH-A-18C-04: Ultrafast Cone-Beam CT Scatter Correction with GPU-Based Monte Carlo Simulation

Purpose: Scatter artifacts severely degrade image quality of cone-beam CT (CBCT). We present an ultrafast scatter correction framework by using GPU-based Monte Carlo (MC) simulation and prior patient CT image, aiming at automatically finish the whole process including both scatter correction and reconstructions within 30 seconds. Methods: The method consists of six steps: 1) FDK reconstruction using raw projection data; 2) Rigid Registration of planning CT to the FDK results; 3) MC scatter calculation at sparse view angles using the planning CT; 4) Interpolation of the calculated scatter signals to other angles; 5) Removal of scatter from the raw projections; 6) FDK reconstruction using the scatter-corrected projections. In addition to using GPU to accelerate MC photon simulations, we also use a small number of photons and a down-sampled CT image in simulation to further reduce computation time. A novel denoising algorithm is used to eliminate MC scatter noise caused by low photon numbers. The method is validated on head-and-neck cases with simulated and clinical data. Results: We have studied impacts of photo histories, volume down sampling factors on the accuracy of scatter estimation. The Fourier analysis was conducted to show that scatter images calculated at 31 angles are sufficient to restore those at all angles with <0.1% error. For the simulated case with a resolution of 512×512×100, we simulated 10M photons per angle. The total computation time is 23.77 seconds on a Nvidia GTX Titan GPU. The scatter-induced shading/cupping artifacts are substantially reduced, and the average HU error of a region-of-interest is reduced from 75.9 to 19.0 HU. Similar results were found for a real patient case. Conclusion: A practical ultrafast MC-based CBCT scatter correction scheme is developed. The whole process of scatter correction and reconstruction is accomplished within 30 seconds. This study is supported in part by NIH (1R01CA154747-01), The Core Technology Research in Strategic Emerging Industry, Guangdong, China (2011A081402003)

60 APPLIED LIFE SCIENCES↗

Dark matter voids in the SDSS galaxy survey

What do we know about voids in the dark matter distribution given the Sloan Digital Sky Survey (SDSS) and assuming the ΛCDM model? Recent application of the Bayesian inference algorithm BORG to the SDSS Data Release 7 main galaxy sample has generated detailed Eulerian and Lagrangian representations of the large-scale structure as well as the possibility to accurately quantify corresponding uncertainties. Building upon these results, we present constrained catalogs of voids in the Sloan volume, aiming at a physical representation of dark matter underdensities and at the alleviation of the problems due to sparsity and biasing on galaxy void catalogs. To do so, we generate data-constrained reconstructions of the presently observed large-scale structure using a fully non-linear gravitational model. We then find and analyze void candidates using the VIDE toolkit. Our methodology therefore predicts the properties of voids based on fusing prior information from simulations and data constraints. For usual void statistics (number function, ellipticity distribution and radial density profile), all the results obtained are in agreement with dark matter simulations. Our dark matter void candidates probe a deeper void hierarchy than voids directly based on the observed galaxies alone. The use of our catalogs therefore opens the way to high-precision void cosmology at the level of the dark matter field. We will make the void catalogs used in this work available at http://www.cosmicvoids.net.

79 ASTRONOMY AND ASTROPHYSICS↗

Broadband X-ray ptychography using multi-wavelength algorithm

Ptychography is a rapidly developing scanning microscopy which is able to view the internal structures of samples at a high resolution beyond the illumination size. The achieved spatial resolution is theoretically dose-limited. A broadband source can provide much higher flux compared with a monochromatic source; however, it conflicts with the necessary coherence requirements of this coherent diffraction imaging technique. In this paper, a multi-wavelength reconstruction algorithm has been developed to deal with the broad bandwidth in ptychography. Compared with the latest development of mixed-state reconstruction approach, this multi-wavelength approach is more accurate in the physical model, and also considers the spot size variation as a function of energy due to the chromatic focusing optics. Therefore, this method has been proved in both simulation and experiment to significantly improve the reconstruction when the source bandwidth, illumination size and scan step size increase. It is worth mentioning that the accurate and detailed information of the energy spectrum for the incident beam is not required in advance for the proposed method. Further, we combine multi-wavelength and mixed-state approaches to jointly solve temporal and spatial partial coherence in ptychography so that it can handle various disadvantageous experimental effects. The significant relaxation in coherence requirements by our approaches allows the use of high-flux broadband X-ray sources for high-efficient and high-resolution ptychographic imaging.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Classical-Quantum Algorithm for Solving Stochastic Programs

Stochastic programming provides a rigorous mathematical framework for making decisions under uncertainty in a risk-aware manner. Two-stage stochastic programming is, perhaps, the simplest form of this framework. Here the first-stage variables represent decisions that must be made "here and now" in the face of uncertainty, while the second-stage variables are decisions made after uncertain events. However, the broad adoption of stochastic programming has been hindered by computational challenges caused by the two-stage stochastic programming formulation which requires solving an ensemble of optimization problems. Using quantum amplitude estimation (QAE), quantum computers have shown the theoretic ability to compute expectations with Monte-Carlo methods with quadratically fewer samples than classical methods. In this work, we present a quantum algorithm for computing the expectation term using QAE for given first-stage decisions. Further, we detail methods of computing gradient information from the quantum calculation enabling the application of classical gradient-based optimization techniques. The result is a classical-quantum hybrid method of solving two-stage stochastic programs. These techniques are demonstrated with computational experiments based an engineering optimization problem.

97 MATHEMATICS AND COMPUTING↗

Virtual refrigerant charge sensing algorithm for residential CO₂ heat pumps

Natural refrigerants are increasingly adopted in next-generation heat pump systems, among which CO₂ heat pumps have attracted significant attention. However, due to their high operating pressures, the leakage risk is higher, resulting in undercharge conditions and degraded heat pump performance. Thus, developing an accurate refrigerant charge level detection technique is necessary to guarantee safe and efficient operation. Although virtual refrigerant charge (VRC) level calculation algorithms for CO₂ heat pumps exist, they typically rely on empirically selected features without a systematic selection framework, leading to multicollinearity and potential overfitting, which limit their prediction accuracy and generalizability. To address these issues, this study proposes a VRC algorithm framework with a systematic feature selection method that identifies physically meaningful and statistically significant features, and is applied using a residential CO₂ heat pump as a case study. The method is extended from previous work on conventional refrigerants to account for charge behavior in CO₂ gas coolers. The selected features include gas cooler outlet density, evaporator pressure, and superheat temperature. The results demonstrate that the proposed feature selection method significantly improves prediction accuracy compared to existing VRC approaches. A relatively small training dataset (∼30 samples) is sufficient for feature identification and model development. The developed algorithm achieves less than 3% prediction error under both undercharge and overcharge conditions, representing reductions of 46.7% and 35.3% compared to two recent reference VRC algorithms for transcritical CO₂ heat pumps reported in the literature. The proposed algorithm and feature selection method enhance leakage detection capability, facilitate the deployment of CO₂ heat pump systems, and contribute to reduced energy waste and maintenance costs.

Guo, Fangzhou [Lawrence Berkeley National Laborato↗

Orbital Trade Study for the PREFIRE Mission

The Polar Radiant Energy in the Far-Infrared Experiment (PREFIRE) is a low-cost cubesat-based Earth Science mission selected for rapid implementation through NASAs Earth Ventures-Instrument program. Two cubesats carrying thermal infrared spectrometers (TIRS) in polar orbits will test long-held assumptions regarding radiative balance at long wavelengths where the cold-dry Arctic and Antarctic surfaces expel significant amounts of the earth's radiant energy. Thermal radiometry with better than one micron sampling at wavelengths beyond 15 microns will provide critical observational bounds for inputs into glacier melt and climate change models through improvements in surface emissivities, longwave greenhouse effect parameterizations, and cloud presence/types. Additional information on potential far-infrared surface/atmosphere feedbacks during rapid melt processes may be captured with sub-diurnal revisits of targeted areas. A baseline mission with two cubesats in different orbits provides a means for optimization of sub-diurnal sampling for science purposes. In this presentation we provide details of orbit studies that inform expected sampling metrics. Candidate orbits are modeled in SGP and then TIRS sampling is projected into surface footprints with appropriate geo-location. Matching algorithms then compile statistics for time-delayed revisits between and within the two orbits. Binning of results by latitude allows for abstraction of precession issues as well as for correlations with surface types as defined by radiometric classification schemes. Multiple acceptable pairs of science-driven orbits were found that optimize sampling in areas known to experience rapid melt events. The final choice of PREFIRE orbital parameters includes the systems trade-space, particularly the power budget, as well as the availability of launch opportunities.

"L'Ecuyer, Tristan"↗

Uncertainty in Satellite Rainfall Estimates: Time Series Comparison

We examined nine satellite rainfall algorithms and compared the rain fields produced from these algorithms for the period of August 1987 to December 1988. Preliminary results show algorithms which use the same satellite sensor data tend to be similar, suggesting the importance of sampling. Oceanic global mean rainfall ranges from 2.7 to 3.6 mm/d. The variability in zonal mean rain rate is about 1.5-2 mm/d for these algorithms.

Chang, Alfred T. C.↗

Automated Identification of Molecular Crystals’ Packing Motifs

Packing motifs—patterns in how molecules orient relative to one another in a crystal structure—are an important concept in many subdisciplines of materials science because of correlations observed between specific packing motifs and properties of interest. That said, packing motif data sets have remained small and noisy due to intensive manual labeling processes and insufficient labeling schemes. The most prominent labeling algorithms calculate relative interplanar angles of nearest neighbor molecules to determine the packing motif of a molecular crystal, but this simple approach can fail when neighbors are naively sampled isotropically around the crystal structure. To remedy this issue, here we propose an optimization algorithm, which rotates the molecular crystal structure to find representative molecules that inform the packing motif. We package this algorithm into an automated framework—Autopack—which both optimally rotates the crystal structure and labels the packing motif based on the appropriate neighboring molecules. In this work, we detail the Autopack framework and its performance, which shows improvements compared to previous state-of-the-art labeling methods, providing the first quantitative point of comparison for packing motif labeling algorithms. Furthermore, using Autopack (available at https://ipo.llnl.gov/technologies/software/autopack), we perform the first large-scale study of potential relationships between chemicals’ compositions and packing motifs, which shows that these relationships are more complex than previously hypothesized from studies that used only tens of polycyclic aromatic hydrocarbon molecules. Autopack’s capabilities help pose next steps for crystal engineering research focusing not only on a molecule’s adoption of a specific packing motif but also on new structure–property relationships.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

An integrated approach to piezoactuator positioning in high-speed atomic force microscope imaging

In this paper, an integrated approach to achieve high-speed atomic force microscope (AFM) imaging of large-size samples is proposed, which combines the enhanced inversion-based iterative control technique to drive the piezotube actuator control for lateral x-y axis positioning with the use of a dual-stage piezoactuator for vertical z-axis positioning. High-speed, large-size AFM imaging is challenging because in high-speed lateral scanning of the AFM imaging at large size, large positioning error of the AFM probe relative to the sample can be generated due to the adverse effects--the nonlinear hysteresis and the vibrational dynamics of the piezotube actuator. In addition, vertical precision positioning of the AFM probe is even more challenging (than the lateral scanning) because the desired trajectory (i.e., the sample topography profile) is unknown in general, and the probe positioning is also effected by and sensitive to the probe-sample interaction. The main contribution of this article is the development of an integrated approach that combines advanced control algorithm with an advanced hardware platform. The proposed approach is demonstrated in experiments by imaging a large-size (50 {mu}m) calibration sample at high-speed (50 Hz scan rate)

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

DAKOTA : a multilevel parallel object-oriented framework for design optimization, parameter estimation, uncertainty quantification, and sensitivity analysis.

The DAKOTA (Design Analysis Kit for Optimization and Terascale Applications) toolkit provides a flexible and extensible interface between simulation codes and iterative analysis methods. DAKOTA contains algorithms for optimization with gradient and nongradient-based methods; uncertainty quantification with sampling, reliability, and stochastic expansion methods; parameter estimation with nonlinear least squares methods; and sensitivity/variance analysis with design of experiments and parameter study methods. These capabilities may be used on their own or as components within advanced strategies such as surrogate-based optimization, mixed integer nonlinear programming, or optimization under uncertainty. By employing object-oriented design to implement abstractions of the key components required for iterative systems analyses, the DAKOTA toolkit provides a flexible and extensible problem-solving environment for design and performance analysis of computational models on high performance computers. This report serves as a theoretical manual for selected algorithms implemented within the DAKOTA software. It is not intended as a comprehensive theoretical treatment, since a number of existing texts cover general optimization theory, statistical analysis, and other introductory topics. Rather, this manual is intended to summarize a set of DAKOTA-related research publications in the areas of surrogate-based optimization, uncertainty quantification, and optimization under uncertainty that provide the foundation for many of DAKOTA's iterative analysis capabilities.

99 GENERAL AND MISCELLANEOUS↗

SU-D-12A-05: Iterative Reconstruction Techniques to Enable Intrinsic Respiratory Gated CT in Mice

Purpose: Longitudinal studies of lung function in mice need the ability to image different phases of ventilation in free-breathing mice using retrospective gating. However, retrospective gating often produces under-sampled and uneven angular samples, resulting in severe reconstruction artifacts when using traditional FDK based reconstruction algorithms. We wanted to demonstrate the utility of iterative reconstruction method to enable intrinsic respiratory gating in small-animal CT. Methods: Free-breathing mice were imaged using a Siemens Inveon PET/micro-CT system. Evenly distributed projection images were acquired at 360 angles. Retrospective respiratory gating was performed using an intrinsic marker based on the average intensity in a region covering the diaphragm. Projections were classified into 4 and 6 phases (finer temporal resolution) resulting in 138 and 67 projections respectively. Reconstruction was carried out using 3 Methods: conventional FDK, iterative penalized least-square (PWLS) with total variation (TV), and PWLS with edge-preserving penalty. The performance of the methods was compared using contrast-to-noise (CNR) in a region of interest (ROI). Line profile through a specific region was plotted to evaluate the preserving of edges. Results: In both the cases with 4 and 6 phases, inadequate and non-uniform angular sampling results in artifacts using conventional FDK. However, such artifacts are minimized using both the iterative methods. Using both 4 and 6 phases, the iterative techniques outperformed FDK in terms of CNR and maintaining sharp edges. This is further evidenced especially with increased artifacts using FDK for 6 phases. Conclusion: This work indicates fewer artifacts and better image details can be achieved with iterative reconstruction methods in non-uniform under-sampled reconstruction. Using iterative methods can enable free-breathing intrinsic respiratory gating in small-animal CT. Further studies are needed to compare the computational complexity for large datasets.

60 APPLIED LIFE SCIENCES↗

A Spectral Approach for the Design of Experiments: Design, Analysis and Algorithms

This paper proposes a new approach to construct high quality space-filling sample designs. First, we propose a novel technique to quantify the space-filling property and optimally trade-off uniformity and randomness in sample designs in arbitrary dimensions. Second, we connect the proposed metric (defined in the spatial domain) to the quality metric of the design performance (defined in the spectral domain). This connection serves as an analytic framework for evaluating the qualitative properties of space-filling designs in general. Using the theoretical insights provided by this spatial-spectral analysis, we derive the notion of optimal space-filling designs, which we refer to as space-filling spectral designs. Third, we propose an efficient estimator to evaluate the space-filling properties of sample designs in arbitrary dimensions and use it to develop an optimization framework for generating high quality space-filling designs. Finally, we carry out a detailed performance comparison on two different applications in varying dimensions: a) image reconstruction and b) surrogate modeling for several benchmark optimization functions and a physics simulation code for inertial confinement fusion (ICF). Our results clearly evidence the superiority of the proposed space-filling designs over existing approaches, particularly in high dimensions.

97 MATHEMATICS AND COMPUTING↗

Sensitivity of modelled passive margin stratigraphy to variations in sea level, sediment supply and subsidence

Abstract We produced a 10 Myr synthetic stratigraphic section using a forward stratigraphic model that generates marine deltaic stratigraphy over geological timescales. We recursively fit the model using a Bayesian inversion algorithm to test: (1) if it could be accurately reconstructed; (2) if the parameters used to create it could be recovered; and (3) the sensitivity of the model output to given model parameters and the attendant physical processes. The original synthetic stratigraphic section was produced with cyclical sea‐level variations of 40 and 30 m with 2.4 and 10 Myr periods respectively. Sediment was also supplied cyclically, in 2.4 and 10 Myr cycles with amplitudes of 30 and 80 tons/100 kyr, respectively, varying from a mean of 232 tons/100 kyr. Parameter values were sampled to fit the model using a Markov chain Monte Carlo algorithm, resulting in a ±5 m (1σ) variation between the experimental output and the original. Sea level varied by ±7 m (1σ) within the posterior distribution of parameters. As a result, both the 10 Myr and 2.4 Myr sea‐level cycles could be extracted from the original output. The variation in sediment supply was approximately ±38 tons/100 kyr (1σ) and, as a result, only the larger long‐term supply variations could be accurately recovered in refitting the model. The variation in thermal, flexural and total subsidence across those parameter sets is less than ±10 m (1σ). The original section experienced 150 m of total subsidence at the depocentre. Our results demonstrate the distinct and interpretable imprint of sea level and subsidence on continental margin stratigraphy can be quantified. Moreover, we conclude that sea‐level change produces a defined effect on the geometries of stratigraphic architecture, and that techniques applied for the purpose of delineating sea‐level variation from continental margin strata have a well‐founded conceptual basis.

Schmelz, William J.↗