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 235 records · Page 13

Learning nuclear cross sections across the chart of nuclides with graph neural networks

We explore the use of deep learning techniques to learn how nuclear cross sections change as we add or remove protons and neutrons. As a proof of principle, we focus on the neutron-induced reactions in the fast energy regime. Our approach follows a two-stage learning framework. First, we apply representation learning to encode cross section data into a latent space using either variational autoencoders (VAEs) or implicit neural representations (INRs). Then, we train graph neural networks (GNNs) on the resulting embeddings to predict missing values across the nuclear chart by leveraging the topological structure of neighboring isotopes. We demonstrate accurate cross section predictions within a 9 × 9 block of missing nuclei. We also find that the optimal GNN training strategy depends on the type of latent representation used, with VAE embeddings performing best under end-to-end optimization in the original space, while INR embeddings achieve better results when the GNN is trained only in the latent space. Furthermore, using clustering algorithms, we map groups of latent vectors into regions of the nuclear chart and show that VAEs and INRs can discover some of the neutron magic numbers. These findings suggest that deep-learning models based on the representation encoding of cross sections combined with graph neural networks hold significant potential in augmenting nuclear theory models, e.g., by providing reliable estimates of covariances of cross sections, including cross-material covariances.

Machine learning↗

Detection of translational noncrystallographic symmetry in Patterson functions

Detection of translational noncrystallographic symmetry (TNCS) can be critical for success in crystallographic phasing, particularly when molecular-replacement models are poor or anomalous phasing information is weak. If the correct TNCS is detected then expected intensity factors for each reflection can be refined, so that the maximum-likelihood functions underlying molecular replacement and single-wavelength anomalous dispersion use appropriate structure-factor normalization and variance terms. Here, an analysis of a curated database of protein structures from the Protein Data Bank to investigate how TNCS manifests in the Patterson function is described. These studies informed an algorithm for the detection of TNCS, which includes a method for detecting the number of vectors involved in any commensurate modulation (the TNCS order). The algorithm generates a ranked list of possible TNCS associations in the asymmetric unit for exploration during structure solution.

59 BASIC BIOLOGICAL SCIENCES↗

Safe and Robust Binary Classification and Fault Detection Using Reinforcement Learning

In this paper, we propose a learning-based method utilizing the Soft Actor-Critic (SAC) algorithm to train a binary Support Vector Machine (SVM) classifier. This classifier is designed to identify valid input spaces in high-dimensional, highly constrained systems while minimizing the total runtime of offline simulations. The simulations adapt their runtime based on the likelihood that a given training input will be informative to the classifier. Furthermore, we introduce a method for using the trained SAC model to predict whether a desired system input is likely to violate constraints, along with a technique to adjust the input as necessary. Additionally, we explore the potential of this model to detect faults or adversarial attacks within the system. The effectiveness of our approach is demonstrated through various simulations of challenging classification problems and a constrained quadrotor model.

Netter, Josh [Georgia Institute of Technology, Atl↗

TH-CD-202-06: A Method for Characterizing and Validating Dynamic Lung Density Change During Quiet Respiration

Purpose: To obtain a functional relationship that calibrates the lung tissue density change under free breathing conditions through correlating Jacobian values to the Hounsfield units. Methods: Free-breathing lung computed tomography images were acquired using a fast helical CT protocol, where 25 scans were acquired per patient. Using a state-of-the-art deformable registration algorithm, a set of the deformation vector fields (DVF) was generated to provide spatial mapping from the reference image geometry to the other free-breathing scans. These DVFs were used to generate Jacobian maps, which estimate voxelwise volume change. Subsequently, the set of 25 corresponding Jacobian and voxel intensity in Hounsfield units (HU) were collected and linear regression was performed based on the mass conservation relationship to correlate the volume change to density change. Based on the resulting fitting coefficients, the tissues were classified into parenchymal (Type I), vascular (Type II), and soft tissue (Type III) types. These coefficients modeled the voxelwise density variation during quiet breathing. The accuracy of the proposed method was assessed using mean absolute difference in HU between the CT scan intensities and the model predicted values. In addition, validation experiments employing a leave-five-out method were performed to evaluate the model accuracy. Results: The computed mean model errors were 23.30±9.54 HU, 29.31±10.67 HU, and 35.56±20.56 HU, respectively, for regions I, II, and III, respectively. The cross validation experiments averaged over 100 trials had mean errors of 30.02 ± 1.67 HU over the entire lung. These mean values were comparable with the estimated CT image background noise. Conclusion: The reported validation experiment statistics confirmed the lung density modeling during free breathing. The proposed technique was general and could be applied to a wide range of problem scenarios where accurate dynamic lung density information is needed. This work was supported in part by NIH R01 CA0096679.

60 APPLIED LIFE SCIENCES↗

Deep Learning for In-Situ Layer Quality Monitoring during Laser-Based Directed Energy Deposition (LB-DED) Additive Manufacturing Process

Defects are a leading issue for the rejection of parts manufactured through the Directed Energy Deposition (DED) Additive Manufacturing (AM) process. In an attempt to illuminate and advance in situ quality monitoring and control of workpieces, we present an innovative data-driven method that synchronously collects sensing data and AM process parameters with a low sampling rate during the DED process. The proposed data-driven technique determines the important influences that individual printing parameters and sensing features have on prediction at the inter-layer qualification to perform feature selection. Three Machine Learning (ML) algorithms including Random Forest (RF), Support Vector Machine (SVM), and Convolutional Neural Network (CNN) are used. During post-production, a threshold is applied to detect low-density occurrences such as porosity sizes and quantities from CT scans that render individual layers acceptable or unacceptable. This information is fed to the ML models for training. Training/testing are completed offline on samples deemed “high-quality” and “low-quality”, utilizing only features recorded from the build process. CNN results show that the classification of acceptable/unacceptable layers can reach between 90% accuracy while training/testing on a “high-quality” sample and dip to 65% accuracy when trained/tested on “low-quality”/“high-quality” (respectively), indicating over-fitting but showing CNN as a promising inter-layer classifier.

36 MATERIALS SCIENCE↗

Dynamic defense and network randomization for computer systems

The various technologies presented herein relate to determining a network attack is taking place, and further to adjust one or more network parameters such that the network becomes dynamically configured. A plurality of machine learning algorithms are configured to recognize an active attack pattern. Notification of the attack can be generated, and knowledge gained from the detected attack pattern can be utilized to improve the knowledge of the algorithms to detect a subsequent attack vector(s). Further, network settings and application communications can be dynamically randomized, wherein artificial diversity converts control systems into moving targets that help mitigate the early reconnaissance stages of an attack. An attack(s) based upon a known static address(es) of a critical infrastructure network device(s) can be mitigated by the dynamic randomization. Network parameters that can be randomized include IP addresses, application port numbers, paths data packets navigate through the network, application randomization, etc.

97 MATHEMATICS AND COMPUTING↗

AUTOMATIC LIMIT SURFACE SEARCH FOR PWR TRANSIENTS BY RELAP5-3D/RAVEN CODES

Deterministic safety analysis of nuclear power plants can be improved by applying modern algorithms and codes exploiting machine learning and parallel computing. In this paper we show the application of some of these advanced methodologies for the determination of limit surfaces. A limit surface is an n-dimensional surface describing the plant status, e.g. identifying, as function of selected plant parameters, the boundaries between failed and safe conditions for the core fuel. Using the RELAP5-3D system thermal-hydraulic code coupled to the RAVEN statistical-analysis code, we show how to apply machine-learning algorithms (near-neighbor, support-vector machine, etc.) for determining relevant limit surfaces for PWR station-blackout and loss of offsite power. As a first step, a set of training simulations is run to sample the nuclear power plant responses. Those calculations are used to train a Reduced-Order-Model (ROM), which RAVEN then uses for determining an approximated limit surface. Verification of the guessed limit surface is then automatically performed and calculation is terminated depending by the chosen convergence criteria. The combination of High Performance Computing (HPC) and ROMs allow a remarkable reduction of the time required for the surface determination. RAVEN performs also the automatic data collection of the output of the numerous runs, thus easing the workload of the safety analyst. Finally, using RAVEN “Ensamble Forward” sampling technique, we show how to inform the limit surface calculations with some of the code and input uncertainties.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

Correlated Synthetic Time Series Generation using Fourier and ARMA

As the contribution of renewable energy grows in electricity markets, the complexity nuclear’s place within the energy mix increases, and likewise the need for robust simulation techniques. While decades of wind, solar, and demand pro- files can sometimes be obtained, this is too few samples to provide a statistically meaningful analysis of a system with baseload, peaker, and renewable generation. Synthetic time series generation presents itself as a suitable methodology to meet this need. One approach for synthetic series generation is training a model using Fourier series decomposition for seasonal patterns and Auto-Regressive Moving Average models (ARMA) to describe time-correlated statistical noise about the seasonal patterns. When combined, the Fourier plus ARMA (FARMA) model has been shown to provide an infinite set of independent, identically-distributed sample time series with the same statistical properties as the original data [1]. When considering an energy mix with renewable electricity production, several time series of energy, grid, and weather measurements are needed for each synthetic year modeled to statistically comprehend the efficiency of any given energy mix. These cannot be considered independent series in a given synthetic year. To capture and reproduce the correlations that might exist in the measured histories, the ARMA can further be extended as a Vector ARMA (VARMA). In the VARMA algorithm, covariance in statistical noise is captured both within a history as part of the autoregressive moving average, and with respect to the other variables in the time series. In this work the implementation of the Fourier VARMA in the RAVEN uncertainty quantification and risk analysis software framework [2] is presented, along with examples of correlated synthetic history generation.

97 MATHEMATICS AND COMPUTING↗

Randomized Sampling for Large Data Applications of SVM

A trend in machine learning is the application of existing algorithms to ever-larger datasets. Support Vector Machines (SVM) have been shown to be very effective, but have been difficult to scale to large-data problems. Some approaches have sought to scale SVM training by approximating and parallelizing the underlying quadratic optimization problem. This paper pursues a different approach. Our algorithm, which we call Sampled SVM, uses an existing SVM training algorithm to create a new SVM training algorithm. It uses randomized data sampling to better extend SVMs to large data applications. Experiments on several datasets show that our method is faster than and comparably accurate to both the original SVM algorithm it is based on and the Cascade SVM, the leading data organization approach for SVMs in the literature. Further, we show that our approach is more amenable to parallelization than Cascade SVM.

large data↗

Reconstruction for Liquid Argon TPC Neutrino Detectors Using Parallel Architectures [Slides]

Neutrinos are particles that interact rarely, so identifying them requires large detectors which produce lots of data. Processing this data with the computing power available is becoming more difficult as the detectors increase in size to reach their physics goals. In liquid argon time projection chambers (TPCs) the charged particles from neutrino interactions produce ionization electrons which drift in an electric field towards a series of collection wires, and the signal on the wires is used to reconstruct the interaction. The MicroBooNE detector currently collecting data at Fermilab has 8000 wires, and planned future experiments like DUNE will have 100 times more, which means that the time required to reconstruct an event will scale accordingly. Modernization of liquid argon TPC reconstruction code, including vectorization, parallelization and code portability to GPUs, will help to mitigate these challenges. The liquid argon TPC hit finding algorithm within the L arSoft framework used across multiple experiments has been vectorized and parallelized. This increases the speed of the algorithm on the order of ten times within a stand alone version on Intel architectures. This new version has been incorporated back into LarSoft so that it can be generally used. These methods will also be applied to other low level reconstruction of the wire signals such as the deconvolution. The applications and performance of this modernized liquid argon TPC wire reconstruction will be presented.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

Sparse matrix‐vector and matrix‐multivector products for the truncated SVD on graphics processors

Summary Many practical algorithms for numerical rank computations implement an iterative procedure that involves repeated multiplications of a vector, or a collection of vectors, with both a sparse matrix and its transpose. Unfortunately, the realization of these sparse products on current high performance libraries often deliver much lower arithmetic throughput when the matrix involved in the product is transposed. In this work, we propose a hybrid sparse matrix layout, named CSRC, that combines the flexibility of some well‐known sparse formats to offer a number of appealing properties: (1) CSRC can be obtained at low cost from the popular CSR (compressed sparse row) format; (2) CSRC has similar storage requirements as CSR; and especially, (3) the implementation of the sparse product kernels delivers high performance for both the direct product and its transposed variant on modern graphics accelerators thanks to a significant reduction of atomic operations compared to a conventional implementation based on CSR. This solution thus renders considerably higher performance when integrated into an iterative algorithm for the truncated singular value decomposition (SVD), such as the randomized SVD or, as demonstrated in the experimental results, the block Golub–Kahan–Lanczos algorithm.

Aliaga, José I.↗

Multilevel Robustness for 2D Vector Field Feature Tracking, Selection and Comparison

Abstract Critical point tracking is a core topic in scientific visualization for understanding the dynamic behaviour of time‐varying vector field data. The topological notion of robustness has been introduced recently to quantify the structural stability of critical points, that is, the robustness of a critical point is the minimum amount of perturbation to the vector field necessary to cancel it. A theoretical basis has been established previously that relates critical point tracking with the notion of robustness, in particular, critical points could be tracked based on their closeness in stability, measured by robustness, instead of just distance proximity within the domain. However, in practice, the computation of classic robustness may produce artifacts when a critical point is close to the boundary of the domain; thus, we do not have a complete picture of the vector field behaviour within its local neighbourhood. To alleviate these issues, we introduce a multilevel robustness framework for the study of 2D time‐varying vector fields. We compute the robustness of critical points across varying neighbourhoods to capture the multiscale nature of the data and to mitigate the boundary effect suffered by the classic robustness computation. We demonstrate via experiments that such a new notion of robustness can be combined seamlessly with existing feature tracking algorithms to improve the visual interpretability of vector fields in terms of feature tracking, selection and comparison for large‐scale scientific simulations. We observe, for the first time, that the minimum multilevel robustness is highly correlated with physical quantities used by domain scientists in studying a real‐world tropical cyclone dataset. Such an observation helps to increase the physical interpretability of robustness.

97 MATHEMATICS AND COMPUTING↗

VECTOR TOMOGRAPHY FOR THE CORONAL MAGNETIC FIELD. II. HANLE EFFECT MEASUREMENTS

In this paper, we investigate the feasibility of saturated coronal Hanle effect vector tomography or the application of vector tomographic inversion techniques to reconstruct the three-dimensional magnetic field configuration of the solar corona using linear polarization measurements of coronal emission lines. We applied Hanle effect vector tomographic inversion to artificial data produced from analytical coronal magnetic field models with equatorial and meridional currents and global coronal magnetic field models constructed by extrapolation of real photospheric magnetic field measurements. We tested tomographic inversion with only Stokes Q, U, electron density, and temperature inputs to simulate observations over large limb distances where the Stokes I parameters are difficult to obtain with ground-based coronagraphs. We synthesized the coronal linear polarization maps by inputting realistic noise appropriate for ground-based observations over a period of two weeks into the inversion algorithm. We found that our Hanle effect vector tomographic inversion can partially recover the coronal field with a poloidal field configuration, but that it is insensitive to a corona with a toroidal field. This result demonstrates that Hanle effect vector tomography is an effective tool for studying the solar corona and that it is complementary to Zeeman effect vector tomography for the reconstruction of the coronal magnetic field.

79 ASTRONOMY AND ASTROPHYSICS↗

Fast transformations between configuration state function and Slater determinant bases for direct configuration interaction

A hybrid configuration state function (CSF) and Slater determinant (SD) basis full configuration interaction (CI) program was developed to simultaneously take advantage of fast SD basis algorithms for σ = Hc formation and the smaller CI vector length and more robust convergence offered by a CSF basis. Graphical processing unit acceleration of the direct CSF-SD and SD-CSF basis transformation algorithms ensures that the combined transformation time per iteration relative to σ formation is small (~15%). In addition to the obvious benefits of reducing the memory footprint of the CI vector, additional computational savings are demonstrated that rely directly on the size of the CI basis, in one particular case reducing the CI time-to-solution of a HF-CAS-(16,16)-CI/6-31G calculation of ethylene from 1954.79 s to 956 s by using a CSF basis, a 2.0× speedup.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

On the computational solution of vector-density based continuum dislocation dynamics models: A comparison of two plastic distortion and stress update algorithms

Continuum dislocation dynamics models of mesoscale plasticity consist of dislocation transport-reaction equations coupled with crystal mechanics equations. The coupling between these two sets of equations is such that dislocation transport gives rise to the evolution of plastic distortion (strain), while the evolution of the latter fixes the stress from which the dislocation velocity field is found via a mobility law. Earlier solutions of these equations employed a staggered solution scheme for the two sets of equations in which the plastic distortion was updated via time integration of its rate, as found from Orowan's law. In this work, we show that such a direct time integration scheme can suffer from accumulation of numerical errors. We introduce an alternative scheme based on field dislocation mechanics that ensures consistency between the plastic distortion and the dislocation content in the crystal. The new scheme is based on calculating the compatible and incompatible parts of the plastic distortion separately, and the incompatible part is calculated from the current dislocation density field. Stress field and dislocation transport calculations were implemented within a finite element based discretization of the governing equations, with the crystal mechanics part solved by a conventional Galerkin method and the dislocation transport equations by the least squares method. A simple test was first performed to show the accuracy of the two schemes for updating the plastic distortion, which shows that the solution method based on field dislocation mechanics is more accurate. This method then was used to simulate an austenitic steel crystal under uniaxial loading and multiple slip conditions. By considering dislocation interactions caused by junctions, a hardening rate similar to discrete dislocation dynamics simulation results was obtained. Finally, the simulations show that dislocations exhibit some self-organized structures as the strain is increased.

36 MATERIALS SCIENCE↗

A fast directional algorithm for high-frequency electromagnetic scattering

This paper is concerned with the fast solution of high-frequency electromagnetic scattering problems using the boundary integral formulation. We extend the O(N log N) directional multilevel algorithm previously proposed for the acoustic scattering case to the vector electromagnetic case. We also detail how to incorporate the curl operator of the magnetic field integral equation into the algorithm. When combined with a standard iterative method, this results in an almost linear complexity solver for the combined field integral equations. In addition, the butterfly algorithm is utilized to compute the far field pattern and radar cross section with O(N log N) complexity.

97 MATHEMATICS AND COMPUTING↗

Analysis of error floor of LDPC codes under LP decoding over the BSC

We consider linear programming (LP) decoding of a fixed low-density parity-check (LDPC) code over the binary symmetric channel (BSC). The LP decoder fails when it outputs a pseudo-codeword which is not a codeword. We propose an efficient algorithm termed the instanton search algorithm (ISA) which, given a random input, generates a set of flips called the BSC-instanton and prove that: (a) the LP decoder fails for any set of flips with support vector including an instanton; (b) for any input, the algorithm outputs an instanton in the number of steps upper-bounded by twice the number of flips in the input. We obtain the number of unique instantons of different sizes by running the ISA sufficient number of times. We then use the instanton statistics to predict the performance of the LP decoding over the BSC in the error floor region. We also propose an efficient semi-analytical method to predict the performance of LP decoding over a large range of transition probabilities of the BSC.

97 MATHEMATICS AND COMPUTING↗

Discarding Information from Previous Iterations in an Optimal Way To Solve the Coupled Cluster Amplitude Equations

The direct inversion of the iterative subspace (DIIS) convergence acceleration algorithm is used in most electronic structure programs to solve the nonlinear coupled cluster amplitude equations. When the DIIS algorithm is used, the storage of previous trial vectors may become a bottleneck and the discarding of trial vectors may lead to a degradation of the convergence or even divergence. Here, we discuss an alternative way of storing information from trial vectors where only the last three trial vectors are needed to maintain the convergence of the full set of previous trial vectors, and which requires only minor modifications of an existing DIIS code

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗