Search NASA⌕ Search

SEARCH · Search NASA

Results for “hierarchical 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

Remarks on Hierarchic Control for a Linearized Micropolar Fluids System in Moving Domains

We study a Stackelberg strategy subject to the evolutionary linearized micropolar fluids equations in domains with moving boundaries, considering a Nash multi-objective equilibrium (non necessarily cooperative) for the “follower players” (as is called in the economy field) and an optimal problem for the leader player with approximate controllability objective. We will obtain the following main results: the existence and uniqueness of Nash equilibrium and its characterization, the approximate controllability of the linearized micropolar system with respect to the leader control and the existence and uniqueness of the Stackelberg–Nash problem, where the optimality system for the leader is given.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Graphene oxide precursor effects on 3D-printed carbon scaffolds

Manganese oxide (MnO 2 ), an earth-abundant material, is a promising component for energy storage devices, with uses in both pseudocapacitors and batteries. However, high MnO 2 loading often leads to reduced performance due to poor ion diffusion. 3D printing, particularly using the direct ink writing (DIW) technique, offers a solution by enabling the fabrication of electrodes with hierarchical porous structures and open channels that enhance mass transport and ion diffusion. Previous work demonstrated that 3D-printed graphene aerogels with MnO 2 coatings exhibited excellent electrochemical performance, even with thick electrodes, due to their optimized structure. Building on this work, the current study investigates the performance differences between aerogels developed using graphene oxide (GO) and reduced graphene oxide (rGO) as carbon precursors. Both materials were incorporated into thixotropic inks, 3D-printed into lattice structures, and carbonized. Despite expected similarities between the final graphene aerogel, rGO-based aerogels exhibited superior areal capacitance, compared to GO-based aerogels. These differences are attributed to the lower oxygen content and defect density of rGO, which influence its interaction with cellulose viscosifiers in the ink formulation. Brunauer–Emmett–Teller (BET) surface area analysis revealed that rGO aerogels exhibit a larger surface area and mesoporous structure, further enhancing their performance. When coated with MnO 2 , rGO-based aerogels maintained their superior capacitive behavior over GO-based aerogels. This study highlights the effect of carbon precursor on the end performance of graphene aerogels.

Materials science↗

Designs for Risk Evaluation and Management

The Designs for Risk Evaluation and Management (DREAM) tool was developed as part of the effort to quantify the risk of geologic storage of carbon dioxide (CO 2 ) under the U.S. Department of Energy's National Risk Assessment Partnership (NRAP). DREAM is an optimization tool created to identify optimal monitoring schemes that minimize the time to first detection of CO 2 leakage from a subsurface storage formation. DREAM acts as a post-processer on user-provided output from subsurface leakage simulations. While DREAM was developed for CO 2 leakage scenarios, it is applicable to any subsurface leakage simulation of the same output format. The DREAM tool is comprised of three main components: (1) a Java wizard used to configure and execute the simulations, (2) a visualization tool to view the domain space and optimization results, and (3) a plotting tool used to analyze the results. A secondary Java application is provided to aid users in converting common American Standard Code for Information Interchange (ASCII) output data to the standard DREAM hierarchical data format (HDF5). DREAM employs a simulated annealing approach that searches the solution space by iteratively mutating potential monitoring schemes built of various configurations of monitoring locations and leak detection parameters. This approach has proven to be orders of magnitude faster than an exhaustive search of the entire solution space. The user's manual illustrates the program graphical user interface (GUI), describes the tool inputs, and includes an example application.

(Ruprecht) Yonkofski, Catherine↗

Decentralized hierarchical partitioning of centralized integrated controllers

A framework for a decentralized hierarchical controller partitioning structure is developed. This structure allows for the design of separate airframe and propulsion controllers which, when assembled, will meet the overall design criterion for the integrated airframe/propulsion system. An algorithm based on parameter optimization of the state-space representation for the subsystem controllers is described. The algorithm is currently being applied to an integrated flight propulsion control design example.

Schmidt, Phillip↗

Structural understanding of stabilization patterns in engineered bispecific Ig-like antibody molecules

Bispecific immunoglobulin-like antibodies capable of engaging multiple antigens represent a promising new class of therapeutic agents. Engineering of these molecules requires optimization of the molecular properties of one of the domain components. Here, we present a detailed crystallographic and computational characterization of the stabilization patterns in the lymphotoxin-beta receptor (LT{beta}R) binding Fv domain of an anti-LT{beta}R/anti-TNF-related apoptosis inducing ligand receptor-2 (TRAIL-R2) bispecific immunoglobulin-like antibody. We further describe a new hierarchical structure-guided approach toward engineering of antibody-like molecules to enhance their thermal and chemical stability.

59 BASIC BIOLOGICAL SCIENCES↗

Bit-GraphBLAS: Bit-Level Optimizations of Matrix-Centric Graph Processing on GPU

In the graph data structure like adjacency matrix, the connectivity of two nodes can be sufficiently represented using only 1 bit, but they are generally treated as 32-bit full-precision in state-of-the-art graph frameworks to adopt common sparse format such as CSR. Meanwhile, bit-level parallelism has recently be explored to have high-performance potential and low storage requirement on GPUs with dense bit-tiles. To fill the gap, our solution is a hierarchical storage format that contains the bit-indexing base and dense bit-tile units. Inherently, the granularity of the bit-tile is an essential factor in achieving both storage compression and GPU parallelism. How to find a sweet spot that trades off between avoiding sparsity and exploiting is comprehensively researched in this work. In the experiment, we evaluate the proposed storage format and algorithms on modern generation GPUs, including Pascal and Volta, to figure out critical software co-designs in conjunction with existing hardware-specific optimization.

Chen, Jou-An↗

Digital Light Process 3D Printing of Magnetically Aligned Liquid Crystalline Elastomer Free–forms

Liquid crystalline elastomers (LCEs) are anisotropic soft materials capable of large dimensional changes when subjected to a stimulus. The magnitude and directionality of the stimuli-induced thermomechanical response is associated with the alignment of the LCE. Recent reports detail the preparation of LCEs by additive manufacturing (AM) techniques, predominately using direct ink write printing. Another AM technique, digital light process (DLP) 3D printing, has generated significant interest as it affords LCE free-forms with high fidelity and resolution. However, one challenge of printing LCEs using vat polymerization methods such as DLP is enforcing alignment. Here, we document the preparation of aligned, main-chain LCEs via DLP 3D printing using a 100 mT magnetic field. Systematic examination isolates the contribution of magnetic field strength, alignment time, and build layer thickness on the degree of orientation in 3D printed LCEs. Informed by this fundamental understanding, DLP is used to print complex LCE free-forms with through-thickness variation in both spatial orientations. Further, the hierarchical variation in spatial orientation within LCE free-forms is used to produce objects that exhibit mechanical instabilities upon heating. DLP printing of aligned LCEs opens new opportunities to fabricate stimuli-responsive materials in form factors optimized for functional use in soft robotics and energy absorption.

36 MATERIALS SCIENCE↗

Hierarchical Modeling and Statistical Calibration for Photometric Redshifts

The cosmological exploitation of modern photometric galaxy surveys requires both accurate (unbiased) and precise (narrow) redshift probability distributions derived from broadband photometry. Existing methodologies do not meet these requirements. Standard template fitting delivers interpretable models and errors, but lacks the flexibility to learn inaccuracies in the observed photometry or spectral templates. Machine learning addresses those issues, but requires representative training data, and the resulting models and uncertainties cannot be interpreted in the context of a physical model or outside of the training data. We present a hierarchical modeling approach simultaneously addressing the issues of flexibility, interpretability, and generalization. It combines template fitting with flexible (machine-learning-like) models to correct the spectral templates, model their redshift distributions, and recalibrate the photometric observations. By optimizing the full posterior distribution of the model and solving for its (thousands of) parameters, one can perform a global statistical calibration of the data and the spectral energy distribution (SED) model. We apply this approach to the public Dark Energy Survey Science Verification data and show that it provides more accurate and compact redshift posterior distributions than existing methods, as well as insights into residual photometric and SED systematics. Here, the model is causal and makes predictions for future data (e.g., additional photometric bandpasses), and its internal parameters and components are interpretable. This approach does not formally require the training data to be complete or representative; in principle, it can even work in regimes in which few or no spectroscopic redshifts are available.

79 ASTRONOMY AND ASTROPHYSICS↗

Data system architecture considerations for a space station

The functions that a space station could serve are outlined and details of the data systems requirements are discussed. The data system design will be guided by an overall space systems plan, and will feature distributed, layered architecture, user friendliness, hierarchical control, technology transparency, standard interfaces, and automated engineering tools. The station would begin with a limited core capability and evolve to serve functions defined thereafter. The automation of the engineering tools will be necessary to permit an optimized, minimized crew to control all functions of the space station, while at the same time freeing the crew from being actively involved in maintaining the nominal life support functions of the equipment. One major criterion is that the software must be error free, while another is adaptibility to changing space station configurations and demands.

Connell, E. B.↗

Adapting Wave-front Algorithms to Efficiently Utilize Systems with Deep Communication Hierarchies

Large-scale systems increasingly exhibit a differential between intra-chip and inter-chip communication performance especially in hybrid systems using accelerators. Processorcores on the same socket are able to communicate at lower latencies, and with higher bandwidths, than cores on different sockets either within the same node or between nodes. A key challenge is to efficiently use this communication hierarchy and hence optimize performance. We consider here the class of applications that contains wavefront processing. In these applications data can only be processed after their upstream neighbors have been processed. Similar dependencies result between processors in which communication is required to pass boundary data downstream and whose cost is typically impacted by the slowest communication channel in use. In this work we develop a novel hierarchical wave-front approach that reduces the use of slower communications in the hierarchy but at the cost of additional steps in the parallel computation and higher use of on-chip communications. This tradeoff is explored using a performance model. An implementation using the Reverse-acceleration programming model on the petascale Roadrunner system demonstrates a 27% performance improvement at full system-scale on a kernel application. The approach is generally applicable to large-scale multi-core and accelerated systems where a differential in system communication performance exists.

43 PARTICLE ACCELERATORS↗

Reconfigurable Model Execution in the OpenMDAO Framework

NASA's OpenMDAO framework facilitates constructing complex models and computing their derivatives for multidisciplinary design optimization. Decomposing a model into components that follow a prescribed interface enables OpenMDAO to assemble multidisciplinary derivatives from the component derivatives using what amounts to the adjoint method, direct method, chain rule, global sensitivity equations, or any combination thereof, using the MAUD architecture. OpenMDAO also handles the distribution of processors among the disciplines by hierarchically grouping the components, and it automates the data transfer between components that are on different processors. These features have made OpenMDAO useful for applications in aircraft design, satellite design, wind turbine design, and aircraft engine design, among others. This paper presents new algorithms for OpenMDAO that enable reconfigurable model execution. This concept refers to dynamically changing, during execution, one or more of: the variable sizes, solution algorithm, parallel load balancing, or set of variables-i.e., adding and removing components, perhaps to switch to a higher-fidelity sub-model. Any component can reconfigure at any point, even when running in parallel with other components, and the reconfiguration algorithm presented here performs the synchronized updates to all other components that are affected. A reconfigurable software framework for multidisciplinary design optimization enables new adaptive solvers, adaptive parallelization, and new applications such as gradient-based optimization with overset flow solvers and adaptive mesh refinement. Benchmarking results demonstrate the time savings for reconfiguration compared to setting up the model again from scratch, which can be significant in large-scale problems. Additionally, the new reconfigurability feature is applied to a mission profile optimization problem for commercial aircraft where both the parametrization of the mission profile and the time discretization are adaptively refined, resulting in computational savings of roughly 10% and the elimination of oscillations in the optimized altitude profile.

Hwang, John T.↗

Economical and Engineering Aspects of Proactive Demand Participation: Centralized versus Bilateral Control Structure

The electric grid of the U.S. is evolving from a system characterized by large and centralized fossil-fueled power plants and passive customers to a network with high penetration of distributed energy resources and proactive customers. This project facilitated the evolution of the U.S. electric power grid by enabling proactive participation of demands in electricity market at the power distribution system level. This project has three major achievements. First, we designed a centralized distribution system operator managed electricity market and developed a three-phase alternating current optimal power flow algorithm to coordinate the operation of large-scale flexible loads and distributed energy resources. Second, we designed a decentralized bilateral coordinate framework for retail electricity market, where each participating customer is capable of making decisions regarding energy production and consumption based on information received from transactive neighbors. Third, the impacts of centralized and decentralized demand-side participation scheme on power system operations were evaluated with both large-scale simulations and hardware-in-the-loop demonstrations. The major activities and specific accomplishments of the technical tasks are summarized in Section II. The detailed design of centralized/hierarchical and decentralized/bilateral retail electricity markets and the comparison between the two markets are described in Section III. The accomplishments and conclusions of the project are presented in Section IV. The major findings of the project falls into three areas, hierarchical distribution system operator managed electricity market, bilateral electricity market and decentralized market coordination, and comparison of centralized and decentralized market coordination mechanisms. In the area of hierarchical distribution system operator managed electricity market design, an integrated wholesale and retail electricity market was shown to be highly effective in extracting the operational flexibility from distributed energy resources to provide services to the wholesale market. A chordal conversion based convex iteration algorithm is not only computationally efficiency but also achieves global optimal solution in coordinating the operations of a large number of heterogeneous distributed energy resources.In the area of decentralized market coordination approach, we showed that bilateral transactions among proactive customers and decentralized transaction clearing mechanism based on simultaneous second-price sealed-bid auction can encourage truthful bidding strategies from the market participations. In addition, the individual customers can rely on a portfolio optimization approach to maximize their returns while minimizing risks. In the area of comparison of centralized and decentralized market coordination mechanisms, we found that the centralized market design results in higher social welfare and lower wholesale market clearing price for electricity. In general, centralized market design favors distributed energy resources and fixed loads. The decentralized market design mostly benefits flexible loads and conventional generators.

29 ENERGY PLANNING, POLICY, AND ECONOMY↗

Dual Channel Dual Staging: Hierarchical and Portable Staging for GPU-Based In-Situ Workflow

In-situ workflows have emerged as an attractive approach for addressing data movement challenges at very large scales. Since GPU-based architectures dominate the HPC landscapes, porting these in-situ workflows, and, specifically, the inter-application data exchange, to GPU-based systems can be challenging. Technologies such as GPUDirect RDMA (GDR), which is typically used for I/O in GPU applications as an optimization that circumvents the CPU overhead, can be leveraged to support bulk data exchanges between GPU applications. However, current GDR design often lacks performance portability across HPC clusters built with different hardware configurations. Furthermore, the local CPU may also be effectively used as an auxiliary communication mechanism to offload data exchanges. In this paper, we present a dual channel dual staging approach for efficient, scalable, and performance-portable inter-application data exchange for in-situ workflows. This approach exploits the data access pattern within in-situ workflows along with the inherent execution asynchrony to accelerate data exchanges and, at the same time, improve performance portability. Specifically, the dual channel dual staging method leverages both the local CPU and the remote data staging server to build a hierarchical joint staging area and uses this staging area to transform blocking inter-application bulk data exchanges into best-effort local data movements between GPU and CPU. The dual channel dual staging is implemented as a portability extension of the Dataspaces-GPU staging framework. We present an experimental evaluation of its performance, portability, and scalability using this implementation on three leadership GPU clusters. The evaluation results demonstrate that the dual channel dual staging method saves up to 75% in data-exchange time compared to host-based, GDR, and alternate portable designs, while maintaining scalability (up to 512 GPUs) and performance portability across the three platforms.

Zhang, Bo [University of Utah]↗

On Developing a Taxonomy for Multidisciplinary Design Optimization: A Decision-Based Perspective

In this paper, we approach MDO from a Decision-Based Design (DBD) perspective and explore classification schemes for designing complex systems and processes. Specifically, we focus on decisions, which are only a small portion of the Decision Support Problem (DSP) Technique, our implementation of DBD. We map coupled nonhierarchical and hierarchical representations from the DSP Technique into the Balling-Sobieski (B-S) framework (Balling and Sobieszczanski-Sobieski, 1994), and integrate domain-independent linguistic terms to complete our taxonomy. Application of DSPs to the design of complex, multidisciplinary systems include passenger aircraft, ships, damage tolerant structural and mechanical systems, and thermal energy systems. In this paper we show that Balling-Sobieski framework is consistent with that of the Decision Support Problem Technique through the use of linguistic entities to describe the same type of formulations. We show that the underlying linguistics of the solution approaches are the same and can be coalesced into a homogeneous framework with which to base the research, application, and technology MDO upon. We introduce, in the Balling-Sobieski framework, examples of multidisciplinary design, namely, aircraft, damage tolerant structural and mechanical systems, and thermal energy systems.

Lewis, Kemper↗

A Method for Producing Hierarchical and Statistically Calibrated Predictions of Nuclear Material Properties from Existing Models

Computer vision-based analysis of micrographs of nuclear materials is an emerging technique for property prediction, synthetic route identification, and other material analysis tasks. These analysis tasks play a pivotal role in many material characterization applications such as signature development for treaty verification, process optimization, etc. The backbone in many of the recent computer vision-based techniques is a deep learning model, which takes a fixed-size set of pixels and provides a class prediction for that set of pixels. For example, previous work developed a deep convolutional neural network (CNN) to predict the synthetic route from a 256 px x 256 px patch taken from a larger image of uranium ore concentrates. In this work, we present several methods for first calibrating these models in a manner that they can provide accurate probabilities of their predictions’ veracity, and several methods of combining these probabilities. Overall, the combination of these two steps into a pipeline allows for full-image and even full-sample (where a sample has many images) predictions with associated confidence values. Finally, we show that one can also use the patch predictions and confidence to produce a visualization to map predicted constituents through the image. Results and examples for predicting and mapping uranium ore concentrates’ synthetic process from imagery will be presented.

artificial intelligence↗

Stabilizing Ni-rich layered cathode for high-voltage operation through hierarchically heterogeneous doping with concentration gradient

High-nickel LiNi x Mn y Co 1-x-y O 2 (NMC) cathodes have demonstrated superior energy density, yet their stability is compromised under high voltage conditions. To address this, here we propose a strategy of heterogeneous doping with a concentration gradient, specifically through Sr–Zr co-modification. We synthesized Ni-rich NMC particles featuring several micron-sized secondary particles composed of micron-sized primary grains. This design aims to harness the structural robustness of single-crystalline grains and the favorable diffusion kinetics of polycrystalline secondary particles. Systematic characterization using a combination of electrochemical measurements and synchrotron analytics reveals an intriguing pattern of hierarchically heterogeneous Sr–Zr co-doping. It demonstrates a depth-dependent concentration gradient at the secondary particle level and competing dopant segregation over the buried grain boundaries. This unique characteristic creates opportunities for enhancing battery performance, particularly by optimizing precursors and implementing advanced modulation techniques. We also investigate the dissolution and precipitation of the cathode's transition metal cations upon high-voltage cycling. These insights suggest that a tailored compositional variation can be a viable approach to effectively design the next-generation high-Ni NMC cathode materials for high-voltage lithium batteries.

36 MATERIALS SCIENCE↗

Structure- and Physics-Preserving Reductions of Power Grid Models

The large size of multiscale, distribution and transmission, power grids hinders fast systemwide estimation and real-time control and optimization of operations. This paper studies graph reduction methods of power grids that are favorable for fast simulations and follow-up applications. While the classical Kron reduction has been successful in reduced order modeling of power grids with traditional, hierarchical design, the selection of reference nodes for the reduced model in a multiscale, distribution and transmission, network becomes ambiguous. In this work we extend the use of the iterative Kron reduction by utilizing the electric grid's graph topology for the selection of reference nodes, consistent with the design features of multiscale networks. Additionally, we propose further reductions by aggregation of coherent subnetworks of triangular meshes, based on the graph topology and network characteristics, in order to preserve currents and build another power-flow equivalent network. Our reductions are achieved through the use of iterative aggregation of subgraphs that include general tree structures, lines, and triangles. Important features of our reduction algorithms include that (i) the reductions are either equivalent to the Kron reduction or otherwise produce a power-flow equivalent network; (ii) due to the mentioned power-flow equivalence, the reduced network can model the dynamic of the swing equations for a lossless, inductive, steady state network; (iii) the algorithms efficiently utilize hash tables to store the sequential reduction steps. The third feature allows for easy reintroduction of detailed models into the reduced, conceptual network and makes the final reduced order model backward compatible with a sequence of intermediate, partially reduced networks with varying resolution---the ordered sequence of iterative reductions corresponds to a sequence of reduced order models. The performance of our graph reduction algorithms and features of the reduced grids are discussed on a real-word transmission and distribution grid. We produce visualizations of the reduced models through open source libraries and release our reduction algorithms with example code and toy data.

24 POWER TRANSMISSION AND DISTRIBUTION↗

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↗