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,729 records · Page 96

Correlative feature analysis on FFDM

Identifying the corresponding images of a lesion in different views is an essential step in improving the diagnostic ability of both radiologists and computer-aided diagnosis (CAD) systems. Because of the nonrigidity of the breasts and the 2D projective property of mammograms, this task is not trivial. In this pilot study, we present a computerized framework that differentiates between corresponding images of the same lesion in different views and noncorresponding images, i.e., images of different lesions. A dual-stage segmentation method, which employs an initial radial gradient index (RGI) based segmentation and an active contour model, is applied to extract mass lesions from the surrounding parenchyma. Then various lesion features are automatically extracted from each of the two views of each lesion to quantify the characteristics of density, size, texture and the neighborhood of the lesion, as well as its distance to the nipple. A two-step scheme is employed to estimate the probability that the two lesion images from different mammographic views are of the same physical lesion. In the first step, a correspondence metric for each pairwise feature is estimated by a Bayesian artificial neural network (BANN). Then, these pairwise correspondence metrics are combined using another BANN to yield an overall probability of correspondence. Receiver operating characteristic (ROC) analysis was used to evaluate the performance of the individual features and the selected feature subset in the task of distinguishing corresponding pairs from noncorresponding pairs. Using a FFDM database with 123 corresponding image pairs and 82 noncorresponding pairs, the distance feature yielded an area under the ROC curve (AUC) of 0.81{+-}0.02 with leave-one-out (by physical lesion) evaluation, and the feature metric subset, which included distance, gradient texture, and ROI-based correlation, yielded an AUC of 0.87{+-}0.02. The improvement by using multiple feature metrics was statistically significant compared to single feature performance.

62 RADIOLOGY AND NUCLEAR MEDICINE↗

Multiple objective optimization in reliability demonstration test

Reliability demonstration tests are usually performed in product design or validation processes to demonstrate whether a product meets specified requirements on reliability. For binomial demonstration tests, the zero-failure test has been most commonly used due to its simplicity and use of minimum sample size to achieve an acceptable consumer’s risk level. However, this test can often result in unacceptably high risk for producers as well as a low probability of passing the test even when the product has good reliability. This paper explicitly explores the interrelationship between multiple objectives that are commonly of interest when planning a demonstration test and proposes structured decision-making procedures using a Pareto front approach for selecting an optimal test plan based on simultaneously balancing multiple criteria. Different strategies are suggested for scenarios with different user priorities and graphical tools are developed to help quantify the trade-offs between choices and to facilitate informed decision making. As a result, potential impacts of some subjective user inputs on the final decision are studied to offer insights and useful guidance for general applications.

97 MATHEMATICS AND COMPUTING↗

Implementation of Genetic Algorithms to Optimize Metal–Organic Frameworks for CO 2 Capture

Metal-organic frameworks (MOFs) are promising materials for CO 2 capture with the potential to use less energy than current industrial CO 2 capture methods. MOFs are highly versatile sorbents, and there is an almost unlimited number of MOFs that could be synthesized. In this work, we used a genetic algorithm (GA) and grand canonical Monte Carlo (GCMC) simulations to efficiently search for high-performing MOFs for CO 2 capture. We analyzed the effects of important GA parameters, including the mutation probability, the number of MOFs per generation and the number of GA generations, on the GA performance. Here, we performed GCMC simulations on-the-fly during the GA procedure to determine the performance of proposed MOFs and optimized their structures using multiple objective functions across different topologies. The GA was able to determine top-performing MOFs balancing CO 2 selectivity versus working capacity and reduced the cost of molecular simulations by a factor of 25 versus brute-force screening of an entire database of structures.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Machine learning prediction of incidence of Alzheimer’s disease using large-scale administrative health data

Nationwide population-based cohort provides a new opportunity to build an automated risk prediction model based on individuals’ history of health and healthcare beyond existing risk prediction models. We tested the possibility of machine learning models to predict future incidence of Alzheimer’s disease (AD) using large-scale administrative health data. From the Korean National Health Insurance Service database between 2002 and 2010, we obtained de-identified health data in elders above 65 years (N = 40,736) containing 4,894 unique clinical features including ICD-10 codes, medication codes, laboratory values, history of personal and family illness and socio-demographics. To define incident AD we considered two operational definitions: “definite AD” with diagnostic codes and dementia medication (n = 614) and “probable AD” with only diagnosis (n = 2026). We trained and validated random forest, support vector machine and logistic regression to predict incident AD in 1, 2, 3, and 4 subsequent years. For predicting future incidence of AD in balanced samples (bootstrapping), the machine learning models showed reasonable performance in 1-year prediction with AUC of 0.775 and 0.759, based on “definite AD” and “probable AD” outcomes, respectively; in 2-year, 0.730 and 0.693; in 3-year, 0.677 and 0.644; in 4-year, 0.725 and 0.683. The results were similar when the entire (unbalanced) samples were used. Important clinical features selected in logistic regression included hemoglobin level, age and urine protein level. This study may shed a light on the utility of the data-driven machine learning model based on large-scale administrative health data in AD risk prediction, which may enable better selection of individuals at risk for AD in clinical trials or early detection in clinical settings.

97 MATHEMATICS AND COMPUTING↗

Tracer particle transport dynamics in the diffusive sandpile cellular automaton

The confinement properties of the diffusive running sandpile are characterized by tracking the motion of a population of marked grains of sand. It is found that, as the relative strength of the avalanching to the diffusive transport channel is varied, a point is reached at which the particle global confinement time and the probability density functions of the jump-sizes and waiting-times of the tracked grains experience a sudden change, thus revealing a dynamical transition, that is consistent with previous studies (Newman DE et al., Phys Rev Lett 2002;88(20):204304). Across this transition, the sandpile moves from a regime characterized by self-similarity and memory, where avalanches of all possible sizes dominate transport across the system, to another regime where transport is taken over by near system-size, quasi-periodic avalanches. Values for the fractional transport exponents that quantify effective transport across the sandpile prior to the transition are also obtained.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Quantization in Classical Mechanics and Diffusion Mechanism of Alpha Decay, Cluster Radioactivity, Spontaneous Fission

Based on the Chetaev generalized theorem the Schredinger equation as the stability condition of trajectories in classical dynamics in the presence of dissipative forces is derived. In the framework of this approach the alternative model for unified description of alpha decay, spontaneous fission, cluster radioactivity and is developed. We show the possibility of the classical (without tunneling) description of radioactive decay of heavy nuclei, when the so called noise-induced transition or, in other words, the stochastic channel of radioactive decay conditioned by the Kramers diffusion mechanism is generated under certain conditions.Using the ENSDF nuclear data, we have found the parametrized solutions of the Kramers equation of the Langevin type by the Alexandrov dynamic auto-regularization method (REGN-Dubna program). These solutions describe with high-accuracy the dependences of half-life (the decay probability) of heavy radioactive nuclei on total kinetic energy of daughter decay products.Verification of the inverse problem solution in the framework of the universal Kramers description of alpha decay, spontaneous fission, cluster radioactivity, which based on the newest experimental data for alpha-decay of even-even superheavy nuclei (Z = 114, 116, 118), shows good coincidence of the experimental and theoretical dependences of half-life on alpha-decay energy.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Advanced Multilevel Monte Carlo Methods

This article reviews the application of some advanced Monte Carlo techniques in the context of multilevel Monte Carlo (MLMC). MLMC is a strategy employed to compute expectations, which can be biassed in some sense, for instance, by using the discretization of an associated probability law. The MLMC approach works with a hierarchy of biassed approximations, which become progressively more accurate and more expensive. Additionally, using a telescoping representation of the most accurate approximation, the method is able to reduce the computational cost for a given level of error versus i.i.d. sampling from this latter approximation. All of these ideas originated for cases where exact sampling from couples in the hierarchy is possible. This article considers the case where such exact sampling is not currently possible. We consider some Markov chain Monte Carlo and sequential Monte Carlo methods, which have been introduced in the literature, and we describe different strategies that facilitate the application of MLMC within these methods.

97 MATHEMATICS AND COMPUTING↗

Evaluation of a Class of Simple and Effective Uncertainty Methods for Sparse Samples of Random Variables and Functions

When very few samples of a random quantity are available from a source distribution of unknown shape, it is usually not possible to accurately infer the exact distribution from which the data samples come. Under-estimation of important quantities such as response variance and failure probabilities can result. For many engineering purposes, including design and risk analysis, we attempt to avoid under-estimation with a strategy to conservatively estimate (bound) these types of quantities -- without being overly conservative -- when only a few samples of a random quantity are available from model predictions or replicate experiments. This report examines a class of related sparse-data uncertainty representation and inference approaches that are relatively simple, inexpensive, and effective. Tradeoffs between the methods' conservatism, reliability, and risk versus number of data samples (cost) are quantified with multi-attribute metrics use d to assess method performance for conservative estimation of two representative quantities: central 95% of response; and 10 -4 probability of exceeding a response threshold in a tail of the distribution. Each method's performance is characterized with 10,000 random trials on a large number of diverse and challenging distributions. The best method and number of samples to use in a given circumstance depends on the uncertainty quantity to be estimated, the PDF character, and the desired reliability of bounding the true value. On the basis of this large data base and study, a strategy is proposed for selecting the method and number of samples for attaining reasonable credibility levels in bounding these types of quantities when sparse samples of random variables or functions are available from experiments or simulations.

97 MATHEMATICS AND COMPUTING↗

Microaneurysms detection with the radon cliff operator in retinal fundus images

Diabetic Retinopathy (DR) is one of the leading causes of blindness in the industrialized world. Early detection is the key in providing effective treatment. However, the current number of trained eye care specialists is inadequate to screen the increasing number of diabetic patients. In recent years, automated and semi-automated systems to detect DR with color fundus images have been developed with encouraging, but not fully satisfactory results. In this study we present the initial results of a new technique for the detection and localization of microaneurysms, an early sign of DR. The algorithm is based on three steps: candidates selection, the actual microaneurysms detection and a final probability evaluation. We introduce the new Radon Cliff operator which is our main contribution to the field. Making use of the Radon transform, the operator is able to detect single noisy Gaussian-like circular structures regardless of their size or strength. The advantages over existing microaneurysms detectors are manifold: the size of the lesions can be unknown, it automatically distinguishes lesions from the vasculature and it provides a fair approach to microaneurysm localization even without post-processing the candidates with machine learning techniques, facilitating the training phase. The algorithm is evaluated on a publicly available dataset from the Retinopathy Online Challenge.

60 APPLIED LIFE SCIENCES↗

Forward and inverse uncertainty quantification using multilevel Monte Carlo algorithms for an elliptic non-local equation

Our paper considers uncertainty quantification for an elliptic nonlocal equation. In particular, it is assumed that the parameters which define the kernel in the nonlocal operator are uncertain and a priori distributed according to a probability measure. It is shown that the induced probability measure on some quantities of interest arising from functionals of the solution to the equation with random inputs is well-defined,s as is the posterior distribution on parameters given observations. As the elliptic nonlocal equation cannot be solved approximate posteriors are constructed. The multilevel Monte Carlo (MLMC) and multilevel sequential Monte Carlo (MLSMC) sampling algorithms are used for a priori and a posteriori estimation, respectively, of quantities of interest. Furthermore, these algorithms reduce the amount of work to estimate posterior expectations, for a given level of error, relative to Monte Carlo and i.i.d. sampling from the posterior at a given level of approximation of the solution of the elliptic nonlocal equation.

97 MATHEMATICS AND COMPUTING↗

MixSim : An R Package for Simulating Data to Study Performance of Clustering Algorithms

The R package MixSim is a new tool that allows simulating mixtures of Gaussian distributions with different levels of overlap between mixture components. Pairwise overlap, defined as a sum of two misclassification probabilities, measures the degree of interaction between components and can be readily employed to control the clustering complexity of datasets simulated from mixtures. These datasets can then be used for systematic performance investigation of clustering and finite mixture modeling algorithms. Among other capabilities of MixSim, there are computing the exact overlap for Gaussian mixtures, simulating Gaussian and non-Gaussian data, simulating outliers and noise variables, calculating various measures of agreement between two partitionings, and constructing parallel distribution plots for the graphical display of finite mixture models. All features of the package are illustrated in great detail. The utility of the package is highlighted through a small comparison study of several popular clustering algorithms.

97 MATHEMATICS AND COMPUTING↗

A stochastic covariance shrinkage approach to particle rejuvenation in the ensemble transform particle filter

Rejuvenation in particle filters is necessary to prevent the collapse of the weights when the number of particles is insufficient to properly sample the high-probability regions of the state space. Rejuvenation is often implemented in a heuristic manner by the addition of random noise that widens the support of the ensemble. This work aims at improving canonical rejuvenation methodology by the introduction of additional prior information obtained from climatological samples; the dynamical particles used for importance sampling are augmented with samples obtained from stochastic covariance shrinkage. A localized variant of the proposed method is developed. Numerical experiments with the Lorenz '63 model show that modified filters significantly improve the analyses for low dynamical ensemble sizes. Furthermore, localization experiments with the Lorenz '96 model show that the proposed methodology is extendable to larger systems.

54 ENVIRONMENTAL SCIENCES↗

Structure of Nuclei Deformed at Maximum and the Mass Asymmetry in Low-Energy Fission

Single-particle spectra of neutrons and protons in {sup 236}U at scission (i.e., the maximum deformation this nucleus can sustain) are calculated as function of the mass asymmetry of the future fission fragments. Modified Cassini ovals were used to describe the nuclear shapes involved. Moving away from symmetric fission up to very asymmetric fission we observe the appearance and the disappearance of closed shells. This explains the complexity of the mass distribution and the strong preference for asymmetric divisions. For a more quantitative analyses we have calculated the pairing gap DELTA and the Fermi energy gamma in the frame of the renormalized BCS theory. A strong dependence of DELTA on the fragment mass ratio A{sub H}/A{sub L} was found with a pronounced minimum at 1.5 for both neutrons and protons. This is in agreement with the most probable mass division measured in {sup 235}U(n{sub th},f). Concerning the Fermi energies, the protons have lower values than the neutrons by more than 1 MeV. They are also stronger bound at symmetry (A{sub L} = 110-118) than at large asymmetries (A{sub L} = 70-80). To answer the important question of where the mass asymmetry is determined we have extended the calculations to successive stages between saddle and scission.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Discovery of a long-lived low-lying isomeric state in {sup 80}Ga

Collinear laser spectroscopy was performed on the {sup 80}Ga isotope at ISOLDE, CERN. A low-lying isomeric state with a half-life much greater than 200 ms was discovered. The nuclear spins and moments of the ground and isomeric states and the isomer shift are discussed. Probable spins and parities are assigned to both long-lived states (3{sup -} and 6{sup -}) deduced from a comparison of the measured moments to shell-model calculations.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Random Predictor Models for Rigorous Uncertainty Quantification: Part 1

This and a companion paper propose techniques for constructing parametric mathematical models describing key features of the distribution of an output variable given input-output data. By contrast to standard models, which yield a single output value at each value of the input, Random Predictors Models (RPMs) yield a random variable at each value of the input. Optimization-based strategies for calculating RPMs having a polynomial dependency on the input and a linear dependency on the parameters are proposed. These formulations yield RPMs having various levels of fidelity in which the mean and the variance of the model's parameters, thus of the predicted output, are prescribed. As such they encompass all RPMs conforming to these prescriptions. The RPMs are optimal in the sense that they yield the tightest predictions for which all (or, depending on the formulation, most) of the observations are less than a fixed number of standard deviations from the mean prediction. When the data satisfies mild stochastic assumptions, and the optimization problem(s) used to calculate the RPM is convex (or, when its solution coincides with the solution to an auxiliary convex problem), the model's reliability, which is the probability that a future observation would be within the predicted ranges, can be bounded tightly and rigorously.

Crespo, Luis G.↗

Use of SCALE Continuous-Energy Monte Carlo Tools for Eigenvalue Sensitivity Coefficient Calculations

The TSUNAMI code within the SCALE code system makes use of eigenvalue sensitivity coefficients for an extensive number of criticality safety applications, such as quantifying the data-induced uncertainty in the eigenvalue of critical systems, assessing the neutronic similarity between different critical systems, and guiding nuclear data adjustment studies. The need to model geometrically complex systems with improved fidelity and the desire to extend TSUNAMI analysis to advanced applications has motivated the development of a methodology for calculating sensitivity coefficients in continuous-energy (CE) Monte Carlo applications. The CLUTCH and Iterated Fission Probability (IFP) eigenvalue sensitivity methods were recently implemented in the CE KENO framework to generate the capability for TSUNAMI-3D to perform eigenvalue sensitivity calculations in continuous-energy applications. This work explores the improvements in accuracy that can be gained in eigenvalue and eigenvalue sensitivity calculations through the use of the SCALE CE KENO and CE TSUNAMI continuous-energy Monte Carlo tools as compared to multigroup tools. The CE KENO and CE TSUNAMI tools were used to analyze two difficult models of critical benchmarks, and produced eigenvalue and eigenvalue sensitivity coefficient results that showed a marked improvement in accuracy. The CLUTCH sensitivity method in particular excelled in terms of efficiency and computational memory requirements.

97 MATHEMATICS AND COMPUTING↗

Random Predictor Models for Rigorous Uncertainty Quantification: Part 2

This and a companion paper propose techniques for constructing parametric mathematical models describing key features of the distribution of an output variable given input-output data. By contrast to standard models, which yield a single output value at each value of the input, Random Predictors Models (RPMs) yield a random variable at each value of the input. Optimization-based strategies for calculating RPMs having a polynomial dependency on the input and a linear dependency on the parameters are proposed. These formulations yield RPMs having various levels of fidelity in which the mean, the variance, and the range of the model's parameter, thus of the output, are prescribed. As such they encompass all RPMs conforming to these prescriptions. The RPMs are optimal in the sense that they yield the tightest predictions for which all (or, depending on the formulation, most) of the observations are less than a fixed number of standard deviations from the mean prediction. When the data satisfies mild stochastic assumptions, and the optimization problem(s) used to calculate the RPM is convex (or, when its solution coincides with the solution to an auxiliary convex problem), the model's reliability, which is the probability that a future observation would be within the predicted ranges, is bounded rigorously.

Crespo, Luis G.↗

A stochastic diffusion process for Lochner's generalized Dirichlet distribution

The method of potential solutions of Fokker-Planck equations is used to develop a transport equation for the joint probability of N stochastic variables with Lochner’s generalized Dirichlet distribution as its asymptotic solution. Individual samples of a discrete ensemble, obtained from the system of stochastic differential equations, equivalent to the Fokker-Planck equation developed here, satisfy a unit-sum constraint at all times and ensure a bounded sample space, similarly to the process developed in for the Dirichlet distribution. Consequently, the generalized Dirichlet diffusion process may be used to represent realizations of a fluctuating ensemble of N variables subject to a conservation principle. Compared to the Dirichlet distribution and process, the additional parameters of the generalized Dirichlet distribution allow a more general class of physical processes to be modeled with a more general covariance matrix.

97 MATHEMATICS AND COMPUTING↗