Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “randomization”

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 163 records · Page 9
All sourcesNASA NTRSDOE OSTI
DOE OSTI2023

The Random Ray Method Versus Multigroup Monte Carlo: The Method of Characteristics in OpenMC and SCONE

The Random Ray Method (TRRM) is a recently developed approach to solving neutral particle transport problems based on the Method of Characteristics. While the method previously has been implemented only in closed-source or limited-functionality codes, this work describes its implementation in two open-source Monte Carlo codes: OpenMC and SCONE. The random ray implementations required small modifications to the existing Multigroup Monte Carlo (MGMC) solvers, offering a rare venue for redundant, fine-grained, "apples-to-apples" speed and accuracy comparisons between transport methods. To this end, TRRM and MGMC solvers are evaluated against each other using each code's native capabilities on reactor eigenvalue problems with different degrees of energy discretization. On the C5G7 benchmark (featuring only seven energy groups), TRRM achieves a maximum pin power error comparable to or lower than that of MGMC for a given run time. On a problem with 69 energy groups, MGMC is found to scale more efficiently, obtaining a lower pin power error for a given run time. However, the defining difference between the two transport methods is found to be their vastly different uncertainty distributions. Specifically, TRRM is found to maintain similar levels of accuracy and uncertainty throughout the simulation domain whereas MGMC can exhibit orders-of-magnitude greater errors in areas of the problem that feature low neutron flux. For instance, TRRM provided an up to 373 times speed advantage compared with MGMC for computing the flux in low-flux regions in the moderator surrounding the C5G7 core.

42 ENGINEERING↗
DOE OSTI2024

Magnetic tunnel junction random number generators applied to dynamically tuned probability trees driven by spin orbit torque

Abstract Perpendicular magnetic tunnel junction (pMTJ)-based true-random number generators (RNGs) can consume orders of magnitude less energy per bit than CMOS pseudo-RNGs. Here, we numerically investigate with a macrospin Landau–Lifshitz-Gilbert equation solver the use of pMTJs driven by spin–orbit torque to directly sample numbers from arbitrary probability distributions with the help of a tunable probability tree. The tree operates by dynamically biasing sequences of pMTJ relaxation events, called ‘coinflips’, via an additional applied spin-transfer-torque current. Specifically, using a single, ideal pMTJ device we successfully draw integer samples on the interval [0, 255] from an exponential distribution based on p -value distribution analysis. In order to investigate device-to-device variations, the thermal stability of the pMTJs are varied based on manufactured device data. It is found that while repeatedly using a varied device inhibits ability to recover the probability distribution, the device variations average out when considering the entire set of devices as a ‘bucket’ to agnostically draw random numbers from. Further, it is noted that the device variations most significantly impact the highest level of the probability tree, with diminishing errors at lower levels. The devices are then used to draw both uniformly and exponentially distributed numbers for the Monte Carlo computation of a problem from particle transport, showing excellent data fit with the analytical solution. Finally, the devices are benchmarked against CMOS and memristor RNGs, showing faster bit generation and significantly lower energy use.

77 NANOSCIENCE AND NANOTECHNOLOGY↗
DOE OSTI2022

Predicting resistive wall mode stability in NSTX through balanced random forests and counterfactual explanations

Abstract Recent progress in the disruption event characterization and forecasting framework has shown that machine learning guided by physics theory can be easily implemented as a supporting tool for fast computations of ideal stability properties of spherical tokamak plasmas. In order to extend that idea, a customized random forest (RF) classifier that takes into account imbalances in the training data is hereby employed to predict resistive wall mode (RWM) stability for a set of high beta discharges from the NSTX spherical tokamak. More specifically, with this approach each tree in the forest is trained on samples that are balanced via a user-defined over/under-sampler. The proposed approach outperforms classical cost-sensitive methods for the problem at hand, in particular when used in conjunction with a random under-sampler, while also resulting in a threefold reduction in the training time. In order to further understand the model’s decisions, a diverse set of counterfactual explanations based on determinantal point processes (DPP) is generated and evaluated. Via the use of DPP, the underlying RF model infers that the presence of hypothetical magnetohydrodynamic activity would have prevented the RWM from concurrently going unstable, which is a counterfactual that is indeed expected by prior physics knowledge. Given that this result emerges from the data-driven RF classifier and the use of counterfactuals without hand-crafted embedding of prior physics intuition, it motivates the usage of counterfactuals to simulate real-time control by generating the β N levels that would have kept the RWM stable for a set of unstable discharges.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗
DOE OSTI2022

Differentially Private Synthesis and Sharing of Network Data Via Bayesian Exponential Random Graph Models

Abstract Network data often contain sensitive relational information. One approach to protecting sensitive information while offering flexibility for network analysis is to share synthesized networks based on the information in originally observed networks. We employ differential privacy (DP) and exponential random graph models (ERGMs) and propose the DP-ERGM method to synthesize network data. We apply DP-ERGM to two real-world networks. We then compare the utility of synthesized networks generated by DP-ERGM, the DyadWise Randomized Response (DWRR) approach, and the Synthesis through Conditional distribution of Edge given nodal Attribute (SCEA) approach. In general, the results suggest that DP-ERGM preserves the original information significantly better than two other approaches in network structural statistics and inference for ERGMs and latent space models. Furthermore, DP-ERGM satisfies node DP through modeling the global network structure with ERGM, a stronger notion of privacy than the edge DP under which DWRR and SCEA operate.

graph synthesis↗
DOE OSTI2020

Experimental demonstration and analysis of random field effects in ferromagnet/antiferromagnet bilayers

More than 30 years ago, Malozemoff [Phys. Rev. B 35, 3679 (1987)] hypothesized that exchange interaction at the interface between a ferromagnet (F) and an antiferromagnet (AF) can act as an effective random field, which can profoundly affect the magnetic properties of the system. However, until now this hypothesis has not been directly experimentally tested. We utilize magnetoelectronic measurements to analyze the effective exchange fields at permalloy/CoO interface. Our results cannot be explained in terms of quasiuniform effective exchange fields but are in agreement with the random-field hypothesis of Malozemoff. Finally, the presented approach opens a new route for the quantitative analysis of effective exchange fields and anisotropies in magnetic heterostructures for memory, sensing and computing applications.

36 MATERIALS SCIENCE↗
DOE OSTI2024

Slow thermalization and subdiffusion in $U$(1) conserving Floquet random circuits

Random quantum circuits are paradigmatic models of minimally structured and analytically tractable chaotic dynamics. We study a family of Floquet unitary circuits with Haar random U(1) charge conserving dynamics; the minimal such model has nearest-neighbor gates acting on spin-1/2 qubits, and a single layer of even/odd gates repeated periodically in time. We find that this minimal model is not robustly thermalizing at numerically accessible system sizes, and displays slow subdiffusive dynamics for long times. We map out the thermalization dynamics in a broader parameter space of charge conserving circuits, and understand the origin of the slow dynamics in terms of proximate localized and integrable regimes in parameter space. In contrast, we find that small extensions to the minimal model are sufficient to achieve robust thermalization; these include (i) increasing the interaction range to three-site gates, (ii) increasing the local Hilbert space dimension by appending an additional unconstrained qubit to the conserved charge on each site, or (iii) using a larger Floquet period comprised of two independent layers of gates. Furthermore, our results should inform future studies of charge conserving circuits, which are relevant for a wide range of topical theoretical questions.

1-dimensional spin chains↗
DOE OSTI2021

Odd Diffusivity of Chiral Random Motion

Diffusive transport is characterized by a diffusivity tensor which may, in general, contain both a symmetric and an antisymmetric component. Although the latter is often neglected, we derive Green-Kubo relations showing it to be a general characteristic of random motion breaking time-reversal and parity symmetries, as encountered in chiral active matter. In analogy with the odd viscosity appearing in chiral active fluids, we term this component the odd diffusivity. Furthermore, we show how odd diffusivity emerges in a chiral random walk model, and demonstrate the applicability of the Green-Kubo relations through molecular dynamics simulations of a passive tracer particle diffusing in a chiral active bath.

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

A Randomization-Based, Zero-Trust Cyberattack Detection Method for Hierarchical Systems

This paper demonstrates a novel randomization-based approach for verifying power system control signals with application to detecting cyberattacks. We consider fully connected hierarchical systems containing multiple local agents and a global "trust" agent. The global agent uses a time-varying randomized assignment scheme to identify corrupt network links based on principles of zero trust and majority rule. To evaluate the performance of this detection approach, we implement our algorithm in MATLAB and run it against nearly 43 million unique attack scenarios spanning a range of system sizes. For each scenario, the algorithm determines whether the identified corruptions satisfy a set of validity constraints reflecting network topology and uses that result to say whether the recovered state value for one or more local agents is malicious. We compare the algorithm's determination to the true state of the system to assess performance and find that classification accuracy converges to 100% as system size increases, suggesting that the validity constraints become more difficult to satisfy for larger systems. We further explore the scenarios that evade detection to understand practical implications for employing this detection approach.

cybersecurity↗
DOE OSTI2023

Machine Learning Based Resilience Testing of an Address Randomization Cyber Defense

Moving target defenses (MTDs) are widely used as an active defense strategy for thwarting cyberattacks on cyber-physical systems by increasing diversity of software and network paths. Recently, machine Learning (ML) and deep Learning (DL) models have been demonstrated to defeat some of the cyber defenses by learning attack detection patterns and defense strategies. It raises concerns about the susceptibility of MTD to ML and DL methods. Here, in this article, we analyze the effectiveness of ML and DL models when it comes to deciphering MTD methods and ultimately evade MTD-based protections in real-time systems. Specifically, we consider a MTD algorithm that periodically randomizes address assignments within the MIL-STD-1553 protocol—a military standard serial data bus. Two ML and DL-based tasks are performed on MIL-STD-1553 protocol to measure the effectiveness of the learning models in deciphering the MTD algorithm: 1) determining whether there is an address assignments change i.e., whether the given system employs a MTD protocol and if it does 2) predicting the future address assignments. The supervised learning models (random forest and k-nearest neighbors) effectively detected the address assignment changes and classified whether the given system is equipped with a specified MTD protocol. On the other hand, the unsupervised learning model (K-means) was significantly less effective. The DL model (long short-term memory) was able to predict the future addresses with varied effectiveness based on MTD algorithm's settings.

45 MILITARY TECHNOLOGY, WEAPONRY, AND NATIONAL DEF↗
DOE OSTI2022

PlasmidHostFinder: Prediction of Plasmid Hosts Using Random Forest

Plasmids play a major role facilitating the spread of antimicrobial resistance between bacteria. Understanding the host range and dissemination trajectories of plasmids is critical for surveillance and prevention of antimicrobial resistance. Identification of plasmid host ranges could be improved using automated pattern detection methods compared to homology-based methods due to the diversity and genetic plasticity of plasmids. In this study, we developed a method for predicting the host range of plasmids using machine learning—specifically, random forests. We trained the models with 8,519 plasmids from 359 different bacterial species per taxonomic level; the models achieved Matthews correlation coefficients of 0.662 and 0.867 at the species and order levels, respectively. Our results suggest that despite the diverse nature and genetic plasticity of plasmids, our random forest model can accurately distinguish between plasmid hosts. This tool is available online through the Center for Genomic Epidemiology (https://cge.cbs.dtu.dk/services/PlasmidHostFinder/).

59 BASIC BIOLOGICAL SCIENCES↗
DOE OSTI2020

Hypergraph Random Walks, Laplacians, and Clustering

We propose a flexible framework for clustering hypergraph-structured data based on recently proposed random walks utilizing edge-dependent vertex weights. When incorporating edge-dependent vertex weights (EDVW), a weight is associated with each vertex-hyperedge pair, yielding a weighted incidence matrix of the hypergraph. Such weightings have been utilized in term-document representations of text data sets. We explain how random walks with EDVW serve to construct different hypergraph Laplacian matrices, and then develop a suite of clustering methods that use these incidence matrices and Laplacians for hypergraph clustering. Using 20Newsgroup, U.S. patent, Reuters' Corpus Volume 1, and genetics data sets, we compare the performance of these clustering algorithms experimentally against a variety of existing hypergraph clustering methods. We show that the proposed methods produce higher-quality clusters.

hypergraphs, clustering, laplacian, random walk, M↗
DOE OSTI2020

Single-frame far-field diffractive imaging with randomized illumination

Contains a transmission ptychography dataset collected from a chrome on glass Siemens star under optical illumination. The probe is generated by a randomized zone plate under illumination from a spatially filtered green laser. A single diffraction pattern was removed from the dataset and reported in a separate cxi file. In addition, a single exposure collected after manually defocusing the probe is reported. The ptychography dataset is used for calibration of the probe function, and the remaining diffraction patterns can be reconstructed via randomized probe imaging.

Ptychography, Randomized Probe Imaging↗
DOE OSTI2020

Single-frame far-field diffractive imaging with randomized illumination

Contains two transmission ptychography datasets, one collected from a Siemens star, and the second from an Fe/Gd multilayer. Both samples are under illumination from the same randomized zone plate. Each dataset has a single diffraction pattern removed, and these patterns are reported in a separate cxi file. Either ptychography dataset can be used for calibration of the probe function, and the remaining diffraction patterns can be reconstructed via randomized probe imaging.

BESSY II↗
DOE OSTI2021

"Spectrally gapped" random walks on networks: a Mean First Passage Time formula

We derive an approximate but explicit formula for the Mean First Passage Time of a random walker between a source and a target node of a directed and weighted network. The formula does not require any matrix inversion, and it takes as only input the transition probabilities into the target node. It is derived from the calculation of the average resolvent of a deformed ensemble of random sub-stochastic matrices H=\langle H\rangle +\delta H H = ⟨ H ⟩ + δ H , with \langle H\rangle ⟨ H ⟩ rank- 1 1 and non-negative. The accuracy of the formula depends on the spectral gap of the reduced transition matrix, and it is tested numerically on several instances of (weighted) networks away from the high sparsity regime, with an excellent agreement.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

Photoionization of Atomic Systems Using the Random-Phase Approximation Including Relativistic Interactions

Approximation methods are unavoidable in solving a many-electron problem. One of the most successful approximations is the random-phase approximation (RPA). Miron Amusia showed that it can be used successfully to describe atomic photoionization processes of many-electron atomic systems. In this article, the historical reasons behind the term “random-phase approximation” are revisited. A brief introduction to the relativistic RPA (RRPA) developed by Walter Johnson and colleagues is provided and some of its illustrative applications are presented.

74 ATOMIC AND MOLECULAR PHYSICS↗
DOE OSTI2023

Unbalanced Nested Random Effects Estimation of Variance Components

To investigate the contributing factors of variance in the measurement of an iodine 127 (127I) sample, we implement a nested random effects analysis of variance (ANOVA). Historically, the reported uncertainty on a measurement of 127I has been obtained by methods of forward uncertainty propagation because there is typically only one replicate of a given sample for which to estimate the uncertainty. When samples are processed there are several types of quality control (QC) standards analyzed along-side the unknown samples with two to five replicates for each. Assuming the variance observed in these replicate QC standards is representative of that of the unknown samples, we use these data in a nested random effects ANOVA to estimate the total uncertainty of a measurement. We demonstrate this approach with two sets of measurements from Idaho National Laboratory and compare the results with the forward uncertainty propagation approach. Variance component estimates for the coarsest level of the nesting structure were most imprecise because replicates were most limited at these levels. We find that the results largely agree between forward propagation and ANOVA, and the greatest contributors of variance are due to instrument variation and chemical processing, with human processing being among the smallest contributors. This analysis provides reassurance that the reported uncertainties using forward propagation are reasonable and the process is well controlled. We propose a future designed experiment to increase replicates at the coarsest level of the hierarchy to improve estimates of these variance components.

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

Comparative Analysis of Radial and Random Microstructures of Mesophase Pitch Carbon Fibers

Carbon fibers (CF) with radial and random microstructures are produced. Here, these fibers are subjected to identical treatment before being mechanically tested and analyzed with Weibull analysis, with the results revealing a statistically significant difference in tensile strengths of 2.23 GPa for random CF and 1.69 GPa for radial CF. Raman mapping probed the crystalline structure perpendicular to the fiber axis and found a uniform structure, while wide‐angle X‐ray diffraction showed a significant difference of 7.5 Å in the crystallites’ basal lengths parallel to the fiber. Small‐angle X‐ray scattering is completed parallel to the fiber for the first time. A cross‐section Guinier plot of the 1D azimuthal integration is generated assuming symmetric scattering, and the parallel scatterers are found to have a similar length scale to the crystallite's length, validating the testing method. Finally, transmission electron microscopy is completed on the longitudinal cross‐section of each fiber. The radial carbon fiber is found to have a core–shell structure, as evidenced further by fast Fourier transform images. Through all studies, it is shown that the structure developed during mesophase pitch spinning altered the microstructure, thus impacting the mechanical properties, confirming a direct relationship between processing, structure, and properties.

Scherschel, Alexander [Univ. of Virginia, Charlott↗
DOE OSTI2020

Random Polymerization Strategy Leads to a Family of Donor Polymers Enabling Well‐Controlled Morphology and Multiple Cases of High‐Performance Organic Solar Cells

Abstract Developing high‐performance donor polymers is important for nonfullerene organic solar cells (NF‐OSCs), as state‐of‐the‐art nonfullerene acceptors can only perform well if they are coupled with a matching donor with suitable energy levels. However, there are very limited choices of donor polymers for NF‐OSCs, and the most commonly used ones are polymers named PM6 and PM7, which suffer from several problems. First, the performance of these polymers (particularly PM7) relies on precise control of their molecular weights. Also, their optimal morphology is extremely sensitive to any structural modification. In this work, a family of donor polymers is developed based on a random polymerization strategy. These polymers can achieve well‐controlled morphology and high‐performance with a variety of chemical structures and molecular weights. The polymer donors are D–A1–D–A2‐type random copolymers in which the D and A1 units are monomers originating from PM6 or PM7, while the A2 unit comprises an electron‐deficient core flanked by two thiophene rings with branched alkyl chains. Consequently, multiple cases of highly efficient NF‐OSCs are achieved with efficiencies between 16.0% and 17.1%. As the electron‐deficient cores can be changed to many other structural units, the strategy can easily expand the choices of high‐performance donor polymers for NF‐OSCs.

Liang, Jiaen↗