SEARCH · Search NASA
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.
We present a stochastic robust framework for two-stage power system optimization problems with uncertainty. The model optimizes the probabilistic expectation of different worst-case scenarios with different uncertainty sets. In addition, a case study of unit commitment shows the effectiveness of the proposed model and algorithms.
Tuning tensor program generation involves navigating a vast search space to find optimal program transformations and measurements for a program on the target hardware. The complexity of this process is further amplified by the exponential combinations of transformations, especially in heterogeneous environments. This research addresses these challenges by introducing a novel approach that learns the joint neural network and hardware features space, facilitating knowledge transfer to new, unseen target hardware. A comprehensive analysis is conducted on the existing state-of-the-art dataset, TenSet, including a thorough examination of test split strategies and the proposal of methodologies for dataset pruning. Leveraging an attention-inspired technique, we tailor the tuning of tensor programs to embed both neural network and hardware-specific features. Notably, our approach substantially reduces the dataset size by up to 53% compared to the baseline without compromising Pairwise Comparison Accuracy (PCA). Furthermore, our proposed methodology demonstrates competitive or improved mean inference times with only 25–40% of the baseline tuning time across various networks and target hardware. The attention-based tuner can effectively utilize schedules learned from previous hardware program measurements to optimize tensor program tuning on previously unseen hardware, achieving a top-5 accuracy exceeding 90%. This research introduces a significant advancement in autotuning tensor program generation, addressing the complexities associated with heterogeneous environments and showcasing promising results regarding efficiency and accuracy.
Simulating the time evolution of a physical system at quantum mechanical levels of detail - known as Hamiltonian Simulation (HS) - is an important and interesting problem across physics and chemistry. For this task, algorithms that run on quantum computers are known to be exponentially faster than classical algorithms; in fact, this application motivated Feynman to propose the construction of quantum computers. Nonetheless, there are challenges in reaching this performance potential. Prior work has focused on compiling circuits (quantum programs) for HS with the goal of maximizing either accuracy or gate cancellation. Our work proposes a compilation strategy that simultaneously advances both goals. At a high level, we use classical optimizations such as graph coloring and travelling salesperson to order the execution of quantum programs. Specifically, we group together mutually commuting terms in the Hamiltonian (a matrix characterizing the quantum mechanical system) to improve the accuracy of the simulation. We then rearrange the terms within each group to maximize gate cancellation in the final quantum circuit. Furthermore, these optimizations work together to improve HS performance and result in an average 40% reduction in circuit depth. This work advances the frontier of HS which in turn can advance physical and chemical modeling in both basic and applied sciences.
Understanding the impacts caused by injection of large volumes of CO 2 in the deep subsurface necessitates a comprehensive monitoring strategy. While surface-based and other remote geophysical methods can provide information on the general morphology of a CO 2 plume, verification of the geochemical conditions and validation of the remote sensing data requires measurements from boreholes that penetrate the storage formation. Unfortunately, the high cost of drilling deep wellbores and deploying instrumentation systems constrains the number of dedicated monitoring borings as well as limits the technologies that can be incorporated in a borehole completion. The objective of the Modular Borehole Monitoring (MBM) Program was to develop a robust suite of well-based tools optimized for subsurface monitoring of CO 2 that could meet the needs of a comprehensive well-based monitoring program. It should have enough flexibility to be easily reconfigured for various reservoir geometries and geologies. The MBM Program sought to provide storage operators with a turn-key fully engineered design that incorporated key technologies, function over the decades long time-span necessary for post-closure reservoir monitoring, and meet industry acceptable risk profiles for deep-well installations. While still within the conceptual design phase of the MBM program, the SECARB Anthropogenic Test in Citronelle, Alabama, USA was identified as a deployment site for our engineered monitoring systems. The initial step in designing the Citronelle MBM system was to down-select from the various monitoring tools available to include technologies that we considered essential to any program. Monitoring methods selected included U-tube geochemical sampling, discrete quartz pressure and temperature gauges, an integrated fibre-optic bundle consisting of distributed temperature and heat-pulse sensing, and a sparse string of conventional 3C-geophones. While not originally planned within the initial MBM work scope, the fibre-optic cable was able to also be used for the emergent technology of distributed acoustic sensing. The MBM monitoring string was installed in March, 2012. To date, the Citronelle MBM instruments continue to operate reliably. Results and lessons learned from the Citronelle MBM deployment are addressed along with examples of data being collected.
A new general-purpose optimization program for engineering design is described. ADS (Automated Design Synthesis - Version 1.10) is a FORTRAN program for solution of nonlinear constrained optimization problems. The program is segmented into three levels: strategy, optimizer, and one-dimensional search. At each level, several options are available so that a total of over 100 possible combinations can be created. Examples of available strategies are sequential unconstrained minimization, the Augmented Lagrange Multiplier method, and Sequential Linear Programming. Available optimizers include variable metric methods and the Method of Feasible Directions as examples, and one-dimensional search options include polynomial interpolation and the Golden Section method as examples. Emphasis is placed on ease of use of the program. All information is transferred via a single parameter list. Default values are provided for all internal program parameters such as convergence criteria, and the user is given a simple means to over-ride these, if desired.
A new general-purpose optimization program for engineering design is described. ADS-1 (Automated Design Synthesis - Version 1) is a FORTRAN program for solution of nonlinear constrained optimization problems. The program is segmented into three levels, being strategy, optimizer, and one-dimensional search. At each level, several options are available so that a total of over 100 possible combinations can be created. Examples of available strategies are sequential unconstrained minimization, the Augmented Lagrange Multiplier method, and Sequential Linear Programming. Available optimizers include variable metric methods and the Method of Feasible Directions as examples and one-dimensional search options include polynomial interpolation and the Golden Section method as examples. Emphasis is placed on ease of use of the program. All information is transferred via a single parameter list. Default values are provided for all internal program parameters such as convergence criteria, and the user is given a simple means to over-ride these, if desired. The program is demonstrated with a simple structural design example.
In the frame of its missions, IRSN is widely involved in design, evaluation and analyses of critical experiments in order to contribute to computer codes and nuclear data validation. The work described in this paper was carried out in the framework of the PRINCESS IRSN research project and is part of the IRSN/LLNL collaboration on the TEX program in the frame of the NCSP. The need for epithermal and intermediate energy range critical benchmarks is an established international criticality safety data need, underpinned by the subsequent use of data assimilation methods like GLLSM to reduce Nuclear Data uncertainties. The goal of the TEX program is to address this need by executing experiments with NCSP fissile assets, which can be used to create critical assemblies that span a wide range of fission energy spectra, from the thermal energy range (below 0.625 eV), through the intermediate energy range (0.625 eV to 100 keV), to the fast one (above 100 keV). The TEX program involves different materials of interest, such as TEX-Ta experiments using plutonium ZPPR plates proposed by LLNL. This paper presents an overview of the studies performed at IRSN using numerical optimization algorithms for the design of critical experiments involving Mixed U and Pu fuel plates, referred to as TEX-MOX program. This program ultimately aims to perform critical experiments to validate the MOX fuel configurations encountered in the MOX fuel fabrication process. (authors)
The two methods which are suitable for use in a 4-body trajectory optimization program are both multiconic methods. They include an approach due to Wilson (1970) and to Byrnes and Hooper (1970) and a procedure developed by Stumpff and Weiss (1968). The various steps in a trajectory optimization program are discussed, giving attention to variable step integration, the correction of errors by quadrature formulas, questions of two-impulse transfer, three-impulse transfer, and two examples which illustrate the implementation of the computational approaches.
This document is the monitoring optimization plan for groundwater monitoring wells associated with the U.S. Department of Energy (DOE) Y-12 National Security Complex (Y-12) in Oak Ridge, Tennessee. The plan describes the technical approach that is implemented under the Y-12 Groundwater Protection Program (GWPP) to focus available resources on the monitoring wells at Y-12 that provide the most useful hydrologic and groundwater quality monitoring data. The technical approach is based on the GWPP status designation for each well. Under this approach, wells granted “active” status are used by the GWPP for hydrologic monitoring and/or groundwater quality sampling, whereas wells granted “inactive” status are not used for either purpose. The status designation also defines the frequency at which the GWPP will inspect applicable wells, the scope of these well inspections, and extent of any maintenance actions initiated by the GWPP. Details regarding the ancillary activities associated with implementation of this plan (e.g., well inspection) are deferred to the referenced GWPP plans.
Microgrids are frequently employed in remote regions, in part because access to a larger electric grid is impossible, difficult, or compromises reliability and independence. Although small microgrids often employ spot generation, in which a diesel generator is attached directly to a load, microgrids that combine these individual loads and augment generators with photovoltaic cells and batteries as a distributed energy system are emerging as a safer, less costly alternative. In this work, we present a model that seeks the minimum-cost microgrid design and ideal dispatched power to support a small remote site for one year with hourly fidelity under a detailed battery model; this mixed-integer nonlinear program (MINLP) is intractable with commercial solvers but loosely coupled with respect to time. A mixed-integer linear program (MIP) approximates the model, and a partitioning scheme linearizes the bilinear terms. We introduce a novel policy for loosely coupled MIPs in which the system reverts to equivalent conditions at regular time intervals; this separates the problem into subproblems that we solve in parallel. We obtain solutions within 5% of optimality in at most six minutes across 14 MIP instances from the literature and solutions within 5% of optimality to the MINLP instances within 20 minutes.
Trajectory optimization and linearized pitch computer program for Scout launch vehicle
High reliability is desired in all engineered systems. One way to improve system reliability is to use redundant components. When redundant components are used, the problem becomes one of allocating them to achieve the best reliability without exceeding other design constraints such as cost, weight, or volume. Systems with few components can be optimized by simply examining every possible combination but the number of combinations for most systems is prohibitive. A computerized iteration of the process is possible but anything short of a super computer requires too much time to be practical. Many researchers have derived mathematical formulations for calculating the optimum configuration directly. However, most of the derivations are based on continuous functions whereas the real system is composed of discrete entities. Therefore, these techniques are approximations of the true optimum solution. This paper describes a computer program that will determine the optimum configuration of a system of multiple redundancy of both standard and optional components. The algorithm is a pair-wise comparative progression technique which can derive the true optimum by calculating only a small fraction of the total number of combinations. A designer can quickly analyze a system with this program on a personal computer.
We present an approach to optimize the cache locality for recursive programs by dynamically splicing--recursively interleaving--the execution of distinct function invocations. By utilizing data effect annotations, we identify concurrency and data reuse opportunities across function invocations and interleave them to reduce reuse distance. We present algorithms that efficiently track effects in recursive programs, detect interference and dependencies, and interleave execution of function invocations using user-level (non-kernel) lightweight threads. To enable multi-core execution, a program is parallelized using a nested fork/join programming model. Our cache optimization strategy is designed to work in the context of a random work stealing scheduler. We present an implementation using the MIT Cilk framework that demonstrates significant improvements in sequential and parallel performance, competitive with a state-of-the-art compile-time optimizer for loop programs and a domain- specific optimizer for stencil programs.
Formal mathematical programing was applied to the aerodynamic rotor blade design process. The approach is to couple hover and forward flight analysis programs with the general-purpose optimization program CONMIN to determine the blade taper ratio, percent taper, twist distribution, and solidity which minimize the horsepower required at hover while meeting constraints on forward flight performance. Designs obtained using this approach for the blade of a representative Army helicopter compare well with those obtained using a conventional approach involving personnel-intensive parametric studies. Results from the present method can be obtained in 2 days as compared to 5 weeks required by the conventional procedure. Also the systematic manipulation of the design variables by the optimization procedure minimizes the need for the researcher to have a vast body of past experience and data in determining the influence of a design change on the performance.
Optimization of 24-hour communication satellite orbital control process
Computer program for retrieving stored data and determining variations in launch vehicle performance as function of mission and vehicle parameters
A six-segment management model is presented, each segment of which represents a major area in a new product development program. The first segment of the model covers integration of specialist engineers into 'systems requirement definition' or the system engineering documentation process. The second covers preparation of five basic types of 'development program plans.' The third segment covers integration of system requirements, scheduling, and funding of specialist engineering activities into 'work breakdown structures,' 'cost accounts,' and 'work packages.' The fourth covers 'requirement communication' by line organizations. The fifth covers 'performance measurement' based on work package data. The sixth covers 'baseline requirements achievement tracking.'