Search NASA⌕ Search

SEARCH · Search NASA

Results for “algorithm timings”

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,153 records · Page 64

Efficient GPU implementation for Particle in Cell algorithm

Particle in cell method is widely used method in the plasma physics to study the trajectories of charged particles under electromagnetic fields. The PIC algorithm is computationally intensive and its time requirements are proportional to the number of charged particles involved in the simulation. The focus of the paper is to parallelize the PIC algorithm on Graphics Processing Unit (GPU). We present several performance tradeoffs related to the small shared memory and atomic operations on the GPU to achieve high performance.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Imaging of moving fiducial markers during radiotherapy using a fast, efficient active pixel sensor based EPID

Purpose: The purpose of this work was to investigate the use of an experimental complementary metal-oxide-semiconductor (CMOS) active pixel sensor (APS) for tracking of moving fiducial markers during radiotherapy. Methods: The APS has an active area of 5.4 x 5.4 cm and maximum full frame read-out rate of 20 frame s{sup -1}, with the option to read out a region-of-interest (ROI) at an increased rate. It was coupled to a 4 mm thick ZnWO4 scintillator which provided a quantum efficiency (QE) of 8% for a 6 MV x-ray treatment beam. The APS was compared with a standard iViewGT flat panel amorphous Silicon (a-Si) electronic portal imaging device (EPID), with a QE of 0.34% and a frame-rate of 2.5 frame s{sup -1}. To investigate the ability of the two systems to image markers, four gold cylinders of length 8 mm and diameter 0.8, 1.2, 1.6, and 2 mm were placed on a motion-platform. Images of the stationary markers were acquired using the APS at a frame-rate of 20 frame s{sup -1}, and a dose-rate of 143 MU min{sup -1} to avoid saturation. EPID images were acquired at the maximum frame-rate of 2.5 frame s{sup -1}, and a reduced dose-rate of 19 MU min{sup -1} to provide a similar dose per frame to the APS. Signal-to-noise ratio (SNR) of the background signal and contrast-to-noise ratio (CNR) of the marker signal relative to the background were evaluated for both imagers at doses of 0.125 to 2 MU. Results: Image quality and marker visibility was found to be greater in the APS with SNR {approx}5 times greater than in the EPID and CNR up to an order of magnitude greater for all four markers. To investigate the ability to image and track moving markers the motion-platform was moved to simulate a breathing cycle with period 6 s, amplitude 20 mm and maximum speed 13.2 mm s{sup -1}. At the minimum integration time of 50 ms a tracking algorithm applied to the APS data found all four markers with a success rate of {>=}92% and positional error {<=}90 {mu}m. At an integration time of 400 ms the smallest marker became difficult to detect when moving. The detection of moving markers using the a-Si EPID was difficult even at the maximum dose-rate of 592 MU min{sup -1} due to the lower QE and longer integration time of 400 ms. Conclusions: This work demonstrates that a fast read-out, high QE APS may be useful in the tracking of moving fiducial markers during radiotherapy. Further study is required to investigate the tracking of markers moving in 3D in a treatment beam attenuated by moving patient anatomy. This will require a larger sensor with ROI read-out to maintain speed and a manageable data-rate.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

Locating Partial Discharges in Power Transformers with Convolutional Iterative Filtering

The most common source of transformer failure is in the insulation, and the most prevalent warning signal for insulation weakness is partial discharge (PD). Locating the positions of these partial discharges would help repair the transformer to prevent failures. This work investigates algorithms that could be deployed to locate the position of a PD event using data from ultra-high frequency (UHF) sensors inside the transformer. These algorithms typically proceed in two steps: first determining the signal arrival time, and then locating the position based on time differences. This paper reviews available methods for each task and then propose new algorithms: a convolutional iterative filter with thresholding (CIFT) to determine the signal arrival time and a reference table of travel times to resolve the source location. The effectiveness of these algorithms are tested with a set of laboratory-triggered PD events and two sets of simulated PD events inside transformers in production use. Tests show the new approach provides more accurate locations than the best-known data analysis algorithms, and the difference is particularly large, 3.7X, when the signal sources are far from sensors.

47 OTHER INSTRUMENTATION↗

DefectTrack: a deep learning-based multi-object tracking algorithm for quantitative defect analysis of in-situ TEM videos in real-time

Abstract In-situ irradiation transmission electron microscopy (TEM) offers unique insights into the millisecond-timescale post-cascade process, such as the lifetime and thermal stability of defect clusters, vital to the mechanistic understanding of irradiation damage in nuclear materials. Converting in-situ irradiation TEM video data into meaningful information on defect cluster dynamic properties (e.g., lifetime) has become the major technical bottleneck. Here, we present a solution called the DefectTrack , the first dedicated deep learning-based one-shot multi-object tracking (MOT) model capable of tracking cascade-induced defect clusters in in-situ TEM videos in real-time. DefectTrack has achieved a Multi-Object Tracking Accuracy (MOTA) of 66.43% and a Mostly Tracked (MT) of 67.81% on the test set, which are comparable to state-of-the-art MOT algorithms. We discuss the MOT framework, model selection, training, and evaluation strategies for in-situ TEM applications. Further, we compare the DefectTrack with four human experts in quantifying defect cluster lifetime distributions using statistical tests and discuss the relationship between the material science domain metrics and MOT metrics. Our statistical evaluations on the defect lifetime distribution suggest that the DefectTrack outperforms human experts in accuracy and speed.

42 ENGINEERING↗

Description of the ARM Large-Scale Forcing Data from the Constrained Variational Analysis (VARANAL) Version 2

This technical report represents an update of the previous technical report written by Zhang et al., which described the U.S. Department of Energy Atmospheric Radiation Measurement (ARM) user facility constrained variational analysis (VARANAL) that is used to develop the large-scale forcing data for driving single-column models (SCMs), cloud-resolving models (CRMs), and large-eddy simulation models (LES). The VARANAL algorithm was originally developed by Zhang and Lin and Zhang et al. at Stony Brook University and was migrated to the Lawrence Livermore National Laboratory (LLNL) as the ARM operational objective analysis system in May 1999. Since then, the algorithm has been evolved with time along with the availability of new observations and techniques to meet various modeling needs. Major updates include: 1. The method used to develop multi-year continuous forcing data, 2. The incorporation of eddy correlation flux measurement system (ECOR) turbulent fluxes into the analysis, and 3. Improvements to the workflow (e.g., implementing part of the code into the ARM Data Integrator [ADI]) to increase efficiency. The ARM large-scale forcing data have been widely used for SCM/CRM/LES to understand and improve physical processes in models. Zhang et al. has provided a comprehensive review of the SCM concept, early efforts to derive forcing data for SCM studies, efforts of the ARM constrained variational analysis, and previous SCM studies using ARM cases. This technical report focuses on the constrained variational analysis algorithm and the introduction of the ARM VARANAL products. We also extended the VARANAL algorithm into a three-dimensional constrained variational analysis (3DCVA) and designed an ensemble framework to address the forcing uncertainty. The 3D large-scale forcing data are released as another datastream named “varanal3d”. Please refer to the ARM varanal3d technical report for more information.

54 ENVIRONMENTAL SCIENCES↗

SU-G-BRA-02: Development of a Learning Based Block Matching Algorithm for Ultrasound Tracking in Radiotherapy

Purpose: To develop an ultrasound learning-based tracking algorithm with the potential to provide real-time motion traces of anatomy-based fiducials that may aid in the effective delivery of external beam radiation. Methods: The algorithm was developed in Matlab R2015a and consists of two main stages: reference frame selection, and localized block matching. Immediately following frame acquisition, a normalized cross-correlation (NCC) similarity metric is used to determine a reference frame most similar to the current frame from a series of training set images that were acquired during a pretreatment scan. Segmented features in the reference frame provide the basis for the localized block matching to determine the feature locations in the current frame. The boundary points of the reference frame segmentation are used as the initial locations for the block matching and NCC is used to find the most similar block in the current frame. The best matched block locations in the current frame comprise the updated feature boundary. The algorithm was tested using five features from two sets of ultrasound patient data obtained from MICCAI 2014 CLUST. Due to the lack of a training set associated with the image sequences, the first 200 frames of the image sets were considered a valid training set for preliminary testing, and tracking was performed over the remaining frames. Results: Tracking of the five vessel features resulted in an average tracking error of 1.21 mm relative to predefined annotations. The average analysis rate was 15.7 FPS with analysis for one of the two patients reaching real-time speeds. Computations were performed on an i5-3230M at 2.60 GHz. Conclusion: Preliminary tests show tracking errors comparable with similar algorithms at close to real-time speeds. Extension of the work onto a GPU platform has the potential to achieve real-time performance, making tracking for therapy applications a feasible option. This work is partially funded by NIH grant R01CA190298.

60 APPLIED LIFE SCIENCES↗

Image Gradient Decomposition for Parallel and Memory-Efficient Ptychographic Reconstruction

Ptychography is a popular microscopic imaging modality for many scientific discoveries and sets the record for highest image resolution. Unfortunately, the high image resolution for ptychographic reconstruction requires significant amount of memory and computations, forcing many applications to compromise their image resolution in exchange for a smaller memory footprint and a shorter reconstruction time. In this paper, we propose a novel image gradient decomposition method that significantly reduces the memory footprint for ptychographic reconstruction by tessellating image gradients and diffraction measurements into tiles. In addition, we propose a parallel image gradient decomposition method that enables asynchronous point-to-point communications and parallel pipelining with minimal overhead on a large number of GPUs. Our experiments on a Titanate material dataset (PbTiO3) with 16632 probe locations show that our Gradient Decomposition algorithm reduces memory footprint by 51 times. In addition, it achieves time-to-solution within 2.2 minutes by scaling to 4158 GPUs with a super-linear strong scaling efficiency at 364% compared to runtimes at 6 GPUs. This performance is 2.7 times more memory efficient, 9 times more scalable and 86 times faster than the state-of-the-art algorithm.

Wang, Xiao↗

Discrete Event Execution with One-Sided and Two-Sided GVT Algorithms on 216,000 Processor Cores

Global virtual time (GVT) computation is a key determinant of the efficiency and runtime dynamics of parallel discrete event simulations (PDES), especially on large-scale parallel platforms. Here, three execution modes of a generalized GVT computation algorithm are studied on high-performance parallel computing systems: (1) a synchronous GVT algorithm that affords ease of implementation, (2) an asynchronous GVT algorithm that is more complex to implement but can relieve blocking latencies, and (3) a variant of the asynchronous GVT algorithm to exploit one-sided communication in extant supercomputing platforms. Performance results are presented of implementations of these algorithms on up to 216,000 cores of a Cray XT5 system, exercised on a range of parameters: optimistic and conservative synchronization, fine- to medium-grained event computation, synthetic and non-synthetic applications, and different lookahead values. Performance of up to 54 billion events executed per second is registered. Detailed PDES-specific runtime metrics are presented to further the understanding of tightly-coupled discrete event dynamics on massively parallel platforms.

Perumalla, Kalyan S↗

Description of the ARM Large-Scale Forcing Data from the Constrained Variational Analysis (VARANAL) Version 2

This technical report represents an update of the previous technical report written by Zhang et al. (2001a) (available at http://www.arm.gov/publications/tech_reports/arm-tr-005.pdf), which described the U.S. Department of Energy Atmospheric Radiation Measurement (ARM) user facility constrained variational analysis (VARANAL) that is used to develop the large-scale forcing data for driving single-column models (SCMs), cloud-resolving models (CRMs), and large-eddy simulation models (LES). The VARANAL algorithm was originally developed by Zhang and Lin (1997) and Zhang et al. (2001b) at Stony Brook University and was migrated to the Lawrence Livermore National Laboratory (LLNL) as the ARM operational objective analysis system in May 1999. Since then, the algorithm has been evolved with time along with the availability of new observations and techniques to meet various modeling needs. Major updates include: (1) The method used to develop multi-year continuous forcing data (Xie et al. 2004), (2) The incorporation of eddy correlation flux measurement system (ECOR) turbulent fluxes into the analysis (Tang et al. 2019), and (3) Improvements to the workflow (e.g., implementing part of the code into the ARM Data Integrator [ADI]) to increase efficiency. The ARM large-scale forcing data have been widely used for SCM/CRM/LES to understand and improve physical processes in models. Zhang et al. (2016) has provided a comprehensive review of the SCM concept, early efforts to derive forcing data for SCM studies, efforts of the ARM constrained variational analysis, and previous SCM studies using ARM cases. This technical report focuses on the constrained variational analysis algorithm and the introduction of the ARM VARANAL products.

58 GEOSCIENCES↗

Optimizing Multi-Robot Placements for Wire Arc Additive Manufacturing

Wire arc additive manufacturing is a metal additive manufacturing process in which the material is deposited using arc welding technology. It is gaining popularity due to high material deposition rates and faster build time. It is en-abled using robotic manipulators and can build relatively large-scale parts faster when compared with other metal additive manufacturing processes. However, the size of the large-scale parts is limited by the size of the industrial manipulator being used for the process. This limitation is overcome by using a fixed configuration multi-robot cell in which manipulators work cooperatively to build large-scale parts quickly. A fixed multi-robot cell with closely spaced industrial manipulators has high flexibility, but it restricts the part size that can be built. If the manipulators are spread out, the cell loses its flexibility but can build relatively larger parts. This issue can be avoided by using larger size manipulators, which are expensive, or by moving the modest size manipulators based on the part geometries. This paper presents a novel algorithm to generate multi-robot placements for different part geometries to be built using wire arc additive manufacturing. Furthermore, the algorithm hierarchically optimizes the build time and the inverse kinematics consistency in robot paths to improve the process efficiency and part quality. We compare the results with fixed multi-robot cells and provide insights to users to make an informed decision on whether to use a fixed or a flexible multi-robot cell for wire arc additive manufacturing.

Bhatt, Prahar↗

Accuracy of the explicit energy-conserving particle-in-cell method for under-resolved simulations of capacitively coupled plasma discharges

The traditional explicit electrostatic momentum-conserving particle-in-cell algorithm requires strict resolution of the electron Debye length to deliver numerical stability and accuracy. The explicit electrostatic energy-conserving particle-in-cell algorithm alleviates this constraint with minimal modification to the traditional algorithm, retaining its simplicity, ease of parallelization, and acceleration on modern supercomputing architectures. In this article, we apply the algorithm to model a one-dimensional radio frequency capacitively coupled plasma discharge relevant to industrial applications. The energy-conserving approach closely matches the results from the momentum-conserving algorithm and retains accuracy even for cell sizes up to 8 times the electron Debye length. For even larger cells, the algorithm loses accuracy due to poor resolution of steep gradients within the radio frequency sheath. Accuracy can be recovered by adopting a non-uniform grid, which resolves the sheath and allows for cell sizes up to 32 times the electron Debye length in the quasi-neutral bulk of the discharge. The effect is an up to 8 times reduction in the number of required simulation cells, an improvement that can compound in higher-dimensional simulations. We therefore consider the explicit energy-conserving algorithm as a promising approach to significantly reduce the computational cost of full-scale device simulations and a pathway to delivering kinetic simulation capabilities of use to industry.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Continuous-time probabilistic models for longitudinal electronic health records

Analysis of longitudinal Electronic Health Record (EHR) data is an important goal for precision medicine. Difficulty in applying Machine Learning (ML) methods, either predictive or unsupervised, stems in part from the heterogeneity and irregular sampling of EHR data. Here, we present an unsupervised probabilistic model that captures nonlinear relationships between variables over continuous-time. This method works with arbitrary sampling patterns and captures the joint probability distribution between variable measurements and the time intervals between them. Inference algorithms are derived that can be used to evaluate the likelihood of future using under a trained model. As an example, we consider data from the United States Veterans Health Administration (VHA) in the areas of diabetes and depression. Likelihood ratio maps are produced showing the likelihood of risk for moderate-severe vs minimal depression as measured by the Patient Health Questionnaire-9 (PHQ-9).

59 BASIC BIOLOGICAL SCIENCES↗

Massively Parallel Latent Semantic Analyzes using a Graphics Processing Unit

Latent Semantic Indexing (LSA) aims to reduce the dimensions of large Term-Document datasets using Singular Value Decomposition. However, with the ever expanding size of data sets, current implementations are not fast enough to quickly and easily compute the results on a standard PC. The Graphics Processing Unit (GPU) can solve some highly parallel problems much faster than the traditional sequential processor (CPU). Thus, a deployable system using a GPU to speedup large-scale LSA processes would be a much more effective choice (in terms of cost/performance ratio) than using a computer cluster. Due to the GPU s application-specific architecture, harnessing the GPU s computational prowess for LSA is a great challenge. We present a parallel LSA implementation on the GPU, using NVIDIA Compute Unified Device Architecture and Compute Unified Basic Linear Algebra Subprograms. The performance of this implementation is compared to traditional LSA implementation on CPU using an optimized Basic Linear Algebra Subprograms library. After implementation, we discovered that the GPU version of the algorithm was twice as fast for large matrices (1000x1000 and above) that had dimensions not divisible by 16. For large matrices that did have dimensions divisible by 16, the GPU algorithm ran five to six times faster than the CPU version. The large variation is due to architectural benefits the GPU has for matrices divisible by 16. It should be noted that the overall speeds for the CPU version did not vary from relative normal when the matrix dimensions were divisible by 16. Further research is needed in order to produce a fully implementable version of LSA. With that in mind, the research we presented shows that the GPU is a viable option for increasing the speed of LSA, in terms of cost/performance ratio.

99 GENERAL AND MISCELLANEOUS↗

SU-F-T-20: Novel Catheter Lumen Recognition Algorithm for Rapid Digitization

Purpose: Manual catheter recognition remains a time-consuming aspect of high-dose-rate brachytherapy (HDR) treatment planning. In this work, a novel catheter lumen recognition algorithm was created for accurate and rapid digitization. Methods: MatLab v8.5 was used to create the catheter recognition algorithm. Initially, the algorithm searches the patient CT dataset using an intensity based k-means filter designed to locate catheters. Once the catheters have been located, seed points are manually selected to initialize digitization of each catheter. From each seed point, the algorithm searches locally in order to automatically digitize the remaining catheter. This digitization is accomplished by finding pixels with similar image curvature and divergence parameters compared to the seed pixel. Newly digitized pixels are treated as new seed positions, and hessian image analysis is used to direct the algorithm toward neighboring catheter pixels, and to make the algorithm insensitive to adjacent catheters that are unresolvable on CT, air pockets, and high Z artifacts. The algorithm was tested using 11 HDR treatment plans, including the Syed template, tandem and ovoid applicator, and multi-catheter lung brachytherapy. Digitization error was calculated by comparing manually determined catheter positions to those determined by the algorithm. Results: he digitization error was 0.23 mm ± 0.14 mm axially and 0.62 mm ± 0.13 mm longitudinally at the tip. The time of digitization, following initial seed placement was less than 1 second per catheter. The maximum total time required to digitize all tested applicators was 4 minutes (Syed template with 15 needles). Conclusion: This algorithm successfully digitizes HDR catheters for a variety of applicators with or without CT markers. The minimal axial error demonstrates the accuracy of the algorithm, and its insensitivity to image artifacts and challenging catheter positioning. Future work to automatically place initial seed positions would improve the algorithm speed.

60 APPLIED LIFE SCIENCES↗

Pinning impulsive control algorithms for complex network

In this paper, we further investigate the synchronization of complex dynamical network via pinning control in which a selection of nodes are controlled at discrete times. Different from most existing work, the pinning control algorithms utilize only the impulsive signals at discrete time instants, which may greatly improve the communication channel efficiency and reduce control cost. Two classes of algorithms are designed, one for strongly connected complex network and another for non-strongly connected complex network. It is suggested that in the strongly connected network with suitable coupling strength, a single controller at any one of the network's nodes can always pin the network to its homogeneous solution. In the non-strongly connected case, the location and minimum number of nodes needed to pin the network are determined by the Frobenius normal form of the coupling matrix. In addition, the coupling matrix is not necessarily symmetric or irreducible. Illustrative examples are then given to validate the proposed pinning impulsive control algorithms.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

A parallel algorithm for solving the 3d Schroedinger equation

We describe a parallel algorithm for solving the time-independent 3d Schroedinger equation using the finite difference time domain (FDTD) method. We introduce an optimized parallelization scheme that reduces communication overhead between computational nodes. We demonstrate that the compute time, t, scales inversely with the number of computational nodes as t {proportional_to} (N{sub nodes}){sup -0.95} {sup {+-} 0.04}. This makes it possible to solve the 3d Schroedinger equation on extremely large spatial lattices using a small computing cluster. In addition, we present a new method for precisely determining the energy eigenvalues and wavefunctions of quantum states based on a symmetry constraint on the FDTD initial condition. Finally, we discuss the usage of multi-resolution techniques in order to speed up convergence on extremely large lattices.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗