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 955 records · Page 53
All sourcesNASA NTRSDOE OSTI
DOE OSTI2017

Community detection with spiking neural networks for neuromorphic hardware

We present results related to the performance of an algorithm for community detection which incorporates event-driven computation. We define a mapping which takes a graph 𝒢 to a system of symmetrically connected, spiking neurons and use spike train similarities to identify vertex communities. On a random graph with 128 vertices and known community structure we show how our approach can be used to identify individual communities from spiking neuron responses.

Hamilton, Kathleen↗
DOE OSTI2022

GraphAlign: Graph-Enabled Machine Learning for Seismic Event Filtering

This report summarizes results from a 2 year effort to improve the current automated seismic event processing system by leveraging machine learning models that can operated over the inherent graph data structure of a seismic sensor network. Specifically, the GraphAlign project seeks to utilize prior information on which stations are more likely to detect signals originating from particular geographic regions to inform event filtering. To date, the GraphAlign team has developed a Graphical Neural Network (GNN) model to filter out false events generated by the Global Associator (GA) algorithm. The algorithm operates directly on waveform data that has been associated to an event by building a variable sized graph of station waveforms nodes with edge relations to an event location node. This builds off of previous work where random forest models were used to do the same task using hand crafted features. The GNN model performance was analyzed using an 8 week IMS/IDC dataset, and it was demonstrated that the GNN outperforms the random forest baseline. We provide additional error analysis of which events the GNN model performs well and poorly against concluded by future directions for improvements.

58 GEOSCIENCES↗
DOE OSTI2025

Robust Multi-fidelity Bayesian Optimization with Deep Kernel and Partition

Multi-fidelity Bayesian optimization (MFBO) is a powerful approach that utilizes lowfidelity, cost-effective sources to expedite the exploration and exploitation of a high-fidelity objective function. Existing MFBO methods with theoretical foundations either lack justification for performance improvements over single-fidelity optimization or rely on strong assumptions about the relationships between fidelity sources to construct surrogate models and direct queries to low-fidelity sources. To mitigate the dependency on cross-fidelity assumptions while maintaining the advantages of low-fidelity queries, we introduce a random sampling and partition-based MFBO framework with deep kernel learning. This framework is robust to cross-fidelity model misspecification and explicitly illustrates the benefits of low-fidelity queries. Our results demonstrate that the proposed algorithm effectively manages complex cross-fidelity relationships and efficiently optimizes the target fidelity function.

Zhang, Fengxue [University of Chicago, Illinois, U↗
DOE OSTI2020

TURBOMOLE: Modular program suite for ab initio quantum-chemical and condensed-matter simulations

TURBOMOLE is a collaborative, multi-national software development project aiming to provide highly efficient and stable computational tools for quantum chemical simulations of molecules, clusters, periodic systems, and solutions. The TURBOMOLE software suite is optimized for widely available, inexpensive, and resource-efficient hardware such as multi-core workstations and small computer clusters. TURBOMOLE specializes in electronic structure methods with outstanding accuracy–cost ratio, such as density functional theory including local hybrids and the random phase approximation (RPA), GW-Bethe–Salpeter methods, second-order Møller–Plesset theory, and explicitly correlated coupled-cluster methods. TURBOMOLE is based on Gaussian basis sets and has been pivotal for the development of many fast and low-scaling algorithms in the past three decades, such as integral-direct methods, fast multipole methods, the resolution-of-the-identity approximation, imaginary frequency integration, Laplace transform, and pair natural orbital methods. This review focuses on recent additions to TURBOMOLE’s functionality, including excited-state methods, RPA and Green’s function methods, relativistic approaches, high-order molecular properties, solvation effects, and periodic systems. A variety of illustrative applications along with accuracy and timing data are discussed. Moreover, available interfaces to users as well as other software are summarized. TURBOMOLE’s current licensing, distribution, and support model are discussed, and an overview of TURBOMOLE’s development workflow is provided. Challenges such as communication and outreach, software infrastructure, and funding are highlighted.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
DOE OSTI2022

PowerNet: Multi-agent Deep Reinforcement Learning for Scalable Powergrid Control

This paper develops an efficient multi-agent deep reinforcement learning algorithm for cooperative controls in powergrids. Specifically, we consider the decentralized inverter-based secondary voltage control problem in distributed generators (DGs), which is first formulated as a cooperative multi-agent reinforcement learning (MARL) problem. We then propose a novel on-policy MARL algorithm, PowerNet, in which each agent (DG) learns a control policy based on (sub-)global reward but local states and encoded communication messages from its neighbors. Motivated by the fact that a local control from one agent has limited impact on agents distant from it, we exploit a novel spatial discount factor to reduce the effect from remote agents, to expedite the training process and improve scalability. Furthermore, a differentiable, learning-based communication protocol is employed to foster the collaborations among neighboring agents. In addition, to mitigate the effects of system uncertainty and random noise introduced during on-policy learning, we utilize an action smoothing factor to stabilize the policy execution. To facilitate training and evaluation, we develop PGSim, an efficient, high-fidelity powergrid simulation platform. Here, experimental results in two microgrid setups show that the developed PowerNet outperforms the conventional model-based control method, as well as several state-of-the-art MARL algorithms. The decentralized learning scheme and high sample efficiency also make it viable to large-scale power grids.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2014

History dependent quantum random walks as quantum lattice gas automata

Quantum Random Walks (QRW) were first defined as one-particle sectors of Quantum Lattice Gas Automata (QLGA). Recently, they have been generalized to include history dependence, either on previous coin (internal, i.e., spin or velocity) states or on previous position states. These models have the goal of studying the transition to classicality, or more generally, changes in the performance of quantum walks in algorithmic applications. We show that several history dependent QRW can be identified as one-particle sectors of QLGA. This provides a unifying conceptual framework for these models in which the extra degrees of freedom required to store the history information arise naturally as geometrical degrees of freedom on the lattice.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2025

End–to–End Metasurface Design for Temperature Imaging via Broadband Planck‐Radiation Regression

A theoretical framework is presented for temperature imaging from long-wavelength infrared (LWIR) thermal radiation (e.g., 8–12 µm) through the end-to-end design of a metasurface-optics frontend and a computational-reconstruction backend. A new nonlinear reconstruction algorithm, “Planck regression”, is introduced to reconstruct the temperature map from a gray scale sensor image, even in the presence of severe chromatic aberration, by exploiting black body and optical physics particular to thermal imaging. This algorithm is combined with an end-to-end approach that optimizes manufacturable, single-layer metasurfaces to yield the most accurate reconstruction. The designs demonstrate high-quality, noise-robust reconstructions of arbitrary temperature maps (including completely random images) in simulations of an ultra-compact thermal-imaging device. Here, it is also shown that Planck regression is much more generalizable to arbitrary images than a straightforward neural-network reconstruction, which requires a large training set of domain-specific images.

36 MATERIALS SCIENCE↗
DOE OSTI2023

Machine learning and deep learning for mineralogy interpretation and CO 2 saturation estimation in geological carbon Storage: A case study in the Illinois Basin

Carbon capture and storage (CCS) is a promising approach to simultaneously maintaining energy security and reducing carbon dioxide (CO 2 ) emissions under the current energy portfolio that is dominated by fossil fuel energy. Pre-injection formation characterization and post-injection CO 2 monitoring are two critical tasks to guarantee storage efficiency in CCS. The CCS projects in the Illinois Basin, the first large-scale CO 2 injection into saline aquifers in the United States, employed conventional and the latest pulsed neutron logging (PNL) tools for mineralogy interpretation and CO 2 saturation estimation, which provide valuable references for future CCS projects. Because of the inherent fuzziness of petrophysical measurements and complex subsurface heterogeneity, interpreting well-logging data is time-consuming, and its accuracy can be user-biased. In recent years, data-driven methods have been widely used to capture the non-linear patterns between input features and interpretation results. This work applied and evaluated four commonly used machine learning (ML) models, including ridge regression (RR), random forest (RF), gradient boosting regression (GBR), support vector regression (SVR), and one deep learning (DL) model, the artificial neural network (ANN). We optimized the hyperparameters of the four ML models and the DL model using the simulated annealing algorithm and the grid search strategy, respectively. The input features of the mineralogy interpretation models were eleven conventional well-logging parameters, and the label data (i.e., ground truth) were the porosity and volumetric fractions of six minerals, including quartz, feldspar, dolomite, calcite, clay, and iron minerals. The results demonstrated that the GBR and RF models were superior in predicting volumetric fractions of minerals and porosity; label data with low coefficient of variation (CV) values tended to yield better performance. For CO 2 saturation estimation, the RF was the best-performing model, followed by SVR, ANN, GBR, and RR. Furthermore, we conducted feature importance ranking using the permutation importance algorithm and found that the formation sigma and well pressure were the most important features in this study. In conclusion, the study of CCS projects in the Illinois Basin bridges the gap between the limited knowledge and understanding of geological carbon storage and the increasing demand for reliable, cost-effective, and sustainable energy solutions.

58 GEOSCIENCES↗
DOE OSTI2023

Machine learning results and code

Results for all the Four MLP-NN, RF, XGBR, and RF algorithms for each of geophysical array`s and machine learning python code is provided.

58 GEOSCIENCES↗
DOE OSTI2014

Automated characterization of perceptual quality of clinical chest radiographs: Validation and calibration to observer preference

Purpose: The authors previously proposed an image-based technique [Y. Lin et al. Med. Phys. 39, 7019–7031 (2012)] to assess the perceptual quality of clinical chest radiographs. In this study, an observer study was designed and conducted to validate the output of the program against rankings by expert radiologists and to establish the ranges of the output values that reflect the acceptable image appearance so the program output can be used for image quality optimization and tracking. Methods: Using an IRB-approved protocol, 2500 clinical chest radiographs (PA/AP) were collected from our clinical operation. The images were processed through our perceptual quality assessment program to measure their appearance in terms of ten metrics of perceptual image quality: lung gray level, lung detail, lung noise, rib–lung contrast, rib sharpness, mediastinum detail, mediastinum noise, mediastinum alignment, subdiaphragm–lung contrast, and subdiaphragm area. From the results, for each targeted appearance attribute/metric, 18 images were selected such that the images presented a relatively constant appearance with respect to all metrics except the targeted one. The images were then incorporated into a graphical user interface, which displayed them into three panels of six in a random order. Using a DICOM calibrated diagnostic display workstation and under low ambient lighting conditions, each of five participating attending chest radiologists was tasked to spatially order the images based only on the targeted appearance attribute regardless of the other qualities. Once ordered, the observer also indicated the range of image appearances that he/she considered clinically acceptable. The observer data were analyzed in terms of the correlations between the observer and algorithmic rankings and interobserver variability. An observer-averaged acceptable image appearance was also statistically derived for each quality attribute based on the collected individual acceptable ranges. Results: The observer study indicated that, for each image quality attribute, the averaged observer ranking strongly correlated with the algorithmic ranking (linear correlation coefficient R > 0.92), with highest correlation (R = 1) for lung gray level and the lowest (R = 0.92) for mediastinum noise. There was a strong concordance between the observers in terms of their rankings (i.e., Kendall’s tau agreement > 0.84). The observers also generally indicated similar tolerance and preference levels in terms of acceptable ranges, as 85% of the values were close to the overall tolerance or preference levels and the differences were smaller than 0.15. Conclusions: The observer study indicates that the previously proposed technique provides a robust reflection of the perceptual image quality in clinical images. The results established the range of algorithmic outputs for each metric that can be used to quantitatively assess and qualify the appearance quality of clinical chest radiographs.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗
DOE OSTI2015

SU-E-T-629: Prediction of the ViewRay Radiotherapy Treatment Time for Clinical Logistics

Purpose: An algorithm is developed in our clinic, given a new treatment plan, to predict treatment delivery time for radiation therapy (RT) treatments of patients on ViewRay magnetic resonance-image guided radiation therapy (MR-IGRT) delivery system. This algorithm is necessary for managing patient treatment appointments, and is useful as an indicator to assess the treatment plan complexity. Methods: A patient’s total treatment delivery time, not including time required for localization, may be described as the sum of four components: (1) the treatment initialization time; (2) the total beam-on time; (3) the gantry rotation time; and (4) the multileaf collimator (MLC) motion time. Each of the four components is predicted separately. The total beam-on time can be calculated using both the planned beam-on time and the decay-corrected delivery dose rate. To predict the remaining components, we quantitatively analyze the patient treatment delivery record files. The initialization time is demonstrated to be random since it depends on the final gantry angle and MLC leaf positions of the previous treatment. Based on modeling the relationships between the gantry rotation angles and the corresponding rotation time, and between the furthest MLC leaf moving distance and the corresponding MLC motion time, the total delivery time is predicted using linear regression. Results: The proposed algorithm has demonstrated the feasibility of predicting the ViewRay treatment delivery time for any treatment plan of any patient. The average prediction error is 0.89 minutes or 5.34%, and the maximal prediction error is 2.09 minutes or 13.87%. Conclusion: We have developed a treatment delivery time prediction algorithm based on the analysis of previous patients’ treatment delivery records. The accuracy of our prediction is sufficient for guiding and arranging patient treatment appointments on a daily basis. The predicted delivery time could also be used as an indicator to assess the treatment plan complexity. This work was supported by a research grant from Viewray Inc.

62 RADIOLOGY AND NUCLEAR MEDICINE↗
DOE OSTI2021

Robust implementation of generative modeling with parametrized quantum circuits

Although the performance of hybrid quantum-classical algorithms is highly dependent on the selection of the classical optimizer and the circuit ansätze, a robust and thorough assessment on-hardware of such features has been missing to date. From the optimizer perspective, the primary challenge lies in the solver’s stochastic nature, and their significant variance over the random initialization. Therefore, a robust comparison requires one to perform several training curves for each solver before one can reach conclusions about their typical performance. Since each of the training curves requires the execution of thousands of quantum circuits in the quantum computer, such a robust study remained a steep challenge for most hybrid platforms available today. In this work, we leverage on Rigetti’s Quantum Cloud Services (QCS™) to overcome this implementation barrier, and we study the on-hardware performance of the data-driven quantum circuit learning (DDQCL) for three different state-of-the-art classical solvers, and on two-different circuit ansätze associated to different entangling connectivity graphs for the same task. Additionally, we assess the gains in performance from varying circuit depths. To evaluate the typical performance associated with each of these settings in this benchmark study, we use at least five independent runs of DDQCL towards the generation of quantum generative models capable of capturing the patterns of the canonical Bars and Stripes dataset. In this experimental benchmarking, the gradient-free optimization algorithms show an outstanding performance compared to the gradient-based solver. In particular, one of them had better performance when handling the unavoidable noisy objective function to be minimized under experimental conditions.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

Speed vs Accuracy: Effect on Ligand Pose Accuracy of Varying Box Size and Exhaustiveness in AutoDock Vina

Abstract Structure‐based virtual high‐throughput screening involves docking chemical libraries to targets of interest. A parameter pertinent to the accuracy of the resulting pose is the root mean square deviation (RMSD) from a known crystallographic structure, i. e., the ‘docking power’. Here, using a popular algorithm, Autodock Vina, as a model program, we evaluate the effects of varying two common docking parameters: the box size (the size of docking search space) and the exhaustiveness of the global search (the number of independent runs starting from random ligand conformations) on the RMSD from the PDBbind v2017 refined dataset of experimental protein‐ligand complexes. Although it is clear that exhaustiveness is an important parameter, there is wide variation in the values used, with variation between 1 and >100. We, therefore, evaluated a combination of cubic boxes of different sizes and five exhaustiveness values (1, 8, 25, 50, 75, 100) within the range of those commonly adopted. The results show that the default exhaustiveness value of 8 performs well overall for most box sizes. In contrast, for all box sizes, but particularly for large boxes, an exhaustiveness value of 1 led to significantly higher median RMSD (mRMSD) values. The docking power was slightly improved with an exhaustiveness of 25, but the mRMSD changes little with values higher than 25. Therefore, although low exhaustiveness is computationally faster, the results are more likely to be far from reality, and, conversely, values >25 led to little improvement at the expense of computational resources. Overall, we recommend users to use at least the default exhaustiveness value of 8 for virtual screening calculations.

Agarwal, Rupesh↗
DOE OSTI2015

CCQE, 2p2h excitations and ν—energy reconstruction

We analyze the MiniBooNE muon neutrino CCQE-like dσ/dT{sub μ} d cos θ{sub μ} data using a theoretical model that, among other nuclear effects, includes RPA correlations and 2p2h (multinucleon) mechanisms. These corrections turn out to be essential for the description of the data. We find that MiniBooNE CCQE-like data are fully compatible with former determinations of the nucleon axial mass M{sub A} ∼ 1.05 GeV. This is in sharp contrast with several previous analysis where anomalously large values of M{sub A} ∼ 1.4 GeV have been suggested. We also show that because of the the multinucleon mechanism effects, the algorithm used to reconstruct the neutrino energy is not adequate when dealing with quasielastic-like events. Finally, we analyze the MiniBooNE unfolded cross section, and show that it exhibits an excess (deficit) of low (high) energy neutrinos, which is an artifact of the unfolding process that ignores 2p2h mechanisms.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2017

Real-Time Optimal Power Flow

Future power networks are expected to incorporate a large number of distributed energy resources, which introduce randomness and fluctuations as well as fast control capabilities. But traditional optimal power flow methods are only appropriate for applications that operate on a slow timescale. In this paper, we build on recent work to develop a real-time algorithm for AC optimal power flow, based on quasi-Newton methods. The algorithm uses second-order information to provide suboptimal solutions on a fast timescale, and can be shown to track the optimal power flow solution when the estimated second-order information is sufficiently accurate. We also give a specific implementation based on L-BFGS-B method, and show by simulation that the proposed algorithm has good performance and is computationally efficient.

Tang, Yujie↗
DOE OSTI2019

Low-Rank Solution Methods for Stochastic Eigenvalue Problems

In this report, we study efficient solution methods for stochastic eigenvalue problems arising from discretization of self-adjoint partial differential equations with random data, where the underlying operators depend linearly on the random parameters. With the stochastic Galerkin approach, the solutions are represented as generalized polynomial chaos expansions. When these solutions can be approximated well by low-rank objects, we introduce a low-rank variant of the inverse subspace iteration algorithm for computing one or several minimal eigenvalues and corresponding eigenvectors of parameter-dependent matrices. In the algorithm, the iterates are approximated by low-rank matrices, which leads to significant cost savings. Furthermore, the algorithm is tested on two benchmark problems, a stochastic diffusion problem with some poorly separated eigenvalues, and an operator derived from a discrete stochastic Stokes problem whose minimal eigenvalue is related to the inf-sup stability constant. Numerical experiments show that the low-rank algorithm produces accurate solutions compared to the Monte Carlo method, and it uses much less computational time than the original algorithm without low-rank approximation.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2012

Livermore Random I/O Testbench

LRIOT is a test bench framework that is designed to generate sophisticated I/O rates that can stress high-performance memory and storage systems, such as non-volatile random access memories (NVRAM)and storage class memory. Furthermore, LRIOT provides the capabilities to mix multiple types of concurrency, namely threading and task parallelism, as well as distributed execution using Message Passing Interface (MPI) libraries. It will be used by algorithm designers to generate access patterns that mimic their application's behavior, and by system designers to test high-performance NVRAM storage.

Source record↗