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 559 records · Page 31

Higher-moment buffered probability

In stochastic optimization, probabilities naturally arise as cost functionals and chance constraints. Unfortunately, these functions are difficult to handle both theoretically and computationally. The buffered probability of failure and its subsequent extensions were developed as numerically tractable, conservative surrogates for probabilistic computations. In this manuscript, we introduce the higher-moment buffered probability. Whereas the buffered probability is defined using the Conditional Value-at-Risk, the higher-moment buffered probability is defined using Higher-Moment Coherent Risk measures. In this way, the higher-moment buffered probability encodes information about the magnitude of tail moments, not simply the tail average. We prove that the higher-moment buffered probability is closed, monotonic, quasi-convex and can be computed by solving a smooth one-dimensional convex optimization problem. These properties enable smooth reformulations of both higher-moment buffered probability cost functionals and constraints.

97 MATHEMATICS AND COMPUTING↗

Efficient Reliability Analysis using Generalized Multifidelity Modeling and Explainable Active Learning

To assess the reliability of critical technologies like nuclear plants and infrastructure systems and improve the robustness of design, engineers have to quantify the uncertainties surrounding the system behavior accurately. However, the complexity of the problem can make standard reliability analysis algorithms prohibitively expensive, primarily due to the high computational cost of estimating the system response at each iteration. This cost can be greatly reduced by using multi-fidelity modeling and machine learning to build a surrogate model to replace the expensive response function. We propose a general and robust method for building surrogates from multiple Low Fidelity (LF) models coupled with machine learning to retain accuracy. Our framework first constructs “Corrected Low Fidelity models” (CLFs) by coupling a High Fidelity (HF) model inferred Gaussian Process correction term with each of the LF models. It then uses the correction terms to assign model probabilities to each of these CLFs in an explainable way before using them to assemble the final surrogate. No assumptions are made about the type of the LF models or their correlation with the HF model. The proposed surrogate modeling framework is used within the subset simulation algorithm (a variance-reduced MCMC-based reliability analysis algorithm) for enhanced efficiency. Additionally, an active learning step is added to the algorithm to adaptively decide when the surrogate is not sufficiently accurate, at which point the HF model is called and used to refine the surrogate. Through a frame buckling example, our method is shown to be highly efficient at reducing the expensive HF model calls while accurately estimating the failure probability.

97 MATHEMATICS AND COMPUTING↗

TYPE Ia SUPERNOVA LIGHT-CURVE INFERENCE: HIERARCHICAL BAYESIAN ANALYSIS IN THE NEAR-INFRARED

We present a comprehensive statistical analysis of the properties of Type Ia supernova (SN Ia) light curves in the near-infrared using recent data from Peters Automated InfraRed Imaging TELescope and the literature. We construct a hierarchical Bayesian framework, incorporating several uncertainties including photometric error, peculiar velocities, dust extinction, and intrinsic variations, for principled and coherent statistical inference. SN Ia light-curve inferences are drawn from the global posterior probability of parameters describing both individual supernovae and the population conditioned on the entire SN Ia NIR data set. The logical structure of the hierarchical model is represented by a directed acyclic graph. Fully Bayesian analysis of the model and data is enabled by an efficient Markov Chain Monte Carlo algorithm exploiting the conditional probabilistic structure using Gibbs sampling. We apply this framework to the JHK{sub s} SN Ia light-curve data. A new light-curve model captures the observed J-band light-curve shape variations. The marginal intrinsic variances in peak absolute magnitudes are sigma(M{sub J}) = 0.17 +- 0.03, sigma(M{sub H}) = 0.11 +- 0.03, and sigma(M{sub Ks}) = 0.19 +- 0.04. We describe the first quantitative evidence for correlations between the NIR absolute magnitudes and J-band light-curve shapes, and demonstrate their utility for distance estimation. The average residual in the Hubble diagram for the training set SNe at cz > 2000kms{sup -1} is 0.10 mag. The new application of bootstrap cross-validation to SN Ia light-curve inference tests the sensitivity of the statistical model fit to the finite sample and estimates the prediction error at 0.15 mag. These results demonstrate that SN Ia NIR light curves are as effective as corrected optical light curves, and, because they are less vulnerable to dust absorption, they have great potential as precise and accurate cosmological distance indicators.

79 ASTRONOMY AND ASTROPHYSICS↗

The price of privately releasing contingency tables, and the spectra of random matrices with correlated rows

Contingency tables are the method of choice of government agencies for releasing statistical summaries of categorical data. In this paper, we consider lower bounds on how much distortion (noise) is necessary in these tables to provide privacy guarantees when the data being summarized is sensitive. We extend a line of recent work on lower bounds on noise for private data analysis [10, 13. 14, 15] to a natural and important class of functionalities. Our investigation also leads to new results on the spectra of random matrices with correlated rows. Consider a database D consisting of n rows (one per individual), each row comprising d binary attributes. For any subset of T attributes of size |T| = k, the marginal table for T has 2{sup k} entries; each entry counts how many times in the database a particular setting of these attributes occurs. Imagine an agency that wishes to release all (d/k) contingency tables for a given database. For constant k, previous work showed that distortion {tilde {Omicron}}(min{l_brace}n, (n{sup 2}d){sup 1/3}, {radical}d{sup k}{r_brace}) is sufficient for satisfying differential privacy, a rigorous definition of privacy that has received extensive recent study. Our main contributions are: (1) For {epsilon}- and ({epsilon}, {delta})-differential privacy (with {epsilon} constant and {delta} = 1/poly(n)), we give a lower bound of {tilde {Omega}}(min{l_brace}{radical}n, {radical}d{sup k}{r_brace}), which is tight for n = {tilde {Omega}}(d{sup k}). Moreover, for a natural and popular class of mechanisms based on additive noise, our bound can be strengthened to {Omega}({radical}d{sup k}), which is tight for all n. Our bounds extend even to non-constant k, losing roughly a factor of {radical}2{sup k} compared to the best known upper bounds for large n. (2) We give efficient polynomial time attacks which allow an adversary to reconstruct sensitive infonnation given insufficiently perturbed contingency table releases. For constant k, we obtain a lower bound of {tilde {Omega}}(min{l_brace}{radical}n, {radical}d{sup k}{r_brace}) that applies to a large class of privacy notions, including K-anonymity (along with its variants) and differential privacy. In contrast to our bounds for differential privacy, this bound (a) is shown only for constant k, but (b) is tight for all values of n when k is constant. (3) Our reconstruction-based attacks require a new lower bound on the least singular values of random matrices with correlated rows. For a constant k, consider a matrix M with (d/k) rows which are formed by taking all possible k-way entry-wise products of an underlying set of d random vectors. We show that even for nearly square matrices with d{sup k}/log d columns, the least singular value is {Omega}({radical}d{sup k}) with high probability - asymptotically, the same bound as one gets for a matrix with independent rows. The proof requires several new ideas for analyzing random matrices and could be of independent interest.

97 MATHEMATICS AND COMPUTING↗

Recurrences in three-state quantum walks on a plane

We analyze the role of dimensionality in the time evolution of discrete-time quantum walks through the example of the three-state walk on a two-dimensional triangular lattice. We show that the three-state Grover walk does not lead to trapping (localization) or recurrence to the origin, in sharp contrast to the Grover walk on the two-dimensional square lattice. We determine the power-law scaling of the probability at the origin with the method of stationary phase. We prove that only a special subclass of coin operators can lead to recurrence, and there are no coins that lead to localization. The propagation for the recurrent subclass of coins is quasi-one dimensional.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Hierarchical image segmentation for learning object priors

The proposed segmentation approach naturally combines experience based and image based information. The experience based information is obtained by training a classifier for each object class. For a given test image, the result of each classifier is represented as a probability map. The final segmentation is obtained with a hierarchial image segmentation algorithm that considers both the probability maps and the image features such as color and edge strength. We also utilize image region hierarchy to obtain not only local but also semi-global features as input to the classifiers. Moreover, to get robust probability maps, we take into account the region context information by averaging the probability maps over different levels of the hierarchical segmentation algorithm. The obtained segmentation results are superior to the state-of-the-art supervised image segmentation algorithms.

47 OTHER INSTRUMENTATION↗

Computing the moments of the neutron population using deterministic neutron transport

It is important to treat the inherent stochasticity of the fission process in systems where the behavior of the system is stochastic. This occurs when there are few neutrons in the system, or when the neutron source is weak. In order to characterize such systems, the capability to compute the first four moments of the neutron population distribution has been added to the deterministic neutral particle transport code, PARTISN. The moments are then fitted to probability density functions from the Pearson family. PARTISN is compared against MCNP6, with which it agrees well. (authors)

97 MATHEMATICS AND COMPUTING↗

Reduced Probabilities of E2-Transitions in {sup 174}Yb

This paper describes the ground (gr) and exited states of even-even deformed nuclei with a phenomenological model, which takes into account the mixing of gr states, 0{sub n}{sup +}({beta}{sub n})-, 2{sub n}{sup +}({gamma}{sub n})- and {Kappa}{sup {pi}} 1{sub n}{sup +}- rotational bands. The calculation has been done for the isotope Yb. The energy spectra are found to be consistent with the energies from experimental data. The reduced probabilities of the electric quadrupole E2-transitions from {beta}{sub n} and {gamma}{sub n} band states are calculated and agree quite well with the experimental values.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Modeling of the Flows of Admixtures in a Random Layered Strip with Probable Arrangement of Inclusions Near the Boundaries of the Body

We study the random flow of admixtures in a two-phase stochastically inhomogeneous strip with the most probable arrangement of inclusions in the vicinity of the surfaces of the body. A mathematical model is formulated for the function of diffusion flow with nonzero constant initial concentration. A random diffusion flow is represented in the form of a Neumann series. The procedure of averaging of the random mass flow over the ensemble of phase configurations with arcsine distribution function is performed. The influence of the characteristics of the medium on the distribution of mass flow is analyzed. It is shown that if the diffusion coefficient of admixtures in the inclusion is higher than for the matrix, then the increase in the characteristic thickness of the layers causes a decrease in the value of the diffusion flow, whereas the mass flow in the entire body increases with the volume fraction of the inclusions.

97 MATHEMATICS AND COMPUTING↗

Predicting demand for hydrogen station fueling

Full function hydrogen stations are a reality; fuel cell electric vehicle drivers can pull up to commercial fueling stations and receive 3–5 kg in less than 5 min, for an approximately 300-mile range. The demand for hydrogen is increasing, driven by an increase in the fueling of public and private fuel cell vehicles. This study describes the development and value of a model that simulates stochastic future demand at a hydrogen filling station. The predictive hydrogen demand model described in this article is trained from mathematical models constructed from actual hydrogen fill count, amount, and frequency data. Future fill probabilities inform the hour-by-hour demand profile and the station state of either “available, ready to fill” or “available, filling”. For example, a prediction for a station generally dispensing 5,000 kg a week on a Friday afternoon at 4 p.m. is 16 fills, totaling 48.7 kg, with a 0.52 proportion of time spent in “available, filling” state yielding 31 min of filling time. This is a first-of-its kind, published study on predicting future hydrogen demand by the time of day (e.g., hour-by-hour intervals) and day of week. This study can be used for hydrogen station requirements and operation and maintenance strategies and to assess the impact of demand variations and scenarios. Finally, this article presents the current status of hydrogen demand, the model development methods, a set of sample results. Discussion and conclusions concentrate on the value and use of the proposed model.

08 HYDROGEN↗

Minimum-error quantum distinguishability bounds from matrix monotone functions: A comment on 'Two-sided estimates of minimum-error distinguishability of mixed quantum states via generalized Holevo-Curlander bounds' [J. Math. Phys. 50, 032106 (2009)]

Matrix monotonicity is used to obtain upper bounds on minimum-error distinguishability of arbitrary ensembles of mixed quantum states. This generalizes one direction of a two-sided bound recently obtained by the author [J. Tyson, J. Math. Phys. 50, 032106 (2009)]. It is shown that the previously obtained special case has unique properties.

97 MATHEMATICS AND COMPUTING↗

Spontaneous Dimensional Reduction in Short-Distance Quantum Gravity?

Several lines of evidence suggest that quantum gravity at very short distances may behave effectively as a two-dimensional theory. I summarize these hints, and offer an additional argument based on the strong-coupling limit of the Wheeler-DeWitt equation. The resulting scenario suggests a novel approach to quantum gravity at the Planck scale.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

On the 'principle of the quantumness', the quantumness of Relativity, and the computational grand-unification

I will argue that the proposal of establishing operational foundations of Quantum Theory should have top-priority, and that the Lucien Hardy's program on Quantum Gravity should be paralleled by an analogous program on Quantum Field Theory (QFT), which needs to be reformulated, notwithstanding its experimental success. In this paper, after reviewing recently suggested operational 'principles of the quantumness', I address the problem on whether Quantum Theory and Special Relativity are unrelated theories, or instead, if the one implies the other. I show how Special Relativity can be indeed derived from causality of Quantum Theory, within the computational paradigm 'the universe is a huge quantum computer', reformulating QFT as a Quantum-Computational Field Theory (QCFT). In QCFT Special Relativity emerges from the fabric of the computational network, which also naturally embeds gauge invariance. In this scheme even the quantization rule and the Planck constant can in principle be derived as emergent from the underlying causal tapestry of space-time. In this way Quantum Theory remains the only theory operating the huge computer of the universe.Is the computational paradigm only a speculative tautology (theory as simulation of reality), or does it have a scientific value? The answer will come from Occam's razor, depending on the mathematical simplicity of QCFT. Here I will just start scratching the surface of QCFT, analyzing simple field theories, including Dirac's. The number of problems and unmotivated recipes that plague QFT strongly motivates us to undertake the QCFT project, since QCFT makes all such problems manifest, and forces a re-foundation of QFT.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Shell and Shapes in the N = 28 Isotones

New experimental results on {sup 43}S and {sup 44}S reveal that these nuclei are located in a transitional region of shape coexistence between the spherical {sup 48}Ca and the oblate {sup 42}Si. The origin of the deformation is discussed in terms of the evolution of the single particle energy levels leading to the compression of the energy difference of the orbitals in the sd and pf shells for protons and neutrons, respectively. Therefore, due to quadrupole excitations across the Z = 14 and N = 28 gaps, the intruder configuration in the neutron rich S isotopes became the ground state.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

A relativistically interacting exactly solvable multi-time model for two massless Dirac particles in 1 + 1 dimensions

The question how to Lorentz transform an N-particle wave function naturally leads to the concept of a so-called multi-time wave function, i.e., a map from (space-time){sup N} to a spin space. This concept was originally proposed by Dirac as the basis of relativistic quantum mechanics. In such a view, interaction potentials are mathematically inconsistent. This fact motivates the search for new mechanisms for relativistic interactions. In this paper, we explore the idea that relativistic interaction can be described by boundary conditions on the set of coincidence points of two particles in space-time. This extends ideas from zero-range physics to a relativistic setting. We illustrate the idea at the simplest model which still possesses essential physical properties like Lorentz invariance and a positive definite density: two-time equations for massless Dirac particles in 1 + 1 dimensions. In order to deal with a spatio-temporally non-trivial domain, a necessity in the multi-time picture, we develop a new method to prove existence and uniqueness of classical solutions: a generalized version of the method of characteristics. Both mathematical and physical considerations are combined to precisely formulate and answer the questions of probability conservation, Lorentz invariance, interaction, and antisymmetry.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Using integrated data analysis to extend measurement capability (invited)

The analysis approach called integrated data analysis (IDA) provides a means to exploit all information present in multiple streams of raw data to produce the best inference of a plasma parameter. This contrasts with the typical approach in which information (data) from a single diagnostic is used to measure a given parameter, e.g., visible bremsstrahlung → Z eff . Data from a given diagnostic usually contain information on many parameters. For example, a Thomson scattering diagnostic is sensitive to bremsstrahlung and line emission in addition to electron temperature. This background light is typically subtracted off and discarded but could be used to improve knowledge of Z eff . IDA encourages explicit awareness of such information and provides the quantitative framework to exploit it. This gives IDA the ability to increase spatial and temporal resolution, increase precision and accuracy of inferences, and measure plasma parameters that are difficult or impossible to measure using single diagnostic techniques. One example is the measurement of Z eff on Madison symmetric torus using IDA since no single diagnostic can provide a robust measurement. Thus, as we enter the burning plasma era, application of IDA will be critical to the measurement of certain parameters, as diagnostic access in the harsh fusion environment will be extremely limited.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Learning effective stochastic differential equations from microscopic simulations: Linking stochastic numerics to deep learning

We identify effective stochastic differential equations (SDEs) for coarse observables of fine-grained particle- or agent-based simulations; these SDEs then provide useful coarse surrogate models of the fine scale dynamics. We approximate the drift and diffusivity functions in these effective SDEs through neural networks, which can be thought of as effective stochastic ResNets. The loss function is inspired by, and embodies, the structure of established stochastic numerical integrators (here, Euler–Maruyama and Milstein); our approximations can thus benefit from backward error analysis of these underlying numerical schemes. They also lend themselves naturally to “physics-informed” gray-box identification when approximate coarse models, such as mean field equations, are available. Existing numerical integration schemes for Langevin-type equations and for stochastic partial differential equations can also be used for training; we demonstrate this on a stochastically forced oscillator and the stochastic wave equation. Our approach does not require long trajectories, works on scattered snapshot data, and is designed to naturally handle different time steps per snapshot. We consider both the case where the coarse collective observables are known in advance, as well as the case where they must be found in a data-driven manner.

97 MATHEMATICS AND COMPUTING↗

Hermitian dynamics in a class of pseudo-Hermitian networks

We investigate a pseudo-Hermitian lattice system, which consists of a set of isomorphic pseudo-Hermitian clusters coupled together in a Hermitian manner. We show that such non-Hermitian systems can act as Hermitian systems. This is made possible by considering the dynamics of a state involving an identical eigenmode of each isomorphic cluster. It still holds when multiple eigenmodes are involved and additional restrictions on the state are imposed. This Hermitian dynamics is demonstrated for the case of an exactly solvable PT-symmetric ladder system.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗