Search NASA⌕ Search

SEARCH · Search NASA

Results for “Global optimization”

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 451 records · Page 25

Two-dimensional topological crystalline quantum spin Hall effect in transition metal intercalated compounds

While most of the two-dimensional (2D) topological crystalline insulators (TCIs) belong to group IV-VI narrow-band-gap semiconductors in a square lattice, in the present work we predict a TCI family based on transition metal intercalated compounds in a hexagonal lattice. First-principles calculations combined with a substrate-fixed globally optimal structural search technique show that a layer of Os prefers a uniform distribution between two graphene sheets. Band dispersion calculations reveal a Dirac point and a Dirac nodal ring near the Fermi level. The Dirac point is ascribed to the hybridization of e 2 and e 2 * orbitals, and the Dirac ring is formed due to dispersion of s and e 1 * orbitals. Upon inclusion of spin-orbit coupling, these Dirac states open topologically nontrivial local band gaps, which are characterized by nonzero mirror Chern numbers. The quantum spin Hall effect is also observed by integrating the spin Berry curvature in the Brillouin zone. In contrast to the 2D group IV-VI TCIs whose band inversions at X and Y points are “locked” by C 4 rotation symmetry, here the relative energy of two local band gaps can be manipulated by in-plane biaxial strains. Some other similar intercalation compounds are also shown to be topologically nontrivial. Our work extends the 2D TCI family into a hexagonal lattice composed of transition metals.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

PSSP, a Computer Program for the Crystal Structure Solution of Molecular Materials from X-ray Powder Diffraction Data

This work describes the computer program PSSP (powder structure solution program) for the crystal structure solution of molecular solids from X-ray powder diffraction data. This direct-space structure solution program uses the simulated annealing global optimization algorithm to minimize the difference between integrated intensities calculated from trial models and those extracted in a Le Bail fit of the experimental pattern, using a cost function for dealing with peak overlap through defined intensity correlation coefficients, computationally faster to calculate than R{sub wp}. The methodology outlined is applicable to organic solids composed of moderately complex rigid and flexible molecules, using diffraction data up to relatively low resolution. PSSP performance tests using 11 molecular solids with six to 20 degrees of freedom are analyzed.

99 GENERAL AND MISCELLANEOUS↗

Adaptive Generation of Training Data for ML Reduced Model Creation

Machine learning proxy models are often used to speed up or completely replace complex computational models. The greatly reduced and deterministic computational costs enable new use cases such as digital twin control systems and global optimization. The challenge of building these proxy models is generating the training data. A naive uniform sampling of the input space can result in a non-uniform sampling of the output space of a model. This can cause gaps in the training data coverage that can miss finer scale details resulting in poor accuracy. While larger and larger data sets could eventually fill in these gaps, the computational burden of full-scale simulation codes can make this prohibitive. In this paper, we present an adaptive data generation method that utilizes uncertainty estimation to identify regions where training data should be augmented. By targeting data generation to areas of need, representative data sets can be generated efficiently. The effectiveness of this method will be demonstrated on a simple one-dimensional function and a complex multidimensional physics model.

Cianciosa, Mark↗

Performance Improvements Through Advanced PV Backtracking on Uneven Terrain

The climatic sensitivity of new terrain-aware backtracking algorithms is evaluated across 800 locations in the continental USA on a representative synthetic rolling terrain. We find that a global optimization approach to backtracking results in climate-specific annual energy gains of 2.4%–3.2% relative to a traditional backtracking algorithm baseline. We identify a strong logarithmic correlation between local diffuse fraction and yield improvement, and highlight the effect of seasonal precipitation on performance gains. We also find that a backtracking approach, which approximates the terrain as constant, does not offer significant annual energy gains over the baseline on the synthetic terrain. Our findings suggest that specific yield from backtracking in the USA can be improved by as much as 88 kWh/kW by considering terrain when selecting a backtracking algorithm.

Backtracking↗

Feature Tracking and Visualization of Madden-Julian Osciallation in Climate Simulation

Madden-Julian Oscillation (MJO) is one of the less understood aspects of tropical meteorology, which plays a significant role in tropical intra-seasonal variations in rain, temperature and winds over the Indian and Pacific Oceans. In this paper, we present an integrated analysis and visualization framework for MJO episodes simulated by a high resolution regional model. To distinguish MJOs from other weather phenomena, our framework utilizes domain knowledge to track MJOs as finding the globally optimized properties in the data. In addition to enhancing the animation with feature tracking, our visualization system also integrates different visualization components such as Virtual Globe and Hovmoller Diagrams to visualize large scale events both in space and time. By linking all of these visualization components on a web-based interface, scientists can identify cloud and environmental processes associated with the initiation and eastward propagation of MJO more easily.

big-data visualization↗

Fast Iterative Multi-site Hosting Capacity Analysis for Distribution Systems With Search Space Pruning

Interconnection studies for distributed energy resources (DERs) is a time-intensive process, primarily due to the necessity of solving large number of power flow scenarios. Hosting capacity analysis (HCA) is a time-consuming aspect of interconnection studies that is divided into single-site HCA (SHCA) and multi-site HCA (MHCA). From a computational and understandable standpoint, the industry seeks iteration-based solutions for SHCA, although it doesn't maximize the total DER hosting capacity (DERHC) of the grid, as MHCA does. While non-iterative solutions are available for MHCA, they involve a trade-off between the modeling accuracy of the distribution system, solution quality, and ease of understanding. In this work, we present a fast iterative solution for MHCA, reducing computational complexity by eliminating the need to solve power flows for a large amount of search space, thus making iterative solutions feasible. This iterative approach guarantees both a global optimal solution with sufficient time and a fast, close-to-optimal solution through efficient search space pruning. It also easily integrates with existing utility HCA tools. The results are demonstrated on select locations in the IEEE-123 bus system for community-scale interconnection studies. We highlight the benefits of skipping the need to solve millions of power flows, all while maximizing the grid's total DERHC.

Guddanti, Kishan Prudhvi↗

Stochastic Dual Algorithm for Voltage Regulation in Distribution Networks with Discrete Loads

This paper considers power distribution networks with distributed energy resources and designs an incentive-based algorithm that allows the network operator and customers to pursue given operational and economic objectives while concurrently ensuring that voltages are within prescribed limits. Heterogeneous DERs with continuous and discrete control commands are considered. We address four major challenges: discrete decision variables, non-convexity due to a Stackelberg game structure, unavailability of private information from customers, and asynchronous operation. Starting from a non-convex setting, we develop a distributed stochastic dual algorithm that solves a relaxed problem, and prove that the proposed algorithm achieves the global optimal solution of the original problem on average. Feasible values for discrete decision variables are also recovered. Stability of the algorithm is analytically established and numerically corroborated.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Networked Microgrids for Self-healing Power Systems

This paper proposes a transformative architecture for the normal operation and self-healing of networked microgrids (MGs). MGs can support and interchange electricity with each other in the proposed infrastructure. The networked MGs are connected by a physical common bus and a designed two-layer cyber communication network. The lower layer is within each MG where the energy management system (EMS) schedules the MG operation; the upper layer links a number of EMSs for global optimization and communication. In the normal operation mode, the objective is to schedule dispatchable distributed generators (DGs), energy storage systems (ESs) and controllable loads to minimize the operation costs and maximize the supply adequacy of each MG. When a generation deficiency or fault happens in a MG, the model switches to the self-healing mode and the local generation capacities of other MGs can be used to support the on-emergency portion of the system. A consensus algorithm is used to distribute portions of the desired power support to each individual MG in a decentralized way. The allocated portion corresponds to each MG’s local power exchange target which is used by its EMS to perform the optimal schedule. The resultant aggregated power output of networked MGs will be used to provide the requested power support. Test cases demonstrate the effectiveness of the proposed methodology.

Consensus Algorithm↗

Data association algorithm for large-scale multi-object tracking with complex interactions

We present an online multi-object tracking algorithm to track multiple objects across a large number of image frames. Our work is motivated by the need to study evolution of nanoscale objects by transmission electron microscopy. The proposed approach is based on the existing multi-way data association tracking algorithm that is capable of tracking interacting objects with complex behaviors (i.e., merge, split, overlap, and appearance or disappearance). The multi-way data association is an offline algorithm to associate objects across all image frames at one step with a global optimization, which does not scale very well for large number of image frames. The proposed online tracking algorithm processes image frames as they arrive by detecting all objects in the newly arrived image frame and making the associations of the objects to those detected from the previous frame by the multi-way data association. This frameby-frame association scheme can cause fragmented traces of the objects that are occasionally misdetected for some image frames. We overcome this issue by allowing previously unassociated objects to be associated when the objects reappear within a fixed number of future image frames, namely the frame-delayed association. We combine the multi-way data association with the frame-delayed association to be able to track interacting objects with accurate handling of object disappearance events. The proposed method is validated through applications to simulated multi-object tracking problem and a real multi-object tracking problem. Here, the outcome of the proposed method is compared with four state-of-the-art algorithms.

36 MATERIALS SCIENCE↗

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↗

TU-H-CAMPUS-TeP1-01: Variable-Beam Fractionation for SAbR

Purpose: In current conventionally-fractionated as well as hypofractionated 3D conformal radiotherapy (CRT), the same beam arrangement is employed from fraction to fraction. We challenge this notion and postulate that by varying the beam arrangement between fractions we can achieve greater sparing of organs at risk (OARs) while maintaining PTV coverage. We use an inverse planning strategy using a swarm intelligence-based global optimization algorithm to exploit the additional degree of freedom represented by inter-fractional variation in beam angles. Methods: To evaluate our variable-beam fractionation (VBF) method, a 10-beam ITV-based conformal stereotactic ablative radiotherapy (CRT-SAbR) plan was optimized. In the clinical plan, 54 Gy was delivered to a 41cc lung tumor over 3 fractions. In VBF, each original clinically-assigned beam was multiplied to a bundle of n α-degree-spaced beams, n being number of fractions. Selection of α was a compromise between retaining similar tumor irradiation and separating inline OAR sub-regions. We optimized the beam fluence weights setting an upper limit for beam delivery duration (and implicitly, monitor units) along with clinical organ-based dose-volume constraints. Zero weights were allowed so that the optimization algorithm could remove unnecessary beams. All fractions in final plan had to deliver identical monitor units (MU) while satisfying a soft constraint on having no more than one beam from every n-beam bundle in each fraction. α was 10 degrees and the dose rate was 600 MU/min. Results: The VBF plan achieved significantly superior OAR sparing compared to the clinical internal target volume (ITV)-based plan. Setting maximum beam delivery duration to 13 seconds (well within breath-hold range), Esophagus Dmax, Heart Dmax, Spinal cord Dmax and Lung V13 were improved by 25%, 81%, 0% and 27%, respectively. Conclusion: We investigated a simple approach to inter-fractional VBF planning and demonstrated its potential in reducing dose to OARs. This work was partially supported through research funding from National Institutes of Health (R01CA169102) and Varian Medical Systems, Palo Alto, CA, USA.

60 APPLIED LIFE SCIENCES↗

Slope Extensions to ASL Library

Extensions to the AMPL/solver interface library (http://netlib.sandia.gov/ampl/solvers) to compute bounds on algebraic expressions, plus a test program. use in uncertainty quantification and global optimization algorithms. This software is not primarily for military applications.

Gay, David↗

I-V characterization and parameter extraction tool [SWR-24-59]

GPT-crafted control software and graphical user interface for Keithley 2400 Source Measure Units and global optimization algorithm. It contains Numba-compatible self-adaptive differential evolution algorithm for optimization tasks. This software is comprised of two repositories: https://github.com/NREL/Keithley_GPT https://github.com/NREL/DE

Febba, Davi Marcelo↗

Tailoring photonic metamaterial resonances for thermal radiation

Selective solar absorbers generally have limited effectiveness in unconcentrated sunlight, because of reradiation losses over a broad range of wavelengths and angles. However, metamaterials offer the potential to limit radiation exchange to a proscribed range of angles and wavelengths, which has the potential to dramatically boost performance. After globally optimizing one particular class of such designs, we find thermal transfer efficiencies of 78% at temperatures over 1,000°C, with overall system energy conversion efficiencies of 37%, exceeding the Shockley-Quiesser efficiency limit of 31% for photovoltaic conversion under unconcentrated sunlight. This represents a 250% increase in efficiency and 94% decrease in selective emitter area compared to a standard, angular-insensitive selective absorber.

14 SOLAR ENERGY↗

Rhythmic Dynamics and Synchronization via Dimensionality Reduction: Application to Human Gait

Reliable characterization of locomotor dynamics of human walking is vital to understanding the neuromuscular control of human locomotion and disease diagnosis. However, the inherent oscillation and ubiquity of noise in such non-strictly periodic signals pose great challenges to current methodologies. To this end, we exploit the state-of-the-art technology in pattern recognition and, specifically, dimensionality reduction techniques, and propose to reconstruct and characterize the dynamics accurately on the cycle scale of the signal. This is achieved by deriving a low-dimensional representation of the cycles through global optimization, which effectively preserves the topology of the cycles that are embedded in a highdimensional Euclidian space. Our approach demonstrates a clear advantage in capturing the intrinsic dynamics and probing the subtle synchronization patterns from uni/bivariate oscillatory signals over traditional methods. Application to human gait data for healthy subjects and diabetics reveals a significant difference in the dynamics of ankle movements and ankleknee coordination, but not in knee movements. These results indicate that the impaired sensory feedback from the feet due to diabetes does not influence the knee movement in general, and that normal human walking is not critically dependent on the feedback from the peripheral nervous system.

59 BASIC BIOLOGICAL SCIENCES↗

Topology for statistical modeling of petascale data.

This document presents current technical progress and dissemination of results for the Mathematics for Analysis of Petascale Data (MAPD) project titled 'Topology for Statistical Modeling of Petascale Data', funded by the Office of Science Advanced Scientific Computing Research (ASCR) Applied Math program. Many commonly used algorithms for mathematical analysis do not scale well enough to accommodate the size or complexity of petascale data produced by computational simulations. The primary goal of this project is thus to develop new mathematical tools that address both the petascale size and uncertain nature of current data. At a high level, our approach is based on the complementary techniques of combinatorial topology and statistical modeling. In particular, we use combinatorial topology to filter out spurious data that would otherwise skew statistical modeling techniques, and we employ advanced algorithms from algebraic statistics to efficiently find globally optimal fits to statistical models. This document summarizes the technical advances we have made to date that were made possible in whole or in part by MAPD funding. These technical contributions can be divided loosely into three categories: (1) advances in the field of combinatorial topology, (2) advances in statistical modeling, and (3) new integrated topological and statistical methods.

99 GENERAL AND MISCELLANEOUS↗

An Adaptive Sparse-Grid High-Order Stochastic Collocation Method for Bayesian Inference in Groundwater Reactive Transport Modeling

Although Bayesian analysis has become vital to the quantification of prediction uncertainty in groundwater modeling, its application has been hindered due to the computational cost associated with numerous model executions needed for exploring the posterior probability density function (PPDF) of model parameters. This is particularly the case when the PPDF is estimated using Markov Chain Monte Carlo (MCMC) sampling. In this study, we develop a new approach that improves computational efficiency of Bayesian inference by constructing a surrogate system based on an adaptive sparse-grid high-order stochastic collocation (aSG-hSC) method. Unlike previous works using first-order hierarchical basis, we utilize a compactly supported higher-order hierar- chical basis to construct the surrogate system, resulting in a significant reduction in the number of computational simulations required. In addition, we use hierarchical surplus as an error indi- cator to determine adaptive sparse grids. This allows local refinement in the uncertain domain and/or anisotropic detection with respect to the random model parameters, which further improves computational efficiency. Finally, we incorporate a global optimization technique and propose an iterative algorithm for building the surrogate system for the PPDF with multiple significant modes. Once the surrogate system is determined, the PPDF can be evaluated by sampling the surrogate system directly with very little computational cost. The developed method is evaluated first using a simple analytical density function with multiple modes and then using two synthetic groundwater reactive transport models. The groundwater models represent different levels of complexity; the first example involves coupled linear reactions and the second example simulates nonlinear ura- nium surface complexation. The results show that the aSG-hSC is an effective and efficient tool for Bayesian inference in groundwater modeling in comparison with conventional MCMC sim- ulations. The computational efficiency is expected to be more beneficial to more computational expensive groundwater problems.

Zhang, Guannan↗

Design of Experiments, Model Calibration and Data Assimilation

This presentation provides an overview of emulation, calibration and experiment design for computer experiments. Emulation refers to building a statistical surrogate from a carefully selected and limited set of model runs to predict unsampled outputs. The standard kriging approach to emulation of complex computer models is presented. Calibration refers to the process of probabilistically constraining uncertain physics/engineering model inputs to be consistent with observed experimental data. An initial probability distribution for these parameters is updated using the experimental information. Markov chain Monte Carlo (MCMC) algorithms are often used to sample the calibrated parameter distribution. Several MCMC algorithms commonly employed in practice are presented, along with a popular diagnostic for evaluating chain behavior. Space-filling approaches to experiment design for selecting model runs to build effective emulators are discussed, including Latin Hypercube Design and extensions based on orthogonal array skeleton designs and imposed symmetry requirements. Optimization criteria that further enforce space-filling, possibly in projections of the input space, are mentioned. Designs to screen for important input variations are summarized and used for variable selection in a nuclear fuels performance application. This is followed by illustration of sequential experiment design strategies for optimization, global prediction, and rare event inference.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗