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,495 records · Page 83

A portable MPI-based parallel vector template library

This paper discusses the design and implementation of a polymorphic collection library for distributed address-space parallel computers. The library provides a data-parallel programming model for C++ by providing three main components: a single generic collection class, generic algorithms over collections, and generic algebraic combining functions. Collection elements are the fourth component of a program written using the library and may be either of the built-in types of C or of user-defined types. Many ideas are borrowed from the Standard Template Library (STL) of C++, although a restricted programming model is proposed because of the distributed address-space memory model assumed. Whereas the STL provides standard collections and implementations of algorithms for uniprocessors, this paper advocates standardizing interfaces that may be customized for different parallel computers. Just as the STL attempts to increase programmer productivity through code reuse, a similar standard for parallel computers could provide programmers with a standard set of algorithms portable across many different architectures. The efficacy of this approach is verified by examining performance data collected from an initial implementation of the library running on an IBM SP-2 and an Intel Paragon.

Sheffler, Thomas J.↗

A Portable MPI-Based Parallel Vector Template Library

This paper discusses the design and implementation of a polymorphic collection library for distributed address-space parallel computers. The library provides a data-parallel programming model for C + + by providing three main components: a single generic collection class, generic algorithms over collections, and generic algebraic combining functions. Collection elements are the fourth component of a program written using the library and may be either of the built-in types of c or of user-defined types. Many ideas are borrowed from the Standard Template Library (STL) of C++, although a restricted programming model is proposed because of the distributed address-space memory model assumed. Whereas the STL provides standard collections and implementations of algorithms for uniprocessors, this paper advocates standardizing interfaces that may be customized for different parallel computers. Just as the STL attempts to increase programmer productivity through code reuse, a similar standard for parallel computers could provide programmers with a standard set of algorithms portable across many different architectures. The efficacy of this approach is verified by examining performance data collected from an initial implementation of the library running on an IBM SP-2 and an Intel Paragon.

Sheffler, Thomas J.↗

New Developments in Quaternion Estimation from Vector Observations

This paper contains a critical comparison of estimators minimizing Wahba's loss function. Some new results are presented for the QUaternion ESTimator (QUEST) and EStimators of the Optimal Quaternion (ESOQ and ESOQ2) to avoid the computational burden of sequential rotations in these algorithms. None of these methods is as robust in principle as Davenport's q method or the Singular Value Decomposition (SVD) method, which are significantly slower. Robustness is only an issue for measurements with widely differing accuracies, so the fastest estimators, the modified ESOQ and ESOQ2, are well suited to sensors that track multiple stars with comparable accuracies. More robust forms of ESOQ and ESOQ2 are developed that are intermediate in speed.

Markley, F. Landis↗

The Beam-Beam Counter: A Local Polarimeter at STAR

At the Brookhaven National Laboratory (BNL) Relativistic Heavy Ion Collider (RHIC) the Beam-Beam Counter (BBC) array for the Solenodial Tracker at RHIC (STAR) is a very versatile tool for polarized proton beam diagnostics. The BBC setup provides an excellent minimum bias trigger; and for hits on the inner annuli of six hexagonal scintillator tiles the BBC coincidence trigger with a suitable algorithm has a quite large single spin analyzing power {approx}8x10{sup -3} for 100 GeV polarized proton -100 GeV polarized proton collisions. The STAR BBC is a very effective local polarimeter at these energies. For 100 GeV p-vector -100 GeV p-vector running in 2006 the BBC measured single spin asymmetries to a statistical accuracy of better than 2% for a data run of 20-30 minutes; and these measurements were quite robust. For fills with a duration of at least six hours these STAR BBC asymmetry measurements were used to study the time dependence of the polarization for 100 GeV proton beams in the RHIC rings. The decrease of the polarization is quite small, <0.01P{sub B} per hour.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Dark fluxes from electromagnetic cascades

We study dark sector production in electromagnetic (EM) cascades. This problem requires accurate simulations of Standard Model (SM) and dark sector processes, both of which impact angular and energy distributions of emitted particles that ultimately determine flux predictions in a downstream detector. We describe the minimal set of QED processes which must be included to faithfully reproduce a SM cascade, and identify a universal algorithm to generate a dark sector flux given a Monte-Carlo simulation of a SM shower. We provide a new tool, "Image missing", which simulates EM cascades with associated dark vector production, and compare it against existing literature and “off the shelf” tools. The signal predictions at downstream detectors can strongly depend on the nontrivial interplay (and modelling) of SM and dark sector processes, in particular multiple Coulomb scattering and positron annihilation. We comment on potential impacts of these effects for realistic experimental setups.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

A phase transition for finding needles in nonlinear haystacks with LASSO artificial neural networks

To fit sparse linear associations, a LASSO sparsity inducing penalty with a single hyperparameter provably allows to recover the important features (needles) with high probability in certain regimes even if the sample size is smaller than the dimension of the input vector (haystack). More recently learners known as artificial neural networks (ANN) have shown great successes in many machine learning tasks, in particular fitting nonlinear associations. Small learning rate, stochastic gradient descent algorithm and large training set help to cope with the explosion in the number of parameters present in deep neural networks. Yet few ANN learners have been developed and studied to find needles in nonlinear haystacks. Driven by a single hyperparameter, our ANN learner, like for sparse linear associations, exhibits a phase transition in the probability of retrieving the needles, which we do not observe with other ANN learners. To select our penalty parameter, we generalize the universal threshold of Donoho and Johnstone (Biometrika 81(3):425–455, 1994) which is a better rule than the conservative (too many false detections) and expensive cross-validation. In the spirit of simulated annealing, we propose a warm-start sparsity inducing algorithm to solve the high-dimensional, non-convex and non-differentiable optimization problem. We perform simulated and real data Monte Carlo experiments to quantify the effectiveness of our approach.

97 MATHEMATICS AND COMPUTING↗

Parallel hybrid quantum-classical machine learning for kernelized time-series classification

Supervised time-series classification garners widespread interest because of its applicability throughout a broad application domain including finance, astronomy, biosensors, and many others. Here, in this work, we tackle this problem with hybrid quantum-classical machine learning, deducing pairwise temporal relationships between time-series instances using a timeseries Hamiltonian kernel (TSHK). A TSHK is constructed with a sum of inner products generated by quantum states evolved using a parameterized time evolution operator. This sum is then optimally weighted using techniques derived from multiple kernel learning. Because we treat the kernel weighting step as a differentiable convex optimization problem, our method can be regarded as an end-to-end learnable hybrid quantum-classical-convex neural network, or QCC-net, whose output is a data set-generalized kernel function suitable for use in any kernelized machine learning technique such as the support vector machine (SVM). Using our TSHK as input to a SVM, we classify univariate and multivariate time-series using quantum circuit simulators and demonstrate the efficient parallel deployment of the algorithm to 127-qubit superconducting quantum processors using quantum multi-programming.

97 MATHEMATICS AND COMPUTING↗

Machine learning and deep learning for mineralogy interpretation and CO 2 saturation estimation in geological carbon Storage: A case study in the Illinois Basin

Carbon capture and storage (CCS) is a promising approach to simultaneously maintaining energy security and reducing carbon dioxide (CO 2 ) emissions under the current energy portfolio that is dominated by fossil fuel energy. Pre-injection formation characterization and post-injection CO 2 monitoring are two critical tasks to guarantee storage efficiency in CCS. The CCS projects in the Illinois Basin, the first large-scale CO 2 injection into saline aquifers in the United States, employed conventional and the latest pulsed neutron logging (PNL) tools for mineralogy interpretation and CO 2 saturation estimation, which provide valuable references for future CCS projects. Because of the inherent fuzziness of petrophysical measurements and complex subsurface heterogeneity, interpreting well-logging data is time-consuming, and its accuracy can be user-biased. In recent years, data-driven methods have been widely used to capture the non-linear patterns between input features and interpretation results. This work applied and evaluated four commonly used machine learning (ML) models, including ridge regression (RR), random forest (RF), gradient boosting regression (GBR), support vector regression (SVR), and one deep learning (DL) model, the artificial neural network (ANN). We optimized the hyperparameters of the four ML models and the DL model using the simulated annealing algorithm and the grid search strategy, respectively. The input features of the mineralogy interpretation models were eleven conventional well-logging parameters, and the label data (i.e., ground truth) were the porosity and volumetric fractions of six minerals, including quartz, feldspar, dolomite, calcite, clay, and iron minerals. The results demonstrated that the GBR and RF models were superior in predicting volumetric fractions of minerals and porosity; label data with low coefficient of variation (CV) values tended to yield better performance. For CO 2 saturation estimation, the RF was the best-performing model, followed by SVR, ANN, GBR, and RR. Furthermore, we conducted feature importance ranking using the permutation importance algorithm and found that the formation sigma and well pressure were the most important features in this study. In conclusion, the study of CCS projects in the Illinois Basin bridges the gap between the limited knowledge and understanding of geological carbon storage and the increasing demand for reliable, cost-effective, and sustainable energy solutions.

58 GEOSCIENCES↗

BigNeuron: a resource to benchmark and predict performance of algorithms for automated tracing of neurons in light microscopy datasets

BigNeuron is an open community bench-testing platform with the goal of setting open standards for accurate and fast automatic neuron tracing. We gathered a diverse set of image volumes across several species that is representative of the data obtained in many neuroscience laboratories interested in neuron tracing. Here, we report generated gold standard manual annotations for a subset of the available imaging datasets and quantified tracing quality for 35 automatic tracing algorithms. The goal of generating such a hand-curated diverse dataset is to advance the development of tracing algorithms and enable generalizable benchmarking. Together with image quality features, we pooled the data in an interactive web application that enables users and developers to perform principal component analysis, t-distributed stochastic neighbor embedding, correlation and clustering, visualization of imaging and tracing data, and benchmarking of automatic tracing algorithms in user-defined data subsets. The image quality metrics explain most of the variance in the data, followed by neuromorphological features related to neuron size. Furthermore, we observed that diverse algorithms can provide complementary information to obtain accurate results and developed a method to iteratively combine methods and generate consensus reconstructions. The consensus trees obtained provide estimates of the neuron structure ground truth that typically outperform single algorithms in noisy datasets. However, specific algorithms may outperform the consensus tree strategy in specific imaging conditions. Finally, to aid users in predicting the most accurate automatic tracing results without manual annotations for comparison, we used support vector machine regression to predict reconstruction quality given an image volume and a set of automatic tracings.

97 MATHEMATICS AND COMPUTING↗

Assaying Used Nuclear Fuel Assemblies Using Lead Slowing-Down Spectroscopy and Singular Value Decomposition

This study investigates the use of a Lead Slowing-Down Spectrometer (LSDS) for the direct and independent measurement of fissile isotopes in light-water nuclear reactor fuel assemblies. The current study applies MCNPX, a Monte Carlo radiation transport code, to simulate the measurement of the assay of the used nuclear fuel assemblies in the LSDS. An empirical model has been developed based on the calibration of the LSDS to responses generated from the simulated assay of six well-characterized fuel assemblies. The effects of self-shielding are taken into account by using empirical basis vectors calculated from the singular value decomposition (SVD) of a matrix containing the self-shielding functions from the assay of assemblies in the calibration set. The performance of the empirical algorithm was tested on version 1 of the Next-Generation Safeguards Initiative (NGSI) used fuel library consisting of 64 assemblies, as well as a set of 27 diversion assemblies, both of which were developed by Los Alamos National Laboratory. The potential for direct and independent assay of the sum of the masses of Pu-239 and Pu-241 to within 2%, on average, has been demonstrated.

11 NUCLEAR FUEL CYCLE AND FUEL MATERIALS↗

Evaluation of interpolation methods for surface-based motion compensated tomographic reconstruction for cardiac angiographic C-arm data

Purpose: For interventional cardiac procedures, anatomical and functional information about the cardiac chambers is of major interest. With the technology of angiographic C-arm systems it is possible to reconstruct intraprocedural three-dimensional (3D) images from 2D rotational angiographic projection data (C-arm CT). However, 3D reconstruction of a dynamic object is a fundamental problem in C-arm CT reconstruction. The 2D projections are acquired over a scan time of several seconds, thus the projection data show different states of the heart. A standard FDK reconstruction algorithm would use all acquired data for a filtered backprojection and result in a motion-blurred image. In this approach, a motion compensated reconstruction algorithm requiring knowledge of the 3D heart motion is used. The motion is estimated from a previously presented 3D dynamic surface model. This dynamic surface model results in a sparse motion vector field (MVF) defined at control points. In order to perform a motion compensated reconstruction, a dense motion vector field is required. The dense MVF is generated by interpolation of the sparse MVF. Therefore, the influence of different motion interpolation methods on the reconstructed image quality is evaluated. Methods: Four different interpolation methods, thin-plate splines (TPS), Shepard's method, a smoothed weighting function, and a simple averaging, were evaluated. The reconstruction quality was measured on phantom data, a porcine model as well as on in vivo clinical data sets. As a quality index, the 2D overlap of the forward projected motion compensated reconstructed ventricle and the segmented 2D ventricle blood pool was quantitatively measured with the Dice similarity coefficient and the mean deviation between extracted ventricle contours. For the phantom data set, the normalized root mean square error (nRMSE) and the universal quality index (UQI) were also evaluated in 3D image space. Results: The quantitative evaluation of all experiments showed that TPS interpolation provided the best results. The quantitative results in the phantom experiments showed comparable nRMSE of Almost-Equal-To 0.047 {+-} 0.004 for the TPS and Shepard's method. Only slightly inferior results for the smoothed weighting function and the linear approach were achieved. The UQI resulted in a value of Almost-Equal-To 99% for all four interpolation methods. On clinical human data sets, the best results were clearly obtained with the TPS interpolation. The mean contour deviation between the TPS reconstruction and the standard FDK reconstruction improved in the three human cases by 1.52, 1.34, and 1.55 mm. The Dice coefficient showed less sensitivity with respect to variations in the ventricle boundary. Conclusions: In this work, the influence of different motion interpolation methods on left ventricle motion compensated tomographic reconstructions was investigated. The best quantitative reconstruction results of a phantom, a porcine, and human clinical data sets were achieved with the TPS approach. In general, the framework of motion estimation using a surface model and motion interpolation to a dense MVF provides the ability for tomographic reconstruction using a motion compensation technique.

60 APPLIED LIFE SCIENCES↗

The optimization of complex systems with respect to multiple criteria.

A difficult aspect of system optimization is the choice of a single cost function relating system parameters to the quality of the design; there are generally conflicting criteria by which the system can be evaluated. This paper discusses the problem of optimization with respect to multiple criteria, i.e., with a vector-valued cost function, without prespecifying constraints or the weighting of the criteria. The paper discusses theoretical results concerning the set of non-inferior solutions so generated and a computational algorithm for obtaining a characteristic set of non-inferior solutions.

Beeson, R. M.↗

Theory for magnetotelluric observations on the surface of a layered anisotropic half space

The conductivities for the magnetotelluric model described are taken to be constant vertically in each of a large number of horizontal layers. The conductivities and the associated magnetic, electric, and current vector fields are considered to be laterally homogeneous within a vertical cylinder centered about the observation site. The electromagnetic fields are, therefore, only functions of the vertical coordinate. A relatively simple algorithm is presented for calculation of the magnetotelluric complex impedance tensor.

Loewenthal, D.↗

Near-nucleus studies of Comet Halley

The near-nucleus dust coma structure of Comet Halley are studied using modern digital image processing techniques on photographs taken in 1910. Recent investigations carried out in conjunction with the Near-Nucleus Studies Net of the IHW to better understand the characteristics and behavior of Comet Halley are reviewed. A new image processing algorithm developed to enhance coma feature boundaries permits their evolution over as many as three days to be followed. The features can be modeled to derive information on the nucleus spin vector, particle sizes, ejection velocities and distribution of emission areas on the nucleus. Useful contributions by observers in the Astrometry Net are also discussed.

Larson, S.↗

Structural dynamics analysis using an unsymmetric block Lanczos algorithm

A method for reducing the order of a dynamical model of a large structure with arbitrary damping is developed analytically and demonstrated. A Lanczos algorithm is described which can reduce square unsymmetric system matrices to block-tridiagonal form, and a procedure for defining the reduced-order model from the right and left Lanczos vectors is outlined. Results for sample problems involving the 8-DOF FEM model of a beam-rotor assembly subjected to random and stepped external forces are presented in extensive graphs and briefly characterized.

Craig, Roy R., Jr.↗

Solution of the incompressible Navier-Stokes equations using artificial compressibility methods

A modified artificial compressibility formulation is derived from a preconditioned low Mach number compressible formulation, and these two methods are compared on a two-dimensional laminar leading edge flow using a LBI/ADI solution algorithm. The two methods are essentially equivalent with appropriate preconditioning parameters and have the same convergence rates and efficiency, giving 4 orders of residual reduction in about 75 iterations with a vectorized CRAY-XMP run time of 20 seconds for 3000 grid points.

Briley, W. R.↗

Effective Numerical Methods for Solving Elliptical Problems in Strengthened Sobolev Spaces

Fourth-order elliptic boundary value problems in the plane can be reduced to operator equations in Hilbert spaces G that are certain subspaces of the Sobolev space W(sub 2)(exp 2)(Omega) is identical with G(sup (2)). Appearance of asymptotically optimal algorithms for Stokes type problems made it natural to focus on an approach that considers rot w is identical with (D(sub 2)w - D(sub 1)w) is identical with vector of u as a new unknown vector-function, which automatically satisfies the condition div vector of u = 0. In this work, we show that this approach can also be developed for an important class of problems from the theory of plates and shells with stiffeners. The main mathematical problem was to show that the well-known inf-sup condition (normal solvability of the divergence operator) holds for special Hilbert spaces. This result is also essential for certain hydrodynamics problems.

D'yakonov, Eugene G.↗

NEXT Single String Integration Tests in Support of the Double Asteroid Redirection Test Mission

A system integration test has been performed utilizing a prototype model NEXT ion thruster, an engineering model power processing unit, and a laboratory model command and data handling system. The objectives of the test were to: a) verify that the integrated system meets performance requirements, b) demonstrate that the integrated system is functional across the anticipated thermal, power processor, and Xe propellant ranges for the DART mission, and to c) evaluate fault detection and operation of the command and data handling system. Measurements made during this test included: thruster performance, PPU input voltages, PPU electrical and thermal telemetry, software states, and fault flags. Additionally, a far-field electrostatic probe diagnostic was used to infer relative changes in the thrust vector across the various propellant flow splits. This manuscript presents the results of these tests, which include integrated ion propulsion system demonstrations of performance, details on the execution of DART flight algorithms, and software fault handling.

Thomas, Robert E.↗