Search NASA⌕ Search

SEARCH · Search NASA

Results for “Vectorized 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,261 records · Page 70

Coupled Transient Finite Element Simulation of Quench in Jefferson Lab's 11 GeV Super High Momentum Spectrometer Superconducting Magnets

This paper presents coupled transient thermal and electromagnetic finite element analysis of quench in the Q2, Q3, and dipole superconducting magnets using Vector Fields Quench code. Detailed temperature distribution within coils and aluminum force collars were computed at each time step. Both normal (quench with dump resistor) and worst-case (quench without dump resistor) scenarios were simulated to investigate the maximum temperatures. Two simulation methods were utilized, and their algorithms, implementation, advantages, and disadvantages are discussed. The first method simulated the coil using nonlinear transient thermal analysis directly linked with the transient circuit analysis. It was faster because only the coil was meshed and no eddy current was modeled. The second method simulated the whole magnet including the coil, the force collar, and the iron yoke. It coupled thermal analysis with transient electromagnetic field analysis which modeled electromagnetic fields including eddy currents within the force collar. Since eddy currents and temperature in the force collars were calculated in various configurations, segmentation of the force collars was optimized under the condition of fast discharge.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Robust control of systems with real parameter uncertainty and unmodelled dynamics

During this research period we have made significant progress in the four proposed areas: (1) design of robust controllers via H infinity optimization; (2) design of robust controllers via mixed H2/H infinity optimization; (3) M-delta structure and robust stability analysis for structured uncertainties; and (4) a study on controllability and observability of perturbed plant. It is well known now that the two-Riccati-equation solution to the H infinity control problem can be used to characterize all possible stabilizing optimal or suboptimal H infinity controllers if the optimal H infinity norm or gamma, an upper bound of a suboptimal H infinity norm, is given. In this research, we discovered some useful properties of these H infinity Riccati solutions. Among them, the most prominent one is that the spectral radius of the product of these two Riccati solutions is a continuous, nonincreasing, convex function of gamma in the domain of interest. Based on these properties, quadratically convergent algorithms are developed to compute the optimal H infinity norm. We also set up a detailed procedure for applying the H infinity theory to robust control systems design. The desire to design controllers with H infinity robustness but H(exp 2) performance has recently resulted in mixed H(exp 2) and H infinity control problem formulation. The mixed H(exp 2)/H infinity problem have drawn the attention of many investigators. However, solution is only available for special cases of this problem. We formulated a relatively realistic control problem with H(exp 2) performance index and H infinity robustness constraint into a more general mixed H(exp 2)/H infinity problem. No optimal solution yet is available for this more general mixed H(exp 2)/H infinity problem. Although the optimal solution for this mixed H(exp 2)/H infinity control has not yet been found, we proposed a design approach which can be used through proper choice of the available design parameters to influence both robustness and performance. For a large class of linear time-invariant systems with real parametric perturbations, the coefficient vector of the characteristic polynomial is a multilinear function of the real parameter vector. Based on this multilinear mapping relationship together with the recent developments for polytopic polynomials and parameter domain partition technique, we proposed an iterative algorithm for coupling the real structured singular value.

Chang, Bor-Chin↗

WE-AB-204-09: Respiratory Motion Correction in 4D-PET by Simultaneous Motion Estimation and Image Reconstruction (SMEIR)

Purpose: In conventional 4D-PET, images from different frames are reconstructed individually and aligned by registration methods. Two issues with these approaches are: 1) Reconstruction algorithms do not make full use of all projections statistics; and 2) Image registration between noisy images can Result in poor alignment. In this study we investigated the use of simultaneous motion estimation and image reconstruction (SMEIR) method for cone beam CT for motion estimation/correction in 4D-PET. Methods: Modified ordered-subset expectation maximization algorithm coupled with total variation minimization (OSEM- TV) is used to obtain a primary motion-compensated PET (pmc-PET) from all projection data using Demons derived deformation vector fields (DVFs) as initial. Motion model update is done to obtain an optimal set of DVFs between the pmc-PET and other phases by matching the forward projection of the deformed pmc-PET and measured projections of other phases. Using updated DVFs, OSEM- TV image reconstruction is repeated and new DVFs are estimated based on updated images. 4D XCAT phantom with typical FDG biodistribution and a 10mm diameter tumor was used to evaluate the performance of the SMEIR algorithm. Results: Image quality of 4D-PET is greatly improved by the SMEIR algorithm. When all projections are used to reconstruct a 3D-PET, motion blurring artifacts are present, leading to a more than 5 times overestimation of the tumor size and 54% tumor to lung contrast ratio underestimation. This error reduced to 37% and 20% for post reconstruction registration methods and SMEIR respectively. Conclusion: SMEIR method can be used for motion estimation/correction in 4D-PET. The statistics is greatly improved since all projection data are combined together to update the image. The performance of the SMEIR algorithm for 4D-PET is sensitive to smoothness control parameters in the DVF estimation step.

60 APPLIED LIFE SCIENCES↗

Model-based VQ for image data archival, retrieval and distribution

An ideal image compression technique for image data archival, retrieval and distribution would be one with the asymmetrical computational requirements of Vector Quantization (VQ), but without the complications arising from VQ codebooks. Codebook generation and maintenance are stumbling blocks which have limited the use of VQ as a practical image compression algorithm. Model-based VQ (MVQ), a variant of VQ described here, has the computational properties of VQ but does not require explicit codebooks. The codebooks are internally generated using mean removed error and Human Visual System (HVS) models. The error model assumed is the Laplacian distribution with mean, lambda-computed from a sample of the input image. A Laplacian distribution with mean, lambda, is generated with uniform random number generator. These random numbers are grouped into vectors. These vectors are further conditioned to make them perceptually meaningful by filtering the DCT coefficients from each vector. The DCT coefficients are filtered by multiplying by a weight matrix that is found to be optimal for human perception. The inverse DCT is performed to produce the conditioned vectors for the codebook. The only image dependent parameter used in the generation of codebook is the mean, lambda, that is included in the coded file to repeat the codebook generation process for decoding.

Manohar, Mareboyana↗

Design of smart 3D-digital X-ray microtomographic scanners for non-destructive testing of materials and components of electronic devices with a multilayered structure

The article studies the operating procedures of an X-ray microtomographic scanner and the module of reconstruction and analysis 3D-image of a test sample in particular. An algorithm for 3D-image reconstruction based on image shadow projections and mathematical methods of the processing are described. Chapter 1 describes the basic principles of X-ray tomography and general procedures of the device developed. Chapters 2 and 3 are devoted to the problem of resources saving by the system during the X-ray tomography procedure, which is achieved by preprocessing of the initial shadow projections. Preprocessing includes background noise removing from the images, which reduces the amount of shadow projections in general and increases the efficiency of the group shadow projections compression. Chapter 4 covers general procedures of defect search, which is based on vector analysis principles. In conclusion, the main applications of X-ray tomography are presented.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

An attitude reorientation algorithm for the Galileo spacecraft

This paper presents an onboard closed loop attitude reorientation algorithm for a dual-spin spacecraft, Galileo. The basic concept for the design uses the despun stator as a reference and fires a sequence of fixed duration thruster pulses to precess the angular momentum vector to its commanded orientation. The error signals used to despin the stator and to perform the turn are derived from the stator error quaternion which is computed using gyro outputs. Constraints considered in the design include gyro rate saturation, plume impingement effects, system parameter variations, as well as software reliability and flexibility. The performance of the algorithm was predicted by analysis and confirmed by computer simulation results. It was concluded that a reorientation accuracy of better than 1 milliradian with a nutation angle of less than 1 degree during the turn can be achieved.

Lin, H.-S.↗

Verification of TROPOMI NO2 Product Using OMI NO2 algorithm

We evaluated S5P TROPOspheric Monitoring Instrument (TROPOMI) operational nitrogen dioxide (NO2) product by comparing with the NO2 retrievals from Ozone Monitoring Instrument (OMI) onboard NASA’s Aura satellite. We compared spatially matched NO2 vertical column density (VCD) data from OMI and TROPOMI to identify any discrepancies between the two operational products. We also applied OMI Air-Mass Factor (AMF) algorithm to TROPOMI Slant Column Density (SCD) data (v02.03.01) aiming to create long-term merged NO2 Earth Science Data Record (https://disc.gsfc.nasa.gov/datasets/TROPOMI_MINDS_NO2_1.1/summary ). The algorithm (version 4.0) uses new Geometry-dependent Lambertian Equivalent surface Reflectivity (GLER) product available for each TROPOMI pixel. GLER is pre-calculated using the vector linearized discrete ordinate radiative transfer (VLIDORT) model, which uses as input high-resolution bidirectional reflectance distribution function (BRDF) information from NASA's Aqua Moderate Resolution Imaging Spectroradiometer (MODIS) over land and the wind-dependent Cox–Munk wave-facet slope distribution over water, the latter with a contribution from the water-leaving radiance based on MODIS gap-filled in-water chlorophyll-a data. The GLER data, combined with consistently retrieved cloud parameters, provide improved information for the calculation of the scattering weight profiles. Additional AMF improvements result from using high resolution (0.25o latitude x 0.25o longitude) a priori NO2 profile shapes and other auxiliary information from the Global Modeling Initiative (GMI) Replay simulation sampled using S5P orbital simulator. Our TROPOMI_MINDS_NO2 algorithm employs the stratosphere-troposphere separation scheme, de-striping, and surface snow/ice treatment consistently with the latest OMI NO2 re-processing (version 4). We evaluate the TROPOMI_MINDS_NO2 product by comparing with the S5P operational NO2 product as well as with independent NO2 observations from ground-based Pandora and aircraft observations. Our results indicate that the new TROPOMI_MINDS_NO2 retrievals are generally higher than the S5P operational NO2 product over polluted regions and show improved agreement with independent validation data.

TROPOMI↗

Optical matrix-vector processing for computational fluid dynamics

An optical processor to solve partial differential equations for computational fluid dynamics applications is considered. This application is new and original for optical processors. The algorithms that are used are optical realizations of the Newton-Raphson method for nonlinear equations and a new optical LU direct decomposition and Gauss-Seidel iterative solution to the resultant linear algebraic equations. These algorithms are used to solve Burger's equation (a specific form of the momentum equation in fluid dynamics). The nonlinear equations provide 1-D velocity data at each time step. Simulation results of optical processing with these algorithms on computational fluid dynamics data is included.

Perlee, Caroline J.↗

NAS Applications and Advanced Algorithms

This paper examines the applications most commonly run on the supercomputers at the Numerical Aerospace Simulation (NAS) facility. It analyzes the extent to which such applications are fundamentally oriented to vector computers, and whether or not they can be efficiently implemented on hierarchical memory machines, such as systems with cache memories and highly parallel, distributed memory systems.

Bailey, David H.↗

Predictive Attitude Estimation Using Global Positioning System Signals

In this paper, a new algorithm is developed for attitude estimation using Global Positioning System (GPS) signals. The new algorithm is based on a predictive filtering scheme designed for spacecraft without rate measuring devices. The major advantage of this new algorithm over traditional Kalman filter approaches is that the model error is not assumed to represented by an unbiased Gaussian noise process with known covariance, but instead is determined during the estimation process. This is achieved by simultaneously solving system optimality conditions and an output error constraint. This approach is well suited for GPS attitude estimation since some error sources that contribute to attitude inaccuracy, such as signal multipath, are known to be non-Gaussian processes. Also, the predictive filter scheme can use either GPS signals or vector observations or a combination of both for attitude estimation, so that performance characteristics can be maintained during periods of GPS attitude sensor outage. The performance of the new algorithm is tested using flight data from the REX-2 spacecraft. Results are shown using the predictive filter to estimate the attitude from both GPS signals and magnetometer measurements, and comparing that solution to a magnetometer-only based solution. Results using the new estimation algorithm indicate that GPS-based solutions are verified to within 2 degrees using the magnetometer cross-check for the REX-2 spacecraft. GPS attitude accuracy of better than 1 degree is expected per axis, but cannot be reliably proven due to inaccuracies in the magnetic field model.

Crassidis, John L.↗

A resolution independent neural operator

The Deep operator network (DeepONet) is a powerful yet simple neural operator architecture that utilizes two deep neural networks to learn mappings between infinite-dimensional function spaces. This architecture is highly flexible, allowing the evaluation of the solution field at any location within the desired domain. However, it imposes a strict constraint on the input space, requiring all input functions to be discretized at the same locations; this limits its practical applications. Here, in this work, we introduce a general framework for operator learning from input–output data with arbitrary number and locations of sensors. This begins by introducing a resolution-independent DeepONet (RI-DeepONet), enabling it to handle input functions that are arbitrarily, but sufficiently finely, discretized. To this end, we propose two dictionary learning algorithms to adaptively learn a set of appropriate continuous basis functions, parameterized as implicit neural representations (INRs), from correlated signals defined on arbitrary point cloud data. These basis functions are then used to project arbitrary input function data as a point cloud onto an embedding space (i.e., a vector space of finite dimensions) with dimensionality equal to the dictionary size, which can be directly used by DeepONet without any architectural changes. In particular, we utilize sinusoidal representation networks (SIRENs) as trainable INR basis functions. The introduced dictionary learning algorithms are then used in a similar way to learn an appropriate dictionary of basis functions for the output function data, which defines a new neural operator architecture referred to as the R esolution I ndependent N eural O perator (RINO). In the RINO, the operator learning task simplifies to learning a mapping from the coefficients of input basis functions to the coefficients of output basis functions. We demonstrate the robustness and applicability of RINO in handling arbitrarily (but sufficiently richly) sampled input and output functions during both training and inference through several numerical examples.

Deep operator network (DeepONet)↗

Recombination algorithms and jet substructure: Pruning as a tool for heavy particle searches

We discuss jet substructure in recombination algorithms for QCD jets and single jets from heavy particle decays. We demonstrate that the jet algorithm can introduce significant systematic effects into the substructure. By characterizing these systematic effects and the substructure from QCD, splash-in, and heavy particle decays, we identify a technique, pruning, to better identify heavy particle decays into single jets and distinguish them from QCD jets. Pruning removes protojets typical of soft, wide-angle radiation, improves the mass resolution of jets reconstructing heavy particle decays, and decreases the QCD background to these decays. We show that pruning provides significant improvements over unpruned jets in identifying top quarks and W bosons and separating them from a QCD background, and may be useful in a search for heavy particles.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Real-World Cyber Security Demonstration for Networked Electric Drives

In this article, we present the design and implementation of a cyber-physical security testbed for networked electric drive systems, aimed at conducting real-world security demonstrations. To our knowledge, this is one of the first security testbeds for networked electric drives, seamlessly integrating the domains of power electronics and computer science, and cybersecurity. By doing so, the testbed offers a comprehensive platform to explore and understand the intricate and often complex interactions between cyber and physical systems. The core of our testbed consists of four electric machine drives, meticulously configured to emulate small-scale but realistic information technology (IT) and operational technology (OT) networks. This setup both provides a controlled environment for simulating a wide array of cyber-attacks, and mirrors potential real-world attack scenarios with a high degree of fidelity. The testbed serves as an invaluable resource for the study of cyber-physical security, offering a practical and dynamic platform for testing and validating cybersecurity measures in the context of networked electric drive systems. As a concrete example of the testbed's capabilities, we have developed and implemented a Python-based script designed to execute step-stone attacks over a wireless local area network (WLAN). This script leverages a sequence of target IP addresses, simulating a real-world attack vector that could be exploited by adversaries. To counteract such threats, we demonstrate the efficacy of our developed cyber-attack detection algorithms, which are integral to our testbed's security framework. Furthermore, the testbed incorporates a real-time visualization system using InfluxDB and Grafana, providing a dynamic and interactive representation of networked electric drives and their associated security monitoring mechanisms. This visualization component not only enhances the testbed's usability but also offers insightful, real-time data for researchers and practitioners, thereby facilitating a deeper understanding of cyber-physical security dynamics in networked electric drive systems.

24 POWER TRANSMISSION AND DISTRIBUTION↗

ChatBLAS: The First AI-Generated and Portable BLAS Library

We present ChatBLAS, the first AI-generated and portable Basic Linear Algebra Subprograms (BLAS) library on different CPU/GPU configurations. The purpose of this study is (i) to evaluate the capabilities of current large language models (LLMs) to generate a portable and HPC library for BLAS operations and (ii) to define the fundamental practices and criteria to interact with LLMs for HPC targets to elevate the trustworthiness and performance levels of the AI-generated HPC codes. The generated C/C++ codes must be highly optimized using device-specific solutions to reach high levels of performance. Additionally, these codes are very algorithm-dependent, thereby adding an extra dimension of complexity to this study. We used OpenAI’s LLM ChatGPT and focused on vector-vector BLAS level-1 operations. ChatBLAS can generate functional and correct codes, achieving high-trustworthiness levels, and can compete or even provide better performance against vendor libraries.

Valero Lara, Pedro↗

Using Expression and Genotype to Predict Drug Response in Yeast

Personalized, or genomic, medicine entails tailoring pharmacological therapies according to individual genetic variation at genomic loci encoding proteins in drug-response pathways. It has been previously shown that steady-state mRNA expression can be used to predict the drug response (i.e., sensitivity or resistance) of non-genotyped mammalian cancer cell lines to chemotherapeutic agents. In a real-world setting, clinicians would have access to both steady-state expression levels of patient tissue(s) and a patient’s genotypic profile, and yet the predictive power of transcripts versus markers is not well understood. We have previously shown that a collection of genotyped and expression-profiled yeast strains can provide a model for personalized medicine. Here we compare the predictive power of 6,229 steady-state mRNA transcript levels and 2,894 genotyped markers using a pattern recognition algorithm. We were able to predict with over 70% accuracy the drug sensitivity of 104 individual genotyped yeast strains derived from a cross between a laboratory strain and a wild isolate. We observe that, independently of drug mechanism of action, both transcripts and markers can accurately predict drug response. Marker-based prediction is usually more accurate than transcript-based prediction, likely reflecting the genetic determination of gene expression in this cross.

59 BASIC BIOLOGICAL SCIENCES↗

Automated finite element grid break-up method, a verification of the six node averaging approach

The verification of the nodal averaging method for generating automated finite triangular element grids was demonstrated. This was accomplished with a six node averaging program (SNAP) which was placed on an IBM 2250 vector graphics scope terminal. The advantage of this method is that it is unnecessary to program time consuming geometric division and transition algorithms.

Barten, H. J.↗

Intensity changes in the UV spectrum of Beta Cephei

Fifty eight short wavelength International Ultraviolet Explorer spectra were taken over a 152 day period. Variations in the absorption lines of C IV (1550 A), Si IV (1393 and 1404 A) and N V (1239 and 1243 A) and a Cr III feature (1208 to 1211 A) were observed. A data reduction technique was developed in order to compare the changes in the equivalent widths of these absorption lines. Periods were determined by least squares fit to a sinusoid using several combinations of the data. In one case eighteen spectra for each ion taken at approximately one day intervals were used; in another, all 58 measurements of each were used; and in a third all measurements from all the ions wee combined. Using both variable metric and interactive algorithms it was determined that for all combinations mentioned a period of 6.10 + or - .06 days is the best fit to the vector of equivalent widths versus time. No other period, with or without the 6.10 day period removed from the data, was found. Analysis of the Cr III feature near 1210 A gives the same period as the others, but in antiphase.

Fahey, R. P.↗