Search NASA⌕ Search

SEARCH · Search NASA

Results for “Multiples of uniform random distribution”

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.

8 records
All sourcesNASA NTRSDOE OSTI
DOE OSTI2022

Reconstructing parent microstructures in martensitic and pearlitic Ti-Cu

Evaluating the microstructural evolution of parent phases has long been a challenge in metals with a partial or complete solid state transformation. Most parent microstructure evolution has to be inferred from the product microstructure, with some information permanently lost. Parent microstructure reconstructions relying on orientation relationships and EBSD data are a useful tool to overcome this challenge, though much background knowledge is required to do so. Here, this work introduces a reconstruction process for a eutectoid composition Ti-Cu binary alloy to evaluate the high temperature β-Ti phase from martensitic and pearlitic product microstructures. Martensitic microstructures were accurately reconstructed, enabling elucidation of β-Ti grain size and texture, and the employed script included for scientific reference. Pearlitic microstructures did not reconstruct effectively with the current process. However, new insight into the interfacial crystallographic orientations of pearlitic Ti-Cu microstructures was gleaned via this analysis, and future investigations of interest are discussed accordingly. Ultimately, these findings demonstrate tools widely implemented on conventional titanium and ferrous alloys can also be applied to understand parent microstructures in Ti-Cu and other alloys of emerging interest. This is especially of use as new manufacturing processes for such materials require understanding how parent phase microstructures respond to new, novel material processing such as AM.

36 MATERIALS SCIENCE↗
DOE OSTI2021

Application of the locally self-consistent embedding approach to the Anderson model with non-uniform random distributions

Highlights: • Typical Medium Theory (TMT) for the Anderson Localization. • Locally Self-Consistent Multiple Scattering Method (LSMS) for Random Disordered Systems. • Linear Scaling Computational Method for Random Disordered Systems. We apply the recently developed embedding scheme for the locally self-consistent method to random disorder electrons systems. The method is based on the locally self-consistent multiple scattering theory and the typical medium theory. The locally self-consistent multiple scattering theory divides a system into many small designated local interaction zones. The subsystem within each local interaction zone is embedded in a self-consistent field from the typical medium theory. This approximation allows the study of random systems with large numbers of sites. We present results for the three dimensional Anderson model with different random disorder potential distributions. Using the typical density of states as an indicator of Anderson localization, we find that the method can capture the localization for commonly studied disorder potentials. These include the uniform distribution, the Gaussian distribution, and even the unbounded Cauchy distribution.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2021

Fast GPU-Based Generation of Large Graph Networks From Degree Distributions

Synthetically generated, large graph networks serve as useful proxies to real-world networks for many graph-based applications. The ability to generate such networks helps overcome several limitations of real-world networks regarding their number, availability, and access. Here, we present the design, implementation, and performance study of a novel network generator that can produce very large graph networks conforming to any desired degree distribution. The generator is designed and implemented for efficient execution on modern graphics processing units (GPUs). Given an array of desired vertex degrees and number of vertices for each desired degree, our algorithm generates the edges of a random graph that satisfies the input degree distribution. Multiple runtime variants are implemented and tested: 1) a uniform static work assignment using a fixed thread launch scheme, 2) a load-balanced static work assignment also with fixed thread launch but with cost-aware task-to-thread mapping, and 3) a dynamic scheme with multiple GPU kernels asynchronously launched from the CPU. The generation is tested on a range of popular networks such as Twitter and Facebook, representing different scales and skews in degree distributions. Results show that, using our algorithm on a single modern GPU (NVIDIA Volta V100), it is possible to generate large-scale graph networks at rates exceeding 50 billion edges per second for a 69 billion-edge network. GPU profiling confirms high utilization and low branching divergence of our implementation from small to large network sizes. For networks with scattered distributions, we provide a coarsening method that further increases the GPU-based generation speed by up to a factor of 4 on tested input networks with over 45 billion edges.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Direct numerical simulation of open-channel flow over a heterogeneous particle bed at low relative submergence

In this article, this study investigates turbulent open-channel flows over beds of irregularly arranged particles, using direct numerical simulations at a friction Reynolds number of Re T = 300⁠. Two distinct cases are examined: a polydisperse bed (P800) composed of multiple layers of randomly distributed spheres of varying sizes, and a monodisperse bed (M1015) formed by a random distribution of uniform sized spheres, with a bottommost single layer of varied-sized particles to introduce realistic randomness. Our investigation unveils a rich network of low- and high-speed streaks within the flow field, exhibiting distinctive behaviors in different bed configurations. The P800 case presents a poorly organized flow pattern induced by the varied particle sizes and arrangements, while the M1015 case shows a more regular flow pattern, marked by larger streaks. We also observe that total wall shear stress is substantially influenced by surface roughness-induced drag, extending beyond the effects documented in existing studies of open-channel flows. The present study reveals intricate secondary flow patterns over irregular particle beds. Large-scale circulations are discerned around particle crests in the P800 case and localized circulations with increased turbulence in the M1015 case. Furthermore, analysis of Reynolds stress tensor components indicates that roughness disrupts coherent turbulent eddies, consequently mitigating peak stress. We quantify correlations between drag force and local fluid velocity fluctuations. Notably, a larger deviation in drag is observed in the P800 case compared to M1015, accentuating the influence of particle size and distribution on fluid–particle interactions.

42 ENGINEERING↗
DOE OSTI2020

Sub-micrometer random-pyramid texturing of silicon solar wafers with excellent surface passivation and low reflectance

Select emerging solar cell technologies, ranging from very narrow screen-printed fingers to perovskite/silicon tandems, would benefit from a reduction of the height of the standard pyramidal texture of monocrystalline silicon wafers to below 1 μm. However, fabricating such small surface features usually compromises the requisite low reflectance and high passivation quality. Through systematic design of experiments, we demonstrate that conventional alkaline-based wet-chemical etching processes can be tuned to produce dense, spatially homogeneous, and uniformly sized sub-micrometer pyramids. Precise texture size can be further controlled by adding potassium silicate to the texturing solution to effectively slow the pyramid growth rate and promote nucleation. With pyramid size distribution data—extracted from multiple atomic force microscopy images across each wafer—we demonstrate 16 nanotextures with average pyramid sizes ranging from 62 to 512 nm, with the largest having only 0.3% of its pyramids taller than 1 μm. Six of the nanotextures exhibit light trapping and surface defect densities comparable to state-of-the-art microtextured wafers. In conclusion, the best nanotexture achieved an AM1.5G-weighted reflectance of 11.8% and a minority-carrier lifetime of 3.4 ms after passivation with amorphous silicon, demonstrating that smaller textures need not deteriorate solar cell performance.

14 SOLAR ENERGY↗
DOE OSTI2022

Deterministic Linear Time for Maximal Poisson‐Disk Sampling using Chocks without Rejection or Approximation

Abstract We show how to sample uniformly within the three‐sided region bounded by a circle, a radial ray, and a tangent, called a “chock.” By dividing a 2D planar rectangle into a background grid, and subtracting Poisson disks from grid squares, we are able to represent the available region for samples exactly using triangles and chocks. Uniform random samples are generated from chock areas precisely without rejection sampling. This provides the first implemented algorithm for precise maximal Poisson‐disk sampling in deterministic linear time. We prove O(n · M(b) log b), where n is the number of samples, b is the bits of numerical precision and M is the cost of multiplication. Prior methods have higher time complexity, take expected time, are non‐maximal, and/or are not Poisson‐disk distributions in the most precise mathematical sense. We fill this theoretical lacuna.

Mitchell, Scott A.↗
DOE OSTI2026

Two datasets are better than one: method of double moments for 3D reconstruction in cryo-EM

Cryo-electron microscopy is a powerful imaging technique for reconstructing three-dimensional molecular structures from noisy tomographic projection images of randomly oriented particles. We introduce a new data fusion framework, termed the method of double moments, which reconstructs molecular structures from two instances of the second-order moment of projection images obtained under distinct orientation distributions: one uniform, the other non-uniform and unknown. We prove that these moments generically uniquely determine the underlying structure, up to a global rotation and reflection, and we develop a convex-relaxation-based algorithm that achieves accurate recovery using only second-order statistics. Our results demonstrate the advantage of collecting and modeling multiple datasets under different experimental conditions, illustrating that leveraging dataset diversity can substantially enhance reconstruction quality in computational imaging tasks.

Kam’s method↗
DOE OSTI2025

Comparing three generations of D-Wave quantum annealers for minor embedded combinatorial optimization problems

Abstract Quantum annealing (QA) is a novel type of analog computation that aims to use quantum mechanical fluctuations to search for optimal solutions of Ising problems. QA in the transverse Ising model, implemented on D-Wave quantum processing units, are available as cloud computing resources. In this study we report concise benchmarks across three generations of D-Wave quantum annealers, consisting of four different devices, for the NP-hard discrete combinatorial optimization problems unweighted maximum clique and unweighted maximum cut on random graphs. The Ising, or equivalently quadratic unconstrained binary optimization, formulation of these problems do not require auxiliary variables for order reduction, and their overall structure and weights are not highly variable, which makes these problems simple test cases to understand the sampling capability of current D-Wave quantum annealers. All-to-all minor embeddings of size 52, with relatively uniform chain lengths, are used for a direct comparison across the Chimera, Pegasus, and Zephyr device topologies. A grid-search over annealing times and the minor embedding chain strengths is performed in order to determine the level of reasonable performance for each device and problem type. Experiment metrics that are reported are approximation ratios for non-broken chain samples, chain break proportions, and time-to-solution for the maximum clique problem instances. How fairly the quantum annealers sample optimal maximum cliques, for instances which contain multiple maximum cliques, is quantified using entropy of the measured ground state distributions. The newest generation of quantum annealing hardware, which has a Zephyr hardware connectivity, performed the best overall with respect to approximation ratios and chain break frequencies.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗