Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “generalized 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 1,513 records · Page 84

Multistage estimation of received carrier signal parameters under very high dynamic conditions of the receiver

A multistage estimator is provided for the parameters of a received carrier signal possibly phase-modulated by unknown data and experiencing very high Doppler, Doppler rate, etc., as may arise, for example, in the case of Global Positioning Systems (GPS) where the signal parameters are directly related to the position, velocity and jerk of the GPS ground-based receiver. In a two-stage embodiment of the more general multistage scheme, the first stage, selected to be a modified least squares algorithm referred to as differential least squares (DLS), operates as a coarse estimator resulting in higher rms estimation errors but with a relatively small probability of the frequency estimation error exceeding one-half of the sampling frequency, provides relatively coarse estimates of the frequency and its derivatives. The second stage of the estimator, an extended Kalman filter (EKF), operates on the error signal available from the first stage refining the overall estimates of the phase along with a more refined estimate of frequency as well and in the process also reduces the number of cycle slips.

Kumar, Rajendra↗

Evaluation of Precision Landing Performance Using A Generalized Aerospace Simulation in Simulink Framework

NASA’s science and exploration goals to return to the Moon and beyond will need to perform precision landings to place humans and cargo supplies near places of scientific interest, surface resources, or pre-established basecamps. With the maturation of new navigation technology, such as terrain relative navigation, precision landing is now feasible, enabling new exploration sites, such as the lunar poles. However, verification of precision landing performance becomes crucial since not reaching the designated landing site would have a high risk of loss of mission. Therefore, having a high-fidelity simulation platform to evaluate six degrees of freedom vehicle performance during high-risk phases of flight such landing is a fundamental part of the system verification and risk reduction. The NASA Marshall Space Flight Center has developed the GeneraLized Aerospace Simulation in Simulink® (GLASS) tool which incorporates guidance, navigation, and control algorithms, as well as vehicle and environmental models, such as gravity, vehicle mass properties, navigation sensors, propulsion, and terrain models. GLASS uses the MathWorks® Simulink® environment which provides a model-based design framework that allows the incorporation of vehicle models in a modular architecture. The Simulink® environment provides seamless integration with all the MathWorks® capabilities and toolboxes, such as control design toolboxes and Simscape™ Multibody™ dynamics toolbox. The MathWorks® environment also allows for guidance, navigation, and control algorithms to be auto coded in C language, enabling quick software and hardware in the loop testing. This paper provides an overview of GLASS capabilities for analyzing precision landing performance, including navigation trades applied to a NASA human lander reference design architecture.

Guidance↗

Using a Large Language Model for Accurate Technical Language Generation in the Predictive Maintenance of Circulating Water Systems in Nuclear Power Plants

Machine learning (ML) methods for predictive maintenance (PdM) are emerging as effective proactive strategies for diagnosing equipment degradation and enabling effective decision-making. However, explainability and trustworthiness of artificial intelligence are two salient challenges that need to be addressed for wider deployment of these technologies in nuclear power plants (NPPs). Large language models (LLMs) offer a unique approach to tackle these challenges by explaining PdM, work orders, diagnosis results, and ML algorithms to users, who may not be familiar with ML and PdM in general. Moreover, by dynamically retrieving relevant information from technical documents and evaluating factuality of LLM generation, the accuracy and relevance of LLM generations can be improved. This work demonstrates using LLMs to explain the causes and consequences of circulating water system failures based on multiyear NPP work orders. This work tests the capability of multimodal LLM approaches in explaining the differences in the circulating water system from both the Salem and Hope Creek NPPs using both text and image resources. This work also demonstrates the use of multimodal LLMs in describing the diagnosis tab of a predictive maintenance software named VIsualization for PrEdictive maintenance Recommendation (VIPER) to users.

22 - GENERAL STUDIES OF NUCLEAR REACTORS↗

Mineral Dust Optical Properties for Remote Sensing and Global Modeling: A Review

Dust plays a key role in many Earth system processes and is ubiquitous in the Martian atmosphere. Various intensive field campaigns, laboratory analyses, space-based remote sensing missions, and global modeling efforts aim to characterize dust optical properties. This is a bountiful time for dust scientists, and yet the interpretation of retrievals and comparison to models remains complicated by various conflicting assumptions that are part of each algorithm. For example, the conversion of satellite radiance measurements into products like aerosol optical depth for model evaluation depends upon aerosol properties like particle size and shape that are often prescribed and not part of the retrieval. Conversely, the model calculation of aerosol optical depth often uses different assumptions. The goal of this review is to first document algorithmic assumptions by various satellite retrieval products and models, and identify where there is consistency and where there are differences. In general, the differences documented in this paper reflect uncertainties resulting from incomplete observational characterization of dust aerosols and limitations in our understanding. Second, we note what observations might reduce uncertainties in our knowledge and bring greater consistency to retrievals and models, allowing for a more rigorous and harmonious comparison. The lack of comprehensive and realistic shape models for dust is an outstanding issue, such that closure between forward modeling from particle refractive index, shape, and size and observed optical properties cannot be achieved. Limitations in the computational methods that must be applied to model scattering from complex shapes also makes accurate optical modeling for dust challenging. Field observations indicate the persistence of coarse and giant dust particles at higher altitudes and farther downwind from their source than previously expected. Remote sensing retrieval algorithms based on observations at visible wavelengths have limited sensitivity to these particles and generally do not consider them, although a recent product based on longwave radiances is encouraging. Current measurements of the refractive index of bulk dust and fundamental dust minerology components such as hematite vary widely, inhibiting attempts to represent the variability in dust optical properties and forcing, as expected from different major dust source regions on Earth that have varying mineralogical composition. Some remote sensing retrieval algorithms allow for limited refractive index variability in their inversion solutions through mixing with other fine mode aerosol models, or optimizing the single scattering albedo, but Earth system models surveyed for this paper assume a globally uniform, size-invariant refractive index. Although no Martian dust samples have yet been returned to Earth, remote sensing observations indicate that Martian dust is globally homogenous in composition, and a single spectral refractive index assumption has been widely adopted to represent Martian dust. The lack of comprehensive, statistically representative measurements of dust particle microphysical properties (size distribution, morphology, complex index of refraction spectra, internal structure heterogeneity), and the resulting optical properties, limits our ability to verify the fidelity of these assumptions. A chain of measurements is needed, ranging from characterizing individual dust mineralogy components (e.g., pure hematite and goethite) to in situ sampling of complex atmospheric aerosol mixtures. Such results could be applied to both remote sensing retrievals that characterize the optical properties of the total aerosol burden in the atmosphere from total radiance measurements, and to global models that represent the total aerosol burden in the atmosphere by building it up from the balance of individual aerosol sources and sinks.

Aeolian dust↗

Using parallel banded linear system solvers in generalized eigenvalue problems

Subspace iteration is a reliable and cost effective method for solving positive definite banded symmetric generalized eigenproblems, especially in the case of large scale problems. This paper discusses an algorithm that makes use of two parallel banded solvers in subspace iteration. A shift is introduced to decompose the banded linear systems into relatively independent subsystems and to accelerate the iterations. With this shift, an eigenproblem is mapped efficiently into the memories of a multiprocessor and a high speedup is obtained for parallel implementations. An optimal shift is a shift that balances total computation and communication costs. Under certain conditions, we show how to estimate an optimal shift analytically using the decay rate for the inverse of a banded matrix, and how to improve this estimate. Computational results on iPSC/2 and iPSC/860 multiprocessors are presented.

DISTRIBUTED MEMORY MULTIPROCES↗

A Fast Implementation of the ISOCLUS Algorithm

Unsupervised clustering is a fundamental tool in numerous image processing and remote sensing applications. For example, unsupervised clustering is often used to obtain vegetation maps of an area of interest. This approach is useful when reliable training data are either scarce or expensive, and when relatively little a priori information about the data is available. Unsupervised clustering methods play a significant role in the pursuit of unsupervised classification. One of the most popular and widely used clustering schemes for remote sensing applications is the ISOCLUS algorithm, which is based on the ISODATA method. The algorithm is given a set of n data points (or samples) in d-dimensional space, an integer k indicating the initial number of clusters, and a number of additional parameters. The general goal is to compute a set of cluster centers in d-space. Although there is no specific optimization criterion, the algorithm is similar in spirit to the well known k-means clustering method in which the objective is to minimize the average squared distance of each point to its nearest center, called the average distortion. One significant feature of ISOCLUS over k-means is that clusters may be merged or split, and so the final number of clusters may be different from the number k supplied as part of the input. This algorithm will be described in later in this paper. The ISOCLUS algorithm can run very slowly, particularly on large data sets. Given its wide use in remote sensing, its efficient computation is an important goal. We have developed a fast implementation of the ISOCLUS algorithm. Our improvement is based on a recent acceleration to the k-means algorithm, the filtering algorithm, by Kanungo et al.. They showed that, by storing the data in a kd-tree, it was possible to significantly reduce the running time of k-means. We have adapted this method for the ISOCLUS algorithm. For technical reasons, which are explained later, it is necessary to make a minor modification to the ISOCLUS specification. We provide empirical evidence, on both synthetic and Landsat image data sets, that our algorithm's performance is essentially the same as that of ISOCLUS, but with significantly lower running times. We show that our algorithm runs from 3 to 30 times faster than a straightforward implementation of ISOCLUS. Our adaptation of the filtering algorithm involves the efficient computation of a number of cluster statistics that are needed for ISOCLUS, but not for k-means.

Memarsadeghi, Nargess↗

Update on Bayesian Blocks: Segmented Models for Sequential Data

The Bayesian Block algorithm, in wide use in astronomy and other areas, has been improved in several ways. The model for block shape has been generalized to include other than constant signal rate - e.g., linear, exponential, or other parametric models. In addition the computational efficiency has been improved, so that instead of O(N**2) the basic algorithm is O(N) in most cases. Other improvements in the theory and application of segmented representations will be described.

Scargle, Jeff↗

A Class of Sparse Johnson–Lindenstrauss Transforms and Analysis of their Extreme Singular Values

The Johnson–Lindenstrauss (JL) lemma is a powerful tool for dimensionality reduction in modern algorithm design. The lemma states that any set of high-dimensional points in a Euclidean space can be projected into lower dimensions while approximately preserving pairwise Euclidean distances. Random matrices satisfying this lemma are called JL transforms (JLTs). Inspired by existing $s$-hashing JLTs with exactly $s$ nonzero elements on each column, the present work introduces an ensemble of sparse matrices encompassing so-called $s$-hashing-like matrices whose expected number of nonzero elements on each column is $s$. The independence of the sub-Gaussian entries of these matrices and the knowledge of their exact distribution play an important role in their analyses. Using properties of independent sub-Gaussian random variables, these matrices are demonstrated to be JLTs, and their smallest nontrivial singular values and largest singular values are estimated nonasymptotically using a technique from geometric functional analysis. As the dimensions of the matrix grow to infinity, these singular values are proved to converge almost surely to fixed quantities (by using the universal Bai–Yin law) and in distribution to the Gaussian orthogonal ensemble Tracy–Widom law after proper rescalings. Understanding the behaviors of extreme singular values is important in general because they are often used to define a measure of stability of matrix algorithms. For example, JLTs were recently used in derivative-free optimization algorithmic frameworks to select random subspaces in which are constructed random models or poll directions to achieve scalability, and hence estimating their smallest singular value in particular helps determine the dimension of these subspaces.

97 MATHEMATICS AND COMPUTING↗

Multirate sampled-data yaw-damper and modal suppression system design

A multirate control law synthesized algorithm based on an infinite-time quadratic cost function, was developed along with a method for analyzing the robustness of multirate systems. A generalized multirate sampled-data control law structure (GMCLS) was introduced. A new infinite-time-based parameter optimization multirate sampled-data control law synthesis method and solution algorithm were developed. A singular-value-based method for determining gain and phase margins for multirate systems was also developed. The finite-time-based parameter optimization multirate sampled-data control law synthesis algorithm originally intended to be applied to the aircraft problem was instead demonstrated by application to a simpler problem involving the control of the tip position of a two-link robot arm. The GMCLS, the infinite-time-based parameter optimization multirate control law synthesis method and solution algorithm, and the singular-value based method for determining gain and phase margins were all demonstrated by application to the aircraft control problem originally proposed for this project.

Berg, Martin C.↗

NucMesh: nuclear reactor geometry creation and mesh generation module in NEMoSys

NucMesh is a parameterized geometry and mesh generator for nuclear reactors developed within the Nuclear Energy Modeling System NEMoSys at Illinois Rocstar. NEMoSys is a platform developed for mesh generation, adaptive refinement, and solution verification. NucMesh is implemented to be generalized and extensible with a robust computer aided design engine and multiple mesh generation algorithms for unstructured triangular, quad-dominant, and structured quadrilateral meshing. In this paper, we present the geometric and meshing features of NucMesh. Geometrically objects are constructed bottom-to-top and overlaps are addressed automatically. A sophisticated object tracking algorithm prevents data from being lost for segmented objects. We discuss the primitive objects of circle and polygons that constitute the module and show how they are used with example inputs. Arrays of primitives and arrays of arrays are utilized to build large assemblies of objects. The concept of saved objects is discussed to demonstrate how repetitive objects can be reused easily and augmented in place. Three dimensional meshes can be obtained through mesh extrusion where all materials and side sets are extended to three dimensions. We show that side sets can be defined nearly anywhere within the geometry and can then be applied to the mesh. Finally, example reactor meshes are demonstrated for the Idaho National Laboratory Advanced Test Reactor and Los Alamos National Lab Empire reactor, both of which use control drums that NucMesh handles easily. (authors)

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

Chapter 6: Surrogate Model Guided Optimization Algorithms and Their Potential Use in Autonomous Experimentation

This chapter reviews the basics of derivative-free optimization methods based on surrogate models and outlines how these methods can straightforwardly be applied to autonomously steering experimentation. It summarizes general solution approaches that use surrogate models and active learning. Surrogate modeling is often combined with active learning strategies, where in each iteration of the optimization algorithm, the surrogate model is used to identify which new inputs should be evaluated next and given the new input-output pair, the surrogate model is updated. Regardless of feasibility, the surrogate models for the constraints are updated in each iteration of the optimization algorithm, while the surrogate model for the objective function is only updated when a feasible point has been found. Similarly to the case of computationally cheap constraints, the surrogate models of the constraints should be incorporated into the definition of the auxiliary optimization problem that is solved to select new sample points.

active learning↗

Clustering with Missing Values: No Imputation Required

Clustering algorithms can identify groups in large data sets, such as star catalogs and hyperspectral images. In general, clustering methods cannot analyze items that have missing data values. Common solutions either fill in the missing values (imputation) or ignore the missing data (marginalization). Imputed values are treated as just as reliable as the truly observed data, but they are only as good as the assumptions used to create them. In contrast, we present a method for encoding partially observed features as a set of supplemental soft constraints and introduce the KSC algorithm, which incorporates constraints into the clustering process. In experiments on artificial data and data from the Sloan Digital Sky Survey, we show that soft constraints are an effective way to enable clustering with missing values.

constraints↗

Approximate Boltzmann distributions in quantum approximate optimization

Approaches to compute or estimate the output probability distributions from the quantum approximate optimization algorithm (QAOA) are needed to assess the likelihood it will obtain a quantum computational advantage. We analyze output from QAOA circuits solving 7200 random MaxCut instances, with $n$ = 14–23 qubits and depth parameter $p$ ≤ 12 and find that the average basis state probabilities follow approximate Boltzmann distributions: The average probabilities scale exponentially with their energy (cut value), with a peak at the optimal solution. Furthermore, we describe the rate of exponential scaling or effective temperature in terms of a series with a leading-order term $T$ ~ $C$ min /$n$ $\sqrt{p}$, with $C$ min the optimal solution energy. Using this scaling, we generate approximate output distributions with up to 38 qubits and find these give accurate accounts of important performance metrics in cases we can simulate exactly.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Quantification of Lanthanides in a Molten Salt Reactor Surrogate Off-Gas Stream Using Laser-Induced Breakdown Spectroscopy

To enable the deployment of molten salt reactor technology, the development of off-gas treatment systems and advanced monitoring tools capable of operating with high temperatures and radiation fields while delivering near real-time information is necessary. Here, we aim to fulfill this requirement and proposes laser-induced breakdown spectroscopy (LIBS) for monitoring molten salt aerosol streams. A sheath gas measuring method was developed to protect optical elements from aerosol particles and to ensure a relatively constant aerosol stream for measurement. An aqueous system was studied to demonstrate the utility of LIBS for monitoring possible fission products in an aerosol stream: Gd, Nd, and Sm up to 2000 parts per million (ppm). A calibration model was built using partial least squares (PLS) regression with five, six, and nine latent variables for Gd, Nd, and Sm, respectively. This calibration model successfully estimated the concentrations of three test samples, which were validated with inductively charged plasma optical emission spectroscopy measurements at a 99.9% confidence interval. To enhance these models, a genetic algorithm was used to filter the spectra before entering the PLS model, thereby limiting the spectral features being regressed to those with greater correlations to concentration. This allowed for the number of latent variables used in the PLS models to be reduced to four, three, and three for Gd, Nd, and Sm, respectively. Finally, the genetic algorithm-filtered PLS models were used to predict the concentrations of the aerosol stream on a real-time dataset and resulted in a 73%, 18%, and 25% improvement in root mean squared error of prediction compared to the original PLS models developed.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

The dynamics and control of large flexible space structures X, part 1

The effect of delay in the control system input on the stability of a continuously acting controller which is designed without considering the delay is studied. The stability analysis of a second order plant is studied analytically and verified numerically. For this example it is found that the system becomes unstable for a delay which is equivalent to only 16 percent of its natural period of motion. It is also observed that even a small amount of natural damping in the system can increase the amount of delay that can be tolerated before the onset of instability. The delay problem is formulated in the discrete time domain and an analysis procedure suggested. The maximum principle from optimal control theory is applied to minimize the time required for the slewing of a general rigid spacecraft. The slewing motion need not be restricted to a single axis maneuver. The minimum slewing time is calculated based on a quasi-linearization algorithm for the resulting two point boundary value problem. Numerical examples based on the rigidized in-orbit model of the SCOLE also include the more general reflector line-of-sight slewing maneuvers.

Bainum, Peter M.↗

A Lanczos algorithm for vibration, suckling and termal analysis

This paper reviews an eigensolver algorithm based on the Lanczos Method for vibration, buckling and thermal analysis. The original code was written for inclusion in the Computational Mechanics Testbed (COMET), a general purpose finite element code. A portable version of the Lanczos code that is optimized for high-performance supercomputers has been developed. Special features of the algorithm include the capability to compute rigid body modes, thermal modes and Lanczos vectors that are derived from the applied load vector. The latter is necessary when using the Lanczos vectors as reduced-basis vectors in transient structural response and transient heat conduction calculations. The modularity of the code allows the user the option of including the most up-to-date utilities, such as the equation solver best suited for the application. The algorithm is discussed in detail and results of several applications are presented. Timing results for a vibration application indicate that the Lanczos algorithm is twenty times faster than the subspace iteration method which has been extensively used in the past.

Bostic, Susan W.↗

Comparison of different fractal dimension measuring algorithms for RE-TM M-O films

Noise in magneto-optical recording devices is discussed. In general, it appears that either the divider technique or amplitude spectrum technique may be used interchangeably to measure the fractal dimension (D) in the domain wall structure of ideal images. However, some caveats must be observed for best results. The divider technique is attractive for its simplicity and relatively modest computation requirements. However, it is sensitive to noise, in that noise pixels that touch the domain boundary are interpreted as being part of the boundary, skewing the measurement. Also, it is not useful in measuring nucleation-dominated films or domains that have significant amounts of structure within the interior of the domain wall. The amplitude spectrum method is more complex, and less intuitive than the divider method, and somewhat more expensive to implement computationally. However, since the camera noise tends to be white, the noise can be avoided in the measurement of D by avoiding that portion of the curve that is flat (due to the white noise) when the least squares line is fit to the plot. Also, many image processing software packages include a Fast Fourier Transformation (FFT) facility, while the user will most likely have to write his own edge extraction routine for the divider method. The amplitude spectrum method is a true two dimensional technique that probes the interior of the domain wall, and in fact, can measure arbitrary clusters of domains. It can also be used to measure grey-level images, further reducing processing steps needed to threshold the image.

Bernacki, Bruce E.↗

Robust reconstruction of single-cell RNA-seq data with iterative gene weight updates

Single-cell RNA-sequencing technologies have greatly enhanced our understanding of heterogeneous cell populations and underlying regulatory processes. However, structural (spatial or temporal) relations between cells are lost during cell dissociation. These relations are crucial for identifying associated biological processes. Many existing tissue-reconstruction algorithms use prior information about subsets of genes that are informative with respect to the structure or process to be reconstructed. When such information is not available, and in the general case when the input genes code for multiple processes, including being susceptible to noise, biological reconstruction is often computationally challenging. We propose an algorithm that iteratively identifies manifold-informative genes using existing reconstruction algorithms for single-cell RNA-seq data as subroutine. We show that our algorithm improves the quality of tissue reconstruction for diverse synthetic and real scRNA-seq data, including data from the mammalian intestinal epithelium and liver lobules.

59 BASIC BIOLOGICAL SCIENCES↗