SEARCH · Engineering Papers
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.
The software is a set of test problems for nonlinear optimization algorithms, including subroutines such as linear algebra routines and automatic differentiation algorithms. The test problems come from chemical engineering open literature, and describe optimization tasks related to the design and operation of processes such as carbon capture, Hydrogen production, heat exchange, and distillation.
This final report summarizes the work completed under the Laboratory Directed Research and Development (LDRD) project “Seismic Spatial Gradients as a Machine Learning-Based Classifier for Explosion Monitoring.” The overarching goal of the project was to explore the efficacy of using machine learning-based classification algorithms where the input data are the spatial gradient of the seismic wavefield collected at a single point on the Earth’s surface. The methods that I describe here are in direct contrast to conventional methods of seismic discrimination which typically rely on a spatially extended network of instruments and physics-based wavefield attributes such as, for example, the ratio between $\textit{P}$ and $\textit{S}$ waves. Rather, we use the spatial gradient of the seismic wavefield observed at a single point on the Earth’s surface and data processing approaches inspired by the machine learning community. We tested two algorithms, a neural network and a modified version of principal component analysis termed Spectrally Filtered Principal Component Analysis (SFPCA). To test these algorithms, we first conducted a series of numerical tests using synthetic data and then conducted a small-scale controlled field experiment. The tests using synthetic data showed that both algorithms had high success rates on gradiometric data, even when simulated noise was added to the signal. Furthermore, we found that using seismic spatial gradients increased the performance of our discrimination algorithms when compared to using just the traditional translational motion seismic data. The tests with field data also showed a high degree of discriminative success.
Optimizing charged-particle track reconstruction algorithms is crucial for efficient event reconstruction in Large Hadron Collider (LHC) experiments due to their significant computational demands. Existing track reconstruction algorithms have been adapted to run on massively parallel coprocessors, such as graphics processing units (GPUs), to reduce processing time. Nevertheless, challenges remain in fully harnessing the computational capacity of coprocessors in a scalable and non-disruptive manner. This paper proposes an inference-as-a-service approach for particle tracking in high energy physics experiments. To evaluate the efficacy of this approach, two distinct tracking algorithms are tested: Patatrack, a rule-based algorithm, and Exa.TrkX, a machine learning-based algorithm. The as-a-service implementations show enhanced GPU utilization and can process requests from multiple CPU cores concurrently without increasing per-request latency. The impact of data transfer is minimal and insignificant compared to running on local coprocessors. This approach greatly improves the computational efficiency of charged particle tracking, providing a solution to the computing challenges anticipated in the High-Luminosity LHC era.
Blockchain is the next generation of secure data management that creates near-immutable decentralized storage. Secure cryptography created a niche for blockchain to provide alternatives to well-known security compromises. However, design bottlenecks with traditional blockchain data structures scale poorly with increased network usage and are extremely computation-intensive. This made the technology difficult to combine with limited devices, like those in Internet of Things networks. In protocols like IOTA, replacement of blockchain's linked-list queue processing with a lightweight dynamic ledger showed remarkable throughput performance increase. However, current stochastic algorithms for ledger construction suffer distinct trade-offs between efficiency and security. This work proposed a machine-learning approach with a multi-arm bandit that resolved these issues and was designed for auditing on limited devices. This algorithm was tested in a reinforcement-learning environment simulating the IOTA ledger's construction with a decision tree. This study showed through regret analysis and experimentation that this approach was secure against impulse manipulation attacks while remaining energy-efficient. Although the IOTA protocol was a pioneer for lightweight distributed ledgers, it is expected that future blockchain protocols will adopt techniques similar to those presented in this work.
DISTRI is an advanced network simulator designed for multi-facility computational infrastructures with agentic behavior. It simulates HPC facilities where computational resources act as autonomous agents, making intelligent decisions about job scheduling, load balancing, and resource allocation. The simulator focuses on developing and testing decentralized algorithms that promote resilience and efficiency in multi-facility environments. Key Features: - Agentic Resource Behavior: Processors and DTNs act as autonomous agents with decision-making capabilities - Pheromone-Based Load Balancing: Decentralized load balancing inspired by ant colony optimization - Dual Topology Support: Mesh (normal operations) and Dumbell (network testing) topologies - Comprehensive TCP Simulation: Realistic TCP implementations with multiple congestion control algorithms - Failure Resilience Testing: Processor failure simulation with automatic job reassignment - Extensive Visualization: Detailed performance analysis and metrics collection - Research-Ready: Designed for algorithm development and benchmarking
Explore the source record for details and available documents.
Explore the source record for details and available documents.
Pier foundations are commonly used in locations with unstable soil or where other types of foundations are unsuitable or cost prohibitive. A pier foundation consists of vertical columns to support the structure and elevate it above the ground. Common materials for pier foundations include masonry, concrete, timber, and steel. The methods for accurate placement of pier foundations have remained relatively unchanged for decades. For simple installations, construction chalk lines are used to layout the locations of piers to ensure accurate placement and elevation. For more complex installations, surveying instruments operated by trained professionals are employed to accurately locate piers and assess correct elevation before construction. After installation, another survey may need to be performed to assess the quality of the as-built foundation. However, with the advent of terrestrial laser scanners (TLS), the means now exist for contractors to conduct their own assessments of as-built foundations. The major barrier preventing contractors from performing their own assessments of as-built foundation quality is the segmentation and analysis of point cloud data, a skill that often requires a trained user. The objective of this research is to develop a software tool (PIER: Pier Inspection and Evaluation Report) to enable automated segmentation and analysis of point clouds of pier foundations. In this paper, the automated segmentation and analysis algorithms are detailed. A mockup lay out of pier foundations was built using concrete masonry units, and the algorithms were tested to evaluate performance. Limitations of the current algorithms and future research direction are discussed.
Flexible microgrids with dynamic boundaries have recently been introduced in the literature. With the ability to reconfigure the topology of the microgrids dynamically through remotely controlled switches, flexible microgrids with dynamic boundaries can further improve the resiliency and energy efficiency of microgrids with distributed energy resources (DERs). This paper focuses on the optimal operation considering one of the predominant characteristics of microgrids and distribution systems – unbalanced networks and loads. In existing literature, balanced modeling of microgrids is more common due to its attractive simplicity. The three-phase power unbalance has not been considered as a constraint on the generation units in a microgrid. Further, negative sequence constraints have also been neglected. In this article, we propose a set of constraints that is specifically related to the capabilities of inverter interfaced resources to supply unbalanced current/power when the microgrid is islanded from the main distribution grid. We incorporate the new set of constraints into two optimization formulations leveraging two convex relaxations of the three-phase power flow equations: mixed-integer linear programming (MILP) and mixed-integer semidefinite programming (MISDP) that optimize the dispatch of controllable switches and DERs in the microgrid. The algorithms are then extended to networked microgrids with grid-forming sources. We test the algorithms on a realistic community microgrid model in Puerto Rico as well as standardized IEEE distribution test feeders. The testing results demonstrate the performance of the proposed algorithms. The MILP is fast and scalable, and the MISDP enforces the negative sequence voltage constraints.
The optimum use of the continuous measurements of thermodynamics, radiation, aerosols, clouds and precipitation from the DOE Atmospheric Radiation Measurement (ARM) program is key to achieve the DOE Atmospheric System Research (ASR)’s objectives. One of the key mission requirements is to retrieve cloud and precipitation properties, as well as vertical motion parameters, along the vertical cross- section defined by the profiling active sensors. Such retrievals are challenging to perform continuously in the entire spectrum of cloud and precipitation conditions due to the large natural microphysical and dynamical variability, the often-limited information content in the measurements, and the lack of proper characterization of measurement quality and uncertainty. Today, the acquisition of new remote and in-situ sensors by the ARM program creates opportunities to address the microphysical retrieval problem by exploiting new, more robust retrieval techniques and integrating various scattered advancements in both sensor techniques and retrieval algorithms. During this project, we constructed a robust Bayesian Markov chain Monte Carlo (MCMC) cloud property retrieval algorithm that includes a state of the art radar forward model. Our MCMC-based retrieval produces both the best estimate of height-resolved cloud and precipitation properties in the radar profile, as well as an estimate of the in-cloud vertical motion and turbulence. In addition, the MCMC algorithm automatically produces robust and flexible estimates of retrieval uncertainty. We tested the algorithm on several synthetic cloud profiles obtained from large eddy simulation (LES) models with bin-resolved microphysics.
Neural networks are becoming the cornerstone for national security prediction tasks. However, designing them requires significant research and trial/error, as they have many hyperparameters, including their computation graph (“architecture”). Neural architecture search (NAS) employs secondary optimizers to search for architectures maximizing objectives like accuracy. Evolutionary algorithms (EAs) are the most used class of optimizer for NAS. However, existing Python libraries for writing EAs limit the complexity of experiments a user can design. In this project, we built ARENA, a Python framework that encodes complex, hyper-realistic EAs. ARENA collects detailed information as it runs and is flexible enough to encode non-EA search algorithms. We tested ARENA on 4 toy optimization problems by encoding 3 search algorithms for each—random search, an EA, and simulated annealing. We also designed an EA that performs NAS on the MNIST dataset. Our experiments suggest the potential for immediate mission impact through solving lab-wide optimization problems.
Muons, being elementary particles with minimal interaction with nuclear materials and abundant at sea level, have sparked interest in utilizing them for imaging various applications, such as mining [Borselli et al., Sci. Rep. 12, 22329 (2022)], volcano imaging [Nagamine et al., Nucl. Instrum. Meth. A, 356, 585(1995)], and underground tunnel detection [Guardincerri et al., Pure Appl. Geophys. 174, 2133 (2017)]. Recently, their use in nuclear nonproliferation and safeguard verification has gained attention, particularly in cargo screening for nuclear waste smuggling [Baesso et al., J. Instrum. 9, C10041 (2014)], source localization [L. J. Schultz et al., Nucl. Instrum. Meth. A 519, 687 (2004)], and locating nuclear fuel debris in reactors [Borozdin et al., Phys. Rev. Let. 109, 152501 (2012)]. However, the resolution of muon image reconstruction techniques is limited due to multiple Coulomb scattering (MCS) within the target object. To achieve robust muon tomography, it is crucial to develop efficient and flexible physics-based algorithms that can model the MCS process accurately and estimate the most probable trajectory of muons as they pass through the target object. To address this limitation, in this study, a novel algorithmic approach utilizing the Bayesian probability theory and Gaussian approximation of MCS is chosen. Different energy levels, materials, and target sizes were considered in the evaluations. The results demonstrate that the Generalized Muon Trajectory Estimation (GMTE) algorithm offers significant improvements over currently used algorithms. Across all test scenarios, the GMTE algorithm demonstrated ~50% and 38% increase in precision compared to Straight Line Path (SLP) and Point of Closest Approach (PoCA) algorithms, respectively. Furthermore, it exhibited 10%–35% and 10%–15% increases in muon flux utilization for high and medium Z materials, respectively, compared to the PoCA algorithm. In conclusion, the extensive simulations confirm the enhanced performance and efficiency of the GMTE algorithm, offering improved resolution and reduced measurement time for cosmic ray muon imaging compared to the current SLP and PoCA algorithms.
The catalytic performance of atomically dispersed catalysts (ADCs) is greatly influenced by their atomic configurations, such as atom–atom distances, clustering of atoms into dimers and trimers, and their distributions. Scanning transmission electron microscopy (STEM) is a powerful technique for imaging ADCs at the atomic scale; however, most STEM analyses of ADCs thus far have relied on human labeling, making it difficult to analyze large data sets. Here, we introduce a convolutional neural network (CNN)-based algorithm capable of quantifying the spatial arrangement of different adatom configurations. The algorithm was tested on different ADCs with varying support crystallinity and homogeneity. Results show that our algorithm can accurately identify atom positions and effectively analyze large data sets. Here, this work provides a robust method to overcome a major bottleneck in STEM analysis for ADC catalyst research. We highlight the potential of this method to serve as an on-the-fly analysis tool for catalysts in future in situ microscopy experiments.
The proliferation of smart meters has resulted in a large amount of data being generated. It is increasingly apparent that methods are required for allowing a variety of stakeholders to leverage the data in a manner that preserves the privacy of the consumers. The sector is scrambling to define policies, such as the so called ‘15/15 rule’, to respond to the need. However, the current policies fail to adequately guarantee privacy. Here, in this paper, we address the problem of allowing third parties to apply K-means clustering, obtaining customer labels and centroids for a set of load time series by applying the framework of differential privacy. We leverage the method to design an algorithm that generates differentially private synthetic load data consistent with the labeled data. We test our algorithm’s utility by answering summary statistics such as average daily load profiles for a 2-dimensional synthetic dataset and a real-world power load dataset.
Reliable power system operation requires that system operators maintain a satisfactory small-signal stability margin at all times. Mode meters allow system operators to continuously monitor the stability margin by analyzing synchrophasor measurements. Experience with mode meters at the Bonneville Power Administration (BPA) has revealed that mode meters sometimes suffer severe bias following transient disturbances. In this paper, a robust version of the Yule-Walker mode meter algorithm is proposed to mitigate this bias. The robust capability is introduced by modifying the estimator of the autocovariance sequence (ACS) on which the algorithm depends. Tests with field-measured data demonstrate that the robust Yule-Walker (RYW) algorithm significantly outperforms its conventional counterpart and is better able to provide system operators with accurate information about the system's stability margin.
Arsenic, a potent carcinogen and neurotoxin, affects over 200 million people globally. Current detection methods are laborious, expensive, and unscalable, being difficult to implement in developing regions and during crises such as COVID-19. This study attempts to determine if a relationship exists between soil’s hyperspectral data and arsenic concentration using NASA’s Hyperion satellite. It is the first arsenic study to use satellite-based hyperspectral data and apply a classification approach. Four regression machine learning models are tested to determine this correlation in soil with bare land cover. Raw data are converted to reflectance, problematic atmospheric influences are removed, characteristic wavelengths are selected, and four noise reduction algorithms are tested. The combination of data augmentation, Genetic Algorithm, Second Derivative Transformation, and Random Forest regression (R 2 =0.840 and normalized root mean squared error (re-scaled to [0,1]) = 0.122) shows strong correlation, performing better than past models despite using noisier satellite data (versus lab-processed samples). Three binary classification machine learning models are then applied to identify high-risk shrub-covered regions in ten U.S. states, achieving strong accuracy (=0.693) and F1-score (=0.728). Overall, these results suggest that such a methodology is practical and can provide a sustainable alternative to arsenic contamination detection.
This report summarizes the work performed under a project funded by U.S. DOE Solar Energy Technologies Office (SETO) to use grid edge measurements to calibrate distribution system models for improved planning and grid integration of solar PV. Several physics-based data-driven algorithms are developed to identify inaccuracies in models and to bring increased visibility into distribution system planning. This includes phase identification, secondary system topology and parameter estimation, meter-to-transformer pairing, medium-voltage reconfiguration detection, determination of regulator and capacitor settings, PV system detection, PV parameter and setting estimation, PV dynamic models, and improved load modeling. Each of the algorithms is tested using simulation data and demonstrated on real feeders with our utility partners. The final algorithms demonstrate the potential for future planning and operations of the electric power grid to be more automated and data-driven, with more granularity, higher accuracy, and more comprehensive visibility into the system.
This report summarizes the work performed under a project funded by U.S. DOE Solar Energy Technologies Office (SETO), including some updates from the previous report SAND2022-0215, to use grid edge measurements to calibrate distribution system models for improved planning and grid integration of solar PV. Several physics-based data-driven algorithms are developed to identify inaccuracies in models and to bring increased visibility into distribution system planning. This includes phase identification, secondary system topology and parameter estimation, meter-to-transformer pairing, medium-voltage reconfiguration detection, determination of regulator and capacitor settings, PV system detection, PV parameter and setting estimation, PV dynamic models, and improved load modeling. Each of the algorithms is tested using simulation data and demonstrated on real feeders with our utility partners. The final algorithms demonstrate the potential for future planning and operations of the electric power grid to be more automated and data-driven, with more granularity, higher accuracy, and more comprehensive visibility into the system.