Search NASA⌕ Search

SEARCH · Search NASA

Results for “program optimizations”

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,387 records · Page 77
All sourcesNASA NTRSDOE OSTI
DOE OSTI2021

Efficient Topology Design Algorithms for Power Grid Stability

The dynamic response of power grids to small disturbances influences their overall stability. This letter examines the effect of network topology on the linearized time-invariant dynamics of electric power systems. The proposed framework utilizes H 2 -norm based stability metrics to study the optimal placement of lines on existing networks as well as the topology design of new networks. The design task is first posed as an NP-hard mixed-integer nonlinear program (MINLP) that is exactly reformulated as a mixed-integer linear program (MILP) using McCormick linearization. To improve computation time, graph-theoretic properties are exploited to derive valid inequalities (cuts) and tighten bounds on the continuous optimization variables. Moreover, a cutting plane generation procedure is put forth that is able to interject the MILP solver and augment additional constraints to the problem on-the-fly. Finally, the efficacy of our approach in designing optimal grid topologies is demonstrated through numerical tests on the IEEE 39-bus network.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2015

Inconsistent Investment and Consumption Problems

In a traditional Black–Scholes market we develop a verification theorem for a general class of investment and consumption problems where the standard dynamic programming principle does not hold. The theorem is an extension of the standard Hamilton–Jacobi–Bellman equation in the form of a system of non-linear differential equations. We derive the optimal investment and consumption strategy for a mean-variance investor without pre-commitment endowed with labor income. In the case of constant risk aversion it turns out that the optimal amount of money to invest in stocks is independent of wealth. The optimal consumption strategy is given as a deterministic bang-bang strategy. In order to have a more realistic model we allow the risk aversion to be time and state dependent. Of special interest is the case were the risk aversion is inversely proportional to present wealth plus the financial value of future labor income net of consumption. Using the verification theorem we give a detailed analysis of this problem. It turns out that the optimal amount of money to invest in stocks is given by a linear function of wealth plus the financial value of future labor income net of consumption. The optimal consumption strategy is again given as a deterministic bang-bang strategy. We also calculate, for a general time and state dependent risk aversion function, the optimal investment and consumption strategy for a mean-standard deviation investor without pre-commitment. In that case, it turns out that it is optimal to take no risk at all.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2019

Proactive Data Containers for Scientific Storage (Final Report)

Emerging HPC systems are expected to be deployed with an unprecedented level of complexity, due to a deep system memory/storage hierarchy and heterogeneity of the storage hardware. This hierarchy is expected to range from CPU cache through several levels of volatile memory to nonvolatile memory, traditional hard disks, and tape. Simple and efficient methods of data management and movement through this hierarchy is critical for scientific applications using exascale systems. Existing storage system and I/O (SSIO) technologies face severe challenges in dealing with these requirements. POSIX and MPI I/O standards that are the basis for existing I/O libraries and parallel file systems present fundamental challenges in the areas of scalable metadata operations, semantics-based data movement performance tuning, asynchronous operation, and support for scalable consistency of distributed operations. Moving toward new paradigms for SSIO in the extreme-scale era, we have proposed to investigate novel object-based data abstractions and storage mechanisms that take advantage of the deep storage hierarchy and enable proactive automated performance tuning. In order to achieve these overarching goals, we initiated an effort to develop a fundamental new data abstraction, called Proactive Data Containers (PDC). A PDC is a container within a locus of storage (memory, NVRAM, disk, etc.) that stores science data in an object-centric manner. Managing data as objects enables powerful optimization opportunities for data movement and transformations. The R&D focus of this project are: 1) formulation of object-oriented PDCs and their mapping in different levels of the exascale storage hierarchy; 2) efficient strategies for moving data in deep storage hierarchies using PDCs; 3) techniques for transforming and reorganizing data based on application requirements; and 4) novel analysis paradigms for enabling data transformations and user-defined analysis on data in PDCs. Toward achieving these overarching goals, we designed an object-centric application programing interface (API) for HPC, scalable metadata management for object-centric storage systems, and data movement optimizations such as Data Elevator for moving data between two levels of storage devices and TAPIOCA for efficient aggregation of data on compute nodes. We then implemented several components of the PDC system. They include metadata management, data placement services, remote procedure calls, data aggregation, etc. We have put them together into the overall PDC framework.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2016

SMT-Aware Instantaneous Footprint Optimization

Modern architectures employ simultaneous multithreading (SMT) to increase thread-level parallelism. SMT threads share many functional units and the whole memory hierarchy of a physical core. Without a careful code design, SMT threads can easily contend with each other for these shared resources, causing severe performance degradation. Minimizing SMT thread contention for HPC applications running on dedicated platforms is very challenging, because they usually spawn threads within Single Program Multiple Data (SPMD) models. To address this important issue, we introduce a simple scheme for SMT-aware code optimization, which aims to reduce the memory contention across SMT threads.

Instantaneous Footprint↗
DOE OSTI2022

FORCE-DISPATCHES Integration - Initial Demonstration

Integrated energy systems (IES) combine, in mutually beneficial ways, power from variable renewable energy sources and nuclear power plants (NPP) to improve economic viability under uncertain market and weather conditions. The open-source Framework for Optimization of Resources and Economics (FORCE) tool suite, developed at Idaho National Laboratory (INL), has enabled comprehensive modeling and simulation of IES. The capabilities within FORCE include grid portfolio optimization through the Holistic Energy Resource Optimization Network (HERON) and the transient process model analysis library HYBRID, among others. Continuous efforts and investments from the IES programs have been made to expand and improve the versatility of the FORCE toolset in fiscal year 2022. Code-coupling and cross-tool communication have been important methods for improving this versatility. This report focuses on an additional workflow in the HERON tool for capacity and dispatch stochastic optimization through integration with the external tool Design Integration and Synthesis Platform to Advance Tightly Coupled Hybrid Energy Systems (DISPATCHES). DISPATCHES was primarily developed by the National Energy Technology Laboratory, in collaboration with other national laboratories, which included INL, universities, and industry partners. It is coupled to a library of algebraic models for specific plant components, and to a framework for stochastic optimization different from that provided in the current Risk Analysis Virtual Environment (RAVEN)-running-RAVEN algorithm in HERON. HERON currently conducts stochastic optimization via an outer-inner loop: it optimizes over variable capacity on the outer loop, and at each step within the capacity parameter space, conducts an inner optimization over scenarios (of market signals, demand, and/or weather patterns) and hourly dispatch throughout a user-specified number of years. On the other hand, DISPATCHES conducts stochastic optimization via an “all-at-once” strategy in which capacity variables are optimized at the same level as dispatch variables, as all scenarios are considered at once. The latter method works especially well for projects of limited size and project length, as the necessary computational power and memory increases with the number of variables and scenarios. The new capability to use the DISPATCHES workflow in HERON enhances standalone simulations by leveraging FORCE tools—namely, the economic metrics from the Tool for Economic Analysis (TEAL) and reduced-order model (ROM) sampling from RAVEN. The initial demonstration of the DISPATCHES workflow simulates an existing nuclear-case flowsheet within the DISPATCHES repository—this models a NPP with a secondary revenue stream for hydrogen production. Electrical output from the plant is converted to hydrogen via a proton-exchange membrane (PEM) electrolyzer, hydrogen tanks are used for storage, and an additional turbine is added for hydrogen combustion. Continued work regarding this FORCE-DISPATCHES integration will include automatic generation of DISPATCHES models from HERON inputs, offering analysts the option of using either the RAVEN-runsRAVEN or DISPATCHES workflow to solve technoeconomic optimization problems.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2017

Optimizing fusion PIC code performance at scale on Cori Phase 2

In this paper we present the results of optimizing the performance of the gyrokinetic full-f fusion PIC code XGC1 on the Cori Phase Two Knights Landing system. The code has undergone substantial development to enable the use of vector instructions in its most expensive kernels within the NERSC Exascale Science Applications Program. We study the single-node performance of the code on an absolute scale using the roofline methodology to guide optimization efforts. We have obtained 2x speedups in single node performance due to enabling vectorization and performing memory layout optimizations. On multiple nodes, the code is shown to scale well up to 4000 nodes, near half the size of the machine. We discuss some communication bottlenecks that were identified and resolved during the work.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗
DOE OSTI2023

Potential Cooling Energy Savings of Economizer Control and Artificial-Neural-Network-Based Air-Handling Unit Discharge Air Temperature Control for Commercial Building

Heating, ventilation, and air-conditioning (HVAC) systems play a significant role in building energy consumption, accounting for around 50% of total energy usage. As a result, it is essential to explore ways to conserve energy and improve HVAC system efficiency. One such solution is the use of economizer controls, which can reduce cooling energy consumption by using the free-cooling effect. However, there are various types of economizer controls available, and their effectiveness may vary depending on the specific climate conditions. To investigate the cooling energy-saving potential of economizer controls, this study employs a dry-bulb temperature-based economizer control approach. The dry-bulb temperature-based control strategy uses the outdoor air temperature as an indicator of whether free cooling can be used instead of mechanical cooling. This study also introduces an artificial neural network (ANN) prediction model to optimize the control of the HVAC system, which can lead to additional cooling energy savings. To develop the ANN prediction model, the EnergyPlus program is used for simulation modeling, and the Python programming language is employed for model development. The results show that implementing a temperature-based economizer control strategy can lead to a reduction of 7.6% in annual cooling energy consumption. Moreover, by employing an ANN-based optimal control of discharge air temperature in air-handling units, an additional 22.1% of cooling energy savings can be achieved. In conclusion, the findings of this study demonstrate that the implementation of economizer controls, especially the dry-bulb temperature-based approach, can be an effective strategy for reducing cooling energy consumption in HVAC systems. Additionally, using ANN prediction models to optimize HVAC system controls can further increase energy savings, resulting in improved energy efficiency and reduced operating costs.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗
DOE OSTI2018

Simultaneous Process and Heat Exchanger Network Synthesis Using a Discrete Temperature Grid

We present mixed-integer linear programming models for utility targeting and heat exchanger network synthesis that account for variable stream temperatures and flow rates as well as unclassified streams and thus can be combined with process synthesis optimization models. By projecting temperature information onto a fixed discrete temperature grid, the model remains linear even under variable temperatures and flow rates, leading to a more tractable optimization model. The proposed model is well suited to address problems in the area of process intensification where the close interaction between different phenomena naturally leads to process synthesis problems with unclassified process streams. Several extensions are presented, including nonisothermal mixing as well as phase changes. Moreover, we show how a nonuniform grid can be adopted to reduce the complexity of the model for medium and large-size problems.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
DOE OSTI2015

TU-AB-201-04: Optimizing the Number of Catheter Implants and Their Tracks for Prostate HDR Brachytherapy

Purpose: In prostate HDR brachytherapy, interstitial implants are placed manually on the fly. The aim for this research is to develop a computer algorithm to find optimal and reliable implant trajectories using minimal number of implants. Methods: Our new algorithm mainly uses these key ideas: (1) positive charged static particles are uniformly placed on the surface of prostate and critical structures such as urethra, bladder, and rectum. (2) Positive charged kinetic particles are placed at a cross-section of the prostate with an initial velocity parallel to the principal implant direction. (3) The kinetic particles move through the prostate, interacting with each other, spreading out, while staying away from the prostate surface and critical structures. The initial velocity ensures that the trajectories observe the curvature constraints of typical implant procedures. (4) The finial trajectories of kinetic particles are smoothed using a third-degree polynomial regression, which become the implant trajectories. (5) The dwelling times and final dose distribution are calculated using least-distance programming. Results: (1) We experimented with previously treated cases. Our plan achieves all prescription goals while reducing the number of implants by 41%! Our plan also has less uniform target dose, which implies a higher dose is delivered to the prostate. (2) We expect future implant procedures will be performed under the guidance of such pre-calculated trajectories. To assess the applicability, we randomly perturb the tracks to mimic the manual implant errors. Our studies showed the impact of these perturbations are negligible, which is compensated by the least distance programming. Conclusions: We developed a new inverse planning system for prostate HDR therapy that can find optimal implant trajectories while minimizing the number of implants. For future work, we plan to integrate our new inverse planning system with an existing needle tracking system.

60 APPLIED LIFE SCIENCES↗
DOE OSTI2017

Sustainable Data Evolution Technology for Power Grid Optimization

The SDET Tool is used to create open-access power grid data sets and facilitate updates of these data sets by the community. Pacific Northwest National Laboratory (PNNL) and its power industry and software vendor partners are developing an innovative sustainable data evolution technology (SDET) to create open-access power grid datasets and facilitate updates to these datasets by the power grid community. The objective is to make this a sustained effort within and beyond the ARPA-E GRID DATA program so that the datasets can evolve over time and meet the current and future needs for power grid optimization and potentially other applications in power grid operation and planning.

Source record↗
DOE OSTI2017

Sustainable Data Evolution Technology for Power Grid Optimization

The SDET Tool is used to create open-access power grid data sets and facilitate updates of these data sets by the community. Pacific Northwest National Laboratory (PNNL) and its power industry and software vendor partners are developing an innovative sustainable data evolution technology (SDET) to create open-access power grid datasets and facilitate updates to these datasets by the power grid community. The objective is to make this a sustained effort within and beyond the ARPA-E GRID DATA program so that the datasets can evolve over time and meet the current and future needs for power grid optimization and potentially other applications in power grid operation and planning.

Source record↗
DOE OSTI2015

A Comparison of Genetic Programming Variants for Hyper-Heuristics

Modern society is faced with ever more complex problems, many of which can be formulated as generate-and-test optimization problems. General-purpose optimization algorithms are not well suited for real-world scenarios where many instances of the same problem class need to be repeatedly and efficiently solved, such as routing vehicles over highways with constantly changing traffic flows, because they are not targeted to a particular scenario. Hyper-heuristics automate the design of algorithms to create a custom algorithm for a particular scenario. Hyper-heuristics typically employ Genetic Programming (GP) and this project has investigated the relationship between the choice of GP and performance in Hyper-heuristics. Results are presented demonstrating the existence of problems for which there is a statistically significant performance differential between the use of different types of GP.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2016

Drosophila Nanos acts as a molecular clamp that modulates the RNA-binding and repression activities of Pumilio

Collaboration among the multitude of RNA-binding proteins (RBPs) is ubiquitous, yet our understanding of these key regulatory complexes has been limited to single RBPs. We investigated combinatorial translational regulation by Drosophila Pumilio (Pum) and Nanos (Nos), which control development, fertility, and neuronal functions. Our results show how the specificity of one RBP (Pum) is modulated by cooperative RNA recognition with a second RBP (Nos) to synergistically repress mRNAs. Crystal structures of Nos-Pum-RNA complexes reveal that Nos embraces Pum and RNA, contributes sequence-specific contacts, and increases Pum RNA-binding affinity. Nos shifts the recognition sequence and promotes repression complex formation on mRNAs that are not stably bound by Pum alone, explaining the preponderance of sub-optimal Pum sites regulated in vivo . Our results illuminate the molecular mechanism of a regulatory switch controlling crucial gene expression programs, and provide a framework for understanding how the partnering of RBPs evokes changes in binding specificity that underlie regulatory network dynamics.

Weidmann, Chase A.↗
DOE OSTI2021

Computational framework for behind-the-meter DER techno-economic modeling and optimization: REopt Lite

The energy system is undergoing a major transformation with the global emphasis on decarbonization. Distributed generation is projected to play a significant role in the new energy system, and energy models are informing how distributed generation can be integrated reliably and economically. In this work, we present an end-to-end computational framework for distributed energy resource (DER) modeling, REopt Lite™, which captures the interface of technology, economics, and policy in the energy modeling process. We describe the problem space, the building blocks of the model, the scaling capabilities of the design, the optimization formulation, and the extensibility of the model. We present a framework for accelerating the techno-economic analysis of behind-the-meter distributed energy resources to enable rapid planning and decision-making, thereby enabling greater renewable energy deployment. This computation framework is open-sourced to facilitate transparency, flexibility, and wider collaboration opportunities within the worldwide energy modeling community.

29 ENERGY PLANNING, POLICY, AND ECONOMY↗
DOE OSTI2018

Used Fuel Dry Storage Systems and Components for Shutdown Plants to Expedite Defueling of Spent Fuel Pool - 18378

For plants that have announced plans to shut down, their main priority is to off-load the Used Nuclear Fuel from the spent fuel pool to dry storage at an ISFSI so that they can proceed to 'Safe store' or other storage options, and start their decommissioning process as soon as possible. One of the major expenses for a decommissioned plant is the cost of maintenance of the spent fuel pool. Therefore, the ability of the dry storage system to store short cooled fuel is an important aspect of dry storage system for shutdown plants. When a shutdown plant evaluates the dry storage options, total cost of the transferring the fuel from the pool to ISFSI site needs to be evaluated. One of the major costs to the utility for dry storage is the cost of ISFSI pad (basemat) along with the cost of dry storage system hardware. Smaller ISFSI footprint saves utility for the cost of ISFSI site excavation, cost of engineered backfill and cost of ISFSI pad. In order to minimize the cost of dry storage systems, besides the size of the ISFSI pad as described above, other important considerations is to use high capacity systems. The highest capacity systems available in the dry storage market today are with 37 PWR or 89 BWR used fuel assemblies per canister. These dry storage systems are expected to be at the plant sites for extended duration due to the unavailability of Interim Storage Facilities or a permanent disposal sites like Yucca Mountain. Maintaining the integrity of the dry storage systems canisters and storage overpack so that they can safely protect the fuel and integrity of used nuclear fuel is maintained during storage period is of utmost importance. Robust Aging Management Program is an important aspect for dry storage systems not only at the shutdown plants but also at the operating plants. This paper will provide the update of a reduced footprint version of TN Americas NUHOMS{sup R} System with MATRIX HSM and NUHOMS{sup R} EOS Canisters that addresses the need for maximizing safety, ISFSI capacity while optimizing cost. It will provide an update on the current capabilities, design features and current status of the licensing and deployment of NUHOMS{sup R} EOS System. It will provide the current status of the MATRIX HSM along with the significant enhancement included for a robust Canister Evolved Safety Program for Aging Management. It will also describe the construction sequence; loading operations, and inspections during extended storage as a part of aging management program. The compact version of TN Americas NUHOMS{sup R} System with MATRIX HSM offers a 'Universal' Storage Overpack which is designed to accept all different designs dry storage canisters available in the industry. As UNF storage continues to drives the industry towards innovations that address the need for optimized dry storage systems, compact ISFSIs and prudent aging management programs, this new evolution of the TN Americas NUHOMS{sup R} system with MATRIX HSM and EOS Canisters offers a significant leap forward in addressing all of these challenges. (authors)

12 MANAGEMENT OF RADIOACTIVE AND NON-RADIOACTIVE W↗
DOE OSTI2024

The Value of Hyperparameter Optimization in Phase-Picking Neural Networks

The effectiveness of neural networks for picking seismic phase arrival times has been demonstrated through several case studies, and seismic monitoring programs are starting to adopt the technology into their workflows. However, published models were designed and trained using rather arbitrary choices of hyperparameters, limiting their performance. In this study, we use phase picks from both routine and template-matching analyses from multiple regions (Ridgecrest, California; Kilauea, Hawaii; Yellowstone, Wyoming–Montana–Idaho) to test a hyperparameter optimization scheme for phase-picking neural networks and to evaluate their performance. We show that a published model, namely PhaseNet (Zhu and Beroza, 2019), can be simplified and improved with reasonable effort and there are preferred choices of hyperparameters that increase the performance. We also show that models optimized based on the arrival times reported in routine event catalogs consistently perform well when picking arrival times of smaller events, which is crucial for many tasks from microseismicity to explosion monitoring.

58 GEOSCIENCES↗
DOE OSTI2016

Final Technical Report: Sparse Grid Scenario Generation and Interior Algorithms for Stochastic Optimization in a Parallel Computing Environment

The support from this grant resulted in seven published papers and a technical report. Two papers are published in SIAM J. on Optimization [87, 88]; two papers are published in IEEE Transactions on Power Systems [77, 78]; one paper is published in Smart Grid [79]; one paper is published in Computational Optimization and Applications [44] and one in INFORMS J. on Computing [67]). The works in [44, 67, 87, 88] were funded primarily by this DOE grant. The applied papers in [77, 78, 79] were also supported through a subcontract from the Argonne National Lab. We start by presenting our main research results on the scenario generation problem in Sections 1–2. We present our algorithmic results on interior point methods for convex optimization problems in Section 3. We describe a new ‘central’ cutting surface algorithm developed for solving large scale convex programming problems (as is the case with our proposed research) with semi-infinite number of constraints in Section 4. In Sections 5–6 we present our work on two application problems of interest to DOE.

97 MATHEMATICS AND COMPUTING↗