Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “iterative projection algorithms”

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 145 records · Page 8
All sourcesNASA NTRSDOE OSTI
DOE OSTI2022

2022 AI Testbed Expeditions Report

By exploiting the coherent properties of a light source, coherent diffraction imaging (CDI) is able to obtain the sample image at a nanoscale resolution using the measured diffraction pattern. Bragg Coherent Diffraction Imaging (BCDI) has become valuable for recovering the displacement and strain field of crystals, providing a valuable tool in material science and solid-state physics. X-ray ptychography is another emerging CDI technique that can produce a high-resolution image of the extended sample and has become popular in many research areas (e.g., materials science, biology, electronics, and optics characterization). CDI including BCDI and ptychography has become an established technique in Synchrotron Facilities including the Advanced Photon Source (APS) and will greatly benefit from the 100x coherent flux increase of the upcoming APS Upgrade (APSU). The current image formation process in CDI employs iterative phase retrieval algorithms, which is a time-consuming and computationally expensive process. Especially after APSU, the traditional iterative methods will not be able to match the experimental data acquisition speed. We employ deep learning (DL) approach to replace the iterative approaches, therefore allowing hundreds of times faster recovery of the object. We developed AutoPhaseNN, a DL-based approach which learns to solve the inverse problem without labeled data. Taking 3D BCDI as a representative technique, AutoPhaseNN has been demonstrated to be one hundred times faster than traditional iterative phase retrieval methods while providing comparable image quality. The current network is trained with 64 x 64 x 64 data size, to achieve higher resolution imaging, we will need to scale the network to input and train/infer 3D arrays of size 256 x 256 x 256 (today) and of size 2560x2560x2560 (APSU). However, the scalability of the network is restricted due to the memory-intensive training process. To perform the training for a 256 x 256 x 256 data size, the required memory exceeds the capacity of the current machine. In this project, we explore using Sambanova system to train the network for the direct data inversion for CDI.

36 MATERIALS SCIENCE↗
DOE OSTI2020

Toward a scalable robust security-constrained optimal power flow using a proximal projection bundle method

Robust security-constrained optimal power flow (rSCOPF) aims to find the worst-case contingencies of alternating current optimal power flow (ACOPF) in power systems. With the rise of GPU architectures on the upcoming supercomputer architectures, optimization algorithms that rely on sparse linear algebra and indefinite linear systems are becoming increasingly hard to solve efficiently (e.g. interior-point method). To address this we revisit a maximin optimization formulation of the rSCOPF and the single-level mixed-integer semidefinite programming (MISDP) reformulation, which is obtained by taking the Lagrangian relaxation of the inner minimization ACOPF problem. In this paper, we focus on the development of a proximal projection bundle method (PPBM) for solving continuous relaxation node subproblems of the MISDP problem, based primarily on the well-known alternating direction method of multipliers. Cutting planes reminiscent of bundle method ideas are also applied in coordination with updates of the proximal parameter. The cutting-plane method can generate a large number of linear inequalities, leading to a large scale but decomposable quadratic programming (QP) subproblem that is amenable to GPUs. We present the numerical results on the IEEE 30, 57, 118, and 300-bus systems by using our PBMM method. We discuss the main computational bottleneck of our method, which is the time taken to solve each iteration of a QP subproblem instance of the PPBM, and how GPU architectures can accelerate this solution process.

bundle method↗
NASA NTRS2004

Real-Time Adaptive Color Segmentation by Neural Networks

Artificial neural networks that would utilize the cascade error projection (CEP) algorithm have been proposed as means of autonomous, real-time, adaptive color segmentation of images that change with time. In the original intended application, such a neural network would be used to analyze digitized color video images of terrain on a remote planet as viewed from an uninhabited spacecraft approaching the planet. During descent toward the surface of the planet, information on the segmentation of the images into differently colored areas would be updated adaptively in real time to capture changes in contrast, brightness, and resolution, all in an effort to identify a safe and scientifically productive landing site and provide control feedback to steer the spacecraft toward that site. Potential terrestrial applications include monitoring images of crops to detect insect invasions and monitoring of buildings and other facilities to detect intruders. The CEP algorithm is reliable and is well suited to implementation in very-large-scale integrated (VLSI) circuitry. It was chosen over other neural-network learning algorithms because it is better suited to realtime learning: It provides a self-evolving neural-network structure, requires fewer iterations to converge and is more tolerant to low resolution (that is, fewer bits) in the quantization of neural-network synaptic weights. Consequently, a CEP neural network learns relatively quickly, and the circuitry needed to implement it is relatively simple. Like other neural networks, a CEP neural network includes an input layer, hidden units, and output units (see figure). As in other neural networks, a CEP network is presented with a succession of input training patterns, giving rise to a set of outputs that are compared with the desired outputs. Also as in other neural networks, the synaptic weights are updated iteratively in an effort to bring the outputs closer to target values. A distinctive feature of the CEP neural network and algorithm is that each update of synaptic weights takes place in conjunction with the addition of another hidden unit, which then remains in place as still other hidden units are added on subsequent iterations. For a given training pattern, the synaptic weight between (1) the inputs and the previously added hidden units and (2) the newly added hidden unit is updated by an amount proportional to the partial derivative of a quadratic error function with respect to the synaptic weight. The synaptic weight between the newly added hidden unit and each output unit is given by a more complex function that involves the errors between the outputs and their target values, the transfer functions (hyperbolic tangents) of the neural units, and the derivatives of the transfer functions.

Duong, Tuan A.↗
DOE OSTI2024

Plasma Surface Interactions: Predicting the Performance and Impact of Dynamic PFC Surfaces

The objective of this project is to develop, and integrate, high-performance simulation tools capable of predicting plasma-facing component (PFC) operating lifetime and the impact of the evolving surface morphology of tungsten-based PFCs on plasma contamination, including the dynamic recycling of fuel species and tritium retention, in future magnetic fusion devices. Establishing a fundamental physical understanding and developing predictive capabilities of plasma-surface interactions (PSI) requires simultaneously addressing complex and diverse physics occurring over a wide range of length (Angstroms to meters) and time (femtoseconds to years) scales, as well as integrating extensive physical processes across the plasma–surface interface. This requires development of not only detailed physics models and computational strategies at each scale, but also algorithms and methods to couple them effectively in a way that can be robustly validated. Deploying these tools requires the continued development and coupling of leadership-scale computational codes to describe the boundary plasma and the evolving PFC surface, as well as a host of simulations that bridge disparate scales to address complex physical and computational issues at the plasma–surface interface in multi-component materials systems for magnetic fusion energy development beyond ITER.

36 MATERIALS SCIENCE↗
DOE OSTI2026

How Do You Hear a Quantum Computer Whisper?

Quantum transduction is the process of upconverting microwave quantum signals into optical signals to develop quantum networks through optical fibers outside the dilution refrigerator, enabling connections between quantum technologies on the quantum internet. In this project, upconversion is achieved by directing an optical laser and the microwave quantum signal into an electro-optic bulk crystal. The crystal is housed within a Superconducting Radio Frequency (SRF) cavity designed to maximize the overlap between the microwave field and the crystal volume. In the presence of microwaves, the refractive index of the crystal changes through the Pockels effect. This change in refractive index modifies the propagation of the optical field within the crystal, allowing the quantum information carried by the microwave field to be transferred to the optical field. This study focuses on coupling laser light from suspended waveguide chips into the whispering-gallery modes (WGMs) of the crystal to enable transduction. The coupling efficiency between the optical field in the suspended waveguide and the WGM depends on the position of the laser spot on the crystal. To address this challenge, a feedback-based algorithm is being developed to fine-tune the waveguide position so that the optical signal is coupled efficiently into the crystal. After passing through the crystal, the optical signal is detected by a photodiode connected to an oscilloscope. The algorithm evaluates the coupling quality and iteratively adjusts the waveguide position to maximize coupling efficiency. The expected outcome is an automated waveguide alignment method that improves optical coupling and enables more efficient microwave-to-optical quantum transduction.

Karanastasis, Mihael [Fermilab]↗
DOE OSTI2022

A machine-learning framework for the simulation of nuclear deflection of Planet-Killer-Asteroids

Here, as detection capabilities in astronomy have dramatically improved over the last two decades, concerns over Planet-Killer-Asteroids (PKAs) have become widespread, with nuclear weapons being proposed to destroy or deflect asteroids that are on a short-term projected collision course with Earth. Two main mitigation strategies have been proposed: • Case 1: Break up an incoming asteroid into smaller pieces that will disperse widely, resulting in smaller-scale, less detrimental, Earth-impacts or • Case 2: Deflect an incoming asteroid trajectory to avoid collision altogether. While the two strategies are not mutually exclusive, deflection is a safer strategy, ideally by harnessing all of the released energy from a nuclear device to move the asteroid as a rigid body. However, this case may not be always possible, since the strength of the energy release may break up the asteroid. In this work, the dynamical response of a PKA to a series of ultra-high energy impulses, such as those generated by nuclear devices, is formulated. A rapid iterative Discrete Element Method (DEM) method is developed to describe the deflection and potential breakup of the PKA as a function of a material bonding strength parameter within the asteroid and the magnitude of the applied impulse. The use of DEM allows for fragmentation of the PKA and the ability to compute the trajectories and distribution of the resulting debris field. Finally, a machine-learning algorithm is then developed and combined with the DEM approach to optimize the pulsation strategy for maximum possible safety and success.

42 ENGINEERING↗
NASA NTRS2019

Ask-The-Expert: Minimizing Human Review for Big Data Analytics Through Active Learning

In this CIF project, we worked toward semi-automating knowledge discovery from anomaly detection algorithms through the use of active learning. Active learning is an area of research within machine learning that uses an "expert in the loop" to learn from large data sets that have very few annotations or labels available, and where providing such labels is expensive. In our case, the task can be defined as the identification of safety events from flight operational data. Since traditional anomaly detection algorithms cannot differentiate between operationally relevant and irrelevant statistical anomalies, Subject Matter Experts (SMEs) have a lengthy and expensive burden of investigating every example identified by the detection algorithm, classifying and labeling them as relevant or irrelevant. Active learningidentifies the unlabeled example for which a label would most improve the classifier, asks the domain expert for a label, and repeats this process until there are no more resources (time, budget) available for labeling or a minimum required performance is reached. A positive label indicates an operationally significant safety event whereas a negative label indicates otherwise. Based on these few labels we propose to build an active learning system that utilizes the SME's time in the most effective manner by iteratively asking for labels for as few informative instances as possible. Our work was proposed to be a stepping stone toward implementation and deployment of the system with user interface to be pursued by the Aviation Operations and Safety Program (AOSP) given its interest in safety monitoring and discovery of safety incidents.

aviation safety↗
DOE OSTI2023

Projected Multi-Agent Consensus Equilibrium (PMACE) With Application to Ptychography

Multi-Agent Consensus Equilibrium (MACE) formulates an inverse imaging problem as a balance among multiple update agents such as data-fitting terms and denoisers. However, each such agent operates on a separate copy of the full image, leading to redundant memory use and slow convergence when each agent affects only a small subset of the full image. In this article, we extend MACE to Projected Multi-Agent Consensus Equilibrium (PMACE), in which each agent updates only a projected component of the full image, thus greatly reducing memory use for some applications. We describe PMACE in terms of an equilibrium problem and an equivalent fixed-point problem and show that in most cases the PMACE equilibrium is not the solution of an optimization problem. To demonstrate the value of PMACE, we apply it to the problem of ptychography, in which a sample is reconstructed from the diffraction patterns resulting from coherent X-ray illumination at multiple overlapping spots. In our PMACE formulation, each spot corresponds to a separate data-fitting agent, with the final solution found as an equilibrium among all the agents. In conclusion, our results demonstrate that the PMACE reconstruction algorithm generates more accurate reconstructions at a lower computational cost than existing ptychography algorithms when the spots are sparsely sampled.

97 MATHEMATICS AND COMPUTING↗
NASA NTRSDate not supplied

Development of the GeoNEX Level 2G Products: Exploiting the Diurnal Variability of TOA Reflectance in Atmospheric Correction

This study develops a new atmospheric correction algorithm to generate the Level 2G products, in particular the gap-filled Surface Reflectance at 10-minute time steps, for the Geostationary-NASA Earth Exchange (GeoNEX) project. The algorithm is based on the MODIS MAIAC (Multi-Angle Implementation of Atmospheric Correction) framework but with significant modifications to exploit angular/temporal information from the diurnal variability of the GeoNEX L1G TOA (Top-of-Atmosphere) reflectance. The algorithm starts by evaluating the roughness/smoothness of the diurnal time series of the TOA reflectance. Because rapid changes in TOA reflectance are generally caused by passing clouds or shadows, rough segments of the time series are automatically filtered out while the smooth segments are further tested for brightness and temperature to identify clear-sky and snow-free observations. Next the algorithm runs the MAIAC RTM (Radiative Transfer Model) to retrieve the Ross-Thick-Li-Sparse (RTLS) BRDF model parameters and the daily-mean atmospheric optical depth (AOD) that allow the RTM to optimally simulate the observed diurnal variability of clear-sky TOA reflectance. Once the initial RTLS parameters are retrieved after the algorithm’s burn-in period, they are used as the prior information to predict the AOD level for the next days, while the subsequent clear-sky observations are used to make necessary adjustments to the RTLS parameters in an continuous fashion. This “prediction-analysis” cycle is then iterated to process the full time series of the L1G data, skipping only total-cloudy days or when surface snow is detected. We tested the algorithm over a list of selected AERONET sites. The retrieved results (the daily mean AOD and the RTLS parameters) reasonably agree with the ground-based measurements. Importantly, the results indicate that the diurnal cycles of surface reflectance are continuous functions of the illumination-view geometry. Thus we can use the retrieved RTLS model to accurately fill in data gaps on partial cloudy days. Also, our algorithm is totally independent from the traditional approaches based on the use of spectral band ratios between the shortwave infrared (e.g., 2.2µm) and the visible (e.g., 0.47µm and 0.64µm) bands. Our results thus demonstrate that the high-frequent diurnal geostationary observations contain unique information that helps us improve atmospheric correction of remote sensing data.

GeoNEX↗
NASA NTRS1989

The use of aircraft and satellite remote sensing of phytoplankton chlorophyll concentrations in case 2 estuarine waters of the Chesapeake Bay

Two projects using remote sensing of phytoplankton chlorophyll concentrations in the Chesapeake Bay estuary were proposed. The first project used aircraft remote sensing with a compact radiometer system developed at NASA's Goddard Space Flight Center (GSFC), the Ocean Data Acquisition System (ODAS). ODAS includes three radiometers at 460, 490, and 520 nm, an infrared temperature sensor (PRT-5), Loran-C for navigation, and a data acquisition system using a PC and mass storage device. This instrument package can be flown in light aircraft at relatively low expense, permitting regular and frequent flights. Sixteen flights with ODAS were completed using the Virginia Institute of Marine Science's De Havilland 'Beaver'. The goal was to increase spatial and temporal resolution in assaying phytoplankton pigment concentrations in the Chesapeake. At present, analysis is underway of flight data collected between March and July 1989. The second project focused on satellite data gathered with the Nimbus-7 Coastal Zone Color Scanner (CZSC) between late 1978 and mid 1986. The problem in using CZSC data for the Chesapeake Bay is that the optical characteristics of this (and many) coastal and estuarine waters are distinct from those of the open ocean for which algorithms for computing pigment concentrations were developed. The successful use of CZCS data for the estuary requires development of site-specific algorithms and analytical approaches. Of principal importance in developing site-specific procedures is the availability of in-situ data on pigment concentrations. A significant data set was acquired from EPA's Chesapeake Bay Program in Annapolis, Maryland, and clear satellite scenes are being analyzed for which same-day sea truth measurements of pigment were obtained. Both the University of Miami and GSFC Seapak systems are being used in this effort. The main finding to date is an expected one, i.e., the algorithms developed for oceanic waters are inadequate to compute pigment concentrations for the Case 2 waters of the Chesapeake Bay. One reason is the overestimation of aerosol radiances by assuming that water-leaving radiance in Band 4 of CZCS (670 nm) is zero, an assumption that is invalid for the Bay. This prompted any attempts to iterative procedures for estimating the proportion of the Band 4 radiance that is actually attributable to aerosol by estimating the water-leaving component using optical data. A cruise on the Chesapeake the week of 7 August 1989 was conducted to collect additional optical data necessary to this task.

Harding, Lawrence W., Jr.↗
DOE OSTI2024

All-optical image denoising using a diffractive visual processor

Abstract Image denoising, one of the essential inverse problems, targets to remove noise/artifacts from input images. In general, digital image denoising algorithms, executed on computers, present latency due to several iterations implemented in, e.g., graphics processing units (GPUs). While deep learning-enabled methods can operate non-iteratively, they also introduce latency and impose a significant computational burden, leading to increased power consumption. Here, we introduce an analog diffractive image denoiser to all-optically and non-iteratively clean various forms of noise and artifacts from input images – implemented at the speed of light propagation within a thin diffractive visual processor that axially spans <250 × λ, where λ is the wavelength of light. This all-optical image denoiser comprises passive transmissive layers optimized using deep learning to physically scatter the optical modes that represent various noise features, causing them to miss the output image Field-of-View (FoV) while retaining the object features of interest. Our results show that these diffractive denoisers can efficiently remove salt and pepper noise and image rendering-related spatial artifacts from input phase or intensity images while achieving an output power efficiency of ~30–40%. We experimentally demonstrated the effectiveness of this analog denoiser architecture using a 3D-printed diffractive visual processor operating at the terahertz spectrum. Owing to their speed, power-efficiency, and minimal computational overhead, all-optical diffractive denoisers can be transformative for various image display and projection systems, including, e.g., holographic displays.

36 MATERIALS SCIENCE↗
DOE OSTI2020

TRANSENSOR: Transformer Real-time Assessment INtelligent System with Embedded Network of Sensors and Optical Readout. Final Report

Utilities across the world are wrestling with evolving market dynamics, population growth and climate change. Distributed Energy Resources (DERs) such as solar photovoltaics, distributed generators and energy storage systems are becoming important parts of the U.S. energy mix. These factors are driving an increasing need for low-cost grid asset monitoring. Aside from being costly, traditional utility monitoring systems are not sufficiently robust and do not provide real-time visibility into the condition of grid assets such as transformers. Lack of accurate real-time measurements on performance has resulted in the use of lagging indicators, such as oil sample analysis. To address this need, an innovative embedded optical sensing technology, Transformer Real-time Assessment Intelligent System (TRANSENSOR) was developed, validated and demonstrated in this project. To date, TRANSENSOR has focused on transformers but is extendable to other grid assets. In addition to the technology being embedded into new transformers during manufacturing, a retrofit configuration that can be installed on existing transformers in the field was also developed. It is anticipated that the ability to retrofit existing transformers will help accelerate adoption of the underlying TRANSENSOR technology. Phase 1 of the project focused on laboratory development and qualification of the technology. Following iterations and exploration of relevant optical sensing modalities and multiplexed configurations of interest for the transformer environment, an effective candidate configuration was agreed upon, down-selected and custom-designed for embedding into General Electric (GE) network transformers. Two new GE 500 kilovolt ampere (kVA), 27 kilovolt (kV) distribution network transformers were built with embedded fiber-optic (FO) sensors and successfully qualified per industry standards at GE’s Shreveport, Louisiana facility during Phase 1 of the project. Following the successful completion of Phase 1, the team proceeded to Phase 2, which focused on a field demonstration of the technology. Over Phase 2, the first new GE transformer built with embedded fiber-optic sensors was installed in an above-ground cage and connected to the grid at Con Edison’s Astoria facility. A second transformer equipped with TRANSENSOR was installed in an underground vault. Additionally, an older (1982 year model) GE transformer in an above-ground cage was retrofitted with fiber- optic sensors and reconnected to the grid at ConEd’s facility. Analysis of data acquired from the sensors showed interesting correlations with transformer loading. Additionally, key events such as transformer low-voltage network connection, primary-side energizing, and a pressure loss event from an oil sampling were detected by the TRANSENSOR system. Online data processing/feature extraction algorithms for the second transformer in the underground vault detected key features and event alerts that were transmitted through a wireless 4G connection. The remote deployment concept showed promising results with data collection running for a total of 8 months across the three (3) GE transformers instrumented for the Phase 2 field demonstration. This sets the stage well for further development and commercialization.

24 POWER TRANSMISSION AND DISTRIBUTION↗
NASA NTRS1999

Autonomous Science Analyses of Digital Images for Mars Sample Return and Beyond

To adequately explore high priority landing sites, scientists require rovers with greater mobility. Therefore, future Mars missions will involve rovers capable of traversing tens of kilometers (vs. tens of meters traversed by Mars Pathfinder's Sojourner). However, the current process by which scientists interact with a rover does not scale to such distances. A single science objective is achieved through many iterations of a basic command cycle: (1) all data must be transmitted to Earth and analyzed; (2) from this data, new targets are selected and the necessary information from the appropriate instruments are requested; (3) new commands are then uplinked and executed by the spacecraft and (4) the resulting data are returned to Earth, starting the process again. Experience with rover tests on Earth shows that this time intensive process cannot be substantially shortened given the limited data downlink bandwidth and command cycle opportunities of real missions. Sending complete multicolor panoramas at several waypoints, for example, is out of the question for a single downlink opportunity. As a result, long traverses requiring many science command cycles would likely require many weeks, months or even years, perhaps exceeding rover design life or other constraints. Autonomous onboard science analyses can address these problems in two ways. First, it will allow the rover to transmit only "interesting" images, defined as those likely to have higher science content. Second, the rover will be able to anticipate future commands, for example acquiring and returning spectra of "interesting" rocks along with the images in which they were detected. Such approaches, coupled with appropriate navigational software, address both the data volume and command cycle bottlenecks that limit both rover mobility and science yield. We are developing algorithms to enable such intelligent decision making by autonomous spacecraft. Reflecting the ultimate level of ability we aim for, this program has been dubbed the "Grad Student on Mars Project". We envision, for example, an appropriately intelligent Athena-like rover at the Pathfinder landing site might be able to traverse over the ridge towards "Twin Peaks" to obtain better information on the stratigraphy of these "streamlined islands" or of the size, composition and morphology of boulders located on them. Along the traverse, the intelligent rover would collect and analyze images and obtain spectra of geologically interesting features or regions. The intelligent rover might also traverse further up Arcs Vallis, and find additional paleoflood stage indicators such as slackwater deposits. Recognizing additional regions where boulders are imbricated, noting changes in their size, distribution, morphology, composition and the associated changes in channel geometry would yield important information on the outflow channel's paleoflood history, Representative images and associated supporting data from these locations could be downlinked to Earth along with the data requested by scientists from the previous uplink opportunity. Our initial work has focused on recognizing geologically interesting portions of images. Here we summarize some of the algorithms to date.

Gulick, V. C.↗
NASA NTRS2016

Transitioning Autonomous Systems Technology Research to a Flight Software Environment

NASA has developed methods and algorithms for autonomous spacecraft operations,including automated planning and scheduling, fault diagnostics and impact determination,procedure management and display. Making the transition from technology research tooperational flight software requires overcoming significant technical, programmatic andcultural challenges. Technology research is aimed at developing methods that performspecific functions correctly, but the resulting software may not be designed for flightprocessors with limited CPU, memory and network resources, and may not be easilyintegrated into spacecraft flight software. Our objective in the Autonomous Systems andOperations Project is to make significant strides toward the transformation from technologyto operational use. Our focus was twofold: maturing research grade autonomy software intoa flight software environment using broadly accepted languages and tools; and integratingautonomy applications with each other and with representative systems and their data andcommand interfaces. For a target flight software environment, we chose Core FlightSoftware, developed by Goddard Space Flight Center as a common operating systemindependent framework. Our hardware integration environment was provided by theIntegrated Power and Avionics Systems (iPAS) Lab at Johnson Space Center, in whichvarious subsystem development has been conducted to address engineering challenges forthe vehicles and systems required for long-duration missions into the solar system. The iPASand its network of connected facilities provides realistic subsystem hardware or simulationsof spacecraft power, life support, guidance, navigation and control, and command and datahandling subsystems. Interfaces between autonomy applications and the subsystems beingassessed and controlled were developed, assessed and refined. The hardware and softwareenvironment using CFS and the iPAS facility has proven to be a highly flexible and realisticenvironment in which to rapidly integrate applications in an iterative, low cost setting. Usingthe integration environment we have developed, we will turn our focus to performance andsizing analysis to determine the computational requirements for full-scale deployment ofautonomy technology. Scalability of reasoners and the spacecraft models upon which theyoperate, and robustness across the full range of spacecraft conditions and environments willbe explored and improved. We are making significant contributions to the future programsthat will build the spacecraft that will take humans beyond the Earth-Moon system, in whichprogram Systems Engineers will be able to accurately and confidently design in accurate,robust and mature autonomous operations systems.

Flight Software↗
NASA NTRS2017

Radiation, Smoke and Clouds Observed in the Southeastern Atlantic With the Research Scanning Polarimeter During ORACLES

The ObseRvations of Aerosols above Clouds and their interactions (ORACLES) project is making a series of field deployments to the southeastern Atlantic with NASA ER-2 and P3 aircraft to acquire both detailed remote sensing observations and in situ measurements of the aerosols and clouds in that region. This area is home to one of the largest low-level cloud decks on Earth that is seasonally affected by vast plumes of smoke from biomass burning, which in effect provides a natural experiment testing the radiative and microphysical interactions between the smoke and the clouds. The downward solar radiation at the surface, or cloud top, is always reduced by the presence of smoke. However, whether the amount of sunlight reflected back out to space is increased, or decreased by the presence of smoke is sensitively dependent on the brightness of the clouds and the fraction of light that the smoke absorbs each time light hits a smoke particle. In this study we use data from the Research Scanning Polarimeter, an along track scanning instrument, that provides measurements of the Stokes parameters I, Q and U at 410, 470, 555, 670, 865, 960, 1590, 1880 and 2260 nm at 150 viewing angles over a range of +/- 60° from nadir for each contiguous sub-aircraft pixel (~ 300 m in size). A retrieval algorithm is applied to the data acquired with a table look up technique, similar to that of the operational POLDER algorithm, to provide a first guess of the complex refractive index, optical depth and size distribution of the smoke particles together with cloud droplet size and optical depth. A subsequent iterative fitting procedure, where the fact that the doubling/adding method allows the construction of the Green's function for the radiative transfer equation, is used to obtain an efficient and statistically optimal estimate of the aerosol and cloud retrieval parameters. These retrieval parameters are evaluated against in situ observations, when available, and the optical depth and intensive lidar variables that are measured by the High Spectral Resolution Lidar 2. Finally, the aerosol and cloud retrievals are used to evaluate the variations in top of the atmosphere, surface/cloud top shortwave radiative forcing and atmospheric absorption that are caused by variations in the smoke and clouds.

Cairns, Brian↗
NASA NTRS1997

Efficient Gradient-Based Shape Optimization Methodology Using Inviscid/Viscous CFD

The formerly developed preconditioned-biconjugate-gradient (PBCG) solvers for the analysis and the sensitivity equations had resulted in very large error reductions per iteration; quadratic convergence was achieved whenever the solution entered the domain of attraction to the root. Its memory requirement was also lower as compared to a direct inversion solver. However, this memory requirement was high enough to preclude the realistic, high grid-density design of a practical 3D geometry. This limitation served as the impetus to the first-year activity (March 9, 1995 to March 8, 1996). Therefore, the major activity for this period was the development of the low-memory methodology for the discrete-sensitivity-based shape optimization. This was accomplished by solving all the resulting sets of equations using an alternating-direction-implicit (ADI) approach. The results indicated that shape optimization problems which required large numbers of grid points could be resolved with a gradient-based approach. Therefore, to better utilize the computational resources, it was recommended that a number of coarse grid cases, using the PBCG method, should initially be conducted to better define the optimization problem and the design space, and obtain an improved initial shape. Subsequently, a fine grid shape optimization, which necessitates using the ADI method, should be conducted to accurately obtain the final optimized shape. The other activity during this period was the interaction with the members of the Aerodynamic and Aeroacoustic Methods Branch of Langley Research Center during one stage of their investigation to develop an adjoint-variable sensitivity method using the viscous flow equations. This method had algorithmic similarities to the variational sensitivity methods and the control-theory approach. However, unlike the prior studies, it was considered for the three-dimensional, viscous flow equations. The major accomplishment in the second period of this project (March 9, 1996 to March 8, 1997) was the extension of the shape optimization methodology for the Thin-Layer Navier-Stokes equations. Both the Euler-based and the TLNS-based analyses compared with the analyses obtained using the CFL3D code. The sensitivities, again from both levels of the flow equations, also compared very well with the finite-differenced sensitivities. A fairly large set of shape optimization cases were conducted to study a number of issues previously not well understood. The testbed for these cases was the shaping of an arrow wing in Mach 2.4 flow. All the final shapes, obtained either from a coarse-grid-based or a fine-grid-based optimization, using either a Euler-based or a TLNS-based analysis, were all re-analyzed using a fine-grid, TLNS solution for their function evaluations. This allowed for a more fair comparison of their relative merits. From the aerodynamic performance standpoint, the fine-grid TLNS-based optimization produced the best shape, and the fine-grid Euler-based optimization produced the lowest cruise efficiency.

Baysal, Oktay↗
DOE OSTI2024

Fox Trails

1. This software utilizes python pandas to pull data from P6 databases or XER files. The software transforms the datasets into multiple main tables by joining, filtering, iteratively flattening hierarchical structured data, and pivoting datasets to give simple flat output tables. The activity table includes all of the information related to an activity including activity codes, global, EPS, and project codes, UDFs, and WBS information as separate columns. This includes the code id, code value and sequence number for all levels in hierarchical codes. The resource table is similar to the activity table and includes all of the information related to resources on activities including UPFs and resource codes. The resource time phased table takes the resource information and time phases it for the budget, forecast, late, and actual dates/units/costs that closely matches P6's user interface's values as it implements the resource curve and calendars. The wbs table contains the WBS structure broken out by levels and includes UDFs, codes, and notebook topics. The final P6 data table is the relationships table which simply contains the relationships. 2. When a user updates the tool with data (via giving it P6 project names with database username/password information or XER files) the system creates the data in #1, then creates a networkx graph with the activity data imbedded in the node data and the relationships added as edges. Each edge also has it's float calculated (working time distance between the predecessor and successor) and attached to the edge. Activities are also tagged as a potential start of a path based on their constraints, constraint dates, remaining start date, and activity status. When a user enters an activity ID into the UI, it runs a shortest path calculation on the network graph between each node tagged as potential start to the entered activity id based on the float tagged on the edge. Each path returned by the algorithm contains all of the nodes on the path in order, as well as the total float of the edges that make the path. This data is then collected and returned to the user in the form of a gantt chart with groupings for each path that includes the total float for each group. 3. Similar to 2, if the user passes through a reference dataset each activity set in the path is checked to see if it had a path in the reference dataset, if that path was the primary path between the start and end activities, and what has changed regarding logic and durations. These changes are color coded and summarized before sent to the user to be displayed by the UI for simple discovery. 4. Utilizing the data from #1, the user can submit desired grouping code(s) and filters to the system. The system will then pull the activities, resources, and relationships and create a gantt chart based on the groupings sent and filtered based on the filters sent. 5. The system will produce a gantt chart in a similar method to #4, but allows interactivity with the data. As the user interacts with the gantt chart, the software captures the changes and stores it with the user making the change so that project controls and implement those changes in P6.

Fox, Ben↗
DOE OSTI2026

Intelligent Experiments through Real-Time AI: Fast Data Processing and Autonomous Detector Control for High-Energy Nuclear Experiments

The aim of this project is to develop software and hardware for fast real-time data processing and autonomous detector control and calibration for the sPHENIX and the future EIC experiments. Below summarizes Georgia Tech team efforts in the past year: 1. We developed a real-time clustering algorithm and FPGA-based pipeline architecture for processing fired pixel data from ALPIDE sensors in sPHENIX experiments. Our Columnar Clustering Co-Design introduces a hardware-aware, stream-friendly approach that segments pixel data by column pairs using a Column Pair Clustering (CPC) strategy, followed by Cluster Stitching to merge adjacent subclusters. Implemented in Vitis HLS, the pipeline comprises five stages—read-in, subclustering, stitching, analysis, and write-out—connected by tagged HLS streams with custom end-of-event signaling for robust synchronization. We designed a pipelined dataflow model optimized for throughput, low latency, and minimal buffering, enabling scalable clustering across events of arbitrary size. Our system maintains spatial precision via center-of-mass and shape key extraction and efficiently handles edge cases such as fragmented or nested clusters. Compared against DBSCAN in both software and hardware, our approach demonstrates competitive performance under FPGA constraints. 2. We also conducted a comprehensive algorithm-to-hardware co-design of connected component analysis tailored for sPHENIX experiments, focusing on real-time, low-latency processing using FPGAs and High-Level Synthesis (HLS). Starting from a Python-based particle tracking pipeline, the team translated the core logic—graph traversal via DFS and Union-Find—into an HLS-compatible C++ model, replacing dynamic memory and recursion with static arrays and pipelined control flow. The final design includes a fully streamed and dataflow-compatible Union-Find kernel optimized across five iterations, incorporating loop pipelining, array partitioning, AXI/FIFO interface tuning, and function flattening. Experimental results show up to 14.8× speedup over the CPU baseline, reducing per-graph latency to 1.58 μs and demonstrating strong resource efficiency with only ~7k LUTs and zero BRAM usage. The design maintains functional correctness against the Python reference using a Python-based C-simulation framework and Mean Squared Error metrics. This work validates the potential of HLS-driven FPGA designs for edge-level HEP data acquisition, laying a scalable foundation for future integration with real-time detector pipelines and multi-graph processing systems.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗