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,261 records · Page 70

Extreme-Scale Algorithms & Software Resilience (EASIR) Architecture-Aware Algorithms for Scalable Performance and Resilience on Heterogeneous Architectures

This project addresses both communication-avoiding algorithms, and reproducible floating-point computation. Communication, i.e. moving data, either between levels of memory or processors over a network, is much more expensive per operation than arithmetic (measured in time or energy), so we seek algorithms that greatly reduce communication. We developed many new algorithms for both dense and sparse, and both direct and iterative linear algebra, attaining new communication lower bounds, and getting large speedups in many cases. We also extended this work in several ways: (1) We minimize writes separately from reads, since writes may be much more expensive than reads on emerging memory technologies, like Flash, sometimes doing asymptotically fewer writes than reads. (2) We extend the lower bounds and optimal algorithms to arbitrary algorithms that may be expressed as perfectly nested loops accessing arrays, where the array subscripts may be arbitrary affine functions of the loop indices (eg A(i), B(i,j+k, k+3*m-7, …) etc.). (3) We extend our communication-avoiding approach to some machine learning algorithms, such as support vector machines. This work has won a number of awards. We also address reproducible floating-point computation. We define reproducibility to mean getting bitwise identical results from multiple runs of the same program, perhaps with different hardware resources or other changes that should ideally not change the answer. Many users depend on reproducibility for debugging or correctness. However, dynamic scheduling of parallel computing resources, combined with nonassociativity of floating point addition, makes attaining reproducibility a challenge even for simple operations like summing a vector of numbers, or more complicated operations like the Basic Linear Algebra Subprograms (BLAS). We describe an algorithm that computes a reproducible sum of floating point numbers, independent of the order of summation. The algorithm depends only on a subset of the IEEE Floating Point Standard 754-2008, uses just 6 words to represent a “reproducible accumulator,” and requires just one read-only pass over the data, or one reduction in parallel. New instructions based on this work are being considered for inclusion in the future IEEE 754-2018 floating-point standard, and new reproducible BLAS are being considered for the next version of the BLAS standard.

97 MATHEMATICS AND COMPUTING↗

Preprocessing Prediction of Advanced Algorithms for Medical Imaging

Advanced medical imaging algorithms (such as bone removal, vessel segmentation, or a lung nodule detection) can provide extremely valuable information to the radiologists, but they might sometimes be very time consuming. Being able to run the algorithms in advance can be a possible solution. However, we do not know which algorithm to run on a given dataset before it is actually used. It is possible to manually insert matching rules for preprocessing algorithms, but it requires high maintenance and does not work well in practice. This paper presents a dynamic machine learning solution for predicting which advanced visualization (AV) algorithm needs to be applied on a given series. The system gets a handful of free text DICOM tags as an input and builds a model in the clinical setting. It incorporates a Bag of Words (BOW) feature extractor and a Random Forest classifier. The approach was tested on two datasets from clinical sites which use different languages and varying scanner models. We show that even without feature extraction, sensitivity of above 90% can be reached on both of them. By using BOW feature extractor, precision and sensitivity can usually be further improved. Even on a noisy and highly unbalanced dataset, only around 100 samples were needed to reach sensitivity of above 80% and specificity of above 97%. We show how the solution can be part of a Smart Preprocessing mechanism in a viewing software. Using such a system will ultimately minimize the time to launch studies and improve radiologists reading time efficiency.

62 RADIOLOGY AND NUCLEAR MEDICINE↗

Primary track recovery in high-definition gas time projection chambers

Abstract We develop and validate a new algorithm called primary track recovery () that effectively deconvolves known physics and detector effects from nuclear recoil tracks in gas time projection chambers (TPCs) with high-resolution readout. This gives access to the primary track charge, length, and vector direction (helping to resolve the “head-tail” ambiguity). Additionally, provides a measurement of the transverse and longitudinal diffusion widths, which can be used to determine the absolute position of tracks in the drift direction for detector fiducialization. Using simulated helium recoils in an atmospheric pressure TPC with a 70:30 mixture of $$\hbox {He:CO}_2$$ He:CO 2 we compare the performance of to traditional methods for all key track variables. We find that the algorithm reduces reconstruction errors, including those caused by charge integration, for tracks with mean length-to-width ratios 1.4 and above, corresponding to recoil energies of 20 keV and above in the studied TPCs. We show that improves on existing methods for head-tail disambiguation, particularly for highly inclined tracks, and improves the determination of the absolute position of recoils on the drift axis via transverse diffusion. We find that can partially recover charge structure integrated out by the detector in the z direction, but that its determination of energy and length have worse resolution compared to existing methods. We use experimental data to qualitatively verify these findings and discuss implications for future directional detectors at the low-energy frontier.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Enhanced PDV waveform search and analysis method using parallel circular-convolution / cross-correlation for improved dynamic surface velocity extraction [Poster]

Previous work on exhaustive search methodologies for extracting best-match parameters pertaining to dynamic surface quantities from PDV was done by cross-correlating synthetically generated PDV waveforms with observed counterparts using the circular-convolution theorem. This work was further developed into an open-source PDV analysis toolkit called CCPDVANALYSIS which expands upon and enhances the previously tested methods by parallelizing serial algorithmic components and incorporating a comprehensive script library for different flavors of instantaneous frequency functions utilized in generating synthetic PDV waveforms. Results of these enhancements have been shown to markedly decrease execution times of exhaustive search and extraction algorithms and produce improved velocity recoveries for low-velocity and dynamically varying velocity signals. The CCPDVANALYSIS script library demonstrates an advanced method for extracting velocities from low-velocity and non-constant velocity signals further extending and improving the methods beyond capabilities of traditional frequency domain tools.

97 MATHEMATICS AND COMPUTING↗

Gamma ray spectroscopy employing divalent europium-doped alkaline earth halides and digital readout for accurate histogramming

A scintillator radiation detector system according to one embodiment includes a scintillator; and a processing device for processing pulse traces corresponding to light pulses from the scintillator, wherein pulse digitization is used to improve energy resolution of the system. A scintillator radiation detector system according to another embodiment includes a processing device for fitting digitized scintillation waveforms to an algorithm based on identifying rise and decay times and performing a direct integration of fit parameters. A method according to yet another embodiment includes processing pulse traces corresponding to light pulses from a scintillator, wherein pulse digitization is used to improve energy resolution of the system. A method in a further embodiment includes fitting digitized scintillation waveforms to an algorithm based on identifying rise and decay times; and performing a direct integration of fit parameters. Additional systems and methods are also presented.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

A Positive-Definite, WENO-Limited, High-Order Finite Volume Solver for 2-D Transport on the Cubed Sphere Using an ADER Time Discretization

Modern computer architectures reward added computation if it reduces algorithmic dependence, reduces data movement, increases accuracy/robustness, and improves memory accesses. The driving motive for this study is to develop a numerical algorithm that respects these constraints while improving accuracy and robustness. This study introduces the ADER-DT (Arbitrary DERivatives in time and space-differential transform) time discretization to positive-definite, weighted essentially nonoscillatory (WENO)-limited, finite volume transport on the cubed sphere in lieu of semidiscrete integrators. The cost of the ADER-DT algorithm is significantly improved from previous implementations without affecting accuracy. A new function-based WENO implementation is also detailed for use with the ADER-DT time discretization. While ADER-DT costs about 1.5 times more than a fourth-order, five-stage strong stability preserving Runge-Kutta (SSPRK4) method, it is far more computationally dense (which is advantageous on accelerators such as graphics processing units), and it has a larger effective maximum stable time step. ADER-DT errors converge more quickly with grid refinement than SSPRK4, giving 6.5 times less error in the L ∞ norm than SSPRK4 at the highest refinement level for smooth data. For nonsmooth data, ADER-DT resolves C 0 discontinuities more sharply. For a complex flow field, ADER exhibits less phase error than SSPRK4. In conclusion, improving both accuracy and robustness as well as better respecting modern computational efficiency requirements, we believe the method presented herein is competitive for efficiently transporting tracers over the sphere for applications targeting modern computing architectures.

97 MATHEMATICS AND COMPUTING↗

Rapid Catalytic Template Searching as an Enzyme Function Prediction Procedure

We present an enzyme protein function identification algorithm, Catalytic Site Identification (CatSId), based on identification of catalytic residues. The method is optimized for highly accurate template identification across a diverse template library and is also very efficient in regards to time and scalability of comparisons. The algorithm matches three-dimensional residue arrangements in a query protein to a library of manually annotated, catalytic residues – The Catalytic Site Atlas (CSA). Two main processes are involved. The first process is a rapid protein-to-template matching algorithm that scales quadratically with target protein size and linearly with template size. The second process incorporates a number of physical descriptors, including binding site predictions, in a logistic scoring procedure to re-score matches found in Process 1. This approach shows very good performance overall, with a Receiver-Operator-Characteristic Area Under Curve (AUC) of 0.971 for the training set evaluated. The procedure is able to process cofactors, ions, nonstandard residues, and point substitutions for residues and ions in a robust and integrated fashion. Sites with only two critical (catalytic) residues are challenging cases, resulting in AUCs of 0.9411 and 0.5413 for the training and test sets, respectively. The remaining sites show excellent performance with AUCs greater than 0.90 for both the training and test data on templates of size greater than two critical (catalytic) residues. The procedure has considerable promise for larger scale searches.

59 BASIC BIOLOGICAL SCIENCES↗

An Empirical Assessment of the MODIS Land Cover Dynamics and TIMESAT Land Surface Phenology Algorithms

Observations of vegetation phenology at regional-to-global scales provide important information regarding seasonal variation in the fluxes of energy, carbon, and water between the biosphere and the atmosphere. Numerous algorithms have been developed to estimate phenological transition dates using time series of remotely sensed spectral vegetation indices. A key challenge, however, is that different algorithms provide inconsistent results. This study provides a comprehensive comparison of start of season (SOS) and end of season (EOS) phenological transition dates estimated from 500 m MODIS data based on two widely used sources of such data: the TIMESAT program and the MODIS Global Land Cover Dynamics (MLCD) product. Specifically, we evaluate the impact of land cover class, criteria used to identify SOS and EOS, and fitting algorithm (local versus global) on the transition dates estimated from time series of MODIS enhanced vegetation index (EVI). Satellite-derived transition dates from each source are compared against each other and against SOS and EOS dates estimated from PhenoCams distributed across the Northeastern United States and Canada. Our results show that TIMESAT and MLCD SOS transition dates are generally highly correlated (r = 0.51-0.97), except in Central Canada where correlation coefficients are as low as 0.25. Relative to SOS, EOS comparison shows lower agreement and higher magnitude of deviations. SOS and EOS dates are impacted by noise arising from snow and cloud contamination, and there is low agreement among results from TIMESAT, the MLCD product, and PhenoCams in vegetation types with low seasonal EVI amplitude or with irregular EVI time series. In deciduous forests, SOS dates from the MLCD product and TIMESAT agree closely with SOS dates from PhenoCams, with correlations as high as 0.76. Overall, our results suggest that TIMESAT is well-suited for local-to-regional scale studies because of its ability to tune algorithm parameters, which makes it more flexible than the MLCD product. At large spatial scales, where local tuning is not feasible, the MLCD product provides a readily available data set based on a globally consistent approach that provides SOS and EOS dates that are comparable to results from TIMESAT.

47 OTHER INSTRUMENTATION↗

Optimal net-load balancing in smart grids with high PV penetration

Mitigating mismatches in supply demand curve is critical for smooth power grid operation. Traditionally, load curtailment techniques such as Demand Response (DR) have been used for this purpose. However, smart grids with high PV penetration sometimes exhibit supply surplus causing over-voltages. Thus, load curtailment techniques cannot be the only component of a net-load balancing framework. Supply curtailment techniques such as Volt-Var Optimizations are complex and computationally expensive. This increases the complexity of net-load balancing systems used by the grid operator and limits their scalability. Recently, new technologies have been developed that enable the rapid and selective connection of PV modules of an installation to the grid. Taking advantage of these advancements, we develop a unified optimal net-load balancing framework which performs both load and solar curtailment. We show that when the available curtailment values are discrete, this problem is NP-hard and develop bounded approximation algorithms for minimizing the curtailment cost. Our algorithms produce fast solutions, given the tight timing constraints required for grid operation. We also incorporate the notion of fairness to ensure that curtailment is evenly distributed among all the nodes. Finally, we develop an online algorithm which performs net-load balancing using only data available for the current interval. Using both theoretical analysis and practical evaluations, we show that our net-load balancing algorithms provide solutions which are close to optimal in a small amount of time.

14 SOLAR ENERGY↗

SU-C-BRA-01: Interactive Auto-Segmentation for Bowel in Online Adaptive MRI-Guided Radiation Therapy by Using a Multi-Region Labeling Algorithm

Purpose: In MRI-guided online adaptive radiation therapy, re-contouring of bowel is time-consuming and can impact the overall time of patients on table. The study aims to auto-segment bowel on volumetric MR images by using an interactive multi-region labeling algorithm. Methods: 5 Patients with locally advanced pancreatic cancer underwent fractionated radiotherapy (18–25 fractions each, total 118 fractions) on an MRI-guided radiation therapy system with a 0.35 Tesla magnet and three Co-60 sources. At each fraction, a volumetric MR image of the patient was acquired when the patient was in the treatment position. An interactive two-dimensional multi-region labeling technique based on graph cut solver was applied on several typical MRI images to segment the large bowel and small bowel, followed by a shape based contour interpolation for generating entire bowel contours along all image slices. The resulted contours were compared with the physician’s manual contouring by using metrics of Dice coefficient and Hausdorff distance. Results: Image data sets from the first 5 fractions of each patient were selected (total of 25 image data sets) for the segmentation test. The algorithm segmented the large and small bowel effectively and efficiently. All bowel segments were successfully identified, auto-contoured and matched with manual contours. The time cost by the algorithm for each image slice was within 30 seconds. For large bowel, the calculated Dice coefficients and Hausdorff distances (mean±std) were 0.77±0.07 and 13.13±5.01mm, respectively; for small bowel, the corresponding metrics were 0.73±0.08and 14.15±4.72mm, respectively. Conclusion: The preliminary results demonstrated the potential of the proposed algorithm in auto-segmenting large and small bowel on low field MRI images in MRI-guided adaptive radiation therapy. Further work will be focused on improving its segmentation accuracy and lessening human interaction.

60 APPLIED LIFE SCIENCES↗

Multiscale modelling of evolving foams

We present a set of multi-scale interlinked algorithms to model the dynamics of evolving foams. These algorithms couple the key effects of macroscopic bubble rearrangement, thin film drainage, and membrane rupture. For each of the mechanisms, we construct consistent and accurate algorithms, and couple them together to work across the wide range of space and time scales that occur in foam dynamics. These algorithms include second order finite difference projection methods for computing incompressible fluid flow on the macroscale, second order finite element methods to solve thin film drainage equations in the lamellae and Plateau borders, multiphase Voronoi Implicit Interface Methods to track interconnected membrane boundaries and capture topological changes, and Lagrangian particle methods for conservative liquid redistribution during rearrangement and rupture. We derive a full set of numerical approximations that are coupled via interface jump conditions and flux boundary conditions, and show convergence for the individual mechanisms. We demonstrate our approach by computing a variety of foam dynamics, including coupled evolution of three-dimensional bubble clusters attached to an anchored membrane and collapse of a foam cluster.

97 MATHEMATICS AND COMPUTING↗

DEVELOPING A TRAFFIC SIGNAL ECO-COOPERATIVE ADAPTIVE CRUISE CONTROL SYSTEM FOR BATTERY ELECTRIC VEHICLES

This study developed an eco-driving strategy for battery electric vehicles (BEVs) in the vicinity of signalized intersections, known as BEV Eco-Cooperative Adaptive Cruise Control at Intersections (Eco-CACC-I). The system computes a real-time, energy-optimized vehicle trajectory using a BEV vehicle dynamics and energy consumption model. In the proposed approach, the relationship between vehicle speed, acceleration level, and tractive/resistance forces on the vehicle follows the vehicle dynamics model. The Virginia Tech Comprehensive Power-based Electric Vehicle Energy Consumption Model (VT-CPEM) is used to compute the instantaneous battery energy consumption, with the consideration of battery energy regeneration during braking. The Eco-CACC-I energy-optimum trajectory computation is formulated as an optimization problem with constraints. Considering that the optimization solution needs to be computed at a rapid frequency (e.g., 10 Hz) for real-time applications, an A-star algorithm was used here to expedite the computational speed. Lastly, the proposed BEV Eco-CACC-I system was tested in simulation by considering the impacts of various road grades, speed limits, and signal timings. Simulations for an Internal Combustion Engine Vehicles (ICEVs) was conducted to compare with the BEV test results. The results of the comparison indicate that the energy-optimum solution for BEVs is different from that for ICEVs and thus demonstrating the need for vehicle-tailored optimum trajectories.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗

Real-time fracture monitoring in Engineered Geothermal Systems with seismic waves

As proposed, the main effort in this project is the development of software capable of performing real-time monitoring of micro-seismic activity recorded by an array of sensors deployed around an EGS. The main milestones are defined by the development of software to perform the following tasks: • Real-time micro-earthquake detection and location • Real-time detection of shear-wave splitting • Delayed-time inversion of shear-wave splitting These algorithms, which are discussed in detail in this report, make possible the automatic and real-time monitoring of subsurface fracture systems in geothermal fields from data collected by an array of seismic sensors. Shear wave splitting (SWS) is parameterized in terms of the polarization of the fast shear wave and the time delay between the fast and slow shear waves, which are automatically measured and stored. The measured parameters are then combined with previously measured SWS parameters at the same station and used to invert for the orientation (strike and dip) and intensity of cracks under that station. In addition, this grant allowed the collection of seismic data from several geothermal regions in the US (Coso) and Iceland (Hengill) to use in the development and testing of the software.

15 GEOTHERMAL ENERGY↗

Gyrokinetic simulations of reverse shear Alfven eigenmodes in DIII-D plasmas

A gyrokinetic ion/mass-less fluid electron hybrid model as implemented in the GEM code [Y. Chen and S. E. Parker, J. Comput. Phys. 220, 837 (2007)] is used to study the reverse shear Alfven eigenmodes (RSAE) observed in DIII-D, discharge no. 142111. This is a well diagnosed case with measurement of the core-localized RSAE mode structures and the mode frequency, which can be used to compare with simulations. Simulations reproduce many features of the observation, including the mode frequency up-sweeping in time and the sweeping range. A new algorithmic feature is added to the GEM code for this study. Instead of the gyrokinetic Poisson equation itself, its time derivative, or the vorticity equation, is solved to obtain the electric potential. This permits a numerical scheme that ensures the E Multiplication-Sign B convection of the equilibrium density profiles of each species cancel each other in the absence of any finite-Larmor-radius effects. These nonlinear simulations generally result in an electron temperature fluctuation level that is comparable to measurements, and a mode frequency spectrum broader than the experimental spectrum. The spectral width from simulations can be reduced if less steep beam density profiles are used, but then the experimental fluctuation level can be reproduced only if a collision rate above the classical level is assumed.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

The Zwicky Transient Facility: Surveys and Scheduler

Presented here is a novel algorithm for scheduling the observations of time-domain imaging surveys. Our integer linear programming approach optimizes an observing plan for an entire night by assigning targets to temporal blocks, enabling strict control of the number of exposures obtained per field and minimizing filter changes. A subsequent optimization step minimizes slew times between each observation. Our optimization metric self-consistently weights contributions from time-varying airmass, seeing, and sky brightness to maximize the transient discovery rate. We describe the implementation of this algorithm on the surveys of the Zwicky Transient Facility and present its on-sky performance.

79 ASTRONOMY AND ASTROPHYSICS↗

Oscillator strengths, first-order properties, and nuclear gradients for local ADC(2)

We describe theory and implementation of oscillator strengths, orbital-relaxed first-order properties, and nuclear gradients for the local algebraic diagrammatic construction scheme through second order. The formalism is derived via time-dependent linear response theory based on a second-order unitary coupled cluster model. The implementation presented here is a modification of our previously developed algorithms for Laplace transform based local time-dependent coupled cluster linear response (CC2LR); the local approximations thus are state specific and adaptive. The symmetry of the Jacobian leads to considerable simplifications relative to the local CC2LR method; as a result, a gradient evaluation is about four times less expensive. Test calculations show that in geometry optimizations, usually very similar geometries are obtained as with the local CC2LR method (provided that a second-order method is applicable). As an exemplary application, we performed geometry optimizations on the low-lying singlet states of chlorophyllide a.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Spoofing Cross-Entropy Measure in Boson Sampling

Cross-entropy (XE) measure is a widely used benchmark to demonstrate quantum computational advantage from sampling problems, such as random circuit sampling using superconducting qubits and boson sampling (BS). We present a heuristic classical algorithm that attains a better XE than the current BS experiments in a verifiable regime and is likely to attain a better XE score than the near-future BS experiments in a reasonable running time. The key idea behind the algorithm is that there exist distributions that correlate with the ideal BS probability distribution and that can be efficiently computed. The correlation and the computability of the distribution enable us to postselect heavy outcomes of the ideal probability distribution without computing the ideal probability, which essentially leads to a large XE. Our method scores a better XE than the recent Gaussian BS experiments when implemented at intermediate, verifiable system sizes. Much like current state-of-the-art experiments, we cannot verify that our spoofer works for quantum-advantage-size systems. However, we demonstrate that our approach works for much larger system sizes in fermion sampling, where we can efficiently compute output probabilities. Finally, we provide analytic evidence that the classical algorithm is likely to spoof noisy BS efficiently.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Are Lock-Free Concurrent Algorithms Practically Wait-Free?

Lock-free concurrent algorithms guarantee that some concurrent operation will always make progress in a finite number of steps. Yet programmers prefer to treat concurrent code as if it were wait-free, guaranteeing that all operations always make progress. Unfortunately, designing wait-free algorithms is generally a very complex task, and the resulting algorithms are not always efficient. Although obtaining efficient wait-free algorithms has been a long-time goal for the theory community, most nonblocking commercial code is only lock-free. This article suggests a simple solution to this problem. We show that for a large class of lock-free algorithms, under scheduling conditions that approximate those found in commercial hardware architectures, lock-free algorithms behave as if they are wait-free. In other words, programmers can continue to design simple lock-free algorithms instead of complex wait-free ones, and in practice, they will get wait-free progress. Our main contribution is a new way of analyzing a general class of lock-free algorithms under a stochastic scheduler. Our analysis relates the individual performance of processes to the global performance of the system using Markov chain lifting between a complex per-process chain and a simpler system progress chain. We show that lock-free algorithms are not only wait-free with probability 1 but that in fact a general subset of lock-free algorithms can be closely bounded in terms of the average number of steps required until an operation completes. Here, to the best of our knowledge, this is the first attempt to analyze progress conditions, typically stated in relation to a worst-case adversary, in a stochastic model capturing their expected asymptotic behavior.

97 MATHEMATICS AND COMPUTING↗