Search NASA⌕ Search

SEARCH · Search NASA

Results for “Smoothing algorithm”

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 235 records · Page 13

Target Recognition Using Neural Networks for Model Deformation Measurements

Optical measurements provide a non-invasive method for measuring deformation of wind tunnel models. Model deformation systems use targets mounted or painted on the surface of the model to identify known positions, and photogrammetric methods are used to calculate 3-D positions of the targets on the model from digital 2-D images. Under ideal conditions, the reflective targets are placed against a dark background and provide high-contrast images, aiding in target recognition. However, glints of light reflecting from the model surface, or reduced contrast caused by light source or model smoothness constraints, can compromise accurate target determination using current algorithmic methods. This paper describes a technique using a neural network and image processing technologies which increases the reliability of target recognition systems. Unlike algorithmic methods, the neural network can be trained to identify the characteristic patterns that distinguish targets from other objects of similar size and appearance and can adapt to changes in lighting and environmental conditions.

Ross, Richard W.↗

Modifications Of Discrete Ordinate Method For Computations With High Scattering Anisotropy: Comparative Analysis

A numerical accuracy analysis of the radiative transfer equation (RTE) solution based on separation of the diffuse light field into anisotropic and smooth parts is presented. The analysis uses three different algorithms based on the discrete ordinate method (DOM). Two methods, DOMAS and DOM2+, that do not use the truncation of the phase function, are compared against the TMS-method. DOMAS and DOM2+ use the Small-Angle Modification of RTE and the single scattering term, respectively, as an anisotropic part. The TMS method uses Delta-M method for truncation of the phase function along with the single scattering correction. For reference, a standard discrete ordinate method, DOM, is also included in analysis. The obtained results for cases with high scattering anisotropy show that at low number of streams (16, 32) only DOMAS provides an accurate solution in the aureole area. Outside of the aureole, the convergence and accuracy of DOMAS, and TMS is found to be approximately similar: DOMAS was found more accurate in cases with coarse aerosol and liquid water cloud models, except low optical depth, while the TMS showed better results in case of ice cloud.

Korkin, Sergey V.↗

Validations of Satellite Ozone Profiles in Austral Spring Using Ozonesonde Measurements in the Jang Bogo Station, Antarctica

Using ozonesonde measurements from 2015 to 2018 at the Jang Bogo station located in the southeastern Antarctic region, we evaluate ozone profiles retrieved from the three satellite measurements that are widely used: Ozone Monitoring Instrument (OMI), Microwave Limb Sounder (MLS), and Ozone Mapping Profiler Suite (OMPS) data. For the fair validation, ozonesonde profiles are smoothed using the weighting function of each satellite retrieval algorithm (i.e., convolution process). Compared with limb-viewing MLS and OMPS ozone profiles, the OMI ozone profiles are relatively less qualified: coarser vertical resolution and larger inter-annual variation. Nevertheless, our validation reveals that the quality of all three satellite ozone profiles looks comparable; In general, difference from ozonesonde profile is ∼1 ppm absolutely, and −20 to 30% relatively at maximum. This quantitative range well corresponds to previous work, meaning that our new validation confirms the reliability of satellite ozone profiles in the southeastern Antarctic region where the measurement data for the validation were not enough. Another interesting feature is the role of a priori ozone profile; Nadir-viewing OMI satellite can have qualified ozone profiles by a proper assumption of a priori ozone profile. Since the performance of limb-viewing ozone profiles is better, however, the careful usage of nadir-viewing ozone profile is still required. We think that the simultaneous usage of multiple satellite ozone profiles can contribute to better understanding of Antarctic ozone characteristics.

Antarctica↗

Microwave Signatures of Snow on Sea Ice: Observations

Part of the Earth Observing System Aqua Advanced Microwave Scanning Radiometer (AMSR-E) Arctic sea ice validation campaign in March 2003 was dedicated to the validation of snow depth on sea ice and ice temperature products. The difficulty with validating these two variables is that neither can currently be measured other than in situ. For this reason, two aircraft flights on March 13 and 19,2003, were dedicated to these products, and flight lines were coordinated with in situ measurements of snow and sea ice physical properties. One flight was in the vicinity of Barrow, AK, covering Elson Lagoon and the adjacent Chukchi and Beaufort Seas. The other flight was farther north in the Beaufort Sea (about 73 N, 147.5 W) and was coordinated with a Navy ice camp. The results confirm the AMSR-E snow depth algorithm and its coefficients for first-year ice when it is relatively smooth. For rough first-year ice and for multiyear ice, there is still a relationship between the spectral gradient ratio of 19 and 37 GHz, but a different set of algorithm coefficients is necessary. Comparisons using other AMSR-E channels did not provide a clear signature of sea ice characteristics and, hence, could not provide guidance for the choice of algorithm coefficients. The limited comparison of in situ snow-ice interface and surface temperatures with 6-GHz brightness temperatures, which are used for the retrieval of ice temperature, shows that the 6-GHz temperature is correlated with the snow-ice interface temperature to only a limited extent. For strong temperature gradients within the snow layer, it is clear that the 6-GHz temperature is a weighted average of the entire snow layer.

Markus, Thorsten↗

Bayesian sparse learning with preconditioned stochastic gradient MCMC and its applications

Deep neural networks have been successfully employed in an extensive variety of research areas, including solving partial differential equations. Despite its significant success, there are some challenges in effectively training DNN, such as avoiding overfitting in over-parameterized DNNs and accelerating the optimization in DNNs with pathological curvature. Here, we propose a Bayesian type sparse deep learning algorithm. The algorithm utilizes a set of spike-and-slab priors for the parameters in the deep neural network. The hierarchical Bayesian mixture will be trained using an adaptive empirical method. That is, one will alternatively sample from the posterior using preconditioned stochastic gradient Langevin Dynamics (PSGLD), and optimize the latent variables via stochastic approximation. The sparsity of the network is achieved while optimizing the hyperparameters with adaptive searching and penalizing. A popular SG-MCMC approach is Stochastic gradient Langevin dynamics (SGLD). However, considering the complex geometry in the model parameter space in nonconvex learning, updating parameters using a universal step size in each component as in SGLD may cause slow mixing. To address this issue, we apply a computationally manageable preconditioner in the updating rule, which provides a step-size parameter to adapt to local geometric properties. Moreover, by smoothly optimizing the hyperparameter in the preconditioning matrix, our proposed algorithm ensures a decreasing bias, which is introduced by ignoring the correction term in the preconditioned SGLD. According to the existing theoretical framework, we show that the proposed algorithm can asymptotically converge to the correct distribution with a controllable bias under mild conditions. Numerical tests are performed on both synthetic regression problems and learning solutions of elliptic PDE, which demonstrate the accuracy and efficiency of the present work.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Enhanced Fuel-Optimal Trajectory-Generation Algorithm for Planetary Pinpoint Landing

An enhanced algorithm is developed that builds on a previous innovation of fuel-optimal powered-descent guidance (PDG) for planetary pinpoint landing. The PDG problem is to compute constrained, fuel-optimal trajectories to land a craft at a prescribed target on a planetary surface, starting from a parachute cut-off point and using a throttleable descent engine. The previous innovation showed the minimal-fuel PDG problem can be posed as a convex optimization problem, in particular, as a Second-Order Cone Program, which can be solved to global optimality with deterministic convergence properties, and hence is a candidate for onboard implementation. To increase the speed and robustness of this convex PDG algorithm for possible onboard implementation, the following enhancements are incorporated: 1) Fast detection of infeasibility (i.e., control authority is not sufficient for soft-landing) for subsequent fault response. 2) The use of a piecewise-linear control parameterization, providing smooth solution trajectories and increasing computational efficiency. 3) An enhanced line-search algorithm for optimal time-of-flight, providing quicker convergence and bounding the number of path-planning iterations needed. 4) An additional constraint that analytically guarantees inter-sample satisfaction of glide-slope and non-sub-surface flight constraints, allowing larger discretizations and, hence, faster optimization. 5) Explicit incorporation of Mars rotation rate into the trajectory computation for improved targeting accuracy. These enhancements allow faster convergence to the fuel-optimal solution and, more importantly, remove the need for a "human-in-the-loop," as constraints will be satisfied over the entire path-planning interval independent of step-size (as opposed to just at the discrete time points) and infeasible initial conditions are immediately detected. Finally, while the PDG stage is typically only a few minutes, ignoring the rotation rate of Mars can introduce 10s of meters of error. By incorporating it, the enhanced PDG algorithm becomes capable of pinpoint targeting.

Acikmese, Behcet↗

A Blockchain and PKI-Based Secure Vehicle-to-Vehicle Energy-Trading Protocol

With the increasing awareness for sustainable future and green energy, the demand for electric vehicles (EVs) is growing rapidly, thus placing immense pressure on the energy grid. To alleviate this, local trading between EVs should be encouraged. In this paper, we propose a blockchain and public key infrastructure (PKI)-based secure vehicle-to-vehicle (V2V) energy-trading protocol. A permissioned blockchain utilizing the proof of authority (PoA) consensus and smart contracts is used to securely store data. Encrypted communication is ensured through transport layer security (TLS), with PKI managing the necessary digital certificates and keys. A multi-leader, multi-follower Stackelberg game-based trade algorithm is formulated to determine the optimal energy demands, supplies, and prices. Finally, we propose a detailed communication protocol that ties all the components together, enabling smooth interaction between them. Key findings, such as system behavior and performance, scalability of the trade algorithm and the blockchain, smart contract execution costs, etc., are presented through numerical results by implementing and simulating the protocol in various scenarios. This work not only enhances local energy trading among EVs, encouraging efficient energy usage and reducing burden on the power grid, but also paves a way for future research in sustainable energy management.

Stackelberg game↗

Learning classification trees

Algorithms for learning classification trees have had successes in artificial intelligence and statistics over many years. How a tree learning algorithm can be derived from Bayesian decision theory is outlined. This introduces Bayesian techniques for splitting, smoothing, and tree averaging. The splitting rule turns out to be similar to Quinlan's information gain splitting rule, while smoothing and averaging replace pruning. Comparative experiments with reimplementations of a minimum encoding approach, Quinlan's C4 and Breiman et al. Cart show the full Bayesian algorithm is consistently as good, or more accurate than these other approaches though at a computational price.

Buntine, Wray↗

A multiresolution wavelet representation in two or more dimensions

In the multiresolution approximation, a signal is examined on a hierarchy of resolution scales by projection onto sets of smoothing functions. Wavelets are used to carry the detail information connecting adjacent sets in the resolution hierarchy. An algorithm has been implemented to perform a multiresolution decomposition in n greater than or equal to 2 dimensions based on wavelets generated from products of 1-D wavelets and smoothing functions. The functions are chosen so that an n-D wavelet may be associated with a single resolution scale and orientation. The algorithm enables complete reconstruction of a high resolution signal from decomposition coefficients. The signal may be oversampled to accommodate non-orthogonal wavelet systems, or to provide approximate translational invariance in the decomposition arrays.

Bromley, B. C.↗

Statistical properties of filaments in the cosmic web

ABSTRACT In the context of the cosmological and constrained Exploring the Local Universe with the reConstructed Initial Density field (ELUCID) simulation, this study explores the statistical characteristics of filaments within the cosmic web, focussing on aspects such as the distribution of filament lengths and their radial density profiles. Using the classification of the cosmic web environment through the Hessian matrix of the density field, our primary focus is on how cosmic structures react to the two variables $R_{\rm s}$ and $\lambda _{\rm th}$. The findings show that the volume fractions of knots, filaments, sheets, and voids are highly influenced by the threshold parameter $\lambda _{\rm th}$, with only a slight influence from the smoothing length $R_{\rm s}$. The central axis of the cylindrical filament is pinpointed using the medial-axis thinning algorithm of the COsmic Web Skeleton (COWS) method. It is observed that median filament lengths tend to increase as the smoothing lengths increase. Analysis of filament length functions at different values of $R_{\rm s}$ indicates a reduction in shorter filaments and an increase in longer filaments as $R_{\rm s}$ increases, peaking around $2.5R_{\rm s}$. The study also shows that the radial density profiles of filaments are markedly affected by the parameters $R_{\rm s}$ and $\lambda _{\rm th}$, showing a valley at approximately $2R_{\rm s}$, with increases in the threshold leading to higher amplitudes of the density profile. Moreover, shorter filaments tend to have denser profiles than their longer counterparts.

Zhang, Youcai (ORCID:0000000319674091)↗

Development Support for NREL's System Advisor Model (SAM): Cooperative Research and Development, CRADA Number CRD-20-16998 (Final Report)

The variable nature of renewable generation, which depends on the sun shining and wind blowing for example, presents challenges for adequate and least-cost resource planning. The deployment of renewable generation assets is anticipated to increase due to various drivers, such as declining costs, favorable government policies, and increasing procurement by corporations and consumers. High levels of renewable penetration are anticipated to pose flexibility, reliability, and cost challenges to the electrical system. The development and implementation of new features into performance modeling software, such as the National Renewable Energy Laboratory's (NREL) System Advisor Model (SAM), is one way to help think through these challenges and develop appropriate strategies.

14 SOLAR ENERGY↗

The computation of Laplacian smoothing splines with examples

Laplacian smoothing splines (LSS) are presented as generalizations of graduation, cubic and thin plate splines. The method of generalized cross validation (GCV) to choose the smoothing parameter is described. The GCV is used in the algorithm for the computation of LSS's. An outline of a computer program which implements this algorithm is presented along with a description of the use of the program. Examples in one, two and three dimensions demonstrate how to obtain estimates of function values with confidence intervals and estimates of first and second derivatives. Probability plots are used as a diagnostic tool to check for model inadequacy.

Wendelberger, J. G.↗

Parameter identification for an abstract Cauchy problem by quasilinearization

A parameter identification problem is considered in the context of a linear abstract Cauchy problem with a parameter-dependent evolution operator. Conditions are investigated under which the gradient of the state with respect to a parameter possesses smoothness properties which lead to local convergence of an estimation algorithm based on quasi-linearization. Numerical results are presented concerning estimation of unknown parameters in delay-differential equations.

Brewer, Dennis W.↗

Processing of DMSP magnetic data: Handbook of programs, tapes, and datasets

The DMSP F-7 satellite was an operational Air Force meteorological satellite which carried a magnetometer for geophysical measurements. The magnetometer was located within the body of the spacecraft in the presence of large spacecraft fields. In addition to stray magnetic fields, the data have inherent position and time inaccuracies. Algorithms were developed to identify and remove time varying magnetic field noise from the data. These algorithms are embodied in an automated procedure which fits a smooth curve through the data and then identifies outliers and which filters the predominant Fourier component of noise from the data. Techniques developed for Magsat were then modified and used to attempt determination of the spacecraft fields, of any rotation between the magnetometer axes and the spacecraft axes, and of any scale changes within the magnetometer itself. Software setup and usage are documented and program listings are included in the Appendix. The initial and resulting data are archived on magnetic cartridge and the formats are documented.

Langel, R. A.↗

Analysis of three-dimensional viscous flow in a supersonic throughflow fan

A 3-D Navier-Stokes code was developed for analysis of turbomachinery blade rows and other internal flows. The Navier-Stokes equations are written in a Cartesian coordinate system rotating about the x-axis, and then mapped to a general body-fitted coordinate system. Streamwise viscous terms are neglected using the thin layer assumption, and turbulence effects are modelled using the Baldwin-Lomax turbulence model. The equations are discretized using finite differences on stacked C-type grids and are solved using a multistage Runge-Kutta algorithm with a spatially varying time step and implicit residual smoothing. Calculations were made of the flow around a supersonic throughflow fan blade. The fan was designed as a key component in a supersonic cruise engine. The 3-D calculations were done on a 129x29x33 grid and took 50 minutes of cpu time. Comparisons with the quasi-3-D results show minor differences in loading due to 3-D effects. Particle traces show nearly 2-D flows near the pressure surface, but large secondary flows within the suction surface boundary layer. The horseshoe vortex ahead of the leading edge is clearly seen.

Chima, Rodrick V.↗

Inverse problems in diffraction

A two-dimensional problem of diffraction of a plane electromagnetic wave on a smooth 2 pi-periodic surface is considered. A numerical algorithm solving this problem is developed. An inverse problem of determination of the shape of 2 pi-periodic surface using the performance data of reverse scattering is considered. The inverse problem was solved by means of minimization of the residual functional with the help of the gradient descent method. The initial data were calculated with the help of the numerical method. On each step of the iterative method of minimization, the residual functional was calculated approximately with the help of the small slope method. The examples of the shape determination are considered.

Mikheev, Andrew G.↗

Integrated trajectory and control analysis for generic hypersonic vehicles

A tool which supports integrated assessment of air-breathing hypersonic vehicle trajectory management and control strategy has been developed by Hattis and Malchow (1991). Using a two-point boundary value problem solution technique, the tool can construct an entire near-minimum-fuel trajectory and desired control strategy from takeoff to orbit, while satisfying physically derived inequality constraints and while achieving efficient propulsive mode phasing. A strategy is also formulated to construct preliminary trajectory and control history representations with less computational burden than required for the overall flight profile assessment. A tabulated example hypersonic vehicle model has been used to demonstrate the integrated analysis methodology. To assure good numerical behavior when the algorithm uses tabulated model data, a multidimensional cubic spline curve smoothing routine has been developed. A dynamic-pressure-constrained, near-fuel-optimal trajectory was computed to provide examples of information that the methodology can provide. Previously unspecified propulsive discontinuities were located, flight regimes demanding rapid attitude changes were identified, available and closed-loop controller authority was ascertained, and inadequacies in vehicle and specific subsystem model representations were determined.

Hattis, Philip D.↗

Parameter identification for an abstract Cauchy problem by quasilinearization

A parameter identification problem is considered in the context of a linear abstract Cauchy problem with a parameter-dependent evolution operator. Conditions are investigated under which the gradient of the state with respect to a parameter possesses smoothness properties which lead to local convergence of an estimation algorithm based on quasi-linearization. Numerical results are presented concerning estimation of unknown parameters in delay-differential equations.

Brewer, Dennis W.↗