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 289 records · Page 16

A Distributed Algorithm for Economic Dispatch Over Time-Varying Directed Networks With Delays

In power system operation, economic dispatch problem (EDP) is designed to minimize the total generation cost while meeting the demand and satisfying generator capacity limits. This paper proposes an algorithm based on the gradient-push method to solve the EDP in a distributed manner over communication networks potentially with time-varying topologies and communication delays. It has been shown that the proposed method is guaranteed to solve the EDP if the time-varying directed communication network is uniformly jointly strongly connected. Moreover, the proposed algorithm is also able to handle arbitrarily large but bounded time delays on communication links. Numerical simulations are used to illustrate and validate the proposed algorithm.

Yang, Tao↗

BISON Framework for the Analysis of Performance of Metallic Fuels

This report documents the completion of the LANL milestone, M3FT-13LA0203123-Complete Final Assessment of Metal Fuel Sensitivity & Validation Data Set. We had made progress toward understanding how to develop a kernel for the zirconium diffusion in the first documentation this summer. The progress was limited but the work had identified several issues with the implementation of the diffusion kernel and the phase diagrams. In this report we have developed potential solutions to those issues. We have worked toward developing a more robust diffusion kernel including better smoothing, meshing, and artificial diffusion flux algorithms. This report summarizes the progress we have made on the development of robust diffusion kernel for BISON. In the current work we used appropriate simple constitutive models and the BISON framework being developed at Idaho National Laboratory (INL) in order to create an initial capability to simulate the behavior of metallic fuel under irradiation. Within the MOOSE/BISON framework a new Zirconium diffusion kernel was implemented that substantially improved the reliability and stability for solving Zirconium migration problems in metallic nuclear fuels. Several benchmark problems were created, including a simple 1-D rod and several 2-D segments of a fuel rod that covered several temperature regimes. The simulations were then compared to results from the code Pedernal, which is a “high-performance solver for coupled, nonlinear heat conduction and multi-component species diffusion". Comparison between the BISON based solver and Pedernal showed exceptional agreement for all benchmark cases. Very small differences appeared at longer time frames (2,000 days) for the hotter fuel simulations; however this is believed to be due, primarily, to the different time-stepping algorithms used in the two codes. Overall the domain of the benchmark covered all components of the U-Pu-Zr phase diagram (alpha, delta, beta and gamma phases) and showed excellent agreement when compared to Pedernal based results.

Nuclear Fuel Cycle & Fuel Materials(11)↗

TH-CD-207A-09: Stay On Target: Dynamic, Patient-Specific Templates of Fiducial Marker Clusters for IGRT

Purpose: Pancreatic SBRT relies on extremely accurate delivery of ablative radiation doses to the target, and intra-fractional tracking of fiducial markers can facilitate improvements in dose delivery. However, this requires algorithms that are able to find fiducial markers with high speed and accuracy. The purpose of this study was to develop a novel marker tracking algorithm that is robust against many of the common errors seen with traditional template matching techniques. Methods: Using CBCT projection images, a method was developed to create detailed template images of fiducial marker clusters without prior knowledge of the number of markers, their positions, or their orientations. Briefly, the method (i) enhances markers in projection images, (ii) stabilizes the cluster’s position, (iii) reconstructs the cluster in 3D, and (iv) precomputes a set of static template images dependent on gantry angle. Furthermore, breathing data were used to produce 4D reconstructions of clusters, yielding dynamic template images dependent on gantry angle and breathing amplitude. To test these two approaches, static and dynamic templates were used to track the motion of marker clusters in more than 66,000 projection images from 75 CBCT scans of 15 pancreatic SBRT patients. Results: For both static and dynamic templates, the new technique was able to locate marker clusters present in projection images 100% of the time. The algorithm was also able to correctly locate markers in several instances where only some of the markers were visible due to insufficient field-of-view. In cases where clusters exhibited deformation and/or rotation during breathing, dynamic templates resulted in cross-correlation scores up to 70% higher than static templates. Conclusion: Patient-specific templates provided complete tracking of fiducial marker clusters in CBCT scans, and dynamic templates helped to provide higher cross-correlation scores for deforming/rotating clusters. This novel algorithm provides an extremely accurate method to detect fiducial markers during treatment. Research funding provided by Varian Medical Systems to Miften and Jones.

60 APPLIED LIFE SCIENCES↗

A Survey of Distributed Optimization

In distributed optimization of multi-agent systems, agents cooperate to minimize a global function which is a sum of local objective functions. Motivated by applications including power systems, sensor networks, smart buildings, and smart manufacturing, various distributed optimization algorithms have been developed. In these algorithms, each agent performs local computation based on its own information and information received from its neighboring agents through the underlying communication network, so that the optimization problem can be solved in a distributed manner. This survey paper aims to offer a detailed overview of existing distributed optimization algorithms and their applications in power systems. More specifically, we first review discrete-time and continuous-time distributed optimization algorithms for undirected graphs. We then discuss how to extend these algorithms in various directions to handle more realistic scenarios. Finally, we focus on the application of distributed optimization in the optimal coordination of distributed energy resources.

Yang, Tao↗

Interactive lung segmentation in abnormal human and animal chest CT scans

Purpose: Many medical image analysis systems require segmentation of the structures of interest as a first step. For scans with gross pathology, automatic segmentation methods may fail. The authors’ aim is to develop a versatile, fast, and reliable interactive system to segment anatomical structures. In this study, this system was used for segmenting lungs in challenging thoracic computed tomography (CT) scans. Methods: In volumetric thoracic CT scans, the chest is segmented and divided into 3D volumes of interest (VOIs), containing voxels with similar densities. These VOIs are automatically labeled as either lung tissue or nonlung tissue. The automatic labeling results can be corrected using an interactive or a supervised interactive approach. When using the supervised interactive system, the user is shown the classification results per slice, whereupon he/she can adjust incorrect labels. The system is retrained continuously, taking the corrections and approvals of the user into account. In this way, the system learns to make a better distinction between lung tissue and nonlung tissue. When using the interactive framework without supervised learning, the user corrects all incorrectly labeled VOIs manually. Both interactive segmentation tools were tested on 32 volumetric CT scans of pigs, mice and humans, containing pulmonary abnormalities. Results: On average, supervised interactive lung segmentation took under 9 min of user interaction. Algorithm computing time was 2 min on average, but can easily be reduced. On average, 2.0% of all VOIs in a scan had to be relabeled. Lung segmentation using the interactive segmentation method took on average 13 min and involved relabeling 3.0% of all VOIs on average. The resulting segmentations correspond well to manual delineations of eight axial slices per scan, with an average Dice similarity coefficient of 0.933. Conclusions: The authors have developed two fast and reliable methods for interactive lung segmentation in challenging chest CT images. Both systems do not require prior knowledge of the scans under consideration and work on a variety of scans.

60 APPLIED LIFE SCIENCES↗

The continuous readout stream of the MicroBooNE liquid argon time projection chamber for detection of supernova burst neutrinos

The MicroBooNE continuous readout stream is a parallel readout of the MicroBooNE liquid argon time projection chamber (LArTPC) which enables detection of non-beam events such as those from a supernova neutrino burst. The low energies of the supernova neutrinos and the intense cosmic-ray background flux due to the near-surface detector location makes triggering on these events very challenging. Instead, MicroBooNE relies on a delayed trigger generated by SNEWS (the Supernova Early Warning System) for detecting supernova neutrinos. The continuous readout of the LArTPC generates large data volumes, and requires the use of real-time compression algorithms (zero suppression and Huffman compression) implemented in an FPGA (field-programmable gate array) in the readout electronics. In this paper we present the results of the optimization of the data reduction algorithms, and their operational performance. To demonstrate the capability of the continuous stream to detect low-energy electrons, a sample of Michel electrons from stopping cosmic-ray muons is reconstructed and compared to a similar sample from the lossless triggered readout stream.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

Radiation-Induced Noise Resilience of Neuromorphic Architectures

Neuromorphic event-based networks use asynchronous time-dependent information to extract features from input data that can allow for edge-based distributed applications such as object recognition. The noise resilience properties of such networks, especially in the context of space applications, are yet to be explored. In this paper, we use the hierarchy of time surfaces (HOTS) algorithm, which is one of the neuromorphic algorithms, to understand the least and most resilient modules in a neuromorphic network. The HOTS algorithm relies on the computing of time surfaces that maps the temporal delays between neighboring pixels into normalized features that involve many computations that are also found in other neuromorphic networks such as exponential decays, distance computations, etcetera. We implemented HOTS on a Digilent PYNQ board with a Xilinx Zynq 7020 system on a chip, and we subjected the boards running the HOTS network inference to neutron radiation at the Los Alamos Neutron Science Center. Furthermore, we used simulation models from our previous similar experiments on the event-based sensor to create a neutron induced noise model to quantify the effect of this noise on the overall performance of the network. This experiment provides the preliminary measurements of the reliability of the HOTS algorithm and proposes methods to create a more reliable HOTS architecture in future spacecraft missions.

Engineering↗

Report on the Economic Optimization of a Demonstration Case for a Static N-R HES Configuration using RAVEN

The synthetic time history generation algorithm in RAVEN has been extensively tested and used to perform qualitative assessments of the statistical characteristics of the net demand vs. demand for different values of the penetration of wind generation. Reported results highlight the need to consider the impact of variable renewable on the electricity net demand profile, due to the increase in its volatility with increased wind penetration. This analysis provides a strong foundation for the modeling and simulation needs expressed under the "Nuclear-Renewable Hybrid Energy Systems" (NRHES) project. Following this confirmative analysis the entire stochastic optimization framework has been tested in a demo case. The case chosen is an optimization driven by profitability for a system composed by a nuclear plant and a hydrogen production industrial process. This type of economical analysis is aimed to assess the capability of a hybrid system to penetrate the current energy market. In this sense it differs from the approach suggested under NRHES, where a cost minimization approach is suggested. This analysis is instead aimed to show the flexibility of the developed framework, e.g. for the evaluation of retrofitting projects of already existing plants. The system considered is subject to variable prices of electricity, which are simulated using the algorithm for the production of synthetic time histories. The physical system is considered without inertia so that it can be replaced by dispatching rules based on the highest marginal profit. Two optimization problems have been considered, for the first the size of the nuclear power plant is fixed and the optimization variable is the capacity of the hydrogen production plant. For the second, both plant sizes are optimization parameters while the overall capital expenditure is caped. The economical figures of merits considered are the Internal Rate of Return (IRR) and/or Profitability Index (PI) for the first one (since no cap is placed on the investment size) and Net Present Value (NPV) and/or IRR for the second one where the capital expenditure is constrained. Economic input data concerning capital costs, size-scaling factors, and operational costs for both plants have been collected from literature in order to achieve a simulation as realistic as possible. More work will be needed to obtain even more realistic numbers, possibly from industrial partners, and considering market elasticity for the hydrogen market. In order to perform the optimization of the cases described above, the economical external RAVEN module (CashFlow) for financial analysis has been improved in flexibility and generality. Some improvements have also been made to the optimization algorithm for a more efficient treatment of the boundary constrains. In conclusion three major results have been obtained: a) collection of the economical parameters characterizing the nuclear power plants and hydrogen production plants, b) extension of the financial analysis module (CashFlow) to drive the calculation of all needed cash flow streams and c) the testing of the full framework in a nearly final configuration.

97 MATHEMATICS AND COMPUTING↗

Numerical simulation of a thermodynamically consistent four‐species tumor growth model

We develop a thermodynamically consistent four‐species model of tumor growth on the basis of the continuum theory of mixtures. Unique to this model is the incorporation of nutrient within the mixture as opposed to being modeled with an auxiliary reaction‐diffusion equation. The formulation involves systems of highly nonlinear partial differential equations of surface effects through diffuse‐interface models. A mixed finite element spatial discretization is developed and implemented to provide numerical results demonstrating the range of solutions this model can produce. A time‐stepping algorithm is then presented for this system, which is shown to be first order accurate and energy gradient stable. The results of an array of numerical experiments are presented, which demonstrate a wide range of solutions produced by various choices of model parameters.

97 MATHEMATICS AND COMPUTING↗

Structure preserving and energy dissipative contact approaches for implicit dynamics

In this work, several structure preserving and energy dissipative contact approaches are proposed and evaluated. The time integration schemes considered are general with regard to the version of constraint type, but here the emphasis was on mortar contact. The proposed mortar contact approach conserves both linear and angular momentum for mortar contact in a novel way. The proposed time integration scheme can conserve energy or provide strict contact dissipation. In addition, the proposed scheme enforces both gap constraints and gap velocity constraints (i.e., persistency). Using a midstep time integrator often causes energy dissipation during initial impact, here this energy can be recovered in a novel way. Enforcing the gap velocity constraint mitigates the contact chatter of the contact pressure and nodes in many problems. Whereas some approaches enforce the persistency condition and gap constraints simultaneously during the solution of the equations of motion (EOM) requiring multipliers for both constraints included in the equation set, here the gap constraint is solved through the equations of motion and the persistency condition is satisfied in the time integration scheme by the velocity update after the equations of motion. It is shown that this approach is strictly dissipative in that a plastic contact condition can be achieved. Analogous to a coefficient of restitution for rigid bodies, any dissipated energy can then be returned upon release if energy conservation is desired. Structure preserving methods are good for long-time dynamics simulations and energy conserving and strictly dissipative methods can overcome stability issues associated with standard time integration algorithms such as the Newmark method.

42 ENGINEERING↗

Tracking and Vertexing with the ATLAS Inner Detector in the LHC Run-2. In: Proceedings of International Conference on Technology and Instrumentation in Particle Physics 2017

Run-2 of the Large Hadron Collider (LHC) has provided new challenges to track and vertex reconstruction with higher centre-of-mass energies and luminosity leading to increasingly high-multiplicity environments, and boosted, highly-collimated physics objects. We present an overview of the ATLAS Inner Detector tracker in Run-2 including the track reconstruction algorithm, time-dependent alignment, tracking and vertexing performance.

ATLAS Inner Detector↗

Search for vector-like T quarks decaying to top quarks and Higgs bosons in the all-hadronic channel using jet substructure

We performed a search for a vector-like heavy T quark that is produced in pairs and that decays to a top quark and a Higgs boson. The data analysed correspond to an integrated luminosity of 19.7 fb -1 collected with the CMS detector in proton-proton collisions at √s=8 TeV. For T quarks with large mass values the top quarks and Higgs bosons can have significant Lorentz boosts, so that their individual decay products often overlap and merge. Methods are applied to resolve the substructure of such merged jets. We also derived upper limits on the production cross section of a T quark with mass between 500 and 1000 GeV/c 2 . If the T quark decays exclusively to tH, the observed (expected) lower limit on the mass of the T quark is 745 (773) GeV/c 2 at 95% confidence level. For the first time an algorithm is used for tagging boosted Higgs bosons that is based on a combination of jet substructure information and b tagging.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Optimized Lie–Trotter–Suzuki decompositions for two and three non-commuting terms

Lie–Trotter–Suzuki decompositions are an efficient way to approximate operator exponentials exp ( t H ) when H is a sum of n (non-commuting) terms which, individually, can be exponentiated easily. They are employed in time-evolution algorithms for tensor network states, digital quantum simulation protocols, path integral methods like quantum Monte Carlo, and splitting methods for symplectic integrators in classical Hamiltonian systems. Here, we provide optimized decompositions up to order t 6 . The leading error term is expanded in nested commutators (Hall bases) and we minimize the 1-norm of the coefficients. For n = 2 terms, several of the optima we find are close to those in McLachlan (1995). Generally, our results substantially improve over unoptimized decompositions by Forest, Ruth, Yoshida, and Suzuki. We explain why these decompositions are sufficient to efficiently simulate any one- or two-dimensional lattice model with finite-range interactions. This follows by solving a partitioning problem for the interaction graph.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

TORBEAM 2.0, a paraxial beam tracing code for electron-cyclotron beams in fusion plasmas for extended physics applications

The paraxial WKB code TORBEAM (Poli, 2001) is widely used for the description of electron-cyclotron waves in fusion plasmas, retaining diffraction effects through the solution of a set of ordinary differential equations. With respect to its original form, the code has undergone significant transformations and extensions, in terms of both the physical model and the spectrum of applications. The code has been rewritten in Fortran 90 and transformed into a library, which can be called from within different (not necessarily Fortran-based) workflows. The models for both absorption and current drive have been extended, including e.g. fully-relativistic calculation of the absorption coefficient, momentum conservation in electron–electron collisions and the contribution of more than one harmonic to current drive. The code can be run also for reflectometry applications, with relativistic corrections for the electron mass. Formulas that provide the coupling between the reflected beam and the receiver have been developed. Accelerated versions of the code are available, with the reduced physics goal of inferring the location of maximum absorption (including or not the total driven current) for a given setting of the launcher mirrors. Optionally, plasma volumes within given flux surfaces and corresponding values of minimum and maximum magnetic field can be provided externally to speed up the calculation of full driven-current profiles. These can then be employed in real-time control algorithms or for fast data analysis.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Development of a River Dynamical Core for E3SM to simulate compound flooding on Exascale-class heterogeneous supercomputers

Flooding events pose significant risk to human life, property, and infrastructure. Physically-consistent quantification of altered flood risks in global models requires hyper-resolution (~1 km) or fine flood simulations using two-dimensional (2D) physics schemes, both of which are unavailable in the current generation Earth System Models. Here, in this work, we have developed the River Dynamical Core (RDycore), which is an open-source, 2D shallow water equation (SWE) library for the U.S. Department of Energy's Energy Exascale Earth System Model (E3SM). RDycore uses PETSc and libCEED libraries that allows it to run efficiently on CPUs and GPUs, as well as select a time-integration algorithm at runtime without requiring any code modifications. RDycore achieves spatial error convergence rates for problems with analytical and manufactured solutions similar to those reported previously in the literature, or consistent with the implemented first-order spatial discretization scheme. RDycore's accuracy in predicting flooding for a well-studied dam break problem is comparable to existing SWE models. For a problem with 471 million grid cells, RDycore achieves a speedup of 6.6x and 7.6x on GPUs compared to CPUs when using 320 compute nodes on DOE's Perlmutter and Frontier supercomputers, respectively. The one-way coupling of the RDycore library within E3SM is demonstrated by performing multiple 5-day flooding simulations during Hurricane Harvey driven by five precipitation datasets. The E3SM--RDycore simulations at 30 m spatial resolution accurately simulate maximum water height during the hurricane when benchmarked against a previously published study and achieve a speedup of 15x (Perlmutter) and 21x (Frontier) on GPUs relative to CPUs. The work presented here is the foundational step in providing hardware and algorithmic portability framework for simulating kilometer-scale river dynamics within E3SM.

Flood Simulation↗

Finite element formulation of fluctuating hydrodynamics for fluids filled with rigid particles using boundary fitted meshes

In this paper, we present a finite element implementation of fluctuating hydrodynamics with a moving boundary fitted mesh for treating the suspended particles. The thermal fluctuations are incorporated into the continuum equations using the Landau and Lifshitz approach [1]. The proposed implementation fulfills the fluctuation–dissipation theorem exactly at the discrete level. Since we restrict the equations to the creeping flow case, this takes the form of a relation between the diffusion coefficient matrix and friction matrix both at the particle and nodal level of the finite elements. Brownian motion of arbitrarily shaped particles in complex confinements can be considered within the present formulation. A multi-step time integration scheme is developed to correctly capture the drift term required in the stochastic differential equation (SDE) describing the evolution of the positions of the particles. The proposed approach is validated by simulating the Brownian motion of a sphere between two parallel plates and the motion of a spherical particle in a cylindrical cavity. The time integration algorithm and the fluctuating hydrodynamics implementation are then applied to study the diffusion and the equilibrium probability distribution of a confined circle under an external harmonic potential.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

A novel partitioning method for block-structured adaptive meshes

We propose a novel partitioning method for block-structured adaptive meshes utilizing the meshless Lagrangian particle concept. With the observation that an optimum partitioning has high analogy to the relaxation of a multi-phase fluid to steady state, physically motivated model equations are developed to characterize the background mesh topology and are solved by multi-phase smoothed-particle hydrodynamics. In contrast to well established partitioning approaches, all optimization objectives are implicitly incorporated and achieved during the particle relaxation to stationary state. Distinct partitioning sub-domains are represented by colored particles and separated by a sharp interface with a surface tension model. In order to obtain the particle relaxation, special viscous and skin friction models, coupled with a tailored time integration algorithm are proposed. Numerical experiments show that the present method has several important properties: generation of approximately equal-sized partitions without dependence on the mesh-element type, optimized interface communication between distinct partitioning sub-domains, continuous domain decomposition which is physically localized and implicitly incremental. Therefore it is particularly suitable for load-balancing of high-performance CFD simulations.

97 MATHEMATICS AND COMPUTING↗