Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “randomized 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 1,027 records · Page 57
All sourcesNASA NTRSDOE OSTI
DOE OSTI2017

The Half Monte Carlo Method: Combining Total Monte Carlo with Nuclear Data Sensitivity Profiles

Both Total Monte Carlo (TMC) and Generalized Linear Least Squares (GLLS) algorithms have been used extensively to perform nuclear uncertainty propagation. Both methods have strengths and weaknesses, for example, the time required to perform TMC limits its attractiveness, while GLLS cannot generate higher order moments of output distributions and also has trouble dealing with nonlinear distributions. This work uses a new method that overcomes many of the aforementioned limitations of TMC and GLLS, while at the same time reasonably reproduces the TMC result. The concept is a simple combination of the two methods i.e., generate the random nuclear data files using the TMC approach, and then propagate the effect on the integral parameters like k{sub eff} using sensitivity coefficients, as opposed to cumbersome neutron transport calculations. Agreement is demonstrated for the Jezebel sphere ICSBEP benchmark. Since the method is part TMC part GLLS, the term Half Monte Method (HMM) will be used.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
DOE OSTI2014

Identification of topology changes in power grids using phasor measurements

Phasor measurement units (PMUs) are increasingly important for monitoring the state of an electrical power grid and quickly detecting topology changes caused by events such as lines going down or large loads being dropped. Phasors are complex‐valued measurements of voltage and current at various points of generation and consumption. If a line goes down or a load is removed, power flows change throughout the grid according to known physical laws, and the probability distribution of phasor measurements changes accordingly. This paper develops a method to estimate the current topology of a power grid from phasor measurements and considers the design goal of placing PMUs at strategic points in a distribution system to achieve good sensitivity to single‐line outages. From a vector of phasor measurements, probabilities are computed corresponding to the scenario that all power lines are operational and to alternate scenarios in which each line goes down individually. These probabilities are functions of the joint distributions of phasor measurements under each possible scenario, obtained through Monte Carlo simulations with random load profiles. We use log‐spline densities to estimate marginal distributions of phasor measurements and fold these into a multivariate Gaussian copula to capture important correlations. Sensitivity to outages varies according to which line goes down and where PMUs are placed on the grid. A greedy search algorithm is demonstrated for placing PMUs at locations that provide good sensitivity to single‐line outages. Published 2014. This article is a U.S. Government work and is in the public domain in the USA.

Wiel, Scott Vander↗
DOE OSTI2022

Objective Phenotyping of Root System Architecture Using Image Augmentation and Machine Learning in Alfalfa (Medicago sativa L.)

Active breeding programs specifically for root system architecture (RSA) phenotypes remain rare; however, breeding for branch and taproot types in the perennial crop alfalfa is ongoing. Phenotyping in this and other crops for active RSA breeding has mostly used visual scoring of specific traits or subjective classification into different root types. While image-based methods have been developed, translation to applied breeding is limited. This research is aimed at developing and comparing image-based RSA phenotyping methods using machine and deep learning algorithms for objective classification of 617 root images from mature alfalfa plants collected from the field to support the ongoing breeding efforts. Our results show that unsupervised machine learning tends to incorrectly classify roots into a normal distribution with most lines predicted as the intermediate root type. Encouragingly, random forest and TensorFlow-based neural networks can classify the root types into branch-type, taproot-type, and an intermediate taproot-branch type with 86% accuracy. With image augmentation, the prediction accuracy was improved to 97%. Coupling the predicted root type with its prediction probability will give breeders a confidence level for better decisions to advance the best and exclude the worst lines from their breeding program. This machine and deep learning approach enables accurate classification of the RSA phenotypes for genomic breeding of climate-resilient alfalfa.

59 BASIC BIOLOGICAL SCIENCES↗
DOE OSTI2017

Photovoltaic Hosting Capacity of Feeders with Reactive Power Control and Tap Changers

This paper proposes an algorithm to determine photovoltaic (PV) hosting capacity of power distribution networks as a function of number of PV injection nodes, reactive power support from the PVs, and the sub-station load tap changers (LTCs). In the proposed method, several minute by minute simulations are run based on randomly chosen PV injection nodes, daily PV output profiles, and daily load profiles from a pool of high-resolution realistic data set. The simulation setup is built using OpenDSS and MATLAB. The performance of the proposed method is investigated in the IEEE 123-node distribution feeder for multiple scenarios. The case studies are performed particularly for one, two, five and ten PV injection nodes, and looking at the maximum voltage deviations. Case studies show that the PV hosting capacity of the 123-node feeder greatly differs with the number of PV injection nodes. We have also observed that the PV hosting capacity increases with reactive power support and higher tap position of sub-station LTC.

14 SOLAR ENERGY↗
DOE OSTI2023

A semi-agnostic ansatz with variable structure for variational quantum algorithms

Quantum machine learning—and specifically Variational Quantum Algorithms (VQAs)—offers a powerful, flexible paradigm for programming near-term quantum computers, with applications in chemistry, metrology, materials science, data science, and mathematics. Here, one trains an ansatz, in the form of a parameterized quantum circuit, to accomplish a task of interest. However, challenges have recently emerged suggesting that deep ansatzes are difficult to train, due to flat training landscapes caused by randomness or by hardware noise. This motivates our work, where we present a variable structure approach to build ansatzes for VQAs. Our approach, called VAns (Variable Ansatz), applies a set of rules to both grow and (crucially) remove quantum gates in an informed manner during the optimization. Consequently, VAns is ideally suited to mitigate trainability and noise-related issues by keeping the ansatz shallow. We employ VAns in the variational quantum eigensolver for condensed matter and quantum chemistry applications, in the quantum autoencoder for data compression and in unitary compilation problems showing successful results in all cases.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2021

Balanced k -means clustering on an adiabatic quantum computer

Adiabatic quantum computers are a promising platform for efficiently solving challenging optimization problems. Therefore, many are interested in using these computers to train computationally expensive machine learning models. We present a quantum approach to solving the balanced k-means clustering training problem on the D-Wave 2000Q adiabatic quantum computer. In order to do this, we formulate the training problem as a quadratic unconstrained binary optimization (QUBO) problem. Unlike existing classical algorithms, our QUBO formulation targets the global solution to the balanced k-means model. We test our approach on a number of small problems and observe that despite the theoretical benefits of the QUBO formulation, the clustering solution obtained by a modern quantum computer is usually inferior to the solution obtained by the best classical clustering algorithms. Nevertheless, the solutions provided by the quantum computer do exhibit some promising characteristics. We also perform a scalability study to estimate the run time of our approach on large problems using future quantum hardware. Finally, as a final proof of concept, we used the quantum approach to cluster random subsets of the Iris benchmark data set.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2014

Accelerating dissipative particle dynamics simulations on GPUs: Algorithms, numerics and applications

We present a scalable dissipative particle dynamics simulation code, fully implemented on the Graphics Processing Units (GPUs) using a hybrid CUDA/MPI programming model, which achieves 10-30 times speedup on a single GPU over 16 CPU cores and almost linear weak scaling across a thousand nodes. A unified framework is developed within which the efficient generation of the neighbor list and maintaining particle data locality are addressed. Our algorithm generates strictly ordered neighbor lists in parallel, while the construction is deterministic and makes no use of atomic operations or sorting. Such neighbor list leads to optimal data loading efficiency when combined with a two-level particle reordering scheme. A faster in situ generation scheme for Gaussian random numbers is proposed using precomputed binary signatures. We designed custom transcendental functions that are fast and accurate for evaluating the pairwise interaction. The correctness and accuracy of the code is verified through a set of test cases simulating Poiseuille flow and spontaneous vesicle formation. Computer benchmarks demonstrate the speedup of our implementation over the CPU implementation as well as strong and weak scalability. A large-scale simulation of spontaneous vesicle formation consisting of 128 million particles was conducted to further illustrate the practicality of our code in real-world applications.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2018

Progress on Complex Langevin simulations of a finite density matrix model for QCD

We study the Stephanov model, which is an RMT model for QCD at finite density, using the Complex Langevin algorithm. Naive implementation of the algorithm shows convergence towards the phase quenched or quenched theory rather than to intended theory with dynamical quarks. A detailed analysis of this issue and a potential resolution of the failure of this algorithm are discussed. We study the effect of gauge cooling on the Dirac eigenvalue distribution and time evolution of the norm for various cooling norms, which were specifically designed to remove the pathologies of the complex Langevin evolution. The cooling is further supplemented with a shifted representation for the random matrices. Unfortunately, none of these modifications generate a substantial improvement on the complex Langevin evolution and the final results still do not agree with the analytical predictions.

Bloch, Jacques↗
DOE OSTI2016

Search for the Heisenberg spin glass on rewired square lattices with antiferromagnetic interaction

Spin glass (SG) is a typical magnetic system with frozen random spin orientation at low temperatures. The system exhibits rich physical properties, such as infinite number of ground states, memory effect, and aging phenomena. There are two main ingredients considered to be pivotal for the existence of SG behavior, namely, frustration and randomness. For the canonical SG system, frustration is led by the presence of competing interaction between ferromagnetic (FM) and antiferromagnetic (AF) couplings. Previously, Bartolozzi et al. [Phys. Rev. B73, 224419 (2006)], reported the SG properties of the AF Ising spins on scale free network (SFN). It is a new type of SG, different from the canonical one which requires the presence of both FM and AF couplings. In this new system, frustration is purely caused by the topological factor and its randomness is related to the irregular connectvity. Recently, Surungan et. al. [Journal of Physics: Conference Series, 640, 012001 (2015)] reported SG bahavior of AF Heisenberg model on SFN. We further investigate this type of system by studying an AF Heisenberg model on rewired square lattices. We used Replica Exchange algorithm of Monte Carlo Method and calculated the SG order parameter to search for the existence of SG phase.

36 MATERIALS SCIENCE↗
DOE OSTI2020

Trabecula: A Random Generator of Computational Phantoms for Bone Marrow Dosimetry

This study was motivated by the efforts on evaluation of radiation risk for leukemia incidence in the Techa River Cohort, where the main bone marrow dose contributors were 89,90Sr (bone-seeking beta emitters). Energy deposition in bone marrow targets was evaluated by simulating radiation particle transport using computational phantoms. The present paper describes the computer program “Trabecula” implementing an algorithm for parametric generation of computational phantoms, which serve as the basis for calculating bone marrow doses. “Trabecula” is a user-friendly tool that automatically converts analytical models into voxelized representations that are directly compatible as input to MCNP.

Shishkina, Elena A.↗
DOE OSTI2023

Comparison of Machine Learning Algorithms for Natural Gas Identification with Mixed Potential Electrochemical Sensor Arrays

Mixed-potential electrochemical sensor arrays consisting of indium tin oxide (ITO), La 0.87 Sr 0.13 CrO 3 , Au, and Pt electrodes can detect the leaks from natural gas infrastructure. Algorithms are needed to correctly identify natural gas sources from background natural and anthropogenic sources such as wetlands or agriculture. We report for the first time a comparison of several machine learning methods for mixture identification in the context of natural gas emissions monitoring by mixed potential sensor arrays. Random Forest, Artificial Neural Network, and Nearest Neighbor methods successfully classified air mixtures containing only CH 4 , two types of natural gas simulants, and CH 4 +NH 3 with >98% identification accuracy. The model complexity of these methods were optimized and the degree of robustness against overfitting was determined. Finally, these methods are benchmarked on both desktop PC and single-board computer hardware to simulate their application in a portable internet-of-things sensor package. The combined results show that the random forest method is the preferred method for mixture identification with its high accuracy (>98%), robustness against overfitting with increasing model complexity, and had less than 10 ms training time and less than 0.1 ms inference time on single-board computer hardware.

03 NATURAL GAS↗
DOE OSTI2017

Using Nucleon Multiplicities to Analyze Anti-Neutrino Interactions with Nuclei

The most commonly used, simple interaction models have not accurately described the nuclear effects on either neutrino-nucleus or anti-neutrino-nucleus interactions. Comparison of data collected by the MINERvA experiment and these models shows a discrepancy in the reconstructed hadronic energy distribution at momentum transfers below 0.8 GeV. Two nuclear model effects that were previously not modeled are possible culprits of this discrepancy. The first is known as random-phase-approximation and the second is the addition of a meson exchange current process, also known as two-particle two-hole due to its result in two particles leaving the nucleus with two holes left in their place. For the first time a neutron counting software algorithm has been created and used to compare the multiplicity and spatial distributions of neutrons between the simulation and data. There is localized sensitivity to the RPA and 2p2h effects and both help the simulation better describe the data. Ad ditional systematic or model effects are present which cause the simulation to overproduce neutrons, and potential causes are discussed.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2016

Testing of advanced technique for linear lattice and closed orbit correction by modeling its application for iota ring at Fermilab

Many modern and most future accelerators rely on precise configuration of lattice and trajectory. The Integrable Optics Test Accelerator (IOTA) at Fermilab that is coming to final stages of construction will be used to test advanced approaches of control over particles dynamics. Various experiments planned at IOTA require high flexibility of lattice configuration as well as high precision of lattice and closed orbit control. Dense element placement does not allow to have ideal configuration of diagnostics and correctors for all planned experiments. To overcome this limitations advanced method of lattice an beneficial for other machines. Developed algorithm is based on LOCO approach, extended with various sets of other experimental data, such as dispersion, BPM BPM phase advances, beam shape information from synchrotron light monitors, responses of closed orbit bumps to variations of focusing elements and other. Extensive modeling of corrections for a big number of random seed errors is used to illustrate benefits from developed approach.

43 PARTICLE ACCELERATORS↗
DOE OSTI2023

Methane monitoring and detection apparatus and methods

A low cost, low power, passive optical methane monitoring system for fixed-position installation at oil and gas production well pads and gathering centers is disclosed. The optical methane monitoring system disclosed can be a scannable field of view Near Infrared (NIR) filter photometer to detect and quantify methane concentration in a two dimensional or a three dimensional grid above and around a facility. A randomized fiber optic bundle is disclosed that can be used to direct the total optical power from a collection lens to two or more isolated optical channels. Band pass filters isolate a desired wavelength range for transmission measurements for the two or more channels. Also disclosed is an absorption algorithm which accounts for variable background spectral intensity as well as correcting for water vapor and overall scattering effects to measure methane concentration for a given field of view.

Lievois, John↗
DOE OSTI2024

Finite elements for Matérn-type random fields: Uncertainty in computational mechanics and design optimization

This work highlights an approach for incorporating realistic uncertainties into scientific computing workflows based on finite elements, focusing on prevalent applications in computational mechanics and design optimization. We leverage Matérn-type Gaussian random fields (GRFs) generated using the SPDE method to model aleatoric uncertainties, including environmental influences, variating material properties, and geometric ambiguities. Our focus lies on delivering practical GRF realizations that accurately capture imperfections and variations and understanding how they impact the predictions of computational models as well as the shape and topology of optimized designs. Here we describe a numerical algorithm based on solving a generalized SPDE to sample GRFs on arbitrary meshed domains. The algorithm leverages established techniques and integrates seamlessly with the open-source finite element library MFEM and associated scientific computing workflows, like those found in industrial and national laboratory settings. Our solver scales efficiently for large-scale problems and supports various domain types, including surfaces and embedded manifolds. We showcase its versatility through biomechanics and topology optimization applications, emphasizing the potential to influence these domains. The flexibility and efficiency of SPDE-based GRF generation empowers us to run large-scale optimization problems on 2D and 3D domains, including finding optimized designs on embedded surfaces, and to generate design features and topologies beyond the reach of conventional techniques. Moreover, these capabilities allow us to model and quantify geometric uncertainties on reconstructed submanifolds, such as the interpolated surfaces of cerebral aneurysms provided by postprocessing CT scans. In addition to offering benefits in these specific domains, the proposed techniques transcend specific applications and generalize to arbitrary forward and backward problems in uncertainty quantification involving finite elements.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2026

Efficient Measurement-Driven Eigenenergy Estimation with Classical Shadows

Quantum algorithms exploiting real-time evolution under a target Hamiltonian have demonstrated remarkable efficiency in extracting key spectral information. However, the broader potential of these methods, particularly beyond ground-state calculations, is underexplored. In this work, we introduce the framework of multiobservable dynamic mode decomposition (MODMD), which combines the observable dynamic mode decomposition (DMD), a measurement-driven eigensolver tailored for near-term implementation, with classical shadow tomography. MODMD leverages random scrambling in the classical shadow technique to construct, with exponentially reduced resource requirements, a signal subspace that encodes rich spectral information. Notably, we replace typical Hadamard-test circuits with a protocol designed to predict low-rank observables, thereby broadening the use of classical shadow tomography for predicting many low-rank observables. We establish theoretical guarantees on the spectral approximation from MODMD, taking into account distinct sources of error. In the ideal case, we prove that the spectral error scales as exp (−Δ⁢𝐸⁢𝑡 max ), where Δ⁢𝐸 is the Hamiltonian spectral gap and 𝑡 max is the maximal simulation time. This analysis provides a rigorous justification of the rapid convergence observed across simulations. To demonstrate the utility of our framework, we consider its application to fundamental tasks, such as determining the low-lying, i.e., ground or excited, energies of representative many-body systems. Our work paves the path for efficient designs of measurement-driven algorithms on near-term and early fault-tolerant quantum devices.

quantum algorithms & computation↗
DOE OSTI2012

Open-source MFIX-DEM software for gas-solids flows: Part II — Validation studies

With rapid advancements in computer hardware and numerical algorithms, computational fluid dynamics (CFD) has been increasingly employed as a useful tool for investigating the complex hydrodynamics inherent in multiphase flows. An important step during the development of a CFD model and prior to its application is conducting careful and comprehensive verification and validation studies. Accordingly, efforts to verify and validate the open-source MFIX-DEM software, which can be used for simulating the gas–solids flow using an Eulerian reference frame for the continuum fluid and a Lagrangian discrete framework (Discrete Element Method) for the particles, have been made at the National Energy Technology Laboratory (NETL). In part I of this paper, extensive verification studies were presented and in this part, detailed validation studies of MFIX-DEM are presented. A series of test cases covering a range of gas–solids flow applications were conducted. In particular the numerical results for the random packing of a binary particle mixture, the repose angle of a sandpile formed during a side charge process, velocity, granular temperature, and voidage profiles from a bounded granular shear flow, lateral voidage and velocity profiles from a monodisperse bubbling fluidized bed, lateral velocity profiles from a spouted bed, and the dynamics of segregation of a binary mixture in a bubbling bed were compared with available experimental data, and in some instances with empirical correlations. In addition, sensitivity studies were conducted for various parameters to quantify the error in the numerical simulation.

42 ENGINEERING↗
DOE OSTI2022

Random Forest Regressor-Based Approach for Detecting Fault Location and Duration in Power Systems

Power system failures or outages due to short-circuits or “faults” can result in long service interruptions leading to significant socio-economic consequences. It is critical for electrical utilities to quickly ascertain fault characteristics, including location, type, and duration, to reduce the service time of an outage. Existing fault detection mechanisms (relays and digital fault recorders) are slow to communicate the fault characteristics upstream to the substations and control centers for action to be taken quickly. Fortunately, due to availability of high-resolution phasor measurement units (PMUs), more event-driven solutions can be captured in real time. In this paper, we propose a data-driven approach for determining fault characteristics using samples of fault trajectories. A random forest regressor (RFR)-based model is used to detect real-time fault location and its duration simultaneously. This model is based on combining multiple uncorrelated trees with state-of-the-art boosting and aggregating techniques in order to obtain robust generalizations and greater accuracy without overfitting or underfitting. Four cases were studied to evaluate the performance of RFR: 1. Detecting fault location (case 1), 2. Predicting fault duration (case 2), 3. Handling missing data (case 3), and 4. Identifying fault location and length in a real-time streaming environment (case 4). A comparative analysis was conducted between the RFR algorithm and state-of-the-art models, including deep neural network, Hoeffding tree, neural network, support vector machine, decision tree, naive Bayesian, and K-nearest neighborhood. Experiments revealed that RFR consistently outperformed the other models in detection accuracy, prediction error, and processing time.

24 POWER TRANSMISSION AND DISTRIBUTION↗