Search NASA⌕ Search

SEARCH · Search NASA

Results for “processing algorithm”

Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.

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

At least 775 records · Page 43
All sourcesNASA NTRSDOE OSTI
DOE OSTI2022

Scalable Energy System Expansion Under Uncertainty Using Multi-Stage Stochastic Optimization

The intermittent nature of renewable energy sources poses challenges for electrical grids. This is due to the variable and uncertain nature of the power output from these resources. These features of renewable generation are more relevant to energy system planning as grids reach higher penetration levels of renewable energy. We present approaches for energy system planning based on scalable computational approaches which enable explicit consideration of operational uncertainties in the planning process. Using multi-stage stochastic programming and the progressive hedging algorithm, we compute energy system expansion decisions on modified versions of the RTS-GMLC test system.

electrical↗
DOE OSTI2022

Ultrasound waveform tomography with spatial and edge regularization

Synthetic-aperture ultrasound tomography systems and methods using scanning arrays and algorithms configured to simultaneously acquire ultrasound transmission and reflection data, and process the data for improved ultrasound tomography imaging, wherein the tomography imaging comprises total-variation regularization, or a modified total variation regularization, particularly with edge-guided or spatially variant regularization.

Huang, Lianjie↗
DOE OSTI2022

Scalable Energy System Expansion Under Uncertainty Using Multi-Stage Stochastic Optimization

The intermittent nature of power from renewable energy sources poses new challenges for electrical grids. This is due to the variable and uncertain nature of the power output from these resources. These features of renewable generation are becoming more relevant to energy system planning as grids reach higher penetration levels of renewable energy. In this presentation we present approaches for energy system planning based on scalable computational approaches which enable the explicit consideration of operational uncertainties in the planning process. Using multi-stage stochastic programming and the progressive hedging algorithm, we compute energy system expansion decisions on modified versions of the RTS-GMLC test system augmented with large amounts of renewable generation.

MATHEMATICS AND COMPUTING↗
DOE OSTI2020

On the Formalization of Development and Assessment Process for Digital Twins in the Nearly Autonomous Management and Control System

In recent years, the autonomous control system has been encouraged in advanced reactors for restoring economic viability, simplifying the operation and maintenance, and enabling remote-site power generations [1]. Since the reactor is expected to be operated for a long period of time with a limited number of individuals onsite, it is recommended that the autonomous control system should have access to very realistic models of the state of processes in the whole lifecycle, together with these process behaviors in interaction with their environment in the real world. As a result, digital twin (DT) technology is suggested in autonomous control systems. DT is defined as a digital representation of a physical object or system, which contains a record for the histories of loads, operation and maintenance status, predictions for the near-term transient of important state variables, and decision-making process [2]. Since machine learning (ML) can recognize patterns within a complex system in real-time applications, it has been used to build DTs in the autonomous control systems for advanced reactors. Meanwhile, due to the rareness of operation data in accident scenarios, the development and assessment of DTs is expected to be mainly driven by simulations. Although the capability and feasibility of ML-based DTs are recognized in improving the safety and efficiency of reactor control, a major concern from the regulatory commission and the nuclear industry is whether the information from a DT is developed and assessed in accordance with expectation and requirements by the target decision. Such concerns not only affect the acceptance criteria for DTs, but also values that can be extracted from DTs and autonomous control system during operations. Inspired by the success of formal methods in improving the reliability and robustness of computer programming and software development, it is suggested that the development and assessment process (DAP) for both separate DTs and integral control system should be formalized in a transparent, consistent, and improvable manner. In this study, a digital-twin development and assessment process (DT-DAP) is proposed by adapting the evaluation model development and assessment process (EMDAP) [3] to requirements by the autonomous control system, ML algorithms, and DT technology. To demonstrate the framework, a baseline nearly autonomous management and control (NAMAC) system with ML-based DTs for diagnosis and prognosis is developed and assessed based on the framework. It is found that with selected testing methods and techniques, the DT-DAP can help identify errors in DTs and NAMAC which would otherwise be left unverified. Meanwhile, it is found that the DT-DAP can improve the DTs and NAMAC by continuously learning and iterating through different elements.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗
DOE OSTI2026

Enabling integrated AI control on DIII-D: a control system design with state-of-the-art experiments

We present the design and application of a general algorithm for Prediction And Control using MAchiNe learning (PACMAN) in DIII-D. Machine learning (ML)-based predictors and controllers have shown great promise in achieving regimes in which traditional controllers fail, such as tearing mode (TM) free scenarios, ELM-free scenarios and stable advanced tokamak conditions. The architecture presented here was deployed on DIII-D to facilitate the end-to-end implementation of advanced control experiments, from diagnostic processing to final actuation commands. This paper describes the detailed design of the algorithm and explains the motivation behind each design point. We also describe several successful ML control experiments in DIII-D using this algorithm, including a reinforcement learning controller targeting advanced non-inductive plasmas, a wide-pedestal quiescent H-mode ELM predictor, an Alfvén Eigenmode controller, a Model Predictive Control plasma profile controller and a state-machine TM predictor-controller. There is also discussion on guiding principles for real-time ML controller design and implementation.

machine learning↗
DOE OSTI2020

Automatic microseismic event picking via unsupervised machine learning

SUMMARY Effective and efficient arrival picking plays an important role in microseismic and earthquake data processing and imaging. Widely used short-term-average long-term-average ratio (STA/LTA) based arrival picking algorithms suffer from the sensitivity to moderate-to-strong random ambient noise. To make the state-of-the-art arrival picking approaches effective, microseismic data need to be first pre-processed, for example, removing sufficient amount of noise, and second analysed by arrival pickers. To conquer the noise issue in arrival picking for weak microseismic or earthquake event, I leverage the machine learning techniques to help recognizing seismic waveforms in microseismic or earthquake data. Because of the dependency of supervised machine learning algorithm on large volume of well-designed training data, I utilize an unsupervised machine learning algorithm to help cluster the time samples into two groups, that is, waveform points and non-waveform points. The fuzzy clustering algorithm has been demonstrated to be effective for such purpose. A group of synthetic, real microseismic and earthquake data sets with different levels of complexity show that the proposed method is much more robust than the state-of-the-art STA/LTA method in picking microseismic events, even in the case of moderately strong background noise.

Chen, Yangkang↗
DOE OSTI2026

A Flexible Forwarding Scheme to Improve Latency-Bound Irregular P2P Communication in MPI

We propose an algorithm to efficiently perform latency-bound communication scenarios that consist of many small messages. In these parallel scenarios, processes typically pass around a lot of small-sized messages of a few KBs of size. Performing communication operations with P2P MPI routines or collective MPI routines (including neighborhood collectives) in such scenarios may not always yield the optimal results and may not resolve the latency bottleneck. To this end, we develop a regular structure called virtual process topology (VPT) on which the messages can be communicated in a structured and controlled manner. Using parameters of this topology, one can tune the rate of aggression in tackling the latency costs. We demonstrate that our communication algorithm is preferable to MPI P2P and collective routines for latency-bound communication and it can easily be adapted only by replacing calls to MPI routines in a parallel application. We show how to adapt existing topology-aware mapping heuristics to address the volume overhead due to communicating messages on the VPT. Moreover, we propose a novel swap-based mapping heuristic to address this overhead by optimizing the maximum volume handled by a process. Experiments on synthetic communication graphs as well as real-world applications such as parallel Canonical Polyadic sparse tensor decomposition and parallel sparse matrix-dense matrix multiplication show that our approach is a powerful way of overcoming the bottlenecks posed by sparse and latency-bound irregular communication.

communication algorithm↗
DOE OSTI2021

Flame stability analysis of flame spray pyrolysis by artificial intelligence

Flame spray pyrolysis (FSP) is a process used to synthesize nanoparticles through the combustion of an atomized precursor solution; this process has applications in catalysts, battery materials, and pigments. Current limitations revolve around understanding how to consistently achieve a stable flame and the reliable production of nanoparticles. Machine learning and artificial intelligence algorithms that detect unstable flame conditions in real time may be a means of streamlining the synthesis process and improving FSP efficiency. In this study, the FSP flame stability is first quantified by analyzing the brightness of the flame's anchor point. This analysis is then used to label data for both unsupervised and supervised machine learning approaches. The unsupervised learning approach allows for autonomous labeling and classification of new data by representing data in a reduced dimensional space and identifying combinations of features that most effectively cluster it. The supervised learning approach, on the other hand, requires human labeling of training and test data but is able to classify multiple objects of interest (such as the burner and pilot flames) within the video feed. The accuracy of each of these techniques is compared against the evaluations of human experts. Both the unsupervised and supervised approaches can track and classify FSP flame conditions in real time to alert users of unstable flame conditions. This research has the potential to autonomously track and manage flame spray pyrolysis as well as other flame technologies by monitoring and classifying the flame stability.

42 ENGINEERING↗
DOE OSTI2020

Engine Combustion System Optimization Using Computational Fluid Dynamics and Machine Learning: A Methodological Approach

Gasoline compression ignition (GCI) engines are considered an attractive alternative to traditional spark-ignition and diesel engines. Here, a Machine Learning-Grid Gradient Ascent (ML-GGA) approach was developed to optimize the performance of internal combustion engines. ML offers a pathway to transform complex physical processes that occur in a combustion engine into compact informational processes. The developed ML-GGA model was compared with a recently developed Machine Learning-Genetic Algorithm (ML-GA). Detailed investigations of optimization solver parameters and variable limit extension were performed in the present ML-GGA model to improve the accuracy and robustness of the optimization process. Detailed descriptions of the different procedures, optimization tools, and criteria that must be followed for a successful output are provided here. The developed ML-GGA approach was used to optimize the operating conditions (case 1) and the piston bowl design (case 2) of a heavy-duty diesel engine running on a gasoline fuel with a research octane number (RON) of 80. The ML-GGA approach yielded >2% improvements in the merit function, compared with the optimum obtained from a thorough computational fluid dynamics (CFD) guided system optimization. The predictions from the ML-GGA approach were validated with engine CFD simulations. This study demonstrates the potential of ML-GGA to significantly reduce the time needed for optimization problems, without loss in accuracy compared with traditional approaches.

33 ADVANCED PROPULSION SYSTEMS↗
DOE OSTI2021

Noise Robustness and Experimental Demonstration of a Quantum Generative Adversarial Network for Continuous Distributions

Abstract The potential advantage of machine learning in quantum computers is a topic of intense discussion in the literature. Theoretical, numerical, and experimental explorations will most likely be required to understand its power. There have been different algorithms proposed to exploit the probabilistic nature of variational quantum circuits for generative modeling. In this paper, a hybrid architecture for quantum generative adversarial networks (QGANs) is employed and their robustness in the presence of noise is studied. A simple way of adding different types of noise to the quantum generator circuit is devised, and the noisy hybrid QGANs (HQGANs) are simulated numerically to learn continuous probability distributions, and to show that the performance of HQGANs remains unaffected. The effect of different parameters on the training time is also investigated to reduce the computational scaling of the algorithm and simplify its deployment on a quantum computer. The training on Rigetti's Aspen‐4‐2Q‐A quantum processing unit is then performed, and the results from the training are presented. The authors' results pave the way for experimental exploration of different quantum machine learning algorithms on noisy intermediate‐scale quantum devices.

Anand, Abhinav↗
DOE OSTI2020

Pattern-matching indexing of Laue and monochromatic serial crystallography data for applications in materials science

Serial crystallography data can be challenging to index, as each frame is processed individually, rather than being processed as a whole like in conventional X-ray single-crystal crystallography. An algorithm has been developed to index still diffraction patterns arising from small-unit-cell samples. The algorithm is based on the matching of reciprocal-lattice vector pairs, as developed for Laue microdiffraction data indexing, combined with three-dimensional pattern matching using a nearest-neighbors approach. As a result, large-bandpass data (e.g. 5–24 keV energy range) and monochromatic data can be processed, the main requirement being prior knowledge of the unit cell. Furthermore, angles calculated in the vicinity of a few theoretical and experimental reciprocal-lattice vectors are compared, and only vectors with the highest number of common angles are selected as candidates to obtain the orientation matrix. Global matching on the entire pattern is then checked. Four indexing options are available, two for the ranking of the theoretical reciprocal-lattice vectors and two for reducing the number of possible candidates. Furthermore, the algorithm has been used to index several data sets collected under different experimental conditions on a series of model samples. Additionally, knowing the crystallographic structure of the sample and using this information to rank the theoretical reflections based on the structure factors helps the indexing of large-bandpass data for the largest-unit-cell samples. For small-bandpass data, shortening the candidate list to determine the orientation matrix should be based on matching pairs of reciprocal-lattice vectors instead of triplet matching.

36 MATERIALS SCIENCE↗
DOE OSTI2021

SIS-AOP Cueing/Segmenting Algorithm (FOA_SIS-AOP) Using the Sandia FOA 4.0 Framework

For machine vision, one of the most important operations is fast and effective object cueing or segmentation. Sandia National Labs has a long history of development and implementation of very fast and effective cueing/segmentation algorithms. This report covers the history, motivation and implementation of evolving frameworks (Sandia FOA Frameworks) upon which this long legacy of successful algorithms are built. The report describes the innovative microprocessor implementation, enabling extremely fast morphological processing, combined with a novel adaptive quantization front - end and a feature - based backend that resulted in Sandia developing fast and effective cueing in a wide variety of applications, from defect detection to SAR ATR. The report covers evolution from Sandia FOA 1.0 Framework (1995) to current Sandia FOA 4.0 Framework (2021). Requirements for the cueing algorithm for SIS - AOP (FOA_SIS - AOP) that drove the Sandia FOA 4.0 Framework development are discussed, along with information on how to use the Sandia FOA Frameworks.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

Identifying a regional aerosol baseline in the eastern North Atlantic using collocated measurements and a mathematical algorithm to mask high-submicron-number-concentration aerosol events

Abstract. High-time-resolution measurements of in situ aerosol and cloud properties provide the ability to study regional atmospheric processes that occur on timescales of minutes to hours. However, one limitation to this approach is that continuous measurements often include periods when the data collected are not representative of the regional aerosol. Even at remote locations, submicron aerosols are pervasive in the ambient atmosphere with many sources. Therefore, periods dominated by local aerosol should be identified before conducting subsequent analyses to understand aerosol regional processes and aerosol–cloud interactions. Here, we present a novel method to validate the identification of regional baseline aerosol data by applying a mathematical algorithm to the data collected at the U.S. Department of Energy's (DOE) Atmospheric Radiation Measurement (ARM) user facility in the eastern North Atlantic (ENA). The ENA central facility (C1) includes an aerosol observing system (AOS) for the measurement of aerosol physical, optical, and chemical properties at time resolutions from seconds to minutes. A second temporary supplementary facility (S1), located ∼0.75 km from C1, was deployed for ∼1 year during the Aerosol and Cloud Experiments (ACE-ENA) campaign in 2017. First, we investigate the local aerosol at both locations. We associate periods of high submicron number concentration (Ntot) in the fine-mode condensation particle counter (CPC) and size distributions from the Ultra-High Sensitivity Aerosol Spectrometer (UHSAS) as a function of wind direction using a meteorology sensor with local sources. Elevated concentrations of Aitken-mode (< 100 nm diameter) particles were observed in correspondence with the wind directions associated with airport operations. At ENA, the Graciosa Airport and its associated activities were found to be the main sources of high-concentration aerosol events at ENA, causing peaks in 1 min Ntot that exceeded 8000 and 10 000 cm−3 at C1, in summer and winter, respectively, and 5000 cm−3 at S1 in summer. Periods with high Ntot not associated with these wind directions were also observed. As a result, the diverse local sources at ENA yielded a poor relationship between Ntot measurements collected at C1 and S1 (R2=0.03 with a slope =0.05±0.001). As a first approach to mask these events, the time periods when the wind direction was associated with the airport operations (west to northwest and southeast to south at C1 and east to south at S1) were applied. The meteorological masks removed 38.9 % of the data at C1 and 43.4 % at S1, and they did not significantly improve the relationship between the two sites (R2=0.18 with a slope =0.06±0.001). Due to the complexity of high-Ntot events observed at ENA, we develop and validate a mathematical ENA Aerosol Mask (ENA-AM) to identify high-Ntot events using 1 min resolution data from the AOS CPC at C1 and S1. After its parameterization and application, ENA-AM generated a high correlation between Ntot in the summer at C1 and S1 (R2=0.87 with a slope =0.84±0.001). We identified the regional baseline at ENA to be 428±228 cm−3 in the summer and 346±223 cm−3 in the winter. Lastly, we compared masked measurements from the AOS with the ARM Aerial Facility (AAF) during flights over C1 in the summer to understand submicron aerosol vertical mixing over C1. The high correlation (R2=0.71 with a slope of 1.04±0.01) observed between C1 and the AAF Ntot collected within an area of 10 km surrounding ENA and at altitudes < 500 m indicated that the submicron aerosol at ENA was well mixed within the first 500 m of the marine boundary layer during the month of July during ACE-ENA. Our novel method for determining a regional aerosol baseline at ENA can be applied to other time periods and at other locations with validation by a secondary site or additional collocated measurements.

54 ENVIRONMENTAL SCIENCES↗
DOE OSTI2021

A Theoretical Approach for Reliability Within Information Supply Chains With Cycles and Negations

Complex networks of information processing systems, or information supply chains, present challenges for performance analysis. Here, we establish a mathematical setting, in which a process within an information supply chain can be analyzed in terms of the functionality of the system’s components. Principles of this methodology are rigorously defended and induce a model for determining the reliability for the various products in these networks. Our model does not limit us from having cycles in the network, as long as the cycles do not contain negation. It is shown that our approach to reliability resolves the nonuniqueness caused by cycles in a probabilistic Boolean network. An iterative algorithm is given to find the reliability values of the model, using a process that can be fully automated. This automated method of discerning reliability is beneficial for systems managers. As a systems manager considers systems modification, such as the replacement of owned and maintained hardware systems with cloud computing resources, the need for comparative analysis of system reliability is paramount. The model is extended to handle conditional knowledge about the network, allowing one to make predictions of weaknesses in the system. Finally, to illustrate the model’s flexibility over different forms, it is demonstrated on a system of components and subcomponents.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Multi-track reconstruction algorithm in the Mu2e experiment

The Mu2e experiment, under construction at Fermilab, will search for the neutrino-less coherent $\mu^-N\rightarrow e^-N$ conversion in the field of a $^{27}$Al nucleus. Such a process violates lepton flavor conservation. About $60\%$ of muons stopped by an $^{27}$Al nucleus will undergo nuclear capture, while about $40\%$ will decay in orbit. To quantify the conversion probability, we define $R_{\mu e}$, which is given by the ratio between the $\mu^-\rightarrow e^-$ conversion rate and the nuclear capture rate [1]: \begin{equation} R_{\mu e}= \frac{\Gamma\left(\mu^- + N\left(Z,A\right)\rightarrow e^- + N\left(Z,A\right)\right)}{\Gamma\left(\mu^- + N\left(Z,A\right)\rightarrow \nu^-_\mu + N\left(Z-1,A\right)\right)}\,. \end{equation} The upper limit on $R_{\mu e}$ is $7\cdot 10^{-13}$ at $90\%$ CL, set by the SINDRUM II experiment~\cite{SINDRUM II:limit}. The goal of the Mu2e experiment is to reach a sensitivity on $R_{\mu e}$ of $8\cdot 10^{-17}$ at $90\%$ CL. This represents a four-order of magnitude improvement over the current experimental limit. Mu2e will take its first data in 2027. The signature for the muon conversion is a monochromatic electron of $104.97$~\si{\mega\eV}/c, an energy slightly below the muon rest mass. While the main experiment goal is to reconstruct the conversion electron, i.e., an event with a single track, there are motivations to develop an efficient tracking algorithm for reconstructing more simultaneous tracks. This could better constrain the background generated by $p\bar{p}$-annihilation in the Al target and to search for other Beyond the Standard Model processes. In this paper, we present an algorithm designed to reconstruct multi-particle events.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗
DOE OSTI2024

Performance Analysis of Data Processing in Distributed File Systems with Near Data Processing

In the era of big data, the escalating volume and velocity of data generation pose significant challenges in data processing. Traditional systems like Spark and Hadoop manage the increasing amount and velocity of data by improving data placement and processing speeds. However, they face inherent limitations due to the essential data movement required for processing. In this paper, we explore the Skyhook framework, a novel extension of the Ceph distributed system, which significantly reduces the need for data movement. We present an extensive case study using the Skyhook framework, applying it with the TPC-H and K-means clustering algorithms. More specifically, we leverage the TPC-H benchmark to distinguish between CPU-intensive and I/O-intensive tasks. We explore the integration of K-means clustering into SQL, coupled with a near-data processing system to offload the computational burden of the K-means clustering algorithm to storage nodes. We conduct a comprehensive performance evaluation of distributed data processing applications across three processing approaches: traditional layout (baseline), optimized layout, and near-data processing. Additionally, we introduce the use of the FIO tool to simulate real-world system workloads, enabling the measurement of performance metrics such as average latency and CPU utilization. Our research is a significant advance in understanding how to optimize data processing systems to meet the demands of the modern data landscape.

Hou, Shiyue↗
DOE OSTI2021

Computational Complexity of Neuromorphic Algorithms

Neuromorphic computing has several characteristics that make it an extremely compelling computing paradigm for post Moore computation. Some of these characteristics include intrinsic parallelism, inherent scalability, collocated processing and memory, and event-driven computation. While these characteristics impart energy efficiency to neuromorphic systems, they do come with their own set of challenges. One of the biggest challenges in neuromorphic computing is to establish the theoretical underpinnings of the computational complexity of neuromorphic algorithms. In this paper, we take the first steps towards defining the space and time complexity of neuromorphic algorithms. Specifically, we describe a model of neuromorphic computation and state the assumptions that govern the computational complexity of neuromorphic algorithms. Next, we present a theoretical framework to define the computational complexity of a neuromorphic algorithm. We explicitly define what space and time complexities mean in the context of neuromorphic algorithms based on our model of neuromorphic computation. Finally, we leverage our approach and define the computational complexities of six neuromorphic algorithms: constant function, successor function, predecessor function, projection function, neuromorphic sorting algorithm and neighborhood subgraph extraction algorithm.

Date, Prasanna↗
DOE OSTI2020

Analytical Functions for 200 West Pump-and-Treat SCADA Sensor Data

Historical operations at the U.S. Department of Energy’s Hanford Site included disposal of waste fluids to the subsurface in the 200 West Area on the Hanford Central Plateau. Subsequent infiltration of fluids has resulted in groundwater contamination with carbon tetrachloride, nitrate, uranium, technetium-99, and other contaminants. A pump-and-treat (P&T) system, with an extraction/injection well network and an aboveground treatment plant, was implemented as part of interim and final remedies in the 200 West area. The HYPATIA single-page web application (part of the SOCRATES suite) is being developed to provide access to and analysis of chemistry and treatment facility sensor data for this 200 West P&T system. For the web application, analytical algorithms were developed to perform summing, differencing, smoothing, outlier detection, change-point detection, mass flow rate, and injectivity calculations on the data. Candidate algorithms were identified and tested, with the best-performing algorithms then assembled for implementation in HYPATIA. Because HYPATIA is hosted on the Amazon Web Services (AWS) cloud computing platform, algorithms were implemented in a back-end AWS Lambda function that can be called by the HYPATIA front end. The Lambda function applies the requested data processing to specified data via functions written in R, Python, and JavaScript. Development, testing, and review of the data analysis algorithms was completed under an NQA-1 quality program. This new HYPATIA functionality will provide information to support site decisions regarding P&T system performance and optimization.

12 MANAGEMENT OF RADIOACTIVE AND NON-RADIOACTIVE W↗