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.

SourceResearch connectionFrom yearThrough year

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 1,333 records · Page 74

All sources NASA NTRS DOE OSTI

NASA NTRS1986

Analyzing Multidimensional Image Data

Six computer programs perform histogram cluster analysis. Histogram Cluster Analysis Procedure (HICAP) developed to perform unsupervised classification of multidimensional image data. Clustering approach used in HICAP based on algorithm which uses multidimensional histogram to perform unsupervised classification of four-dimensional Landsat multispectral-scanner data. HICAP generalizes this procedure to process up to 32-bit data with arbitrary number of dimensions. Also incorporates efficiency improvements so classification requires less computation than original algorithm. Computational savings afforded by HICAP increase with number of dimensions in data. HICAP programs written in FORTRAN 77 for batch or interactive execution.

Wharton, S. W.↗

NASA NTRS2016

Radiative Transfer Simulations of the Two-Dimensional Ocean Glint Reflectance and Determination of the Sea Surface Roughness

An optimized discrete-ordinate radiative transfer model (DISORT3) with a pseudo-two-dimensional bidirectional reflectance distribution function (BRDF) is used to simulate and validate ocean glint reflectances at an infrared wavelength (1036 nm) by matching model results with a complete set of BRDF measurements obtained from the NASA cloud absorption radiometer (CAR) deployed on an aircraft. The surface roughness is then obtained through a retrieval algorithm and is used to extend the simulation into the visible spectral range where diffuse reflectance becomes important. In general, the simulated reflectances and surface roughness information are in good agreement with the measurements, and the diffuse reflectance in the visible, ignored in current glint algorithms, is shown to be important. The successful implementation of this new treatment of ocean glint reflectance and surface roughness in DISORT3 will help improve glint correction algorithms in current and future ocean color remote sensing applications.

glint↗

DOE OSTI2024

Determining the effects of U/Pu ratio on subsolidus phase transitions in U-Pu-Zr metallic fuel alloys

Here, ternary alloys consisting primarily of uranium, plutonium, and zirconium (U-Pu-Zr) are among the leading candidate fuel systems considered for fast spectrum nuclear reactors. Despite historical operation data from the testing of U-Pu-Zr rods in the Experimental Breeder Reactor-II, considerable uncertainty about the evolution of phases and microstructure across the ternary composition space exists. Due to sluggish kinetics and other difficulties in handling metal actinide specimens, quantitative measurements of phase-transitions in U-Pu-Zr alloys remain sparse in scientific literature, with most investigators reporting either phase-transition temperatures or phase identification data, but not both from the same specimens. The purpose of this paper is to critically compare experimental and calculated phase transition data and correlate with the microstructure and phase characterization data of as-cast and annealed U-Pu-Zr alloys. Phase transition peaks were measured using differential scanning calorimetry in the subsolidus regions (723-948 K) of three ternary U-Pu-Zr alloys with the same zirconium concentration but various U/Pu ratios. Overlapping peaks were deconvoluted using a Frazier-Suzuki peak fitting algorithm, and the critical peak temperatures and enthalpies were calculated. In general, increasing concentrations of Pu were associated with enhanced thermal stability of the body-centered cubic γ phase upon both heating and cooling. Experimental phase transition temperatures in this study tended to agree well with the predictions of the established ternary phase diagrams and other reported phase transition temperatures in literature. Additionally, the TAF-ID thermodynamic database was used to calculate a U-Pu-40 at.% Zr pseudobinary diagram as well as ternary diagrams from 773 to 973 K. The equilibrium phase transition temperatures tended to be considerably lower than measured peak temperatures upon both heating and cooling. Recommendations for improving the quality of data in future U-Pu-Zr characterization studies are also discussed.

11 NUCLEAR FUEL CYCLE AND FUEL MATERIALS↗

DOE OSTI2025

MHD, disruptions and control physics: Chapter 4 of the special issue: on the path to tokamak burning plasma operation

In this chapter, we review the progress in MHD stability, disruptions and control in magnetic fusion research that has occurred over the past (more than) one and a half decades since the publication by Hender et al in 2007 on the same topic as part of the update of ITER Physics Basis. During this period, remarkable progress has been achieved in the understanding of the basic physics and overall control of MHD instabilities through a wide spectrum of dedicated experiments, theory and modeling. The sawtooth activities are probably today one of the best understood of MHD events and very robust control schemes have been developed for reliable operation of tokamaks through core heating. Similarly, significant improvements have been achieved in understanding and control of neoclassical tearing modes, resistive wall modes or locked modes and their control through ECCD or error field control. The field of disruption prediction through application of artificial intelligence, machine learning or deep learning methods, which had already started at the time of the 2007 review, has progressed significantly due to general progress in these fields and application of newer, more sophisticated algorithms. However, although remarkable progress has been achieved in the field of Disruptions, their understanding, prediction, possible avoidance and mitigation still remain probably the most active fields of R&D globally in this field. This is especially because reactor grade machines like ITER and DEMO will be much less tolerant in respect of disruptions and runaway currents, and their occurrences must be either avoided altogether or minimized to an acceptable value without causing any significant hindrance to robust machine operations. This review is intended to present a broad spectrum of the R&D that has occurred in this field in support of ITER, which will also be of immense significance for all future machines, especially reactors like DEMO.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

DOE OSTI2024

Semi-supervised Learning of Dynamical Systems with Neural Ordinary Differential Equations: A Teacher-Student Model Approach

Modeling dynamical systems is crucial for a wide range of tasks, but it remains challenging due to complex nonlinear dynamics, limited observations, or lack of prior knowledge. Recently, data-driven approaches such as Neural Ordinary Differential Equations (NODE) have shown promising results by leveraging the expressive power of neural networks to model unknown dynamics. However, these approaches often suffer from limited labeled training data, leading to poor generalization and suboptimal predictions. On the other hand, semi-supervised algorithms can utilize abundant unlabeled data and have demonstrated good performance in classification and regression tasks. We propose TS-NODE, the first semi-supervised approach to modeling dynamical systems with NODE. TS-NODE explores cheaply generated synthetic pseudo rollouts to broaden exploration in the state space and to tackle the challenges brought by lack of ground-truth system data under a teacher-student model. TS-NODE employs an unified optimization framework that corrects the teacher model based on the student's feedback while mitigating the potential false system dynamics present in pseudo rollouts. TS-NODE demonstrates significant performance improvements over a baseline Neural ODE model on multiple dynamical system modeling tasks.

Wang, Yu↗

DOE OSTI2025

PDF Entity Annotation Tool (PEAT)

While different text mining approaches – including the use of Artificial Intelligence (AI) and other machine based methods - continue to expand at a rapid pace, the tools used by researchers to create the labeled datasets required for training, modeling, and evaluation remain rudimentary. Labeled datasets contain the target attributes the machine is going to learn; for example, training an algorithm to delineate between images of a car or truck would generally require a set of images with a quantitative description of the underlying features of each vehicle type. Development of labeled textual data that can be used to build natural language machine learning models for scientific literature is not currently integrated into existing manual workflows used by domain experts. Published literature is rich with important information, such as different types of embedded text, plots, and tables that can all be used as inputs to train ML/natural language processing (NLP) models, when extracted and prepared in machine readable formats. Currently, both normalized data extraction of use to domain experts and extraction to support development of ML/NLP models are labor intensive and cumbersome manual processes. Automatic extraction of data and information from formats such as PDFs that are optimized for layout and human readability, not machine readability. The PDF (Portable Document Format) Entity Annotation Tool (PEAT) was developed with the goal of allowing users to annotate publications within their current print format, while also allowing those annotations to be captured in a machine-readable format. One of the main issues with traditional annotation tools is that they require transforming the PDF into plain text to facilitate the annotation process. While doing so lessens the technical challenges of annotating data, the user loses all structure and provenance that was inherent in the underlying PDF. Also, textual data extraction from PDFs can be an error prone process. Challenges include identifying sequential blocks of text and a multitude of document formats (multiple columns, font encodings, etc.). As a result of these challenges, using existing tools for development of NLP/ML models directly from PDFs is difficult because the generated outputs are not interoperable. We created a system that allows annotations to be completed on the original PDF document structure, with no plain text extraction. The result is an application that allows for easier and more accurate annotations. In addition, by including a feature that grants the user the ability to easily create a schema, we have developed a system that can be used to annotate text for different domain-centric schemas of relevance to subject matter experts. Different knowledge domains require distinct schemas and annotation tags to support machine learning.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2023

Confidence Assessment for Automatic Target Recognition

Confidence assessment is critical for effective automatic target recognition (ATR). Productive use and interpretation of ATR results by analysts or downstream algorithms requires not only algorithmic declarations of target presence and identity, but also algorithmic assessment of the certainty of those declarations in comparison to the certainties of alternative target-identity possibilities. Unfortunately, despite its importance, confidence assessment is an understudied, underdeveloped, and often-neglected function of ATR systems. This lack of regard stems not only from the difficulty of accurate algorithmic determination of target-identity certainty, but also from a general lack of understanding and careful consideration about what confidence should actually represent. We present a framework for confidence assessment that establishes a clear definition of confidence and provides a straightforward theoretical basis for its calculation. This framework is grounded in a hypothesis-theoretic consideration of ATR and it springs from from a handful of axiomatic principles concerning the nature and meaning of confidence in this context. This framework establishes a rigorous mathematical definition of confidence and it provides equations relating confidence to other information that is almost always provided by ATRs. We present an approach for computing confidence within this framework, using an advance process of ATR characterization followed by a simple computation at the time of ATR execution. We discuss practical difficulties with our approach, and we suggest methods for effective mitigation of these difficulties in implemented systems.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2025

Radiation GRMHD Models of Accretion onto Stellar-mass Black Holes. I. Survey of Eddington Ratios

We summarize results from a survey of radiation-dominated black hole accretion flows across a wide range of mass accretion rates, as well as two values of black hole spin and initial magnetic field geometry. These models apply an algorithm targeting direct solutions to the radiation transport equation in full general relativity and have been enabled by access to modern exascale computing systems. Super-Eddington accretion flows form geometrically thick radiation-pressure-supported disks that drive powerful equatorial outflows. A narrow funnel-shaped photosphere in the inner region results in very low radiative efficiencies in this regime. The structure of near- and sub-Eddington accretion depends on whether there is net vertical magnetic flux at the midplane of the disk. With net flux, the disk forms a thin, dense layer at the midplane surrounded by a magnetically dominated corona, whereas without net flux, the disk remains magnetically dominated everywhere. Although none of our models achieve the magnetically arrested disk regime, those with net vertical flux and a rapidly spinning black hole still produce powerful relativistic jets. Our calculations adopt simple opacity models (with scalings appropriate to stellar-mass black hole accretion). We discuss the application of our results to observations of X-ray binaries and ultraluminous X-ray sources such as Cyg X-3 and SS433. We also speculate on the application of our super-Eddington models to the interpretation of little red dots recently discovered by JWST.

79 ASTRONOMY AND ASTROPHYSICS↗

NASA NTRS1976

On the computational cost of approximating and recognizing noise-perturbed straight lines and quadratic arcs in the plane

Recognition of underlying straight lines and quadratic arcs in line drawings, and approximation of very noisy data by such line/curve segments, is addressed as a subproblem of the more general problem of optimum recognition of complicated line/curve drawings. Some specific algorithms are presented with extensions and interpretations for more complicated applications, and a data generation model is developed for the problem. Data are generated as a perturbation of a single underlying straight line or an elliptic or hyperbolic arc. Recursive estimation techniques, minimization of central processing unit time, decision making with controlled error probabilities, and modeling and recognition of pictures consisting of noisy curves are dealt with. Applications envisaged include: picture data compression, contour line representation in maps, intelligent data searches, and ballistic missile decoy tracking.

Cooper, D. B.↗

NASA NTRS1978

Efficiency trade-offs of steady-state methods using FEM and FDM

The efficiency characteristics of finite element and finite difference approximations for the steady-state solution of the Navier-Stokes equations are examined. The finite element method discussed is a standard Galerkin formulation of the incompressible, steady-state Navier-Stokes equations. The finite difference formulation uses simple centered differences that are O(delta x-squared). Operation counts indicate that a rapidly converging Newton-Raphson-Kantorovitch iteration scheme is generally preferable over a Picard method. A split NOS Picard iterative algorithm for the finite difference method was most efficient.

Gartling, D. K.↗

NASA NTRS1980

Interpretation of laser/multi-sensor data for short range terrain modeling and hazard detection

A terrain modeling algorithm that would reconstruct the sensed ground images formed by the triangulation scheme, and classify as unsafe any terrain feature that would pose a hazard to a roving vehicle is described. This modeler greatly reduces quantization errors inherent in a laser/sensing system through the use of a thinning algorithm. Dual filters are employed to separate terrain steps from the general landscape, simplifying the analysis of terrain features. A crosspath analysis is utilized to detect and avoid obstacles that would adversely affect the roll of the vehicle. Computer simulations of the rover on various terrains examine the performance of the modeler.

Messing, B. S.↗

NASA NTRS1982

Convergence acceleration of viscous flow computations

A multiple-grid convergence acceleration technique introduced for application to the solution of the Euler equations by means of Lax-Wendroff algorithms is extended to treat compressible viscous flow. Computational results are presented for the solution of the thin-layer version of the Navier-Stokes equations using the explicit MacCormack algorithm, accelerated by a convective coarse-grid scheme. Extensions and generalizations are mentioned.

Johnson, G. M.↗

NASA NTRS1983

Structural optimization - Challenges and opportunities

A review of developments in structural optimization techniques and their interface with growing computer capabilities is presented. Structural design steps comprise functional definition of an object, an evaluation phase wherein external influences are quantified, selection of the design concept, material, object geometry, and the internal layout, and quantification of the physical characteristics. Optimization of a fully stressed design is facilitated by use of nonlinear mathematical programming which permits automated definition of the physics of a problem. Design iterations terminate when convergence is acquired between mathematical and physical criteria. A constrained minimum algorithm has been formulated using an Augmented Lagrangian approach and a generalized reduced gradient to obtain fast convergence. Various approximation techniques are mentioned. The synergistic application of all the methods surveyed requires multidisciplinary teamwork during a design effort.

Sobieszczanski-Sobieski, J.↗

NASA NTRS1984

Structural optimization: Challenges and opportunities

Sobieszczanski-Sobieski, J.↗

NASA NTRS1986

Radarclinometry

A general theory based on the implicit mathematical determinacy, and a corresponding algorithm, are developed to derive topographic maps from radar images as photometric arrays. Starting from a control profile, the theory produces topography by an area integration of radar brightness, and the control profile is formed under the assumption that the terrain properties are locally cylindrical. The calibration curve for pixel brightness versus incidence-angle is also produced. In the operational algorithm, topography is produced as a set of independent line integrations down each of the parallel range lines of the image using the theory for control-profile formation. An adaptive technique was employed to process SEASAT images of sand dunes, and the present method is demonstrated with a Motorola image of Crazy Jug Point in the Grand Canyon.

Wildey, Robert L.↗

NASA NTRS1987

Robust eigensystem assignment for flexible structures

An improved method is developed for eigenvalues and eigenvectors placement of a closed-loop control system using either state or output feedback. The method basically consists of three steps. First, the singular value of QR decomposition is used to generate an orthonormal basis that spans admissible eigenvector space corresponding to each assigned eigenvalue. Secondly, given a unitary matrix, the eigenvector set which best approximates the given matrix in the least-square sense and still satisfy eigenvalue cosntraints is determined. Thirdly, a unitary matrix is sought to minimize the error between the unitary matrix and the assignable eigenvector matrix. For use as the desired eigenvector set, two matrices, namely, the open-loop eigenvector matrix and its closest unitary matrix are proposed. The latter matrix generally encourages both minimum conditioning and control gains. In addition, the algorithm is formulated in real arithmetic for efficient implementation. To illustrate the basic concepts, numerical examples are included.

Juang, Jer-Nan↗

NASA NTRS1989

Towards a rational theory for CFD global stability

The fundamental notion of the consistent stability of semidiscrete analogues of evolution PDEs is explored. Lyapunov's direct method is used to develop CFD semidiscrete algorithms which yield the TVD constraint as a special case. A general formula for supplying dissipation parameters for arbitrary multidimensional conservation law systems is proposed. The reliability of the method is demonstrated by the results of two numerical tests for representative Euler shocked flows.

Baker, A. J.↗

NASA NTRS1990

A three-dimensional dynamic solution-adaptive mesh algorithm

A solution-adaptive grid algorithm has been developed for use in two and three dimensions. The algorithm uses a transformation from the cartesian coordinate system to a general coordinate space, which will be defined as a parallelepiped. A weighting function for adaption of the grid is developed that will allow adaption to the gradients of any combination of dependent variables in the flow. The adaption is carried out in the parametric space and a simple inverse mapping to return the new parametric space to the physical space is derived. The concept used to relocate the grid-points in the parametric space is based on the center of mass of distributed weights. Solution-adaptive results are presented for various laminar flows in two dimensions and for mathematical weighting functions in three dimensions.

Benson, Rusty A.↗