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.

SourceResearch connectionFrom yearThrough year

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 145 records · Page 8

All sources NASA NTRS DOE OSTI

NASA NTRS2014

SWIM: A Semi-Analytical Ocean Color Inversion Algorithm for Optically Shallow Waters

Ocean color remote sensing provides synoptic-scale, near-daily observations of marine inherent optical properties (IOPs). Whilst contemporary ocean color algorithms are known to perform well in deep oceanic waters, they have difficulty operating in optically clear, shallow marine environments where light reflected from the seafloor contributes to the water-leaving radiance. The effect of benthic reflectance in optically shallow waters is known to adversely affect algorithms developed for optically deep waters [1, 2]. Whilst adapted versions of optically deep ocean color algorithms have been applied to optically shallow regions with reasonable success [3], there is presently no approach that directly corrects for bottom reflectance using existing knowledge of bathymetry and benthic albedo.To address the issue of optically shallow waters, we have developed a semi-analytical ocean color inversion algorithm: the Shallow Water Inversion Model (SWIM). SWIM uses existing bathymetry and a derived benthic albedo map to correct for bottom reflectance using the semi-analytical model of Lee et al [4]. The algorithm was incorporated into the NASA Ocean Biology Processing Groups L2GEN program and tested in optically shallow waters of the Great Barrier Reef, Australia. In-lieu of readily available in situ matchup data, we present a comparison between SWIM and two contemporary ocean color algorithms, the Generalized Inherent Optical Property Algorithm (GIOP) and the Quasi-Analytical Algorithm (QAA).

QAA↗

NASA NTRS2014

Remote Sensing of Cloud Top Height from SEVIRI: Analysis of Eleven Current Retrieval Algorithms

The role of clouds remains the largest uncertainty in climate projections. They influence solar and thermal radiative transfer and the earth's water cycle. Therefore, there is an urgent need for accurate cloud observations to validate climate models and to monitor climate change. Passive satellite imagers measuring radiation at visible to thermal infrared (IR) wavelengths provide a wealth of information on cloud properties. Among others, the cloud top height (CTH) - a crucial parameter to estimate the thermal cloud radiative forcing - can be retrieved. In this paper we investigate the skill of ten current retrieval algorithms to estimate the CTH using observations from the Spinning Enhanced Visible and InfraRed Imager (SEVIRI) onboard Meteosat Second Generation (MSG). In the first part we compare ten SEVIRI cloud top pressure (CTP) data sets with each other. The SEVIRI algorithms catch the latitudinal variation of the CTP in a similar way. The agreement is better in the extratropics than in the tropics. In the tropics multi-layer clouds and thin cirrus layers complicate the CTP retrieval, whereas a good agreement among the algorithms is found for trade wind cumulus, marine stratocumulus and the optically thick cores of the deep convective system. In the second part of the paper the SEVIRI retrievals are compared to CTH observations from the Cloud-Aerosol LIdar with Orthogonal Polarization (CALIOP) and Cloud Profiling Radar (CPR) instruments. It is important to note that the different measurement techniques cause differences in the retrieved CTH data. SEVIRI measures a radiatively effective CTH, while the CTH of the active instruments is derived from the return time of the emitted radar or lidar signal. Therefore, some systematic differences are expected. On average the CTHs detected by the SEVIRI algorithms are 1.0 to 2.5 kilometers lower than CALIOP observations, and the correlation coefficients between the SEVIRI and the CALIOP data sets range between 0.77 and 0.90. The average CTHs derived by the SEVIRI algorithms are closer to the CPR measurements than to CALIOP measurements. The biases between SEVIRI and CPR retrievals range from −0.8 kilometers to 0.6 kilometers. The correlation coefficients of CPR and SEVIRI observations vary between 0.82 and 0.89. To discuss the origin of the CTH deviation, we investigate three cloud categories: optically thin and thick single layer as well as multi-layer clouds. For optically thick clouds the correlation coefficients between the SEVIRI and the reference data sets are usually above 0.95. For optically thin single layer clouds the correlation coefficients are still above 0.92. For this cloud category the SEVIRI algorithms yield CTHs that are lower than CALIOP and similar to CPR observations. Most challenging are the multi-layer clouds, where the correlation coefficients are for most algorithms between 0.6 and 0.8. Finally, we evaluate the performance of the SEVIRI retrievals for boundary layer clouds. While the CTH retrieval for this cloud type is relatively accurate, there are still considerable differences between the algorithms. These are related to the uncertainties and limited vertical resolution of the assumed temperature profiles in combination with the presence of temperature inversions, which lead to ambiguities in the CTH retrieval. Alternative approaches for the CTH retrieval of low clouds are discussed.

Hamann, U.↗

NASA NTRS2015

Coupled Inertial Navigation and Flush Air Data Sensing Algorithm for Atmosphere Estimation

This paper describes an algorithm for atmospheric state estimation that is based on a coupling between inertial navigation and flush air data sensing pressure measurements. In this approach, the full navigation state is used in the atmospheric estimation algorithm along with the pressure measurements and a model of the surface pressure distribution to directly estimate atmospheric winds and density using a nonlinear weighted least-squares algorithm. The approach uses a high fidelity model of atmosphere stored in table-look-up form, along with simplified models of that are propagated along the trajectory within the algorithm to provide prior estimates and covariances to aid the air data state solution. Thus, the method is essentially a reduced-order Kalman filter in which the inertial states are taken from the navigation solution and atmospheric states are estimated in the filter. The algorithm is applied to data from the Mars Science Laboratory entry, descent, and landing from August 2012. Reasonable estimates of the atmosphere and winds are produced by the algorithm. The observability of winds along the trajectory are examined using an index based on the discrete-time observability Gramian and the pressure measurement sensitivity matrix. The results indicate that bank reversals are responsible for adding information content to the system. The algorithm is then applied to the design of the pressure measurement system for the Mars 2020 mission. The pressure port layout is optimized to maximize the observability of atmospheric states along the trajectory. Linear covariance analysis is performed to assess estimator performance for a given pressure measurement uncertainty. The results indicate that the new tightly-coupled estimator can produce enhanced estimates of atmospheric states when compared with existing algorithms.

Karlgaard, Christopher D.↗

NASA NTRS2016

Coupled Inertial Navigation and Flush Air Data Sensing Algorithm for Atmosphere Estimation

This paper describes an algorithm for atmospheric state estimation based on a coupling between inertial navigation and flush air data-sensing pressure measurements. The navigation state is used in the atmospheric estimation algorithm along with the pressure measurements and a model of the surface pressure distribution to estimate the atmosphere using a nonlinear weighted least-squares algorithm. The approach uses a high-fidelity model of atmosphere stored in table-lookup form, along with simplified models propagated along the trajectory within the algorithm to aid the solution. Thus, the method is a reduced-order Kalman filter in which the inertial states are taken from the navigation solution and atmospheric states are estimated in the filter. The algorithm is applied to data from the Mars Science Laboratory entry, descent, and landing from August 2012. Reasonable estimates of the atmosphere are produced by the algorithm. The observability of winds along the trajectory are examined using an index based on the observability Gramian and the pressure measurement sensitivity matrix. The results indicate that bank reversals are responsible for adding information content. The algorithm is applied to the design of the pressure measurement system for the Mars 2020 mission. A linear covariance analysis is performed to assess estimator performance. The results indicate that the new estimator produces more precise estimates of atmospheric states than existing algorithms.

Karlgaard, Christopher D.↗

NASA NTRS2017

New-Generation NASA Aura Ozone Monitoring Instrument (OMI) Volcanic SO2 Dataset: Algorithm Description, Initial Results, and Continuation with the Suomi-NPP Ozone Mapping and Profiler Suite (OMPS)

Since the fall of 2004, the Ozone Monitoring Instrument (OMI) has been providing global monitoring of volcanic SO2 emissions, helping to understand their climate impacts and to mitigate aviation hazards. Here we introduce a new-generation OMI volcanic SO2 dataset based on a principal component analysis (PCA) retrieval technique. To reduce retrieval noise and artifacts as seen in the current operational linear fit (LF) algorithm, the new algorithm, OMSO2VOLCANO, uses characteristic features extracted directly from OMI radiances in the spectral fitting, thereby helping to minimize interferences from various geophysical processes (e.g., O3 absorption) and measurement details (e.g., wavelength shift). To solve the problem of low bias for large SO2 total columns in the LF product, the OMSO2VOLCANO algorithm employs a table lookup approach to estimate SO2 Jacobians (i.e., the instrument sensitivity to a perturbation in the SO2 column amount) and iteratively adjusts the spectral fitting window to exclude shorter wavelengths where the SO2 absorption signals are saturated. To first order, the effects of clouds and aerosols are accounted for using a simple Lambertian equivalent reflectivity approach. As with the LF algorithm, OMSO2VOLCANO provides total column retrievals based on a set of predefined SO2 profiles from the lower troposphere to the lower stratosphere, including a new profile peaked at 13 km for plumes in the upper troposphere. Examples given in this study indicate that the new dataset shows significant improvement over the LF product, with at least 50% reduction in retrieval noise over the remote Pacific. For large eruptions such as Kasatochi in 2008 (approximately 1700 kt total SO2/ and Sierra Negra in 2005 (greater than 1100DU maximum SO2), OMSO2VOLCANO generally agrees well with other algorithms that also utilize the full spectral content of satellite measurements, while the LF algorithm tends to underestimate SO2. We also demonstrate that, despite the coarser spatial and spectral resolution of the Suomi National Polar-orbiting Partnership (Suomi-NPP) Ozone Mapping and Profiler Suite (OMPS) instrument, application of the new PCA algorithm to OMPS data produces highly consistent retrievals between OMI and OMPS. The new PCA algorithm is therefore capable of continuing the volcanic SO2 data record well into the future using current and future hyperspectral UV satellite instruments.

OMI↗

NASA NTRS2014

SWIM: A Semi-Analytical Ocean Color Inversion Algorithm for Optically Shallow Waters

In clear shallow waters, light that is transmitted downward through the water column can reflect off the sea floor and thereby influence the water-leaving radiance signal. This effect can confound contemporary ocean color algorithms designed for deep waters where the seafloor has little or no effect on the water-leaving radiance. Thus, inappropriate use of deep water ocean color algorithms in optically shallow regions can lead to inaccurate retrievals of inherent optical properties (IOPs) and therefore have a detrimental impact on IOP-based estimates of marine parameters, including chlorophyll-a and the diffuse attenuation coefficient. In order to improve IOP retrievals in optically shallow regions, a semi-analytical inversion algorithm, the Shallow Water Inversion Model (SWIM), has been developed. Unlike established ocean color algorithms, SWIM considers both the water column depth and the benthic albedo. A radiative transfer study was conducted that demonstrated how SWIM and two contemporary ocean color algorithms, the Generalized Inherent Optical Properties algorithm (GIOP) and Quasi-Analytical Algorithm (QAA), performed in optically deep and shallow scenarios. The results showed that SWIM performed well, whilst both GIOP and QAA showed distinct positive bias in IOP retrievals in optically shallow waters. The SWIM algorithm was also applied to a test region: the Great Barrier Reef, Australia. Using a single test scene and time series data collected by NASA's MODIS-Aqua sensor (2002-2013), a comparison of IOPs retrieved by SWIM, GIOP and QAA was conducted.

shallow waters↗

NASA NTRS2019

Multi-Band Atmospheric Correction Algorithm for Ocean Color Retrievals

NASA's current Atmospheric Correction (AC) algorithm for ocean color utilizes two bands and their ratio in the Near Infrared (NIR) to estimate aerosol reflectance and aerosol type. The algorithm then extrapolates the spectral dependence of aerosol reflectance to the visible wavelengths based on modeled spectral dependence of the identified aerosol type. Future advanced ocean color sensors, such as the Ocean Color Instrument (OCI) that will be carried on the Plankton, Aerosol, Cloud, and ocean Ecosystem (PACE) satellite, will be capable of measuring the hyperspectral radiance from 340 to 890 nm at 5-nm spectral resolution and at 7 discrete Short-wave Infrared (SWIR) channels: 940, 1038,1250, 1378, 1615, 2130, and 2260 nm. To optimally employ this unprecedented instrument capability, we propose an improved AC algorithm that utilizes all atmospheric-window channels in the NIR to SWIR spectral range to reduce the uncertainty in the AC process. A theoretical uncertainty analysis of this, namely Multi-Band AC (MBAC), indicates that the algorithm can reduce the uncertainty in remote sensing reflectance (Rrs) retrievals of the ocean caused by sensor random noise. Furthermore, in optically complex waters, where the NIR signal is affected by contributions from highly-reflective turbid waters, the MBAC algorithm can be adaptively weighted to the strongly-absorbing SWIR channels to enable improved ocean color retrievals in coastal waters. We provide here a description of the algorithm and demonstrate the improved performance in ocean color retrievals, relative to the current NASA standard AC algorithm, through comparison with field measurements and assessment of propagated uncertainties in applying the MBAC algorithm to MODIS and simulated PACE OCI data.

PACE↗

NASA NTRS2019

A New Discrete Wavelength BUV Algorithm for Consistent Volcanic SO2 Retrievals from Multiple Satellite Missions

This paper describes a new discrete wavelength algorithm developed for retrieving volcanic sulfur dioxide (SO2) vertical column density (VCD) from UV observing satellites. The Multi-Satellite SO2 algorithm (MS_SO2) simultaneously retrieves column densities of sulfur dioxide, ozone, and Lambertian effective reflectivity (LER) and its spectral dependence. It is used operationally to process measurements from the heritage Total Ozone Mapping Spectrometer (TOMS) onboard NASA's Nimbus-7 satellite (N7/TOMS: 1978-1993) and from the current Earth Polychromatic Imaging Camera (EPIC) onboard Deep Space Climate Observatory (DSCOVR: 2015-) from the Earth-Sun Lagrange (L1) orbit. Results from MS_SO2 algorithm for several volcanic cases were assessed using the more sensitive principal component analysis (PCA) algorithm. The PCA is an operational algorithm used by NASA to retrieve SO2 from hyperspectral UV spectrometers, such as the Ozone Monitoring Instrument (OMI) onboard NASA's Earth Observing System Aura satellite and Ozone Mapping and Profiling Suite (OMPS) onboard NASA-NOAA Suomi National Polar Partnership (SNPP) satellite. For this comparative study, the PCA algorithm was modified to use the discrete wavelengths of the Nimbus-7/TOMS instrument, described in Sect. S1 of the Supplement. Our results demonstrate good agreement between the two retrievals for the largest volcanic eruptions of the satellite era, such as the 1991 Pinatubo eruption. To estimate SO2 retrieval systematic uncertainties, we use radiative transfer simulations explicitly accounting for volcanic sulfate and ash aerosols. Our results suggest that the discrete-wavelength MS_SO2 algorithm, although less sensitive than hyperspectral PCA algorithm, can be adapted to retrieve volcanic SO2 VCDs from contemporary hyperspectral UV instruments, such as OMI and OMPS, to create consistent, multi-satellite, long-term volcanic SO2 climate data records.

Bradford L Fisher↗

NASA NTRSDate not supplied

Post-Flight Performance Analysis of Navigation and Advanced Guidance Algorithms on a Terrestrial Suborbital Rocket Flight

There is currently renewed interest in robotic and crewed landers for a return to the lunar surface. Advanced guidance and navigation algorithms are essential to accurately delivering cargo and crew safely to the moon successfully. This paper reports the overall performance of an integrated set of navigation and guidance algorithms flown on a terrestrial suborbital rocket up to an altitude of approximately 100km. The navigation algorithm consists of an onboard extended Kalman Filter (EKF) that ingests multiple sensor measurements, one of which is the output from a terrain relative navigation (TRN) algorithm that cross-references camera images to on-board satellite imagery to perform feature correlation within the camera image. The guidance algorithm solves for a 6-degree-of-freedom (DoF) optimal trajectory using a successive convexification method during powered descent. The altitude range as well as the landing dynamics experienced during this test flight are realistic for an extraterrestrial landing and provide an invaluable data set to gauge the current development of these landing algorithms in an effort to advance the overall software readiness levels (SRL). This paper will delve into different aspects of each algorithm and present an analysis of the in-flight performance of the algorithms. This flight was conducted under the National Aeronautics and Space Administration (NASA) Safe and Precise Landing Integrated Capabilities Evolution (SPLICE) project focused on technology advancement for landing applications.

Guidance↗

NASA NTRS2021

Adaptive-Sweep Algorithm for Spacecraft Carrier Acquisition and Tracking: System Analysis and Implementation

This paper presents an adaptive-sweep algorithm that can be used in conjunction with a Phased-Lock Loop to acquire and track the carrier of a Binary Phase-shift Keying signal with residual carrier. This algorithm is useful in proximity links where no Doppler pre-compensation is available at the transmitter, and allows the receiver to acquire the incoming carrier even if the experienced Doppler shift is several orders of magnitude larger than the PLL bandwidth. Other applications for this algorithm include Multiple Uplink per Antenna at the Deep Space Network, and generation of observables (Doppler shift, Doppler rate, range rate) for in-situ navigation purposes. This paper enhances a previously presented adaptive-sweep algorithm and its performance analysis in two fronts. First, the algorithm now uses the direction function to automatically estimate the required frequency jump to achieve PLL lock. This enables a fully adaptive-sweep scheme in which system implementer does not need to manually select thresholds. On the other hand, we study the system performance in the presence of Additive White Gaussian Noise and derive necessary conditions for the system to operate at low signal-to-noise conditions. This allows us to create design rules that specify all parameters of the algorithm given a set of system-level requirements. To test the performance of the proposed algorithm, we implement it in GNU Radio, an open-source Software-Defined Radio that interfaces with several commercial radio peripherals. We use this implementation to demonstrate carrier lock and quantify system performance under different noise conditions. We also test the algorithm using open-loop recordings of two downlinks between the Lunar Reconnaissance Orbiter and the Deep Space Network. We show that even after large frequency jumps (tens of kHz), the proposed system is able to rapidly reacquire the carrier and continue operation.

Divsalar, Dariush↗

NASA NTRS2022

Cloud Mask Intercomparison eXercise (CMIX): An evaluation of cloud masking algorithms for Landsat 8 and Sentinel-2

Cloud cover is a major limiting factor in exploiting time-series data acquired by optical spaceborne remote sensing sensors. Multiple methods have been developed to address the problem of cloud detection in satellite imagery and a number of cloud masking algorithms have been developed for optical sensors but very few studies have carried out quantitative intercomparison of state-of-the-art methods in this domain. This paper summarizes results of the first Cloud Masking Intercomparison eXercise (CMIX) conducted within the Committee Earth Observation Satellites (CEOS) Working Group on Calibration & Validation (WGCV). CEOS is the forum for space agency coordination and cooperation on Earth observations, with activities organized under working groups. CMIX, as one such activity, is an international collaborative effort aimed at intercomparing cloud detection algorithms for moderate-spatial resolution (10–30 m) spaceborne optical sensors. The focus of CMIX is on open and free imagery acquired by the Landsat 8 (NASA/USGS) and Sentinel-2 (ESA) missions. Ten algorithms developed by nine teams from fourteen different organizations representing universities, research centers and industry, as well as space agencies (CNES, ESA, DLR, and NASA), are evaluated within the CMIX. Those algorithms vary in their approach and concepts utilized which were based on various spectral properties, spatial and temporal features, as well as machine learning methods. Algorithm outputs are evaluated against existing reference cloud mask datasets. Those datasets vary in sampling methods, geographical distribution, sample unit (points, polygons, full image labels), and generation approaches (experts, machine learning, sky images). Overall, the performance of algorithms varied depending on the reference dataset, which can be attributed to differences in how the reference datasets were produced. The algorithms were in good agreement for thick cloud detection, which were opaque and had lower uncertainties in their identification, in contrast to thin/semi-transparent clouds detection. Not only did CMIX allow identification of strengths and weaknesses of existing algorithms and potential areas of improvements, but also the problems associated with the existing reference datasets. The paper concludes with recommendations on generating new reference datasets, metrics, and an analysis framework to be further exploited and additional input datasets to be considered by future CMIX activities.

Sergii Skakun↗

NASA NTRSDate not supplied

Biomass Harmonization and SAR Analysis with the Multi-mission Algorithm and Analysis Platform (MAAP)

The Multi‐mission Algorithm and Analysis Platform (MAAP) is a collaborative effort between NASA and the European Space Agency (ESA) to support above ground biomass (AGB) research in an open science framework. MAAP brings together relevant data, algorithms, and computing capabilities in a common cloud environment to address the challenges of sharing and processing data from field, airborne and satellite measurements. MAAP was publicly released in October 2021, providing computing capabilities co-located with the data, a collaborative coding and analysis environment, and a set of interoperable tools and algorithms developed to support the estimation and visualization of data. MAAP has allowed scientists from both North America and Europe to collaborate on the generation and analysis/visualization of data derived from multiple, discipline-adjacent missions in an open, collaborative environment that has reached beyond traditional scientific investigation. MAAP has been used to support multiple scientific activities. To date, existing LiDAR data from multiple platforms has been calibrated with field measurements and combined for more comprehensive and accurate estimates of above ground biomass AGB; these LiDAR platforms include airborne (e.g. LVIS), the International Space Station (NASA’s Global Ecosystem Dynamics Investigation (GEDI), and satellites (e.g. ICESat-2). The current challenge is to effectively and seamlessly combine the aforementioned LiDAR-based data with new data sources such as P-band RADAR from ESA’s upcoming BIOMASS mission, existing ESA Sentinel-1 C-band SAR, and the 30 PB/yr of high cadence global coverage L-band SAR data from the upcoming NASA-ISRO SAR (NISAR) mission. Recent analysis using MAAP merged ICESat-2 and optical data (Harmonized Landsat Sentinel) produced the most comprehensively precise estimate of boreal-wide AGB to date. Another effort using MAAP is the production and open distribution of global comparisons of AGB map estimates, including from ICESat-2 and GEDI, to bolster stakeholder uptake for policy applications. These map estimates will feed into the Intergovernmental Panel on Climate Change (IPCC) database, likely aiding the next Global Carbon Stocktake of the UNFCCC. Furthermore, the biomass retrieval intercomparison exercise BRIX-2 could benefit from the MAAP providing standardized test cases (based on airborne campaign and spaceborne data) allowing the community to develop and apply retrieval algorithms based on these test cases, while forthcoming SAR data training curricula could also use the MAAP as a teaching and learning platform. The MAAP is meeting the challenges inherent in international, open science collaboration and large scale computing with a platform that is entirely open source and cloud native, using open standards for data access, manipulation, protocols, and formats. The MAAP data system consists of a dedicated data store whose data is indexed in an online catalog conforming to established metadata, application programmatic interfaces (APIs), and service interface standards, using an implementation of the open sourced NASA Common Metadata Repository. Federation of user identities allows users from either NASA or ESA to access and consume services from the other using a unified metadata catalog for the data utilized across the ESA and NASA MAAP platforms. Similarly, we are exploring how to increase interoperability to achieve a common approach to packaging, orchestrating and executing algorithms, with interoperable access to data for subsetting, fast browse, and cloud-optimized access, all using interoperable standards such as those from the Open Geospatial Consortium (OGC). Designed for interoperability, ESA and NASA utilize a common architecture for the software platform. It provides a cloud-based algorithm development environment (ADE) that enables scientists to develop algorithms collaboratively with access to the MAAP data catalog as well as other data archives. MAAP provides an Eclipse Che-based ADE supporting both Python and R languages, popular in this biomass community. Algorithms developed and containerized within the ADE can be deployed to run to thousands of computational nodes in the MAAP’s data processing system (DPS), dramatically speeding up processing and giving scientists a rapid, iterative turnaround of results. NASA’s implementation of the DPS is based on the Hybrid Science Data System (HySDS) framework, used by NASA flight projects to produce Earth science standard products.

cloud computing↗

NASA NTRSDate not supplied

Demand-Capacity Balancing Algorithms for Urban Air Mobility Operations

This paper proposes new Demand/Capacity Balancing (DCB) algorithms that resolve imbalances at enroute waypoints, such as crossing, merging, and UAM corridor entry or exit waypoints, in addition to vertiports; we refer to this algorithm as DCB-Waypoint, still using pre-departure delay as the sole resolution mechanism. Like DCB-Vertiport, DCB-Waypoint takes one flight at a time and resolves imbalances one waypoint at a time, starting from the origin vertiport followed by the sequence of constrained waypoints and, finally, the destination vertiport. The next advancement assigns airborne delays, in addition to pre-departure delays at vertiports. This algorithm, called DCB-Airborne-Delays, uses information on flight speeds to ensure that the assigned delays are feasible, meaning that variations in flight speeds are within feasible aircraft speed ranges. The proposed algorithms are being implemented in a new fast-time simulation tool developed especially for simulating UAM operations. The full paper will provide additional details of the new DCB algorithms that have been developed, as well as the results from simulations using these algorithms. Finally, the DCB algorithms will be compared against one another to obtain insights and recommendations for the future development of more advanced DCB algorithms.

urban air mobility, demand-capacity balancing↗

NASA NTRSDate not supplied

Demand-Capacity Balancing Algorithms for Urban Air Mobility Operations

urban air mobility↗

NASA NTRS2014

An Optimizing Space Data-Communications Scheduling Method and Algorithm with Interference Mitigation, Generalized for a Broad Class of Optimization Problems

NASA's space data-communications infrastructure-the Space Network and the Ground Network-provide scheduled (as well as some limited types of unscheduled) data-communications services to user spacecraft. The Space Network operates several orbiting geostationary platforms (the Tracking and Data Relay Satellite System (TDRSS)), each with its own servicedelivery antennas onboard. The Ground Network operates service-delivery antennas at ground stations located around the world. Together, these networks enable data transfer between user spacecraft and their mission control centers on Earth. Scheduling data-communications events for spacecraft that use the NASA communications infrastructure-the relay satellites and the ground stations-can be accomplished today with software having an operational heritage dating from the 1980s or earlier. An implementation of the scheduling methods and algorithms disclosed and formally specified herein will produce globally optimized schedules with not only optimized service delivery by the space data-communications infrastructure but also optimized satisfaction of all user requirements and prescribed constraints, including radio frequency interference (RFI) constraints. Evolutionary algorithms, a class of probabilistic strategies for searching large solution spaces, is the essential technology invoked and exploited in this disclosure. Also disclosed are secondary methods and algorithms for optimizing the execution efficiency of the schedule-generation algorithms themselves. The scheduling methods and algorithms as presented are adaptable to accommodate the complexity of scheduling the civilian and/or military data-communications infrastructure within the expected range of future users and space- or ground-based service-delivery assets. Finally, the problem itself, and the methods and algorithms, are generalized and specified formally. The generalized methods and algorithms are applicable to a very broad class of combinatorial-optimization problems that encompasses, among many others, the problem of generating optimal space-data communications schedules.

ground stations↗

DOE OSTI2024

DyG-DPCD: A Distributed Parallel Community Detection Algorithm for Large-Scale Dynamic Graphs

Dynamic (Temporal) graphs capture the valuable evolution of real-world systems, from the continuously evolving patterns of social interactions and genetic pathways to the dynamic fluctuations of economic forces. Detecting communities for such evolving networks poses unique challenges. Detecting and analyzing the evolution of communities within dynamic graphs unlocks valuable insights into the underlying structural and temporal patterns of real-world systems. However, the sheer volume of modern graph data and the inherent complexity of the temporal dimension pose significant challenges to scalable community detection algorithms. Addressing this gap, our work explores the limited landscape of scalable distributed-memory parallel methods specifically designed for dynamic network community detection. We propose a novel parallel algorithm, DyG-DPCD (Dynamic Graph Distributed Parallel Community Detection), to detect communities in dynamic networks using the Message Passing Interface (MPI) framework. We present a vertex-centric approach, allowing us to detect communities through local optimization. Furthermore, we enhance our baseline algorithm by incorporating three heuristics, which improve the algorithm’s performance significantly while maintaining the quality of the solutions. We demonstrate the efficiency of our algorithm by experimenting on several real-world large-scale networks with hundreds of millions of edges spanning diverse domains. Notably, DyG-DPCD achieves speedups between 25× and 30× for large networks that we experimented on using NERSC compute nodes. In conclusion, our algorithm outperforms the STINGER parallel re-agglomeration algorithm by 30×.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2026

Models and Algorithms for Equilibrium Analysis of Mixed-Material Nucleic Acid Systems

Dynamic programming algorithms within the NUPACK software suite enable analysis of equilibrium base-pairing properties for complex and test tube ensembles containing arbitrary numbers of interacting nucleic acid strands. Currently, calculations are limited to single-material systems that are either all-RNA or all-DNA. Here, to enable analysis of mixed-material systems that are critical for modern applications in vitro, in situ, and in vivo, we develop physical models and dynamic programming algorithms that allow the material of the system to be specified at nucleotide resolution. Free energy parameter sets are constructed for both RNA/DNA and RNA/2'OMe-RNA mixed-material systems by combining available empirical mixed-material parameters with single-material parameter sets to enable treatment of the full complex and test tube ensembles. New dynamic programming recursions account for the material of each nucleotide throughout the recursive process. For a complex with N nucleotides, the mixed-material dynamic programming algorithms maintain the O(N 3 ) time complexity of the single-material algorithms, enabling efficient calculation of diverse physical quantities over complex and test tube ensembles (e.g., complex partition function, equilibrium complex concentrations, equilibrium base-pairing probabilities, minimum free energy secondary structure(s), and Boltzmann-sampled secondary structures) at a cost increase of roughly 2.0-3.5×. The results of existing single-material algorithms are exactly reproduced when applying the new mixed-material algorithms to single-material systems. Accuracy is significantly enhanced using mixed-material models and algorithms to predict RNA/DNA and RNA/2'OMe-RNA duplex melting temperatures from the experimental literature as well as RNA/DNA melt profiles from new experiments. In conclusion, mixed-material analyses can be performed online using the NUPACK web app (www.nupack.org) or locally using the NUPACK Python module.

2′OMe-RNA↗

DOE OSTI2025

Quantum Algorithms for Representation-Theoretic Multiplicities

Kostka, Littlewood-Richardson, Plethysm, and Kronecker coefficients are the multiplicities of irreducible representations in the decomposition of representations of the symmetric group that play an important role in representation theory, geometric complexity, and algebraic combinatorics. We give quantum algorithms for computing these coefficients whenever the ratio of dimensions of the representations is polynomial. We show that there is an efficient classical algorithm for computing the Kostka numbers under this restriction and conjecture the existence of an analogous algorithm for the Littlewood-Richardson coefficients. We argue why such classical algorithm does not straightforwardly work for the Plethysm and Kronecker coefficients and conjecture that our quantum algorithms lead to superpolynomial speedups. The conjecture about Kronecker coefficients was disproved by Panova [Polynomial time classical versus quantum algorithms for representation theoretic multiplicities, arXiv:2502.20253] with a classical algorithm which, if optimal, points to a 𝒪⁡(𝑛 4+2⁢𝑘 ) vs $\tilde{Ω}$⁡(𝑛 4⁢𝑘 2 +1 ) polynomial gap in quantum vs classical computational complexity for an integer parameter 𝑘.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗