Search NASA⌕ Search

SEARCH · Search NASA

Results for “Software algorithms”

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 991 records · Page 55

Situational Awareness Geospatial Application (iSAGA)

Situational Awareness Geospatial Application (iSAGA) is a geospatial situational awareness software tool that uses an algorithm to extract location data from nearly any internet-based, or custom data source and display it geospatially; allows user-friendly conduct of spatial analysis using custom-developed tools; searches complex Geographic Information System (GIS) databases and accesses high resolution imagery. iSAGA has application at the federal, state and local levels of emergency response, consequence management, law enforcement, emergency operations and other decision makers as a tool to provide complete, visual, situational awareness using data feeds and tools selected by the individual agency or organization. Feeds may be layered and custom tools developed to uniquely suit each subscribing agency or organization. iSAGA may similarly be applied to international agencies and organizations.

Sher, Benjamin↗

RxnRover/CyRxnOpt

CyRxnOpt aims to provide a single software interface to various optimization algorithms, mainly designed for chemical process optimization applications. CyRxnOpt generalizes the optimization process into four high-level “phases”: Installation, Configuration, Training, and Prediction. This allows developers to program to a general interface for each phase of the optimization, simplifying the development of user-friendly tools to lower the barrier of entry into chemical process optimization, especially for automated laboratory workflows which can greatly benefit from access to various optimization techniques. It is also designed so researchers can easily add new or existing algorithms into existing workflows in a user-friendly manner.

Kulathunga, Dulitha Prasanna [Iowa State Universit↗

Multilevel Training of Neural Networks

MTNN is a software library for applying multilevel algorithms on training neural networks. Based on PyTorch, it is designed to be an extensible framework to enable researchers to implement multilevel training algorithms on a variety of neural network models. This release includes a culmination of preliminary work in applying the multilevel Full Approximation Scheme technique on fully connected and convolutional neural networks to solve PDE problems (pending publication submission).

Li, Ruipeng↗

Do genome-scale models need exact solvers or clearer standards?

Constraint-based analysis of genome-scale models (GEMs) arose shortly after the first genome sequences became available. As numerous reviews of the field show, this approach and methodology has proven to be successful in studying a wide range of biological phenomena (McCloskey et al, 2013; Bordbar et al, 2014). However, efforts to expand the user base are impeded by hurdles in correctly formulating these problems to obtain numerical solutions. In particular, in a study entitled “An exact arithmetic toolbox for a consistent and reproducible structural analysis of metabolic network models” (Chindelevitch et al, 2014), the authors apply an exact solver to 88 genome-scale constraint-based models of metabolism. The authors claim that COBRA calculations (Orth et al, 2010) are inconsistent with their results and that many published and actively used (Lee et al, 2007; McCloskey et al, 2013) genome-scale models do support cellular growth in existing studies only because of numerical errors. They base these broad claims on two observations: (i) three reconstructions ( i AF1260, i IT341, and i NJ661) compute feasibly in COBRA, but are infeasible when exact numerical algorithms are used by their software (entitled MONGOOSE); (ii) linear programs generated by MONGOOSE for i IT341 were submitted to the NEOS Server (a Web site that runs linear programs through various solvers) and gave inconsistent results. They further claim that a large percentage of these COBRA models are actually unable to produce biomass flux. Here, we demonstrate that the claims made by Chindelevitch et al (2014) stem from an incorrect parsing of models from files rather than actual problems with numerical error or COBRA computations.

59 BASIC BIOLOGICAL SCIENCES↗

Dakota, a multilevel parallel object-oriented framework for design optimization, parameter estimation, uncertainty quantification, and sensitivity analysis version 6.0 theory manual

The Dakota (Design Analysis Kit for Optimization and Terascale Applications) toolkit provides a exible and extensible interface between simulation codes and iterative analysis methods. Dakota contains algorithms for optimization with gradient and nongradient-based methods; uncertainty quanti cation with sampling, reliability, and stochastic expansion methods; parameter estimation with nonlinear least squares methods; and sensitivity/variance analysis with design of experiments and parameter study methods. These capabilities may be used on their own or as components within advanced strategies such as surrogate-based optimization, mixed integer nonlinear programming, or optimization under uncertainty. By employing object-oriented design to implement abstractions of the key components required for iterative systems analyses, the Dakota toolkit provides a exible and extensible problem-solving environment for design and performance analysis of computational models on high performance computers. This report serves as a theoretical manual for selected algorithms implemented within the Dakota software. It is not intended as a comprehensive theoretical treatment, since a number of existing texts cover general optimization theory, statistical analysis, and other introductory topics. Rather, this manual is intended to summarize a set of Dakota-related research publications in the areas of surrogate-based optimization, uncertainty quanti cation, and optimization under uncertainty that provide the foundation for many of Dakota's iterative analysis capabilities.

97 MATHEMATICS AND COMPUTING↗

Optimizing the Performance of Radionuclide Identification Software in the Hunt for Nuclear Security Threats

The Radionuclide Analysis Kit (RNAK), my team’s most recent nuclide identification software, is entering the testing phase. A question arises: will removing rare nuclides from the software’s library improve its overall performance? An affirmative response indicates fundamental errors in the software’s framework, while a negative response confirms the effectiveness of the software’s key machine learning algorithms. After thorough testing, I found that the performance of RNAK cannot be improved with the library choice effect, thus verifying the effectiveness of RNAK’s algorithms—multiple linear regression, Bayesian network using the Viterbi algorithm, and branch and bound search.

97 MATHEMATICS AND COMPUTING↗

Next-Generation Optimization under Uncertainty: Structure-Oriented Algorithms

With the advent of the smart grid, renewable technologies, and carbon emission programs, a key concern is the coordination of national infrastructures such as the electricity, natural gas, and water supply network systems. Anticipating and mitigating uncertainty of weather, demands, and contingencies in a more integrated environment is necessary to maximize resource efficiency and prevent cascading failures that can ultimately lead to catastrophic shortages of supplies. This project developed scalable algorithms for stochastic optimization capable of addressing extreme-scale problems (motivated by challenges in the design and operation of national infrastructures). Specifically, the project developed a new family of algorithms to solve continuous stochastic problems to local and global optimality as well as algorithms to solve mixed-integer convex and nonconvex stochastic programs. We developed supporting local and global convergence theory for these algorithms and implemented the algorithms in open-source software packages that can leverage high-performance computing architectures.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Dakota A Multilevel Parallel Object-Oriented Framework for Design Optimization Parameter Estimation Uncertainty Quantification and Sensitivity Analysis: Version 6.12 Theory Manual

The Dakota toolkit provides a flexible and extensible interface between simulation codes and iterative analysis methods. Dakota contains algorithms for optimization with gradient and nongradient-based methods; uncertainty quantification with sampling, reliability, and stochastic expansion methods; parameter estimation with nonlinear least squares methods; and sensitivity/variance analysis with design of experiments and parameter study methods. These capabilities may be used on their own or as components within advanced strategies such as surrogate-based optimization, mixed integer nonlinear programming, or optimization under uncertainty. By employing object-oriented design to implement abstractions of the key components required for iterative systems analyses, the Dakota toolkit provides a flexible and extensible problem-solving environment for design and performance analysis of computational models on high performance computers. This report serves as a theoretical manual for selected algorithms implemented within the Dakota software. It is not intended as a comprehensive theoretical treatment, since a number of existing texts cover general optimization theory, statistical analysis, and other introductory topics. Rather, this manual is intended to summarize a set of Dakota-related research publications in the areas of surrogate-based optimization, uncertainty quantification, and optimization under uncertainty that provide the foundation for many of Dakota's iterative analysis capabilities.

97 MATHEMATICS AND COMPUTING↗

Dakota A Multilevel Parallel Object-Oriented Framework for Design Optimization Parameter Estimation Uncertainty Quantification and Sensitivity Analysis (V.6.14) (Theory Manual)

The Dakota toolkit provides a flexible and extensible interface between simulation codes and iterative analysis methods. Dakota contains algorithms for optimization with gradient and nongradient-based methods; uncertainty quantification with sampling, reliability, and stochastic expansion methods; parameter estimation with nonlinear least squares methods; and sensitivity/variance analysis with design of experiments and parameter study methods. These capabilities may be used on their own or as components within advanced strategies such as surrogate-based optimization, mixed integer nonlinear programming, or optimization under uncertainty. By employing object-oriented design to implement abstractions of the key components required for iterative systems analyses, the Dakota toolkit provides a flexible and extensible problem-solving environment for design and performance analysis of computational models on high performance computers. This report serves as a theoretical manual for selected algorithms implemented within the Dakota software. It is not intended as a comprehensive theoretical treatment, since a number of existing texts cover general optimization theory, statistical analysis, and other introductory topics. Rather, this manual is intended to summarize a set of Dakota-related research publications in the areas of surrogate-based optimization, uncertainty quantification, and optimization under uncertainty that provide the foundation for many of Dakota's iterative analysis capabilities.

97 MATHEMATICS AND COMPUTING↗

Dakota, A Multilevel Parallel Object-Oriented Framework for Design Optimization, Parameter Estimation, Uncertainty Quantification, and Sensitivity Analysis: Version 6.13 Theory Manual

The Dakota toolkit provides a flexible and extensible interface between simulation codes and iterative analysis methods. Dakota contains algorithms for optimization with gradient and nongradient-based methods; uncertainty quantification with sampling, reliability, and stochastic expansion methods; parameter estimation with nonlinear least squares methods; and sensitivity/variance analysis with design of experiments and parameter study methods. These capabilities may be used on their own or as components within advanced strategies such as surrogate-based optimization, mixed integer nonlinear programming, or optimization under uncertainty. By employing object-oriented design to implement abstractions of the key components required for iterative systems analyses, the Dakota toolkit provides a flexible and extensible problem-solving environment for design and performance analysis of computational models on high performance computers. This report serves as a theoretical manual for selected algorithms implemented within the Dakota software. It is not intended as a comprehensive theoretical treatment, since a number of existing texts cover general optimization theory, statistical analysis, and other introductory topics. Rather, this manual is intended to summarize a set of Dakota-related research publications in the areas of surrogate-based optimization, uncertainty quantification, and optimization under uncertainty that provide the foundation for many of Dakota's iterative analysis capabilities.

97 MATHEMATICS AND COMPUTING↗

Dakota, A Multilevel Parallel Object-Oriented Framework for Design Optimization, Parameter Estimation, Uncertainty Quantification, and Sensitivity Analysis: Theory Manual (V.6.15)

The Dakota toolkit provides a flexible and extensible interface between simulation codes and iterative analysis methods. Dakota contains algorithms for optimization with gradient and nongradient-based methods; uncertainty quantification with sampling, reliability, and stochastic expansion methods; parameter estimation with nonlinear least squares methods; and sensitivity/variance analysis with design of experiments and parameter study methods. These capabilities may be used on their own or as components within advanced strategies such as surrogate-based optimization, mixed integer nonlinear programming, or optimization under uncertainty. By employing object-oriented design to implement abstractions of the key components required for iterative systems analyses, the Dakota toolkit provides a flexible and extensible problem-solving environment for design and performance analysis of computational models on high performance computers. This report serves as a theoretical manual for selected algorithms implemented within the Dakota software. It is not intended as a comprehensive theoretical treatment, since a number of existing texts cover general optimization theory, statistical analysis, and other introductory topics. Rather, this manual is intended to summarize a set of Dakota-related research publications in the areas of surrogate-based optimization, uncertainty quantification, and optimization under uncertainty that provide the foundation for many of Dakota's iterative analysis capabilities.

97 MATHEMATICS AND COMPUTING↗

Dakota, A Multilevel Parallel Object-Oriented Framework for Design Optimization, Parameter Estimation, Uncertainty Quantification, and Sensitivity Analysis: Version 6.16 Theory Manual

The Dakota toolkit provides a flexible and extensible interface between simulation codes and iterative analysis methods. Dakota contains algorithms for optimization with gradient and nongradient-based methods; uncertainty quantification with sampling, reliability, and stochastic expansion methods; parameter estimation with nonlinear least squares methods; and sensitivity/variance analysis with design of experiments and parameter study methods. These capabilities may be used on their own or as components within advanced strategies such as surrogate-based optimization, mixed integer nonlinear programming, or optimization under uncertainty. By employing object-oriented design to implement abstractions of the key components required for iterative systems analyses, the Dakota toolkit provides a flexible and extensible problem-solving environment for design and performance analysis of computational models on high performance computers. This report serves as a theoretical manual for selected algorithms implemented within the Dakota software. It is not intended as a comprehensive theoretical treatment, since a number of existing texts cover general optimization theory, statistical analysis, and other introductory topics. Rather, this manual is intended to summarize a set of Dakota-related research publications in the areas of surrogate-based optimization, uncertainty quantification, and optimization under uncertainty that provide the foundation for many of Dakota’s iterative analysis capabilities.

97 MATHEMATICS AND COMPUTING↗

Surface Roughness Effects from Additive Manufacturing in High Efficiency Gas Turbine Combustion Systems

In the past, clean combustion systems were characterized by high system development costs due to growing complexity and escalating manufacturing costs from conventional manufacturing processes. As a result, high efficiency concepts are difficult to design and more difficult to be cost-effectively manufactured. In recent years, with the introduction of additive manufacturing (AM) technologies, the rapid prototyping and mass production processes of clean combustion systems are promising to be significantly simplified with significant reduction in terms of engine manufacturing cost and engine energy cost. Compared with conventional manufacturing built parts, the AM process enabled a simpler design to be adopted for the nozzle, reducing the number of required braze and weld joints from twenty-five to just five. The resulting nozzle was 25% lighter and five times more durable and contributed to a 15% reduction in fuel burn in comparison with the previous model produced. Applying these improvements to a fleet of 5,000 turbofan engines at 150 kN thrust would result in fuel cost savings of $ \$ $6B annually (at $ \$ $5/gallon Jet-A fuel price, 700 gallon/hour fuel consumption rate, and 2,300 operational hours per year), and reduce CO2 emissions by more than 25 million tons per year. These advances support core Department of Energy (DOE) missions in energy efficiency, improving productivity, and environmental sustainability. Maximizing the benefit of these new capabilities will require high prediction capability of high speed turbulent flow with wall modeled Large Eddy Simulation (LES). GE Aviation maintains that advanced simulation technology and supercomputing is required in order to provide the appropriate boundary conditions to realize the maximum potential of AM and Ceramic Matrix Composite to reduce cooling flow, a first order penalty on the Brayton cycle. The algorithm developed using the ANSYS/Fluent software would provide the foundation for entirely new avenues of research and development with potential multi-billion dollar impact to the US economy, and significant reduction in carbon based emissions across the aerospace and power generation industries. The formulation of this iWLES (integral wall model for LES) is generic and allows to capture the changes in flow dynamics that have a significant impact on the wall bounded flow characteristics, such as swirler effective area, bulk swirl number, local pressure distribution, exit velocity profile, and turbulence kinetic energy profile. A periodic channel flow with rough flat plate is simulated using LES (Wall-Adapting Local Eddy-viscosity) model to verify the implementation of iWLES in the Fluent User Defined Function (UDF). As the flow fields are highly sensitive due to surface roughness of the wall bounded flows in the combustion systems, there is significant potential to conduct further LES studies focusing on the turbulence boundary layer interaction. Accurately capturing near wall physics will elucidate the impact of rough surfaces on combustor flow and aero-thermal interactions.

42 ENGINEERING↗

Surface Roughness Effects from Additive Manufacturing in High Efficiency Gas Turbine Combustion Systems

In the past, clean combustion systems were characterized by high system development costs due to growing complexity and escalating manufacturing costs from conventional manufacturing processes. As a result, high efficiency concepts are difficult to design and more difficult to be cost-effectively manufactured. In recent years, with the introduction of additive manufacturing (AM) technologies, the rapid prototyping and mass production processes of clean combustion systems are promising to be significantly simplified with significant reduction in terms of engine manufacturing cost and engine energy cost. Compared with conventional manufacturing built parts, the AM process enabled a simpler design to be adopted for the nozzle, reducing the number of required braze and weld joints from twenty-five to just five. The resulting nozzle was 25% lighter and five times more durable and contributed to a 15% reduction in fuel burn in comparison with the previous model produced. Applying these improvements to a fleet of 5,000 turbofan engines at 150 kN thrust would result in fuel cost savings of $6B annually (at $5/gallon Jet-A fuel price, 700 gallon/hour fuel consumption rate, and 2,300 operational hours per year),and reduce CO2 emissions by more than 25 million tons per year. These advances support core Department of Energy (DOE)missions in energy efficiency, improving productivity, and environmental sustainability. Maximizing the benefit of these new capabilities will require high prediction capability of high speed turbulent flow with wall modeled Large Eddy Simulation (LES). GE Aviation maintains that advanced simulation technology and supercomputing is required in order to provide the appropriate boundary conditions to realize the maximum potential of AM and Ceramic Matrix Composite to reduce cooling flow, a first order penalty on the Brayton cycle. The algorithm developed using the ANSYS/Fluent software would provide the foundation for entirely new avenues of research and development with potential multi-billion dollar impact to the US economy, and significant reduction in carbon based emissions across the aerospace and power generation industries. The formulation of this iWLES (integral wall model for LES) is generic and allows to capture the changes in flow dynamics that have a significant impact on the wall bounded flow characteristics, such as swirler effective area, bulk swirl number, local pressure distribution, exit velocity profile, and turbulence kinetic energy profile. A periodic channel flow with rough flat plate is simulated using LES (Wall-Adapting Local Eddy-viscosity) model to verify the implementation of iWLES in the Fluent User Defined Function (UDF). As the flow fields are highly sensitive due to surface roughness of the wall bounded flows in the combustion systems, there is significant potential to conduct further LES studies focusing on the turbulence boundary layer interaction. Accurately capturing near wall physics will elucidate the impact of rough surfaces on combustor flow and aero-thermal interactions.

99 GENERAL AND MISCELLANEOUS↗

A computational modeling framework for pre-clinical evaluation of cardiac mapping systems

There are a variety of difficulties in evaluating clinical cardiac mapping systems, most notably the inability to record the transmembrane potential throughout the entire heart during patient procedures which prevents the comparison to a relevant “gold standard”. Cardiac mapping systems are comprised of hardware and software elements including sophisticated mathematical algorithms, both of which continue to undergo rapid innovation. The purpose of this study is to develop a computational modeling framework to evaluate the performance of cardiac mapping systems. The framework enables rigorous evaluation of a mapping system’s ability to localize and characterize (i.e., focal or reentrant) arrhythmogenic sources in the heart. The main component of our tool is a library of computer simulations of various dynamic patterns throughout the entire heart in which the type and location of the arrhythmogenic sources are known. Our framework allows for performance evaluation for various electrode configurations, heart geometries, arrhythmias, and electrogram noise levels and involves blind comparison of mapping systems against a “silver standard” comprised of computer simulations in which the precise transmembrane potential patterns throughout the heart are known. A feasibility study was performed using simulations of patterns in the human left atria and three hypothetical virtual catheter electrode arrays. Activation times (AcT) and patterns (AcP) were computed for three virtual electrode arrays: two basket arrays with good and poor contact and one high-resolution grid with uniform spacing. The average root mean squared difference of AcTs of electrograms and those of the nearest endocardial action potential was less than 1 ms and therefore appears to be a poor performance metric. In an effort to standardize performance evaluation of mapping systems a novel performance metric is introduced based on the number of AcPs identified correctly and those considered spurious as well as misclassifications of arrhythmia type; spatial and temporal localization accuracy of correctly identified patterns was also quantified. This approach provides a rigorous quantitative analysis of cardiac mapping system performance. Proof of concept of this computational evaluation framework suggests that it could help safeguard that mapping systems perform as expected as well as provide estimates of system accuracy.

59 BASIC BIOLOGICAL SCIENCES↗

IBM system/360 assembly language interval arithmetic software

Computer software designed to perform interval arithmetic is described. An interval is defined as the set of all real numbers between two given numbers including or excluding one or both endpoints. Interval arithmetic consists of the various elementary arithmetic operations defined on the set of all intervals, such as interval addition, subtraction, union, etc. One of the main applications of interval arithmetic is in the area of error analysis of computer calculations. For example, it has been used sucessfully to compute bounds on sounding errors in the solution of linear algebraic systems, error bounds in numerical solutions of ordinary differential equations, as well as integral equations and boundary value problems. The described software enables users to implement algorithms of the type described in references efficiently on the IBM 360 system.

Phillips, E. J.↗

Precision pointing of the international ultraviolet explorer /IUE/ scientific instrument using a gyroscopic and stellar reference

The Attitude Control System for the IUE spacecraft is described. The basic mission objectives are stated and a sequential discussion of the mission is presented. Desired accuracy for each mission phase is noted and where applicable the onboard control mechanization is shown. Sensors and actuator systems utilized by the control algorithms are described. Finally, onboard software is discussed to a level necessary to understand the prime mission mode operation.

Moore, J. V.↗

Automating the process of estimating spacecraft mass

To help prevent the problem of mass reduction late in a spacecraft development program, the process of estimating spacecraft mass has been formulated in algorithmic form and incorporated in software that will allow trained users to interface with the integral design parameters data base interactively. The software will use historical data to extrapolate future values of a given time-dependent parameter and be manipulated by a dynamic graphics configuration builder. Future expansions of this work promise to automate the entire conceptual mission design process.

Skinner, D. L.↗