Search NASA⌕ Search

SEARCH · Search NASA

Results for “Value function”

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 469 records · Page 26
All sourcesNASA NTRSDOE OSTI
NASA NTRS1996

The Three-Dimensional Spatial Structure of Cirrus Clouds Determined from Lidar Satellite Observations

Simultaneous imagery from the University of Wisconsin Volume Imaging Lidar (VIL) and meteorological satellites were used to quantify the spatial structure of cirrus clouds with 60 m resolution. This data was used to determine the spatial distributions of cloud base altitude, cloud top altitude, and mid-cloud altitude. Two dimensional auto-correlation functions describing the mean shape of cirrus clouds were computed. Because cirrus clouds seldom have distinct edges, these correlation functions are derived as a function of a threshold value which defines the cloud edge.

Eloranta, E. W.↗
NASA NTRS1999

Demonstration of Automatically-Generated Adjoint Code for Use in Aerodynamic Shape Optimization

Gradient-based optimization requires accurate derivatives of the objective function and constraints. These gradients may have previously been obtained by manual differentiation of analysis codes, symbolic manipulators, finite-difference approximations, or existing automatic differentiation (AD) tools such as ADIFOR (Automatic Differentiation in FORTRAN). Each of these methods has certain deficiencies, particularly when applied to complex, coupled analyses with many design variables. Recently, a new AD tool called ADJIFOR (Automatic Adjoint Generation in FORTRAN), based upon ADIFOR, was developed and demonstrated. Whereas ADIFOR implements forward-mode (direct) differentiation throughout an analysis program to obtain exact derivatives via the chain rule of calculus, ADJIFOR implements the reverse-mode counterpart of the chain rule to obtain exact adjoint form derivatives from FORTRAN code. Automatically-generated adjoint versions of the widely-used CFL3D computational fluid dynamics (CFD) code and an algebraic wing grid generation code were obtained with just a few hours processing time using the ADJIFOR tool. The codes were verified for accuracy and were shown to compute the exact gradient of the wing lift-to-drag ratio, with respect to any number of shape parameters, in about the time required for 7 to 20 function evaluations. The codes have now been executed on various computers with typical memory and disk space for problems with up to 129 x 65 x 33 grid points, and for hundreds to thousands of independent variables. These adjoint codes are now used in a gradient-based aerodynamic shape optimization problem for a swept, tapered wing. For each design iteration, the optimization package constructs an approximate, linear optimization problem, based upon the current objective function, constraints, and gradient values. The optimizer subroutines are called within a design loop employing the approximate linear problem until an optimum shape is found, the design loop limit is reached, or no further design improvement is possible due to active design variable bounds and/or constraints. The resulting shape parameters are then used by the grid generation code to define a new wing surface and computational grid. The lift-to-drag ratio and its gradient are computed for the new design by the automatically-generated adjoint codes. Several optimization iterations may be required to find an optimum wing shape. Results from two sample cases will be discussed. The reader should note that this work primarily represents a demonstration of use of automatically- generated adjoint code within an aerodynamic shape optimization. As such, little significance is placed upon the actual optimization results, relative to the method for obtaining the results.

Green, Lawrence↗
NASA NTRS1999

Estimating the Effects of Sensor Spacing on Peak Wind Measurements at Launch Complex 39

This paper presents results of an empirical study to estimate the measurement error in the peak wind speed at Shuttle Launch Complex 39 (LC-39) which results from the measurement being made by sensors 1,300 feet away. Quality controlled data taken at a height of 30 feet from an array of sensors at the Shuttle Landing Facility (SLF) were used to model differences of peak winds as a function of separation distance and time interval. The SLF data covered wind speeds from less than ten to more than 25 knots. Winds measured at the standard LC-39 site at the normal height of 60 feet were used to verify the applicability of the model to the LC-39 situation. The error in the peak wind speed resulting from separation of the sensor from the target site obeys a power law as a function of separation distance and varies linearly with mean wind speed. At large separation distances, the error becomes a constant fraction of the mean wind speed as the separation function reaches an asymptotic value. The asymptotic average of the mean of the absolute difference in the peak wind speed between the two locations is about twelve percent of the mean wind speed. The distribution of the normalized absolute differences is half-Gaussian.

Merceret, Francis J.↗
NASA NTRS2001

Additive Runge-Kutta Schemes for Convection-Diffusion-Reaction Equations

Additive Runge-Kutta (ARK) methods are investigated for application to the spatially discretized one-dimensional convection-diffusion-reaction (CDR) equations. First, accuracy, stability, conservation, and dense output are considered for the general case when N different Runge-Kutta methods are grouped into a single composite method. Then, implicit-explicit, N = 2, additive Runge-Kutta ARK2 methods from third- to fifth-order are presented that allow for integration of stiff terms by an L-stable, stiffly-accurate explicit, singly diagonally implicit Runge-Kutta (ESDIRK) method while the nonstiff terms are integrated with a traditional explicit Runge-Kutta method (ERK). Coupling error terms are of equal order to those of the elemental methods. Derived ARK2 methods have vanishing stability functions for very large values of the stiff scaled eigenvalue, z(exp [I]) goes to infinity, and retain high stability efficiency in the absence of stiffness, z(exp [I]) goes to zero. Extrapolation-type stage-value predictors are provided based on dense-output formulae. Optimized methods minimize both leading order ARK2 error terms and Butcher coefficient magnitudes as well as maximize conservation properties. Numerical tests of the new schemes on a CDR problem show negligible stiffness leakage and near classical order convergence rates. However, tests on three simple singular-perturbation problems reveal generally predictable order reduction. Error control is best managed with a PID-controller. While results for the fifth-order method are disappointing, both the new third- and fourth-order methods are at least as efficient as existing ARK2 methods while offering error control and stage-value predictors.

Kennedy, Christopher A.↗
NASA NTRS1997

When Gravity Fails: Local Search Topology

Local search algorithms for combinatorial search problems frequently encounter a sequence of states in which it is impossible to improve the value of the objective function; moves through these regions, called {\em plateau moves), dominate the time spent in local search. We analyze and characterize {\em plateaus) for three different classes of randomly generated Boolean Satisfiability problems. We identify several interesting features of plateaus that impact the performance of local search algorithms. We show that local minima tend to be small but occasionally may be very large. We also show that local minima can be escaped without unsatisfying a large number of clauses, but that systematically searching for an escape route may be computationally expensive if the local minimum is large. We show that plateaus with exits, called benches, tend to be much larger than minima, and that some benches have very few exit states which local search can use to escape. We show that the solutions (i.e. global minima) of randomly generated problem instances form clusters, which behave similarly to local minima. We revisit several enhancements of local search algorithms and explain their performance in light of our results. Finally we discuss strategies for creating the next generation of local search algorithms.

Frank, Jeremy↗
NASA NTRS2002

Infrared Spectroscopy of Matrix-Isolated Polycyclic Aromatic Compounds and their Ions: Polycyclic Aromatic Nitrogen Heterocycles - 6

The matrix-isolation technique has been employed to measure the mid-infrared spectra of several polycyclic aromatic nitrogen heterocycles in both neutral and cationic forms. The species studied include: 7,8 benzoquinoline (C13H9N); 2-azapyrene (C15H9N); 1- and 2-azabenz(a)anthracene (C17H11N); and 1-, 2-, and 4-azachrysene (also C17H11N). The experimentally measured band frequencies and intensities for each molecule are tabulated and compared with their theoretically calculated values computed using density functional theory at the B3LYP/4-31G level. The overall agreement between experiment and theory is quite good, in keeping with previous investigations involving the parent aromatic hydrocarbons. Several interesting spectroscopic trends are found to accompany nitrogen substitution into the aromatic framework of these compounds. First, for the neutral species, the nitrogen atom produces a significant increase in the total integrated infrared intensity across the 1600 - 1100/cm region and plays an essential role in the molecular vibration that underlies an uncharacteristically intense, discrete feature that is observed near 1400/cm in the spectra of 7,8 benzoquinoline, 1-azabenz(a)anthracene, and 4-azachrysene. The origin of this enhanced infrared activity and the nature of the new 1400/cm vibrational mode are explored. Finally, in contrast to the parent hydrocarbon species, these aromatic nitrogen heterocycles possess a significant permanent dipole moment. Consequently, these dipole moments and the rotational constants are reported for these species in their neutral and ionized forms.

Mattioda, A. L.↗
NASA NTRS2002

Additive Runge-Kutta Schemes for Convection-Diffusion-Reaction Equations

Additive Runge-Kutta (ARK) methods are investigated for application to the spatially discretized one- dimensional convection-diffusion-reaction (CDR) equations. Accuracy, stability, conservation, and dense-output are first considered for the general case when N different Runge-Kutta methods are grouped into a single composite method. Then, implicit-explicit, (N = 2), additive Runge-Kutta (ARK(sub 2)) methods from third- to fifth-order are presented that allow for integration of stiff terms by an L-stable, stiffly-accurate explicit, singly diagonally implicit Runge-Kutta (ESDIRK) method while the nonstiff terms are integrated with a traditional explicit Runge-Kutta method (ERK). Coupling error terms of the partitioned method are of equal order to those of the elemental methods. Derived ARK(sub 2) methods have vanishing stability functions for very large values of the stiff scaled eigenvalue, z['] yields -infinity, and retain high stability efficiency in the absence of stiffness, z['] yield 0. Extrapolation-type stage- value predictors are provided based on dense-output formulae. Optimized methods minimize both leading order ARK(sub 2) error terms and Butcher coefficient magnitudes as well as maximize conservation properties. Numerical tests of the new schemes on a CDR problem show negligible stiffness leakage and near classical order convergence rates. However, tests on three simple singular-perturbation problems reveal generally predictable order reduction. Error control is best managed with a PID-controller. While results for the fifth-order method are disappointing, both the new third- and fourth-order methods are at least as efficient as existing ARK(sub 2) methods.

Kennedy, Christopher A.↗
NASA NTRS2003

Further Developments in the MLPG Method for Beam Problems

An accurate and yet simple Meshless Local Petrov-Galerkin (MLPG) formulation for analyzing beam problems is presented. In the formulation, simple weight functions are chosen as test functions as in the conventional MLPG method. Linear test functions are also chosen, leading to a variation of the MLPG method that is computationally efficient compared to the conventional implementation. The MLPG method is evaluated by applying the formulation to a variety of patch tests, thin beam problems, and problems with load discontinuities. The formulation successfully reproduces exact solutions to machine accuracy when higher order power and spline functions are chosen as test functions or when the linear test function is used, and when constructing the trial functions, the order of the basis function is properly balanced by the order of the weight function. For mixed boundary value problems, deflections, slopes, moments, and shear forces are calculated to the same accuracy by the MLPG method without the use of elaborate post-processing techniques. Problems with load discontinuities require special care - when a reasonable number of nodes are used, the method yields very accurate results.

Raju, I. S.↗
NASA NTRS2002

The Effects of Proton Radiation on the Structure of Diamond Films

Diamond possesses many of the sought after material properties desired in present day applications and is also quite radiation resistant. These characteristics make it an ideal candidate for insertion into MicroElectroMechanical Systems (MEMS) technologies, particularly for space-based applications. Most prior radiation studies investigated single crystal, bulk diamond specimens, not polycrystalline thin films. This investigation examined the microstructural effects of irradiating polycrystalline diamond films with various proton dosages (10(exp 15) - 10(exp 17) H+/sq cm). Scanning Electron Microscopy, micro-Raman Spectroscopy, and micro-X-ray Diffraction techniques were used to examine the effects as a function of depth. Strain values were calculated. Results indicate that the diamond lattice is retained, even at maximum irradiation levels. Polycrystalline silicon was also examined for comparative purposes.

Newton, Robert Lee↗
NASA NTRS2001

Evaluation of New Actuators in a Buffet Loads Environment

Ongoing research in buffet loads alleviation has provided an application for recently developed piezoelectric actuators capable of higher force output than previously existing actuators could provide and that can be embedded within the vehicle s structure. These new actuators, having interdigitated electrodes, promise increased performance over previous piezoelectric actuators that were tested on the fin of an F/A-18 aircraft. Two new actuators being considered by the United States Air Force to reduce buffet loads on high performance aircraft were embedded into the fins of an F/A-18 wind-tunnel model and tested in the Transonic Dynamics Tunnel at the NASA Langley Research Center. The purpose of this test program, called ENABLE (Evaluation of New Actuators in a Buffet Loads Environment), was to examine the performance of the new actuators in alleviating fin buffeting, leading to a systems -level study of a fin buffet loads alleviation system architecture being considered by the USAF, Boeing, and NASA for implementation on high performance aircraft. During this windtunnel test, the two actuators performed superbly in alleviating fin buffeting. Peak values of the power spectral density functions for tip acceleration were reduced by as much as 85%. RMS values of tip acceleration were reduced by as much as 40% while using less than 50% of the actuators capacity. Details of the wind-tunnel model and results of the wind-tunnel test are provided herein.

Moses, Robert W.↗
NASA NTRS2006

Distributed Constrained Optimization with Semicoordinate Transformations

Recent work has shown how information theory extends conventional full-rationality game theory to allow bounded rational agents. The associated mathematical framework can be used to solve constrained optimization problems. This is done by translating the problem into an iterated game, where each agent controls a different variable of the problem, so that the joint probability distribution across the agents moves gives an expected value of the objective function. The dynamics of the agents is designed to minimize a Lagrangian function of that joint distribution. Here we illustrate how the updating of the Lagrange parameters in the Lagrangian is a form of automated annealing, which focuses the joint distribution more and more tightly about the joint moves that optimize the objective function. We then investigate the use of "semicoordinate" variable transformations. These separate the joint state of the agents from the variables of the optimization problem, with the two connected by an onto mapping. We present experiments illustrating the ability of such transformations to facilitate optimization. We focus on the special kind of transformation in which the statistically independent states of the agents induces a mixture distribution over the optimization variables. Computer experiment illustrate this for &sat constraint satisfaction problems and for unconstrained minimization of NK functions.

Macready, William↗
NASA NTRS2009

Optimization of digital designs

An application specific integrated circuit is optimized by translating a first representation of its digital design to a second representation. The second representation includes multiple syntactic expressions that admit a representation of a higher-order function of base Boolean values. The syntactic expressions are manipulated to form a third representation of the digital design.

Whitaker, Sterling R.↗
NASA NTRS2009

A Method for Scheduling Air Traffic with Uncertain En Route Capacity Constraints

A method for scheduling ground delay and airborne holding for flights scheduled to fly through airspace with uncertain capacity constraints is presented. The method iteratively solves linear programs for departure rates and airborne holding as new probabilistic information about future airspace constraints becomes available. The objective function is the expected value of the weighted sum of ground and airborne delay. In order to limit operationally costly changes to departure rates, they are updated only when such an update would lead to a significant cost reduction. Simulation results show a 13% cost reduction over a rough approximation of current practices. Comparison between the proposed as needed replanning method and a similar method that uses fixed frequency replanning shows a typical cost reduction of 1% to 2%, and even up to a 20% cost reduction in some cases.

Arneson, Heather↗
NASA NTRS2005

Faster Evolution of More Multifunctional Logic Circuits

A modification in a method of automated evolutionary synthesis of voltage-controlled multifunctional logic circuits makes it possible to synthesize more circuits in less time. Prior to the modification, the computations for synthesizing a four-function logic circuit by this method took about 10 hours. Using the method as modified, it is possible to synthesize a six-function circuit in less than half an hour. The concepts of automated evolutionary synthesis and voltage-controlled multifunctional logic circuits were described in a number of prior NASA Tech Briefs articles. To recapitulate: A circuit is designed to perform one of several different logic functions, depending on the value of an applied control voltage. The circuit design is synthesized following an automated evolutionary approach that is so named because it is modeled partly after the repetitive trial-and-error process of biological evolution. In this process, random populations of integer strings that encode electronic circuits play a role analogous to that of chromosomes. An evolved circuit is tested by computational simulation (prior to testing in real hardware to verify a final design). Then, in a fitness-evaluation step, responses of the circuit are compared with specifications of target responses and circuits are ranked according to how close they come to satisfying specifications. The results of the evaluation provide guidance for refining designs through further iteration.

Stoica, Adrian↗
NASA NTRS2004

Masked Proportional Routing

Masked proportional routing is an improved procedure for choosing links between adjacent nodes of a network for the purpose of transporting an entity from a source node ("A") to a destination node ("B"). The entity could be, for example, a physical object to be shipped, in which case the nodes would represent waypoints and the links would represent roads or other paths between waypoints. For another example, the entity could be a message or packet of data to be transmitted from A to B, in which case the nodes could be computer-controlled switching stations and the links could be communication channels between the stations. In yet another example, an entity could represent a workpiece while links and nodes could represent, respectively, manufacturing processes and stages in the progress of the workpiece towards a finished product. More generally, the nodes could represent states of an entity and the links could represent allowed transitions of the entity. The purpose of masked proportional routing and of related prior routing procedures is to schedule transitions of entities from their initial states ("A") to their final states ("B") in such a manner as to minimize a cost or to attain some other measure of optimality or efficiency. Masked proportional routing follows a distributed (in the sense of decentralized) approach to probabilistically or deterministically choosing the links. It was developed to satisfy a need for a routing procedure that 1. Does not always choose the same link(s), even for two instances characterized by identical estimated values of associated cost functions; 2. Enables a graceful transition from one set of links to another set of links as the circumstances of operation of the network change over time; 3. Is preferably amenable to separate optimization of different portions of the network; 4. Is preferably usable in a network in which some of the routing decisions are made by one or more other procedure(s); 5. Preferably does not cause an entity to visit the same node twice; and 6. Preferably can be modified so that separate entities moving from A to B do not arrive out of order.

Wolpert, David↗
NASA NTRS2012

Detection of Bi-Directionality in Strain-Gage Balance Calibration Data

An indicator variable was developed for both visualization and detection of bi-directionality in wind tunnel strain-gage balance calibration data. First, the calculation of the indicator variable is explained in detail. Then, a criterion is discussed that may be used to decide which gage outputs of a balance have bi- directional behavior. The result of this analysis could be used, for example, to justify the selection of certain absolute value or other even function terms in the regression model of gage outputs whenever the Iterative Method is chosen for the balance calibration data analysis. Calibration data of NASA s MK40 Task balance is analyzed to illustrate both the calculation of the indicator variable and the application of the proposed criterion. Finally, bi directionality characteristics of typical multi piece, hybrid, single piece, and semispan balances are determined and discussed.

Ulbrich, Norbert↗
NASA NTRS2020

SNPP and N20 VIIRS Solar Vector Orientation Knowledge Error Detected by SDSM Sun Views

The Visible Infrared Imaging Radiometer Suite (VIIRS) is a passive scanning Earth observing satellite radiometer. The VIIRS has 22 spectral bands with design center wavelengths from 0.41 to 12.01 μm, providing data to generate more than 20 Earth’s biogeophysical parameters. Fourteen of the 22 VIIRS bands are the reflective solar bands (RSBs), detecting Earth reflected sunlight. To ensure data quality, regular on-orbit radiometric calibrations of the RSBs are performed, mainly through observations of an onboard solar diffuser (SD). The spectral radiance provided by the sunlit SD depends on the SD screen transmittance which is a function of the solar vector orientation. Additionally, on orbit the SD’s bidirectional reflectance distribution function (BRDF) changes its value due to solar bombardment. The BRDF change is derived from the SD stability monitor (SDSM) measurements. The SDSM views the Sun through a screen with through holes (the SDSM screen) and the SD at almost the same time. The time series of the ratio of the signal strengths is a measure of the SD BRDF on-orbit change. Hence the measurements of the on-orbit SD BRDF change depends on the SDSM screen relative transmittance which is also solar vector orientation dependent. In this paper for both the SNPP and the NOAA-20 VIIRS instruments we examine the solar vector orientation knowledge error through matching the SDSM screen relative effective transmittances derived from the calibration data collected on the yaw maneuver and the regular orbits.

SNPP↗
NASA NTRS2019

Determination of the solar angular dependence of the NOAA-20 VIIRS solar diffuser BRDF change factor

When fully illuminated by the Sun, the solar diffuser (SD) onboard of the NOAA-20 Visible Infrared Imaging Radiometer Suite (VIIRS) instrument provides a radiance source to allow for radiometric calibration of the VIIRS’s reflective solar bands (RSBs). Once on-orbit, due to solar bombardment and the space environment, the SD’s bidirectional reflectance distribution function (BRDF) changes its value. The change is denoted by a factor, known as the H-factor, that is time and wavelength dependent, as well as both incident and out-going angle dependent. Here, we use regular on-orbit solar diffuser stability monitor (SDSM) data to determine the solar angular dependence for the H-factor along the SD-to-SDSM direction. We compare the dependence with that for the VIIRS on the Suomi National Polar-orbiting Partnership satellite and apply the dependence ratio to obtain the N20 VIIRS SD H-factor along the SD-telescope direction.

N20 VIIRS↗