Search NASA⌕ Search

SEARCH · Search NASA

Results for “parallel methods”

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 739 records · Page 41
All sourcesNASA NTRSDOE OSTI
DOE OSTI2017

Vehicle track segmentation using higher order random fields

Here, we present an approach to segment vehicle tracks in coherent change detection images, a product of combining two synthetic aperture radar images taken at different times. The approach uses multiscale higher order random field models to capture track statistics, such as curvatures and their parallel nature, that are not currently utilized in existing methods. These statistics are encoded as 3-by-3 patterns at different scales. The model can complete disconnected tracks often caused by sensor noise and various environmental effects. Coupling the model with a simple classifier, our approach is effective at segmenting salient tracks. We improve the F-measure on a standard vehicle track data set to 0.963, up from 0.897 obtained by the current state-of-the-art method.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2016

Spatial and rotational quality assurance of 6DOF patient tracking systems

Purpose: External tracking systems used for patient positioning and motion monitoring during radiotherapy are now capable of detecting both translations and rotations. In this work, the authors develop a novel technique to evaluate the 6 degree of freedom 6(DOF) (translations and rotations) performance of external motion tracking systems. The authors apply this methodology to an infrared marker tracking system and two 3D optical surface mapping systems in a common tumor 6DOF workspace. Methods: An in-house designed and built 6DOF parallel kinematics robotic motion phantom was used to perform motions with sub-millimeter and subdegree accuracy in a 6DOF workspace. An infrared marker tracking system was first used to validate a calibration algorithm which associates the motion phantom coordinate frame to the camera frame. The 6DOF positions of the mobile robotic system in this space were then tracked and recorded independently by an optical surface tracking system after a cranial phantom was rigidly fixed to the moveable platform of the robotic stage. The calibration methodology was first employed, followed by a comprehensive 6DOF trajectory evaluation, which spanned a full range of positions and orientations in a 20 × 20 × 16 mm and 5° × 5° × 5° workspace. The intended input motions were compared to the calibrated 6DOF measured points. Results: The technique found the accuracy of the infrared (IR) marker tracking system to have maximal root-mean square error (RMSE) values of 0.18, 0.25, 0.07 mm, 0.05°, 0.05°, and 0.09° in left–right (LR), superior–inferior (SI), anterior–posterior (AP), pitch, roll, and yaw, respectively, comparing the intended 6DOF position and the measured position by the IR camera. Similarly, the 6DOF RSME discrepancy for the HD optical surface tracker yielded maximal values of 0.46, 0.60, 0.54 mm, 0.06°, 0.11°, and 0.08° in LR, SI, AP, pitch, roll, and yaw, respectively, over the same 6DOF evaluative workspace. An earlier generation 3D optical surface tracking unit was observed to have worse tracking capabilities than both the IR camera unit and the newer 3D surface tracking system with maximal RMSE of 0.69, 0.74, 0.47 mm, 0.28°, 0.19°, and 0.18°, in LR, SI, AP, pitch, roll, and yaw, respectively, in the same 6DOF evaluation space. Conclusions: The proposed technique was found to be effective at evaluating the performance of 6DOF patient tracking systems. All observed optical tracking systems were found to exhibit tracking capabilities at the sub-millimeter and subdegree level within a 6DOF workspace.

60 APPLIED LIFE SCIENCES↗
DOE OSTI2016

TH-AB-202-11: Spatial and Rotational Quality Assurance of 6DOF Patient Tracking Systems

Purpose: External tracking systems used for patient positioning and motion monitoring during radiotherapy are now capable of detecting both translations and rotations (6DOF). In this work, we develop a novel technique to evaluate the 6DOF performance of external motion tracking systems. We apply this methodology to an infrared (IR) marker tracking system and two 3D optical surface mapping systems in a common tumor 6DOF workspace. Methods: An in-house designed and built 6DOF parallel kinematics robotic motion phantom was used to follow input trajectories with sub-millimeter and sub-degree accuracy. The 6DOF positions of the robotic system were then tracked and recorded independently by three optical camera systems. A calibration methodology which associates the motion phantom and camera coordinate frames was first employed, followed by a comprehensive 6DOF trajectory evaluation, which spanned a full range of positions and orientations in a 20×20×16 mm and 5×5×5 degree workspace. The intended input motions were compared to the calibrated 6DOF measured points. Results: The technique found the accuracy of the IR marker tracking system to have maximal root mean square error (RMSE) values of 0.25 mm translationally and 0.09 degrees rotationally, in any one axis, comparing intended 6DOF positions to positions measured by the IR camera. The 6DOF RSME discrepancy for the first 3D optical surface tracking unit yielded maximal values of 0.60 mm and 0.11 degrees over the same 6DOF volume. An earlier generation 3D optical surface tracker was observed to have worse tracking capabilities than both the IR camera unit and the newer 3D surface tracking system with maximal RMSE of 0.74 mm and 0.28 degrees within the same 6DOF evaluation space. Conclusion: The proposed technique was effective at evaluating the performance of 6DOF patient tracking systems. All systems examined exhibited tracking capabilities at the sub-millimeter and sub-degree level within a 6DOF workspace.

60 APPLIED LIFE SCIENCES↗
DOE OSTI2021

A New Class of AMG Interpolation Methods Based on Matrix-Matrix Multiplications

A new class of distance-two interpolation methods for algebraic multigrid (AMG) that can be formulated in terms of sparse matrix-matrix multiplications is presented and analyzed. Compared with similar distance-two prolongation operators, the proposed algorithms exhibit improved efficiency and portability to various computing platforms, since they allow one to easily exploit existing high-performance sparse matrix kernels. The new interpolation methods have been implemented in hypre, a widely used parallel multigrid solver library. With the proposed interpolations, the overall time of hypre's BoomerAMG setup can be considerably reduced, while sustaining equivalent, sometimes improved, convergence rates. Numerical results for a variety of test problems on parallel machines are presented that support the superiority of the proposed interpolation operators over the existing ones in hypre.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2015

TADSim: Discrete Event-based Performance Prediction for Temperature Accelerated Dynamics

Next-generation high-performance computing will require more scalable and flexible performance prediction tools to evaluate software--hardware co-design choices relevant to scientific applications and hardware architectures. Here, we present a new class of tools called application simulators—parameterized fast-running proxies of large-scale scientific applications using parallel discrete event simulation. Parameterized choices for the algorithmic method and hardware options provide a rich space for design exploration and allow us to quickly find well-performing software--hardware combinations. We demonstrate our approach with a TADSim simulator that models the temperature-accelerated dynamics (TAD) method, an algorithmically complex and parameter-rich member of the accelerated molecular dynamics (AMD) family of molecular dynamics methods. The essence of the TAD application is captured without the computational expense and resource usage of the full code. We accomplish this by identifying the time-intensive elements, quantifying algorithm steps in terms of those elements, abstracting them out, and replacing them by the passage of time. We use TADSim to quickly characterize the runtime performance and algorithmic behavior for the otherwise long-running simulation code. We extend TADSim to model algorithm extensions, such as speculative spawning of the compute-bound stages, and predict performance improvements without having to implement such a method. Validation against the actual TAD code shows close agreement for the evolution of an example physical system, a silver surface. Finally, focused parameter scans have allowed us to study algorithm parameter choices over far more scenarios than would be possible with the actual simulation. This has led to interesting performance-related insights and suggested extensions.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2019

Exa-Graph/vite

MPI+OpenMP implementation of Louvain method for Graph Community Detection, with a number of parallel heuristics/approximate computing techniques Also called "CuVite"

Ghosh, Sayan↗
DOE OSTI2026

DIVA/DeviceEditor v6.1.2

DIVA is an end-to-end DNA design and construction management platform that streamlines how researchers design, build, and receive sequence-verified DNA constructs. Through a web-based BioCAD interface (DeviceEditor), researchers independently design DNA constructs and submit them to a centralized queue with a single action. Designs progress transparently through standardized states which allow researchers to track status and access finished constructs via a central DNA repository. Submitted designs are reviewed by dedicated staff for feasibility and optimization, reducing costly failures and improving downstream execution. Automated DNA assembly software optimizes construction strategies by reusing existing parts where possible and sourcing synthetic DNA only when needed. Standardized, sequence-agnostic assembly methods enable many independent constructs to be built in parallel using lab automation, dramatically increasing throughput. High-throughput next-generation sequencing is used to verify construct accuracy, with flexible platforms selected based on task requirements. Throughout the process, detailed success and failure data are captured and analyzed, enabling continuous improvement of assembly protocols. Compared to traditional, manual DNA construction workflows, DIVA offers higher scalability, transparency, reproducibility, and data-driven optimization.

Plahar, Hector [Lawrence Berkeley National Laborat↗
DOE OSTI2022

Scalable Second Order Optimization for Machine Learning

Many machine learning (ML) training tasks are essentially optimization processes that would at first glance appear eminently parallelizable and scalable. However, effective acceleration of these tasks with scalable parallel hardware has proven to be elusive. While standard methods for machine learning, e.g., stochastic gradient descent (SGD) for DNNs, tend to be resource efficient, they appear to be fundamentally sequential in nature.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

Machine Committee Framework for Power Grid Disturbances Analysis Using Synchrophasors Data

Events detection is a key challenge in power grid frequency disturbances analysis. Accurate detection of events is crucial for situational awareness of the power system. In this paper, we study the problem of events detection in power grid frequency disturbance analysis using synchrophasors data streams. Current events detection approaches for power grid rely on individual detection algorithm. This study integrates some of the existing detection algorithms using the concept of machine committee to develop improved detection approaches for grid disturbance analysis. Specifically, we propose two algorithms—an Event Detection Machine Committee (EDMC) algorithm and a Change-Point Detection Machine Committee (CPDMC) algorithm. Both algorithms use parallel architecture to fuse detection knowledge of its individual methods to arrive at an overall output. The EDMC algorithm combines five individual event detection methods, while the CPDMC algorithm combines two change-point detection methods. Each method performs the detection task separately. The overall output of each algorithm is then computed using a voting strategy. The proposed algorithms are evaluated using three case studies of actual power grid disturbances. Compared with the individual results of the various detection methods, we found that the EDMC algorithm is a better fit for analyzing synchrophasors data; it improves the detection accuracy; and it is suitable for practical scenarios.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2025

Fast and sensitive measurements of sub-3 nm particles using Condensation Particle Counters For Atmospheric Rapid Measurements (CPC FARM)

New particle formation (NPF) is the atmospheric process whereby gas molecules react and nucleate to form detectable particles. NPF has a strong impact on Earth's radiative balance as it produces roughly half of global cloud condensation nuclei. However, the time resolution and sensitivity of current instrumentation are inadequate in measuring the size distribution of sub-3 nm particles, the particles critical for understanding NPF. Here we present the Condensation Particle Counters For Atmospheric Rapid Measurements (CPC FARM), a method to measure the concentrations of freshly nucleated particles. The CPC FARM consists of five CPCs operating in parallel, each configured to operate at different detectable particle sizes between 1–3 nm. This study explores two methods to calculate the size distribution from the differential measurements across the CPC channels. The performance of both inversion methods was tested against the size distribution measured by a pair of stepping particle mobility sizers (SMPSs) during an ambient air sampling study in Pittsburgh, PA. Observational results indicate that the CPC FARM is more accurate with higher time resolution and sensitivity in the sub-3 nm range compared to the SMPS.

Cheng, Darren [Carnegie Mellon Univ., Pittsburgh, ↗
DOE OSTI2023

R “SHINY” GUI DEVELOPMENT FOR URANIUM ISOTOPIC ANALYSIS WITH MATRIX-ASSISTED IONIZATION MASS SPECTROMETRY

The international nuclear safeguards community continues to seek rapid, accurate, and precise characterization capabilities for the in-field measurement of uranium isotopic compositions in nuclear facilities. Mass spectrometry (MS) is considered the “gold standard” for analysis of relatively long-lived actinides such as uranium (U) and plutonium; however, conventional MS analysis often requires time consuming sample preparation and complex analytical methodologies that are difficult to perform in-field or in-facility. Matrix assisted ionization (MAI) is a novel ambient ionization MS technique (i.e., MAI-MS) that potentially addresses these challenges due to the relative simplicity of the ionization phenomenon and ruggedness of ambient MS instrumentation. Savannah River National Laboratory (SRNL, USA) has demonstrated this technique for nanogram-level 235U/238U isotope ratio measurements within seconds, with percent-level analytical uncertainties capable of discriminating depleted, natural, and low-enriched uranium. Current experimental work on developing MAI methods for uranium isotopic analysis has been enabled by parallel development of a comprehensive MAI-MS data analysis suite at SRNL. Development of this bespoke data analysis software was necessary because commercially available ambient MS software is poorly suited for uranium isotope ratio measurement. The effort leverages the power of R, a popular open-source programming language, and Shiny, an R package providing tools for graphical user interface (GUI) and web interface coding. This software allows researchers without any programming experience to harness and utilize R’s considerable data analysis/visualization power.

LaBone, Elizabeth D.↗
DOE OSTI2016

Coupling CTF to MPACT for Improved Thermal-Hydraulic Feedback for Transients

As computational power and techniques continue to advance, reactor analysis codes are afforded the opportunity to employ a more detailed physics model. One area where this has manifested is with coupled neutron kinetics and thermal-hydraulics codes for transient analysis, in which the feedback is critical for accurate modeling. The Michigan Parallel Characteristics Transport (MPACT) code is a 3-D method of characteristics neutron transport code capable of generating sub-pin level power distributions being developed by the University of Michigan through the Consortium for Advanced Simulation of LWRs (CASL) program. Currently, MPACT handles thermal-hydraulic feedback with an internal 1-D radial heat transfer model assuming constant moderator temperature. While this relatively simple treatment of thermal-hydraulic feedback has been shown to accurately model transients where Doppler feedback is the dominant feedback mechanism, coupling MPACT to a detailed thermal-hydraulic code will greatly expand the range of transient problems that can be accurately modeled. COBRA-TF (CTF) is a 3-D two-phase flow, subchannel thermal-hydraulics code maintained by Penn State University through CASL. CTF is based upon the Semi-Implicit Method for Pressure-Linked Equations, and it is especially well suited to model heat transfer and fluid flow phenomena associated with a nuclear reactor through a wide range of conditions. We present an initial effort coupling MPACT to CTF for transients, which provides a wider range of transient problems that can be modeled with increased accuracy. We have successfully coupled the thermal-hydraulics code CTF to the neutronics code MPACT for transient calculations by implicit and Crank-Nicolson methods, which have been demonstrated with single pin and 3x3 configurations. This capability extends the ability of MPACT to accurately model transients through a wider range of conditions than the existing thermal-hydraulic feedback, which is severely limited by the assumption of constant moderator temperature and density. By employing CTF for the thermal- hydraulic feedback, the transient physics can be described more completely at minimal computational expense. (authors)

42 ENGINEERING↗
DOE OSTI2021

Efficient quadrature rules for finite element discretizations of nonlocal equations

Here, in this paper, we design efficient quadrature rules for finite element (FE) discretizations of nonlocal diffusion problems with compactly supported kernel functions. Two of the main challenges in nonlocal modeling and simulations are the prohibitive computational cost and the nontrivial implementation of discretization schemes, especially in three-dimensional settings. In this work, we circumvent both challenges by introducing a parametrized mollifying function that improves the regularity of the integrand, utilizing an adaptive integration technique, and exploiting parallelization. We first show that the “mollified” solution converges to the exact one as the mollifying parameter vanishes, then we illustrate the consistency and accuracy of the proposed method on several two- and three-dimensional test cases. Furthermore, we demonstrate the good scaling properties of the parallel implementation of the adaptive algorithm and we compare the proposed method with recently developed techniques for efficient FE assembly.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2015

SU-E-T-499: Initial Developments of An OpenCL-Based Cross-Platform Monte Carlo Dose Engine for Carbon Ion Therapy

Purpose Dose calculation is of critical importance for carbon ion therapy. Monte Carlo (MC) simulation is considered to be the most accurate method for calculation of absorbed dose and of all the more fundamental physical quantities related to biological effects. The long computation time, however, limits its routine clinical applications. We have recently started developing a fast MC package, gCMC for carbon therapy on a parallel processing platform, e.g. GPU, aiming at achieving sufficient efficiency to enable MC in clinically important tasks. This abstract reports our progress. Methods gCMC was developed in OpenCL environment. Our initial developments focused on water material. gCMC supported carbon ion transport in the energy range of 1–450 MeV/u. A Class II condensed history algorithm was implemented for charged particle transport simulations with stopping power computed via Bethe-Bloch equation. Energy straggling and multiple scattering were modeled. Total cross section of nuclear interaction was extracted from Geant4. At present, nuclear interaction events were sampled but transports of secondary particles were not included. Results We tested cases with a homogeneous water phantom and a pencil carbon ion beam with energy of 200–400 MeV/u. When only electro-magnetic channel was included, dose/fluence difference between gCMC and Geant4 results averaged within 10% isodose line was <0.5% of the maximum dose/fluence. After enabling nuclear interactions without transporting secondary particles, dose and fluence agreed with the corresponding results computed by Geant4 with <1% difference. Due to the support for multiple platforms of OpenCL, gCMC was executable on NVidia and AMD GPUs, and Intel CPUs. It took ∼50 sec to transport 107 200MeV/u source carbon ions on an NVidia Titan GPU card. Conclusion Preliminary studies have demonstrated the accuracy and efficiency of gCMC. With further developments in near future, gCMC will potentially achieve clinically acceptable fast and accurate MC simulations for carbon ion therapy.

60 APPLIED LIFE SCIENCES↗
DOE OSTI2020

Towards Feature-Preserving 2D and 3D Vector Field Compression

The objective of this work is to develop error-bounded lossy compression methods to preserve topological features in 2D and 3D vector fields. Specifically, we explore the preservation of critical points in piecewise linear vector fields. We define the preservation of critical points as, without any false positive, false negative, or false type change in the decompressed data, (1) keeping each critical point in its original cell and (2) retaining the type of each critical point (e.g., saddle and attracting node). The key to our method is to adapt a vertex-wise error bound for each grid point and to compress input data together with the error bound field using a modified lossy compressor. Our compression algorithm can be also embarrassingly parallelized for large data handling and in situ processing. We benchmark our method by comparing it with existing lossy compressors in terms of false positive/negative/type rates, compression ratio, and various vector field visualizations with several scientific applications.

critical points↗
DOE OSTI2016

Three paths toward the quantum angle operator

We examine mathematical questions around angle (or phase) operator associated with a number operator through a short list of basic requirements. We implement three methods of construction of quantum angle. The first one is based on operator theory and parallels the definition of angle for the upper half-circle through its cosine and completed by a sign inversion. The two other methods are integral quantization generalizing in a certain sense the Berezin–Klauder approaches. One method pertains to Weyl–Heisenberg integral quantization of the plane viewed as the phase space of the motion on the line. It depends on a family of “weight” functions on the plane. The third method rests upon coherent state quantization of the cylinder viewed as the phase space of the motion on the circle. The construction of these coherent states depends on a family of probability distributions on the line.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2015

SU-E-T-75: A Simple Technique for Proton Beam Range Verification

Purpose: To develop a measurement-based technique to verify the range of proton beams for quality assurance (QA). Methods: We developed a simple technique to verify the proton beam range with in-house fabricated devices. Two separate devices were fabricated; a clear acrylic rectangular cuboid and a solid polyvinyl chloride (PVC) step wedge. For efficiency in our clinic, we used the rectangular cuboid for double scattering (DS) beams and the step wedge for pencil beam scanning (PBS) beams. These devices were added to our QA phantom to measure dose points along the distal fall-off region (between 80% and 20%) in addition to dose at mid-SOBP (spread out Bragg peak) using a two-dimensional parallel plate chamber array (MatriXX™, IBA Dosimetry, Schwarzenbruck, Germany). This method relies on the fact that the slope of the distal fall-off is linear and does not vary with small changes in energy. Using a multi-layer ionization chamber (Zebra™, IBA Dosimetry), percent depth dose (PDD) curves were measured for our standard daily QA beams. The range (energy) for each beam was then varied (i.e. ±2mm and ±5mm) and additional PDD curves were measured. The distal fall-off of all PDD curves was fit to a linear equation. The distal fall-off measured dose for a particular beam was used in our linear equation to determine the beam range. Results: The linear fit of the fall-off region for the PDD curves, when varying the range by a few millimeters for a specific QA beam, yielded identical slopes. The calculated range based on measured point dose(s) in the fall-off region using the slope resulted in agreement of ±1mm of the expected beam range. Conclusion: We developed a simple technique for accurately verifying the beam range for proton therapy QA programs.

60 APPLIED LIFE SCIENCES↗
DOE OSTI2021

An experimental comparison of a space-time multigrid method with PFASST for a reaction-diffusion problem

We consider two parallel-in-time approaches applied to a (reaction) diffusion problem, possibly non-linear. In particular, we consider PFASST (Parallel Full Approximation Scheme in Space and Time) and space-time multigrid strategies. For both approaches, we start from an integral formulation of the continuous time dependent problem. Then, a collocation form for PFASST and a discontinuous Galerkin discretization in time for the space-time multi-grid are employed, resulting in the same discrete solution at the time nodes. Strong and weak scaling of both multilevel strategies are compared for varying orders of the temporal discretization. Moreover, we investigate the respective convergence behavior for non-linear problems and highlight quantitative differences in execution times

97 MATHEMATICS AND COMPUTING↗