Search NASA⌕ Search

SEARCH · Search NASA

Results for “Point 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 1,585 records · Page 88

Empirically Optimized One-Electron Pseudopotential for the Hydrated Electron: A Proof-of-Concept Study

Mixed quantum-classical molecular dynamics simulations have been important tools for studying the hydrated electron. They generally use a one-electron pseudopotential to describe the interactions of an electron with the water molecules. Furthermore, this approximation shows both the strength and weakness of the approach. On the one hand, it enables extensive statistical sampling and large system sizes that are not possible with more accurate ab initio molecular dynamics methods. On the other hand, there has (justifiably) been much debate about the ability of pseudopotentials to accurately and quantitatively describe the hydrated electron properties. These pseudopotentials have largely been derived by fitting them to ab initio calculations of an electron interacting with a single water molecule. In this paper, we present a proof-of-concept demonstration of an alternative approach in which the pseudopotential parameters are determined by optimizing them to reproduce key experimental properties. Specifically, we develop a new pseudopotential, using the existing TBOpt model as a starting point, which correctly describes the hydrated electron vertical detachment energy and radius of gyration. In addition to these properties, this empirically optimized model displays a significantly modified solvation structure, which improves, for example, the prediction of the partial molar volume.

38 RADIATION CHEMISTRY, RADIOCHEMISTRY, AND NUCLEA↗

Global search algorithm for optimal control

Random-search algorithm employs local and global properties to solve two-point boundary value problem in Pontryagin maximum principle for either fixed or variable end-time problems. Mixed boundary value problem is transformed to an initial value problem. Mapping between initial and terminal values utilizes hybrid computer.

Brocker, D. H.↗

Computational wing optimization and wind tunnel test of semi-span model

A computational transonic wing design procedure has been developed and verified by a wind tunnel test of a variable camber semi-span wing model. The Bailey-Ballhaus transonic potential flow analysis code linked to Vanderplaat's constrained minimization routine was used to optimize test configurations at 0.9 Mach number. Based on wind tunnel test results, computationally optimized designs were as efficient as the best configurations determined by previous parametric testing and performed better at off-design points. Wind tunnel wing pressures agreed well with predictions from the improved Bailey-Ballhaus code at moderate CL's. Computational optimization was shown to be an effective transonic wing design tool.

Haney, H. P.↗

Relationship between Aircraft Noise Contour Area and Noise Levels at Certification Points

The use of sound exposure level contour area reduction has been proposed as an alternative or supplemental metric of progress and success for the NASA Quiet Aircraft Technology program, which currently uses the average of predicted noise reductions at three community locations. As the program has expanded to include reductions in airframe noise as well as reduction due to optimization of operating procedures for lower noise, there is concern that the three-point methodology may not represent a fair measure of benefit to airport communities. This paper addresses several topics related to this proposal: (1) an analytical basis for a relationship between certification noise levels and noise contour areas for departure operations is developed, (2) the relationship between predicted noise contour area and the noise levels measured or predicted at the certification measurement points is examined for a wide range of commercial and business aircraft, and (3) reductions in contour area for low-noise approach scenarios are predicted and equivalent reductions in source noise are determined.

Powell, Clemans A.↗

Near earth asteroid scout CubeSat science data retrieval optimization using onboard data analysis

We present a collection of techniques designed for mitigating limited pointing stability for target acquisition, onboard image calibration and decision making, in a low bandwidth environment. These technologies will fly on the Near Earth Asteroid Scout (NEA Scout) interplanetary CubeSat mission in 2019. To support verification and validation, the flight software implementations of these algorithms have been run on New Horizons, Rosetta and terrestrially acquired data sets. These experiments validate the capability to detect the target, through noise and target location uncertainty.

Basset, Christophe↗

Factorization Machine‐Based Active Learning for Functional Materials Design with Optimal Initial Data

The optimization of functional materials is important to enhance their properties, but their complex geometries pose great challenges to optimization. Data-driven algorithms efficiently navigate such complex design spaces by learning relationships between material structures and performance metrics to discover high-performance functional materials. Surrogate-based active learning, continually improving its surrogate model by iteratively including high-quality data points, has emerged as a cost-effective data-driven approach. Furthermore, it can be coupled with quantum computing to enhance optimization processes, especially when paired with a special form of surrogate model (i.e., quadratic unconstrained binary optimization), formulated by factorization machine (FM). However, current practices often overlook the variability in design space sizes when determining the initial data size for optimization. In this work, we investigate the optimal initial data sizes required for efficient convergence across various design space sizes. By employing averaged piecewise linear regression, we identify initiation points where convergence begins, highlighting the crucial role of employing adequate initial data in achieving efficient optimization. These results contribute to the efficient optimization of functional materials by ensuring faster convergence and reducing computational costs in FM-based active learning.

active learning↗

The Gemini NICI planet-finding campaign: The companion detection pipeline

We present high-contrast image processing techniques used by the Gemini NICI Planet-Finding Campaign to detect faint companions to bright stars. The Near-Infrared Coronographic Imager (NICI) is an adaptive optics instrument installed on the 8 m Gemini South telescope, capable of angular and spectral difference imaging and specifically designed to image exoplanets. The Campaign data pipeline achieves median contrasts of 12.6 mag at 0.''5 and 14.4 mag at 1'' separation, for a sample of 45 stars (V = 4.3-13.9 mag) from the early phase of the campaign. We also present a novel approach to calculating contrast curves for companion detection based on 95% completeness in the recovery of artificial companions injected into the raw data, while accounting for the false-positive rate. We use this technique to select the image processing algorithms that are more successful at recovering faint simulated point sources. We compare our pipeline to the performance of the Locally Optimized Combination of Images (LOCI) algorithm for NICI data and do not find significant improvement with LOCI.

79 ASTRONOMY AND ASTROPHYSICS↗

Nonlinear optimal recovery in Hilbert spaces

Here, this paper investigates solution strategies for nonlinear problems in Hilbert spaces, such as nonlinear partial differential equations (PDEs) in Sobolev spaces, when only finite measurements are available. We formulate this as a nonlinear optimal recovery problem, establishing its well-posedness and proving its convergence to the true solution as the number of measurements increases. However, the resulting formulation might not have a finite-dimensional solution in general. We thus present a sufficient condition for the finite dimensionality of the solution, applicable to problems with well-defined point evaluation measurements. To address the broader setting, we introduce a relaxed nonlinear optimal recovery and provide a detailed convergence analysis. An illustrative example is given to demonstrate that our formulations and theoretical findings offer a comprehensive framework for solving nonlinear problems in infinite-dimensional spaces with limited data.

convergence↗

Data Locality Enhancement of Dynamic Simulations for Exascale Computing (Final Report)

The development of modern processors exhibits two trends that complicate the optimizations of modern software. The first is the increasing sensitivity of processors' throughput to irregularities in computation. With more processors produced through a massive integration of simple cores, future systems will increasingly favor regular data-level parallel computations, but deviate from the needs of applications with complex patterns. Some evidences are already shown on Graphic Processing Units (GPU): Irregular data accesses (e.g., indirect references A[D[i]]) and conditional branches are limiting many GPU applications' performance at a level an order of magnitude lower than the peak of GPU. The second hardware trend is the growing gap between memory bandwidth and the aggregate speed—that is, the sum of all cores' computing power—of a Chip Multiprocessor (CMP). Despite the capped growth of the peak CPU speed, the aggregate speed of a CMP keeps increasing as more cores get into a single chip. It is expected that by 2018, node concurrency in an exascale system will increase by hundreds of times, whereas, memory bandwidth will expand by only 10 to 20 times. Consequently, data movement and storage is expected to consume more than 70% of the total system power. Bridging this gap is difficult; the complexities of modern CMP memory hierarchy make it even harder: Data cache becomes shared among computing units, and the sharing is often non-uniform—whether two computing units share a cache depends on their proximity and the level of the cache. On the recent IBM Power7 architecture, for instance, four hardware contexts (or SMT threads) in a core share the entire memory hierarchy, all cores in one chip share an on-chip L3 cache, and cores across chips share L3 and main memory through off-chip connections. These two trends complicate the translation of computing power into performance, especially for a program with either intensive data accesses or complex patterns in data accesses or control flow paths. Unfortunately, both attributes present and will persist in a class of important applications. For instance, many scientific simulations deal with a large volume of data. And meanwhile, as most real-world processes are non-uniform and evolving (e.g., the evolution of a galaxy or the process of a drug injection), both the computations and data accesses of these programs tend to be irregular and dynamically changing. Currently, the lack of support to these applications on modern CMP severely limits their performance. On GPU, as our recent study shows and other studies echo, performance enhancement of a factor of integers is possible when memory accesses or control flows are streamlined for a set of GPU applications. On multicore CPU, our studies show that traditional locality enhancement, for being oblivious to the new features of multicore memory hierarchy, may even cause large slowdown to data-intensive dynamic applications. The severity of the issues is expected to worsen as the two hardware trends continue. Some recent studies try to match software with the trends, but in a limited scope or manner. For irregularities on GPU, most studies focus on irregularities analyzable through static analysis (e.g., data accesses in regular loops). Dynamic irregularities are harder to address because the needed analysis and transformations typically have to happen at run time. Some other research resorts to hardware extensions, an actual adoption of which is unclear for the entailed space cost and complexity. For data locality, recent years have seen some exploitations of the new memory hierarchy on multicore for performance, but most of them are on process or thread scheduling, rather than program transformations. Our recent study reveals that program-level transformations may magnify the scheduling benefits by a factor of seven, concluding that program-level transformation should play a central role for data locality enhancement on modern CMP. But research in this direction has been sparse, and most have focused on data layout or cache performance modeling, rather than program transformations to match with the new memory hierarchy features. Overall, it is still an open question how to bridge the gap between dynamic computations and the two prominent properties of modern processors. The goal of this project is to develop a set of techniques and software tools to enhance the matching between memory accesses in dynamic simulations and the prominent features of modern and future CMP, alleviating the memory performance issues for petascale and exascale computing. This report summarizes the discoveries and products produced throughout this project. It includes free launch, a new software approach to overcoming the shortcomings of both methods; coherence-free multiview, an approach that allows multiple views of a single data object to co-exist on GPU memory during a GPU kernel execution; algorithmic optimizations to data analytics problems, especially those that involve lots of distance calculations. Supporting dynamic parallelism is important for GPU to benefit a broad range of applications. There are currently two fundamental ways for programs to exploit dynamic parallelism on GPU: a software-based approach with software-managed worklists, and a hardware-based approach through dynamic subkernel launches. Neither is satisfactory. The former is complicated to program and is often subject to some load imbalance; the latter suffers large runtime overhead. In this work, we propose free launch, a new software approach to overcoming the shortcomings of both methods. It allows programmers to use subkernel launches to express dynamic parallelism. It employs a novel compiler-based code transformation named subkernel launch removal to replace the subkernel launches with the reuse of parent threads. Coupled with an adaptive task assignment mechanism, the transformation reassigns the tasks in the subkernels to the parent threads with a good load balance. The technique requires no hardware extensions, immediately deployable on existing GPUs. It keeps the programming convenience of the subkernel launch-based approach while avoiding its large runtime overhead. Meanwhile, its superior load balancing makes it outperform manual worklist-based techniques by 3X on average. The work was published at the 48th Annual IEEE/ACM International Symposium on Microarchitecture (Micro'2015). A Graphic Processing Unit (GPU) system is typically equipped with many types of memory (e.g., global, constant, texture, shared, cache). Data placement determines what data are placed on which type of memory, essential for GPU memory performance. Prior optimizations of data placement always require a single view of a data object on memory, which limits the optimization effectiveness. In this work, we propose coherence-free multiview, an approach that allows multiple views of a single data object to co-exist on GPU memory during a GPU kernel execution. We demonstrate that under certain conditions, the multiple views can remain incoherent while facilitating enhanced data placement. We present a theorem and some compiler support to ensure the soundness of the usage of coherence-free multiview. We further develop reference-discerning data placement, a new way to enhance data placements on GPU. It enables more flexible data placements by using coherence-free multiview to leverage the slack in coherence requirement of some GPU programs. Experiments on three types of GPU systems show that, with less than 200KB space cost, the new data placement technique can provide a 1.6X average (up to 4.27X) speedup. In addition, we have examined algorithmic optimizations to data analytics problems, especially those that involve lots of distance calculations. Computing distances among data points is an essential part of many important algorithms in data analytics, graph analysis, and other domains. In each of these domains, developers have spent significant manual effort optimizing algorithms, often through novel applications of the triangle equality, in order to minimize the number of distance computations in the algorithms. In this work, we observe that many algorithms across these domains can be generalized as an instance of a generic distance-related abstraction. Based on this abstraction, we derive seven principles for correctly applying the triangular inequality to optimize distance-related algorithms. Guided by the findings, we develop Triangular OPtimizer (TOP), the first software framework that is able to automatically produce optimized algorithms that either matches or outperforms manually designed algorithms for solving distance-related problems. TOP achieves up to 237x speedups and 2.5X on average. The work has been published at the 32nd International Conference on Machine Learning (ICML'15) and the 41st International Conference on Very Large Data Bases (VLDB'15).

42 ENGINEERING↗

Investigation of Optimal Control Allocation for Gust Load Alleviation in Flight Control

Advances in sensors and avionics computation power suggest real-time structural load measurements could be used in flight control systems for improved safety and performance. A conventional transport flight control system determines the moments necessary to meet the pilot's command, while rejecting disturbances and maintaining stability of the aircraft. Control allocation is the problem of converting these desired moments into control effector commands. In this paper, a framework is proposed to incorporate real-time structural load feedback and structural load constraints in the control allocator. Constrained optimal control allocation can be used to achieve desired moments without exceeding specified limits on monitored load points. Minimization of structural loads by the control allocator is used to alleviate gust loads. The framework to incorporate structural loads in the flight control system and an optimal control allocation algorithm will be described and then demonstrated on a nonlinear simulation of a generic transport aircraft with flight dynamics and static structural loads.

Frost, Susan A.↗

Multi-Objective Cycle Optimization of an Integrally Geared Waste Heat Recovery Unit for a Combined Cycle Power System

This paper has presented the cycle design and optimization details for a sCO2-based WHRS targeting the Solar Turbines Titan 130. The PreheatSR cycle layout was chosen to effectively address the issue of acid dew point corrosion and ensure high system performance is not significantly impacted by use of alternative fuels. The optimization process discussed uses a multi-objective optimization to discover a series of optimal cycle configurations given ambient temperature variability for a chosen site location while considering the initial capital cost of the cycle components. Cycle models built that incorporated off-design methods for the heat exchangers and turbomachinery allowed for the investigation of cycle operation that maximizes power output for individual cycle conditions. The resulting Pareto front serves as a guide for how to configure the WHRS cycle for the highest yearly energy extracted for a given investment.

20 FOSSIL-FUELED POWER PLANTS↗

Optimal guidance and propulsion control for transatmospheric vehicles

Problems associated with on-board trajectory optimization and with the synthesis of guidance laws are addressed for ascent to LEO of an air-breathing, single-stage-to-orbit vehicle. A multimode propulsion system is assumed which incorporates turbojet, ramjet, scramjet, and rocket engines. An energy-state approximation is applied to a four-state dynamic model for flight of a point mass over a spherical nonrotating earth. An algorithm for generating fuel-optimal climb profiles is derived via singular perturbation theory. This algorithm results from application of the minimum principle to a low-order dynamic model that includes general functional dependence on angle of attack and a normal component of thrust. Switching conditions are derived which, under appropriate assumptions, govern optimal transition from one propulsion mode to another. The use of bank angle to modulate the magnitude of the vertical component of lift is shown to improve the index performance. Numerical results illustrate the nature of the resulting fuel-optimal climb paths.

Corban, J. E.↗

Effective detective quantum efficiency for two mammography systems: Measurement and comparison against established metrics

Purpose: The aim of this paper was to illustrate the value of the new metric effective detective quantum efficiency (eDQE) in relation to more established measures in the optimization process of two digital mammography systems. The following metrics were included for comparison against eDQE: detective quantum efficiency (DQE) of the detector, signal difference to noise ratio (SdNR), and detectability index (d′) calculated using a standard nonprewhitened observer with eye filter.Methods: The two systems investigated were the Siemens MAMMOMAT Inspiration and the Hologic Selenia Dimensions. The presampling modulation transfer function (MTF) required for the eDQE was measured using two geometries: a geometry containing scattered radiation and a low scatter geometry. The eDQE, SdNR, and d′ were measured for poly(methyl methacrylate) (PMMA) thicknesses of 20, 40, 60, and 70 mm, with and without the antiscatter grid and for a selection of clinically relevant target/filter (T/F) combinations. Figures of merit (FOMs) were then formed from SdNR and d′ using the mean glandular dose as the factor to express detriment. Detector DQE was measured at energies covering the range of typical clinically used spectra.Results: The MTF measured in the presence of scattered radiation showed a large drop at low spatial frequency compared to the low scatter method and led to a corresponding reduction in eDQE. The eDQE for the Siemens system at 1 mm{sup −1} ranged between 0.15 and 0.27, depending on T/F and grid setting. For the Hologic system, eDQE at 1 mm{sup −1} varied from 0.15 to 0.32, again depending on T/F and grid setting. The eDQE results for both systems showed that the grid increased the system efficiency for PMMA thicknesses of 40 mm and above but showed only small sensitivity to T/F setting. While results of the SdNR and d′ based FOMs confirmed the eDQE grid position results, they were also more specific in terms of T/F selection. For the Siemens system at 20 mm PMMA, the FOMs indicated Mo/Mo (grid out) as optimal while W/Rh (grid in) was the optimal configuration at 40, 60, and 70 mm PMMA. For the Hologic, the FOMs pointed to W/Rh (grid in) at 20 and 40 mm of PMMA while W/Ag (grid in) gave the highest FOM at 60 and 70 mm PMMA. Finally, DQE at 1 mm{sup −1} averaged for the four beam qualities studied was 0.44 ± 0.02 and 0.55 ± 0.03 for the Siemens and Hologic detectors, respectively, indicating only a small influence of energy on detector DQE.Conclusions: Both the DQE and eDQE data showed only a small sensitivity to T/F setting for these two systems. The eDQE showed clear preferences in terms of scatter reduction, being highest for the grid-in geometry for PMMA thicknesses of 40 mm and above. The SdNR and d′ based figures of merit, which contain additional weighting for contrast and dose, pointed to specific T/F settings for both systems.

62 RADIOLOGY AND NUCLEAR MEDICINE↗

Constructing the Pareto front for multi-objective Markov chains handling a strong Pareto policy approach

In this paper, we present a multi-objective solution of the Pareto front for a certain class of discrete-time ergodic controllable Markov chains. For solving the problem, we transform the original multi-objective problem into an equivalent nonlinear programming problem implementing the Lagrange principle. We then propose to adopt the Tikhonov’s regularization method to ensure the convergence of the cost functions to a unique point into the Pareto front. We show that Pareto policies are characterized as optimal policies. One of the fundamental problems related to the construction of the Pareto front is the existence and characterization of both, Pareto and strong Pareto policies. By introducing the Tikhonov’s regularizator, we ensure the existence of strong Pareto policies. This paper proposes a real solution to this problem. We formulate the original problem considering several constraints: (a) we employ the c-variable method for the introduction of linear constraints over the nonlinear problem and (b) restrict the cost functions, allowing points in the Pareto front to have a small distance from one another. The constraints imposed by the c-variable method make the problem computationally tractable and the restriction imposed by the small distance change ensures the continuation of the Pareto front. The resulting equation in this nonlinear system is an optimization problem for which the necessary and efficient condition of a minimum is solved using the projected gradient method. Moreover, we also prove the convergence conditions and compute the estimate rate of convergence of variables corresponding to the Lagrange principle and the Tikhonov’s regularization, respectively. We provide all the details needed to implement the proposed method in an efficient way. The usefulness of the method is successfully demonstrated by a numerical example.

97 MATHEMATICS AND COMPUTING↗

Altitude/path-angle transitions in fuel-optimal problems for transport aircraft

Altitude/path angle transitions to fuel-optimal, energy climb and descent paths are examined for subsonic transport aircraft. These transitions are termed boundary layers in singular perturbation theory, the framework used herein to simplify solutions to the state-Euler system. The energy climb and descent paths provide equilibrium or stationary points for the boundary layer system, and thus for moderate transitions, presumed valid for the class of aircraft considered, the boundary layer system may be linearized. This simplification allows derivation of an explicit solution to the two-point boundary-value, boundary layer problem and, as a consequence, yields a nearly optimal control law, in feedback form, for the transitions. Numerical simulation results using the feedback control law are presented for a Boeing 737 airframe (NASA-ATOPS Vehicle) employing twin JT8D-7-7A engines.

Gracey, C.↗

Treatment planning for volumetric modulated arc therapy

Purpose: Volumetric modulated arc therapy (VMAT) is a specific type of intensity-modulated radiation therapy (IMRT) in which the gantry speed, multileaf collimator (MLC) leaf position, and dose rate vary continuously during delivery. A treatment planning system for VMAT is presented. Methods: Arc control points are created uniformly throughout one or more arcs. An iterative least-squares algorithm is used to generate a fluence profile at every control point. The control points are then grouped and all of the control points in a given group are used to approximate the fluence profiles. A direct-aperture optimization is then used to improve the solution, taking into account the allowed range of leaf motion of the MLC. Dose is calculated using a fast convolution algorithm and the motion between control points is approximated by 100 interpolated dose calculation points. The method has been applied to five cases, consisting of lung, rectum, prostate and seminal vesicles, prostate and pelvic lymph nodes, and head and neck. The resulting plans have been compared with segmental (step-and-shoot) IMRT and delivered and verified on an Elekta Synergy to ensure practicality. Results: For the lung, prostate and seminal vesicles, and rectum cases, VMAT provides a plan of similar quality to segmental IMRT but with faster delivery by up to a factor of 4. For the prostate and pelvic nodes and head-and-neck cases, the critical structure doses are reduced with VMAT, both of these cases having a longer delivery time than IMRT. The plans in general verify successfully, although the agreement between planned and measured doses is not very close for the more complex cases, particularly the head-and-neck case. Conclusions: Depending upon the emphasis in the treatment planning, VMAT provides treatment plans which are higher in quality and/or faster to deliver than IMRT. The scheme described has been successfully introduced into clinical use.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

Extremophiles in astrobiology: per Ardua ad Astra

As we consider the possibilities of finding life on other planets, it behooves us to evaluate what we know about the limits for life on planet Earth. In our continued exploration of Earth, we are finding microbes in a variety of unexpected habitats. In geothermal hot springs, we have discovered organisms thriving at temperatures near the boiling point of water and at pH values down to 0.5; in the deepest parts of the oceans, those that grow optimally at pressures above 1000 bars and die at pressures below 500 bars; and at the poles, those that grow below the freezing point of water and die at temperatures above 10 degrees C. All of these organisms are living proof that the biochemical "machinery" of life can be adapted to conditions that, from our anthropocentric perspective, appear to be extreme. By studying the molecular adaptations of extremophiles, we begin to identify the critical cellular components that expand the envelope for life. As an example, I will discuss what we have learned about the role of the proteins we call "heat shock proteins" in pushing the upper temperature limit of life and how our studies have provided a new perspective on the function of these proteins.

Chaperonin 60/physiology↗