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 919 records · Page 51
All sourcesNASA NTRSDOE OSTI
DOE OSTI2021

A novel framework for hosting capacity analysis with spatio-temporal probabilistic voltage sensitivity analysis

Smart grids are envisioned to accommodate high penetration of distributed photovoltaic (PV) generation, which may cause adverse grid impacts in terms of voltage violations. Therefore, PV Hosting capacity is being used as a planning tool to determine the maximum PV installation capacity that causes the first voltage violation and above which would require infrastructure upgrades. Additionally, traditional methods of Hosting capacity analysis are scenario based and computationally complex as they rely on iterative load flow algorithms that require investigating a large number of scenarios for accurate assessment of PV impacts. Therefore, this paper presents a computationally efficient analytical approach to compute the probability distribution of voltage change due to random behavior of randomly located multiple distributed PVs. The proposed approach is based on Spatio-temporal probabilistic voltage sensitivity analysis that exploits both spatial and temporal uncertainties associated with PV injections. Thereafter, the derived distribution is used to quantify voltage violations for various PV penetration levels and subsequently determine the hosting capacity of the system without the need to examine large number of scenarios. Results of the proposed framework are validated via conventional load flow based simulation approach on the IEEE 37 and IEEE 123 node test systems.

42 ENGINEERING↗
DOE OSTI2023

Compression of tokamak boundary plasma simulation data using a maximum volume algorithm for matrix skeleton decomposition

This report demonstrates satisfactory data compression of SOLPS-ITER simulation output ranging from 2D fields, 1D profiles, and 0D scalar variables with a novel matrix decomposition approach. The singular value decomposition (SVD) scales poorly for large matrix sizes and is unsuited to the application on high dimensional data common to fusion plasma physics simulation. In this work, we employ the columns-submatrix-rows (CUR) matrix factorization technique in order to compute a low-rank approximation up to two orders of magnitude faster than the SVD, but within a nominal L2-norm relative error of ε = 10 –2 . In addition, the CUR approach maintains the original format of the data, in its extracted columns and rows, allowing for interpretable data storage at the original resolution of the simulation. We utilize an iterative algorithm to compute the CUR decomposition of simulation output by maximizing the volume, or linearly independent information content, of a low-rank submatrix contained within the data. Experiments over $\textit{n} × \textit{n}$ randomized test matrices with embedded rank-deficient features show that this maximum volume implementation of CUR matrix approximation has reduced asymptotic computational complexity on the order of n compared to the SVD, which scales approximately as $n^3$. These results show that the CUR technique can be used to effectively select time step snapshots (columns) of over 140 SOLPS-ITER output variables and the associated discretized coordinate timeseries (rows) allowing for reconstruction of the complete simulation dynamics.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗
DOE OSTI2021

Climatology of Linear Mesoscale Convective System Morphology in the United States based on Random Forests Method

This study uses machine learning methods, specifically the random forest (RF), on a radar-based mesoscale convective system (MCS) tracking dataset to classify the five types of linear MCS morphology in the contiguous United States during the period 2004-2016. The algorithm is trained using radar- and satellite-derived spatial and morphological parameters, and reanalysis environmental information from 5-26yr manually identified nonlinear and five linear MCS modes. The algorithm is then used to automate the classification of linear MCSs over 8 years with high accuracy, providing a systematic, long-term climatology of linear MCSs. Results reveal that nearly 40% of MCSs are classified as linear MCSs, in which half of the linear events belong to the type of system having a leading convective line. The occurrence of linear MCSs shows large annual and seasonal variations. On average, 113 linear MCSs occur annually during the warm season (through March to October), with most of these events clustered from May through August in the central eastern Great Plains. MCS characteristics, including duration, propagation speed, orientation, and system cloud size, have large variability among the different linear modes. The systems having a trailing convective line and the systems having a back-building area of convection typically move more slowly and have higher precipitation rate, and thus have higher potential in producing extreme rainfall and flash flooding. Analysis of the environmental conditions associated with linear MCSs show that the storm-relative flow is of most importance in determining the organization mode of linear MCSs.

Cui, Wenjun↗
DOE OSTI2021

Fast Extraction and Characterization of Fundamental Frequency Events from a Large PMU Dataset using Big Data Analytics

A novel method for fast extraction of fundamental frequency events (FFE) based on measurements of frequency and rate of change of frequency by Phasor Measurement Units (PMU) is introduced. The method is designed to work with exceptionally large historical PMU datasets. Statistical analysis was used to extract the features and train Random Forest and Catboost classifiers. The method is capable of fast extraction of FFE from a historical dataset containing measurements from hundreds of PMUs captured over multiple years. The reported accuracy of the best algorithm for classification expressed as Area Under the receiver operating Characteristic curve reaches 0.98, which was obtained in out-of-sample evaluations on 109 system-wide events over 2 years observed at 43 PMUs. Then Minimum Volume Enclosing Ellipsoid Algorithm was used to further analyze the events. 93.72% events were correctly characterized, where average duration of the event as seen by the PMU was 9.93 sec.

Baembitov, Rashid↗
DOE OSTI2020

A novel improved model for building energy consumption prediction based on model integration

Building energy consumption prediction plays an irreplaceable role in energy planning, management, and conservation. Constantly improving the performance of prediction models is the key to ensuring the efficient operation of energy systems. Moreover, accuracy is no longer the only factor in revealing model performance, it is more important to evaluate the model from multiple perspectives, considering the characteristics of engineering applications. Based on the idea of model integration, this paper proposes a novel improved integration model (stacking model) that can be used to forecast building energy consumption. The stacking model combines advantages of various base prediction algorithms and forms them into “meta-features” to ensure that the final model can observe datasets from different spatial and structural angles. Two cases are used to demonstrate practical engineering applications of the stacking model. A comparative analysis is performed to evaluate the prediction performance of the stacking model in contrast with existing well-known prediction models including Random Forest, Gradient Boosted Decision Tree, Extreme Gradient Boosting, Support Vector Machine, and K-Nearest Neighbor. The results indicate that the stacking method achieves better performance than other models, regarding accuracy (improvement of 9.5%–31.6% for Case A and 16.2%–49.4% for Case B), generalization (improvement of 6.7%–29.5% for Case A and 7.1%-34.6% for Case B), and robustness (improvement of 1.5%–34.1% for Case A and 1.8%–19.3% for Case B). The proposed model enriches the diversity of algorithm libraries of empirical models.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗
DOE OSTI2023

Dimension Reduction and Redundancy Removal through Successive Schmidt Decompositions

Quantum computers are believed to have the ability to process huge data sizes, which can be seen in machine learning applications. In these applications, the data, in general, are classical. Therefore, to process them on a quantum computer, there is a need for efficient methods that can be used to map classical data on quantum states in a concise manner. On the other hand, to verify the results of quantum computers and study quantum algorithms, we need to be able to approximate quantum operations into forms that are easier to simulate on classical computers with some errors. Motivated by these needs, in this paper, we study the approximation of matrices and vectors by using their tensor products obtained through successive Schmidt decompositions. We show that data with distributions such as uniform, Poisson, exponential, or similar to these distributions can be approximated by using only a few terms, which can be easily mapped onto quantum circuits. The examples include random data with different distributions, the Gram matrices of iris flower, handwritten digits, 20newsgroup, and labeled faces in the wild. Similarly, some quantum operations, such as quantum Fourier transform and variational quantum circuits with a small depth, may also be approximated with a few terms that are easier to simulate on classical computers. Furthermore, we show how the method can be used to simplify quantum Hamiltonians: In particular, we show the application to randomly generated transverse field Ising model Hamiltonians. The reduced Hamiltonians can be mapped into quantum circuits easily and, therefore, can be simulated more efficiently.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

Uniformly Ordered Binary Decision Algorithm for Benchmark Experiment Correlations in Whisper Validation

When performing a validation exercise for determining the upper subcritical limit of a nuclear criticality safety application, an analyst should select and perform a statistical analysis on a population of benchmark experiments that are neutronically similar to the application. The size of this population should be sufficiently large such that the statistical analysis has a high degree of confidence that the bias plus bias uncertainty (calculational margin) has been accurately quantified. A complication arises because many benchmark experiments share common components, leading to correlations in their measured effective multiplication factors. Correlations between benchmark experiments within the population reduces its predictive power. This motivates the need for methods that consider benchmark experiment correlations and ensure adequate statistical significance of results. The Whisper code is a statistical analysis pack- age that incorporates nuclear data sensitivity coefficients from MCNP to assess benchmark experiment similarity and then performs an extreme-value analysis to estimate the bias plus bias uncertainty. The original methodology in Whisper does not consider the effect of benchmark experiment correlations when making this estimation, and this summary proposes the uniformly ordered binary decision algorithm to address this shortcoming. The original methodology in Whisper computes similarity coefficients ck for an application compared to all benchmark experiments in its library and develops weighting factors for a selected population proportional to the ck values. The methodology can be interpreted as statistically emulating a validation exercise for a particular application where the weighting factors may be viewed as the likelihood that an analyst would include a particular benchmark experiment within the population. The effective sample size of the population is the expected or mean number of benchmark experiments in the population. The uniformly ordered binary decision algorithm identifies clusters of correlated benchmark experiments within the population and then computes adjusted weighting factors based on the magnitude of the correlation coefficients within the cluster to compute a reduced effective sample size accounting for the lower information content because of correlations. Benchmark experiments within the cluster are ordered randomly with equal probability and probabilistic decisions are made as to whether a benchmark. experiment within the cluster should treated as redundant with a previous one; if two redundant benchmark experiments are included, then the conservative worst case bias plus bias uncertainty is used and the pair is counted as a single benchmark experiment in the population. Results are provided for HEU solutions in a research version of the Whisper software using benchmark experiment correlations provided by DICE, the Database for the International Criticality Safety Benchmark Evaluation Project (ICSBEP). These show that there can be a significant increase in the bias plus bias uncertainty because the effective sample size is reduced, and therefore the algorithm, needing to meet sample size requirements, expands the benchmark experiment population by accepting less similar benchmark experiments that would have otherwise not been included.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
DOE OSTI2020

Winners are not keepers: Characterizing household engagement, gains, and energy patterns in demand response using machine learning in the United States

Demand-response programs can help utilities manage rapidly evolving electric grids, but these programs are subject to the complexities of human behavior. This paper explores a novel method for uncovering heterogeneity in households. In this work, we use a machine-learning method known as a Conditional Inference Tree (c-tree) algorithm to categorize households based on their energy behavior characteristics collected via smart meters, and explore how this translates through into heterogeneity in their real-world response to a DR program. Using data from randomized controlled trial, we generate estimates of the changes in energy use caused by the program within each household group. Our results show that the c-tree approach differentiates households by their energy-use characteristics in a way that increases the spread in enrollment rates and critical peak reduction among household groups, compared with the spreads achieved via several conventional segmentation methods. Thus, the c-tree analysis enables the most tailored targeting of major potential energy savers and could provide the greatest increase in cost-effectiveness of household recruitment into DR programs. Our results also offer fresh insights into the relationships between household energy behavior characteristics – such as peak energy use and “structural winningness” (the ability to save money under a DR program without changing energy-use behaviors) – and household decisions about enrolling in DR programs and reducing energy use. Our research also demonstrates the potential of smart meter data, combined with machine learning and econometric methods, to provide significant value to utilities, program implementers, researchers, and other stakeholders.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗
DOE OSTI2022

Measuring representative volume elements from high-resolution grain-scale strain fields

Most crystalline materials present a highly heterogeneous response at the microscale, which can be affected by both internal factors (such as microstructural parameters) and external factors (such as loading). Relating microscale inhomogeneities to the macroscale response of a material requires the use of homogenisation techniques, usually based on the concept of a representative volume element (RVE)—the smallest volume of material that represents the global average response. Here, in this work, we present a new and robust experimental method of measuring the size of a strain-based RVE from high-resolution grain-scale strain fields obtained using digital image correlation (DIC). The proposed method is based on the statistical (stereological) nature of the RVE, which has been widely adopted in numerical studies, and involves dividing a strain field into randomly selected regions of varying sizes and statistically analysing the distributions of average strains within them. To validate the new method, we generate a large number of synthetic strain fields from a fractional Gaussian noise algorithm. The proposed stereological method is shown to be capable of producing reliable RVE measurements from a very large range of possible microscale strain fields while at the same time being robust in that it can produce RVE measurement results even in cases where other existing methods may be unable to do so. The proposed method has a low field-of-view requirement, only needing a field-of-view about 1.2 times as large as the RVE to produce reliable measurements. In addition, the stereological method offers significant flexibility since its statistical nature allows for control over how strict the RVE measurement should be in each case.

36 MATERIALS SCIENCE↗
DOE OSTI2013

Hierarchical probing for estimating the trace of the matrix inverse on toroidal lattices

The standard approach for computing the trace of the inverse of a very large, sparse matrix $A$ is to view the trace as the mean value of matrix quadratures, and use the Monte Carlo algorithm to estimate it. This approach is heavily used in our motivating application of Lattice QCD. Often, the elements of $A^{-1}$ display certain decay properties away from the non zero structure of $A$, but random vectors cannot exploit this induced structure of $A^{-1}$. Probing is a technique that, given a sparsity pattern of $A$, discovers elements of $A$ through matrix-vector multiplications with specially designed vectors. In the case of $A^{-1}$, the pattern is obtained by distance-$k$ coloring of the graph of $A$. For sufficiently large $k$, the method produces accurate trace estimates but the cost of producing the colorings becomes prohibitively expensive. More importantly, it is difficult to search for an optimal $k$ value, since none of the work for prior choices of $k$ can be reused.

Stathopoulos, Andreas↗
DOE OSTI2019

Pileup Calculations for GADRAS

This report describes how random pileup calculations are performed by the Gamma Detector Response and Analysis Software (GADRAS) Version 19.1. The computational approach and examples are presented for gamma-ray detectors with and without pileup rejectors. This pileup algorithm executes more quickly and the results are more accurate than previous versions of GADRAS. The detector response function can be refined to characterize distortions in peak shapes that occur at high-count rates. The empirical refinement can also be applied to describe the response of partially-effective pileup rejectors. Implications are discussed for the analysis of both static measurements and dynamic collections of the type acquired with radiation portals. ACKNOWLEDGEMENTS This work was funded by the Defense Threat Reduction Agency (DTRA) and the Department of Homeland Security (DHS) Counter Weapons of Mass Destruction (CWMD) office.

98 NUCLEAR DISARMAMENT, SAFEGUARDS, AND PHYSICAL P↗
DOE OSTI2025

Efficient Floating-Point Arithmetic on Fault-Tolerant Quantum Computers

We propose a novel floating-point encoding scheme that builds on prior work involving fixed-point encodings. We encode floating-point numbers using Two's Complement fixed-point mantissas and Two's Complement integral exponents. We used our proposed approach to develop quantum algorithms for fundamental arithmetic operations, such as bit-shifting, reciprocation, multiplication, and addition. We prototyped and investigated the performance of the floating-point encoding scheme on quantum computer simulations by performing reciprocation on randomly drawn inputs and by solving first-order ordinary differential equations, while varying the number of qubits in the encoding. We observed rapid convergence to the exact solutions as we increased the number of qubits and a significant reduction in the number of ancilla qubits required for reciprocation when compared with similar approaches.

Serrallés, José Cruz [Weill Cornell Med. Coll.]↗
DOE OSTI2017

Fast optimization algorithms and the cosmological constant

Denef and Douglas have observed that in certain landscape models the problem of finding small values of the cosmological constant is a large instance of a problem that is hard for the complexity class NP (Nondeterministic Polynomial-time). The number of elementary operations (quantum gates) needed to solve this problem by brute force search exceeds the estimated computational capacity of the observable Universe. Here in this paper, we describe a way out of this puzzling circumstance: despite being NP-hard, the problem of finding a small cosmological constant can be attacked by more sophisticated algorithms whose performance vastly exceeds brute force search. In fact, in some parameter regimes the average-case complexity is polynomial. We demonstrate this by explicitly finding a cosmological constant of order 10 -120 in a randomly generated 10 9 -dimensional Arkani-Hamed–Dimopoulos–Kachru landscape.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2020

Grid-based diffusion Monte Carlo for fermions without the fixed-node approximation

A diffusion Monte Carlo algorithm is introduced that can determine the correct nodal structure of the wave function of a few-fermion system and its ground-state energy without an uncontrolled bias. This is achieved by confining signed random walkers to the points of a uniform infinite spatial grid, allowing them to meet and annihilate one another to establish the nodal structure without the fixed-node approximation. An imaginary-time propagator is derived rigorously from a discretized Hamiltonian, governing a non-Gaussian, sign-flipping, branching, and mutually annihilating random walk of particles. The accuracy of the resulting stochastic representations of a fermion wave function is limited only by the grid and imaginary-time resolutions and can be improved in a controlled manner. Here, the method is tested for a series of model problems including fermions in a harmonic trap as well as the He atom in its singlet or triplet ground state. For the latter case, the energies approach from above with increasing grid resolution and converge within 0.015 E h of the exact basis-set-limit value for the grid spacing of 0.08 a.u. with a statistical uncertainty of 10 –5 E h without an importance sampling or Jastrow factor.

74 ATOMIC AND MOLECULAR PHYSICS↗
DOE OSTI2016

Dynamic Virtual Chunks: On Supporting Efficient Accesses to Compressed Scientific Data

Data compression could ameliorate the I/O pressure of data-intensive scientific applications. Unfortunately, the conventional wisdom of naively applying data compression to the file or block brings the dilemma between efficient random accesses and high compression ratios. File-level compression barely supports efficient random accesses to the compressed data: any retrieval request need trigger the decompression from the beginning of the compressed file. Block-level compression provides flexible random accesses to the compressed blocks, but introduces extra overhead when applying the compressor to each and every block that results in a degraded overall compression ratio. This paper extends our prior work that introduces virtual chunks offering efficient random accesses to the compressed scientific data without sacrificing the compression ratio. Virtual chunks are logical blocks pointed at by appended references without breaking the physical continuity of the file content. These references allow the decompression to start from an arbitrary position (efficient random accesses), while no per-block overhead is introduced because the file’s physical entirety is retained (high compression ratio). One limitation of virtual chunk is it only supports static references. This paper presents the algorithms, analysis, and evaluations of dynamic virtual chunks to deal with the cases where the references are updated dynamically.

I/O compression performance optimization↗
DOE OSTI2014

SU-E-J-83: Ion Imaging to Better Estimate In-Vivo Relative Stopping Powers Using X-Ray CT Prior-Knowledge Information

Purpose: To reduce uncertainties in relative stopping power (RSP) estimates for ions (alpha and carbon) by using Ion radiographic-imaging and X-ray CT prior-knowledge. Methods: A 36×36 phantom matrix composed of 9 materials with different thicknesses and randomly placed is generated. Theoretical RSPs are calculated using stopping power (SP) data from three references (Janni, ICRU49 and Bischel). We introduced an artificial systematic error (1.5%, 2.5% or 3.5%) and a random error (<0.5%) to the SP to simulated patient ion-range errors present in clinic environment. Carbon/alpha final energy for each RSPs set (theoretical and from CT images) is obtained with a ray-tracing algorithm. A gradient descent (GD) method is used to minimize the difference in exit particle energy, between theory and X-ray CT RSP maps, by iteratively correcting the RSP map from X-ray CT. Once a new set of RSPs is obtained for a direction a new optimization is done over other direction using the RSPs from the previous optimization. Theoretical RSPs are compared with experimental RSPs obtained with Gammex Phantom. Results: Preliminary results show that optimized RSP values can be obtained with smaller uncertainties (<1%) than clinical RSPs (1.5% to 3.5%). Theoretical values from three different references show uncertainties, up to 3% from experimental values. Further investigation will consider prior-knowledge from RSP obtained with CT images and ion radiographies from Monte Carlo Simulations. Conclusion: GD and ray-tracing methods have been implemented to reduce RSP uncertainties from values obtained for clinical treatment. Experimental RSPs will be obtained using carbon/alpha beams to consider the existence of material dependent systematic errors. Based on the results, it is hoped to show that using ray-tracing optimization with ion radiography and prior knowledge on RPSs, treatment planning accuracy and cost-effectiveness can be improved.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗
DOE OSTI2012

Data-Intensive Memory-Map simulator and runtime

DI-MMAP is a simulator for modeling the performance of next generation non-volatile random access memory technologies (NVRAM) and a high-perfromance memory-map runtime for the Linux operating system. It is implemented as a device driver for the Linux operating system. It will be used by algorithm designers to unserstand the impact of future NVRAM on their algorithms and will be used by application developers for high-performance access to NVRAM storage.

Essen, B.B.↗
DOE OSTI2019

WSBP/NWBP small-world neural network and its performance for wind power forecasting

A small-world neural network has stronger generalization ability with high transfer efficiency than that of the regular neural networks. This paper presents two novel small-world neural networks, the Watts-Strogatz small-world based on a BP neural network (WSBP) and a Newman-Watts small-world neural network based on a BP neural network (NWBP), related to previous research of complex networks. The algorithms are developed separately by adopting WS and NW small-world networks as their topological structures, and their derivation and convergence criterion are progressively discussed. After that, the proposed models are subsequently tested by two typical nonlinear functions which confirm their significant improvement over the regular BP networks and other algorithms. Finally, a wind power prediction system is advanced to verify their generalization abilities, and show that the models are practically feasible and effective with improved accuracy and acceptable forecasting errors caused by wind fluctuation and randomness with a time scale up to 24 h.

17 WIND ENERGY↗