Search NASA⌕ Search

SEARCH · Search NASA

Results for “data smoothing”

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 109 records · Page 6

Sampling theory applied to measurement and analysis of temperature for climate studies

Of all the errors discussed in climatology literature, aliasing errors caused by undersampling of unsmoothed or improperly smoothed temperature data seem to be completely overlooked. This is a serious oversight in view of long-term trends of 1 K or less. Adequate sampling of properly smoothed data is demonstrated with a Hamming digital filter. It is also demonstrated that hourly temperatures, daily averages, and annual averages free of aliasing errors can be obtained by use of a microprocessor added to standard weather sensors and recorders.

Edwards, Howard B.↗

A smoothing algorithm using cubic spline functions

Two algorithms are presented for smoothing arbitrary sets of data. They are the explicit variable algorithm and the parametric variable algorithm. The former would be used where large gradients are not encountered because of the smaller amount of calculation required. The latter would be used if the data being smoothed were double valued or experienced large gradients. Both algorithms use a least-squares technique to obtain a cubic spline fit to the data. The advantage of the spline fit is that the first and second derivatives are continuous. This method is best used in an interactive graphics environment so that the junction values for the spline curve can be manipulated to improve the fit.

Smith, R. E., Jr.↗

Vector splines on the sphere with application to the estimation of vorticity and divergence from discrete, noisy data

Vector smoothing splines on the sphere are defined. Theoretical properties are briefly alluded to. The appropriate Hilbert space norms used in a specific meteorological application are described and justified via a duality theorem. Numerical procedures for computing the splines as well as the cross validation estimate of two smoothing parameters are given. A Monte Carlo study is described which suggests the accuracy with which upper air vorticity and divergence can be estimated using measured wind vectors from the North American radiosonde network.

Wahba, G.↗

Parameterization of photon beam dosimetry for a linear accelerator

Purpose: In radiation therapy, accurate data acquisition of photon beam dosimetric quantities is important for (1) beam modeling data input into a treatment planning system (TPS), (2) comparing measured and TPS modeled data, (3) the quality assurance process of a linear accelerator’s (Linac) beam characteristics, (4) the establishment of a standard data set for comparison with other data, etcetera. Parameterization of the photon beam dosimetry creates a data set that is portable and easy to implement for different applications such as those previously mentioned. The aim of this study is to develop methods to parameterize photon beam dosimetric quantities, including percentage depth doses (PDDs), profiles, and total scatter output factors (S{sub cp}). Methods: S{sub cp}, PDDs, and profiles for different field sizes, depths, and energies were measured for a Linac using a cylindrical 3D water scanning system. All data were smoothed for the analysis and profile data were also centered, symmetrized, and geometrically scaled. The S{sub cp} data were analyzed using an exponential function. The inverse square factor was removed from the PDD data before modeling and the data were subsequently analyzed using exponential functions. For profile modeling, one halfside of the profile was divided into three regions described by exponential, sigmoid, and Gaussian equations. All of the analytical functions are field size, energy, depth, and, in the case of profiles, scan direction specific. The model’s parameters were determined using the minimal amount of measured data necessary. The model’s accuracy was evaluated via the calculation of absolute differences between the measured (processed) and calculated data in low gradient regions and distance-to-agreement analysis in high gradient regions. Finally, the results of dosimetric quantities obtained by the fitted models for a different machine were also assessed. Results: All of the differences in the PDDs’ buildup and the profiles’ penumbra regions were less than 2 and 0.5 mm, respectively. The differences in the low gradient regions were 0.20% ± 0.20% (<1% for all) and 0.50% ± 0.35% (<1% for all) for PDDs and profiles, respectively. For S{sub cp} data, all of the absolute differences were less than 0.5%. Conclusions: This novel analytical model with minimum measurement requirements was proved to accurately calculate PDDs, profiles, and S{sub cp} for different field sizes, depths, and energies.

61 RADIATION PROTECTION AND DOSIMETRY↗

Deploying Traffic Smoothing Cruise Controllers Learned from Trajectory Data

Autonomous vehicle-based traffic smoothing con- trollers are often not transferred to real-world use due to challenges in calibrating many-agent traffic simulators. We show a pipeline to sidestep such calibration issues by collecting trajectory data and learning controllers directly from trajectory data that are then deployed zero-shot onto the highway. We construct a dataset of 772.3 kilometers of recorded drives on the I-24. We then construct a simple simulator using the recorded drives as the lead vehicle in front of a simulated platoon consisting of one autonomous vehicle and five human followers. Using policy-gradient methods with an asymmetric critic to learn the controller, we show that we are able to improve average MPG by 11% in simulation on congested trajectories. We deploy this controller to a mixed platoon of 4 autonomous Toyota RAV-4’s and 7 human drivers in a validation experiment and demonstrate that the expected time-gap of the controller is maintained in the real world test. Finally, we release the driving dataset [1], the simulator, and the trained controller at https://github.com/nathanlct/trajectory-training-icra.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗

Nonlinear smoothing identification algorithm with application to data consistency checks

A parameter identification algorithm for nonlinear systems is presented. It is based on smoothing test data with successively improved sets of model parameters. The smoothing, which is iterative, provides all of the information needed to compute the gradients of the smoothing performance measure with respect to the parameters. The parameters are updated using a quasi-Newton procedure, until convergence is achieved. The advantage of this algorithm over standard maximum likelihood identification algorithms is the computational savings in calculating the gradient. This algorithm was used for flight-test data consistency checks based on a nonlinear model of aircraft kinematics. Measurement biases and scale factors were identified. The advantages of the presented algorithm and model are discussed.

Idan, M.↗

Improved Data Interpretation through Identification of Time Series Periodicity Changes

Analysis and interpretation of time series data is easiest when the data values occur at uniform intervals in time, but actual data may have differing data sampling frequencies, such as monthly and daily readings. Applying data analysis techniques, such as smoothing, to such a data set may not give a representative result between time segments. The ability to automatically distinguish time segments of differing data frequency would provide a means for applying data analysis independently to each segment, though a suitable blending at segment boundaries would be required. A method for detecting frequency changes was developed and applied to Gaussian and median smoothing of hydraulic head data from groundwater wells at the U.S. Department of Energy Hanford Site in southeastern Washington state. The process identifies time segments of high-frequency (daily) or low-frequency (greater than daily) data using adjusted-bandwidth Gaussian kernel density estimation and a threshold value, which are further refined to address small blocks of low-frequency data within larger blocks of high-frequency data. User-selectable levels of smoothing are then applied independently to the time segments prior to combining the segment results for a single smoothed data set. This time segment identification approach provides effective low- and high-frequency data separation, which provides a method to apply data analysis independently to each time segment.

97 MATHEMATICS AND COMPUTING↗

Digital Filters for Two-Dimensional Data

Computational efficient filters speed processing of two-dimensional experimental data. Two-dimensional smoothing filter used to attenuate highfrequency noise in two-dimensional numerical data arrays. Filter provides smoothed data values equal to values obtained by fitting surface with secondand third-order terms to 5 by 5 subset of data points centered on points and replacing data at each point by value of surface fitted at point. Especially suited for efficient analysis of two-dimensional experimental data on images.

Edwards, T. R.↗

Shock Formation and Vorticity Creation for 3d Euler

Abstract We analyze the shock formation process for the 3D nonisentropic Euler equations with the ideal gas law, in which sound waves interact with entropy waves to produce vorticity. Building on our theory for isentropic flows in [3, 4], we give a constructive proof of shock formation from smooth initial data. Specifically, we prove that there exist smooth solutions to the nonisentropic Euler equations which form a generic stable shock with explicitly computable blowup time, location, and direction. This is achieved by establishing the asymptotic stability of a generic shock profile in modulated self‐similar variables, controlling the interaction of wave families via: (i) pointwise bounds along Lagrangian trajectories, (ii) geometric vorticity structure, and (iii) high‐order energy estimates in Sobolev spaces. © 2022 Wiley Periodicals LLC.

Mathematics↗

Simplified continuum solvent model with a smooth cavity based on volumetric data

We present a continuum solvent model (CSM) with a smooth cavity for the application in grid-based electronic structure methods. The cavity is identified with the inherently smooth distribution function of a binary mixture at infinite dilution. We obtain a cavity model based on atomic van der Waals radii and one free parameter controlling the overall size. This single parameter is sufficient to adequately reproduce experimental partial molar volumes. The CSM based on this cavity is of similar accuracy in the prediction of aqueous solvation Gibbs energies of small neutral molecules and ions as other CSMs with a smooth cavity. We apply the model to systems in non-aqueous solution, i.e., spiropyran/merocyanin energetics, a proton transfer reaction in dimethyl sulfoxide, and the electrostatic screening of charged gold clusters in an ionic liquid.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Time-dependent edge-notch sensitivity of oxide and gamma prime dispersion strengthened sheet materials at 1000 to 1800 F (538 - 982 C)

Research was carried out to determine whether an oxide dispersion hardened alloy, TD-Ni, Cr, and low volume fraction gamma prime strengthened nickel-base alloy, Modified Waspaloy, were susceptible to time-dependent edge-notch sensitivity. The results were evaluated in terms of the mechanical characteristics of the alloys and the dislocation motion mechanisms operative. As far as could be determined, the results of the investigation were consistent with the following important concepts developed for Waspaloy and Inconel 718: (1) Time-dependent edge-notch sensitivity occurs when notched specimens are loaded below the approximate 0.2 percent smooth specimen offset yield strength and when data from smooth specimens indicate that small amounts of creep consume large rupture life fractions. (2) When precipitate particles are sheared by dislocations, the deformation is localized and time-dependent notch sensitivity occurs. When dislocations by-pass precipitate particles the deformation is homogeneous. Under these conditions, no time-dependent notch sensitivity has been observed.

Wilson, D. J.↗

A comparison of experimental and theoretical results for rotordynamic coefficients of four annular gas seals

The test facility and initial test program developed to experimentally measure the fluid forces induced by annular gas seals is described. A comparison of theoretically predicted and experimentally obtained data for smooth and honeycomb seals is provided. And a comparison of experimental data from the tests of three smooth-rotor/smooth-stator seals is provided. The leakage of the working fluid through the seal, the pressure gradient along the seal length, entrance pressure-loss data, and rotordynamic coefficients provide a basis for comparison. A short discussion on seal theory is included, and various rotordynamic coefficient identification schemes are described.

Childs, D. W.↗

Power-traffic coordinated operation for bi-peak shaving and bi-ramp smoothing – A hierarchical data-driven approach

The power distribution system and urban transportation system are two networked system bare their own operation constraints, such peak load in power systems and traffic congestion in transportation system. With the increasing number of electrical vehicles and charging/discharging stations, two systems are become tightly coupled. However, to optimize the two systems target using electrical vehicles as decision control variables cannot be easily solved using a uniformed optimization frame work. Thus we propose a hierarchical optimization approach to address this problem, which consists of a higher and a lower level. In the higher level, the power distribution system and urban transportation system are treated together to minimize the social cost. Meanwhile, the electrical vehicles and the charging/discharging stations are treated as customers to minimize their own expenditures. Then, an equilibrium is designed to determine the optimal charging/discharging price. In the lower level, the models of power distribution system and urban transportation system are developed to provide a detailed analysis. Specifically, in power distribution system, the three-phase unbalanced optimal power flow problem is relaxed with the semidefinite relaxation programming, and solved with alternating direction method of multiplier. A dynamic user equilibrium problem is formulated for the urban transportation system. For electrical vehicles, the state of charge is considered to optimize the charging/discharging schedule and reduce the impacts of power distribution systems. We conducted the simulation and numerical analysis using the IEEE 8500-bus distribution system and the Sioux Falls system with about 10,000 cars. The results demonstrate the feasibility and effectiveness of the proposed approach.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Smoothing of orbital tracking data: Mission planning, mission analysis and software formulation

The problem created by the presence of wild or outlying data points among orbital tracking data, is addressed. Consideration is given to the effects of such outliers on the orbit determination process, and methods for minimizing or even eliminating these effects are proposed. Some preliminary efforts implementing these new methods are described, and the results thus far obtained are summarized. Based on these ideas and results, recommendations are made for future investigation.

Vedder, J. D.↗

A method of smooth bivariate interpolation for data given on a generalized curvilinear grid

A method of locally bicubic interpolation is presented for data given at the nodes of a two-dimensional generalized curvilinear grid. The physical domain is transformed to a computational domain in which the grid is uniform and rectangular by a generalized curvilinear coordinate transformation. The metrics of the transformation are obtained by finite differences in the computational domain. Metric derivatives are determined by repeated application of the chain rule for partial differentiation. Given the metrics and the metric derivatives, the partial derivatives required to determine a locally bicubic interpolant can be estimated at each data point using finite differences in the computational domain. A bilinear transformation is used to analytically transform the individual quadrilateral cells in the physical domain into unit squares, thus allowing the use of simple formulas for bicubic interpolation.

Zingg, David W.↗

Quantifying the generalization error in deep learning in terms of data distribution and neural network smoothness

We report the accuracy of deep learning, i.e., deep neural networks, can be characterized by dividing the total error into three main types: approximation error, optimization error, and generalization error. Whereas there are some satisfactory answers to the problems of approximation and optimization, much less is known about the theory of generalization. Most existing theoretical works for generalization fail to explain the performance of neural networks in practice. To derive a meaningful bound, we study the generalization error of neural networks for classification problems in terms of data distribution and neural network smoothness. We introduce the cover complexity (CC) to measure the difficulty of learning a data set and the inverse of the modulus of continuity to quantify neural network smoothness. A quantitative bound for expected accuracy/error is derived by considering both the CC and neural network smoothness. Although most of the analysis is general and not specific to neural networks, we validate our theoretical assumptions and results numerically for neural networks by several data sets of images. The numerical results confirm that the expected error of trained networks scaled with the square root of the number of classes has a linear relationship with respect to the CC. We also observe a clear consistency between test loss and neural network smoothness during the training process. In addition, we demonstrate empirically that the neural network smoothness decreases when the network size increases whereas the smoothness is insensitive to training dataset size.

97 MATHEMATICS AND COMPUTING↗