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 595 records · Page 33

An Efficient Parallel-in-Time Method for Optimization with Parabolic PDEs

To solve optimization problems with parabolic PDE constraints, often methods working on the reduced objective functional are used. They are computationally expensive due to the necessity of solving both the state equation and a backward-in-time adjoint equation to evaluate the reduced gradient in each iteration of the optimization method. In this study, we investigate the use of the parallel-in-time method PFASST in the setting of PDE-constrained optimization. In order to develop an efficient fully time-parallel algorithm, we discuss different options for applying PFASST to adjoint gradient computation, including the possibility of doing PFASST iterations on both the state and the adjoint equations simultaneously. Here, we also explore the additional gains in efficiency from reusing information from previous optimization iterations when solving each equation. Numerical results for both a linear and a nonlinear reaction-diffusion optimal control problem demonstrate the parallel speedup and efficiency of different approaches.

97 MATHEMATICS AND COMPUTING↗

Real-Time Artificial Intelligence for Particle Reconstruction and Higgs Physics

With the discovery of the Higgs boson at the CERN LHC, the world's highest-energy particle accelerator complex, scientists have acquired an important tool to study the fundamental building blocks of the universe. Precision measurements of Higgs bosons produced with large momentum allow for unique insights into the structure of the interactions of the Higgs boson with other particles that may shed light on physics beyond the standard model. While experimentally challenging, exploring such interactions with novel artificial intelligence (AI) methods can advance our understanding of the Higgs sector, including the Higgs boson's self-interaction. Moreover, the LHC is undergoing a major upgrade to further increase its particle collision rate and thereby operate for an additional decade. The experimental detectors at the upgraded facility must process at least a factor of ten more data at rates of hundreds of terabytes per second all under challenging conditions. New AI techniques are required to reconstruct and select, or trigger on, the most physics-sensitive events in real-time to handle the resulting avalanche of data. The proposed research will achieve the goals of the LHC program at the CMS experiment by developing a sub-microsecond event reconstruction system using real-time AI algorithms that employ field-programmable gate array technologies. By harnessing sophisticated AI techniques, this research focuses on measuring the production of Higgs bosons at large momentum while enhancing particle reconstruction methods in the trigger and beyond. Overall, the proposed research has broader implications for the use of AI in resource-constrained, low-latency embedded applications across all fields of science.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

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↗

UFLIC: A Line Integral Convolution Algorithm for Visualizing Unsteady Flows

This paper presents an algorithm, UFLIC (Unsteady Flow LIC), to visualize vector data in unsteady flow fields. Using the Line Integral Convolution (LIC) as the underlying method, a new convolution algorithm is proposed that can effectively trace the flow's global features over time. The new algorithm consists of a time-accurate value depositing scheme and a successive feed-forward method. The value depositing scheme accurately models the flow advection, and the successive feed-forward method maintains the coherence between animation frames. Our new algorithm can produce time-accurate, highly coherent flow animations to highlight global features in unsteady flow fields. CFD scientists, for the first time, are able to visualize unsteady surface flows using our algorithm.

Shen, Han-Wei↗

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↗

A Real-Time MODIS Vegetation Composite for Land Surface Models and Short-Term Forecasting

The NASA Short-term Prediction Research and Transition (SPoRT) Center is producing real-time, 1- km resolution Normalized Difference Vegetation Index (NDVI) gridded composites over a Continental U.S. domain. These composites are updated daily based on swath data from the Moderate Resolution Imaging Spectroradiometer (MODIS) sensor aboard the polar orbiting NASA Aqua and Terra satellites, with a product time lag of about one day. A simple time-weighting algorithm is applied to the NDVI swath data that queries the previous 20 days of data to ensure a continuous grid of data populated at all pixels. The daily composites exhibited good continuity both spatially and temporally during June and July 2010. The composites also nicely depicted high greenness anomalies that resulted from significant rainfall over southwestern Texas, Mexico, and New Mexico during July due to early-season tropical cyclone activity. The SPoRT Center is in the process of computing greenness vegetation fraction (GVF) composites from the MODIS NDVI data at the same spatial and temporal resolution for use in the NASA Land Information System (LIS). The new daily GVF dataset would replace the monthly climatological GVF database (based on Advanced Very High Resolution Radiometer [AVHRR] observations from 1992-93) currently available to the Noah land surface model (LSM) in both LIS and the public version of the Weather Research and Forecasting (WRF) model. The much higher spatial resolution (1 km versus 0.15 degree) and daily updates based on real-time satellite observations have the capability to greatly improve the simulation of the surface energy budget in the Noah LSM within LIS and WRF. Once code is developed in LIS to incorporate the daily updated GVFs, the SPoRT Center will conduct simulation sensitivity experiments to quantify the impacts and improvements realized by the MODIS real-time GVF data. This presentation will describe the methodology used to develop the 1-km MODIS NDVI composites and show sample output from summer 2010, compare the MODIS GVF data to the AVHRR monthly climatology, and illustrate the sensitivity of the Noah LSM within LIS and/or the coupled LIS/WRF system to the new MODIS GVF dataset.

Case, Jonathan L.↗

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↗

Numerical inverse Laplace transformation for determining the system response of linear systems in the time domain

An algorithm is described that is based on the method of breaking the Laplace transform down into partial fractions which are then inverse-transformed separately. The sum of the resulting partial functions is the wanted time function. Any problems caused by equation system forms are largely limited by appropriate normalization using an auxiliary parameter. The practical limits of program application are reached when the degree of the denominator of the Laplace transform is seven to eight.

Friedrich, R.↗

Development and test results of a flight management algorithm for fuel conservative descents in a time-based metered traffic environment

A simple flight management descent algorithm designed to improve the accuracy of delivering an airplane in a fuel-conservative manner to a metering fix at a time designated by air traffic control was developed and flight tested. This algorithm provides a three dimensional path with terminal area time constraints (four dimensional) for an airplane to make an idle thrust, clean configured (landing gear up, flaps zero, and speed brakes retracted) descent to arrive at the metering fix at a predetermined time, altitude, and airspeed. The descent path was calculated for a constant Mach/airspeed schedule from linear approximations of airplane performance with considerations given for gross weight, wind, and nonstandard pressure and temperature effects. The flight management descent algorithm is described. The results of the flight tests flown with the Terminal Configured Vehicle airplane are presented.

Knox, C. E.↗

Lightning Strike Distance Distribution Beyond a Preexisting Lightning Area

The 45th Weather Squadron (45 WS) asked the Applied Meteorology Unit (AMU) to review the 30-year-old, lightning stand-off distances of 5 nautical miles (nmi) for applicability to today's operations. This was based on the realization that previous lightning strike distance studies did not match how 45 WS issues lightning warnings (Roeder, 2008). The previous lightning distance studies were from the point of origin of the lightning or the average starting location that would tend to be in the core of the thunderstorm. However, the 45 WS issues lightning warnings based on the edge of a preexisting lightning area. Before beginning the AMU project, it took several years to develop a method to calculate a distance distribution beyond a preexisting area (Roeder, 2015). The AMU pulled Lightning Detection and Ranging (LDAR) sensor data from 1/1/2013 to 12/31/2013. This dataset consisted of 37 million individual source data points from the LDAR sensors. Only sources within 50 km north, south, east or west of the LDAR grid center were included in the dataset. This limited the use of LDAR data to that with the greatest accuracy of source detection and increased data processing. Points were grouped into flashes based on spatial and temporal criteria. Based on the sensitivity analysis the AMU performed on the flash clustering algorithm, a time value of 0.3 seconds was found to model flashes adequately. Distance parameters were tested from 1,500 to 7,500 meters (m) in 500 m increments. Distance parameters of both 3,000 m and 4,000 m produced results in the plotting tool that were most representative of the physical behavior of lightning. Thus statistics were gathered for the most representative of these spatial and temporal criteria on the flash size and the polygon expansion distance in order to find the correct data distributions. The best fit curves for the LDAR polygon expansion frequency vs. distances for both the 3 kilometer (km) and 4 km distance threshold values were exponential decay functions and had R2 values of > 0.998, indicating good model fits. The equations of the best fit curves were then used to calculate a desired safety radius of 4 nmi for either 3 km or 4 km distance threshold criteria. The AMU analysis concludes the safe reduction of the 5 nmi lightning warning circles to 4 nmi should improve the operational impact by 36% if based on distance from the center of the property area being protected. If based on the edge of the property being protected, then the reduction is 4.5 nmi to 4 nmi and the operational impact is decreased by 21%. For the 6 nmi lightning warning circles, the recommended 4 nmi stand-off distance will result in a safe reduction of operational impact of 31% if based on the center of the area being protected, or 16% if based on the edge of the property.

Flash clustering algorithm↗

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↗