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 793 records · Page 44

Global sensitivity analysis in stochastic simulators of uncertain reaction networks

Stochastic models of chemical systems are often subjected to uncertainties in kinetic parameters in addition to the inherent random nature of their dynamics. Uncertainty quantification in such systems is generally achieved by means of sensitivity analyses in which one characterizes the variability with the uncertain kinetic parameters of the first statistical moments of model predictions. In this work, we propose an original global sensitivity analysis method where the parametric and inherent variability sources are both treated through Sobol’s decomposition of the variance into contributions from arbitrary subset of uncertain parameters and stochastic reaction channels. The conceptual development only assumes that the inherent and parametric sources are independent, and considers the Poisson processes in the random-time-change representation of the state dynamics as the fundamental objects governing the inherent stochasticity. Here, a sampling algorithm is proposed to perform the global sensitivity analysis, and to estimate the partial variances and sensitivity indices characterizing the importance of the various sources of variability and their interactions. The birth-death and Schlögl models are used to illustrate both the implementation of the algorithm and the richness of the proposed analysis method. The output of the proposed sensitivity analysis is also contrasted with a local derivative-based sensitivity analysis method classically used for this type of systems.

97 MATHEMATICS AND COMPUTING↗

Chromatic information and feature detection in fast visual analysis

The visual system is able to recognize a scene based on a sketch made of very simple features. This ability is likely crucial for survival, when fast image recognition is necessary, and it is believed that a primal sketch is extracted very early in the visual processing. Such highly simplified representations can be sufficient for accurate object discrimination, but an open question is the role played by color in this process. Rich color information is available in natural scenes, yet artist's sketches are usually monochromatic; and, black-andwhite movies provide compelling representations of real world scenes. Also, the contrast sensitivity of color is low at fine spatial scales. We approach the question from the perspective of optimal information processing by a system endowed with limited computational resources. We show that when such limitations are taken into account, the intrinsic statistical properties of natural scenes imply that the most effective strategy is to ignore fine-scale color features and devote most of the bandwidth to gray-scale information. We find confirmation of these information-based predictions from psychophysics measurements of fast-viewing discrimination of natural scenes. As a result, we conclude that the lack of colored features in our visual representation, and our overall low sensitivity to high-frequency color components, are a consequence of an adaptation process, optimizing the size and power consumption of our brain for the visual world we live in.

97 MATHEMATICS AND COMPUTING↗

An onboard star identification algorithm

The paper presents the autonomous Initial Stellar Acquisition (ISA) algorithm developed for the X-Ray Timing Explorer for prividing the attitude quaternion within the desired accuracy, based on the one-axis attitude knowledge (through the use of the Digital Sun Sensor, CCD Star Trackers, and the onboard star catalog, OSC). Mathematical analysis leads to an accurate measure of the performance of the algorithm as a function of various parameters, such as the probability of a tracked star being in the OSC, the sensor noise level, and the number of stars matched. It is shown that the simplicity, tractability, and robustness of the ISA algorithm, compared to a general three-axis attiude determination algorithm, make it a viable on-board solution.

Ha, Kong↗

Physical Meaning of the Optimum Measurement Process in Quantum Detection Theory

The optimum measurement processes are represented as the optimum detection operators in the quantum detection theory. The error probability by the optimum detection operators goes beyond the standard quantum limit automatically. However the optimum detection operators are given by pure mathematical descriptions. In order to realize a communication system overcoming the standard quantum limit, we try to give the physical meaning of the optimum detection operators.

Osaki, Masao↗

Optimal Parameter for the Training of Multilayer Perceptron Neural Networks by Using Hierarchical Genetic Algorithm

This paper deals with the controversial topic of the selection of the parameters of a genetic algorithm, in this case hierarchical, used for training of multilayer perceptron neural networks for the binary classification. The parameters to select are the crossover and mutation probabilities of the control and parametric genes and the permanency percent. The results can be considered as a guide for using this kind of algorithm.

97 MATHEMATICS AND COMPUTING↗

Energy transfer among distant quantum systems in spatially shaped laser fields: Two H atoms with an internuclear separation of 5.29 nm (100 a.u.)

The quantum dynamics of two distant H atoms excited by ultrashort and spatially shaped laser pulses is studied by the numerical solution of the non-Born-Oppenheimer time-dependent Schroedinger equation within a three-dimensional (3D) model, including the internuclear distance R and the two z coordinates of the electrons z{sub 1} and z{sub 2}. The two one-dimensional (1D) H atoms, A and B, are assumed to be initially in their ground states with a large (but otherwise arbitrary) internuclear separation of R=100 a.u. (5.29 nm). Two types of a spatial envelope of a laser field linearly polarized along the z axis are considered: (i) a broad Gaussian envelope, such that atom A is excited by the laser field predominantly, and (ii) a narrow envelope, such that practically only atom A is excited by the laser field. With the laser carrier frequency {omega}=1.0 a.u. and the pulse duration t{sub p}=5 fs, in both cases an efficient energy transfer from atom A to atom B has been found. The ionization of atom B achieved mostly after the end of the laser pulse is close to or even higher than that of atom A. It is shown that with a narrow spatial envelope of the laser field, the underlying mechanisms of the energy transfer from A to B and the ionization of B are the Coulomb attraction of the laser driven electron by the proton of atom B and a short-range Coulomb repulsion of the two electrons when their wave functions significantly overlap in the domain of atom B. In the case of a broad Gaussian spatial envelope of the laser field, the opposite process also occurs, but with smaller probability: the energy is transferred from the weakly excited atom B to atom A, and the ionization of atom A is also induced by the electron-electron repulsion in the domain of atom A due to a strong overlap of the electronic wave functions.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Theoretical transition probabilities, oscillator strengths, and radiative lifetimes of levels in Pb IV

Transition probabilities and oscillator strengths of 176 spectral lines with astrophysical interest arising from 5d{sup 10}ns (n = 7,8), 5d{sup 10}np (n = 6,7), 5d{sup 10}nd (n = 6,7), 5d{sup 10}5f, 5d{sup 10}5g, 5d{sup 10}nh (n = 6,7,8), 5d{sup 9}6s{sup 2}, and 5d{sup 9}6s6p configurations, and radiative lifetimes for 43 levels of Pb IV, have been calculated. These values were obtained in intermediate coupling (IC) and using relativistic Hartree-Fock calculations including core-polarization effects. For the IC calculations, we use the standard method of least-square fitting from experimental energy levels by means of the Cowan computer code. The inclusion in these calculations of the 5d{sup 10}7p and 5d{sup 10}5f configurations has facilitated a complete assignment of the energy levels in the Pb IV. Transition probabilities, oscillator strengths, and radiative lifetimes obtained are generally in good agreement with the experimental data.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

SU-E-T-121: Analyzing the Broadening Effect On the Bragg Peak Due to Heterogeneous Geometries and Implementing User-Routines in the Monte-Carlo Code FLUKA in Order to Reduce Computation Time

Purpose: Aim of this study was to analyze the modulating, broadening effect on the Bragg Peak due to heterogeneous geometries like multi-wire chambers in the beam path of a particle therapy beam line. The effect was described by a mathematical model which was implemented in the Monte-Carlo code FLUKA via user-routines, in order to reduce the computation time for the simulations. Methods: The depth dose curve of 80 MeV/u C12-ions in a water phantom was calculated using the Monte-Carlo code FLUKA (reference curve). The modulating effect on this dose distribution behind eleven mesh-like foils (periodicity ∼80 microns) occurring in a typical set of multi-wire and dose chambers was mathematically described by optimizing a normal distribution so that the reverence curve convoluted with this distribution equals the modulated dose curve. This distribution describes a displacement in water and was transferred in a probability distribution of the thickness of the eleven foils using the water equivalent thickness of the foil’s material. From this distribution the distribution of the thickness of one foil was determined inversely. In FLUKA the heterogeneous foils were replaced by homogeneous foils and a user-routine was programmed that varies the thickness of the homogeneous foils for each simulated particle using this distribution. Results: Using the mathematical model and user-routine in FLUKA the broadening effect could be reproduced exactly when replacing the heterogeneous foils by homogeneous ones. The computation time was reduced by 90 percent. Conclusion: In this study the broadening effect on the Bragg Peak due to heterogeneous structures was analyzed, described by a mathematical model and implemented in FLUKA via user-routines. Applying these routines the computing time was reduced by 90 percent. The developed tool can be used for any heterogeneous structure in the dimensions of microns to millimeters, in principle even for organic materials like lung tissue.

60 APPLIED LIFE SCIENCES↗

Relativistic energy density functionals: Low-energy collective states of {sup 240}Pu and {sup 166}Er

The empirical relativistic density-dependent, point-coupling energy density functional, adjusted exclusively to experimental binding energies of a large set of deformed nuclei with Aapprox =150-180 and Aapprox =230-250, is tested with spectroscopic data for {sup 166}Er and {sup 240}Pu. Starting from constrained self-consistent triaxial relativistic Hartree-Bogoliubov calculations of binding energy maps as functions of the quadrupole deformation in the beta-gamma plane, excitation spectra and E2 transition probabilities are calculated as solutions of the corresponding microscopic collective Hamiltonian in five dimensions for quadrupole vibrational and rotational degrees of freedom and compared with available data on low-energy collective states.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Active Subspace Methods for Data-Intensive Inverse Problems (Final Report)

Fostered by advances in computing, simulation and data science have emerged as the third and fourth paradigms enabling scientific discovery. Many mathematical challenges arise when integrating these paradigms to produce new knowledge. One of the most important challenges is the inverse or calibration problem: find the inputs of a simulation such that its outputs agree with a given set of measurements. As both the cost of the complex simulations and the volume of measurement data sets increase, intuition-driven trial-and-error methods for calibration quickly become untenable; modern scientists need more computationally efficient and mathematically rigorous methods. When measurements and simulated predictions contain uncertainty, the Bayesian perspective on statistical inference provides a popular mathematical framework for developing computational methods to solve inverse problems. Markov chain Monte Carlo (MCMC) methods are a mainstay of this framework; they characterize a probability distribution on the space of model inputs that is conditioned on the given measurements. However, despite recent advances, MCMC methods remain impractical for expensive simulations with more than a handful of inputs. At its heart, MCMC searches the space of inputs for corresponding outputs that match measurements, and so it is afflicted with the curse of dimensionality. Additionally, MCMC methods become less efficient as the volume of the measurement data increases, particularly if the measurements are redundant. To make MCMC—and Bayesian methods, in general—amenable to today’s computer models with millions of inputs and terabytes of measurement data, one must devise methods to reduce the dimension of both the simulation inputs and the measurements. For many models used in practice, the outputs vary primarily on a low-dimensional manifold of the nominally high-dimensional input space. Recently developed active subspace methods discover this low-dimensional manifold and exploit it to enable analyses typically suited for low-dimensional settings (e.g., statistical inversion of complex systems). We hypothesize that active subspace methods can provide the necessary dimension reduction, enabling existing Bayesian methods to find solutions for a large class of otherwise intractable statistical inverse problems. We will test the hypothesis with a series of mathematical analyses and computational experiments that will proceed along three research veins: (i) integrating active subspace methods into methods for statistical inversion, (ii) addressing current challenges in active subspace methods, and (iii) incorporating methods for nonlinear dimensionality reduction into active subspace methods. We will apply the methods we develop to real inverse problems in chemical kinetics and turbulent flame modeling. Our team combines expertise in methods for inverse problems, dimension reduction, and reduced order modeling. With a history of active collaboration and thoughtful engagement, we bring enthusiasm and fresh perspectives to a well studied subject. We are excited by the potential opportunity to work together to extend and apply active subspace methods to data-intensive inverse problems.

97 MATHEMATICS AND COMPUTING↗

Active Subspace Methods for Data-Intensive Inverse Problems

Fostered by advances in computing, simulation and data science have emerged as the third and fourth paradigms enabling scientific discovery. Many mathematical challenges arise when integrating these paradigms to produce new knowledge. One of the most important challenges is the inverse or calibration problem: find the inputs of a simulation such that its outputs agree with a given set of measurements. As both the cost of the complex simulations and the volume of measurement data sets increase, intuition-driven trial-and-error methods for calibration quickly become untenable; modern scientists need more computationally efficient and mathematically rigorous methods. When measurements and simulated predictions contain uncertainty, the Bayesian perspective on statistical inference provides a popular mathematical framework for developing computational methods to solve inverse problems. Markov chain Monte Carlo (MCMC) methods are a mainstay of this framework; they characterize a probability distribution on the space of model inputs that is conditioned on the given measurements. However, despite recent advances, MCMC methods remain impractical for expensive simulations with more than a handful of inputs. At its heart, MCMC searches the space of inputs for corresponding outputs that match measurements, and so it is afflicted with the curse of dimensionality. Additionally, MCMC methods become less efficient as the volume of the measurement data increases, particularly if the measurements are redundant. To make MCMC—and Bayesian methods, in general—amenable to today’s computer models with millions of inputs and terabytes of measurement data, one must devise methods to reduce the dimension of both the simulation inputs and the measurements. For many models used in practice, the outputs vary primarily on a low-dimensional manifold of the nominally high-dimensional input space. Recently developed active subspace methods discover this low-dimensional manifold and exploit it to enable analyses typically suited for low-dimensional settings (e.g., statistical inversion of complex systems). We hypothesize that active subspace methods can provide the necessary dimension reduction, enabling existing Bayesian methods to find solutions for a large class of otherwise intractable statistical inverse problems. We will test the hypothesis with a series of mathematical analyses and computational experiments that will proceed along three research veins: (i) integrating active subspace methods into methods for statistical inversion, (ii) addressing current challenges in active subspace methods, and (iii) incorporating methods for nonlinear dimensionality reduction into active subspace methods. We will apply the methods we develop to real inverse problems in chemical kinetics and turbulent flame modeling. Our team combines expertise in methods for inverse problems, dimension reduction, and reduced order modeling. With a history of active collaboration and thoughtful engagement, we bring enthusiasm and fresh perspectives to a well studied subject. We are excited by the potential opportunity to work together to extend and apply active subspace methods to data-intensive inverse problems.

97 MATHEMATICS AND COMPUTING↗

Statistical characteristics of laser interference and its effect on IR optoelectronic observation systems

We consider statistical characteristics of laser interference recorded in the focal region of an IR optoelectronic observation system under field and out-of-field illumination by laser radiation. The applicability of the analytical description of experimental histograms of the laser interference signal distribution at the photodetector array output using the probability density approximations in the form of gamma distribution and the Gaussian function is substantiated. It is shown that the specific form of these functions is determined both by the mean value (mathematical expectation) of the interference signal and by the characteristic parameter M, which depends on the statistical properties of the laser interference. (laser applications and other issues in quantum electronics)

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Rolex: Resilience-oriented language extensions for extreme-scale systems

Future exascale high-performance computing (HPC) systems will be constructed from VLSI devices that will be less reliable than those used today, and faults will become the norm, not the exception. This will pose significant problems for system designers and programmers, who for half-a-century have enjoyed an execution model that assumed correct behavior by the underlying computing system. The mean time to failure (MTTF) of the system scales inversely to the number of components in the system and therefore faults and resultant system level failures will increase, as systems scale in terms of the number of processor cores and memory modules used. However every error detected need not cause catastrophic failure. Many HPC applications are inherently fault resilient. Yet it is the application programmers who have this knowledge but lack mechanisms to convey it to the system. In this paper, we present new Resilience Oriented Language Extensions (Rolex) which facilitate the incorporation of fault resilience as an intrinsic property of the application code. We describe the syntax and semantics of the language extensions as well as the implementation of the supporting compiler infrastructure and runtime system. Furthermore, our experiments show that an approach that leverages the programmer's insight to reason about the context and significance of faults to the application outcome significantly improves the probability that an application runs to a successful conclusion.

97 MATHEMATICS AND COMPUTING↗

Variational deep learning of equilibrium transition path ensembles

Here, we present a time-dependent variational method to learn the mechanisms of equilibrium reactive processes and efficiently evaluate their rates within a transition path ensemble. This approach builds off of the variational path sampling methodology by approximating the time-dependent commitment probability within a neural network ansatz. The reaction mechanisms inferred through this approach are elucidated by a novel decomposition of the rate in terms of the components of a stochastic path action conditioned on a transition. This decomposition affords an ability to resolve the typical contribution of each reactive mode and their couplings to the rare event. The associated rate evaluation is variational and systematically improvable through the development of a cumulant expansion. We demonstrate this method in both over- and under-damped stochastic equations of motion, in low-dimensional model systems, and in the isomerization of a solvated alanine dipeptide. In all examples, we find that we can obtain quantitatively accurate estimates of the rates of the reactive events with minimal trajectory statistics and gain unique insights into transitions through the analysis of their commitment probability.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

How uncertain is the future of electric vehicle market: Results from Monte Carlo simulations using a nested logit model

Plug-in electric vehicles (PEVs) are widely regarded as an important component of the technology portfolio designed to accomplish policy goals in sustainability and energy security. However, the market acceptance of PEVs in the future remains largely uncertain from today's perspective. By integrating a consumer choice model based on nested multinomial logit and Monte Carlo simulation, this study analyzes the uncertainty of PEV market penetration using Monte Carlo simulation. Results suggest that the future market for PEVs is highly uncertain and there is a substantial risk of low penetration in the early and midterm market. Top factors contributing to market share variability are price sensitivities, energy cost, range limitation, and charging availability. The results also illustrate the potential effect of public policies in promoting PEVs through investment in battery technology and infrastructure deployment. Here, continued improvement of battery technologies and deployment of charging infrastructure alone do not necessarily reduce the spread of market share distributions, but may shift distributions toward right, i.e., increase the probability of having great market success.

33 ADVANCED PROPULSION SYSTEMS↗

Cybersecurity Value-at-Risk Framework

As more variable renewable energy sources are added to the grid, the role of hydropower as a reliable baseline and firming resource is growing more critical. However, the U.S hydropower fleet is not fully prepared to face modern issues such as cybersecurity threats. Hydropower accounts for 37% of U.S. utility-scale renewable electricity but is challenged by diverse infrastructure and legacy devices that predate modern security practices. While new cybersecurity solutions cannot simply be added to current hydropower generation and operation technologies, custom cybersecurity assessments can reveal system-specific threats and risk probabilities and identify mitigating enhancements.

cybersecurity valuation methodology↗

Effect of Partial Key Knowledge

For strong cryptologic algorithms, it is often assumed that exhaustive search (AKA "brute force) will take 2 b trials, where b is the number of bits of the secret key. What happens, though, if an adversary gains partial knowledge of the secret key? Perhaps he has intercepted a garbled transmission of the key, where he knows the maximum number of garbles, but not where they occur, or perhaps he knows the probability of each bit being correct. How much does this help him?

97 MATHEMATICS AND COMPUTING↗

Compare $\overline{ν}$ parameterizations for 235 U(n,f) with fitted fission barriers

In this document, we compare observables computed with CGMF to some available data for 235 U(n,f), to investigate the multi-chance fission probabilities (fission barriers from CoH were refit) and two TKE parametrization. The four parametrizations include i) default CGMF multi-chance fission probabilities with bends in TKE for all fission chances, ii) default CGMF multi-chance fission probabilities with a TKE bend in only first-chance fission iii) refitted multi-chance fission probabilities with bends in TKE for all fission chances, and iv) refitted multi-chance fission probabilities with a bend in TKE for only first-chance fission. In all figures where the four parametrizations are on the same plot, the ones with bends in TKE for all chance fission are in black, with only first-chance bend in red, the default multi-chance fission probabilities are dashed and the new multi-chance fission probabilities are the solid lines.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗