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 325 records · Page 18

Minimum local distance density estimation

We present a local density estimator based on first-order statistics. To estimate the density at a point, $x$, the original sample is divided into subsets and the average minimum sample distance to $x$ over all such subsets is used to define the density estimate at $x$. The tuning parameter is thus the number of subsets instead of the typical bandwidth of kernel or histogram-based density estimators. The proposed method is similar to nearest-neighbor density estimators but it provides smoother estimates. We derive the asymptotic distribution of this minimum sample distance statistic to study globally optimal values for the number and size of the subsets. Simulations are used to illustrate and compare the convergence properties of the estimator. The results show that the method provides good estimates of a wide variety of densities without changes of the tuning parameter, and that it offers competitive convergence performance.

97 MATHEMATICS AND COMPUTING↗

Functionally graded magnetic materials: a perspective to advance charged particle optics through compositional engineering

Additive manufacturing has ushered in a new paradigm of bottom-up materials-by-design of spatially non-uniform materials. Functionally graded materials have locally tailored compositions to provide optimized global properties and performance. In this letter, we propose an opportunity for the application of graded magnetic materials as lens elements for charged particle optics. A Hiperco50/Hymu80 (FeCo-2 V/Fe-80Ni-5Mo) graded magnetic alloy was successfully additively manufactured via Laser Directed Energy Deposition with spatially varying magnetic properties. The compositional gradient is then applied using computational simulations to demonstrate how a tailored material can enhance the magnetic performance of a critical, image-forming component of a transmission electron microscope.

36 MATERIALS SCIENCE↗

Phase retrieval and reconstruction of coherent synthesis by genetic algorithm

Abstract In the context of diffractive optics, phase retrieval is a heavily investigated process of recreating an entire complex electric field from partial amplitude-only information through iterative algorithms. However, existing methods can fall into local minima during reconstructions or struggle to recover unusual and novel electric field distributions. We present a numerical method based on a global-optimization genetic algorithm that reconstructs non-trivial electric field distributions from single diffracted intensity distributions. Diffraction and propagation of the optical fields over arbitrary distances is modeled through implementation of the angular spectrum technique. Additionally, a coherently-locked laser array system is used as an experimental case-study demonstrating 0.09 π phase reconstruction accuracy of initial laser parameters from single intensity images.

59 BASIC BIOLOGICAL SCIENCES↗

MTUQ: a framework for estimating moment tensors, point forces, and their uncertainties

SUMMARY We introduce MTUQ, an open-source Python package for seismic source estimation and uncertainty quantification, emphasizing flexibility and operational scalability. MTUQ provides MPI-parallelized grid search and global optimization capabilities, compatibility with 1-D and 3-D Green’s function database formats, customizable data processing, C-accelerated waveform and first-motion polarity misfit functions, and utilities for plotting seismic waveforms and visualizing misfit and likelihood surfaces. Applicability to a range of full- and constrained-moment tensor, point force, and centroid inversion problems is possible via a documented application programming interface, accompanied by example scripts and integration tests. We demonstrate the software using three different types of seismic events: (1) a 2009 intraslab earthquake near Anchorage, Alaska; (2) an episode of the 2021 Barry Arm landslide in Alaska; and (3) the 2017 Democratic People’s Republic of Korea underground nuclear test. With these events, we illustrate the well-known complementary character of body waves, surface waves, and polarities for constraining source parameters. We also convey the distinct misfit patterns that arise from each individual data type, the importance of uncertainty quantification for detecting multimodal or otherwise poorly constrained solutions, and the software’s flexible, modular design.

58 GEOSCIENCES↗

Direct structural retrieval from gas-phase ultrafast diffraction data using a genetic algorithm

Ultrafast scattering techniques such as ultrafast electron diffraction and ultrafast x-ray diffraction have been utilized to elucidate the structural dynamics, reaction intermediates, and final products in molecular reactions following photoexcitation. The time-dependent structures are typically not directly retrieved from the experimental data, but they rely on comparison with calculations. The genetic algorithm (GA), a global optimization strategy, can be used to retrieve the molecular structures directly from diffraction patterns without any theoretical input. However, the robustness of the GA with respect to real experimental conditions such as a limited momentum transfer range, noise, and artifacts has not been studied in detail. In this work, we characterize the performance of the GA with simulated data that mimic realistic experimental conditions. We have developed and implemented a variant of the GA specific to diffraction measurements which performs better in the presence of imperfect data compared to the standard implementation of the GA. We demonstrate this method with both synthetic data and experimental ultrafast electron diffraction data on the UV-induced photodissociation of trifluoroiodomethane (C⁢F 3⁡ I) molecules.

74 ATOMIC AND MOLECULAR PHYSICS↗

The nanostructure problem

Diffraction techniques are making progress in tackling the difficult problem of solving the structures of nanoparticles and nanoscale materials. The great gift of x-ray crystallography has made us almost complacent in our ability to locate the three-dimensional coordinates of atoms in a crystal with a precision of around 10{sup -4} nm. However, the powerful methods of crystallography break down for structures in which order only extends over a few nanometers. In fact, as we near the one hundred year mark since the birth of crystallography, we face a resilient frontier in condensed matter physics: our inability to routinely and robustly determine the structure of complex nanostructured and amorphous materials. Knowing the structure and arrangement of atoms in a solid is so fundamental to understanding its properties that the topic routinely occupies the early chapters of every solid-state physics textbook. Yet what has become clear with the emergence of nanotechnology is that diffraction data alone may not be enough to uniquely solve the structure of nanomaterials. As part of a growing effort to incorporate the results of other techniques to constrain x-ray refinements - a method called 'complex modeling' which is a simple but elegant approach for combining information from spectroscopy with diffraction data to solve the structure of several amorphous and nanostructured materials. Crystallography just works, so we rarely question how and why this is so, yet understanding the physics of diffraction can be very helpful as we consider the nanostructure problem. The relationship between the electron density distribution in three dimensions (i.e., the crystal structure) and an x-ray diffraction pattern is well established: the measured intensity distribution in reciprocal space is the square of the Fourier transform of the autocorrelation function <{rho}(r){rho}(r+r')> of the electron density distribution {rho}(r). The fact that we get the autocorrelation function (rather than just the density distribution) by Fourier transforming the measured intensity leaves us with a very tricky inverse problem: we have to extract the density from its autocorrelation function. The direct problem of predicting the diffraction intensity given a particular density distribution is trivial, but the inverse, unraveling from the intensity distribution the density that gives rise to it, is a highly nontrivial problem in global optimization. In crystallography, this challenging, nontrivial task is sometimes referred to as the 'phase problem.' The diffraction pattern is a wave-interference pattern, but we measure only the intensities (the squares of the waves) not the wave amplitudes. To get the amplitude, you take the square root of the intensity I, but in so doing you lose any knowledge of the phase of the wave {phi}, and half the information needed to reconstruct the density is lost. When solving such inverse problems, you hope you can start with a uniqueness theorem that reassures you that, under ideal conditions, there is only one solution: one density distribution that corresponds to the measured intensity. Then you have to establish that your data set contains sufficient information to constrain that unique solution. This is a problem from information theory that originated with Reverend Thomas Bayes work in the 18th century, and the work of Nyquist and Shannon in the 20 th century, and describes the fact that the degrees of freedom in the model must not exceed the number of pieces of independent information in the data. Finally, you need an efficient algorithm for doing the reconstruction. This is exactly how crystallography works. The information is in the form of Bragg peak intensities and the degrees of freedom are the atomic coordinates. Crystal symmetry lets us confine the model to the contents of a unit cell, rather than all of the atoms in the crystal, keeping the degrees of freedom admirably small in number. A measurement yields a multitude of Bragg peak intensities, providing ample redundant intensity information to make up for the lost phases. Finally, there are highly efficient algorithms, such as 'direct methods,' that make excellent use of the available information and constraints to find the solution quickly from a horrendously large search space. The problem is often so overconstrained that we can cavalierly throw away lots of directional information. In particular, even though Bragg peaks are orientationally averaged to a 1D function in a powder diffraction measurement, we still can get a 3D structural solution. Now it becomes easy to understand the enormous challenge of solving nanostructures: the information content in the data is degraded while the complexity of the model is much greater.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Symmetric Rydberg controlled- Z gates with adiabatic pulses

We analyze neutral atom Rydberg C Z gates based on adiabatic pulses applied symmetrically to both atoms. Analysis with smooth pulse shapes and Cs atom parameters predicts the gates can create Bell states with fidelity F > 0.999 using adiabatic rapid passage (ARP) pulses. With globally optimized adiabatic pulse shapes, in a two-photon excitation process, we generate Bell states with fidelity F = 0.997. The analysis fully accounts for spontaneous emission from intermediate and Rydberg states, including the Rydberg lifetime in a room temperature environment, but does not include errors arising from laser noise. In conclusion, the gate protocols do not require individual addressing and are shown to be robust against Doppler shifts due to atomic motion.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Structure and dynamics of ion clusters in linear octupole traps: Phase diagrams, chirality, and melting mechanisms

The stable structures and melting dynamics of clusters of identical ions bound by linear octupole radiofrequency traps are theoretically investigated by global optimization methods and molecular dynamics simulations. By varying the cluster sizes in the range of 10-1000 ions and the extent of trap anisotropy by more than one order of magnitude, we find a broad variety of stable structures based on multiple rings at small sizes evolving into tubular geometries at large sizes. The binding energy of these clusters is well represented by two contributions arising from isotropic linear and octupolar traps. The structures generally exhibit strong size effects, and chiral arrangements spontaneously emerge in many crystals. Sufficiently large clusters form nested, coaxial tubes with different thermal stabilities. As in isotropic octupolar clusters, the inner tubes melt at temperatures that are lower than the overall melting point.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

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↗