Search NASA⌕ Search

SEARCH · Search NASA

Results for “Software algorithms”

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,567 records · Page 87

Accelerating Lattice QCD Multigrid on GPUs Using Fine-Grained Parallelization

The past decade has witnessed a dramatic acceleration of lattice quantum chromodynamics calculations in nuclear and particle physics. This has been due to both significant progress in accelerating the iterative linear solvers using multi-grid algorithms, and due to the throughput improvements brought by GPUs. Deploying hierarchical algorithms optimally on GPUs is non-trivial owing to the lack of parallelism on the coarse grids, and as such, these advances have not proved multiplicative. Using the QUDA library, we demonstrate that by exposing all sources of parallelism that the underlying stencil problem possesses, and through appropriate mapping of this parallelism to the GPU architecture, we can achieve high efficiency even for the coarsest of grids. Results are presented for the Wilson-Clover discretization, where we demonstrate up to 10x speedup over present state-of-the-art GPU-accelerated methods on Titan. Finally, we look to the future, and consider the software implications of our findings.

Clark, M. A.↗

Molecular radiotherapy: The NUKFIT software for calculating the time-integrated activity coefficient

Purpose: Calculation of the time-integrated activity coefficient (residence time) is a crucial step in dosimetry for molecular radiotherapy. However, available software is deficient in that it is either not tailored for the use in molecular radiotherapy and/or does not include all required estimation methods. The aim of this work was therefore the development and programming of an algorithm which allows for an objective and reproducible determination of the time-integrated activity coefficient and its standard error.Methods: The algorithm includes the selection of a set of fitting functions from predefined sums of exponentials and the choice of an error model for the used data. To estimate the values of the adjustable parameters an objective function, depending on the data, the parameters of the error model, the fitting function and (if required and available) Bayesian information, is minimized. To increase reproducibility and user-friendliness the starting values are automatically determined using a combination of curve stripping and random search. Visual inspection, the coefficient of determination, the standard error of the fitted parameters, and the correlation matrix are provided to evaluate the quality of the fit. The functions which are most supported by the data are determined using the corrected Akaike information criterion. The time-integrated activity coefficient is estimated by analytically integrating the fitted functions. Its standard error is determined assuming Gaussian error propagation. The software was implemented using MATLAB.Results: To validate the proper implementation of the objective function and the fit functions, the results of NUKFIT and SAAM numerical, a commercially available software tool, were compared. The automatic search for starting values was successfully tested for reproducibility. The quality criteria applied in conjunction with the Akaike information criterion allowed the selection of suitable functions. Function fit parameters and their standard error estimated by using SAAM numerical and NUKFIT showed differences of <1%. The differences for the time-integrated activity coefficients were also <1% (standard error between 0.4% and 3%). In general, the application of the software is user-friendly and the results are mathematically correct and reproducible. An application of NUKFIT is presented for three different clinical examples.Conclusions: The software tool with its underlying methodology can be employed to objectively and reproducibly estimate the time integrated activity coefficient and its standard error for most time activity data in molecular radiotherapy.

61 RADIATION PROTECTION AND DOSIMETRY↗

Automatic Layout Design for Power Module

The layout of power modules is one of the most important elements in power module design, especially for high power densities, where couplings are increased. In this paper, an automatic design process using a genetic algorithm is presented. Some practical considerations are introduced in the optimization of the layout design of the module. This paper presents a process for automatic layout design for high power density modules. Detailed GA implementations are introduced both for outer loop and inner loop. As verified by a design example, the results of the automatic design process presented here are better than those from manual design and also better than the results from a popular design software. This automatic design procedure could be a major step toward improving the overall performance of future layout design.

99 GENERAL AND MISCELLANEOUS↗

LibraryX: A Framework for Cross-Library-Call Optimization

Scientific applications utilize performance libraries as a software engineering concept: these libraries encapsulate important and well-understood (mathematical) operations, allow for reuse, and are implemented and tuned by experts. Domain scientists then implement complex algorithms based on these domainspecific libraries. While individual library calls are optimized, larger performance gains across sequences of calls—sometimes spanning multiple libraries—are often unrealized, forcing a trade-off between performance and implementation complexity.To overcome this issue, we propose LibraryX, an approach and a system that allows for cross-library-call optimization even when library calls stem from multiple performance libraries. LibraryX annotates library calls with semantic information and optimizes entire directed acyclic graphs (DAGs) of calls dynamically using the SPIRAL code generation system. We demonstrate its effectiveness across a range of memory bound workloads, achieving significant speedups on Nvidia, AMD, and Intel accelerators compared to code using native libraries without cross-call optimization.

Rao, Sanil [Carnegie Mellon University,Department ↗

SU-E-T-96: An Analysis of VMAT SBRT Lung Treatment Plans

Purpose: To present an analysis of 218 lung sbrt treatment plans delivered using Varian Eclipse RapidArc software and delivered with Varian linear accelerators. Methods: A retrospective analysis of treatment plans generated using the Varian Eclipse PRO RapidArc VMAT optimization and AAA photon beam calculation algorithms was done for 218 plans delivered using Varian Trilogy and TrueBeam linear accelerators. Some of the patients were enrolled in the RTOG 0813 and RTOG 0915 lung protocols. All of the patients’ plans were optimized using the guidelines outlined by these protocols. The plans presented were normalized so that 95% of the PTV volume received 100% of the prescribed dose. Results: The dose co formality constraints from the RTOG protocols and the number of plans within those constraints were:Tumor dose between 60% of maximum dose and 90% of maximum: 218/218 = 100%.Volume of 105% tumor dose outside put less than 15% of the PTV volume: 218/218 = 100%.Maximum dose 2 cm away from PTV within protocol table guidelines: No minor deviation: 188/218 = 86.2%. No major deviation: 216/218 = 99.1%.Ratio of 50% dose volume to PTV volume less than R50 in protocol table: No minor deviation 148/218 = 67.9%. No major deviation: 213/218 = 97.7%.Percent of lung receiving 20 Gy less than 10% (no minor violation): 218/218 = 100%.99% of PTV receiving at least 90% of the tumor dose: 214/218 = 98.2%. Conclusion: Varian RapidArc VMAT can successfully deliver lung SBRT treatments as outlined in the RTOG 0813 and 0915 protocols. The largest deviations were seen in the R50 constraints for the larger PTV volumes.

60 APPLIED LIFE SCIENCES↗

Comparison of unfolding methods using RooFitUnfold

In this study we describe RooFitUnfold, an extension of the RooFit statistical software package to treat unfolding problems, and which includes most of the unfolding methods that commonly used in particle physics. The package provides a common interface to these algorithms as well as common uniform methods to evaluate their performance in terms of bias, variance and coverage. In this paper we exploit this common interface of RooFitUnfold to compare the performance of unfolding with the Richardson–Lucy, Iterative Dynamically Stabilized, Tikhonov, Gaussian Process, bin-by-bin and inversion methods on several example problems.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Towards Architecture and OS-Independent Malware Detection via Memory Forensics

In this work, we take a fundamentally different approach to the problem of analyzing a device for compromises via malware; our approach is OS and instruction architecture independent and relies only on having the raw binary data extracted from the memory dump of a device. Our system leverages a multi-hundred TB dataset of both compromised host memory dumps extracted from the MalRec dataset [8] and the first known dataset of benign host memory dumps running normal, non-compromised software. After an average of 30 to 45 seconds of pre-processing on a single memory dump, our system leverages both traditional machine learning and deep learning algorithms to achieve an average of 98% accuracy of detecting a compromised host.

Petrik, Rachel L.↗

GeoTess v. 2.6.8

GeoTess facilitates access to a multi-level triangular tessellation of a unit sphere, including find the index of the triangle in which an arbitrary position on the sphere resides and computing the interpolation coefficients that should be applied to data stored on the nodes of the tessellation that defines the triangle. It is very common for Earth scientists to store values of various Earth properties on a grid that spans the globe. For convenience, they almost always choose a grid which is evenly spaced in both latitude and longitude over the surface of the globe. While these grids are evenly spaced in latitude-longitude coordinates, they are in reality very unevenly spaced when cell size is evaluated in square km since lines of longitude converge at the poles. Tessellations consisting of a set of approximately equal area triangles that span the globe are much more efficient way to impose a grid onto the surface of a sphere. The GeoTess software facilitates interacting with a triangular tessellation of a sphere and could significantly increase the efficiency of Earth science software codes. The code can construct variable resolution triangular tessellations. It can also load a previously constructed tessellation from an input file and implements a "walking triangle" search algorithm to find the index of the triangle on the tessellation that contains a user specified point of interest. It also computes the interpolation coefficients that should be applied to data stored on the nodes of the containing triangle

Ballard, Sanford↗

QuanSimBench

QuanSimBench is a software program that performs a gate-by-gate simulation of a quantum computer with a full state vector formulation. It simulates a simplified version of Shor's algorithm with increasing number of qubits until resources are exhausted. The score (states/s) is how fast the Approximate Quantum Fourier Transform can be computed (the modular exponentiation is not timed). The goal is to quantify the ability of a computer to simulate ideal quantum circuits.

Pakin, Scott↗

DiscoFluxM version 1.x

DiscoFluxM is software for modeling the deformation behavior of crystalline materials within the third-party finite-element based software, MOOSE. The software enables full-field crystal plasticity finite element simulations of deformation processes of metals and other crystalline materials. DiscoFluxM is an implementation of the DiscoFlux theoretical and algorithmic framework for coupling single-crystal plasticity with dislocation transport. The continuum mesoscale modeling framework is founded upon a nonlocal dislocation-density based crystal plasticity theory. The nonlocal theory couples continuum dislocation transport with an otherwise spatially-local single-crystal model employing nonlinear thermoelasticity and crystallographic plasticity. Dislocation transport is modeled by enforcing dislocation conservation at a slip-system level through the solution of advection-diffusion equations. The configuration of geometrically necessary dislocation density gives rise to a back-stress that inhibits or accentuates the flow of dislocations.

Luscher, Darby↗

Software For Automated Leak Detection Using Infrared Camera

This code can read in videos or images in either a batch or real-time format. Videos are broken up into frames, and the frames are processed using an optical flow algorithm to decipher movement between adjacent frames. This adherent movement is ran through a convolutional neural network that automatically classifies the contents of the video. Additional content inside the code aids with noisy images and removal of nuisance movement.

Walker, CodyM. [Idaho National Laboratory (INL), I↗

Homotopy Solver

This software implements parallel versions of an interior-point solver, based on the publicly available ipopt solver. Here we have full control over the linear solver and our algorithm is fully parallel thus enabling scalability to large-scale optimization problems. This package also has a parallel implementation of a homotopy solver developed under the scalable methods for contact LDRD project 23-ERD-017. This solver is an mfem-based implementation of algorithm described in ``A filter trust-region Newton continuation method for nonlinear complementarity problems''. Cosmin G. Petra, Nai-Yuan Chiang, Jingyi Wang, Tucker Hartland, and Michael Puso (submitted), LLNL-JRNL-869761.

Hartland, Tucker [Lawrence Livermore National Labo↗

Optimal Ground Source Heat Pump System Design

Despite the facts that GSHPs first gained popularity as early as the 1940’s and they can achieve 30 to 60 percent in energy savings and carbon emission reductions relative to conventional HVAC systems, the use of geothermal energy in the U.S. has been less than 1 percent of the total energy consumption. The key barriers preventing this technically-mature technology from reaching its full commercial potential have been its high installation cost and limited consumer knowledge and trust in GSHP systems to deliver the technology in a cost-effective manner in the market place. Led by ENVIRON, with support from University Hartford and University of Vermont, the team developed and tested a software-based a decision making tool (‘OptGSHP’) for the least-cost design of ground-source heat pump (‘GSHP’) systems. OptGSHP combines state of the art optimization algorithms with GSHP-specific HVAC and groundwater flow and heat transport simulation. The particular strength of OptGSHP is in integrating heat transport due to groundwater flow into the design, which most of the GSHP designs do not get credit for and therefore are overdesigned.

42 ENGINEERING↗

Scientific Discovery with Physics-Informed System Identification (Abbreviated Report)

My fellowship research focused on making physics-based simulations faster and more useful through machine learning. Many problems in science and engineering are governed by partial differential equations, but high-fidelity simulations are often too expensive to run repeatedly. I worked on improving Latent Space Dynamics Identification (LaSDI), a reduced-order modeling framework that compresses large simulation data sets into a smaller representation and then learns how that representation evolves over time. The motivation was to develop reduced models that remain accurate for more challenging systems, especially when predictions must remain reliable over long time intervals or when the underlying dynamics are more complicated than standard methods can easily handle. I also contributed to related work on Quandary, a high-performance software effort for simulation and control of open quantum systems, before focusing primarily on Latent Space Dynamics Identification methods. The main outcomes of the fellowship were two new algorithms (both of which were published), Rollout-LaSDI and Higher-Order LaSDI, together with supporting work on multi-stage Latent Space Dynamics Identification. Rollout-LaSDI improved long-term prediction by training the model to stay accurate over extended time horizons, and Higher-Order LaSDI broadened the method so it could model systems with higher-order time dynamics. My contributions to multistage Latent Space Dynamics Identification also helped show that its later training stages could be simplified without losing effectiveness, and that this behavior held across different model architectures and training strategies. Taken together, these advances improved the accuracy, flexibility, and practical value of reduced-order modeling tools for computational science.

97 MATHEMATICS AND COMPUTING↗

Automated segmentation and analysis of point clouds of pier foundations using Pier Inspection and Evaluation Report (PIER)

Pier foundations are commonly used in locations with unstable soil or where other types of foundations are unsuitable or cost prohibitive. A pier foundation consists of vertical columns to support the structure and elevate it above the ground. Common materials for pier foundations include masonry, concrete, timber, and steel. The methods for accurate placement of pier foundations have remained relatively unchanged for decades. For simple installations, construction chalk lines are used to layout the locations of piers to ensure accurate placement and elevation. For more complex installations, surveying instruments operated by trained professionals are employed to accurately locate piers and assess correct elevation before construction. After installation, another survey may need to be performed to assess the quality of the as-built foundation. However, with the advent of terrestrial laser scanners (TLS), the means now exist for contractors to conduct their own assessments of as-built foundations. The major barrier preventing contractors from performing their own assessments of as-built foundation quality is the segmentation and analysis of point cloud data, a skill that often requires a trained user. The objective of this research is to develop a software tool (PIER: Pier Inspection and Evaluation Report) to enable automated segmentation and analysis of point clouds of pier foundations. In this paper, the automated segmentation and analysis algorithms are detailed. A mockup lay out of pier foundations was built using concrete masonry units, and the algorithms were tested to evaluate performance. Limitations of the current algorithms and future research direction are discussed.

Turki, Amine [ORNL]↗

Viskores: Integrating Parallel Scientific Visualization Research into Applications

Viskores is a scientific visualization library that is the primary deployment of such algorithms to the parallel accelerated processors of modern DOE supercomputers. In this paper, we review the capabilities provided by Viskores and how these capabilities are leveraged by other software in the high-performance computing ecosystem. We discuss the Viskores data representation and pay particular attention to array management. Through this array management we describe how data is adapted between Viskores and other software along with strategies for converting dynamic, polymorphic objects to static representations better suited to GPU processing. We conclude with several examples of Viskores integrating with high-performance software that is used in production today.

Moreland, Ken [ORNL] (ORCID:0000000270513288)↗

GeoTess v. 2.0

GeoTess facilitates access to a multi-level triangular tessellation of a unit sphere, including find the index of the triangle in which an arbitrary position on the sphere resides and computing the interpolation coefficients that should be applied to data stored on the nodes of the tessellation that defines the triangle. It is very common for Earth scientists to store values of various Earth properties on a grid that spans the globe. For convenience, they almost always choose a grid which is evenly spaced in both latitude and longitude over the surface of the globe. While these grids are evenly spaced in latitude-longitude coordinates, they are in reality very unevenly spaced when cell size is evaluated in square km since lines of longitude converge at the poles. Tessellations consisting of a set of approximately equal area triangles that span the globe are much more efficient way to impose a grid onto the surface of a sphere. The GeoTess software facilitates interacting with a triangular tessellation of a sphere and could significantly increase the efficiency of Earth science software codes. The code can construct variable resolution triangular tessellations. It can also load a previously constructed tessellation from an input file and implements a "walking triangle" search algorithm to find the index of the triangle on the tessellation that contains a user specified point of interest. It also computes the interpolation coefficients that should be applied to data stored on the nodes of the containing triangle

Source record↗

Convolutional Neural Networks for the CHIPS Neutrino Detector R&D Project.

The CHerenkov detectors In mine PitS (Chips) neutrino detector R&D project aims to develop novel strategies and technologies for very large yet ‘cheap as chips’ water Cherenkov neutrino detectors. Via deployment in a body of water, use of commercially available components, and instrumentation coverage optimisation for the study of exclusively accelerator beam neutrinos, Chips will enable megaton scale detectors to become a reality at the cost of $200k-$300k per kt of sensitive mass. During the summer of 2019 a prototype Chips detector, Chips-5, was deployed into the Wentworth 2W disused mine pit in northern Minnesota, 7 mrad off the NuMI beam axis. A novel data acquisition system was introduced using cheap single-board computers and open-source software. This work presents a novel approach to water Cherenkov neutrino detector event reconstruction and classification. Three forms of a Convolutional Neural Network, a type of deep learning algorithm, have been trained to reject cosmic muon events, classify beam events, and estimate neutrino energies, all using only the raw detector event as input. When evaluated on the expected distribution of Chips-5 events, this new approach is shown to be robust and explainable as well as providing a significant performance increase over the standard likelihood-based reconstruction and simple neural network classification. Promisingly, the performance presented here is comparable to the more complex (and expensive) neutrino oscillation experiments within the field.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗