Search NASA⌕ Search

SEARCH · Search NASA

Results for “identification problem”

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 559 records · Page 31

Parallel processing for digital picture comparison

In picture processing an important problem is to identify two digital pictures of the same scene taken under different lighting conditions. This kind of problem can be found in remote sensing, satellite signal processing and the related areas. The identification can be done by transforming the gray levels so that the gray level histograms of the two pictures are closely matched. The transformation problem can be solved by using the packing method. Researchers propose a VLSI architecture consisting of m x n processing elements with extensive parallel and pipelining computation capabilities to speed up the transformation with the time complexity 0(max(m,n)), where m and n are the numbers of the gray levels of the input picture and the reference picture respectively. If using uniprocessor and a dynamic programming algorithm, the time complexity will be 0(m(3)xn). The algorithm partition problem, as an important issue in VLSI design, is discussed. Verification of the proposed architecture is also given.

Cheng, H. D.↗

Scalable Approaches to Selecting Key Entities in Large Networked Infrastructure Systems

This work aims at bringing advances in discrete optimization algorithms to solving practical engineering problems at scale. Often times, in many engineering design problems, there is a need to select a small set of influential or representative elements from a large ground set of entities in an optimal fashion. Submodular optimization provides for a formal way to solve such problems. Common examples with infrastructure systems involve sensor placement and identification of key entities with certain objectives. However, scaling these approaches to large infrastructure systems can be challenging because of the high computational complexity of the overall framework that include the optimization algorithms as well as high-complexity compute-oracles that provide the necessary objective function values. In this work, we explore a well-studied and widely-applicable paradigm, namely leader-selection in a multi-agent networked setting in the context of scalable methodologies. We demonstrate novel frameworks that utilize variations of accelerated submodular optimization algorithms along with linear-algebraic methods that can help accelerate the oracle computations. We further explore this combination in conjunction with graph partitioning paradigms to take advantage of the accelerated algorithms in a distributed setting. Finally we demonstrate the key findings on a practical problem in an operational setting. For this, we leverage an example road network with approximately 18k nodes and 27k edges in a traffic control application, where we seek a limited number of k=200 key intersections. This problem can be solved in a serial setting in just under 5 hours providing more than 2 orders of magnitude speed-up over methods that do not consider acceleration techniques.

Visweswara Sathanur, Arun↗

CHARACTERIZATION OF DISCONTINUITIES IN HIGH-DIMENSIONAL STOCHASTIC PROBLEMS ON ADAPTIVE SPARSE GRIDS

In this paper we present a set of efficient algorithms for detection and identification of discontinuities in high dimensional space. The method is based on extension of polynomial annihilation for edge detection in low dimensions. Compared to the earlier work, the present method poses significant improvements for high dimensional problems. The core of the algorithms relies on adaptive refinement of sparse grids. It is demonstrated that in the commonly encountered cases where a discontinuity resides on a small subset of the dimensions, the present method becomes optimal , in the sense that the total number of points required for function evaluations depends linearly on the dimensionality of the space. The details of the algorithms will be presented and various numerical examples are utilized to demonstrate the efficacy of the method.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Apollo experience report: Spacecraft relative motion and recontact analyses

Potential collision or accidental recontact problems between the spacecraft and other space vehicles (or components) existed during most of the Apollo missions. These problems were identified before each Apollo flight, and appropriate solutions for eliminating or minimizing the chance of collision were determined through relative motion analyses. A summary of the identification, solution, and analysis process for some of the more significant of these separation problems is presented. In addition, the scope of responsibility, the development of the study effort, and the computer simulation development, which supported the analysis process, are described.

Mcadams, R. E.↗

Bounded state space

This investigation is divided functionally into three different areas: (1) study of bounded state space, (2) nonlinear smoothing theory, and (3) system identification. (1) Study of bounded state space: necessary and sufficient conditions for an optimal control are obtained for a bounded state space optimal control problem. The difficulty of determining the so-called jump conditions is eliminated; however, the problem of determining the points where the response either enters or leaves the boundary still remains unsolved. (2) Nonlinear smoothing theory: nonlinear fixed-interval, fixed-point and fixed-lag smoothing of a random signal generated by a stochastic differential equation are investigated. Results on the asymptotic stability of a linear constant-parameter fixed-interval smoothing filter are obtained. (3) System identification: a particular stochastic modelling problem is solved. An Ito stochastic integral equation is used to mathematically model a black box having multiple inputs and multiple outputs. A new method for identifying system parameters is presented.

Eyman, E. D.↗

Pre-trained network-based transfer learning: A small-sample machine learning approach to nuclear power plant classification problem

Some research topics belonging to classification problems in the nuclear industry, such as fault diagnosis and accident identification, can be solved by feature extraction and subsequent application of statistical machine learning classifiers. Recently, deep neural network-based methods with automatic feature extraction and high accuracy have gained wide attention. They usually require large-scale training data, however, plant fault or accident data are scarce or difficult to obtain. Here this paper proposes a convolutional network (CNN)-based transfer learning method to solve this problem. The network's shallow layer is derived from a pre-trained CNN based on the ImageNet database to automatically extract features, and the deep layer is customized to match the classification problem. Data in non-image formats are converted to image formats and subsequently used to train the network. Case studies of rotating machines fault diagnosis show that the proposed method requires only limited training data to achieve high accuracy.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

Direct modeling parameter signature analysis and failure mode prediction of physical systems using hybrid computer optimization

High speed automated identification and design of dynamic systems, both linear and nonlinear, are discussed. Special emphasis is placed on developing hardware and techniques which are applicable to practical problems. The basic modeling experiment and new results are described. Using the improvements developed successful identification of several systems, including a physical example as well as simulated systems, was obtained. The advantages of parameter signature analysis over signal signature analysis in go-no go testing of operational systems were demonstrated. The feasibility of using these ideas in failure mode prediction in operating systems was also investigated. An improved digital controlled nonlinear function generator was developed, de-bugged, and completely documented.

Drake, R. L.↗

Application of the Differential Evolution Method to Solving Inverse Transport Problems

The differential evolution method, a powerful stochastic optimization algorithm that mimics the process of evolution in nature, is applied to inverse transport problems with several unknown parameters of mixed types, including interface location identification, source composition identification, and material mass density identification, in spherical and cylindrical radioactive source/shield systems. In spherical systems, measurements of leakages of discrete gamma-ray lines are assumed, while in cylindrical systems, measurements of scalar fluxes of discrete lines at points outside the system are assumed. The performance of the differential evolution algorithm is compared to the Levenberg-Marquardt method, a standard gradient-based technique, and the covariance matrix adaptation evolution strategy, another stochastic technique, on a variety of numerical test problems with several (i.e., three or more) unknown parameters. Numerical results indicate that differential evolution is the most adept method for finding the global optimum for these problems. In spherical geometry, differential evolution implemented serially is run-time competitive with gradient-based methods, while a parallel version of differential evolution would be run-time competitive with gradient-based techniques in cylindrical geometry. A hybrid differential evolution/Levenberg-Marquardt method is also introduced, and numerical results indicate that it can be a fast and robust optimizer for inverse transport problems.

99 GENERAL AND MISCELLANEOUS↗

Extension and validation of a method for locating damaged members in large space trusses

The damage location approach employs the control system capabilities for the structure to test the structure and measure the dynamic response. The measurements are then used in a system identification algorithm to produce a model of the damaged structure. The model is compared to one for the undamaged structure to find regions of reduced stiffness which indicate the location of damage. Kabe's 3,4 stiffness matrix adjustment method was the central identification algorithm. The strength of his method is that, with minimal data, it preserves the representation of the physical connectivity of the structure in the resulting model of the damaged truss. However, extensive storage and computational effort were required as a result. Extension of the damage location method to overcome these problems is the first part of the current work. The central system identification algorithm is replaced with the MSMT method of stiffness matrix adjustment which was previously derived by generalizing an optimal-update secant method form quasi-Newton approaches for nonlinear optimization. Validation of the extended damage location method is the second goal.

Smith, Suzanne Weaver↗

Identification of subsurface structures using electromagnetic data and shape priors

We consider the inverse problem of identifying large-scale subsurface structures using the controlled source electromagnetic method. To identify structures in the subsurface where the contrast in electric conductivity can be small, regularization is needed to bias the solution towards preserving structural information. We propose to combine two approaches for regularization of the inverse problem. In the first approach we utilize a model-based, reduced, composite representation of the electric conductivity that is highly flexible, even for a moderate number of degrees of freedom. With a low number of parameters, the inverse problem is efficiently solved using a standard, second-order gradient-based optimization algorithm. Further regularization is obtained using structural prior information, available, e.g., from interpreted seismic data. The reduced conductivity representation is suitable for incorporation of structural prior information. Such prior information cannot, however, be accurately modeled with a gaussian distribution. To alleviate this, we incorporate the structural information using shape priors. The shape prior technique requires the choice of kernel function, which is application dependent. We argue for using the conditionally positive definite kernel which is shown to have computational advantages over the commonly applied gaussian kernel for our problem. Numerical experiments on various test cases show that the methodology is able to identify fairly complex subsurface electric conductivity distributions while preserving structural prior information during the inversion.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Parametric robust control and system identification: Unified approach

Despite significant advancement in the area of robust parametric control, the problem of synthesizing such a controller is still a wide open problem. Thus, we attempt to give a solution to this important problem. Our approach captures the parametric uncertainty as an H(sub infinity) unstructured uncertainty so that H(sub infinity) synthesis techniques are applicable. Although the techniques cannot cope with the exact parametric uncertainty, they give a reasonable guideline to model the unstructured uncertainty that contains the parametric uncertainty. An additional loop shaping technique is also introduced to relax its conservatism.

Keel, Leehyun↗

Scientific Discovery with Physics-Informed System Identification (Abbreviated Report)

My fellowship research focused on making physics-based simulations faster and more useful through machine learning. Many problems in science and engineering are governed by partial differential equations, but high-fidelity simulations are often too expensive to run repeatedly. I worked on improving Latent Space Dynamics Identification (LaSDI), a reduced-order modeling framework that compresses large simulation data sets into a smaller representation and then learns how that representation evolves over time. The motivation was to develop reduced models that remain accurate for more challenging systems, especially when predictions must remain reliable over long time intervals or when the underlying dynamics are more complicated than standard methods can easily handle. I also contributed to related work on Quandary, a high-performance software effort for simulation and control of open quantum systems, before focusing primarily on Latent Space Dynamics Identification methods. The main outcomes of the fellowship were two new algorithms (both of which were published), Rollout-LaSDI and Higher-Order LaSDI, together with supporting work on multi-stage Latent Space Dynamics Identification. Rollout-LaSDI improved long-term prediction by training the model to stay accurate over extended time horizons, and Higher-Order LaSDI broadened the method so it could model systems with higher-order time dynamics. My contributions to multistage Latent Space Dynamics Identification also helped show that its later training stages could be simplified without losing effectiveness, and that this behavior held across different model architectures and training strategies. Taken together, these advances improved the accuracy, flexibility, and practical value of reduced-order modeling tools for computational science.

97 MATHEMATICS AND COMPUTING↗

Latent Mechanisms of Polarization Switching from In Situ Electron Microscopy Observations

In situ scanning transmission electron microscopy enables observation of the domain dynamics in ferroelectric materials as a function of externally applied bias and temperature. The resultant data sets contain a wealth of information on polarization switching and phase transition mechanisms. However, identification of these mechanisms from observational data sets has remained a problem due to a large variety of possible configurations, many of which are degenerate. Here, an approach based on a combination of deep learning-based semantic segmentation, rotationally invariant variational autoencoder (VAE), and non-negative matrix factorization to enable learning of a latent space representation of the data with multiple real-space rotationally equivalent variants mapped to the same latent space descriptors is introduced. By varying the size of training sub-images in the VAE, the degree of complexity in the structural descriptors is tuned from simple domain wall detection to the identification of switching pathways. Importantly, this yields a powerful tool for the exploration of the dynamic data in mesoscopic electron, scanning probe, optical, and chemical imaging. Moreover, this work adds to the growing body of knowledge of incorporating physical constraints into the machine and deep-learning methods to improve learned descriptors of physical phenomena.

36 MATERIALS SCIENCE↗

An algorithm to correct saturated mass spectrometry ion abundances for enhanced quantitation and mass accuracy in omic studies

The mass accuracy and peak intensity of ions detected by mass spectrometry (MS) measurements are essential to facilitate compound identification and quantitation. However, high concentration species can easily cause problems if their ion intensities reach beyond the limits of the detection system, leading to distorted and non-ideal detector response (e.g. saturation), and largely precluding the calculation of accurate m/z and intensity values. Here we present an open source computational method to correct peaks above a defined intensity (saturated) threshold determined by the MS instrumentation such as the analog-to-digital converters or time-to-digital converters used in conjunction with time-of-flight MS. In this method, the isotopic envelope for each observed ion above the saturation threshold is compared to its expected theoretical isotopic distribution. The most intense isotopic peak for which saturation does not occur is then utilized to re-calculate the precursor m/z and correct the intensity, resulting in both higher mass accuracy and greater dynamic range. The benefits of this approach were evaluated with proteomic and lipidomic datasets of varying complexities. After correcting the high concentration species, reduced mass errors and enhanced dynamic range were observed for both simple and complex omic samples. Specifically, the mass error dropped by more than 50% in most cases with highly saturated species and dynamic range increased by 1-2 orders of magnitude for peptides in a blood serum sample.

Environmental Molecular Sciences Laboratory↗

Integrable perturbations of conformal field theories and Yetter-Drinfeld modules

In this paper we relate a problem in representation theory — the study of Yetter-Drinfeld modules over certain braided Hopf algebras — to a problem in two-dimensional quantum field theory, namely, the identification of integrable perturbations of a conformal field theory. A prescription that parallels Lusztig's construction allows one to read off the quantum group governing the integrable symmetry. As an example, we illustrate how the quantum group for the loop algebra of sl(2) appears in the integrable structure of the perturbed uncompactified and compactified free boson.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Non-autoregressive time-series methods for stable parametric reduced-order models

Advection-dominated dynamical systems, characterized by partial differential equations, are found in applications ranging from weather forecasting to engineering design where accuracy and robustness are crucial. There has been significant interest in the use of techniques borrowed from machine learning to reduce the computational expense and/or improve the accuracy of predictions for these systems. These rely on the identification of a basis that reduces the dimensionality of the problem and the subsequent use of time series and sequential learning methods to forecast the evolution of the reduced state. Often, however, machine-learned predictions after reduced-basis projection are plagued by issues of stability stemming from incomplete capture of multiscale processes as well as due to error growth for long forecast durations. To address these issues, we have developed a non-autoregressive time series approach for predicting linear reduced-basis time histories of forward models. In particular, we demonstrate that non-autoregressive counterparts of sequential learning methods such as long short-term memory (LSTM) considerably improve the stability of machine-learned reduced-order models. Further, we evaluate our approach on the inviscid shallow water equations and show that a non-autoregressive variant of the standard LSTM approach that is bidirectional in the principal component directions obtains the best accuracy for recreating the nonlinear dynamics of partial observations. Moreover-and critical for many applications of these surrogates-inference times are reduced by three orders of magnitude using our approach, compared with both the equation-based Galerkin projection method and the standard LSTM approach.

97 MATHEMATICS AND COMPUTING↗

STUDYING FREQUENCY RELATIONSHIPS OF KILOHERTZ QUASI-PERIODIC OSCILLATIONS FOR 4U 1636-53 AND Sco X-1: OBSERVATIONS CONFRONT THEORIES

By fitting the frequencies of simultaneous lower and upper kilohertz quasi-periodic oscillations (kHz QPOs) in two prototype neutron star (NS) QPO sources (4U 1636-53 and Sco X-1), we test the predictive power of all currently proposed QPO models. Models predict a linear, power law, or other relationship between the two frequencies. We found that for plausible NS parameters (mass and angular momentum), no model can satisfactorily reproduce the data, leading to very large chi-square values in our fittings. For both 4U 1636-53 and Sco X-1, this is largely due to the fact that the data significantly differ from a linear relationship. Some models perform relatively better but still have their own problems. Such a detailed comparison of data from models enables identification of routes for improving those models further.

79 ASTRONOMY AND ASTROPHYSICS↗

fPINNs: Fractional Physics-Informed Neural Networks

Physics-informed neural networks (PINNs), introduced, are effective in solving integer-order partial differential equations (PDEs) based on scattered and noisy data. PINNs employ standard feedforward neural networks (NNs) with the PDEs explicitly encoded into the NN using automatic differentiation, while the sum of the mean-squared PDE residuals and the mean-squared error in initial-boundary conditions is minimized with respect to the NN parameters. Here we extend PINNs to fractional PINNs (fPINNs) to solve space-time fractional advection-diffusion equations (fractional ADEs), and we study systematically their convergence, hence explaining both fPINNs and PINNs for the first time. Specifically, we demonstrate their accuracy and effectiveness in solving multidimensional forward and inverse problems with forcing terms whose values are only known at randomly scattered spatio-temporal coordinates (black-box (BB) forcing terms). A novel element of the fPINNs is the hybrid approach that we introduce for constructing the residual in the loss function using both automatic differentiation for the integer-order operators and numerical discretization for the fractional operators. This approach bypasses the difficulties stemming from the fact that automatic differentiation is not applicable to fractional operators because the standard chain rule in integer calculus is not valid in fractional calculus. To discretize the fractional operators, we employ the Grünwald--Letnikov (GL) formula in one-dimensional fractional ADEs and the vector GL formula in conjunction with the directional fractional Laplacian in two- and three-dimensional fractional ADEs. We first consider the one-dimensional fractional Poisson equation and compare the convergence of the fPINNs against the finite difference method (FDM). We present the solution convergence using both the mean L 2 error as well as the standard deviation due to sensitivity to NN parameter initializations. Using different GL formulas we observe first-, second-, and third-order convergence rates for small size training sets but the error saturates for larger training sets. We explain these results by analyzing the four sources of numerical errors due to discretization, sampling, NN approximation, and optimization. The total error decays monotonically (below 10 –5 for a third-order GL formula) but it saturates beyond that point due to the optimization error. We also analyze the relative balance between discretization and sampling errors and observe that the sampling size and the number of discretization points (auxiliary points) should be comparable to achieve the highest accuracy. As we increase the depth of the NN up to certain value, the mean error decreases and the standard deviation increases, whereas the width has essentially no effect unless its value is either too small or too large. We next consider time-dependent fractional ADEs and compare white-box (WB) and BB forcing. We observe that for the WB forcing, our results are similar to the aforementioned cases; however, for the BB forcing fPINNs outperform FDM. Subsequently, we consider multidimensional time-, space-, and space-time-fractional ADEs using the directional fractional Laplacian and we observe relative errors of 10 –3 ~ 10 –4 . Lastly, we solve several inverse problems in one, two, and three dimensions to identify the fractional orders, diffusion coefficients, and transport velocities and obtain accurate results given proper initializations even in the presence of significant noise.

97 MATHEMATICS AND COMPUTING↗