Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “multiple iterations”

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 235 records · Page 13

Iterative-Transform Phase Retrieval Using Adaptive Diversity

A phase-diverse iterative-transform phase-retrieval algorithm enables high spatial-frequency, high-dynamic-range, image-based wavefront sensing. [The terms phase-diverse, phase retrieval, image-based, and wavefront sensing are defined in the first of the two immediately preceding articles, Broadband Phase Retrieval for Image-Based Wavefront Sensing (GSC-14899-1).] As described below, no prior phase-retrieval algorithm has offered both high dynamic range and the capability to recover high spatial-frequency components. Each of the previously developed image-based phase-retrieval techniques can be classified into one of two categories: iterative transform or parametric. Among the modifications of the original iterative-transform approach has been the introduction of a defocus diversity function (also defined in the cited companion article). Modifications of the original parametric approach have included minimizing alternative objective functions as well as implementing a variety of nonlinear optimization methods. The iterative-transform approach offers the advantage of ability to recover low, middle, and high spatial frequencies, but has disadvantage of having a limited dynamic range to one wavelength or less. In contrast, parametric phase retrieval offers the advantage of high dynamic range, but is poorly suited for recovering higher spatial frequency aberrations. The present phase-diverse iterative transform phase-retrieval algorithm offers both the high-spatial-frequency capability of the iterative-transform approach and the high dynamic range of parametric phase-recovery techniques. In implementation, this is a focus-diverse iterative-transform phaseretrieval algorithm that incorporates an adaptive diversity function, which makes it possible to avoid phase unwrapping while preserving high-spatial-frequency recovery. The algorithm includes an inner and an outer loop (see figure). An initial estimate of phase is used to start the algorithm on the inner loop, wherein multiple intensity images are processed, each using a different defocus value. The processing is done by an iterative-transform method, yielding individual phase estimates corresponding to each image of the defocus-diversity data set. These individual phase estimates are combined in a weighted average to form a new phase estimate, which serves as the initial phase estimate for either the next iteration of the iterative-transform method or, if the maximum number of iterations has been reached, for the next several steps, which constitute the outerloop portion of the algorithm. The details of the next several steps must be omitted here for the sake of brevity. The overall effect of these steps is to adaptively update the diversity defocus values according to recovery of global defocus in the phase estimate. Aberration recovery varies with differing amounts as the amount of diversity defocus is updated in each image; thus, feedback is incorporated into the recovery process. This process is iterated until the global defocus error is driven to zero during the recovery process. The amplitude of aberration may far exceed one wavelength after completion of the inner-loop portion of the algorithm, and the classical iterative transform method does not, by itself, enable recovery of multi-wavelength aberrations. Hence, in the absence of a means of off-loading the multi-wavelength portion of the aberration, the algorithm would produce a wrapped phase map. However, a special aberration-fitting procedure can be applied to the wrapped phase data to transfer at least some portion of the multi-wavelength aberration to the diversity function, wherein the data are treated as known phase values. In this way, a multiwavelength aberration can be recovered incrementally by successively applying the aberration-fitting procedure to intermediate wrapped phase maps. During recovery, as more of the aberration is transferred to the diversity function following successive iterations around the ter loop, the estimated phase ceases to wrap in places where the aberration values become incorporated as part of the diversity function. As a result, as the aberration content is transferred to the diversity function, the phase estimate resembles that of a reference flat.

Dean, Bruce H.↗

Dragonfly Rotor Optimization using Machine Learning Applied to an OVERFLOW Generated Airfoil Database

NASA’s 4th New Frontiers Mission is the Titan Dragonfly relocatable lander. This coaxial quadrotor vehicle will be launched on a rocket to Titan in 2028. Following a gravity assisted Earth flyby and an approximate 6-year transit, Dragonfly will enter the Titan atmosphere around 2034 with the goal of exploring Titan’s pre-biotic chemistry and habitability. The multirotor design for this unique application has continually evolved since 2016 with constraints such as Titan’s cryogenic atmosphere at 95 Kelvin (-288 F), gravity 14% that of Earth’s, atmospheric density 440% of standard sea-level air, and the inability to test the entire system together under all these conditions until the first flight on Titan. This paper focuses on rotor design aspects of the Dragonfly lander and introduces a novel framework for multirotor design optimization considering multiple flight conditions. The methodology leverages machine learning methods and is demonstrated in the context of Dragonfly. A new OVERFLOW Machine Learning Airfoil Performance (PALMO) database is first presented. PALMO is then wrapped inside a Bayesian optimization framework and applied to a 4-rotor system (one side of the Dragonfly lander). Training data is generated on each iteration of the optimization using the CAMRAD-II comprehensive analysis software to evaluate successive rotor designs in multiple relevant flight conditions. An optimal design for the 4-rotor system was found with approximately 900 rotor designs analyzed in CAMRAD-II, which required 9 million queries of the PALMO surrogate models. This demonstration case evaluated 10,000,000 potential candidate rotor designs in 5.5 hours on 114 CPU cores using uniform inflow, and in 27.8 hours using the prescribed wake model. This work thus enables mid-fidelity rotor design optimization without requiring access to high-performance computing.

Dragonfly↗

In vitro prototyping of limonene biosynthesis using cell-free protein synthesis

Metabolic engineering of microorganisms to produce sustainable chemicals has emerged as an important part of the global bioeconomy. Unfortunately, efforts to design and engineer microbial cell factories are challenging because design-build-test cycles, iterations of re-engineering organisms to test and optimize new sets of enzymes, are slow. To alleviate this challenge, we demonstrate a cell-free approach termed in vitro Prototyping and Rapid Optimization of Biosynthetic Enzymes (or iPROBE). In iPROBE, a large number of pathway combinations can be rapidly built and optimized. The key idea is to use cell-free protein synthesis (CFPS) to manufacture pathway enzymes in separate reactions that are then mixed to modularly assemble multiple, distinct biosynthetic pathways. As a model, we apply our approach to the 9-step heterologous enzyme pathway to limonene in extracts from Escherichia coli. In iterative cycles of design, we studied the impact of 54 enzyme homologs, multiple enzyme levels, and cofactor concentrations on pathway performance. In total, we screened over 150 unique sets of enzymes in 580 unique pathway conditions to increase limonene production in 24 h from 0.2 to 4.5 mM (23–610 mg/L). Finally, to demonstrate the modularity of this pathway, we also synthesized the biofuel precursors pinene and bisabolene. Finally, we anticipate that iPROBE will accelerate design-build-test cycles for metabolic engineering, enabling data-driven multiplexed cell-free methods for testing large combinations of biosynthetic enzymes to inform cellular design.

59 BASIC BIOLOGICAL SCIENCES↗

Robust reconstruction of single-cell RNA-seq data with iterative gene weight updates

Single-cell RNA-sequencing technologies have greatly enhanced our understanding of heterogeneous cell populations and underlying regulatory processes. However, structural (spatial or temporal) relations between cells are lost during cell dissociation. These relations are crucial for identifying associated biological processes. Many existing tissue-reconstruction algorithms use prior information about subsets of genes that are informative with respect to the structure or process to be reconstructed. When such information is not available, and in the general case when the input genes code for multiple processes, including being susceptible to noise, biological reconstruction is often computationally challenging. We propose an algorithm that iteratively identifies manifold-informative genes using existing reconstruction algorithms for single-cell RNA-seq data as subroutine. We show that our algorithm improves the quality of tissue reconstruction for diverse synthetic and real scRNA-seq data, including data from the mammalian intestinal epithelium and liver lobules.

59 BASIC BIOLOGICAL SCIENCES↗

Computationally restoring the potency of a clinical antibody against Omicron

The COVID-19 pandemic underscored the promise of monoclonal antibody-based prophylactic and therapeutic drugs and revealed how quickly viral escape can curtail effective options. When the SARS-CoV-2 Omicron variant emerged in 2021, many antibody drug products lost potency, including Evusheld and its constituent, cilgavimab. Cilgavimab, like its progenitor COV2-2130, is a class 3 antibody that is compatible with other antibodies in combination4 and is challenging to replace with existing approaches. Rapidly modifying such high-value antibodies to restore efficacy against emerging variants is a compelling mitigation strategy. We sought to redesign and renew the efficacy of COV2-2130 against Omicron BA.1 and BA.1.1 strains while maintaining efficacy against the dominant Delta variant. Here we show that our computationally redesigned antibody, 2130-1-0114-112, achieves this objective, simultaneously increases neutralization potency against Delta and subsequent variants of concern, and provides protection in vivo against the strains tested: WA1/2020, BA.1.1 and BA.5. Deep mutational scanning of tens of thousands of pseudovirus variants reveals that 2130-1-0114-112 improves broad potency without increasing escape liabilities. Our results suggest that computational approaches can optimize an antibody to target multiple escape variants, while simultaneously enriching potency. Our computational approach does not require experimental iterations or pre-existing binding data, thus enabling rapid response strategies to address escape variants or lessen escape vulnerabilities.

60 APPLIED LIFE SCIENCES↗

Simulating energetic ions and enhanced fusion rates from ion-cyclotron resonance heating with a full-wave/Fokker–Planck model

Reproducing fast-ion enhanced fusion rates from ion-cyclotron resonance heating (ICRH) in tokamaks requires the self-consistent coupling of a full-wave solver and a Fokker–Planck solver, which evolves multiple simultaneously resonant ion species. We introduce a new self-consistent model that iterates the TORIC full-wave solver with the CQL3D Fokker–Planck solver using the integrated plasma simulator (IPS). This model evolves the bounce-averaged ion distribution functions in both parallel and perpendicular velocity-space with a quasilinear radio frequency (RF) diffusion operator valid in the ion finite Larmor radius (FLR) limit and the RF electric fields with the resultant non-Maxwellian FLR dielectric tensor. This produces non-Maxwellian ICRH simulations that are fully self-consistent, fast, and interoperable with integrated modeling frameworks, such as TRANSP/GACODE/IPS-FASTRAN. We demonstrate our model's capabilities by validating it against experimental data in Alcator C-Mod. We then perform the first RF heating simulations of SPARC using self-consistent non-Maxwellian ion distributions to investigate the potential to enhance fusion rates using ion cyclotron resonance heating generated fast ions.

Physics↗

Modeling of ExB effects on tungsten re-deposition and transport in the DIII-D divertor

Mixed-material DIVIMP-WallDYN modelling, now incorporating ExB drifts, is presented that simultaneously reproduces tungsten (W) erosion and deposition patterns observed during the DIII-D Metal Rings Campaign, in which a toroidally symmetric set of W-coated tiles were installed in the carbon (C) DIII-D divertor. Since most reactor plasma facing component (PFC) designs call for mixed-material environments, including ITER’s W/Be enviroment, the divertor targets will quickly evolve into reconstitued surfaces of multiple elements. This work identifies controlling physics that affects material migration patterns in the divertor, which impact PFC lifetimes and impurity leakage from the divertor to the core. These simulations indicate that radial and poloidal ExB transport dominates over parallel force balance for high-Z impurities such as W in the divertor region of DIII-D. It is demonstrated that ExB drifts are required to reproduce the experimental observation of non-local W and C co-accumulation in a band ~7-9 cm outboard of the outer-strike-point (OSP) W source, for attached Lmode conditions in the unfavorable ion grad-B drift direction. In addition, W gross erosion is localized to the region outboard of the OSP, as the formation of C co-deposits suppresses W erosion at the strike point. Time-dependent simulations with scaled ExB impurity drifts (60% of the OEDGE-calculated drift velocity) and W re-erosion quantitatively reproduce these features, including depth-resolved W/C ratios, within a factor of 2 over ~115 seconds of accumulated plasma exposure. The location of co-deposition regions is shown to be well represented by an analytic leakage model, driven largely by poloidal ExB drifts. Qualitative agreement is also found between campaign-integrated W deposition measurements and simulations for the favorable ion grad-B drift direction, the standard mode of operation for most tokamaks. Furthermore, these results imply that a longterm inward radial migration of material from the outer divertor through the private flux region may occur in future devices.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Field Test Report Neutron Scintillator Array Dry Storage Cask Scanner FY2024

During two weeks of Field Testing at the Idaho National Laboratory INTEC Cask Farm in July and August 2024, the LLNL Dry Storage Cask Scanner Array was lifted on top of an MC-10 dry storage fuel cask and operated to acquire neutron and gamma-ray data from the 24 fuel bundle positions. Neutron and gamma-ray data acquisition scans across the top of the cask of varying dwell times were performed July 15-18, 2024 and August 19-22, 2024 to evaluate the ability of the scanner data to reveal asymmetries in the fuel positions that reflect asymmetries in the MC-10 cask fuel bundle loading. The MC-10 cask 24 position fuel bundle loading at the INTEC Cask Farm is well documented, including the locations of six empty fuel bundle positions. This loading presents an opportunity to test the ability of the scanner system to detect diversion of spent fuel bundles as well as to validate the MC-10 cask MCNP modeling. The cask scanner array consists of six Stilbene crystal scintillator detectors and a linear actuator frame that moves the six detectors across the MC-10 dry storage cask to obtain data above each of the 24 fuel bundle positions. The detectors are connected to a pulse-shape discrimination data acquisition system capable of generating separate neutron and gamma-ray spectra for each detector and for each scan position. From the prior single detector Field Test in 2021 and iteration with MCNP modeling, the neutron and gamma-ray data were analyzed in multiple energy regions to identify an analysis method that would provide the strongest and most consistent signature of the asymmetric MC-10 cask fuel loading1 . From both the 2021 Field Test and the current Field Test results, the neutron capture gamma-ray count rate around 2.2 MeV provides the strongest signature of the asymmetric MC-10 cask fuel loading and has qualitative agreement with MCNP calculations. Counting all gamma-rays produces a similar signature. Neutrons emerging from the cask top are moderated and captured by the hydrogen in the polyethylene moderator and scintillator detector, producing a 2.2 MeV gamma ray which is seen in the scintillator gamma-ray spectrum. The count rate in the 2.2 MeV gamma-ray region is ~50 c/s, which is ~1000x higher than the ~0.05 n/s rate in the > 4MeV neutron region, and ~50x greater than the ~1 n/s rate in the neutrons > 500 keV region. Analysis of the 2.2 MeV neutron-capture Compton-scattered gamma-rays produces a statistically significant signature of the INTEC Cask Farm MC-10 asymmetric fuel loading. MCNP simulations indicate that the average neutron energy spectrum offers the potential to detect a large asymmetry from several missing bundles as well as individual missing fuel bundles. Testing this feature will require measurements on a cask with single missing elements.

11 NUCLEAR FUEL CYCLE AND FUEL MATERIALS↗

Technical note: A modified formulation of dynamic energy budget theory for faster computation of biological growth

Abstract. The mass conservation equation in the presence of boundary fluxes and chemical reactions from non-equilibrium thermodynamics is used to derive a modified dynamic energy budget (mDEB) model. Compared to the standard dynamic energy budget (sDEB) model (Kooijman, 2009), this modified formulation does not place the dilution effect in the mobilization kinetics of reserve biomass, and it maintains the partition principle for reserve mobilization dynamics for both linear and non-linear kinetics. Overall, the mDEB model shares most features with the sDEB model. However, for biological growth that requires multiple nutrients, the mDEB model is computationally much more efficient by not requiring numerical iterations for obtaining the specific growth rate. In an example of modeling the growth of Thalassiosira weissflogii in a nitrogen-limiting chemostat, the mDEB model was found to have almost the same accuracy as the sDEB model while requiring almost half of the computing time of the sDEB model. Since the sDEB model has been successfully applied in numerous studies, we believe that the mDEB model can help improve the modeling of biological growth and the associated ecosystem processes in various contexts.

Tang, Jinyun↗

A Comparison of Techniques for Scheduling Fleets of Earth-Observing Satellites

Earth observing satellite (EOS) scheduling is a complex real-world domain representative of a broad class of over-subscription scheduling problems. Over-subscription problems are those where requests for a facility exceed its capacity. These problems arise in a wide variety of NASA and terrestrial domains and are .XI important class of scheduling problems because such facilities often represent large capital investments. We have run experiments comparing multiple variants of the genetic algorithm, hill climbing, simulated annealing, squeaky wheel optimization and iterated sampling on two variants of a realistically-sized model of the EOS scheduling problem. These are implemented as permutation-based methods; methods that search in the space of priority orderings of observation requests and evaluate each permutation by using it to drive a greedy scheduler. Simulated annealing performs best and random mutation operators outperform our squeaky (more intelligent) operator. Furthermore, taking smaller steps towards the end of the search improves performance.

Globus, Al↗

QTGA Analysis with Concurrent Deposition

Analysis of outgassed species behavior is often performed using QCM thermogravimetric analysis (QTGA). Prior methods are suited to laboratory testing of materials samples where the source of contaminant can be removed from the system. An approach suitable presented for use during hardware bakeout and outgassing certification is presented. An iterative process is shown to fit surface activation energies and the arrival flux for multiple species.

Hughes, David W.↗

Iterative solution of large, sparse linear systems on a static data flow architecture - Performance studies

The applicability of static data flow architectures to the iterative solution of sparse linear systems of equations is investigated. An analytic performance model of a static data flow computation is developed. This model includes both spatial parallelism, concurrent execution in multiple PE's, and pipelining, the streaming of data from array memories through the PE's. The performance model is used to analyze a row partitioned iterative algorithm for solving sparse linear systems of algebraic equations. Based on this analysis, design parameters for the static data flow architecture as a function of matrix sparsity and dimension are proposed.

Reed, D. A.↗

Developing an Active Learning algorithm for learning Bayesian classifiers under the Multiple Instance Learning scenario

In the Multiple Instance Learning scenario, the training data consists of instances grouped into bags, and each bag is labelled with whether it is positive, i.e. contains at least one positive instance. First, Active Learning, in which additional labels can be iteratively requested, has the potential to allow more accurate classifiers to be learned with less labels. Active Learning has been applied to the Multiple Instance Learning under two settings: when bag labels of unlabelled bags can be requested, and when instance labels within bags known to be positive can be requested. Second, Bayesian Active learning methods have the potential to learn accurate classifiers with few labels, because they explicitly track the classifier uncertainty and can thus address its knowledge gaps. Yet, there does not exist any Bayesian Active Learning method for the Multiple Instance Learning Scenario. In this work, we develop the first such method. We develop a Bayesian classifier for the Multiple Instance Learning scenario, show how it can be efficiently used for Bayesian Active Learning, and perform experiments assessing its performance. While its performance exceeds that when no Active Learning is used, it is sometimes better, sometimes worse than the naive baseline of uncertainty sampling, depending on the situation. This suggests future work: building more customizable Bayesian Active Learning methods for the Multiple Instance Scenario, customizable to whether bag or instance label accuracy is targeted, and the labeling budget.

97 MATHEMATICS AND COMPUTING↗

A microwave scattering model for layered vegetation

A microwave scattering model was developed for layered vegetation based on an iterative solution of the radiative transfer equation up to the second order to account for multiple scattering within the canopy and between the ground and the canopy. The model is designed to operate over a wide frequency range for both deciduous and coniferous forest and to account for the branch size distribution, leaf orientation distribution, and branch orientation distribution for each size. The canopy is modeled as a two-layered medium above a rough interface. The upper layer is the crown containing leaves, stems, and branches. The lower layer is the trunk region modeled as randomly positioned cylinders with a preferred orientation distribution above an irregular soil surface. Comparisons of this model with measurements from deciduous and coniferous forests show good agreements at several frequencies for both like and cross polarizations. Major features of the model needed to realize the agreement include allowance for: (1) branch size distribution, (2) second-order effects, and (3) tree component models valid over a wide range of frequencies.

Karam, Mostafa A.↗

A Comparison of Techniques for Scheduling Earth-Observing Satellites

Scheduling observations by coordinated fleets of Earth Observing Satellites (EOS) involves large search spaces, complex constraints and poorly understood bottlenecks, conditions where evolutionary and related algorithms are often effective. However, there are many such algorithms and the best one to use is not clear. Here we compare multiple variants of the genetic algorithm: stochastic hill climbing, simulated annealing, squeaky wheel optimization and iterated sampling on ten realistically-sized EOS scheduling problems. Schedules are represented by a permutation (non-temperal ordering) of the observation requests. A simple deterministic scheduler assigns times and resources to each observation request in the order indicated by the permutation, discarding those that violate the constraints created by previously scheduled observations. Simulated annealing performs best. Random mutation outperform a more 'intelligent' mutator. Furthermore, the best mutator, by a small margin, was a novel approach we call temperature dependent random sampling that makes large changes in the early stages of evolution and smaller changes towards the end of search.

Globus, Al↗

Implementation and Testing of Inverse Kinematics on Robotic Arm

COSIE (Coronal Spectrographic Imager in the Extreme Ultraviolet) is a proposed solar tracking ISS imaging payload that will help bridge the theoretical gap between the physics of the low corona and the heliosphere. This scientific instrument requires high pointing accuracy, on the order of arc seconds. The instrument is mounted on to a three revolute joint robotic arm in order to track the roll, pitch and yaw motion of the Sun. The goal of this project is to construct a prototype model of the robotic arm and implement the proposed analytical inverse kinematics algorithm. In robotics, the inverse kinematics problem is solving for the set of joint angles that achieve the desired end effect or location and/or orientation. In this case, orientation is the focus. Depending on the configuration, multiple sets of joint angle solutions may exist. Due to the complexity of robotics, typically iterative methods are used to solve for the joint angle solution sets. However, in this case, an analytical solution exists. A small robotic arm representative of the full size hardware was constructed. The inverse kinematics algorithm, originally in MATLAB/Simulink, was converted into C in order to interface with the motors. This C software was implemented on a Windows PC and micro-controller, and serial communication between the two was established, allowing the motors to be directly controlled by the inverse kinematics algorithm. Testing the inverse kinematics on a physical system will allow the validity and accuracy of the analytic solution to be verified.

Franz, Carter↗

Machine Learning for Dynamic Test Sensor Placement

There are multiple different algorithms to perform modal test sensor placement optimization: effective independence, residual kinetic energy, iterative Guyan reduction, genetic algorithms, or a brute-force methodology. However, any of these methods may be computationally expensive, especially for structural models with a large number of degrees of freedom. Given the high-cost and the need to optimize the solution, modal sensor placement is a great application for machine learning (ML) algorithms. In this paper, we will apply ML algorithms to determine the optimal sensor locations for simple and complex structures. We will also discuss the benefits and drawbacks of using machine learning over other sensor placement algorithms.

Kelsey Buckles↗