Search NASA⌕ Search

SEARCH · Search NASA

Results for “generalized algorithm”

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,063 records · Page 59

Gravity effects on Hawking radiation from charged black strings in Rastall theory

Highlights: • Introductory review of charged black strings in Rastall theory. • Detailed description of Hawking temperature. • Graphically Analysis of Hawking temperature. • Discuss the stability of charged black strings. The Rastall theory of gravity is the generalized form of the Einstein theory which describes the conservation law of energy and momentum tensor. In our work, we compute the charged black strings solution in the background of Rastall theory by applying the Newman–Janis approach. After computing the charged black strings solution in the background of Rastall theory, we study the thermodynamical property (i.e., Hawking temperature) for the charged black strings. Furthermore, we investigate the graphical representation of Hawking temperature via event horizon to check the stability conditions of charged black strings under the influence of Rastall theory. Moreover, we examine the modified Hawking temperature for charged black strings in Rastall theory by taking into account the quantum gravity effects. We also discuss the physical state of charged black strings under the effects of quantum gravity and spin parameter (appears due to Rastall theory in charged black strings solution).

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

A stochastic multiscale framework for modeling flow through random heterogeneous porous media

Flow through porous media is ubiquitous, occurring from large geological scales down to the microscopic scales. Several critical engineering phenomena like contaminant spread, nuclear waste disposal and oil recovery rely on accurate analysis and prediction of these multiscale phenomena. Such analysis is complicated by inherent uncertainties as well as the limited information available to characterize the system. Any realistic modeling of these transport phenomena has to resolve two key issues: (i) the multi-length scale variations in permeability that these systems exhibit, and (ii) the inherently limited information available to quantify these property variations that necessitates posing these phenomena as stochastic processes. A stochastic variational multiscale formulation is developed to incorporate uncertain multiscale features. A stochastic analogue to a mixed multiscale finite element framework is used to formulate the physical stochastic multiscale process. Recent developments in linear and non-linear model reduction techniques are used to convert the limited information available about the permeability variation into a viable stochastic input model. An adaptive sparse grid collocation strategy is used to efficiently solve the resulting stochastic partial differential equations (SPDEs). The framework is applied to analyze flow through random heterogeneous media when only limited statistics about the permeability variation are given.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Numerical fluid solutions for nonlocal electron transport in hot plasmas: Equivalent diffusion versus nonlocal source

Flux limitation and preheat are important processes in electron transport occurring in laser produced plasmas. The proper calculation of both of these has been a subject receiving much attention over the entire lifetime of the laser fusion project. Where nonlocal transport (instead of simple single flux limit) has been modeled, it has always been with what we denote the equivalent diffusion solution, namely treating the transport as only a diffusion process. We introduce here a new approach called the nonlocal source solution and show it is numerically viable for laser produced plasmas. It turns out that the equivalent diffusion solution generally underestimates preheat. Furthermore, the advance of the temperature front, and especially the preheat, can be held up by artificial 'thermal barriers'. The nonlocal source method of solution, on the other hand more accurately describes preheat and can stably calculate the solution for the temperature even if the heat flux is up the gradient.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Computationally-efficient stochastic cluster dynamics method for modeling damage accumulation in irradiated materials

An improved version of a recently developed stochastic cluster dynamics (SCD) method (Marian and Bulatov, 2012) [6] is introduced as an alternative to rate theory (RT) methods for solving coupled ordinary differential equation (ODE) systems for irradiation damage simulations. SCD circumvents by design the curse of dimensionality of the variable space that renders traditional ODE-based RT approaches inefficient when handling complex defect population comprised of multiple (more than two) defect species. Several improvements introduced here enable efficient and accurate simulations of irradiated materials up to realistic (high) damage doses characteristic of next-generation nuclear systems. The first improvement is a procedure for efficiently updating the defect reaction-network and event selection in the context of a dynamically expanding reaction-network. Next is a novel implementation of the τ-leaping method that speeds up SCD simulations by advancing the state of the reaction network in large time increments when appropriate. Lastly, a volume rescaling procedure is introduced to control the computational complexity of the expanding reaction-network through occasional reductions of the defect population while maintaining accurate statistics. The enhanced SCD method is then applied to model defect cluster accumulation in iron thin films subjected to triple ion-beam (Fe{sup 3+}, He{sup +} and H{sup +}) irradiations, for which standard RT or spatially-resolved kinetic Monte Carlo simulations are prohibitively expensive.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

On the use of reverse Brownian motion to accelerate hybrid simulations

Multiscale and multiphysics simulations are two rapidly developing fields of scientific computing. Efficient coupling of continuum (deterministic or stochastic) constitutive solvers with their discrete (stochastic, particle-based) counterparts is a common challenge in both kinds of simulations. We focus on interfacial, tightly coupled simulations of diffusion that combine continuum and particle-based solvers. The latter employs the reverse Brownian motion (rBm), a Monte Carlo approach that allows one to enforce inhomogeneous Dirichlet, Neumann, or Robin boundary conditions and is trivially parallelizable. We discuss numerical approaches for improving the accuracy of rBm in the presence of inhomogeneous Neumann boundary conditions and alternative strategies for coupling the rBm solver with its continuum counterpart. Numerical experiments are used to investigate the convergence, stability, and computational efficiency of the proposed hybrid algorithm.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Sampling two-dimensional isometric tensor network states

Sampling a quantum system’s underlying probability distributions is an important computational task, e.g., for quantum advantage experiments and quantum Monte Carlo algorithms. Tensor networks are an invaluable tool for efficiently representing states of large quantum systems with limited entanglement. Algorithms for sampling one-dimensional (1D) tensor networks are well-established and utilized in several 1D tensor network methods. In this paper we introduce two novel sampling algorithms for two-dimensional (2D) isometric tensor network states (isoTNS) that generalize existing 1D tensor network sampling algorithms. Our first proposed algorithm performs independent sampling and yields a single configuration together with its associated probability. The second algorithm employs a greedy search strategy to identify high-probability configurations and their corresponding probabilities. Numerical results demonstrate the effectiveness of these algorithms across quantum states with varying entanglement and system size.

Dumitrescu, Eugene [ORNL] (ORCID:0000000158519567)↗

Multilevel acceleration of scattering-source iterations with application to electron transport

Acceleration/preconditioning strategies available in the SCEPTRE radiation transport code are described. A flexible transport synthetic acceleration (TSA) algorithm that uses a low-order discrete-ordinates (S N ) or spherical-harmonics (P N ) solve to accelerate convergence of a high-order S N source-iteration (SI) solve is described. Convergence of the low-order solves can be further accelerated by applying off-the-shelf incomplete-factorization or algebraic-multigrid methods. Also available is an algorithm that uses a generalized minimum residual (GMRES) iterative method rather than SI for convergence, using a parallel sweep-based solver to build up a Krylov subspace. TSA has been applied as a preconditioner to accelerate the convergence of the GMRES iterations. The methods are applied to several problems involving electron transport and problems with artificial cross sections with large scattering ratios. These methods were compared and evaluated by considering material discontinuities and scattering anisotropy. Observed accelerations obtained are highly problem dependent, but speedup factors around 10 have been observed in typical applications.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

Multicomponent Cholesky Decomposition: Application to Nuclear–Electronic Orbital Theory

The Cholesky decomposition technique is commonly used to reduce the memory requirement for storing two-particle repulsion integrals in quantum chemistry calculations that use atomic orbital bases. However, when quantum methods use multicomponent bases, such as nuclear–electronic orbitals, additional challenges are introduced due to asymmetric two-particle integrals. This work proposes several multicomponent Cholesky decomposition methods for calculations using nuclear–electronic orbital density functional theory. To analyze the errors in different Cholesky decomposition components, benchmark calculations using water clusters are carried out. The largest benchmark calculation is a water cluster (H 2 O) 27 where all 54 protons are treated quantum mechanically. Furthermore, this study provides energetic and complexity analyses to demonstrate the accuracy and performance of the proposed multicomponent Cholesky decomposition method.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

All-optical image denoising using a diffractive visual processor

Abstract Image denoising, one of the essential inverse problems, targets to remove noise/artifacts from input images. In general, digital image denoising algorithms, executed on computers, present latency due to several iterations implemented in, e.g., graphics processing units (GPUs). While deep learning-enabled methods can operate non-iteratively, they also introduce latency and impose a significant computational burden, leading to increased power consumption. Here, we introduce an analog diffractive image denoiser to all-optically and non-iteratively clean various forms of noise and artifacts from input images – implemented at the speed of light propagation within a thin diffractive visual processor that axially spans <250 × λ, where λ is the wavelength of light. This all-optical image denoiser comprises passive transmissive layers optimized using deep learning to physically scatter the optical modes that represent various noise features, causing them to miss the output image Field-of-View (FoV) while retaining the object features of interest. Our results show that these diffractive denoisers can efficiently remove salt and pepper noise and image rendering-related spatial artifacts from input phase or intensity images while achieving an output power efficiency of ~30–40%. We experimentally demonstrated the effectiveness of this analog denoiser architecture using a 3D-printed diffractive visual processor operating at the terahertz spectrum. Owing to their speed, power-efficiency, and minimal computational overhead, all-optical diffractive denoisers can be transformative for various image display and projection systems, including, e.g., holographic displays.

36 MATERIALS SCIENCE↗

SANS quantification of bound water in water-soluble polymers across multiple concentration regimes

Contrast-variation small-angle neutron scattering (CV-SANS) is a widely used technique for quantifying hydration water in soft matter systems, but it is predominantly applied in the dilute regime or for systems with a well-defined structure factor. Here, CV-SANS was used to quantify the number of hydration water molecules associating with three water-soluble polymers with different critical solution temperatures and types of water–solute interactions in dilute, semidilute, and concentrated solution through the exploration of novel methods of data fitting and analysis. Multiple SANS fitting workflows with varying levels of model assumptions were evaluated and compared to give insight into SANS model selection. These fitting pathways ranged from general, model-free algorithms to more standard form and structure factor fitting. In addition, Monte Carlo bootstrapping was evaluated as a method to estimate parameter uncertainty through simulation of technical replicates. The most robust fitting workflow for dilute solutions was found to be form factor fitting without CV-SANS ( i.e. polymer in 100% D 2 O). For semidilute and concentrated solutions, while the model-free approach can be mathematically defined for CV-SANS data, the addition of a structure factor imposes physical constraints on the optimization problem, suggesting that the optimal fitting pathway should include appropriate form and structure factor models. The measured hydration numbers were consistent with the number of tightly bound water molecules associated with each monomer unit, and the concentration dependence of the hydration number was largely governed by the chemistry-specific interactions between water and polymer. Polymers with weaker water–polymer interactions ( i.e. those with fewer hydration water molecules) were found to have more bound water at higher concentrations than those with stronger water–polymer interactions due to the increase in the number of forced water–polymer contacts in the concentrated system. This SANS-based method to count hydration water molecules can be applied to polymers in any concentration regime, which will lead to improved understanding of water–polymer interactions and their impact on materials design.

36 MATERIALS SCIENCE↗

Ising model observables and non-backtracking walks

This paper presents an alternative proof of the connection between the partition function of the Ising model on a finite graph G and the set of non-backtracking walks on G. The techniques used also give formulas for spin-spin correlation functions in terms of non-backtracking walks. The main tools used are Viennot's theory of heaps of pieces and turning numbers on surfaces.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Sub-quantum Fisher information

We report the quantum Fisher information (QFI) plays a crucial role in quantum information theory and in many practical applications such as quantum metrology. However, computing the QFI is generally a computationally demanding task. In this work we analyze a lower bound on the QFI which we call the sub-quantum Fisher information (sub-QFI). The bound can be efficiently estimated on a quantum computer for an n-qubit state using 2n qubits. The sub-QFI is based on the super-fidelity, an upper bound on Uhlmann's fidelity. We analyze the sub-QFI in the context of unitary families, where we derive several crucial properties including its geometrical interpretation. In particular, we prove that the QFI and the sub-QFI are maximized for the same optimal state, which implies that the sub-QFI is faithful to the QFI in the sense that both quantities share the same global extrema. Based on this faithfulness, the sub-QFI acts as an efficiently computable surrogate for the QFI for quantum sensing and quantum metrology applications. Finally, we provide additional meaning to the sub-QFI as a measure of coherence, asymmetry, and purity loss.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Realization of universal adiabatic quantum computation with fewer physical resources

The adiabatic quantum computation (AQC) has been proved to be equivalent with the standard circuit model. To realize AQC, we have to realize the target Hamiltonian. However, usually the target Hamiltonian contains k-local terms where k{>=}3 which is difficult to realize in experiment. It has been proved that a k-local Hamiltonian can be reduced to a two-local one. However, the reduction process needs a lot of auxiliary qubits which makes the system very complicated. Here we show that one can reduce a three-local Hamiltonian to a two-local one using only one third of the auxiliary qubits the previous approach needs and, in special cases, only three auxiliary qubits.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Computable and Operationally Meaningful Multipartite Entanglement Measures

Multipartite entanglement is an essential resource for quantum communication, quantum computing, quantum sensing, and quantum networks. The utility of a quantum state |ψ$\rangle$ for these applications is often directly related to the degree or type of entanglement present in |ψ$\rangle$. Therefore, efficiently quantifying and characterizing multipartite entanglement is of paramount importance. Here, in this work, we introduce a family of multipartite entanglement measures, called concentratable entanglements. Several well-known entanglement measures are recovered as special cases of our family of measures, and hence we provide a general framework for quantifying multipartite entanglement. We prove that the entire family does not increase, on average, under local operations and classical communications. We also provide an operational meaning for these measures in terms of probabilistic concentration of entanglement into Bell pairs. Finally, we show that these quantities can be efficiently estimated on a quantum computer by implementing a parallelized SWAP test, opening up a research direction for measuring multipartite entanglement on quantum devices.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Exploring Memory Hierarchy to Improve Scientific Data Read Performance, In: 2015 IEEE International Conference on Cluster Computing

Improving read performance is one of the major challenges with speeding up scientific data analytic applications. Utilizing the memory hierarchy is one major line of researches to address the read performance bottleneck. Related methods usually combine solide-state-drives(SSDs) with dynamic random-access memory(DRAM) and/or parallel file system(PFS) to mitigate the speed and space gap between DRAM and PFS. However, these methods are unable to handle key performance issues plaguing SSDs, namely read contention that may cause up to 50% performance reduction. In this paper, we propose a framework that exploits the memory hierarchy resource to address the read contention issues involved with SSDs. The framework employs a general purpose online read algorithm that able to detect and utilize memory hierarchy resource to relieve the problem. To maintain a near optimal operating environment for SSDs, the framework is able to orchastrate data chunks across different memory layers to facilitate the read algorithm. Compared to existing tools, our framework achieves up to 50% read performance improvement when tested on datasets from real-world scientific simulations.

Computer Science↗

Domain-Adapted Convolutional Networks for Satellite Image Classification: A Large-Scale Interactive Learning Workflow

Satellite imagery often exhibits large spatial extent areas that encompass object classes with considerable variability. This often limits large-scale model generalization with machine learning algorithms. Notably, acquisition conditions, including dates, sensor position, lighting condition, and sensor types, often translate into class distribution shifts introducing complex nonlinear factors and hamper the potential impact of machine learning classifiers. Here, this article investigates the challenge of exploiting satellite images using convolutional neural networks (CNN) for settlement classification where the class distribution shifts are significant. We present a large-scale human settlement mapping workflow based-off multiple modules to adapt a pretrained CNN to address the negative impact of distribution shift on classification performance. To extend a locally trained classifier onto large spatial extents areas we introduce several submodules: First, a human-in-the-loop element for relabeling of misclassified target domain samples to generate representative examples for model adaptation; second, an efficient hashing module to minimize redundancy and noisy samples from the mass-selected examples; and third, a novel relevance ranking module to minimize the dominance of source example on the target domain. The workflow presents a novel and practical approach to achieve large-scale domain adaptation with binary classifiers that are based-off CNN features. Experimental evaluations are conducted on areas of interest that encompass various image characteristics, including multisensors, multitemporal, and multiangular conditions. Domain adaptation is assessed on source–target pairs through the transfer loss and transfer ratio metrics to illustrate the utility of the workflow.

47 OTHER INSTRUMENTATION↗

3D automatic anatomy segmentation based on iterative graph-cut-ASM

Purpose: This paper studies the feasibility of developing an automatic anatomy segmentation (AAS) system in clinical radiology and demonstrates its operation on clinical 3D images. Methods: The AAS system, the authors are developing consists of two main parts: object recognition and object delineation. As for recognition, a hierarchical 3D scale-based multiobject method is used for the multiobject recognition task, which incorporates intensity weighted ball-scale (b-scale) information into the active shape model (ASM). For object delineation, an iterative graph-cut-ASM (IGCASM) algorithm is proposed, which effectively combines the rich statistical shape information embodied in ASM with the globally optimal delineation capability of the GC method. The presented IGCASM algorithm is a 3D generalization of the 2D GC-ASM method that they proposed previously in Chen et al.[Proc. SPIE, 7259, 72590C1-72590C-8 (2009)]. The proposed methods are tested on two datasets comprised of images obtained from 20 patients (10 male and 10 female) of clinical abdominal CT scans, and 11 foot magnetic resonance imaging (MRI) scans. The test is for four organs (liver, left and right kidneys, and spleen) segmentation, five foot bones (calcaneus, tibia, cuboid, talus, and navicular). The recognition and delineation accuracies were evaluated separately. The recognition accuracy was evaluated in terms of translation, rotation, and scale (size) error. The delineation accuracy was evaluated in terms of true and false positive volume fractions (TPVF, FPVF). The efficiency of the delineation method was also evaluated on an Intel Pentium IV PC with a 3.4 GHZ CPU machine. Results: The recognition accuracies in terms of translation, rotation, and scale error over all organs are about 8 mm, 10 deg. and 0.03, and over all foot bones are about 3.5709 mm, 0.35 deg. and 0.025, respectively. The accuracy of delineation over all organs for all subjects as expressed in TPVF and FPVF is 93.01% and 0.22%, and all foot bones for all subjects are 93.75% and 0.28%, respectively. While the delineations for the four organs can be accomplished quite rapidly with average of 78 s, the delineations for the five foot bones can be accomplished with average of 70 s. Conclusions: The experimental results showed the feasibility and efficacy of the proposed automatic anatomy segmentation system: (a) the incorporation of shape priors into the GC framework is feasible in 3D as demonstrated previously for 2D images; (b) our results in 3D confirm the accuracy behavior observed in 2D. The hybrid strategy IGCASM seems to be more robust and accurate than ASM and GC individually; and (c) delineations within body regions and foot bones of clinical importance can be accomplished quite rapidly within 1.5 min.

62 RADIOLOGY AND NUCLEAR MEDICINE↗