Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “nonparametric”

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 91 records · Page 5

A nonparametric software reliability growth model

Miller and Sofer have presented a nonparametric method for estimating the failure rate of a software program. The method is based on the complete monotonicity property of the failure rate function, and uses a regression approach to obtain estimates of the current software failure rate. This completely monotone software model is extended. It is shown how it can also provide long-range predictions of future reliability growth. Preliminary testing indicates that the method is competitive with parametric approaches, while being more robust.

Miller, Douglas R.↗

A nonparametric software-reliability growth model

The authors (1985) previously introduced a nonparametric model for software-reliability growth which is based on complete monotonicity of the failure rate. The authors extend the completely monotone software model by developing a method for providing long-range predictions of reliability growth, based on the model. They derive upper and lower bounds on extrapolation of the failure rate and the mean function. These are then used to obtain estimates for the future software failure rate and the mean future number of failures. Preliminary evaluation indicates that the method is competitive with parametric approaches, while being more robust.

Sofer, Ariela↗

Classification of multispectral image data by the Binary Diamond neural network and by nonparametric, pixel-by-pixel methods

The classification of multispectral image data obtained from satellites has become an important tool for generating ground cover maps. This study deals with the application of nonparametric pixel-by-pixel classification methods in the classification of pixels, based on their multispectral data. A new neural network, the Binary Diamond, is introduced, and its performance is compared with a nearest neighbor algorithm and a back-propagation network. The Binary Diamond is a multilayer, feed-forward neural network, which learns from examples in unsupervised, 'one-shot' mode. It recruits its neurons according to the actual training set, as it learns. The comparisons of the algorithms were done by using a realistic data base, consisting of approximately 90,000 Landsat 4 Thematic Mapper pixels. The Binary Diamond and the nearest neighbor performances were close, with some advantages to the Binary Diamond. The performance of the back-propagation network lagged behind. An efficient nearest neighbor algorithm, the binned nearest neighbor, is described. Ways for improving the performances, such as merging categories, and analyzing nonboundary pixels, are addressed and evaluated.

Salu, Yehuda↗

Detecting Spacecraft Anomalies Using LSTMs and Nonparametric Dynamic Thresholding

As spacecraft send back increasing amounts of telemetry data, improved anomaly detection systems are needed to lessen the monitoring burden placed on operations engineers and reduce operational risk. Current spacecraft monitoring systems only target a subset of anomaly types and often require costly expert knowledge to develop and maintain due to challenges involving scale and complexity. We demonstrate the effectiveness of Long Short-Term Memory (LSTMs) networks, a type of Recurrent Neural Network (RNN), in overcoming these issues using expert-labeled telemetry anomaly data from the Soil Moisture Active Passive (SMAP) satellite and the Mars Science Laboratory (MSL) rover, Curiosity. We also propose a complementary unsupervised and nonparametric anomaly thresholding approach developed during a pilot implementation of an anomaly detection system for SMAP, and offer false positive mitigation strategies along with other key improvements and lessons learned during development.

Soderstrom, Tom↗

Nonparametric, data-based kernel interpolation for particle-tracking simulations and kernel density estimation

Traditional interpolation techniques for particle tracking include binning and convolutional formulas that use pre-determined (i.e., closed-form, parameteric) kernels. In many instances, the particles are introduced as point sources in time and space, so the cloud of particles (either in space or time) is a discrete representation of the Green’s function of an underlying PDE. As such, each particle is a sample from the Green’s function; therefore, each particle should be distributed according to the Green’s function. In short, the kernel of a convolutional interpolation of the particle sample “cloud” should be a replica of the cloud itself. This idea gives rise to an iterative method by which the form of the kernel may be discerned in the process of interpolating the Green’s function. When the Green’s function is a density, this method is broadly applicable to interpolating a kernel density estimate based on random data drawn from a single distribution. We formulate and construct the algorithm and demonstrate its ability to perform kernel density estimation of skewed and/or heavy-tailed data including breakthrough curves.

42 ENGINEERING↗

A nonparametric approach to modeling dependence among production parameters for energy cost estimation

Dependence existing among production parameters can significantly affect energy costs. For material removal processes, processing times and material amounts to be cut have positive dependence, and the dependence can affect energy costs by varying a peak electricity load. Existing methods to model the dependence of production parameters are based on parametric approaches that cannot accurately represent the dependence due to the rigid nature of parametric models. To address this issue, this study proposes a method to quantify dependence among manufacturing parameters through the application of the empirical copula to the dependence between the milling processing time and the amount of volume to be cut. The proposed method is illustrated by a case study of a manufacturing facility consisting of milling machines; a total of 27 scenarios are simulated for energy cost estimations. The case study clearly shows that the proposed method can capture the dependence between the milling parameters more accurately than a conventional dependence measure from parametric correlation models. Furthermore, the findings from this study would be useful to estimate energy costs in that the proposed method provides a better fit to real production data than conventional parametric approaches can.

42 ENGINEERING↗

Deep nonparametric estimation of intrinsic data structures by chart autoencoders: Generalization error and robustness

Autoencoders have demonstrated remarkable success in learning low-dimensional latent features of high-dimensional data across various applications. Assuming that data are sampled near a low-dimensional manifold, we employ chart autoencoders, which encode data into low-dimensional latent features on a collection of charts, preserving the topology and geometry of the data manifold. Our paper establishes statistical guarantees on the generalization error of chart autoencoders, and we demonstrate their denoising capabilities by considering n noisy training samples, along with their noise-free counterparts, on a d-dimensional manifold. By training autoencoders, we show that chart autoencoders can effectively denoise the input data with normal noise. We prove that, under proper network architectures, chart autoencoders achieve a squared generalization error in the order of n–$\frac{2}{d+2}$log 4 n, which depends on the intrinsic dimension of the manifold and only weakly depends on the ambient dimension and noise level. We further extend our theory on data with noise containing both normal and tangential components, where chart autoencoders still exhibit a denoising effect for the normal component. As a special case, our theory also applies to classical autoencoders, as long as the data manifold has a global parametrization. Furthermore, our results provide a solid theoretical foundation for the effectiveness of autoencoders, which is further validated through several numerical experiments.

97 MATHEMATICS AND COMPUTING↗

Nonparametric variational optimization of reaction coordinates

State of the art realistic simulations of complex atomic processes commonly produce trajectories of large size, making the development of automated analysis tools very important. A popular approach aimed at extracting dynamical information consists of projecting these trajectories into optimally selected reaction coordinates or collective variables. For equilibrium dynamics between any two boundary states, the committor function also known as the folding probability in protein folding studies is often considered as the optimal coordinate. To determine it, one selects a functional form with many parameters and trains it on the trajectories using various criteria. A major problem with such an approach is that a poor initial choice of the functional form may lead to sub-optimal results. Here, we describe an approach which allows one to optimize the reaction coordinate without selecting its functional form and thus avoiding this source of error.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Arbitrarily accurate, nonparametric coarse graining with Markov renewal processes and the Mori–Zwanzig formulation

Stochastic dynamics, such as molecular dynamics, are important in many scientific applications. However, summarizing and analyzing the results of such simulations is often challenging due to the high dimension in which simulations are carried out and, consequently, due to the very large amount of data that are typically generated. Coarse graining is a popular technique for addressing this problem by providing compact and expressive representations. Coarse graining, however, potentially comes at the cost of accuracy, as dynamical information is, in general, lost when projecting the problem in a lower-dimensional space. This article shows how to eliminate coarse-graining error using two key ideas. First, we represent coarse-grained dynamics as a Markov renewal process. Second, we outline a data-driven, non-parametric Mori–Zwanzig approach for computing jump times of the renewal process. Numerical tests on a small protein illustrate the method.

36 MATERIALS SCIENCE↗

Phase transition phenomenology with nonparametric representations of the neutron star equation of state

Astrophysical observations of neutron stars probe the structure of dense nuclear matter and have the potential to reveal phase transitions at high densities. Most recent analyses are based on parametrized models of the equation of state with a finite number of parameters and occasionally include extra parameters intended to capture phase-transition phenomenology. However, such models restrict the types of behavior allowed and may not match the true equation of state. We introduce a complementary approach that extracts phase transitions directly from the equation of state without relying on, and thus being restricted by, an underlying parametrization. We then constrain the presence of phase transitions in neutron stars with astrophysical data. Current pulsar mass, tidal deformability, and mass-radius measurements disfavor only the strongest of possible phase transitions (latent energy per particle ≳ 100 MeV). Weaker phase transitions are consistent with observations. Here we further investigate the prospects for measuring phase transitions with future gravitational-wave observations and find that catalogs of O (100) events will (at best) yield Bayes factors of ~ 10 : 1 in favor of phase transitions even when the true equation of state contains very strong phase transitions. Our results reinforce the idea that neutron star observations will primarily constrain trends in macroscopic properties rather than detailed microscopic behavior. Fine-tuned equation of state models will likely remain unconstrained in the near future.

79 ASTRONOMY AND ASTROPHYSICS↗

Simple nonparametric reconstruction of parton distributions from limited Fourier information

Some calculations of parton distributions from first principles only give access to a limited range of Fourier modes of the function to reconstruct. We present a physically motivated procedure to regularize the inverse integral problem using a Gaussian process as a Bayesian prior. We propose to fix the hyperparameters of the prior in a meaningful physical fashion, offering a simple implementation, great numerical efficiency, and allowing us to understand and keep control easily of the uncertainty of the reconstruction.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗