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 361 records · Page 20
All sourcesNASA NTRSDOE OSTI
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↗
NASA NTRS2008

Random Test Run Length and Effectiveness

A poorly understood but important factor in many applications of random testing is the selection of a maximum length for test runs. Given a limited time for testing, it is seldom clear whether executing a small number of long runs or a large number of short runs maximizes utility. It is generally expected that longer runs are more likely to expose failures -- which is certainly true with respect to runs shorter than the shortest failing trace. However, longer runs produce longer failing traces, requiring more effort from humans in debugging or more resources for automated minimization. In testing with feedback, increasing ranges for parameters may also cause the probability of failure to decrease in longer runs. We show that the choice of test length dramatically impacts the effectiveness of random testing, and that the patterns observed in simple models and predicted by analysis are useful in understanding effects observed.

software testing↗
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↗
DOE OSTI2023

Formation of Amorphous Carbon Multi‐Walled Nanotubes from Random Initial Configurations

Amorphous carbon nanotubes (a‐CNT) with up to four walls and sizes ranging from 200 to 3200 atoms have been simulated, starting from initial random configurations and using the Gaussian Approximation Potential. The important variables (like density, height, and diameter) required to successfully simulate a‐CNTs were predicted with the machine learning random forest technique. The width of the a‐CNT models ranged between 0.55–2 nm with an average inter‐wall spacing of 0.31 nm. The topological defects in a‐CNTs were analyzed and new defect configurations were observed. The electronic density of states and localization in these phases were discussed and delocalized electrons in the π subspace were identified as an important factor for inter‐layer cohesion. Spatial projection of the electronic conductivity favors axial transport along connecting hexagons, while non‐hexagonal parts of the network either hinder or bifurcate the electronic transport. A vibrational density of states was calculated and is potentially an experimentally comparable fingerprint of the material. The appearance of a low‐frequency radial breathing mode was discussed and the thermal conductivity at 300 K was estimated using the Green‐Kubo formula.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2021

AdS 3 gravity and random CFT

We compute the path integral of three-dimensional gravity with negative cosmological constant on spaces which are topologically a torus times an interval. These are Euclidean wormholes, which smoothly interpolate between two asymptotically Euclidean AdS 3 regions with torus boundary. From our results we obtain the spectral correlations between BTZ black hole microstates near threshold, as well as extract the spectral form factor at fixed momentum, which has linear growth in time with small fluctuations around it. The low-energy limit of these correlations is precisely that of a double-scaled random matrix ensemble with Virasoro symmetry. Our findings suggest that if pure three-dimensional gravity has a holographic dual, then the dual is an ensemble which generalizes random matrix theory.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2026

Memory-efficient nonsmooth dynamic optimization using adaptive randomized compression

Dynamic optimization problems arise in many applications including flow control, full waveform inversion, and medical imaging. These problems are plagued by significant computational challenges. One such challenge — and the focus of this work — is the memory limitation induced by the size of the underlying dynamical system. In particular, the entire dynamic trajectory is required for derivative computation and therefore must be stored or recomputed using, e.g., checkpointing. Although recent work demonstrated the use of adaptive randomized sketching to overcome the memory challenge, that work only applies to smooth unconstrained problems, prohibiting its use for nonsmooth regularized and constrained problems. The inclusion of nonsmooth regularizers and constraints is critical as they often arise in an attempt to preserve certain physical properties or to promote sparsity. To solve these problems, we introduce a trust-region algorithm for minimizing the sum of a smooth nonconvex function and a nonsmooth convex function that leverages randomized sketching to compress the dynamical system trajectories and adaptively adjust the sketch rank to satisfy a gradient inexactness condition. We prove convergence of this algorithm and demonstrate that it achieves substantial memory reduction on three discretized PDE-constrained optimization applications.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

Delocalization of a non-Hermitian quantum walk on random media in one dimension

Highlights: • We study the localization-delocalization transition of a non-Hermitian quantum walk. • We find that the phase transition is similar to the one in the Hatano-Nelson model. • All eigenvectors get extended and all eigenvalues become complex at the transition. • This implies that the localization lengths of all eigenvectors are the same. We first review the localization–delocalization transition of a non-Hermitian random tight-binding Anderson model, called the Hatano–Nelson model. We then report a new result for a non-Hermitian extension of a discrete-time quantum walk on a one-dimensional random medium; we numerically find a delocalization transition similar to one of the Hatano–Nelson model. As a common feature to both models, at the transition point, an eigenvector gets delocalized and at the same time the corresponding energy eigenvalue (for the latter quantum-walk model, the imaginary unit times the phase of the eigenvalue of the time-evolution operator) becomes complex. One of the unique properties of the present non-Hermitian quantum walk is that the localization length of all eigenvectors is the same, and thereby all eigenstates simultaneously undergo the delocalization transition and all energy eigenvalues become complex at the same time when we turn up a non-Hermitian parameter.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2024

Chemical randomness, lattice distortion and the wide distributions in the atomic level properties in high entropy alloys

High entropy alloys (HEAs) consist of multiple elements present in large proportions that are randomly distributed on a crystal lattice. On the one hand, the presence of multiple elements engenders wide ranges of atomic radii, electronegativities, electron valences and magnetic moments, whereas on the other, the presence of chemical randomness creates unique nearest neighbor environments among the lattice sites. As a result, the symmetry of the energy landscape is broken essentially at each lattice site thereby resulting in highly distorted energy landscapes. At the atomistic level, the lattice distortion has been widely observed in the form of varying bond lengths. At the electronic level, a range of charge transfers result in the charge density distortion. Collectively, the distorted landscapes cause large quantitative variations of the atomic level properties; in this review, we highlight the effect of lattice distortion on point defect energetics, stacking fault energies, and dislocation mobility. Besides the well- known large HEAs phase space, the enormity of the distorted energy landscape that scales with the atomic configurations is a new consideration; understanding this coupling between composition, lattice distortion and properties’ variations thus becomes an exciting but challenging area within the field of HEAs. Furthermore, this coupling is expected to open a new door for materials design, where the materials properties could be tuned via leveraging the lattice distortion, which is essentially absent in dilute/ordered alloys.

36 MATERIALS SCIENCE↗
DOE OSTI2022

Impact of Dose-Escalated Chemoradiation on Quality of Life in Patients With Locally Advanced Rectal Cancer: 2-Year Follow-Up of the Randomized RECTAL-BOOST Trial

Dose-escalated chemoradiation (CRT) for locally advanced rectal cancer did not result in higher complete response rates but initiated more tumor regression in the randomized RECTAL-BOOST trial (Clinicaltrials.gov NCT01951521). This study compared patient reported outcomes between patients who received dose-escalated CRT (5 × 3 gray boost + CRT) or standard CRT for 2 years after randomization.

62 RADIOLOGY AND NUCLEAR MEDICINE↗