Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Probabilities Mathematics”

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,693 records · Page 94

RAVEN Theory Manual

RAVEN is a software framework able to perform parametric and stochastic analysis based on the response of complex system codes. The initial development was aimed at providing dynamic risk analysis capabilities to the thermohydraulic code RELAP-7, currently under development at Idaho National Laboratory (INL). Although the initial goal has been fully accomplished, RAVEN is now a multi-purpose stochastic and uncertainty quantification platform, capable of communicating with any system code. In fact, the provided Application Programming Interfaces (APIs) allow RAVEN to interact with any code as long as all the parameters that need to be perturbed are accessible by input files or via python interfaces. RAVEN is capable of investigating system response and explore input space using various sampling schemes such as Monte Carlo, grid, or Latin hypercube. However, RAVEN strength lies in its system feature discovery capabilities such as: constructing limit surfaces, separating regions of the input space leading to system failure, and using dynamic supervised learning techniques. The development of RAVEN started in 2012 when, within the Nuclear Energy Advanced Modeling and Simulation (NEAMS) program, the need to provide a modern risk evaluation framework arose. RAVEN’s principal assignment is to provide the necessary software and algorithms in order to employ the concepts developed by the Risk Informed Safety Margin Characterization (RISMC) program. RISMC is one of the pathways defined within the Light Water Reactor Sustainability (LWRS) program. In the RISMC approach, the goal is not just to identify the frequency of an event potentially leading to a system failure, but the proximity (or lack thereof) to key safety-related events. Hence, the approach is interested in identifying and increasing the safety margins related to those events. A safety margin is a numerical value quantifying the probability that a safety metric (e.g. peak pressure in a pipe) is exceeded under certain conditions. Most of the capabilities, implemented having RELAP-7 as a principal focus, are easily deployable to other system codes. For this reason, several side activates have been employed (e.g. RELAP5-3D, any MOOSE-based App, etc.) or are currently ongoing for coupling RAVEN with several different software. The aim of this document is to provide a set of commented examples that can help the user to become familiar with the RAVEN code usage.

97 MATHEMATICS AND COMPUTING↗

Density Large Deviations for Multidimensional Stochastic Hyperbolic Conservation Laws

We investigate the density large deviation function for a multidimensional conservation law in the vanishing viscosity limit, when the probability concentrates on weak solutions of a hyperbolic conservation law. When the mobility and diffusivity matrices are proportional, i.e. an Einstein-like relation is satisfied, the problem has been solved in Bellettini and Mariani (Bull Greek Math Soc 57:31–45, 2010). When this proportionality does not hold, we compute explicitly the large deviation function for a step-like density profile, and we show that the associated optimal current has a non trivial structure. We also derive a lower bound for the large deviation function, valid for a more general weak solution, and leave the general large deviation function upper bound as a conjecture.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

A unified and constructive framework for the universality of neural networks

Abstract One of the reasons why many neural networks are capable of replicating complicated tasks or functions is their universal approximation property. Though the past few decades have seen tremendous advances in theories of neural networks, a single constructive and elementary framework for neural network universality remains unavailable. This paper is an effort to provide a unified and constructive framework for the universality of a large class of activation functions including most of the existing ones. At the heart of the framework is the concept of neural network approximate identity (nAI). The main result is as follows: any nAI activation function is universal in the space of continuous functions on compacta. It turns out that most of the existing activation functions are nAI, and thus universal. The framework induces several advantages over the contemporary counterparts. First, it is constructive with elementary means from functional analysis, probability theory, and numerical analysis. Second, it is one of the first unified and constructive attempts that is valid for most of the existing activation functions. Third, it provides new proofs for most activation functions. Fourth, for a given activation and error tolerance, the framework provides precisely the architecture of the corresponding one-hidden neural network with a predetermined number of neurons and the values of weights/biases. Fifth, the framework allows us to abstractly present the first universal approximation with a favorable non-asymptotic rate. Sixth, our framework also provides insights into the developments, and hence providing constructive derivations, of some of the existing approaches.

97 MATHEMATICS AND COMPUTING↗

Search for critical-point nuclei in terms of the sextic oscillator

The spherical to deformed gamma-unstable shape transition in nuclei is discussed in terms of the sextic oscillator as a gamma-independent potential in the Bohr Hamiltonian. The wave functions, energy eigenvalues, and electric quadrupole and monopole transition rates are calculated in closed analytical form for the lowest-lying energy levels. It is shown that the locus of critical points for the spherical to deformed gamma-unstable shape phase transition corresponds to a parabola in the parameter space of the model. The ratios of energy eigenvalues and electromagnetic transition probabilities are constant along this parabola. It is thus possible to associate parameter-free benchmark values to the ratios of relevant observables at the critical point of the transition that can be compared to experimental data. In addition, systematic studies of the shape evolution in isotope chains can be performed within the model. As an application, the model parameters are fitted to the energy spectra of the chains of even-even Ru, Pd, and Cd isotopes and the electric quadrupole transition probabilities are calculated. It is found that {sup 104}Ru, {sup 102}Pd, and {sup 106,108}Cd nuclei, which are usually considered to be good candidates for the E(5) symmetry, lie rather close to the critical parabola that separates the spherical and deformed gamma-unstable domains. The isotope {sup 116}Cd is proposed as a new candidate for a similar critical-point nucleus.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

A Graphical Model for Fusing Diverse Microbiome Data

This paper develops a Bayesian graphical model for fusing disparate types of count data. The motivating application is the study of bacterial communities from diverse high-dimensional features, in this case, transcripts, collected from different treatments. In such datasets, there are no explicit correspondences between the communities and each corresponds to different factors, making data fusion challenging. We introduce a flexible multinomial-Gaussian generative model for jointly modeling such count data. This latent variable model jointly characterizes the observed data through a common multivariate Gaussian latent space that parameterizes the set of multinomial probabilities of the transcriptome counts. The covariance matrix of the latent variables induces a covariance matrix of co-dependencies between all the transcripts, effectively fusing multiple data sources. We present a computationally scalable variational Expectation-Maximization (EM) algorithm for inferring the latent variables and the parameters of the model. Here, the inferred latent variables provide a common dimensionality reduction for visualizing the data and the inferred parameters provide a predictive posterior distribution. In addition to simulation studies that demonstrate the variational EM procedure, we apply our model to a bacterial microbiome dataset.

59 BASIC BIOLOGICAL SCIENCES↗

Predictive models of the genetic bases underlying budding yeast fitness in multiple environments

Abstract The ability of organisms to adapt and survive depends on the effects of genes and the environment on fitness. However, the multigenic nature of fitness and genotype-by-environment interactions hinder our understanding of the genetic basis of fitness. Here, we established fitness prediction models for 35 environments using machine learning and existing fitness data and different genetic variant types for a Saccharomyces cerevisiae population. Models revealed that the predictive ability of genetic variants varied across environments, with copy number variants explaining the majority of fitness variation in most cases. Model interpretation showed that different variant types identified distinct gene sets associated with predictive variants. These gene sets were significantly enriched in experimentally validated genes affecting fitness in only a subset of environments, indicating that many genes influencing fitness remain unexplored. Notably, non-experimentally validated genes were more important than validated ones for fitness predictions. Gene contributions to predictions were both isolate- and environment-dependent, pointing to gene-by-gene and gene-by-environment interactions. Furthermore, models uncovered experimentally validated and novel candidate genetic interactions for a well-characterized stress, the fungicide benomyl. These findings highlight the feasibility of identifying the genetic basis of fitness by using different genetic variant types and offer novel targets for future functional analysis.

DNA copy number variations↗

SQERTSS: Dynamic rank based throttling of transition probabilities in kinetic Monte Carlo simulations

Lattice based Kinetic Monte Carlo (KMC) simulations offer a powerful simulation technique for investigating large reaction networks while retaining spatial configuration information, unlike ordinary differential equations. However, large chemical reaction networks can contain reaction processes with rates spanning multiple orders of magnitude. This can lead to the problem of “KMC stiffness” (similar to stiffness in differential equations), where the computational expense has the potential to be overwhelmed by very short time-steps during KMC simulations, with the simulation spending an inordinate amount of KMC steps / cpu-time simulating fast frivolous processes (FFPs) without progressing the system (reaction network). In order to achieve simulation times that are experimentally relevant or desired for predictions, a dynamic throttling algorithm involving separation of the processes into speed-ranks based on event frequencies has been designed and implemented with the intent of decreasing the probability of FFP events, and increasing the probability of slow process events -- allowing rate limiting events to become more likely to be observed in KMC simulations. This Staggered Quasi-Equilibrium Rank-based Throttling for Steady-state (SQERTSS) algorithm designed for use in achieving and simulating steady-state conditions in KMC simulations. Lastly, as shown in this work, the SQERTSS algorithm also works for transient conditions: the correct configuration space and final state will still be achieved if the required assumptions are not violated, with the caveat that the sizes of the time-steps may be distorted during the transient period.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Delayed Slater determinant update algorithms for high efficiency quantum Monte Carlo

Within ab initio Quantum Monte Carlo simulations, the leading numerical cost for large systems is the computation of the values of the Slater determinants in the trial wavefunction. Each Monte Carlo step requires finding the determinant of a dense matrix. This is most commonly iteratively evaluated using a rank-1 Sherman-Morrison updating scheme to avoid repeated explicit calculation of the inverse. The overall computational cost is therefore formally cubic in the number of electrons or matrix size. To improve the numerical efficiency of this procedure, we propose a novel multiple rank delayed update scheme. This strategy enables probability evaluation with application of accepted moves to the matrices delayed until after a predetermined number of moves, K . The accepted events are then applied to the matrices en bloc with enhanced arithmetic intensity and computational efficiency via matrix-matrix operations instead of matrix-vector operations. Here this procedure does not change the underlying Monte Carlo sampling or its statistical efficiency. For calculations on large systems and algorithms such as diffusion Monte Carlo where the acceptance ratio is high, order of magnitude improvements in the update time can be obtained on both multi- core CPUs and GPUs.

97 MATHEMATICS AND COMPUTING↗

Role of shape dependence of dissipation on nuclear fission

We examine the validity of extending Kramers' expression for fission width to systems with shape-dependent dissipations. For a system with a shape-dependent dissipation, Kramers' width obtained with the presaddle dissipation strength is found to be different from the stationary width obtained from the corresponding Langevin equations. It is demonstrated that the probability of a hot compound nucleus undergoing fission depends on both the presaddle and the postsaddle dynamics of collective nuclear motion. The predictions for prescission neutron multiplicity and evaporation residue cross section from statistical model calculations are also found to be different from those obtained from Langevin dynamical calculations when a shape-dependent dissipation is considered. For systems with shape-dependent dissipations, we conclude that the strength of 'presaddle dissipation' determined by fitting experimental data in statistical model calculations does not represent the true strength of presaddle dissipation.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Chance-Constrained AC Optimal Power Flow: Reformulations and Efficient Algorithms

Higher levels of renewable electricity generation increase uncertainty in power system operation. To ensure secure system operation, new tools that account for this uncertainty are required. Here, in this paper, we adopt a chance-constrained AC optimal power flow formulation, which guarantees that generation, power flows and voltages remain within their bounds with a pre-defined probability. We then discuss different chance-constraint reformulations and solution approaches for the problem. Additionally, we first discuss an analytical reformulation based on partial linearization, which enables us to obtain a tractable representation of the optimization problem. We then provide an efficient algorithm based on an iterative solution scheme which alternates between solving a deterministic AC OPF problem and assessing the impact of uncertainty. This more flexible computational framework enables not only scalable implementations, but also alternative chance-constraint reformulations. In particular, we suggest two sample based reformulations that do not require any approximation or relaxation of the AC power flow equations.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Hyporheic hydraulic geometry: Conceptualizing relationships among hyporheic exchange, storage, and water age

Hyporheic exchange is now widely acknowledged as a key driver of ecosystem processes in many streams. Yet stream ecologists have been slow to adopt nuanced hydrologic frameworks developed and applied by engineers and hydrologists to describe the relationship between water storage, water age, and water balance in finite hydrosystems such as hyporheic zones. Here, in the context of hyporheic hydrology, we summarize a well-established mathematical framework useful for describing hyporheic hydrology, while also applying the framework heuristically to visualize the relationships between water age, rates of hyporheic exchange, and water volume within hyporheic zones. Building on this heuristic application, we discuss how improved accuracy in the conceptualization of hyporheic exchange can yield a deeper understanding of the role of the hyporheic zone in stream ecosystems. Although the equations presented here have been well-described for decades, our aim is to make the mathematical basis as accessible as possible and to encourage broader understanding among aquatic ecologists of the implications of tailed age distributions commonly observed in water discharged from and stored within hyporheic zones. Our quantitative description of “hyporheic hydraulic geometry,” associated visualizations, and discussion offer a nuanced and realistic understanding of hyporheic hydrology to aid in considering hyporheic exchange in the context of river and stream ecosystem science and management.

54 ENVIRONMENTAL SCIENCES↗

Sampling, feasibility, and priors in data assimilation

Importance sampling algorithms are discussed in detail, with an emphasis on implicit sampling, and applied to data assimilation via particle filters. Implicit sampling makes it possible to use the data to find high-probability samples at relatively low cost, making the assimilation more efficient. A new analysis of the feasibility of data assimilation is presented, showing in detail why feasibility depends on the Frobenius norm of the covariance matrix of the noise and not on the number of variables. A discussion of the convergence of particular particle filters follows. A major open problem in numerical data assimilation is the determination of appropriate priors, a progress report on recent work on this problem is given. The analysis highlights the need for a careful attention both to the data and to the physics in data assimilation problems.

97 MATHEMATICS AND COMPUTING↗

SCALE 6.2 Continuous-Energy TSUNAMI-3D Capabilities

The TSUNAMI (Tools for Sensitivity and UNcertainty Analysis Methodology Implementation) capabilities within the SCALE code system make use of sensitivity coefficients for an extensive number of criticality safety applications, such as quantifying the data-induced uncertainty in the eigenvalue of critical systems, assessing the neutronic similarity between different systems, quantifying computational biases, and guiding nuclear data adjustment studies. The need to model geometrically complex systems with improved ease of use and fidelity and the desire to extend TSUNAMI analysis to advanced applications have motivated the development of a SCALE 6.2 module for calculating sensitivity coefficients using three-dimensional (3D) continuous-energy (CE) Monte Carlo methods: CE TSUNAMI-3D. This paper provides an overview of the theory, implementation, and capabilities of the CE TSUNAMI-3D sensitivity analysis methods. CE TSUNAMI contains two methods for calculating sensitivity coefficients in eigenvalue sensitivity applications: (1) the Iterated Fission Probability (IFP) method and (2) the Contributon-Linked eigenvalue sensitivity/Uncertainty estimation via Track length importance CHaracterization (CLUTCH) method. This work also presents the GEneralized Adjoint Response in Monte Carlo method (GEAR-MC), a first-of-its-kind approach for calculating adjoint-weighted, generalized response sensitivity coefficients—such as flux responses or reaction rate ratios—in CE Monte Carlo applications. The accuracy and efficiency of the CE TSUNAMI-3D eigenvalue sensitivity methods are assessed from a user perspective in a companion publication, and the accuracy and features of the CE TSUNAMI-3D GEAR-MC methods are detailed in this paper.

42 ENGINEERING↗

Three-dimensional simulations of oblique asteroid impacts into water

Waves generated by impacts into oceans may represent the most significant danger from near-earth asteroids and comets. For impacts near populated shores, the crown splash and subsequent waves, accompanied by sediment lofting and high winds, are more damaging than storm surges from the strongest hurricanes. Asteroids less than 500 m in diameter, impacting deep water far from shores, produce waves that may be detectable over large distances, but are probably not significantly dangerous. Here, we present new three-dimensional simulations of oblique impacts into deep water, with trajectory angles ranging from 27° to 60° (where 90° is vertical). These simulations are performed with the Los Alamos Rage hydrocode, and include atmospheric effects including ablation and airbursts. These oblique impact simulations are specifically performed in order to help determine whether there are additional dangers from the obliquity of impact not covered by previous two-dimensional studies. Water surface elevation profiles, surface pressures, and depth-averaged mass fluxes within the water are prepared for use in propagation studies

79 ASTRONOMY AND ASTROPHYSICS↗

Reliability modeling in a predictive maintenance context: A margin-based approach

Current system reliability methods (typically based on fault trees or reliability block diagrams) can effectively propagate reliability data from the asset to the system level in order to identify system critical points. However, employed asset reliability data are an approximated integral representation of the past industrywide operational experience, and they neglect the present asset health status (available, for example, from online monitoring data and diagnostic assessments) and forecasted health projection (when available from prognostic models). Asset health should be informed solely by that specific asset’s current and historical performance data and should not be an approximated integral representation of the past industrywide operational experience (as currently performed by system reliability models through Bayesian updating processes). Sensor data, diagnostic assessments, and prognostic assessments are in fact not considered in plant reliability models used to inform system engineers on the most critical assets. In addition, the propagation of quantitative health data from the asset to the system level is a challenge given the diverse nature and structure of health data elements (e.g., vibration spectra, temperature readings, expected failure time). Ideally, in a predictive maintenance context, system reliability models should support decision making by propagating available health information from the asset to the system level in order to provide a quantitative snapshot of system health and identify the most critical assets. Here, this paper is directly addressing these two goals by proposing a different approach for reliability modeling that relies on asset diagnostic and prognostic assessments, along with monitoring data to measure asset health. The propagation of health data from the asset to the system level is performed through fault tree models not in probability terms, but in terms of margin where margin is the “distance” between the present status and an undesired event (e.g., failure or unacceptable performance). Through a cause-effect lens, while classical reliability models target the effect associated with asset performance, a margin-based approach focuses on the cause of an undesired asset performance (i.e., its health). Hence, thinking of reliability in terms of margins implies decision-making based on causal reasoning. We will show how fault tree models can be solved using a margin language and how this process can effectively assist system engineers to identify the most critical assets.

97 - MATHEMATICS AND COMPUTING↗

Oscillation of neutrinos produced by the annihilation of dark matter inside the Sun

The annihilation of dark matter particles captured by the Sun can lead to a neutrino flux observable in neutrino detectors. Considering the fact that these dark matter particles are nonrelativistic, if a pair of dark matter annihilates to a neutrino pair, the spectrum of neutrinos will be monochromatic. We show that in this case, even after averaging over the production point inside the Sun, the oscillatory terms of the oscillation probability do not average to zero. This leads to interesting observable features in the annual variation of the number of muon track events. We show that smearing of the spectrum due to thermal distribution of dark matter inside the Sun is too small to wash out this variation. We point out the possibility of studying the initial flavor composition of neutrinos produced by the annihilation of dark matter particles via measuring the annual variation of the number of {mu}-track events in neutrino telescopes.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Uncertainty quantification for nuclear density functional theory and information content of new measurements

Statistical tools of uncertainty quantification can be used to assess the information content of measured observables with respect to present-day theoretical models, to estimate model errors and thereby improve predictive capability, to extrapolate beyond the regions reached by experiment, and to provide meaningful input to applications and planned measurements. To showcase new opportunities offered by such tools, we make a rigorous analysis of theoretical statistical uncertainties in nuclear density functional theory using Bayesian inference methods. By considering the recent mass measurements from the Canadian Penning Trap at Argonne National Laboratory, we demonstrate how the Bayesian analysis and a direct least-squares optimization, combined with high-performance computing, can be used to assess the information content of the new data with respect to a model based on the Skyrme energy density functional approach. Employing the posterior probability distribution computed with a Gaussian process emulator, we apply the Bayesian framework to propagate theoretical statistical uncertainties in predictions of nuclear masses, two-neutron dripline, and fission barriers. Overall, we find that the new mass measurements do not impose a constraint that is strong enough to lead to significant changes in the model parameters. In addition, the example discussed in this study sets the stage for quantifying and maximizing the impact of new measurements with respect to current modeling and guiding future experimental efforts, thus enhancing the experiment-theory cycle in the scientific method.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Distributionally Robust Variational Quantum Algorithms With Shifted Noise

Given their potential to demonstrate near-term quantum advantage, variational quantum algorithms (VQAs) have been extensively studied. Although numerous techniques have been developed for VQA parameter optimization, it remains a significant challenge. A practical issue is the high sensitivity of quantum noise to environmental changes, and its propensity to shift in real time. This presents a critical problem as an optimized VQA ansatz may not perform effectively under a different noise environment. For the first time, we explore how to optimize VQA parameters to be robust against unknown shifted noise. We model the noise level as a random variable with an unknown probability density function (PDF), and we assume that the PDF may shift within an uncertainty set. This assumption guides us to formulate a distributionally robust optimization problem, with the goal of finding parameters that maintain effectiveness under shifted noise. We utilize a distributionally robust Bayesian optimization solver for our proposed formulation. This provides numerical evidence in both the Quantum Approximate Optimization Algorithm (QAOA) and the Variational Quantum Eigensolver (VQE) with hardware-efficient ansatz, indicating that we can identify parameters that perform more robustly under shifted noise. We regard this work as the first step towards improving the reliability of VQAs influenced by real-time noise.

97 MATHEMATICS AND COMPUTING↗