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,351 records · Page 75

3D reconstruction of the magnetic vector potential using model based iterative reconstruction

Lorentz transmission electron microscopy (TEM) observations of magnetic nanoparticles contain information on the magnetic and electrostatic potentials. Vector field electron tomography (VFET) can be used to reconstruct electromagnetic potentials of the nanoparticles from their corresponding LTEM images. The VFET approach is based on the conventional filtered back projection approach to tomographic reconstructions and the availability of an incomplete set of measurements due to experimental limitations means that the reconstructed vector fields exhibit significant artifacts. In this paper, we outline a model-based iterative reconstruction (MBIR) algorithm to reconstruct the magnetic vector potential of magnetic nanoparticles. We combine a forward model for image formation in TEM experiments with a prior model to formulate the tomographic problem as a maximum a-posteriori probability estimation problem (MAP). The MAP cost function is minimized iteratively to determine the vector potential. Here, a comparative reconstruction study of simulated as well as experimental data sets show that the MBIR approach yields quantifiably better reconstructions than the VFET approach.

36 MATERIALS SCIENCE↗

INFORMATION ON THE MILKY WAY FROM THE TWO MICRON ALL SKY SURVEY WHOLE SKY STAR COUNT: THE STRUCTURE PARAMETERS

The K{sub s} -band differential star count of the Two Micron All Sky Survey (2MASS) is used to derive the global structure parameters of the smooth components of the Milky Way. To avoid complication introduced by other fine structures and significant extinction near and at the Galactic plane, we only consider Galactic latitude |b| > 30{sup 0} data. The star count data are fitted with a three-component model: double exponential thin disk and thick disk, and a power-law decay oblate halo. Using maximum likelihood, the best-fit local density of the thin disk is n{sub 0} = 0.030 {+-} 0.002 stars pc{sup -3}. The best-fit scale height and length of the thin disk are H{sub z1} = 360 {+-} 10 pc and H{sub r1} = 3.7 {+-} 1.0 kpc, and those of the thick disk are H{sub z2} = 1020 {+-} 30 pc and H{sub r2} = 5.0 {+-} 1.0 kpc, the local thick-to-thin disk density ratio is f{sub 2} = 7% {+-} 1%. The best-fit axis ratio, power-law index, and local density ratio of the oblate halo are {kappa} = 0.55 {+-} 0.15, p = 2.6 {+-} 0.6, and f{sub h} = 0.20% {+-} 0.10%, respectively. Moreover, we find some degeneracy among the key parameters (e.g., n{sub 0}, H{sub z1}, f{sub 2}, and H{sub z2}). Any pair of these parameters are anti-correlated to each other. The 2MASS data can be well fitted by several possible combinations of these parameters. This is probably the reason why there is a wide range of values for the structure parameters in literature similar to this study. Since only medium and high Galactic latitude data are analyzed, the fitting is insensitive to the scale lengths of the disks.

79 ASTRONOMY AND ASTROPHYSICS↗

Agent-based Disease Surveillance and Transmission Model

The SARS-CoV-2 pandemic has driven a need for models that can predict transmission among populations and test the effectiveness of proposed interventions to control it such as testing, quarantining, vaccinations, and nonpharmaceutical interventions. Some questions of interest include:1. How rapidly will the virus spread if no action is taken? 2. How frequently should people be tested and quarantined if necessary? 3. Should unvaccinated persons be tested more frequently than the vaccinated? 4. If test results are delayed, how will that affect the spread? 5. How do test false negative rates affect the overall efficacy of testing programs? 6. How do constraints on testing resources impact the overall efficacy of testing programs? 7. How does the patient’s failure to recognize COVID symptoms and quarantine affect the spread? 8. What level of vaccination coverage is needed to suppress the epidemic? 9. What is the risk of a large outbreak (probability exceeding x infections)? 10. What is the cost effectiveness of interventions (dollars per avoided infection)? This report describes the structure of a discrete event simulation model that provides actionable information to address these questions. Parameter inputs and results of analyses have been reported in briefings provided to LLNL management and are not discussed here.

59 BASIC BIOLOGICAL SCIENCES↗

Extension of Liouville Formalism to Postinstability Dynamics

A mathematical formalism has been developed for predicting the postinstability motions of a dynamic system governed by a system of nonlinear equations and subject to initial conditions. Previously, there was no general method for prediction and mathematical modeling of postinstability behaviors (e.g., chaos and turbulence) in such a system. The formalism of nonlinear dynamics does not afford means to discriminate between stable and unstable motions: an additional stability analysis is necessary for such discrimination. However, an additional stability analysis does not suggest any modifications of a mathematical model that would enable the model to describe postinstability motions efficiently. The most important type of instability that necessitates a postinstability description is associated with positive Lyapunov exponents. Such an instability leads to exponential growth of small errors in initial conditions or, equivalently, exponential divergence of neighboring trajectories. The development of the present formalism was undertaken in an effort to remove positive Lyapunov exponents. The means chosen to accomplish this is coupling of the governing dynamical equations with the corresponding Liouville equation that describes the evolution of the flow of error probability. The underlying idea is to suppress the divergences of different trajectories that correspond to different initial conditions, without affecting a target trajectory, which is one that starts with prescribed initial conditions.

Zak, Michail↗

Quantifying Uncertainty in Epidemiological Models

Modern epidemiology has made use of a number of mathematical models, including ordinary differential equation (ODE) based models and agent based models (ABMs) to describe the dynamics of how a disease may spread within a population and enable the rational design of strategies for intervention that effectively contain the spread of the disease. Although such predictions are of fundamental importance in preventing the next global pandemic, there is a significant gap in trusting the outcomes/predictions solely based on such models. Hence, there is a need to develop approaches such that mathematical models can be calibrated against historical data. In addition, there is a need to develop rigorous uncertainty quantification approaches that can provide insights into when a model will fail and characterize the confidence in the (possibly multiple) model outcomes/predictions, when such retrospective analysis cannot be performed. In this paper, we outline an approach to develop uncertainty quantification approaches for epidemiological models using formal methods and model checking. By specifying the outcomes expected from a model in a suitable spatio-temporal logic, we use probabilistic model checking methods to quantify the probability with which the epidemiological model satisfies the specification. We argue that statistical model checking methods can solve the uncertainty quantification problem for complex epidemiological models.

model checking↗

Fast Fourier Transform for multivariate aggregate claims

The Fast Fourier Transform provides an alternative approximate method to evaluate the distribution of aggregate losses in insurance and finance. The efficiency of this method has already been proved for univariate and bivariate insurance models; therefore, in this paper, we extend it to a multivariate setting by considering its application to a particular model that includes losses of different types and dependency between them. Since the Fourier transform method works with truncated claims distributions, it can generate aliasing errors by wrapping around the probability mass that lies at the truncation point below this point. To eliminate this problem, we also discuss a suitable change of measure called exponential tilting that forces the tail of the distribution to decrease at exponential rate. Other possible errors are also discussed. We also illustrate the method on several numerical examples.

97 MATHEMATICS AND COMPUTING↗

A new multi-scale structure finding algorithm to identify cosmological structure

We introduce a new structure finding algorithm that self-consistently parses large scale cosmological structure into clusters, filaments and voids. This structure finding algorithm probes the structure at multiple scales and classifies the appropriate regions with the most probable structure type and size. We show that it can identify the baryon fraction of intercluster medium and cosmological voids.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Assessing the Quality of Bioforensic Signatures

We present a mathematical framework for assessing the quality of signature systems in terms of fidelity, cost, risk, and utility—a method we refer to as Signature Quality Metrics (SQM). We demonstrate the SQM approach by assessing the quality of a signature system designed to predict the culture medium used to grow a microorganism. The system consists of four chemical assays designed to identify various ingredients that could be used to produce the culture medium. The analytical measurements resulting from any combination of these four assays can be used in a Bayesian network to predict the probabilities that the microorganism was grown using one of eleven culture media. We evaluated fifteen combinations of the signature system by removing one or more of the assays from the Bayes network. We demonstrated that SQM can be used to distinguish between the various combinations in terms of attributes of interest. The approach assisted in clearly identifying assays that were least informative, largely in part because they only could discriminate between very few culture media, and in particular, culture media that are rarely used. There are limitations associated with the data that were used to train and test the signature system. Consequently, our intent is not to draw formal conclusions regarding this particular bioforensic system, but rather to illustrate an analytical approach that could be useful in comparing one signature system to another.

Bayesian networks↗

Foundations of Feature Selection and Classification for Non-Gaussian Distributed Targets

This report describes the author’s research toward creating algorithms for selecting useful statistical features in pattern/target classification problems in which the features are non-Gaussian distributed. In engineering practice, it is common to either (1) Not perform any feature selection procedure, or (2) Use a feature selection algorithm that assumes the features are Gaussian distributed. This process can be far from optimal if the data are actually non-Gaussian, as they frequently are in practice. This research has the goal of mitigating that problem by creating a useful algorithm that can be used in practice. The approach is to focus on the performance indices used in common feature selection algorithms, such as Branch and Bound algorithms and the Sequential Forward Selection Algorithm. Ordinarily, the performance index used to measure the class separation in feature space involves assuming the data are Gaussian and deriving tractable performance indices that use closed form equations that represent the probability density functions of the class data. The advantage of this approach is that it produces feature selection algorithms that have low computational complexity and do not require knowledge of the actual data densities. The disadvantage is that these algorithms may not perform reasonably when the data are non-Gaussian, as they commonly are in practice. This research examines the use of information-theoretic class separability measures that can deal with the non-Gaussian case. In particular, this work shows that the Hellinger Distance (a divergence measure), has very desirable mathematical properties and can be useful for feature selection. The work in this paper employs a multivariate kernel density estimator along with the Hellinger Distance and an optimal subset selection algorithm to do feature selection. This report (1) Defines the classification and feature selection problems, (2) Describes the continuous variable Hellinger distance in one dimension and discusses its mathematical properties in comparison with other distance measures, (3) Develops the discrete variable Hellinger distance expression for one and two dimensions, and shows that the discrete Hellinger distance for multiple dimensions is a straightforward extension, and (4) Presents experimental density estimation results using a new MATLAB implementation of a multivariate kernel density estimator. The draft of this report served as a starting point for Ensign Matthew Wilder’s MSEE thesis work at the Naval Postgraduate School (NPS) in 2010 and 2011. Ensign Wilder completed his thesis and graduated from NPS in June 2011 (M. J. Wilder, “Automatic Target Recognition: Statistical Feature Selection of Non-Gaussian Distributed Target Classes,” MSEE Thesis, Naval Postgraduate School, Thesis Advisor: Grace A. Clark, Second Reader: Monique P. Fargues, June 2011). In the thesis, Ensign Wilder created implementations of the Branch and Bound and Sequential Feature Selection algorithms, extended the multivariate kernel density estimator code, and evaluated the performance of Hellinger Distance-based feature selection algorithms using both simulated data and data from a real-world benchmark data set. The new algorithm was shown to be very effective for both Gaussian and non-Gaussian data sets. The advantages gained for non-Gaussian data come at the cost of increased computational complexity. Using a laptop computer for practical problems, we generally use initial feature vectors containing no more than about ten or twelve features. Proposed future research lies in creating faster kernel density estimator algorithms that would allow for the use of higher dimensional data.

42 ENGINEERING↗

State Space Truncation with Quantified Errors for Accurate Solutions to Discrete Chemical Master Equation

The discrete chemical master equation (dCME) provides a general framework for studying stochasticity in mesoscopic reaction networks. Since its direct solution rapidly becomes intractable due to the increasing size of the state space, truncation of the state space is necessary for solving most dCMEs. It is therefore important to assess the consequences of state space truncations so errors can be quantified and minimized. Here we describe a novel method for state space truncation. By partitioning a reaction network into multiple molecular equivalence groups (MEGs), we truncate the state space by limiting the total molecular copy numbers in each MEG. We further describe a theoretical framework for analysis of the truncation error in the steady-state probability landscape using reflecting boundaries. By aggregating the state space based on the usage of a MEG and constructing an aggregated Markov process, we show that the truncation error of a MEG can be asymptotically bounded by the probability of states on the reflecting boundary of the MEG. Furthermore, truncating states of an arbitrary MEG will not undermine the estimated error of truncating any other MEGs. We then provide an overall error estimate for networks with multiple MEGs. To rapidly determine the appropriate size of an arbitrary MEG, we also introduce an a priori method to estimate the upper bound of its truncation error. This a priori estimate can be rapidly computed from reaction rates of the network, without the need of costly trial solutions of the dCME. As examples, we show results of applying our methods to the four stochastic networks of (1) the birth and death model, (2) the single gene expression model, (3) the genetic toggle switch model, and (4) the phage lambda bistable epigenetic switch model. We demonstrate how truncation errors and steady-state probability landscapes can be computed using different sizes of the MEG(s) and how the results validate our theories. Overall, the novel state space truncation and error analysis methods developed here can be used to ensure accurate direct solutions to the dCME for a large number of stochastic networks.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Microstructural characterization of random packings of cubic particles

Understanding the properties of random packings of solid objects is of critical importance to a wide variety of fundamental scientific and practical problems. The great majority of the previous works focused, however, on packings of spherical and sphere-like particles. We report the first detailed simulation and characterization of packings of non-overlapping cubic particles. Such packings arise in a variety of problems, ranging from biological materials, to colloids and fabrication of porous scaffolds using salt powders. In addition, packing of cubic salt crystals arise in various problems involving preservation of pavements, paintings, and historical monuments, mineral-fluid interactions, CO 2 sequestration in rock, and intrusion of groundwater aquifers by saline water. Not much is known, however, about the structure and statistical descriptors of such packings. We have developed a version of the random sequential addition algorithm to generate such packings, and have computed a variety of microstructural descriptors, including the radial distribution function, two-point probability function, orientational correlation function, specific surface, and mean chord length, and have studied the effect of finite system size and porosity on such characteristics. Here, the results indicate the existence of both spatial and orientational long-range order in the packing, which is more distinctive for higher packing densities.

36 MATERIALS SCIENCE↗

Stochastic Trust-Region Algorithm in Random Subspaces with Convergence and Expected Complexity Analyses

Here, this work proposes a framework for large-scale stochastic derivative-free optimization (DFO) by introducing STARS, a trust-region method based on iterative minimization in random subspaces. This framework is both an algorithmic and theoretical extension of a random subspace derivative-free optimization (RSDFO) framework, and an algorithm for stochastic optimization with random models (STORM). Moreover, like RSDFO, STARS achieves scalability by minimizing interpolation models that approximate the objective in low-dimensional affine subspaces, thus significantly reducing per-iteration costs in terms of function evaluations and yielding strong performance on largescale stochastic DFO problems. The user-determined dimension of these subspaces, when the latter are defined, for example, by the columns of so-called Johnson-Lindenstrauss transforms, turns out to be independent of the dimension of the problem. For convergence purposes, inspired by the analyses of RSDFO and STORM, both a particular quality of the subspace and the accuracies of random function estimates and models are required to hold with sufficiently high, but fixed, probabilities. Using martingale theory under the latter assumptions, an almost sure global convergence of STARS to a first-order stationary point is shown, and the expected number of iterations required to reach a desired first-order accuracy is proved to be similar to that of STORM and other stochastic DFO algorithms, up to constants.

97 MATHEMATICS AND COMPUTING↗

idpflex: Analysis of Intrinsically Disordered Proteins by Comparing Simulations to Small Angle Scattering Experiments

It is estimated that about 30% of the eucariotic proteome consists of intrinsically dis-ordered proteins (IDP’s), yet their presence in public structural databases is severely underrepresented. IDP’s adopt heterogeneous inter-converting conformations with similar probabilities, preventing resolution of structures with X-Ray diffraction techniques. An alternative technique with wide application on IDP systems is small angle scattering(SAS). SAS can measure average structural features of IDP’s when in vitro solution, or even at conditions mimicking protein concentrations found in the cell’s cytoplasm.

97 MATHEMATICS AND COMPUTING↗

String-Like Transport in Superionic Conductors

Superionic or fast-ion conductors are multicomponent solid-state systems in which one sublattice becomes mobile and exhibits extraordinarily high ionic conductivity before the melting within the solid state. Uranium dioxide (UO{sub 2}) - the fuel material of choice in most nuclear reactors - shows superionic behavior, although the mechanism of fast ion transport of the mobile oxygen ions, and its implication, is not well-understood. UO{sub 2} belongs to the category of Type II superionics wherein the conductivity rises gradually with increasing temperature, without an attendant phase change. In a recent work, using atomistic simulations and available neutron and x-ray scattering data, we have shown that all Type II superionic conductors exhibit a well-defined onset of dynamic disorder at a characteristic temperature T{sub α} = (∼2000 K for UO{sub 2}). Unlike the familiar superionic or Bredig transition temperature T{sub α} (∼2650 K for UO{sub 2}) that is associated with a second-order thermodynamic phase transition, T{sub α} represents an order-disorder (O-D) transition that marks a structural and kinetic crossover from a crystalline state to a semi-ordered state. In the temperature range between T{sub α} and T{sub λ}, the oxygen ions in UO{sub 2} exhibit jammed dynamics even though the mobile oxygen ions favor collective hopping from one native crystalline site to another. This cooperative dynamics manifests as dynamical heterogeneity (DH) - the tendency of highly mobile oxygen ions to form dynamic clusters, and dynamical facilitation (DF) - the mode of system relaxation facilitated solely through the kinetic ions transferring their mobility to neighboring ions. The jammed dynamics portrayed by the oxygen ions is similar to that observed in supercooled liquids and glassy materials, and other disordered systems such as granular media and polymers. In the current work, we probe the ionic dynamics in UO{sub 2} for the presence of another ubiquitous signature of glassy and jammed systems, namely, the one-dimensional string-like motion of the mobile species. Unlike the uncorrelated vacancy exchanges and interstitial migration in defected crystalline states, the string motion is a collective mechanism among the mobile species wherein each member of the string induces the next member to move in a correlated, sequential fashion. Using atomistic simulations, we demonstrate that oxygen ions in UO{sub 2} are transported through a string-like mechanism in the temperature range between T{sub α} and T{sub λ}, and the probability distribution of occurrence of the strings varies exponentially with string length. The discovery of string-like motion of the oxygen ions is somewhat surprising given the crystalline underpinning of the mobile species and the dynamic tendency of the oxygen ions to hop between lattice sites. In addition to dynamical heterogeneity and dynamical facilitation, our work has added one more entry, namely the occurrence of string-like transport, to the list of phenomenological similarities between superionic conductors and jammed systems. Using atomistic simulations, we have established the occurrence of string-like ionic motion among the oxygen ions in UO{sub 2} between temperatures T{sub α} - the order-disorder (O-D) transition temperature, and T{sub λ} - the Bredig transition temperature. As observed in other jammed systems, the length of the strings is observed to have an exponential distribution implying that the probability of occurrence of a smaller string is much higher than that of a longer string. Interestingly, using Temperature-Accelerated Dynamics (TAD) we have also established that string-like hopping takes place at temperatures lower than T{sub α}; these results will be published elsewhere. (authors)

11 NUCLEAR FUEL CYCLE AND FUEL MATERIALS↗

Bayesian reduced-order deep learning surrogate model for dynamic systems described by partial differential equations

We propose a reduced-order deep-learning surrogate model for dynamic systems described by time-dependent partial differential equations. This method employs space–time Karhunen–Loève expansions (KLEs) of the state variables and space-dependent KLEs of space-varying parameters to identify the reduced (latent) dimensions. Subsequently, a deep neural network (DNN) is used to map the parameter latent space to the state variable latent space. An approximate Bayesian method is developed for uncertainty quantification (UQ) in the proposed KL-DNN surrogate model. The KL-DNN method is tested for the linear advection–diffusion and nonlinear diffusion equations, and the Bayesian approach for UQ is compared with the deep ensembling (DE) approach, commonly used for quantifying uncertainty in DNN models. It was found that the approximate Bayesian method provides a more informative distribution of the PDE solutions in terms of the coverage of the reference PDE solutions (the percentage of nodes where the reference solution is within the confidence interval predicted by the UQ methods) and log predictive probability. The DE method is found to underestimate uncertainty and introduce bias. For the nonlinear diffusion equation, we compare the KL-DNN method with the Fourier Neural Operator (FNO) method and find that KL-DNN is 10% more accurate and needs less training time than the FNO method.

97 MATHEMATICS AND COMPUTING↗

Probabilistic evolution of stochastic dynamical systems: A meso-scale perspective

Stochastic dynamical systems arise naturally across nearly all areas of science and engineering. Typically, a dynamical system model is based on some prior knowledge about the underlying dynamics of interest in which probabilistic features are used to quantify and propagate uncertainties associated with the initial conditions, external excitations, etc. From a probabilistic modeling standing point, two broad classes of methods exist, i.e. macro-scale methods and micro-scale methods. Classically, macro-scale methods such as statistical moments-based strategies are usually too coarse to capture the multi-mode shape or tails of a non-Gaussian distribution. Micro-scale methods such as random samples-based approaches, on the other hand, become computationally very challenging in dealing with high-dimensional stochastic systems. In view of these potential limitations, a meso-scale scheme is proposed here that utilizes a meso-scale statistical structure to describe the dynamical evolution from a probabilistic perspective. The significance of this statistical structure is twofold. First, it can be tailored to any arbitrary random space. Second, it not only maintains the probability evolution around sample trajectories but also requires fewer meso-scale components than the micro-scale samples. To demonstrate the efficacy of the proposed meso-scale scheme, a set of examples of increasing complexity are provided. Connections to the benchmark stochastic models as conservative and Markov models along with practical implementation guidelines are presented.

97 MATHEMATICS AND COMPUTING↗

Magnetic-Field-Driven Electron Dynamics in Graphene

Graphene exhibits unique optoelectronic properties originating from the band structure at the Dirac points. It is an ideal model structure to study the electronic and optical properties under the influence of the applied magnetic field. In graphene, electric field, laser pulse, and voltage can create electron dynamics which is influenced by momentum dispersion. However, computational modeling of momentum-influenced electron dynamics under the applied magnetic field remains challenging. In this work, we perform computational modeling of the photoexcited electron dynamics achieved in graphene under an applied magnetic field. Our results show that magnetic field leads to local deviation from momentum conservation for charge carriers. With the increasing magnetic field, the delocalization of electron probability distribution increases and forms a cyclotron-like trajectory. Our work facilitates understanding of momentum resolved magnetic field effect on non-equilibrium properties of graphene, which is critical for optoelectronic and photovoltaic applications.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗