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,441 records · Page 80

Performance and Reliability of Solid Tantalum Capacitors at Cryogenic Conditions

Performance of different types of solid tantalum capacitors was evaluated at room and low temperatures, down to 15 K. The effect of temperature on frequency dependencies of capacitance, effective series resistances (ESR), leakage currents, and breakdown voltages has been investigated and analyzed. To assess thermo-mechanical robustness of the parts, several groups of loose capacitors and those soldered on FR4 boards were subjected to multiple (up to 500) temperature cycles between room temperature and 77 K. Experiments and mathematical modeling have shown that degradation in tantalum capacitors at low temperatures is mostly due to increasing resistance of the manganese cathode layer, resulting in substantial decrease of the roll-off frequency. Absorption currents follow a power law, I approximately t(sup -m), with the exponent m varying from 0.8 to 1.1. These currents do not change significantly at cryogenic conditions and the value of the exponent remains the same down to 15 K. Variations of leakage currents with voltage can be described by Pool-Frenkel and Schottky mechanisms of conductivity, with the Schottky mechanism prevailing at cryogenic conditions. Breakdown voltages of tantalum capacitors increase and the probability of scintillations decreases at cryogenic temperatures. However, breakdown voltages measured during surge current testing decrease at liquid nitrogen (LN) compared to room-temperature conditions. Results of temperature cycling suggest that tantalum capacitors are capable of withstanding multiple exposures to cryogenic conditions, but the probability of failures varies for different part types.

Teverovsky, Alexander↗

Metropolis–Hastings Monte Carlo Method for Neutron Emissivity Tomographic Inversion in Tokamak Plasma

The article presents a new approach to plasma neutron emissivity reconstruction based on the Metropolis–Hastings Monte Carlo algorithm. The algorithm is based on a biased random walk. A dedicated computer code generates pseudo-random samples within the domain that contains the solution. The properly chosen objective function ensures convergence to the desired solution. The method allows to overcome the problem of trapping in local minima by accepting, with some finite probability, changes in the direction opposite to that indicated by the objective function. The developed method was tested using a synthetic data set. The results show that the method provides reliable reconstructions and thus can be used as an alternative or complementary method to the commonly applied ones. The method capabilities were also tested against noise present in the line-integrated projections.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Clustering and Cliques in Preferential Attachment Random Graphs with Edge Insertion

In this paper, we investigate the global clustering coefficient (a.k.a transitivity) and clique number of graphs generated by a preferential attachment random graph model with an additional feature of allowing edge connections between existing vertices. Specifically, at each time step t, either a new vertex is added with probability f(t), or an edge is added between two existing vertices with probability 1 – f(t). We establish concentration inequalities for the global clustering and clique number of the resulting graphs under the assumption that f(t) is a regularly varying function at infinity with index of regular variation –$\gamma$, where $\gamma$ $\in$ [0, 1). Finally, we also demonstrate an inverse relation between these two statistics: the clique number is essentially the reciprocal of the global clustering coefficient.

97 MATHEMATICS AND COMPUTING↗

An energy-dependent numerical model for the condensation probability, γ j

The “condensation” probability, γ j , is an important variable in the preequilibrium stage of nuclear spallation reactions. It represents the probability that p j excited nucleons (excitons) will “condense” to form complex particle type j in the excited residual nucleus. In addition, it has a significant impact on the emission width, or probability of emitting fragment type j from the residual nucleus. Previous formulations for γ j were energy-independent and valid for fragments up to 4 He only. This paper explores the formulation of a new model for γ j , one which is energy-dependent and valid for up to 28 Mg, and which provides improved fits compared to experimental fragment spectra.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Growth of Hexagonal Boron Nitride from Molten Nickel Solutions: A Reactive Molecular Dynamics Study

Metal flux methods are excellent for synthesizing high-quality hexagonal boron nitride (hBN) crystals, but the atomic mechanisms of hBN nucleation and growth in these systems are poorly understood and difficult to probe experimentally. Here, we harness classical reactive molecular dynamics (ReaxFF) to unravel the mechanisms of hBN synthesis from liquid nickel solvent over time scales up to 30 ns. These simulations mimic experimental conditions by including relatively large liquid nickel slabs containing dissolved boron and a molecular nitrogen gas phase. Overall, the reaction takes place almost exclusively on the surface of the liquid nickel, owing to the low solubility of nitrogen in bulk nickel and the intermediate species’ preference for the metal–gas interface. The formation of hBN invariably begins by reaction of dinitrogen with nickel-solvated boron atoms at the surface, forming intermediate N–N–B species, which typically evolve into B–N–B units through a short-lived intermediate where a single nitrogen atom is coordinated by one nitrogen and two boron atoms. The resulting B–N–B units, in turn, coalesce with growing hBN nuclei and carry nitrogen between hBN nanocrystals in an Ostwald ripening process. The amount of hBN produced on the tens of nanosecond time scale depends critically on the boron concentration, while having a much weaker dependence on the N 2 pressure for the regime considered (N 2 pressures of 2.5–10 MPa, Ni–B solutions with 6–12% boron by atom fraction). The highest rate of hBN formation occurs at the lowest temperature considered (1750 K, just above the melting point of nickel), while no hBN sheets are formed at 2000 K or above. An analysis of the transition pathways for nitrogen atoms shows that the final step, incorporation of small B–N motifs into larger hBN sheets, is the rate-limiting step in the regimes considered. While raising the temperature from 1750 to 2000 K has little effect on the formation of intermediates (N–N–B, B–N–B, etc.), the lack of large hBN sheets at temperatures >1900 K is explained by decreased probability of the final step and increased probability of breakup of hBN into B–N motifs.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

A quantum mechanical model for the relationship between stock price and stock ownership

The trade of a fixed stock can be regarded as the basic process that measures its momentary price. The stock price is exactly known only at the time of sale when the stock is between traders, that is, only in the case when the owner is unknown. We show that the stock price can be better described by a function indicating at any moment of time the probabilities for the possible values of price if a transaction takes place. This more general description contains partial information on the stock price, but it also contains partial information on the stock owner. By following the analogy with quantum mechanics, we assume that the time evolution of the function describing the stock price can be described by a Schroedinger type equation.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Faster Johnson–Lindenstrauss transforms via Kronecker products

The Kronecker product is an important matrix operation with a wide range of applications in signal processing, graph theory, quantum computing and deep learning. In this work, we introduce a generalization of the fast Johnson–Lindenstrauss projection for embedding vectors with Kronecker product structure, the Kronecker fast Johnson–Lindenstrauss transform (KFJLT). The KFJLT reduces the embedding cost by an exponential factor of the standard fast Johnson–Lindenstrauss transform’s cost when applied to vectors with Kronecker structure, by avoiding explicitly forming the full Kronecker products. Here, we prove that this computational gain comes with only a small price in embedding power: consider a finite set of $p$ points in a tensor product of $d$ constituent Euclidean spaces $\bigotimes _{k=d}^{1}{\mathbb{R}}^{n_k}$, and let $N = \prod _{k=1}^{d}n_k$. With high probability, a random KFJLT matrix of dimension $m \times N$ embeds the set of points up to multiplicative distortion $(1\pm \varepsilon )$ provided $m \gtrsim \varepsilon ^{-2} \, \log ^{2d - 1} (p) \, \log N$. We conclude by describing a direct application of the KFJLT to the efficient solution of large-scale Kronecker-structured least squares problems for fitting the CP tensor decomposition.

Kronecker structure↗

Oscillation dynamics of active-unsterile neutrino mixing in a 2+1-tilde mixing scheme

We consider the possibility that sterile neutrinos exist and admit a description as unparticles; we call these unsterile neutrinos. We then examine the nature of neutrino oscillations in a model where an unsterile can mix with two active flavors with a very simple mass matrix of the seesaw type. Despite these simplifications, we find a number of remarkable features, all of which will occur generically when more realistic cases are considered. These include momentum dependent mixing angles, invisible decay widths for the unsterile-like mode, as well as the inheritance of a nonvanishing spectral density for the massive activelike modes. We also obtain the disappearance and appearance probabilities for the activelike neutrinos and find remarkable interference effects between the active and unsterile neutrinos as a consequence of threshold effects, yielding new oscillatory contributions with different oscillation lengths. These effects are only measurable on short baseline experiments because there both probabilities are suppressed as compared to mixing with a canonical sterile neutrino, thereby providing a diagnostics tool to discriminate unsterile from canonical sterile neutrinos. We conclude with a discussion of whether these new phenomena could aid in the reconciliation of the LSND and MiniBooNE results.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Diffusion Processes Satisfying a Conservation Law Constraint

We investigate coupled stochastic differential equations governing N non-negative continuous random variables that satisfy a conservation principle. In various fields a conservation law requires that a set of fluctuating variables be non-negative and (if appropriately normalized) sum to one. As a result, any stochastic differential equation model to be realizable must not produce events outside of the allowed sample space. We develop a set of constraints on the drift and diffusion terms of such stochastic models to ensure that both the non-negativity and the unit-sum conservation law constraint are satisfied as the variables evolve in time. We investigate the consequences of the developed constraints on the Fokker-Planck equation, the associated system of stochastic differential equations, and the evolution equations of the first four moments of the probability density function. We show that random variables, satisfying a conservation law constraint, represented by stochastic diffusion processes, must have diffusion terms that are coupled and nonlinear. The set of constraints developed enables the development of statistical representations of fluctuating variables satisfying a conservation law. We exemplify the results with the bivariate beta process and the multivariate Wright-Fisher, Dirichlet, and Lochner’s generalized Dirichlet processes.

97 MATHEMATICS AND COMPUTING↗

Integration of Soft Data Into Geostatistical Simulation of Categorical Variables

Uncertain or indirect “soft” data, such as geologic interpretation, driller’s logs, geophysical logs or imaging, offer potential constraints or “soft conditioning” to stochastic models of discrete categorical subsurface variables in hydrogeology such as hydrofacies. Previous bivariate geostatistical simulation algorithms have not fully addressed the impact of data uncertainty in formulation of the (co) kriging equations and the objective function in simulated annealing (or quenching). This paper introduces the geostatistical simulation code tsim-s, which accounts for categorical data uncertainty through a data “hardness” parameter. In generating geostatistical realizations with tsim-s, the uncertainty inherent to soft conditioning is factored into both 1) the data declustering and spatial correlation functions in cokriging and 2) the acceptance probability for change of category in simulated quenching. The degree or sensitivity to which soft data conditions a realization as a function of hardness can be quantified by mapping category probabilities derived from multiple realizations. In addition to point or borehole data, arrays of data (e.g., as derived from a depth-dependency function, probability map, or “prior realization”) can be used as soft conditioning. The tsim-s algorithm provides a theoretically sound and general framework for integrating datasets of variable location, resolution, and uncertainty into geostatistical simulation of categorical variables. A practical example shows how tsim-s is capable of generating a large-scale three-dimensional simulation including curvilinear features.

54 ENVIRONMENTAL SCIENCES↗

System and method for automated object detection in an image

A contour/shape detection model may use relatively simple and efficient kernels to detect target edges in an object within an image or video. A co-occurrence probability may be calculated for two or more edge features in an image or video using an object definition. Edge features may be differentiated between in response to measured contextual support, and prominent edge features may be extracted based on the measured contextual support. The object may then be identified based on the extracted prominent edge features.

97 MATHEMATICS AND COMPUTING↗

Convergence of Probability Densities Using Approximate Models for Forward and Inverse Problems in Uncertainty Quantification

Here, we analyze the convergence of probability density functions utilizing approximate models for both forward and inverse problems. We consider the standard forward uncertainty quantification problem where an assumed probability density on parameters is propagated through the approximate model to produce a probability density, often called a push-forward probability density, on a set of quantities of interest (QoI). The inverse problem considered in this paper seeks to update an initial probability density assumed on model input parameters such that the subsequent push-forward of this updated density through the parameter-to-QoI map matches a given probability density on the QoI. We prove that the densities obtained from solving the forward and inverse problems, using approximate models, converge to the true densities as the approximate models converge to the true models. Numerical results are presented to demonstrate convergence rates of densities for sparse grid approximations of parameter-to-QoI maps and standard spatial and temporal discretizations of PDEs and ODEs.

97 MATHEMATICS AND COMPUTING↗

Algorithms Performance Investigation of a Generalized Spreader-Bar Detection System

A “generic” gantry-crane-mounted spreader bar detector has been simulated in the Monte-Carlo radiation transport code MCNP [1]. This model is intended to represent the largest realistically feasible number of detector crystals in a single gantry-crane model intended to sit atop an InterModal Cargo Container (IMCC). Detectors were chosen from among large commonly-available sodium iodide (NaI) crystal scintillators and spaced as evenly as is thought possible with a detector apparatus attached to a gantry crane. Several scenarios were simulated with this model, based on a single IMCC being moved between a ship’s deck or cargo hold and the dock. During measurement, the gantry crane will carry that IMCC through the air and lower it onto a receiving vehicle (e.g. a chassis or a bomb cart). The case of an IMCC being moved through the air from an unknown radiological environment to the ground is somewhat complex; for this initial study a single location was picked at which to simulate background. An HEU source based on earlier validated models was used, and placed at varying depths in a wood cargo. Many statistical realizations of these scenarios are constructed from simulations of the component spectra, simulated to have high statistics. The resultant data are analyzed with several different algorithms. The simulated data were evaluated by each algorithm, with a threshold set to a statistical-only false alarm probability of 0.001 and the resultant Minimum Detectable Amounts were generated for each Cargo depth possible within the IMCC. Using GADRAS as an anomaly detector provided the greatest detection sensitivity, and it is expected that an algorithm similar to this will be of great use to the detection of highly shielded sources.

97 MATHEMATICS AND COMPUTING↗

Shooter Alarm System Final Report FY23

Lawrence Livermore National Laboratory (LLNL) is developing a multiphysics sensor package for automatic live arms fire detection for use in schools, houses of worship, hospi tals, etc. The goal is to have a package the size of a common smoke or CO2 detector with a price point of $50 or less which may be deployed throughout the aforementioned facilities. The commercial device will detect live gun fire with low probability of false alarm and auto matically alert first responders. A prototype board with four accelerometers, two infrared (IR) and two microphones has been developed and deployed at two experiments at LLNL’s Small Firearms Training Facility (SFTF). The device successfully and consistently measured signals on the accelerometer and acoustic channels. IR responses were measured depending upon the environment and sound source.

42 ENGINEERING↗

Management of SSME hardware life utilization

Statistical and probabilistic reliability methodologies were developed for the determination of hardware life limits for the Space Shuttle Main Engine (SSME). Both methodologies require that a mathematical reliability model of the engine (system) performance be developed as a function of the reliabilities of the components and parts. The system reliability model should be developed from the Failute Modes and Effects Analysis/Critical Items List. The statistical reliability methodology establishes hardware life limits directly from the failure distributions of the components and parts obtained from statistically-designed testing. The probabilistic reliability methodology establishes hardware life limits from a decision analysis methodology which incorporates the component/part reliabilities obtained from a probabilistic structural analysis, a calibrated maintenance program, inspection techniques, and fabrication procedures. Probilistic structural analysis is recommended as a tool to prioritize upgrading of the components and parts. The Weibull probability distribution is presently being investigated by NASA/MSFC to characterize the failure distribution of the SSME hardware from a limited data base of failures.

Pauschke, J. M.↗

SWIFT OBSERVATIONS OF THE 2006 OUTBURST OF THE RECURRENT NOVA RS OPHIUCHI. III. X-RAY SPECTRAL MODELING

Following the Swift X-ray observations of the 2006 outburst of the recurrent nova RS Ophiuchi, we developed hydrodynamical models of mass ejection from which the forward shock velocities were used to estimate the ejecta mass and velocity. In order to further constrain our model parameters, we present synthetic X-ray spectra from our hydrodynamical calculations, which we compare to the Swift data. An extensive set of simulations was carried out to find a model that best fits the spectra up to 100 days after outburst. We find a good fit at high energies but require additional absorption to match the low energy emission. We estimate the ejecta mass to be in the range (2-5) x 10{sup -7} M{sub sun} and the ejection velocity to be greater than 6000 km s{sup -1} (and probably closer to 10, 000 km s{sup -1}). We also find that estimates of shock velocity derived from gas temperatures via standard model fits to the X-ray spectra are much lower than those of the true shock velocities.

79 ASTRONOMY AND ASTROPHYSICS↗

Are Lock-Free Concurrent Algorithms Practically Wait-Free?

Lock-free concurrent algorithms guarantee that some concurrent operation will always make progress in a finite number of steps. Yet programmers prefer to treat concurrent code as if it were wait-free, guaranteeing that all operations always make progress. Unfortunately, designing wait-free algorithms is generally a very complex task, and the resulting algorithms are not always efficient. Although obtaining efficient wait-free algorithms has been a long-time goal for the theory community, most nonblocking commercial code is only lock-free. This article suggests a simple solution to this problem. We show that for a large class of lock-free algorithms, under scheduling conditions that approximate those found in commercial hardware architectures, lock-free algorithms behave as if they are wait-free. In other words, programmers can continue to design simple lock-free algorithms instead of complex wait-free ones, and in practice, they will get wait-free progress. Our main contribution is a new way of analyzing a general class of lock-free algorithms under a stochastic scheduler. Our analysis relates the individual performance of processes to the global performance of the system using Markov chain lifting between a complex per-process chain and a simpler system progress chain. We show that lock-free algorithms are not only wait-free with probability 1 but that in fact a general subset of lock-free algorithms can be closely bounded in terms of the average number of steps required until an operation completes. Here, to the best of our knowledge, this is the first attempt to analyze progress conditions, typically stated in relation to a worst-case adversary, in a stochastic model capturing their expected asymptotic behavior.

97 MATHEMATICS AND COMPUTING↗

Modern Monte Carlo methods for efficient uncertainty quantification and propagation: A survey

Uncertainty quantification (UQ) includes the characterization, integration, and propagation of uncertainties that result from stochastic variations and a lack of knowledge or data in the natural world. Monte Carlo (MC) method is a sampling-based approach that has widely used for quantification and propagation of uncertainties. However, the standard MC method is often time-consuming if the simulation-based model is computationally intensive. This article gives an overview of modern MC methods to address the existing challenges of the standard MC in the context of UQ. Specifically, multilevel Monte Carlo (MLMC) extending the concept of control variates achieves a significant reduction of the computational cost by performing most evaluations with low accuracy and corresponding low cost, and relatively few evaluations at high accuracy and corresponding high cost. Multifidelity Monte Carlo (MFMC) accelerates the convergence of standard Monte Carlo by generalizing the control variates with different models having varying fidelities and varying computational costs. Multimodel Monte Carlo method (MMMC), having a different setting of MLMC and MFMC, aims to address the issue of UQ and propagation when data for characterizing probability distributions are limited. Multimodel inference combined with importance sampling is proposed for quantifying and efficiently propagating the uncertainties resulting from small data sets. All of these three modern MC methods achieve a significant improvement of computational efficiency for probabilistic UQ, particularly uncertainty propagation. Finally, an algorithm summary and the corresponding code implementation are provided for each of the modern MC methods. The extension and application of these methods are discussed in detail.

97 MATHEMATICS AND COMPUTING↗