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 577 records · Page 32

A three-dimensional head-and-neck phantom for validation of multimodality deformable image registration for adaptive radiotherapy

Purpose: To develop a three-dimensional (3D) deformable head-and-neck (H and N) phantom with realistic tissue contrast for both kilovoltage (kV) and megavoltage (MV) imaging modalities and use it to objectively evaluate deformable image registration (DIR) algorithms. Methods: The phantom represents H and N patient anatomy. It is constructed from thermoplastic, which becomes pliable in boiling water, and hardened epoxy resin. Using a system of additives, the Hounsfield unit (HU) values of these materials were tuned to mimic anatomy for both kV and MV imaging. The phantom opens along a sagittal midsection to reveal radiotransparent markers, which were used to characterize the phantom deformation. The deformed and undeformed phantoms were scanned with kV and MV imaging modalities. Additionally, a calibration curve was created to change the HUs of the MV scans to be similar to kV HUs, (MC). The extracted ground-truth deformation was then compared to the results of two commercially available DIR algorithms, from Velocity Medical Solutions and MIM software. Results: The phantom produced a 3D deformation, representing neck flexion, with a magnitude of up to 8 mm and was able to represent tissue HUs for both kV and MV imaging modalities. The two tested deformation algorithms yielded vastly different results. For kV–kV registration, MIM produced mean and maximum errors of 1.8 and 11.5 mm, respectively. These same numbers for Velocity were 2.4 and 7.1 mm, respectively. For MV–MV, kV–MV, and kV–MC Velocity produced similar mean and maximum error values. MIM, however, produced gross errors for all three of these scenarios, with maximum errors ranging from 33.4 to 41.6 mm. Conclusions: The application of DIR across different imaging modalities is particularly difficult, due to differences in tissue HUs and the presence of imaging artifacts. For this reason, DIR algorithms must be validated specifically for this purpose. The developed H and N phantom is an effective tool for this purpose.

62 RADIOLOGY AND NUCLEAR MEDICINE↗

Multichannel Analysis of Surface Waves Accelerated (MASWAccelerated): Software for efficient surface wave inversion using MPI and GPUs

Multichannel Analysis of Surface Waves (MASW) is a technique frequently used in geotechnical engineering and engineering geophysics to infer 1D layered models of seismic shear wave velocities in the top tens to hundreds of meters of the subsurface. We aim to accelerate MASW calculations by capitalizing on modern computer hardware available in the workstations of most engineers: multiple cores and graphics processing units (GPUs). We propose new parallel and GPU accelerated algorithms for computing 1D MASW inversion, and provide software implementations in C using Message Passing Interface (MPI) and CUDA. These algorithms take advantage of sparsity that arises in the problem, and the work balance between processes considers typical data trends. We compare our methods to an existing open source Matlab MASW tool. Our serial C implementation achieves a 2x speedup over the Matlab software, and we continue to see improvements by parallelizing the problem with MPI. Here we see nearly perfect strong and weak scaling for uniform data, and improve strong scaling for realistic data by repartitioning the problem to process mapping. By utilizing GPUs available on most modern workstations, we observe an additional 1.3x speedup over the serial C implementation on the first use of the method. We typically repeatedly evaluate theoretical dispersion curves as part of an optimization procedure, and on the GPU the kernel can be cached for faster reuse on later runs. We observe a 3.2x speedup on the cached GPU runs compared to the serial C runs. This work is the first open-source parallel or GPU-accelerated software tool for MASW imaging, and should enable geotechnical engineers to fully utilize all computer hardware at their disposal.

58 GEOSCIENCES↗

RECOVERY ACT: DYNAMIC ENERGY CONSUMPTION MANAGEMENT OF ROUTING TELECOM AND DATA CENTERS THROUGH REAL-TIME OPTIMAL CONTROL (RTOC): Final Scientific/Technical Report

This final scientific report documents the Industrial Technology Program (ITP) Stage 2 Concept Development effort on Data Center Energy Reduction and Management Through Real-Time Optimal Control (RTOC). Society is becoming increasingly dependent on information technology systems, driving exponential growth in demand for data center processing and an insatiable appetite for energy. David Raths noted, 'A 50,000-square-foot data center uses approximately 4 megawatts of power, or the equivalent of 57 barrels of oil a day1.' The problem has become so severe that in some cases, users are giving up raw performance for a better balance between performance and energy efficiency. Historically, power systems for data centers were crudely sized to meet maximum demand. Since many servers operate at 60%-90% of maximum power while only utilizing an average of 5% to 15% of their capability, there are huge inefficiencies in the consumption and delivery of power in these data centers. The goal of the 'Recovery Act: Decreasing Data Center Energy Use through Network and Infrastructure Control' is to develop a state of the art approach for autonomously and intelligently reducing and managing data center power through real-time optimal control. Advances in microelectronics and software are enabling the opportunity to realize significant data center power savings through the implementation of autonomous power management control algorithms. The first step to realizing these savings was addressed in this study through the successful creation of a flexible and scalable mathematical model (equation) for data center behavior and the formulation of an acceptable low technical risk market introduction strategy leveraging commercial hardware and software familiar to the data center market. Follow-on Stage 3 Concept Development efforts include predictive modeling and simulation of algorithm performance, prototype demonstrations with representative data center equipment to verify requisite performance and continued commercial partnering agreement formation to ensure uninterrupted development, and deployment of the real-time optimal control algorithm. As a software implementable technique for reducing power consumption, the RTOC has two very desirable traits supporting rapid prototyping and ultimately widespread dissemination. First, very little capital is required for implementation. No major infrastructure modifications are required and there is no need to purchase expensive capital equipment. Second, the RTOC can be rolled out incrementally. Therefore, the effectiveness can be proven without a large scale initial roll out. Through the use of the Impact Projections Model provided by the DOE, monetary savings in excess of $100M in 2020 and billions by 2040 are predicted. In terms of energy savings, the model predicts a primary energy displacement of 260 trillion BTUs (33 trillion kWh), or a 50% reduction in server power consumption. The model also predicts a corresponding reduction of pollutants such as SO2 and NOx in excess of 100,000 metric tonnes assuming the RTOC is fully deployed. While additional development and prototyping is required to validate these predictions, the relative low cost and ease of implementation compared to large capital projects makes it an ideal candidate for further investigation.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Hybrid Optimization Parallel Search PACKage

HOPSPACK is open source software for solving optimization problems without derivatives. Application problems may have a fully nonlinear objective function, bound constraints, and linear and nonlinear constraints. Problem variables may be continuous, integer-valued, or a mixture of both. The software provides a framework that supports any derivative-free type of solver algorithm. Through the framework, solvers request parallel function evaluation, which may use MPI (multiple machines) or multithreading (multiple processors/cores on one machine). The framework provides a Cache and Pending Cache of saved evaluations that reduces execution time and facilitates restarts. Solvers can dynamically create other algorithms to solve subproblems, a useful technique for handling multiple start points and integer-valued variables. HOPSPACK ships with the Generating Set Search (GSS) algorithm, developed at Sandia as part of the APPSPACK open source software project.

Kolda, Tamara↗

Hybrid Optimization Parallel Search PACKage

HOPSPACK is open source software for solving optimization problems without derivatives. Application problems may have a fully nonlinear objective function, bound constraints, and linear and nonlinear constraints. Problem variables may be continuous, integer-valued, or a mixture of both. The software provides a framework that supports any derivative-free type of solver algorithm. Through the framework, solvers request parallel function evaluation, which may use MPI (multiple machines) or multithreading (multiple processors/cores on one machine). The framework provides a Cache and Pending Cache of saved evaluations that reduces execution time and facilitates restarts. Solvers can dynamically create other algorithms to solve subproblems, a useful technique for handling multiple start points and integer-valued variables. HOPSPACK ships with the Generating Set Search (GSS) algorithm, developed at Sandia as part of the APPSPACK open source software project.

Source record↗

EAGLE: 'EAGLE'Is an' Algorithmic Graph Library for Exploration

The Resource Description Framework (RDF) and SPARQL Protocol and RDF Query Language (SPARQL) were introduced about a decade ago to enable flexible schema-free data interchange on the Semantic Web. Today data scientists use the framework as a scalable graph representation for integrating, querying, exploring and analyzing data sets hosted at different sources. With increasing adoption, the need for graph mining capabilities for the Semantic Web has emerged. Today there is no tools to conduct "graph mining" on RDF standard data sets. We address that need through implementation of popular iterative Graph Mining algorithms (Triangle count, Connected component analysis, degree distribution, diversity degree, PageRank, etc.). We implement these algorithms as SPARQL queries, wrapped within Python scripts and call our software tool as EAGLE. In RDF style, EAGLE stands for "EAGLE 'Is an' algorithmic graph library for exploration. EAGLE is like 'MATLAB' for 'Linked Data.'

Source record↗

Topness, Version 1

The code would be used in analyses of data from the LHC, to improve the sensitivity of their experiments to new exotic particles. The software minimizes a certain function, as defined in the above reference, for some input provided by the user. The output to the user is the global minimum of that function. The code finds the global minimum using the Nelder-Mead algorithm. All the codes for the minimization including the Nelder-Mead algorithm, is written by the author. The software is written in c++.

Graesser, MichaelL.↗

Topness, Version 1

The code would be used in analyses of data from the LHC, to improve the sensitivity of their experiments to new exotic particles. The software minimizes a certain function, as defined in the above reference, for some input provided by the user. The output to the user is the global minimum of that function. The code finds the global minimum using the Nelder-Mead algorithm. All the codes for the minimization including the Nelder-Mead algorithm, is written by the author. The software is written in c++.

Graesser, Michael L.↗

The MolSSI QCArchive project: An open-source platform to compute, organize, and share quantum chemistry data

The Molecular Sciences Software Institute's (MolSSI) Quantum Chemistry Archive (QCArchive) project is an umbrella name that covers both a central server hosted by MolSSI for community data and the Python-based software infrastructure that powers automated computation and storage of quantum chemistry (QC) results. The MolSSI-hosted central server provides the computational molecular sciences community a location to freely access tens of millions of QC computations for machine learning, methodology assessment, force-field fitting, and more through a Python interface. Facile, user-friendly mining of the centrally archived quantum chemical data also can be achieved through web applications found at the website. The software infrastructure can be used as a standalone platform to compute, structure, and distribute hundreds of millions of QC computations for individuals or groups of researchers at any scale. The QCArchiveInfrastructure is open-source (BSD-3C), code repositories can be found at github, and releases can be downloaded via PyPI and Conda. This article is categorized under: Electronic Structure Theory > Ab Initio Electronic Structure Methods Software > Quantum Chemistry Data Science > Computer Algorithms and Programming

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Optimization of the Coupled Cluster Implementation in NWChem on Petascale Parallel Architectures

Coupled cluster singles and doubles (CCSD) algorithm has been optimized in NWChem software package. This modification alleviated the communication bottleneck and provided from 2- to 5-fold speedup in the CCSD iteration time depending on the problem size and available memory. Sustained 0.60 petaflop/sec performance on CCSD(T) calculation has been obtained on NCSA Blue Waters. This number included all stages of the calculation from initialization till termination, iterative computation of single and double excitations, and perturbative accounting for triple excitations. In the section of perturbative triples alone, the computation maintained 1.18 petaflop/sec performance level. CCSD computations have been performed on Guanine-Cytosine deoxydinucleotide monophosphate (GC-dDMP) to probe the conformational energy difference in DNA single strand in A- and B-conformations. The computation revealed significant discrepancy between CCSD and classical force fields in prediction of relative energy of A- and B-conformations of GC-dDMP.

calculations↗

Muon background studies for shallow depth Double - Chooz near detector

Muon events are one of the main concerns regarding background in neutrino experiments. The placement of experimental set-ups in deep underground facilities reduce considerably their impact on the research of the expected signals. But in the cases where the detector is installed on surface or at shallow depth, muon flux remains high, being necessary their precise identification for further rejection. Total flux, mean energy or angular distributions are some of the parameters that can help to characterize the muons. Empirically, the muon rate can be measured in an experiment by a number of methods. Nevertheless, the capability to determine the muons angular distribution strongly depends on the detector features, while the measurement of the muon energy is quite difficult. Also considering that on-site measurements can not be extrapolated to other sites due to the difference on the overburden and its profile, it is necessary to find an adequate solution to perform the muon characterization. The method described in this work to obtain the main features of the muons reaching the experimental set-up, is based on the muon transport simulation by the MUSIC software, combined with a dedicated sampling algorithm for shallow depth installations based on a modified Gaisser parametrization. This method provides all the required information about the muons for any shallow depth installation if the corresponding overburden profile is implemented. In this work, the method has been applied for the recently commissioned Double - Chooz near detector, which will allow the cross-check between the simulation and the experimental data, as it has been done for the far detector.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

Genetic algorithm-based geometry calibration for dynamic compression x-ray diffraction experiments

An important component of dynamic compression x-ray diffraction (XRD) experiment analysis is geometry calibration: proper data interpretation requires knowledge of the precise detector position and orientation and, if the experiment involves a single-crystal sample, knowledge of the lattice orientation. The determination of these parameters in the arbitrary three-dimensional (3D) scattering geometries often present in dynamic compression facilities is challenging, as the associated optimization problem can be highly nonlinear, nonsmooth, and discontinuous. We present a genetic algorithm-based approach for performing dynamic compression XRD calibrations that overcomes these obstacles. We provide details regarding the image processing, algorithm implementation, and open-source software deployment and demonstrate the capability of the approach to calibrate the detector and crystal parameters in 3D geometries. Notably, we demonstrate the solver’s capacity to find the crystal orientation without a priori rotation constraints.

Brown, Nathan P. [Sandia National Laboratories (SN↗

Plasma boundary shape control and real-time equilibrium reconstruction on NSTX-U

Here, the upgrade to the National Spherical Torus eXperiment (NSTX-U) included two main improvements: a larger center-stack, enabling higher toroidal field and longer pulse duration, and the addition of three new tangentially aimed neutral beam sources, which increase available heating and current drive, and allow for flexibility in shaping power, torque, current, and particle deposition profiles. To best use these new capabilities and meet the high-performance operational goals of NSTX-U, major upgrades to the NSTX-U control system (NCS) hardware and software have been made. Several control algorithms, including those used for real-time equilibrium reconstruction and shape control, have been upgraded to improve and extend plasma control capabilities. As part of the commissioning phase of first plasma operations, the shape control system was tuned to control the boundary in both inner-wall limited and diverted discharges. It has been used to accurately track the requested evolution of the boundary (including the size of the inner gap between the plasma and central solenoid, which is a challenge for the ST configuration), X-point locations, and strike point locations, enabling repeatable discharge evolutions for scenario development and diagnostic commissioning.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Shifting Left for Machine Learning: An Empirical Study of Security Weaknesses in Supervised Learning-based Projects

Context: Supervised learning-based projects (SLPs), i.e., software projects that use supervised learning algorithms, such as decision trees are useful for performing classification-related tasks. Yet, security weaknesses, such as the use of hard-coded passwords in SLPs, can make SLPs susceptible to security attacks. A characterization of security weaknesses in SLPs can help practitioners understand the security weaknesses that are frequent in SLPs and adopt adequate mitigation strategies. Objective: The goal of this paper is to help practitioners se-curely develop supervised learning-based projects by conducting an empirical study of security weaknesses in supervised learning-based projects. Methodology: We conduct an empirical study by quantifying the frequency of security weaknesses in 278 open source SLPs. Results: We identify 22 types of security weaknesses that occur in SLPs. We observe ‘use of potentially dangerous function’ to be the most frequently occurring security weakness in SLPs. Of the identified 3,964 security weaknesses, 23.79 % and 40.49 % respectively, appear for source code files used to train and test models. We also observe evidence of co-location, e.g., instances of command injection co-locates with instances of potentially dangerous function. Conclusion: Based on our findings, we advocate for a shift left approach for SLP development with security-focused code reviews, and application of security static analysis.

Bhuiyan, Farzana Ahamed↗

Verifying Deep Reductions in the Nuclear Arsenals: Development and Demonstration of a Motion-detection Subsystem for a “Buddy Tag” Using Non-export Controlled Accelerometers

Future nuclear arms-control agreements may place numerical limits on items that are difficult to monitor with national technical means, even when complemented with onsite inspections. Such items could include small objects and mobile assets, such as non-deployed nuclear warheads and mobile missile launchers. Typically, this verification task can be addressed with unique identifiers, but standard tagging techniques may be unacceptable in this case due to host concerns about safety and intrusiveness. First proposed in the late 1980s and partially developed by Sandia National Laboratories in the early 1990s, the “Proximity Tag” or “Buddy Tag” concept seeks to overcome these concerns by separating the tag from the treaty accountable item itself. A buddy tag has two key elements: a tamper-indicating enclosure and a motion-detection system designed to detect illicit movements in a stand-down period. As part of this project, we have built a buddy-tag prototype for demonstration and evaluation purposes. This paper reviews the design choices and functionalities of the tag’s motion-detection subsystem.We pursue a modular approach for the tag’s hardware, built around an Arduino-class microcontroller and a non-export-controlled low-noise accelerometer, and use open-source algorithms for the motion-detection software. Finally, we discuss the results of an extensive experimental campaign involving both indoor and outdoor measurements assessing the performance of the tag under real-world environmental conditions.

98 NUCLEAR DISARMAMENT, SAFEGUARDS, AND PHYSICAL P↗

A Large-Scale Analysis to Optimize the Control and V2V Communication Protocols for CDA Agreement-Seeking Cooperation

Cooperative driving automation (CDA) Class C, agreement-seeking cooperation, is an innovative and practical solution that can promote cooperation among general passenger vehicles on the road. However, more comprehensive studies are needed before establishing the standard protocols of agreement-seeking cooperation, such as communication frequency and the duration of cooperation. Here, this article presents an initiative study on the impacts of communication capabilities on agreement-seeking cooperation. Through a large-scale analysis by regulating vehicle-to-vehicle (V2V) communication metrics, this work suggests desirable system parameters that can maximize the benefits of cooperation and ensure reliable operability while avoiding exhaustive communication loads. As the first step, an example agreement-seeking cooperation system is created for a car-following scenario, including decision-making and control algorithms for autonomous vehicles. Then, software-in-the-loop tests explore the performance of the developed system as it encounters various communication risks, such as latency and message packet drops. The system performance metrics are evaluated from various angles, including the time consumed for the agreement-seeking process, cooperation ratio, and the ratio of faulty cooperation. Energy saving from the cooperation is assessed by using simulation software that can run multiple high-fidelity vehicle models simultaneously. Based on the analyses, this article suggests the V2V communication requirements for the reliable operation of CDA agreement-seeking, which can be referred to when developing the standard protocols of agreement-seeking cooperation.

42 ENGINEERING↗

An Introduction to Goodness of Fit for PMU Parameter Estimation

New results of measurements of phasor-like signals are presented based on our previous work on the topic. In this document an improved estimation method is described. The algorithm (which is realized in MATLAB software) is discussed. We examine the effect of noisy and distorted signals on the Goodness of Fit metric. The estimation method is shown to be performing very well with clean data and with a measurement window as short as a half a cycle and as few as 5 samples per cycle. The Goodness of Fit decreases predictably with added phase noise, and seems to be acceptable even with visible distortion in the signal. While the exact results we obtain are specific to our method of estimation, the Goodness of Fit method could be implemented in any phasor measurement unit.

97 MATHEMATICS AND COMPUTING↗

Toward Polydisperse Flows With MFIX-EXA

In the presence of large size disparities, single-grid neighbor search algorithms lead to inflated neighbor lists that significantly degrade the performance of Lagrangian particle solvers. If Eulerian–Lagrangian (EL) frameworks are to remain performant when simulating realistic systems, improved neighbor detection approaches must be adopted. To this end, we consider the application of a multigrid neighbor search (MGNS) algorithm in the mfix-exa software package, an exascale EL solver built upon the AMReX library. Here, details regarding the implementation and verification of MGNS are provided along with speedup curves for a bidisperse mixing layer. MGNS is shown to yield up to 15$\times$ speedup on CPU and 6$\times$ speedup on GPU for the problems considered here. The mfix-exa software is then validated for a variety of polydisperse flows. Finally, a brief discussion is given for how dynamic MGNS may be completed, with application to spatially varying particle size distributions.

42 ENGINEERING↗