Search NASA⌕ Search

SEARCH · Search NASA

Results for “algorithm”

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 505 records · Page 28
All sourcesNASA NTRSDOE OSTI
NASA NTRS2014

Evaluation of Temporal Spacing Errors Associated with Interval Management Algorithms

This paper seeks to characterize the temporal spacing errors resulting from the use of Interval Management (IM) algorithms. The focus of the current paper is IM concepts and algorithms that realize a specified temporal spacing between a Target aircraft and an Ownship aircraft at the runway threshold. The paper presents an IM algorithm consisting of the following four modules: (i) Target-Landing-Time Estimation Module, (ii) Ownship-Landing-Time Estimation Module, (iii) Ownship Speed Command Computation Module, and (iv) Ownship Thrust Command Computation Module. The overall guidance module is evaluated on a simulation that models aircraft point-mass dynamics, bank-angle auto-pilot dynamics, pitch-axis auto-pilot dynamics, and engine lag dynamics. The simulation environment also consists of actual atmospheric forecasts and realistic spatio-temporally correlated wind uncertainty models. Results obtained from single case simulation as well as Monte-Carlo simulations are presented in the paper. The modeled scenario consisted of an A320 Target equipped with “Lateral Navigation”/“Vertical Navigation” (LNAV/VNAV) capabilities followed by an A320 Ownship equipped with the IM algorithm. Both aircraft fly the BIGSUR route to SFO airport using a RAP-13 1-hr wind forecast. 500 Monte-Carlo simulations were conducted with realistic wind uncertainty models. The IM algorithm for this case is seen to have a 90% probability landing time error range of 5.9 seconds, compared to the no-IM solution, which has a 90% probability landing time error range of 33.4 seconds.

Bai, Xiaoli↗
NASA NTRS2019

Inversion of Multiangular Polarimetric Measurements Over Open and Coastal Ocean Waters: A Joint Retrieval Algorithm for Aerosol and Water-Leaving Radiance Properties

Ocean color remote sensing is a challenging task over coastal waters due to the complex optical properties of aerosols and hydrosols. In order to conduct accurate atmospheric correction, we previously implemented a joint retrieval algorithm, hereafter referred to as the Multi-Angular Polarimetric Ocean coLor (MAPOL) algorithm, to obtain the aerosol and water-leaving signal simultaneously. The MAPOL algorithm has been validated with synthetic data generated by a vector radiative transfer model, and good retrieval performance has been demonstrated in terms of both aerosol and ocean water optical properties (Gao et al., 2018). In this work we applied the algorithm to airborne polarimetric measurements from the Research Scanning Polarimeter (RSP) over both open and coastal ocean waters acquired in two field campaigns: the Ship-Aircraft Bio-Optical Research (SABOR) in 2014 and the North Atlantic Aerosols and Marine Ecosystems Study (NAAMES) in 2015 and 2016. Two different yet related bio-optical models are designed for ocean water properties. One model aligns with traditional open ocean water bio-optical models that parameterize the ocean optical properties in terms of the concentration of chlorophyll a. The other is a generalized bio-optical model for coastal waters that includes seven free parameters to describe the absorption and scattering by phytoplankton, colored dissolved organic matter, and nonalgal particles. The retrieval errors of both aerosol optical depth and the water-leaving radiance are evaluated. Through the comparisons with ocean color data products from both in situ measurements and the Moderate Resolution Imaging Spectroradiometer (MODIS), and the aerosol product from both the High Spectral Resolution Lidar (HSRL) and the Aerosol Robotic Network (AERONET), the MAPOL algorithm demonstrates both flexibility and accuracy in retrieving aerosol and water-leaving radiance properties under various aerosol and ocean water conditions.

Gao, Meng↗
NASA NTRS2019

Extending XBAER Algorithm to Aerosol and Cloud Condition

The retrieval of cloud optical properties for aerosol contaminated water cloud is challenging because of the complexity of physical processes in such situations. Conventionally, cloud optical data products are typically derived, ignoring the aerosol impacts on radiative transfer in the retrieval process. This is potentially a significant source of error. In this paper, the eXtensible Bremen Aerosol Retrieval (XBAER) algorithm has been optimized for the retrieval of aerosol/cloud properties for the aerosol contaminated cloud (ACC) scenarios. This version of XBAER delivers cloud optical thickness (COT) and cloud effective radius (CER) for ACCs and simultaneously retrieves aerosol optical thickness (AOT). The surface parameterization and aerosol types used in the standard XBAER algorithm have been adapted in this retrieval to account for the ACC conditions. Aerosol types in XBAER for the retrieval of ACC scenarios have been parameterized to comprise weak and strong absorptions. The comparisons of COT, CER, and AOT retrieved using this adapted XBAER algorithm and two new NASA algorithms show good agreements, especially for biomass burning aerosol. The correlation coefficients are >0.9 for AOT, ~0.8 for CER, and ~0.7 for COT. There is also a good agreement for dust plume contaminated cloud scene. The XBAER derived AOT values for dust aerosols are systematically smaller than the NASA retrieval, but both products have the same spatial distribution patterns. The comparison of COT retrieved using the adapted XBAER algorithm and that retrieved from ground-based microwave radiometer (MWR) measurements shows much better agreement for ACC conditions with high AOT.

satellite↗
NASA NTRS2020

The Dark Target Algorithm for Observing the Global Aerosol System: Past, Present and Future

The Dark Target aerosol algorithm was developed to exploit the information content available from the observations of Moderate-Resolution Imaging Spectroradiometers (MODIS), to better characterize the global aerosol system. The algorithm is based on measurements of the light scattered by aerosols toward a space-borne sensor against the backdrop of relatively dark Earth scenes, thus giving rise to the name “Dark Target”. Development required nearly a decade of research that included application of MODIS airborne simulators to provide test beds for proto-algorithms and analysis of existing data to form realistic assumptions to constrain surface reflectance and aerosol optical properties. This research in itself played a significant role in expanding our understanding of aerosol properties, even before Terra MODIS launch. Contributing to that understanding were the observations and retrievals of the growing Aerosol Robotic Network (AERONET) of sun-sky radiometers, which has walked hand-in-hand with MODIS and the development of other aerosol algorithms, providing validation of the satellite-retrieved products after launch. The MODIS Dark Target products prompted advances in Earth science and applications across subdisciplines such as climate, transport of aerosols, air quality, and data assimilation systems. Then, as the Terra and Aqua MODIS sensors aged, the challenge was to monitor the effects of calibration drifts on the aerosol products and to differentiate physical trends in the aerosol system from artefacts introduced by instrument characterization. Our intention is to continue to adapt and apply the well-vetted Dark Target algorithms to new instruments, including both polar-orbiting and geosynchronous sensors. The goal is to produce an uninterrupted time series of an aerosol climate data record that begins at the dawn of the 21st century and continues indefinitely into the future.

Aerosol↗
NASA NTRSDate not supplied

NASA and Blue Origin Collaborative Assessment of Precision Landing Algorithms and Computing

NASA’s Safe and Precise Landing Integrated Capabilities Evolution (SPLICE) project is developing sensor, algorithm, and compute technologies for precision landing and hazard avoidance. These technologies are being tested as an integrated Precision Landing and Hazard Avoidance (PL&HA) system on Blue Origin’s New Shephard suborbital vehicle. A key goal for the computing element of this technology development is to characterize the performance of the SPLICE software workloads on the project’s Descent and Landing Computer (DLC). The DLC is a multi-core processor designed as a surrogate for NASA’s High-Performance Space Computer (HPSC). Measurements of the SPLICE workload performance on the DLC provides NASA insight on how PL&HA capabilities will perform on the HPSC, and guidance on how the SPLICE algorithms can be implemented to best utilize the DLC platform. This insight can also be used to derive requirements to guide trade studies on candidate computing architectures, for use on platforms like Blue Moon. NASA and Blue Origin are collaborating under an agreement to pursue this mutual benefit. Performance metrics collected are based on measurement of common compute resources such as percentage used of memory bandwidth, I/O utilization, interrupt latency, and kernel vs. user space code residency. Where possible existing performance counters and metrics that are part of the operating system kernel are used. As the design has a significant FPGA component, performance counters are identified and instantiated in the fabric to measure DMA performance and interface metrics. Collection of metrics is performed on the DLC with a representative workload that simulates a full landing cycle of the Blue Origin New Shepard vehicle. Consideration is given to the other compute implementations and whether they can run SPLICE algorithms at the same rate and with the same latency as the DLC. One option being considered is the use of a RISC-V soft core instantiated in a radiation resilient FPGA fabric such as the Xilinx KU60. Select algorithms from the SPLICE code will be run for comparison with the DLC. This paper describes how the DLC is instrumented to collect performance measurements of the SPLICE workloads, preliminary results from these measurements, and their implications on SPLICE algorithm implementation. The results of experimentation to derive candidate requirements for architecture trades on a PL&HA computing system are also presented.

computer performance↗
NASA NTRS2007

Some algorithms for polygons on a sphere.

A limited search for polygon algorithms for use in a new military training simulation that interfaces with several others produced only planar algorithms. To avoid having to implement several different sophisticated map projections to guarantee compatibility with all the other simulations, we opted to develop algorithms that work directly on a sphere. The first is an algorithm to compute the area of a polygon whose edges are segments of great circles. Since our model represents certain object locations as mathematical points, the second topic is whether a specified point is inside a specified polygon. Possibly pathological cases are identified and eliminated. When we realized that most political boundaries are actually rhumb lines, use of the Mercator projection equations seemed unavoidable. We then reasoned that if all the edges were short enough, lat-lon lines, great circle segments, and rhumb lines would be close enough to being identical that we could use whichever was most convenient. Thence, we looked at the relationship between the maximum distances between great circle segments and rhumb lines and between lat-lon lines and rhumb lines as functions of length, azimuth, and latitude. The final algorithm finds the area overlapped by two polygons. Again, potentially pathological cases are identified and eliminated.

Duquette, William H.↗
NASA NTRS2019

An Automatic Light Rain Detection Algorithm on NASA MPLNET Lidar Observations in the Frame of WMO GALION Project

The water cycle strongly influences life on Earth. In particular, the precipitation modifies the atmospheric column thermodynamics through the process of evaporation and serves as a proxy for latent heat modulation. For this reason, a correct precipitation parameterization (especially low-intensity precipitation) at global scale, bedsides improving our understanding of the hydrological cycle, it is crucial to reduce the associated uncertainty of the global climate models to correctly forecast future scenarios, i.e. to apply fast mitigation strategies. In this study we developed an algorithm to automatically detect precipitation from lidar measurements obtained by the National and Aeronautics Space Administration (NASA) Micropulse lidar network (MPLNET) permanent observational site in Goddard. The algorithm, once full operational, will deliver in Near Real Time (latency 1.5h) a new rain mask product that will be publicly available on MPLNET website as part of the new Version 3 Level 1.5 data. The methodology, based on an image processing technique, can detect only light precipitation events (defined by intensity and duration) as the morphological filters used through the detection process are applied on the lidar volume depolarization ratio range corrected composite images, i.e. heavy rain events are unusable as the lidar signal is completely extinguished after few meters in the precipitation or no signal detected because of the water accumulated on the receiver optics. Results from the algorithm, besides filling a gap in precipitation and virga detection by radars, are of particular interest for the scientific community because will help to better understand long-term aerosol-cloud interactions and aerosol atmospheric removal (scavenging effect) by rain as multi-year database being available for several MPLNET permanent observational sites across the globe. Moreover, we developed the automatic algorithm at Universitat Politecnica de Catalunya (UPC) Barcelona, the unique permanent observation station member of MPLNET and the European Aerosol Lidar Network (EARLINET) In the future the algorithm can be then easily applied to any other lidar and/or ceilometer network infrastructure in the frame of World Meteorological Organization (WMO) Global Aerosol Watch (GAW) aerosol lidar observation network (GALION)

Simone Lolli↗
NASA NTRS2019

Overview of the New Version 3 NASA Micro-Pulse Lidar Network (MPLNET) Automatic Precipitation Detection Algorithm

Precipitation modifies atmospheric column thermodynamics through the process of evaporation and serves as a proxy for latent heat modulation. For this reason, a correct precipitation parameterization (especially for low-intensity precipitation) within global scale models is crucial. In addition to improving our modeling of the hydrological cycle, this will reduce the associated uncertainty of global climate models in correctly forecasting future scenarios, and will enable the application of mitigation strategies. In this manuscript we present a proof of concept algorithm to automatically detect precipitation from lidar measurements obtained from the National Aeronautics and Space Administration Micropulse lidar network (MPLNET). The algorithm, once tested and validated against other remote sensing instruments, will be operationally implemented into the network to deliver a near real time (latency <1.5 h) rain masking variable that will be publicly available on MPLNET website as part of the new Version 3 data products. The methodology, based on an image processing technique, detects only light precipitation events (defined by intensity and duration) such as light rain, drizzle, and virga. During heavy rain events, the lidar signal is completely extinguished after a few meters in the precipitation or it is unusable because of water accumulated on the receiver optics. Results from the algorithm, in addition to filling a gap in light rain, drizzle, and virga detection by radars, are of particular interest for the scientific community as they help to fully characterize the aerosol cycle, from emission to deposition, as precipitation is a crucial meteorological phenomenon accelerating atmospheric aerosol removal through the scavenging effect. Algorithm results will also help the understanding of long term aerosol–cloud interactions, exploiting the multi-year database from several MPLNET permanent observational sites across the globe. The algorithm is also applicable to other lidar and/or ceilometer network infrastructures in the framework of the Global Aerosol Watch (GAW) aerosol lidar observation network (GALION).

Simone Lolli↗
NASA NTRS2021

Status of the Moderate-resolution Imaging Spectroradiometer Level 1B Algorithm

The Moderate-resolution Imaging Spectroradiometer (MODIS) instruments are on-board the Aqua and Terra spacecraft, launched in 2002 and 1999, respectively. Since beginning operation, they have continued to collect valuable remote sensing data of the Earth in 36 spectral bands ranging in wavelengths from 0.41 to 14.5 μm. The Level 1B (L1B) algorithm produces calibrated top of the atmosphere (TOA) radiances for each Earth-view (EV) pixel and calibrated TOA reflectances for the reflective solar bands using geo-located, uncalibrated instrument data and calibration look up tables (LUTs) produced regularly by the MODIS Characterization Support Team (MCST). The L1B algorithm also calculates an uncertainty value for each EV pixel. The calibrated radiance and reflectance products are used to generate higher-level science products. A separate L1B code version is maintained for both MODIS instruments so that sensor specific issues can be handled individually. The current L1B algorithm version produces the Collection 6.1 (C6.1) products and was released in 2017. An overview of the C6.1 algorithm is provided together with improvements made since its release. Also discussed briefly are the planned improvements in the Collection 7 L1B algorithm.

MODIS↗
NASA NTRS2021

One- and Two-Band Sensors and Algorithms to Derive aCDOM(440) from Global Above- and In-Water Optical Observations

The colored (or chromophoric, depending on the literature) dissolved organic matter (CDOM) spectral absorption coefficient, aCDOM(λ), is a variable of global interest that has broad application in the study of biogeochemical processes. Within the funding for scientific research, there is an overarching trend towards increasing the scale of observations both temporally and spatially, while simultaneously reducing the cost per sample, driving a systemic shift towards autonomous sensors and observations. Legacy aCDOM(λ) measurement techniques can be cost-prohibitive and do not lend themselves toward autonomous systems. Spectrally rich datasets carefully collected with advanced optical systems in diverse locations that span a global range of water bodies, in conjunction with appropriate quality assurance and processing, allow for the analysis of methods and algorithms to estimate aCDOM(440) from spectrally constrained one- and two-band subsets of the data. The resulting algorithms were evaluated with respect to established fit-for-purpose criteria as well as quality assured archival data. Existing and proposed optical sensors capable of exploiting the algorithms and intended for autonomous platforms are identified and discussed. One-band in-water algorithms and two-band above-water algorithms showed the most promise for practical use (accuracy of 3.0% and 6.5%, respectively), with the latter demonstrated for an airborne dataset.

ocean color↗
NASA NTRSDate not supplied

Path-Adaptive Guidance Algorithm Trades for a Two-Stage Lunar Descent Vehicle

For the next generation of NASA’s missions, explicit, path-adaptive descent guidance algorithms must provide the stability and customizability required for a safe and efficient descent to the lunar surface, while also meeting program and vehicle constraints. Several descent algorithms have been flown and tested for single-stage landers through the Apollo and Altair programs, but thus far little analysis has been conducted involving the application of these algorithms to a two-stage descent vehicle. Due to payload mass and fairing constraints of the existing fleet of launch vehicles, multi-stage descent architectures are a unique option for achieving the greatest possible mass to lunar surface. This paper seeks to compare the performance of guidance configurations of a lunar lander system consisting of two stages, one of which separates partway through descent. Through development of this paper, an optimization suite has been written that is specifically designed for optimizing planetary non-atmospheric two-stage descent trajectories, and is used as a baseline to compare the guidance algorithms tested. Time-to-go computational methods and ignition logic routines that may be employed in a lunar environment are also discussed. Preliminary results are presented that show relative performance metrics for a range of different guidance algorithm configurations.

Jason M Everett↗
NASA NTRSDate not supplied

Performance and Accuracy Assessment of Line Marching Algorithm Computations Utilizing GPUs Within a Predictive GNSS Quality Service

This paper presents a detailed analysis of the accuracy and performance of line marching algorithms executing on a GPU. In the context of an accurate Global Navigation Satellite System(GNSS) quality of service simulation, horizon sky-plots are a useful tool to determine satellite visibility in the presence of obstructions from objects, such as buildings or dense foliage. In order to accurately model satellite visibility at a point of interest on a map, a horizon plot can identify the viewing angles at which objects are blocking the sky. This computation requires traversing a line starting at the point of interest on a 2D altitude map, moving outward for every azimuth angle. To explore the performance of this computation, we propose a new dynamic stopping condition for the traversal of the line, benefiting from objects close to the point of interest. We compare the accuracy of common line marching algorithms, and consider their parallel performance when developed in CUDA. We find that our proposed stopping condition for line marching provides a significant improvement in performance in urban canyon sky-plots, as compared to previous work. Additionally, these results show that simpler algorithms, such as the digital differential analyzer line algorithm, are better suited for GPUs than more sophisticated schemes such as Bresenham’s algorithm, specifically in the context of sky-plothorizon computations. The trade-off between accuracy and performance is analyzed and providing guidance that depends on the targeted goal of the GNSS application.

GNSS↗
NASA NTRSDate not supplied

Implementation of a Six Degree of Freedom Precision Lunar Landing Algorithm Using Dual Quaternion Representation

In this study, a powered descent guidance algorithm using a unit dual quaternion represen- tation of the vehicle dynamics is implemented in a high-fidelity simulation and on representative flight hardware. This Dual-Quaternion Guidance (DQG) algorithm is applied to the precision lunar landing problem which levies complex constraints upon the trajectory, including state triggered attitude constraints to enable terrain-relative navigation and hazard detection as well as real-time requirements for landing site re-designation. The investigation explores DQG’s usefulness as a mission design tool as well as a real-time guidance algorithm and defines real-time performance requirements for the hazard detection and avoidance (HDA) re-targeting phase of precision lunar landing. The experiment is presented in two parts. First, DQG is implemented within a high-fidelity Monte Carlo simulation to tune the algorithm’s parameters for the simulated vehicle, to refine the mission design, and to develop guidance update timing requirements to perform the HDA maneuver. DQG generates trajectories online for the divert which are tracked by the vehicle’s inner-loop controllers to the targeted landing site. Second, DQG is run on representative hardware to demonstrate real-time operation through a divert maneuver. These results allow for rapid, flexible, optimal mission design satisfying complex constraints, and for the definition of real-time performance requirements for the HDA operations inherent in precision lunar landing. The HDA divert maneuver is found to require guidance trajectory updates in less than three seconds. DQG is found to be too slow to meet this update timing on the descent and landing computer (DLC) in its current implementation. DQG running on alternative hardware can meet the update rate requirement. Algorithm implementation improvements are also recommended which are expected to speed up computation sufficiently to meet requirements on the DLC.

GN&C↗
NASA NTRS2020

ICESat 2/ATLAS Onboard Flight Science Receiver Algorithms: Purpose, Process, and Performance

The Advanced Topographic Laser Altimetry System (ATLAS) is the sole instrument on the Ice, Cloud, and land Elevation Satellite 2 (ICESat-2). Without some method of reducing the transmitted data, the volume of ATLAS telemetry would far exceed the normal X-band downlink capability or require many more ground station contacts. The ATLAS Onboard Flight Science Receiver Algorithms (hereinafter Receiver Algorithms or Algorithms) control the amount of science data that is telemetered from the instrument, limiting the data volume by distinguishing surface echoes from background noise, and allowing the instrument to telemeter data from only a small vertical region about the signal. This is accomplished through the transfer of the spacecraft's location and attitude to the instrument every second, use of an onboard Digital Elevation Model, implementation of signal processing techniques, and use of onboard relief and surface type reference maps. Extensive ground testing verified the performance of the Algorithms. On-orbit analysis shows that the Algorithms are working as expected from the ground testing; they are performing well and meeting the mission requirements.

Algoritms, Signal Processing, Optimization, Flight↗
NASA NTRSDate not supplied

Self-consistent Quantum Iteratively Sparsified Hamiltonian Algorithm (SQuISH)

Due to coherence time limitations, reducing the resources required to run quantum algorithms and simulate physical systems on a quantum computer is crucial. With regards to Hamiltonian simulation, a significant effort has focused on building efficient algorithms using various factorizations and truncations, typically derived from the Hamiltonian alone. We introduce a new paradigm for improving Hamiltonian simulation and reducing the cost of ground state problems based on ideas recently developed for classical chemistry simulations. The key idea is that one can find efficient ways to reduce resources needed by quantum algorithms by making use of two key pieces of information: the Hamiltonian operator and an approximate ground state wavefunction. We refer to our algorithm as the self-consistent quantum iteratively sparsified Hamiltonian (SQuISH). By performing our scheme iteratively, one can drive SQuISH to create an accurate wavefunction using a truncated, resource-efficient Hamiltonian. By utilizing this more compact Hamiltonian, our algorithm provides an approach to reduce the gate complexity of ground state calculations on quantum hardware. As proof of principle, we implement SQuISH using configuration interaction for small molecules and coupled cluster for larger systems. Through our combination of approaches, we demonstrate how it performs on a range of systems, the largest of which would require more than 200 qubits to run on quantum hardware.

Diana Chamaki↗
NASA NTRS2023

High-Order Coronagraphic Wavefront Control With Algorithmic Differentiation: First Experimental Demonstration

Future space-based coronagraphs will rely critically on focal-plane wavefront sensing and control with deformable mirrors to reach deep contrast by mitigating optical aberrations in the primary beam path. Until now, most focal-plane wavefront control algorithms have been formulated in terms of Jacobian matrices, which encode the predicted effect of each deformable mirror actuator on the focal-plane electric field. A disadvantage of these methods is that Jacobian matrices can be cumbersome to compute and manipulate, particularly when the number of deformable mirror actuators is large. Recently, we proposed a new class of focal-plane wavefront control algorithms that utilize gradient-based optimization with algorithmic differentiation to compute wavefront control solutions while avoiding the explicit computation and manipulation of Jacobian matrices entirely. In simulations using a coronagraph design for the proposed Large UV/Optical/Infrared Surveyor (LUVOIR), we showed that our approach reduces overall CPU time and memory consumption compared to a Jacobian-based algorithm. Here, we expand on these results by implementing the proposed algorithm on the High Contrast Imager for Complex Aperture Telescopes (HiCAT) testbed at the Space Telescope Science Institute (STScI) and present initial experimental results, demonstrating contrast suppression capabilities equivalent to Jacobian-based methods.

wavefront control↗
NASA NTRSDate not supplied

Do Better Satellite Precipitation Algorithms Improve Landslide Hazard Assessment?

Satellites make it possible to estimate precipitation in near real time. Given the challenges of achieving global coverage by other means, these data are used widely. However, few systems for landslide hazard assessment rely on satellite precipitation estimates. This could be due in part to perceptions of accuracy, although latency, spatial resolution, and other factors may also be important. We test whether recent changes to data streams from the Global Precipitation Measurement mission (GPM) have improved its potential for use in landslide prediction. Specifically, we examine data produced by the Integrated Multi-satellitERetrievals for the GPM (IMERG) algorithm, which was upgraded to version 7 this year. IMERG relies upon other algorithms, including the Goddard Profiling Algorithm (GPROF) and the GPM Combined Radar-Radiometer Algorithm (CORRA). Many changes have been made during the switch from IMERG version 6 to version 7. These include upgrading CORRA and GPROF to version 7, to improve the accuracy of precipitation in frozen, mountainous, and coastal areas. The measured intensity of some storms has been enhanced with a new algorithm, the Scheme for Histogram Adjustment with Ranked Precipitation Estimates in the Neighborhood. Combined with many others, these changes to IMERG should improve its utility for landslide hazard assessment in a variety of contexts. To test this idea, we retrain the global Landslide Hazard Assessment for Situational Awareness (LHASA) model twice—first with data from IMERG version 6B and second with 7B. Since current daily rainfall is the most important variable in determining outcomes predicted by LHASA, it should reflect changes made to that input. First, we grid the landslides at a daily, thirty-arcsecond resolution. This serves as the response variable. At each of these sites current and antecedent rainfall are extracted, along with antecedent snow mass and soil moisture, slope, and PGA. In addition, one million grid cells are selected at random points to represent conditions under which landslides (probably) do not occur. After merging these data, we hold back 20% of the dataset for validation purposes and train a machine-learning model with the rest. We assess both the model’s overall ability to identify landslides and its ability to predict specific large landslide disasters.

Thomas A Stanley↗
NASA NTRS2024

A Computationally Efficient Algorithm for Sampling the Rudd Differential Cross Section

Monte Carlo radiation transport codes such as RITRACKS or Geant4 are used to simulate the interaction of ions with matter. These codes rely on sampling algorithms to determine interactions and various physical properties of particles involved in the simulations. It is crucial to develop efficient sampling algorithms since Monte Carlo radiation transport simulations can be time consuming. This work presents an efficient sampling algorithm to determine the energy of secondary electrons following ion-water interactions. The applicability and intended use of the algorithm are discussed in detail, and it is shown that the new algorithm is up to 6X10 4 times faster than the method currently used in Geant4-DNA.

Floriane Poignant↗