Search NASA⌕ Search

SEARCH · Search NASA

Results for “algorithmic differentiation”

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 415 records · Page 23

SU-F-R-22: Malignancy Classification for Small Pulmonary Nodules with Radiomics and Logistic Regression

Purpose: We conducted a retrospective study of Radiomics research for classifying malignancy of small pulmonary nodules. A machine learning algorithm of logistic regression and open research platform of Radiomics, IBEX (Imaging Biomarker Explorer), were used to evaluate the classification accuracy. Methods: The training set included 100 CT image series from cancer patients with small pulmonary nodules where the average diameter is 1.10 cm. These patients registered at Chang Gung Memorial Hospital and received a CT-guided operation of lung cancer lobectomy. The specimens were classified by experienced pathologists with a B (benign) or M (malignant). CT images with slice thickness of 0.625 mm were acquired from a GE BrightSpeed 16 scanner. The study was formally approved by our institutional internal review board. Nodules were delineated and 374 feature parameters were extracted from IBEX. We first used the t-test and p-value criteria to study which feature can differentiate between group B and M. Then we implemented a logistic regression algorithm to perform nodule malignancy classification. 10-fold cross-validation and the receiver operating characteristic curve (ROC) were used to evaluate the classification accuracy. Finally hierarchical clustering analysis, Spearman rank correlation coefficient, and clustering heat map were used to further study correlation characteristics among different features. Results: 238 features were found differentiable between group B and M based on whether their statistical p-values were less than 0.05. A forward search algorithm was used to select an optimal combination of features for the best classification and 9 features were identified. Our study found the best accuracy of classifying malignancy was 0.79±0.01 with the 10-fold cross-validation. The area under the ROC curve was 0.81±0.02. Conclusion: Benign nodules may be treated as a malignant tumor in low-dose CT and patients may undergo unnecessary surgeries or treatments. Our study may help radiologists to differentiate nodule malignancy for low-dose CT.

60 APPLIED LIFE SCIENCES↗

Quinoa, Version 0.2

Quinoa is a set of computational tools that enables research and numerical analysis in fluid dynamics. At this time it remains a test-bed to experiment with various algorithms using fully asynchronous runtime systems. Currently, Quinoa consists of the following tools: (1) Walker, a numerical integrator for systems of stochastic differential equations in time. It is a mathematical tool to analyze and design the behavior of stochastic differential equations. It allows the estimation of arbitrary coupled statistics and probability density functions and is currently used for the design of statistical moment approximations for multiple mixing materials in variable-density turbulence. (2) Inciter, an overdecomposition-aware finite element field solver for partial differential equations using 3D unstructured grids. Inciter is used to research asynchronous mesh-based algorithms and to experiment with coupling asynchronous to bulk-synchronous parallel code. Two planned new features of Inciter, compared to the previous release (LA-CC-16-015), to be implemented in 2017, are (a) a simple Navier-Stokes solver for ideal single-material compressible gases, and (b) solution-adaptive mesh refinement (AMR), which enables dynamically concentrating compute resources to regions with interesting physics. Using the NS-AMR problem we plan to explore how to scale such high-load-imbalance simulations, representative of large production multiphysics codes, to very large problems on very large computers using an asynchronous runtime system. (3) RNGTest, a test harness to subject random number generators to stringent statistical tests enabling quantitative ranking with respect to their quality and computational cost. (4) UnitTest, a unit test harness, running hundreds of tests per second, capable of testing serial, synchronous, and asynchronous functions. (5) MeshConv, a mesh file converter that can be used to convert 3D tetrahedron meshes from and to either of the following formats: Gmsh, http://www.geuz.org/gmsh, Netgen, http://sourceforge.net/apps/mediawiki/netgen-mesher, ExodusII, http://sourceforge.net/projects/exodusii, HyperMesh, http://www.altairhyperworks.com/product/HyperMesh.

Bakosi, Jozsef↗

Differential visualisation of a spectrally selective structure of strongly scattering objects

We describe a modification of the algorithm for the fast approximate solution of the diffuse optical tomography inverse problem. In this modification the amount of a priori (auxiliary) information necessary for the visualisation of the internal structure of the object is reduced by using a differential measurement scheme. The experiment is performed at two different wavelengths, and some a priori information, necessary to reconstruct only the spectrally selective component of the internal structure (the difference structure of the spatial distributions of the extinction coefficient at the wavelength employed), is replaced by the data of one of these measurements. (laser biophotonics)

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Single-shot x-ray phase-contrast and dark-field imaging based on coded binary phase mask

We introduce a coded-mask-based multi-contrast imaging method for high-resolution phase-contrast and dark-field imaging. The method uses a binary phase mask designed to provide an ultra-high-contrast pattern and reference-free single-shot measurement and an algorithm based on maximum-likelihood optimization and automatic differentiation to perform simultaneous reconstruction of absorption, phase, and dark-field object images. Further, we demonstrate that the method has great potential for real-time quantitative phase imaging and wavefront sensing when combined with deep learning.

Qiao, Zhi (ORCID:0000000286285320)↗

Agile Software Components and Libraries for Large-Scale Reservoir Simulations

The objective of this project was for Sandia National Laboratories (SNL) and ExxonMobil Research Company (URC) to collaborate on the development and integration of numerical algorithms and software components for the solution of partial differential equations (PDEs) that address the high fidelity simulation of reservoir flows. SNL’s role was to consult and advise URC on the best practices and use of SNL opensource software components as part of URC's work to incorporate these components into their PDE-based URC reservoir simulation code. A desired outcome was for URC to leverage SNL’s open-source software components as within their own codes, rather than to have to develop from scratch those same capabilities themselves, and for SNL to harden and mature those software components based on usage and feedback from URC.

97 MATHEMATICS AND COMPUTING↗

Challenging the Curse of Dimensionality in Multidimensional Numerical Integration by Using a Low-Rank Tensor-Train Format

Numerical integration is a basic step in the implementation of more complex numerical algorithms suitable, for example, to solve ordinary and partial differential equations. The straightforward extension of a one-dimensional integration rule to a multidimensional grid by the tensor product of the spatial directions is deemed to be practically infeasible beyond a relatively small number of dimensions, e.g., three or four. In fact, the computational burden in terms of storage and floating point operations scales exponentially with the number of dimensions. This phenomenon is known as the curse of dimensionality and motivated the development of alternative methods such as the Monte Carlo method. The tensor product approach can be very effective for high-dimensional numerical integration if we can resort to an accurate low-rank tensor-train representation of the integrand function. In this work, we discuss this approach and present numerical evidence showing that it is very competitive with the Monte Carlo method in terms of accuracy and computational costs up to several hundredths of dimensions if the integrand function is regular enough and a sufficiently accurate low-rank approximation is available.

97 MATHEMATICS AND COMPUTING↗

Fault Current Control and Protection in a Standalone DC Microgrid Using Adaptive Droop and Current Derivative

This report presents a novel fault detection, characterization, and fault current control algorithm for a standalone solar-photovoltaic (PV) based dc microgrids. The protection scheme is based on the current derivative algorithm. The overcurrent and current directional/differential comparison based protection schemes are incorporated for the dc microgrid fault characterization. For a low impedance fault, the fault current is controlled based on the current/voltage thresholds and current direction. Generally, the droop method is used to control the power-sharing between the converters by controlling the reference voltage. In this article, an adaptive droop scheme is also proposed to control the fault current by calculating a virtual resistance R droop , and to control the converter output reference voltage. For a high impedance fault, differential comparison method is used to characterize the fault. These algorithms effectively control the converter pulsewidth and reduce the flow of source current from a particular converter, which helps to increase the fault clearing time. Additionally, a trip signal is sent to the corresponding dc circuit breaker (DCCB), to isolate the faulted converter, feeder or a dc bus. The dc microgrid protection design procedure is detailed, and the performance of the proposed method is verified by simulation analysis.

24 POWER TRANSMISSION AND DISTRIBUTION↗

A Cutting Surface Algorithm for Semi-Infinite Convex Programming with an Application to Moment Robust Optimization

In this paper, we present and analyze a central cutting surface algorithm for general semi-infinite convex optimization problems and use it to develop a novel algorithm for distributionally robust optimization problems in which the uncertainty set consists of probability distributions with given bounds on their moments. Moments of arbitrary order, as well as nonpolynomial moments, can be included in the formulation. We show that this gives rise to a hierarchy of optimization problems with decreasing levels of risk-aversion, with classic robust optimization at one end of the spectrum and stochastic programming at the other. Although our primary motivation is to solve distributionally robust optimization problems with moment uncertainty, the cutting surface method for general semi-infinite convex programs is also of independent interest. The proposed method is applicable to problems with nondifferentiable semi-infinite constraints indexed by an infinite dimensional index set. Examples comparing the cutting surface algorithm to the central cutting plane algorithm of Kortanek and No demonstrate the potential of our algorithm even in the solution of traditional semi-infinite convex programming problems, whose constraints are differentiable, and are indexed by an index set of low dimension. After the rate of convergence analysis of the cutting surface algorithm, we extend the authors' moment matching scenario generation algorithm to a probabilistic algorithm that finds optimal probability distributions subject to moment constraints. The combination of this distribution optimization method and the central cutting surface algorithm yields a solution to a family of distributionally robust optimization problems that are considerably more general than the ones proposed to date.

97 MATHEMATICS AND COMPUTING↗

Stabilized multilevel Monte Carlo method for stiff stochastic differential equations

A multilevel Monte Carlo (MLMC) method for mean square stable stochastic differential equations with multiple scales is proposed. For such problems, that we call stiff, the performance of MLMC methods based on classical explicit methods deteriorates because of the time step restriction to resolve the fastest scales that prevents to exploit all the levels of the MLMC approach. We show that by switching to explicit stabilized stochastic methods and balancing the stabilization procedure simultaneously with the hierarchical sampling strategy of MLMC methods, the computational cost for stiff systems is significantly reduced, while keeping the computational algorithm fully explicit and easy to implement. Numerical experiments on linear and nonlinear stochastic differential equations and on a stochastic partial differential equation illustrate the performance of the stabilized MLMC method and corroborate our theoretical findings.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

The linear theory of functional differential equations: existence theorems and the problem of pointwise completeness of the solutions

A boundary value problem and an initial-boundary value problems are considered for a linear functional differential equation of point type. A suitable scale of functional spaces is introduced and existence theorems for solutions are stated in terms of this scale, in a form analogous to Noether's theorem. A key fact is established for the initial boundary value problem: the space of classical solutions of the adjoint equation must be extended to include impulsive solutions. A test for the pointwise completeness of solutions is obtained. The results presented are based on a formalism developed by the author for this type of equation. Bibliography: 7 titles.

97 MATHEMATICS AND COMPUTING↗

Charged jet cross sections and properties in proton-proton collisions at s = 7 TeV

Here, the differential charged jet cross sections, jet fragmentation distributions, and jet shapes are measured in minimum bias proton-proton collisions at center-of-mass energy √s=7 TeV using the ALICE detector at the LHC. Jets are reconstructed from charged particle momenta in the midrapidity region using the sequential recombination k T and anti-k T as well as the SISCone jet finding algorithms with several resolution parameters in the range R=0.2–0.6. Differential jet production cross sections measured with the three jet finders are in agreement in the transverse momentum (p T ) interval 20 < pjet,ch T < 100 GeV/c. They are also consistent with prior measurements carried out at the LHC by the ATLAS Collaboration. The jet charged particle multiplicity rises monotonically with increasing jet p T , in qualitative agreement with prior observations at lower energies. The transverse profiles of leading jets are investigated using radial momentum density distributions as well as distributions of the average radius containing 80% (R 80 ) of the reconstructed jet p T . The fragmentation of leading jets with R=0.4 using scaled p T spectra of the jet constituents is studied. The measurements are compared to model calculations from event generators (PYTHIA, PHOJET, HERWIG). The measured radial density distributions and R 80 distributions are well described by the PYTHIA model (tune Perugia-2011). The fragmentation distributions are better described by HERWIG.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Cosmology meets cohomology

The cosmological polytope and bootstrap programs have revealed interesting connections between positive geometries, modern on-shell methods and bootstrap principles studied in the amplitudes community with the wavefunction of the Universe in toy models of FRW cosmologies. To compute these FRW correlators, one often faces integrals that are too difficult to evaluate by direct integration. Borrowing from the Feynman integral community, the method of (canonical) differential equations provides an efficient alternative for evaluating these integrals. Moreover, we further develop our geometric understanding of these integrals by describing the associated relative twisted cohomology. Leveraging recent progress in our understanding of relative twisted cohomology in the Feynman integral community, we give an algorithm to predict the basis size and simplify the computation of the differential equations satisfied by FRW correlators.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Genetic algorithm optimization of nuclear criticality experiment for reduction of intermediate-energy 239 Pu nuclear data uncertainties

Nuclear criticality experiments are conducted to investigate specific nuclear data important for safe handling and storage of fissile materials, reactor design and operation, and the validation of radiation transport codes. Incorrect or uncertain nuclear data can prohibitively impact operational safety limits, reactor licensing, and predictive simulation capability; therefore, integral measurements from criticality experiments are necessary and should be performed frequently. To maximize the impact of the integral measurements, it is important to consider experiment geometry, material selection, and component dimensions. When taking these considerations into account, the experiment design process becomes iterative and very time intensive. This work utilizes a genetic algorithm to efficiently explore potential nuclear criticality experiment designs for the Laboratory Directed Research & Development project PARADIGM (PARallel Approach of Differential and InteGral Measurements) at Los Alamos National Laboratory. In this paper, the building blocks of the genetic algorithm are discussed in detail, the genetic algorithm methodology is verified, and the genetic algorithm is used to produce three candidate experiment models for the final PARADIGM design. The three candidate models produced by the genetic algorithm consist of copper-reflected assemblies containing 14 repeating units of alumina, graphite, boron, and plutonium plates. Furthermore, in addition to the optimization results, final design considerations are also discussed for designs with a height and/or weight very close to or slightly above assembly machine operational limits.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

GEAR-MC and Differential-Operator Methods Applied to Electron-Photon Transport in the Integrated TIGER Series

The sensitivity analysis algorithms that have been developed by the radiation transport community in multiple neutron transport codes, such as MCNP and SCALE, are extensively used by fields such as the nuclear criticality community. However, these techniques have seldom been considered for electron transport applications. In the past, the differential-operator method with the single scatter capability has been implemented in Sandia National Laboratories’ Integrated TIGER Series (ITS) coupled electron-photon transport code. This work is meant to extend the available sensitivity estimation techniques in ITS by implementing an adjoint-based sensitivity method, GEAR-MC, to strengthen its sensitivity analysis capabilities. To ensure the accuracy of this method being extended to coupled electron-photon transport, it is compared against the central-difference and differential-operator methodologies to estimate sensitivity coefficients for an experiment performed by McLaughlin and Hussman. Energy deposition sensitivities were calculated using all three methods, and the comparison between them has provided confidence in the accuracy of the newly implemented method. Unlike the current implementation of the differential-operator method in ITS, the GEAR-MC method was implemented with the option to calculate the energy-dependent energy deposition sensitivities, which are the sensitivity coefficients for energy deposition tallies to energy-dependent cross sections. The energy-dependent cross sections could be the cross sections for the material, elements in the material, or reactions of interest for the element. Further, these sensitivities were compared to the energy-integrated sensitivity coefficients and exhibited a maximum percentage difference of 2.15%.

42 ENGINEERING↗

Verification of MOOSE/Bison's Heat Conduction Solver Using Combined Spatiotemporal Convergence Analysis

Bison is a computational physics code that uses the finite element method to model the thermo-mechanical response of nuclear fuel. Since Bison is used to inform high-consequence decisions, it is important that its computational results are reliable and predictive. One important step in assessing the reliability and predictive capabilities of a simulation tool is the verification process, which quantifies numerical errors in a discrete solution relative to the exact solution of the mathematical model. One step in the verification process—called code verification—ensures that the implemented numerical algorithm is a faithful representation of the underlying mathematical model, including partial differential or integral equations, initial and boundary conditions, and auxiliary relationships. In this paper, the code verification process is applied to spatiotemporal heat conduction problems in Bison. Simultaneous refinement of the discretization in space and time is employed to reveal any potential mistakes in the numerical algorithms for the interactions between the spatial and temporal components of the solution. For each verification problem, the correct spatial and temporal order of accuracy is demonstrated for both first- and second-order accurate finite elements and a variety of time-integration schemes. Furthermore, these results provide strong evidence that the Bison numerical algorithm for solving spatiotemporal problems reliably represents the underlying mathematical model in MOOSE. The selected test problems can also be used in other simulation tools that numerically solve for conduction or diffusion.

11 NUCLEAR FUEL CYCLE AND FUEL MATERIALS↗

IMFIT: A FAST, FLEXIBLE NEW PROGRAM FOR ASTRONOMICAL IMAGE FITTING

I describe a new, open-source astronomical image-fitting program called IMFIT, specialized for galaxies but potentially useful for other sources, which is fast, flexible, and highly extensible. A key characteristic of the program is an object-oriented design that allows new types of image components (two-dimensional surface-brightness functions) to be easily written and added to the program. Image functions provided with IMFIT include the usual suspects for galaxy decompositions (Sérsic, exponential, Gaussian), along with Core-Sérsic and broken-exponential profiles, elliptical rings, and three components that perform line-of-sight integration through three-dimensional luminosity-density models of disks and rings seen at arbitrary inclinations. Available minimization algorithms include Levenberg-Marquardt, Nelder-Mead simplex, and Differential Evolution, allowing trade-offs between speed and decreased sensitivity to local minima in the fit landscape. Minimization can be done using the standard χ{sup 2} statistic (using either data or model values to estimate per-pixel Gaussian errors, or else user-supplied error images) or Poisson-based maximum-likelihood statistics; the latter approach is particularly appropriate for cases of Poisson data in the low-count regime. I show that fitting low-signal-to-noise ratio galaxy images using χ{sup 2} minimization and individual-pixel Gaussian uncertainties can lead to significant biases in fitted parameter values, which are avoided if a Poisson-based statistic is used; this is true even when Gaussian read noise is present.

79 ASTRONOMY AND ASTROPHYSICS↗

Algorithmic improvements for schemes using the ADER time discretization

We detail several algorithmic changes to the ADER Multi-Moment Finite-Volume Methods (ADER + MMFV) of Norman and Finkel (2012) [2]. The DT recurrence relations are improved, flux and source term differential transforms are saved, each are expanded as polynomials, quadrature is removed from the algorithm, integration is performed analytically, and a different Riemann solver admitting direct use of time-averaged fluxes is used. These algorithmic changes were implemented and tested, and smooth 1-D shallow water experiments confirm the same or slightly better accuracy as well as 2–3× lower runtimes compared to Norman and Finkel (2012) [2].

Norman, Matthew↗

Numerical strategies for filtering partially observed stiff stochastic differential equations

In this paper, we present a fast numerical strategy for filtering stochastic differential equations with multiscale features. This method is designed such that it does not violate the practical linear observability condition and, more importantly, it does not require the computationally expensive cross correlation statistics between multiscale variables that are typically needed in standard filtering approach. The proposed filtering algorithm comprises of a 'macro-filter' that borrows ideas from the Heterogeneous Multiscale Methods and a 'micro-filter' that reinitializes the fast microscopic variables to statistically reflect the unbiased slow macroscopic estimate obtained from the macro-filter and macroscopic observations at asynchronous times. We will show that the proposed micro-filter is equivalent to solving an inverse problem for parameterizing differential equations. Numerically, we will show that this microscopic reinitialization is an important novel feature for accurate filtered solutions, especially when the microscopic dynamics is not mixing at all.

97 MATHEMATICS AND COMPUTING↗