Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Inference”

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,765 records · Page 98

Investigation of core impurity transport in DIII-D diverted negative triangularity plasmas

Abstract Tokamak operation at negative triangularity has been shown to offer high energy confinement without the typical disadvantages of edge pedestals (Marinoni et al 2021 Nucl. Fusion 61 116010). In this paper, we examine impurity transport in DIII-D diverted negative triangularity experiments. Analysis of charge exchange recombination spectroscopy reveals flat or hollow carbon density profiles in the core, and impurity confinement times consistently shorter than energy confinement times. Bayesian inferences of impurity transport coefficients based on laser blow-off injections and forward modeling via the Aurora package (Sciortino et al 2021 Plasma Phys. Control. Fusion 63 112001) show core cross-field diffusion to be higher in L-mode than in H-mode. Impurity profile shapes remain flat or hollow in all cases. Inferred radial profiles of diffusion and convection are compared to neoclassical, quasilinear gyrofluid, and nonlinear gyrokinetic simulations. Heat transport is observed to be better captured by reduced turbulence models with respect to particle transport. State-of-the-art gyrokinetic modeling compares favorably with measurements across multiple transport channels. Overall, these results suggest that diverted negative triangularity discharges may offer a path to a highly-radiative L-mode scenario with high core performance.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Unorthodox parallelization for Bayesian quantum state estimation

Quantum state tomography (QST) allows for the reconstruction of quantum states through measurements and some inference technique under the assumption of repeated state preparations. Bayesian inference provides a promising platform to achieve both efficient QST and accurate uncertainty quantification, yet is generally plagued by the computational limitations associated with long Markov chains. In this work, we present a novel Bayesian QST approach that leverages modern distributed parallel computer architectures to efficiently sample a D-dimensional Hilbert space. Using a parallelized preconditioned Crank–Nicholson Metropolis–Hastings algorithm, we demonstrate our approach on simulated data and experimental results from IBM Quantum systems up to four qubits, showing significant speedups through parallelization. Although highly unorthodox in pooling independent Markov chains, our method proves remarkably practical, with validation ex post facto via diagnostics like the intrachain autocorrelation time. We conclude by discussing scalability to higher-dimensional systems, offering a path toward efficient and accurate Bayesian characterization of large quantum systems.

Bayesian inference↗

Accelerating multilevel Markov Chain Monte Carlo using machine learning models

Here, this work presents an efficient approach for accelerating multilevel Markov Chain Monte Carlo (MCMC) sampling for large-scale problems using low-fidelity machine learning models. While conventional techniques for large-scale Bayesian inference often substitute computationally expensive high-fidelity models with machine learning models, thereby introducing approximation errors, our approach offers a computationally efficient alternative by augmenting high-fidelity models with low-fidelity ones within a hierarchical framework. The multilevel approach utilizes the low-fidelity machine learning model (MLM) for inexpensive evaluation of proposed samples thereby improving the acceptance of samples by the high-fidelity model. The hierarchy in our multilevel algorithm is derived from geometric multigrid hierarchy. We utilize an MLM to accelerate the coarse level sampling. Training machine learning model for the coarsest level significantly reduces the computational cost associated with generating training data and training the model. We present an MCMC algorithm to accelerate the coarsest level sampling using MLM and account for the approximation error introduced. We provide theoretical proofs of detailed balance and demonstrate that our multilevel approach constitutes a consistent MCMC algorithm. Additionally, we derive the expression for cost reduction due to machine learning model to facilitate cost analysis of the hierarchical sampling algorithm. Our technique is demonstrated on a standard benchmark inference problem in groundwater flow, where we estimate the probability density of a quantity of interest using a four-level MCMC algorithm. Our proposed algorithm accelerates multilevel sampling by a factor of two while achieving similar accuracy compared to sampling using the standard multilevel algorithm.

97 MATHEMATICS AND COMPUTING↗

Simultaneous global and local clustering in multiplex networks with covariate information

Understanding both global and layer-specific group structures is useful for uncovering complex patterns in networks with multiple interaction types. In this work, we introduce a new model, the hierarchical multiplex stochastic blockmodel, which simultaneously detects communities within individual layers of a multiplex network while inferring a global node clustering across the layers. A stochastic blockmodel is assumed in each layer, with probabilities of layer-level group memberships determined by a node’s global group assignment. Our model uses a Bayesian framework, employing a probit stick-breaking process to construct node-specific mixing proportions over a set of shared Griffiths–Engen–McCloseky distributions. These proportions determine layer-level community assignment, allowing for an unknown and varying number of groups across layers, while incorporating nodal covariate information to inform the global clustering. We propose a scalable variational inference procedure with parallelisable updates for application to large networks. Extensive simulation studies demonstrate our model’s ability to accurately recover both global and layer-level clusters in complicated settings, and applications to real data showcase the model’s effectiveness in uncovering interesting latent network structure.

community detection↗

Sparsifying priors for Bayesian uncertainty quantification in model discovery

We propose a probabilistic model discovery method for identifying ordinary differential equations governing the dynamics of observed multivariate data. Our method is based on the sparse identification of nonlinear dynamics (SINDy) framework, where models are expressed as sparse linear combinations of pre-specified candidate functions. Promoting parsimony through sparsity leads to interpretable models that generalize to unknown data. Instead of targeting point estimates of the SINDy coefficients, we estimate these coefficients via sparse Bayesian inference. The resulting method, uncertainty quantification SINDy (UQ-SINDy), quantifies not only the uncertainty in the values of the SINDy coefficients due to observation errors and limited data, but also the probability of inclusion of each candidate function in the linear combination. UQ-SINDy promotes robustness against observation noise and limited data, interpretability (in terms of model selection and inclusion probabilities) and generalization capacity for out-of-sample forecast. Sparse inference for UQ-SINDy employs Markov chain Monte Carlo, and we explore two sparsifying priors: the spike and slab prior, and the regularized horseshoe prior. UQ-SINDy is shown to discover accurate models in the presence of noise and with orders-of-magnitude less data than current model discovery methods, thus providing a transformative method for real-world applications which have limited data.

97 MATHEMATICS AND COMPUTING↗

Enhancing Gaussian Process Surrogates for Optimization and Posterior Approximation via Random Exploration

This paper proposes novel noise-free Bayesian optimization strategies that rely on a random exploration step to enhance the accuracy of Gaussian process surrogate models. The new algorithms retain the ease of implementation of the classical GP-UCB algorithm, but the additional random exploration step accelerates their convergence, nearly achieving the optimal convergence rate. Furthermore, to facilitate Bayesian inference with intractable likelihoods, we propose to utilize optimization iterates for maximum a posteriori estimation to build a Gaussian process surrogate model for the unnormalized log-posterior density. We provide bounds for the Hellinger distance between the true and the approximate posterior distributions in terms of the number of design points. We demonstrate the effectiveness of our Bayesian optimization algorithms in nonconvex benchmark objective functions, in a machine learning hyperparameter tuning problem, and in a black-box engineering design problem. The effectiveness of our posterior approximation approach is demonstrated in two Bayesian inference problems for parameters of dynamical systems.

Bayesian inference↗

Unsupervised physics-informed disentanglement of multimodal data

Here, we introduce physics-informed multimodal autoencoders (PIMA) - a variational inference framework for discovering shared information in multimodal datasets. Individual modalities are embedded into a shared latent space and fused through a product-of-experts formulation, enabling a Gaussian mixture prior to identify shared features. Sampling from clusters allows cross-modal generative modeling, with a mixture-of-experts decoder that imposes inductive biases from prior scientific knowledge and thereby imparts structured disentanglement of the latent space. This approach enables cross-modal inference and the discovery of features in high-dimensional heterogeneous datasets. Consequently, this approach provides a means to discover fingerprints in multimodal scientific datasets and to avoid traditional bottlenecks related to high-fidelity measurement and characterization of scientific datasets.

97 MATHEMATICS AND COMPUTING↗

Cholesky-based experimental design for Gaussian process and kernel-based emulation and calibration.

Gaussian processes and other kernel-based methods are used extensively to construct approximations of multivariate data sets. The accuracy of these approximations is dependent on the data used. This paper presents a computationally efficient algorithm to greedily select training samples that minimize the weighted L p error of kernel-based approximations for a given number of data. The method successively generates nested samples, with the goal of minimizing the error in high probability regions of densities specified by users. The algorithm presented is extremely simple and can be implemented using existing pivoted Cholesky factorization methods. Training samples are generated in batches which allows training data to be evaluated (labeled) in parallel. For smooth kernels, the algorithm performs comparably with the greedy integrated variance design but has significantly lower complexity. Numerical experiments demonstrate the efficacy of the approach for bounded, unbounded, multi-modal and non-tensor product densities. We also show how to use the proposed algorithm to efficiently generate surrogates for inferring unknown model parameters from data using Bayesian inference.

97 MATHEMATICS AND COMPUTING↗

Verification, Validation, and Calibration Through a Causal Lens

While typical validation and verification approaches focus on identifying the associations between data elements using statistical and machine learning methods, the novel methods in this paper focus instead on identifying causal relationships between data elements. Statistical and machine-learning-based approaches are strictly data-driven, meaning that they provide quantitative comparison measures between data sets without explicitly considering the hypotheses behind them. This can lead to the erroneous conclusion that, if two data sets are close enough, the models that generated them are similar. In addition, when experimental and simulated data differ to an extent that fails to meet the acceptance criteria, calibration techniques are used to tweak simulation model parameters to reduce the gap between the two types of data. This produces the false expectation that a simulation model will match reality. The methods presented in this paper move away from these strictly data-driven methods for validation and calibration toward more robust, model-driven methods based on causal inference. Causal inference aims to identify the possible mechanisms that might have generated data. Thus, this analysis targets the prediction of the effects when one (or more) of the identified mechanisms are altered. There are many approaches to identify, quantify, and illustrate causal relationships. For the scope of this paper, directed graphs are employed as causal models. If the directed graph lacks cycles, it is known as a directed acyclic graph. A node in such a graph represents an observed data element while a directed edge connecting two nodes represents a causal relationship between two variables. The developed causal methods are designed to extract causal models from simulation models and experimental data. Causal models capture the causal relationships between data elements (e.g., simulated and experimental data). In this context, validation and verification are performed by comparing causal models. The proposed approach does not only inform system analysts on how a simulation model matches real-world data, but also identifies elements of the simulation model that should be revised when discrepancies between simulation and experimental data are observed. Through these causal methods, analysts can identify the portion of the model equation(s) that are behind an edge connecting two variables. Hence, once the structural differences between causal models have been determined, model calibration can occur by changing only those model parameters that impact the identified causal relationships.

97 MATHEMATICS AND COMPUTING↗

Data Center High-Temperature Liquid Cooling and Heat Reuse Techno-Economic Study: Preprint

Data centers are energy-intensive facilities with growing demands for efficiency and cost-effective operations. Smaller, more distributed edge inference data centers are expected to proliferate as AI applications require low latency closer to the user of AI tools, which presents a growing opportunity to explore the systems implications of liquid cooling on water and energy use. This study analyzes the implementation of high-temperature liquid cooling systems in a prototypical inference 1-MW data center and explores the potential for heat reuse across varying climates with a goal to optimize energy efficiency, reduce capital and operational costs, and identify opportunities for high-performance cooling and water use reduction infrastructure. This analysis evaluated configurations utilizing a peak day hourly sizing and systems performance spreadsheet to evaluate design and operational conditions from which component sizes, installed cost, operational cost, and performance metrics were determined for the Base case and the Elevated case. The techno-economic analysis included heat reuse applications across a range of heat recovery temperatures and heat rejection options. The analysis shows that high-temperature liquid cooling allows for improved energy efficiency, lower water consumption, and lower capital costs compared to traditional cooling approaches. Transitioning to elevated water inlet/outlet temperatures (50 degrees C/60 degrees C) eliminates the need for chillers, cooling towers, and heat recovery equipment in many scenarios across three distinct climate zones. This results in up to 75% capital cost savings for the cooling and heat recovery equipment, and with significantly reduced water consumption, especially in non-heat reuse applications. Heat generated from data centers can also be repurposed for space heating, domestic hot water, and other applications, and is most cost-effective when data center outlet temperatures exceed 55-60 degrees C.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗

Radiative and precipitation controls on root zone soil moisture spectra

Here, we present that temporal variability in root zone soil moisture content (w) exhibits a Lorentzian spectrum with memory dictated by a damping term when forced with white-noise precipitation. In the context of regional dimming, radiation and precipitation variability are needed to reproduce w trends prompting interest in how the w memory is altered by radiative forcing. A hierarchy of models that sequentially introduce the spectrum of precipitation, net radiation, and the effect of w on evaporative and drainage losses was used to analyze the spectrum of w at subtropical and temperate forested sites. Reproducing the w spectra at long time scales necessitated simultaneous precipitation and net radiation measurements depending on site conditions. The w memory inferred from observed w spectra was 25–38 days, larger than that determined from maximum wet evapotranspiration and field capacity. Finally, the w memory can be reasonably inferred from the Lorentzian spectrum when precipitation and evapotranspiration are in phase.

58 GEOSCIENCES↗

The dependence of the strength and thickness of field‐aligned currents on solar wind and ionospheric parameters

Abstract Sheared plasma flows at the low‐latitude boundary layer (LLBL) correlate well with early afternoon auroral arcs and upward field‐aligned currents. We present a simple analytic model that relates solar wind and ionospheric parameters to the strength and thickness of field‐aligned currents (Λ) in a region of sheared velocity, such as the LLBL. We compare the predictions of the model with DMSP observations and find remarkably good scaling of the upward region 1 currents with solar wind and ionospheric parameters in region located at the boundary layer or open field lines at 1100–1700 magnetic local time. We demonstrate that and Λ ∼ L when Λ/ L < 5 where L is the auroral electrostatic scale length. The sheared boundary layer thickness (Δ m ) is inferred to be around 3000 km, which appears to have weak dependence on V sw . J ∥ has dependencies on Δ m , Σ p , n sw , and V sw . The analytic model provides a simple way to organize data and to infer boundary layer structures from ionospheric data.

Johnson, Jay R.↗

Quantifying model structural error: Efficient Bayesian calibration of a regional groundwater flow model using surrogates and a data-driven error model

Groundwater model structural error is ubiquitous, due to simplification and/or misrepresentation of real aquifer systems. During model calibration, the basic hydrogeological parameters may be adjusted to compensate for structural error. This may result in biased predictions when such calibrated models are used to forecast aquifer responses to new forcing. Here, we investigate the impact of model structural error on calibration and prediction of a real-world groundwater flow model, using a Bayesian method with a data-driven error model to explicitly account for model structural error. The error-explicit Bayesian method jointly infers model parameters and structural error and thereby reduces parameter compensation. In this study, Bayesian inference is facilitated using high performance computing and fast surrogate models (based on machine learning techniques) as a substitute for the computationally expensive groundwater model. We demonstrate that with explicit treatment of model structural error, the Bayesian method yields parameter posterior distributions that are substantially different from those derived using classical Bayesian calibration that does not account for model structural error. We also found that the error-explicit Bayesian method gives signficantly more accurate prediction along with reasonable credible intervals. Finally, through variance decomposition, we provide a comprehensive assessment of prediction uncertainty contributed from parameter, model structure, and measurement uncertainty. The results suggest that the error-explicit Bayesian approach provides a solution to real-world modeling applications for which data support the presence of model structural error, yet model deficiency cannot be specifically identified or corrected.

54 ENVIRONMENTAL SCIENCES↗

Using Low-Frequency Earthquake Families on the San Andreas Fault as Deep Creepmeters

The central section of the San Andreas Fault hosts tectonic tremor and low-frequency earthquakes (LFEs) similar to subduction zone environments. LFEs are often interpreted as persistent regions that repeatedly fail during the aseismic shear of the surrounding fault allowing them to be used as creepmeters. Here, we test this idea by using the recurrence intervals of individual LFEs within LFE families to estimate the timing, duration, recurrence interval, slip, and slip rate associated with inferred slow slip events. We formalize the definition of a creepmeter and determine whether this definition is consistent with our observations. We find that episodic families reflect surrounding creep over the interevent time, while the continuous families and the short time scale bursts that occur as part of the episodic families do not. However, when these families are evaluated on time scales longer than the interevent time these events can also be used to meter slip. A straightforward interpretation of episodic families is that they define sections of the fault where slip is distinctly episodic in well-defined slow slip events that slip 16 times the long-term rate. In contrast, the frequent short-term bursts of the continuous and short time scale episodic families likely do not represent individual creep events but rather are persistent asperities that are driven to failure by quasi-continuous creep on the surrounding fault. We find that the moment-duration scaling of our inferred creep events are inconsistent with the proposed linear moment-duration scaling. However, caution must be exercised when attempting to determine scaling with incomplete knowledge of scale.

58 GEOSCIENCES↗

Observed and Simulated Sensitivities of Spring Greenup to Preseason Climate in Northern Temperate and Boreal Regions: Climate control on spring phenology

Vegetation phenology plays an important role in regulating land-atmosphere energy, water, and trace-gas exchanges. Changes in spring greenup (SG) have been documented in the past half-century in response to ongoing climate change. We use normalized difference vegetation index generated from NOAA's advanced very high resolution radiometer data in the Global Inventory Modeling and Monitoring Study project over the 1982–2005 period, coupled with climate reanalysis (Climate Research Unit-National Centers for Environmental Prediction) to investigate the SG responses to preseason climate change in northern temperate and boreal regions. We compared these observed responses to the simulated SG responses to preseason climate inferred from the Earth system models (ESMs) participating in the Coupled Model Intercomparison Project Phase 5 (CMIP5) over 1982–2005. The observationally inferred SG suggests that there has been an advance of about 1 days per decade between 1982 and 2005 in the northern midlatitude to high latitude, with significant spatial heterogeneity. The spatial heterogeneity of the SG advance results from heterogeneity in the change of the preseason climate as well as varied vegetation responses to the preseason climate across biomes. The SG to preseason temperature sensitivity is highest in forests other than deciduous needleleaf forests, followed by temperate grasslands and woody savannas. The SG in deciduous needleleaf forests, open shrublands, and tundra is relatively insensitive to preseason temperature. Although the extent of regions where the SG is sensitive to preseason precipitation is smaller than the extent of regions where the SG is sensitive to preseason temperature, the biomes that are more sensitive to temperature are also more sensitive to precipitation, suggesting the interactive control of temperature and precipitation. Finally, in the mean, the CMIP5 ESMs reproduced the dominant latitudinal preseason climate trends and SG advances. However, large biases in individual ESMs for the preseason period, climate, and SG sensitivity imply needed model improvements to climate prediction and phenological process parameterizations.

59 BASIC BIOLOGICAL SCIENCES↗

Developing Asparagaceae1726: An Asparagaceae‐specific probe set targeting 1726 loci for Hyb‐Seq and phylogenomics in the family

Abstract Premise Target sequence capture (Hyb‐Seq) is a cost‐effective sequencing strategy that employs RNA probes to enrich for specific genomic sequences. By targeting conserved low‐copy orthologs, Hyb‐Seq enables efficient phylogenomic investigations. Here, we present Asparagaceae1726—a Hyb‐Seq probe set targeting 1726 low‐copy nuclear genes for phylogenomics in the angiosperm family Asparagaceae—which will aid the often‐challenging delineation and resolution of evolutionary relationships within Asparagaceae. Methods Here we describe and validate the Asparagaceae1726 probe set (https://github.com/bentzpc/Asparagaceae1726) in six of the seven subfamilies of Asparagaceae. We perform phylogenomic analyses with these 1726 loci and evaluate how inclusion of paralogs and bycatch plastome sequences can enhance phylogenomic inference with target‐enriched data sets. Results We recovered at least 82% of target orthologs from all sampled taxa, and phylogenomic analyses resulted in strong support for all subfamilial relationships. Additionally, topology and branch support were congruent between analyses with and without inclusion of target paralogs, suggesting that paralogs had limited effect on phylogenomic inference. Discussion Asparagaceae1726 is effective across the family and enables the generation of robust data sets for phylogenomics of any Asparagaceae taxon. Asparagaceae1726 establishes a standardized set of loci for phylogenomic analysis in Asparagaceae, which we hope will be widely used for extensible and reproducible investigations of diversification in the family.

Plant Sciences↗

Evidence-based evaluation of the cumulative effects of ecosystem restoration

Evaluating the cumulative effects of large-scale ecological restoration programs is necessary to inform adaptive ecosystem management and provide society with resilient and sustainable services. However, complex linkages between restorative actions and ecosystem responses make evaluations problematic. Despite long-term federal investments in restoring aquatic ecosystems, no standard evaluation method has been adopted and most programs focus on monitoring and analysis, not synthesis and evaluation. In this paper, we demonstrate a new transdisciplinary approach integrating techniques from evidence-based medicine, critical thinking, and cumulative effects assessment. Tiered hypotheses are identified using an ecosystem conceptual model. The systematic literature review at the core of evidence-based assessment becomes one of many lines of evidence assessed collectively, using critical thinking strategies and causal criteria from a cumulative effects perspective. As a demonstration, we analyzed data from 166 locations on the Columbia River and estuary representing 12 indicators of habitat and fish response to floodplain restoration actions intended to benefit threatened and endangered salmon. Synthesis of seven lines of evidence showed that hydrologic reconnection promoted macrodetritis export, prey availability, and fish access and feeding. The evidence was sufficient to infer cross-boundary, indirect, compounding and delayed cumulative effects, and suggestive of nonlinear, landscape-scale, and spatial density effects. On the basis of causal inferences regarding food web functions, we concluded that the restoration program has a cumulative beneficial effect on juvenile salmon. As a result, this evidence-based approach will enable the evaluation of restoration in complex coastal and riverine ecosystems where data have accumulated without sufficient synthesis.

54 ENVIRONMENTAL SCIENCES↗

Reverse Engineering Adverse Outcome Pathways

The toxicological effects of many stressors are mediated through unknown, or poorly characterized, mechanisms of action. We describe the application of reverse engineering complex interaction networks from high dimensional omics data (gene, protein, metabolic, signaling) to characterize adverse outcome pathways (AOPs) for chemicals that disrupt the hypothalamus-pituitary-gonadal endocrine axis in fathead minnows. Gene expression changes in fathead minnow ovaries in response to 7 different chemicals, over different times, doses, and in vivo versus in vitro conditions were captured in a large data set of 868 arrays. We examined potential AOPs of the antiandrogen flutamide using two mutual information theory methods, ARACNE and CLR to infer gene regulatory networks and potential adverse outcome pathways. Representative networks from these studies were used to predict a network path from stressor to adverse outcome as a candidate AOP. The relationship of individual chemicals to an adverse outcome can be determined by following perturbations through the network in response to chemical treatment leading to the nodes associated with the adverse outcome. Identification of candidate pathways allows for formation of testable hypotheses about key biologic processes, biomarkers or alternative endpoints, which could be used to monitor an adverse outcome pathway. Finally, we identify the unique challenges facing the application of this approach in ecotoxicology, and attempt to provide a road map for the utilization of these tools. Key Words: mechanism of action, toxicology, microarray, network inference

59 BASIC BIOLOGICAL SCIENCES↗