Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “experimental 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 271 records · Page 15
All sourcesNASA NTRSDOE OSTI
DOE OSTI2021

Rapid retrieval of first-order spatiotemporal distortions for ultrashort laser pulses

High-intensity, ultrashort laser sources are a foundational pillar for High-Energy-Density (HED) physics, and as the repetition-rates of these systems increase, diagnostics must be developed to match their data collection speed. Characterization of any spatiotemporal distortions in the laser pulse is necessary in order to standardize results across facilities. Here, we have previously developed a laser diagnostic called Spatially and Temporally Resolved Intensity and Phase Evaluation Device: Full Information from a Single Hologram, or STRIPED FISH, to measure the full spatiotemporal laser electric field on a single shot. In order to provide rapid feedback, we here adapt the STRIPED FISH retrieval algorithm, which typically has computation times of up to 30 minutes due to the high spatial resolution of the device and its retrieval of the complete four-dimensional pulse field, to distill the key electric field quantities into a handful of scalars for rapid assessment of the pulse's first order distortions. Here, our new, rapid non-iterative retrieval algorithm is validated with simulated and experimental data, and it provides, within seconds, the same first-order information as given by the full analysis. This algorithm is suitable for on-shot assessment of spatiotemporal distortions and can be adapted to assess high repetition-rate laser quality in HED experiments.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗
DOE OSTI2026

Evaluating Limits of Machine Learning-Assisted Raman Spectroscopy in Classification of Biological Samples

Machine learning (ML)-assisted Raman spectroscopy has become a powerful analytical tool for the classification and identification of analytes; however, technical challenges impacting its detection accuracy have not been thoroughly investigated. This study explores experimental factors affecting classification performance. Among the evaluated ML models, ML algorithms show minimal impact on classification accuracy. Instead, experimental factors, including spectral similarity between tested samples and data quality, dominate detection performance. Increases in spectral noise and spectral similarity significantly reduce classification accuracy. In well-controlled samples with low experimental noise, ML-assisted Raman spectroscopy can discriminate lipid mixtures with a composition difference of 1.85 mol %. To assess the effect of biological heterogeneity, we analyzed single-cell Raman spectra from Saccharomyces cerevisiae strains carrying single, double, or triple gene mutations. Intrinsic cell-to-cell variability introduced substantial spectral differences, severely reducing the accuracy of multiclass classification of these genetically similar strains at the single-cell level. Averaging Raman spectra across multiple cells improved classification accuracy by reducing this spectral variability. We also assess the effectiveness of transfer learning across different Raman spectrometers, specifically by applying an ML model trained on one instrument to another Raman spectrometer. Transfer learning can be improved with proper instrument calibration, highlighting the importance of instrument standardization. Overall, our results demonstrate that data quality and spectral similarity are the primary bottlenecks in ML-assisted Raman spectroscopy. Careful attention to sample preparation, data acquisition, measurement conditions, and instrument calibration is critical to achieving robust and reliable classification performance.

Fungi↗
DOE OSTI2024

Verification and validation of detonation-shock-dynamics relations for explosives described by general equation of state and chemical reaction models

Detonation shock dynamics is a powerful method to model the behaviour of High Explosives (HE). However in order to use this method, the underlying relationship between the local radius of curvature and the detonation speed must be known. Previous work has developed methods to calculate this effect using simple, single-step Arrhenius and polytropic gas, models for the chemical reaction and the equation of state, respectively. In recent years, more complex models for both reaction rates and equations of state have been developed which show better agreement with experimental data than these simple models, especially when considering condensed phase explosives.. This work presents the governing equations for solving these problems in a way that is generalised to use arbitrary equations of state as well as reaction models which may have more than a single step and multiple product species. This implementation is verified against exact solutions, demonstrating that the equations were implemented properly. The verified algorithm is then validated against experimental data and high fidelity simulations, showing that it is able to make accurate predictions in a regime where the underlying assumptions of the governing equations are valid. Importantly, this approach has many applications: from creating equivalent detonation shock dynamics models for existing reactive burn calibrations for HE; to developing new functional forms and calibrations of reactive burn models for condensed phase high explosives.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
NASA NTRS1990

Experimental study of robustness in adaptive control for large flexible structures

An experimental study is performed to investigate the robustness of model reference adaptive control for the large flexible structures control application. The main nonidealities of concern are unmodeled dynamics, input saturation, and time delay effects (here, actuator and sensor dynamics are lumped into the last item for convenience). This study focuses on the robustness with respect to input saturation and time delay effects, since robustness to unmodeled dynamics is inherent to the basic algorithm and has been demonstrated experimentally elsewhere.

Ih, Che-Hang Charles↗
NASA NTRS1988

Recursive forward dynamics for multiple robot arms moving a common task object

Recursive forward dynamics algorithms are developed for an arbitrary number of robot arms moving a commonly held object. The multiarm forward dynamics problem is to find the angular accelerations at the joints and the contact forces that the arms impart to the task object. The problem also involves finding the acceleration of this object. The multiarm forward dynamics solutions provide a thorough physical and mathematical understanding of the way several arms behave in response to a set of applied joint moments. Such an understanding simplifies and guides the subsequent control design and experimentation process. The forward dynamics algorithms also provide the necessary analytical foundation for conducting analysis and simulation studies. The multiarm algorithms are based on the filtering and smoothing approach recently advanced for single-arm dynamics, and they can be built up modularly from the single-arm algorithms. The algorithms compute recursively the joint-angle accelerations, the contact forces, and the task-object accelerations. Algorithms are also developed to evaluate in closed form the linear transformations from the active joint moments to the joint-angle accelerations, to the task-object accelerations., and to the task-object contact forces. A possible computing architecture is presented as a precursor to a more complete investigation of the computational performance of the dynamics algorithms.

Rodriguez, G.↗
NASA NTRS1989

Recursive forward dynamics for multiple robot arms moving a common task object

Recursive forward dynamics algorithms are developed and presented for an arbitrary number of robot arms moving a commonly held object. The multiarm forward dynamics problem is to find the angular accelerations at the joints and the contact forces that the arms impart to the task object. The problem also involves finding the acceleration of this object. The multiarm forward dynamics solutions provide a thorough physical and mathematical understanding of the way several arms behave in response to a set of applied joint moments. Such an understanding simplifies and guides the subsequent control design and experimentation process. The forward dynamics algorithms also provide the necessary analytical foundation for conducting analysis and simulation studies. The multiarm algorithms are based on the filtering and smoothing approach recently advanced for single-arm dynamics, and they can be built up modularly from the single-arm algorithms. The algorithms compute recursively the joint angle accelerations, the contact forces, and the task-object accelerations. Algorithms are also developed to evaluate in closed form the linear transformations from the active joint moments to the joint angle accelerations, to the task object accelerations, and to the task-object contact forces. A possible computing architecture is presented as a precursor to a more complete investigation of the computational performance of the dynamics algorithms.

Rodriguez, Guillermo↗
DOE OSTI2025

Sempervirens: A Fast Reconstruction Algorithm for Noisy and Incomplete Binary Matrix Representations of Trees

Applications such as reconstructing cell lineage trees (represented as phylogenetic trees) from single-cell sequencing data require reconstructing a {0,1}-matrix that has many errors and missing entries. We introduce Sempervirens, a very fast matrix reconstruction algorithm for noisy and incomplete matrix representations of phylogenetic trees. Sempervirens uses an iterative maximum-likelihood approach to determine the topology tree represented by the corrupted data. We show that Sempervirens is at least three orders of magnitude faster than other methods on thousand by thousand matrices, with the speed gap widening with larger matrices. We also show that Sempervirens matches state-of-the-art methods in reconstruction accuracy. The speed of Sempervirens enables it to be tractably applied to reconstructing much larger matrices than those that other methods can reconstruct. In addition to experimental results, we justify the algorithm with a mathematical treatment of its subprocedures.

algorithms↗
NASA NTRS1995

Subspace Identification with Multiple Data Sets

Most existing subspace identification algorithms assume that a single input to output data set is available. Motivated by a real life problem on the F18-SRA experimental aircraft, we show how these algorithms are readily adapted to handle multiple data sets. We show by means of an example the relevance of such an improvement.

Duchesne, Laurent↗
DOE OSTI2024

Modeling Approach for the Aluminum-clad Dry Storage Pilot using HFIR Fuel

To confirm that the dry storage of aluminum-clad research reactor spent nuclear fuel (ASNF) will remain within the safety envelope after applied drying schemes and that the resulting evolution of the gas space composition, temperature, and pressure conditions are understood, a dry storage pilot project is being established. The pilot will incorporate an instrumented lid for discrete interval or for on-demand gas composition and temperature monitoring of two DOE Standard Canisters (DSCs) loaded with three High Flux Isotope Reactor (HFIR) inner cores per DSC. Each DSC would be subjected to a separate alternative candidate drying scheme. Canisters will undergo 1 to 5 years of monitoring, including internal temperature and gas sampling to track pressure and composition changes. This report outlines the approach for modeling the ASNF-in-canister behavior in terms of evolving gas space conditions for the ASNF dry storage pilot using HFIR fuel. The ASNF has an adherent surface oxyhydroxide layer comprised of boehmite/bayerite that generates hydrogen when subjected to irradiation. Three-dimensional multi-physics computational fluid dynamics simulations will be executed to compute the thermal field within the DSC and provide inputs to a chemical model employed to compute pressure buildup as hydrogen is generated in the system. Implemented in Cantera, the chemical model solves gas phase and aluminum oxyhydroxide surface-mediated radiolysis reactions. Gas phase reactions are sourced from Wittman and Hanson (2015), whereas surface-mediated reactions are incorporated by fitting experimental data using an optimization algorithm (Abboud, 2023). Water radiolysis reactions from Wren and Ball (2001) are adopted with modifications as described in Abboud (2023c). Understanding the effect of the hydrogen buildup over time is important for long-term storage safety considerations. Modeling results will include the canister pressure, temperature, and composition evolution from the initial helium backfill with the addition of radiolytically-evolved chemical species (e.g., hydrogen and oxygen). The specific HFIR cores for the pilot program have not yet been selected, and the overall design is still in development. The CFD-chemical model used for this work will be based on prior models with necessary updates to allow for improved accuracy and efficiency. The experimental data obtained from the HFIR demonstration will be used to improve and validate the computational models to predict the ASNF-in-canister behavior.

12 MANAGEMENT OF RADIOACTIVE AND NON-RADIOACTIVE W↗
DOE OSTI2021

Optimal Protocols in Quantum Annealing and Quantum Approximate Optimization Algorithm Problems

Quantum annealing (QA) and the quantum approximate optimization algorithm (QAOA) are two special cases of the following control problem: apply a combination of two Hamiltonians to minimize the energy of a quantum state. Which is more effective has remained unclear. Here we analytically apply the framework of optimal control theory to show that generically, given a fixed amount of time, the optimal procedure has the pulsed (or “bang-bang”) structure of QAOA at the beginning and end but can have a smooth annealing structure in between. This is in contrast to previous works which have suggested that bang-bang (i.e., QAOA) protocols are ideal. To support this theoretical work, we carry out simulations of various transverse field Ising models, demonstrating that bang-anneal-bang protocols are more common. Futher, the general features identified here provide guideposts for the nascent experimental implementations of quantum optimization algorithms.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
NASA NTRS1996

An efficient approach to ARMA modeling of biological systems with multiple inputs and delays

This paper presents a new approach to AutoRegressive Moving Average (ARMA or ARX) modeling which automatically seeks the best model order to represent investigated linear, time invariant systems using their input/output data. The algorithm seeks the ARMA parameterization which accounts for variability in the output of the system due to input activity and contains the fewest number of parameters required to do so. The unique characteristics of the proposed system identification algorithm are its simplicity and efficiency in handling systems with delays and multiple inputs. We present results of applying the algorithm to simulated data and experimental biological data In addition, a technique for assessing the error associated with the impulse responses calculated from estimated ARMA parameterizations is presented. The mapping from ARMA coefficients to impulse response estimates is nonlinear, which complicates any effort to construct confidence bounds for the obtained impulse responses. Here a method for obtaining a linearization of this mapping is derived, which leads to a simple procedure to approximate the confidence bounds.

Non-NASA Center↗
DOE OSTI2023

PYK-SubstitutionOME: an integrated database containing allosteric coupling, ligand affinity and mutational, structural, pathological, bioinformatic and computational information about pyruvate kinase isozymes

Interpreting changes in patient genomes, understanding how viruses evolve and engineering novel protein function all depend on accurately predicting the functional outcomes that arise from amino acid substitutions. To that end, the development of first-generation prediction algorithms was guided by historic experimental datasets. However, these datasets were heavily biased toward substitutions at positions that have not changed much throughout evolution (i.e. conserved). Although newer datasets include substitutions at positions that span a range of evolutionary conservation scores, these data are largely derived from assays that agglomerate multiple aspects of function. To facilitate predictions from the foundational chemical properties of proteins, large substitution databases with biochemical characterizations of function are needed. We report here a database derived from mutational, biochemical, bioinformatic, structural, pathological and computational studies of a highly studied protein family—pyruvate kinase (PYK). A centerpiece of this database is the biochemical characterization—including quantitative evaluation of allosteric regulation—of the changes that accompany substitutions at positions that sample the full conservation range observed in the PYK family. We have used these data to facilitate critical advances in the foundational studies of allosteric regulation and protein evolution and as rigorous benchmarks for testing protein predictions. We trust that the collected dataset will be useful for the broader scientific community in the further development of prediction algorithms.

59 BASIC BIOLOGICAL SCIENCES↗
DOE OSTI2022

Toward autonomous laboratories: Convergence of artificial intelligence and experimental automation

The ever-increasing demand for novel materials with superior properties inspires retrofitting traditional research paradigms in the era of artificial intelligence and automation. An autonomous experimental platform (AEP) has emerged as an exciting research frontier that achieves full autonomy via integrating data-driven algorithms such as machine learning (ML) with experimental automation in the material development loop from synthesis, characterization, and analysis, to decision making. In this review, we started with a primer to describe how to develop data-driven algorithms for solving material problems. Then, we systematically summarized recent progress on automated material synthesis, ML-enabled data analysis, and decision-making. Finally, we discussed the challenges and opportunities in an endeavor to develop the next-generation AEP for ultimately realizing an autonomous or self-driving laboratory. In conclusion, this review will provide insights for researchers aiming to learn the frontier of ML in materials science and deploy AEP in their labs for accelerating material development.

36 MATERIALS SCIENCE↗
DOE OSTI2023

MRT 7365: Power flow physics and key physics phenomena

The Z accelerator at Sandia National Laboratories conducts z-pinch experiments at 26 MA in support of DOE missions in stockpile stewardship, dynamic materials, fusion, and other basic sciences. Increasing the current delivered to the z-pinch would extend our reach in each of these disciplines. To achieve increases in current and accelerator efficiency, a fraction of Z’s shots are set aside for research into transmission-line power flow. These shots, with supporting simulations and theory, are incorporated into this Advanced Diagnostics milestone report. The efficiency of Z is reduced as some portion of the total current is shunted across the transmission-line gaps prior to the load. This is referred to as “current loss”. Electrode plasmas have long been implicated in this process, so the bulk of dedicated power-flow experiments are designed to measure the plasma environment. The experimental analyses are enhanced by simulations conducted using realistic hardware and Z voltage pulses. In the same way that diagnostics are continually being improved for sensitivity and resolution, the modeling capability is continually being improved to provide faster and more realistic simulations. The specifics of the experimental hardware, diagnostics, simulations, and algorithm developments are provided in this report. The combined analysis of simulation and data confirms that electrode plasmas have the most detrimental impact on current delivery. Experiments over the last three years have tested the theoretical current-loss mechanisms of enhanced ion current, plasma gap closure, and Hall-related current. These mechanisms are not mutually exclusive and may be coincident in the final feed as well as in upstream transmission lines. The final-feed geometries tested here, however, observe lower-density plasmas without dominant ion currents which is consistent with a Hall-related current. The picture of plasma formation and transport formed from experiment and simulation is informing hardware designs being fielded on Z now and being proposed for the Next-Generation Pulsed Power (NGPP) facility. In this picture, the strong magnetic fields that heat the electrodes above particle emission thresholds also confine the charged particles near the surface. Some portion of the plasmas thus formed is transported into the transmission-line gap under the force of the electric field, with aid from plasma instabilities. The gap plasmas are then transported towards the load by a cross-field drift, where they accumulate and contribute to a likely Hall-related cross-gap current. The achievements in experimental execution, model validation, and physical analysis presented in this report set the stage for continued progress in power flow and load diagnostics on Z. The planned shot schedule for Z and Mykonos will provide data for extrapolation to higher current to ensure the predicted performance and efficiency of a NGPP facility.

43 PARTICLE ACCELERATORS↗
DOE OSTI2024

Efficient Hybrid Attack Graph Generation for Cyber-Physical System Resilience Experimentation (Final Project Report)

HAGEN project has developed theory, algorithms, and capabilities to assist cyber physical system modelers and operators to perform system and device-level vulnerability assessment, risk assessment, impact assessment, and mitigation planning. The project generates hybrid attack graphs for Cyber-Physical System (CPS) resilience experimentation at desired scale and speed. The project will produce composite attack datasets, algorithms, and demonstrable prototypical tools, and a library of high-impact attack sequences for a given CPS of interest. This report provided overall summary of research and development performed between FY22-24.

45 MILITARY TECHNOLOGY, WEAPONRY, AND NATIONAL DEF↗
NASA NTRS2001

Performance of the Wavelet Decomposition on Massively Parallel Architectures

Traditionally, Fourier Transforms have been utilized for performing signal analysis and representation. But although it is straightforward to reconstruct a signal from its Fourier transform, no local description of the signal is included in its Fourier representation. To alleviate this problem, Windowed Fourier transforms and then wavelet transforms have been introduced, and it has been proven that wavelets give a better localization than traditional Fourier transforms, as well as a better division of the time- or space-frequency plane than Windowed Fourier transforms. Because of these properties and after the development of several fast algorithms for computing the wavelet representation of any signal, in particular the Multi-Resolution Analysis (MRA) developed by Mallat, wavelet transforms have increasingly been applied to signal analysis problems, especially real-life problems, in which speed is critical. In this paper we present and compare efficient wavelet decomposition algorithms on different parallel architectures. We report and analyze experimental measurements, using NASA remotely sensed images. Results show that our algorithms achieve significant performance gains on current high performance parallel systems, and meet scientific applications and multimedia requirements. The extensive performance measurements collected over a number of high-performance computer systems have revealed important architectural characteristics of these systems, in relation to the processing demands of the wavelet decomposition of digital images.

El-Ghazawi, Tarek A.↗
NASA NTRS1997

Adaptive Load-Balancing Algorithms Using Symmetric Broadcast Networks

In a distributed-computing environment, it is important to ensure that the processor workloads are adequately balanced. Among numerous load-balancing algorithms, a unique approach due to Dam and Prasad defines a symmetric broadcast network (SBN) that provides a robust communication pattern among the processors in a topology-independent manner. In this paper, we propose and analyze three novel SBN-based load-balancing algorithms, and implement them on an SP2. A thorough experimental study with Poisson-distributed synthetic loads demonstrates that these algorithms are very effective in balancing system load while minimizing processor idle time. They also compare favorably with several other existing load-balancing techniques. Additional experiments performed with real data demonstrate that the SBN approach is effective in adaptive computational science and engineering applications where dynamic load balancing is extremely crucial.

Das, Sajal K.↗
NASA NTRS2013

Controlling Tensegrity Robots Through Evolution

Tensegrity structures (built from interconnected rods and cables) have the potential to offer a revolutionary new robotic design that is light-weight, energy-efficient, robust to failures, capable of unique modes of locomotion, impact tolerant, and compliant (reducing damage between the robot and its environment). Unfortunately robots built from tensegrity structures are difficult to control with traditional methods due to their oscillatory nature, nonlinear coupling between components and overall complexity. Fortunately this formidable control challenge can be overcome through the use of evolutionary algorithms. In this paper we show that evolutionary algorithms can be used to efficiently control a ball-shaped tensegrity robot. Experimental results performed with a variety of evolutionary algorithms in a detailed soft-body physics simulator show that a centralized evolutionary algorithm performs 400 percent better than a hand-coded solution, while the multi-agent evolution performs 800 percent better. In addition, evolution is able to discover diverse control solutions (both crawling and rolling) that are robust against structural failures and can be adapted to a wide range of energy and actuation constraints. These successful controls will form the basis for building high-performance tensegrity robots in the near future.

Robot↗