Search NASA⌕ Search

SEARCH · Search NASA

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 217 records · Page 12

TU-B-19A-01: Image Registration II: TG132-Quality Assurance for Image Registration

AAPM Task Group 132 was charged with a review of the current approaches and solutions for image registration in radiotherapy and to provide recommendations for quality assurance and quality control of these clinical processes. As the results of image registration are always used as the input of another process for planning or delivery, it is important for the user to understand and document the uncertainty associate with the algorithm in general and the Result of a specific registration. The recommendations of this task group, which at the time of abstract submission are currently being reviewed by the AAPM, include the following components. The user should understand the basic image registration techniques and methods of visualizing image fusion. The disclosure of basic components of the image registration by commercial vendors is critical in this respect. The physicists should perform end-to-end tests of imaging, registration, and planning/treatment systems if image registration is performed on a stand-alone system. A comprehensive commissioning process should be performed and documented by the physicist prior to clinical use of the system. As documentation is important to the safe implementation of this process, a request and report system should be integrated into the clinical workflow. Finally, a patient specific QA practice should be established for efficient evaluation of image registration results. The implementation of these recommendations will be described and illustrated during this educational session. Learning Objectives: Highlight the importance of understanding the image registration techniques used in their clinic. Describe the end-to-end tests needed for stand-alone registration systems. Illustrate a comprehensive commissioning program using both phantom data and clinical images. Describe a request and report system to ensure communication and documentation. Demonstrate an clinically-efficient patient QA practice for efficient evaluation of image registration.

60 APPLIED LIFE SCIENCES↗

Improving SGP4 Orbit Determination with New State Estimation Algorithm

The Simplified General Perturbations 4 Model (SGP4) is a well-known tool for performing satellite orbit determination. However, uncertainties and inaccuracies in the initial state inputs (required by SGP4) degrade the performance of the propagator. We present a new state estimation algorithm that allows for independent computation of these initial inputs using Unscented Kalman Filtering and GPS data from a satellite. The algorithm is tested on real flight data and demonstrates a notable performance improvement over the standard method of orbit determination using SGP4.

97 MATHEMATICS AND COMPUTING↗

The compressed state Kalman filter for nonlinear state estimation: Application to large-scale reservoir monitoring

Reservoir monitoring aims to provide snapshots of reservoir conditions and their uncertainties to assist operation management and risk analysis. These snapshots may contain millions of state variables, e.g., pressures and saturations, which can be estimated by assimilating data in real time using the Kalman filter (KF). However, the KF has a computational cost that scales quadratically with the number of unknowns, m, due to the cost of computing and storing the covariance and Jacobian matrices, along with their prod-ucts. The compressed state Kalman filter (CSKF) adapts the KF for solving large-scale monitoring problems. The CSKF uses N preselected orthogonal bases to compute an accurate rank-N approximation of the covari-ance that is close to the optimal spectral approximation given by SVD. The CSKF has a computational cost that scales linearly in m and uses an efficient matrix-free approach that propagates uncertainties using N + 1 forward model evaluations, where N << m. Here in this paper we present a generalized CSKF algorithm for nonlin-ear state estimation problems such as CO 2 monitoring. For simultaneous estimation of multiple types of state variables, the algorithm allows selecting bases that represent the variability of each state type. Through synthetic numerical experiments of CO 2 monitoring, we show that the CSKF can reproduce the Kal-man gain accurately even for large compression ratios (m/N). For a given computational cost, the CSKF uses a robust and flexible compression scheme that gives more reliable uncertainty estimates than the ensemble Kalman filter, which may display loss of ensemble variability leading to suboptimal uncertainty estimates.

97 MATHEMATICS AND COMPUTING↗

Jet-images — deep learning edition

Building on the notion of a particle physics detector as a camera and the collimated streams of high energy particles, or jets, it measures as an image, we investigate the potential of machine learning techniques based on deep learning architectures to identify highly boosted W bosons. Modern deep learning algorithms trained on jet images can out-perform standard physically-motivated feature driven approaches to jet tagging. We develop techniques for visualizing how these features are learned by the network and what additional information is used to improve performance. Finally, this interplay between physically-motivated feature driven tools and supervised learning algorithms is general and can be used to significantly increase the sensitivity to discover new particles and new forces, and gain a deeper understanding of the physics within jets.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Applied Quantum Physics for Novel Quantum Computation Approaches: an Update

Quantum information processing is a critical part of the development of future computers, quantum computers, and quantum algorithms, where elementary particles such as photons and electrons can be applied in optomagnetic or optoelectronic devices. The computational physics behind these emerging approaches is also experiencing dramatic developments. In this paper I report on the most recent mathematical basics for quantum algorithms and quantum computing approaches. Some of these described approaches show intriguing methods for determining the states and wavefunction properties for anyons, bosons, and fermions in quantum wells that have been developed in the last years. The study also shows approaches based on N-quantum states and the reduced 1- and 2-fermion picture, which can be used for developing models for anyons and multi-fermionic states in quantum algorithms. Also, antisymmetry and generalized Pauli constraints have been given particular emphasis and include establishing a basis for pinning and quasipinning for exploring the symmetric states of many-fermionic subsets, as a foundation for quantum information processing, and are here briefly revisited. This study summarizes the developments in recent years of an advanced and important field for future computational techniques.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Quantum-assisted associative adversarial network: applying quantum annealing in deep learning

Abstract Generative models have the capacity to model and generate new examples from a dataset and have an increasingly diverse set of applications driven by commercial and academic interest. In this work, we present an algorithm for learning a latent variable generative model via generative adversarial learning where the canonical uniform noise input is replaced by samples from a graphical model. This graphical model is learned by a Boltzmann machine which learns low-dimensional feature representation of data extracted by the discriminator. A quantum processor can be used to sample from the model to train the Boltzmann machine. This novel hybrid quantum-classical algorithm joins a growing family of algorithms that use a quantum processor sampling subroutine in deep learning, and provides a scalable framework to test the advantages of quantum-assisted learning. For the latent space model, fully connected, symmetric bipartite and Chimera graph topologies are compared on a reduced stochastically binarized MNIST dataset, for both classical and quantum sampling methods. The quantum-assisted associative adversarial network successfully learns a generative model of the MNIST dataset for all topologies. Evaluated using the Fréchet inception distance and inception score, the quantum and classical versions of the algorithm are found to have equivalent performance for learning an implicit generative model of the MNIST dataset. Classical sampling is used to demonstrate the algorithm on the LSUN bedrooms dataset, indicating scalability to larger and color datasets. Though the quantum processor used here is a quantum annealer, the algorithm is general enough such that any quantum processor, such as gate model quantum computers, may be substituted as a sampler.

Wilson, Max (ORCID:0000000207983391)↗

Improved cache performance in Monte Carlo transport calculations using energy banding

We present an energy banding algorithm for Monte Carlo (MC) neutral particle transport simulations which depend on large cross section lookup tables. In MC codes, read-only cross section data tables are accessed frequently, exhibit poor locality, and are typically too much large to fit in fast memory. Thus, performance is often limited by long latencies to RAM, or by off-node communication latencies when the data footprint is very large and must be decomposed on a distributed memory machine. The proposed energy banding algorithm allows maximal temporal reuse of data in band sizes that can flexibly accommodate different architectural features. The energy banding algorithm is general and has a number of benefits compared to the traditional approach. In the present analysis we explore its potential to achieve improvements in time-to-solution on modern cache-based architectures.

97 MATHEMATICS AND COMPUTING↗

An analytical particle mover for the charge- and energy-conserving, nonlinearly implicit, electrostatic particle-in-cell algorithm

We propose a 1D analytical particle mover for the recent charge- and energy-conserving electrostatic particle-in-cell (PIC) algorithm in Ref. [G. Chen, L. Chacón, D.C. Barnes, An energy- and charge-conserving, implicit, electrostatic particle-in-cell algorithm, Journal of Computational Physics 230 (2011) 7018–7036]. The approach computes particle orbits exactly for a given piece-wise linear electric field. The resulting PIC algorithm maintains the exact charge and energy conservation properties of the original algorithm, but with improved performance (both in efficiency and robustness against the number of particles and timestep). We demonstrate the advantageous properties of the scheme with a challenging multiscale numerical test case, the ion acoustic wave. Using the analytical mover as a reference, we demonstrate that the choice of error estimator in the Crank–Nicolson mover has significant impact on the overall performance of the implicit PIC algorithm. The generalization of the approach to the multi-dimensional case is outlined, based on a novel and simple charge conserving interpolation scheme.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Advanced Polymer Characterization: Modular Operations for Spectral Alignment by Iterative Compression (MOSAIC)

Matrix-assisted laser desorption/ionization (MALDI) mass spectrometry encodes structural information across diverse homo- and copolymer ensembles, yet decrypting these spectra requires a systematic analytical approach. We introduce Modular Operations for Spectral Alignment by Iterative Compression (MOSAIC)─a general cipher algorithm that applies modular arithmetic to filter monomer-derived mass contributions and cluster MALDI peaks by nonconstitutional repeating units (non-CRUs). MOSAIC performs sequential modular operations using monomer mass differences as base units to compress complex spectral data, revealing end-group distributions and comonomer incorporation. As a demonstration, we applied MOSAIC to five copolymers formed by two different polymerization mechanisms. Furthermore, the resulting remainder–mass plots clearly resolve polymer homologs with distinct non-CRUs into visually apparent clusters, enabling intuitive assignment of mass spectral features.

Wang, Hanlin M. [University of Illinois at Urbana−↗

Complex three-dimensional conformal surfaces formed by atomic layer deposition: computation and experimental verification

Atomic layer deposition in complex three-dimensional porous materials is useful for manipulating properties such as pore size, pore connectivity, density, and dielectric constant. In order to calculate a material's properties it is necessary to determine the material distribution. Here, a generally applicable algorithm for determining the material distribution and pore connectivity is presented. Calculations using the algorithm compared favorably with experimental results for the important case of infilling dielectric material into three-dimensional photonic crystal templates.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Machine learning for design principles for single atom catalysts towards electrochemical reactions

Machine learning (ML) integrated density functional theory (DFT) calculations have recently been used to accelerate the design and discovery of heterogeneous catalysts such as single atom catalysts (SACs) through the establishment of deep structure–activity relationships. Here, this review provides recent progress in the ML-aided rational design of heterogeneous catalysts with the focus on SACs in terms of structure–activity relationships, feature importance analysis, high-throughput screening, stability, and metal–support interactions for electrochemistry. Support vector machine (SVM), random forest regression (RFR), and deep neural networks (DNN) along with atomic properties are mainly used for the design of SACs. The ML results have shown that the number of electrons in the d orbital, oxide formation enthalpy, ionization energy, Bader charge, d-band center, and enthalpy of vaporization are mainly the most important parameters for the defining of the structure–activity relationships for electrochemistry. However, the black-box nature of ML techniques occasionally makes a physical interpretation of descriptors, such as the Bader charge, d-band center, and enthalpy of vaporization, non-trivial. At the current stage, ML application is limited by the lack of a large and high-quality database. Future prospects for the development of a large database and a generalized ML algorithm for SAC design are discussed to give insights for further studies in this field.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Spectral sensor error analysis for measuring x-ray radiation drive using the DANTE diagnostic toward inertial confinement fusion experiments

DANTE is a diagnostic used to measure the x-radiation drive produced by heating a high-Z cavity (“hohlraum”) with high-powered laser beams. It records the spectrally and temporally resolved radiation flux at x-ray energies between 50 eV and 20 keV. Each sensor configuration on DANTE is composed of filters, mirrors, and x-ray diodes to define 18 different x-ray channels whose output is voltage as a function of time. The absolute flux is then determined from the photometric calibration of the sensor configuration and a spectral reconstructing algorithm. The reconstruction of the spectra vs time from the measured voltages and known response of each channel has presented challenges. Here we demonstrate a novel approach here for quantifying the error on the determined flux based on the channel sensor configuration and most commonly used reconstruction algorithm. In general, we find that the integrated spectral flux from a hohlraum can robustly be reconstructed (within ~14%) using a traditional unfold approach with as few as ten channels due to the underlying assumption of a largely Planckian spectral intensity distribution.

47 OTHER INSTRUMENTATION↗

Degenerate coupled-cluster theory

A size-extensive, converging, black-box, ab initio coupled-cluster (ΔCC) ansatz is introduced that computes the energies and wave functions of states from any degenerate or nondegenerate Slater-determinant references with any numbers of α- and β-spin electrons, any patterns of orbital occupancy, any spin multiplicities, and any spatial symmetries. For a nondegenerate reference, it reduces to the single-reference coupled-cluster ansatz. For a degenerate multireference, it is a natural coupled-cluster extension of degenerate Møller–Plesset perturbation (ΔMP) theory. For ionized and electron-attached references, it is a coupled-cluster Green’s function, although the present theory is convergent toward the full-configuration-interaction limits, while the Feynman–Dyson many-body Green’s function (MBGF) theory generally is not. Its single-excitation instance is a projection Hartree–Fock theory as per the Thouless theorem, which may be useful for core ionizations, high-spin states, and possibly electron affinities. Additionally, a new multireference coupled-cluster theory for a general model space is developed. This quasidegenerate coupled-cluster (QCC) theory is exactly converging, but not black-box, and intended for strong correlation. Determinant-based, general-order algorithms of ΔCC and QCC theories are implemented and compared with configuration-interaction (CI) and equation-of-motion coupled-cluster (EOM-CC) theories through octuple excitations and with ΔMP and MBGF theories up to the nineteenth order. An algebraic, optimal-scaling algorithm of the ΔCC theory is computer-synthesized at the levels of single excitations (ΔCCS) and of single and double excitations (ΔCCSD). As a result, the order of performance is QCC ≈ ΔCC > EOM-CC > CI at the same order or QCC ≈ ΔCC > ΔMP > MBGF at the same cost scaling.

Hirata, So [University of Illinois at Urbana-Champ↗

ANALYSIS OF RADIAL VELOCITY DATA BY A NOVEL ADAPTIVE APPROACH

In this paper, we introduce an estimation technique for analyzing radial velocity data commonly encountered in extrasolar planet detection. We discuss the Keplerian model for radial velocity data measurements and introduce a technique named the iterative adaptive approach (IAA) to estimate the three-dimensional spectrum (power versus eccentricity, orbital period and periastron passage time) of the radial velocity data. We then discuss different ways to regularize the IAA algorithm in the presence of noise and measurement errors. We also discuss briefly the computational aspects of the method and introduce a computationally efficient version of IAA. Finally, we establish the significance of the spectral peaks by using a relaxation maximum likelihood algorithm and a generalized likelihood ratio test. Numerical experiments are carried out on both simulated and real life data sets to evaluate the performance of our method. The real life data sets discussed are radial velocity measurements of the stars HD 63454, HD 208487, and GJ 876.

79 ASTRONOMY AND ASTROPHYSICS↗

Beyond Limber: efficient computation of angular power spectra for galaxy clustering and weak lensing

Angular two-point statistics of large-scale structure observables are important cosmological probes. To reach the high accuracy required by the statistical precision of future surveys, some of these statistics may need to be computed without the commonly employed Limber approximation; the exact computation however requires integration over Bessel functions, and a brute-force evaluation is slow to converge. Here, we present a new method based on our generalized FFTLog algorithm for the efficient computation of angular power spectra beyond the Limber approximation. The new method significantly simplifies the calculation and improves the numerical speed and stability. It is easily extended to handle integrals involving derivatives of Bessel functions, making it equally applicable to numerically more challenging cases such as contributions from redshift-space distortions and Doppler effects. We implement our method for galaxy clustering and galaxy-galaxy lensing power spectra. We find that using the Limber approximation for galaxy clustering in future analyses like LSST Year 1 and DES Year 6 may cause significant biases in cosmological parameters, indicating that going beyond the Limber approximation is necessary for these analyses.

weak gravitational lensing↗

Recent advances in stellarator optimization

Computational optimization has revolutionized the field of stellarator design. To date, optimizations have focused primarily on optimization of neoclassical confinement and ideal MHD stability, although limited optimization of other parameters has also been performed. Here, we outline a select set of new concepts for stellarator optimization that, when taken as a group, present a significant step forward in the stellarator concept. One of the criticisms that has been leveled at existing methods of design is the complexity of the resultant field coils. Recently, a new coil optimization code—COILOPT++, which uses a spline instead of a Fourier representation of the coils,—was written and included in the STELLOPT suite of codes. The advantage of this method is that it allows the addition of real space constraints on the locations of the coils. The code has been tested by generating coil designs for optimized quasi-axisymmetric stellarator plasma configurations of different aspect ratios. As an initial exercise, a constraint that the windings be vertical was placed on large major radius half of the non-planar coils. Further constraints were also imposed that guaranteed that sector blanket modules could be removed from between the coils, enabling a sector maintenance scheme. Results of this exercise will be presented. New ideas on methods for the optimization of turbulent transport have garnered much attention since these methods have led to design concepts that are calculated to have reduced turbulent heat loss. We have explored possibilities for generating an experimental database to test whether the reduction in transport that is predicted is consistent with experimental observations. Thus, a series of equilibria that can be made in the now latent QUASAR experiment have been identified that will test the predicted transport scalings. Fast particle confinement studies aimed at developing a generalized optimization algorithm are also discussed. A new algorithm developed for the design of the scraper element on W7-X is presented along with ideas for automating the optimization approach.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

The DESI One-Percent Survey: exploring a generalized SHAM for multiple tracers with the UNIT simulation

We perform SubHalo Abundance Matching (SHAM) studies on UNIT simulations with {σ, V ceil , v smear }-SHAM and {σ, V ceil , $f$ sat }-SHAM. They are designed to reproduce the clustering on 5–30 h -1 Mpc of luminous red galaxies (LRGs), emission-line galaxies (ELGs), and quasi-stellar objects (QSOs) at 0.4 < z < 3.5 from DESI (Dark Energy Spectroscopic Instrument) One Percent Survey. V ceil is the incompleteness of the massive host (sub)haloes and is the key to the generalized SHAM. v smear models the clustering effect of redshift uncertainties, providing measurements consistent with those from repeat observations. A free satellite fraction $f$ sat is necessary to reproduce the clustering of ELGs. We find ELGs present a more complex galaxy–halo mass relation than LRGs reflected in their weak constraints on σ. LRGs, QSOs, and ELGs show increasing V ceil values, corresponding to the massive galaxy incompleteness of LRGs, the quenched star formation of ELGs and the quenched black hole accretion of QSOs. For LRGs, a Gaussian v smear presents a better profile for subsamples at redshift bins than a Lorentzian profile used for other tracers. The impact of the statistical redshift uncertainty on ELG clustering is negligible. The best-fitting satellite fraction for DESI ELGs is around 4 per cent, lower than previous estimations for ELGs. The mean halo mass log 10 ($\langle$M vir $\rangle$) in h -1 M ⊙ for LRGs, ELGs, and QSOs are 13.16 ± 0.01, 11.90 ± 0.06, and 12.66 ± 0.45, respectively. Our generalized SHAM algorithms facilitate the production of multitracer galaxy mocks for cosmological tests.

79 ASTRONOMY AND ASTROPHYSICS↗

The weirdest SDSS galaxies: results from an outlier detection algorithm

How can we discover objects we did not know existed within the large data sets that now abound in astronomy? In this paper, we present an outlier detection algorithm that we developed, based on an unsupervised Random Forest. We test the algorithm on more than two million galaxy spectra from the Sloan Digital Sky Survey and examine the 400 galaxies with the highest outlier score. We find objects which have extreme emission line ratios and abnormally strong absorption lines, objects with unusual continua, including extremely reddened galaxies. We find galaxy–galaxy gravitational lenses, double-peaked emission line galaxies and close galaxy pairs. We find galaxies with high ionization lines, galaxies that host supernovae and galaxies with unusual gas kinematics. Only a fraction of the outliers we find were reported by previous studies that used specific and tailored algorithms to find a single class of unusual objects. Our algorithm is general and detects all of these classes, and many more, regardless of what makes them peculiar. Lastly, it can be executed on imaging, time series and other spectroscopic data, operates well with thousands of features, is not sensitive to missing values and is easily parallelizable.

79 ASTRONOMY AND ASTROPHYSICS↗