Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “RANDOMNESS”

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 775 records · Page 43
All sourcesNASA NTRSDOE OSTI
DOE OSTI2020

Generating Massive Scale-free Networks: Novel Parallel Algorithms using the Preferential Attachment Model

Recently, there has been substantial interest in the study of various random networks as mathematical models of complex systems. As real-life complex systems grow larger, the ability to generate progressively large random networks becomes all the more important. This motivates the need for efficient parallel algorithms for generating such networks. Naïve parallelization of sequential algorithms for generating random networks is inefficient due to inherent dependencies among the edges and the possibility of creating duplicate (parallel) edges. In this article, we present message passing interface-based distributed memory parallel algorithms for generating random scale-free networks using the preferential-attachment model. Our algorithms are experimentally verified to scale very well to a large number of processing elements (PEs), providing near-linear speedups. The algorithms have been exercised with regard to scale and speed to generate scale-free networks with one trillion edges in 6 minutes using 1,000 PEs.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2026

Active Learning‐Driven Inkless Additive Nanomanufacturing for Printed Electronics

Inkless additive nanomanufacturing for printed electronics promises broad material and substrate versatility, yet the high-dimensional print parameter space makes tuning print parameters time-intensive. We present a Bayesian optimization study that constructs a digital twin from printed-silver data to benchmark surrogate models, acquisition functions, and batch sizes head-to-head to achieve user-specified target resistance. Tested surrogate models included Gaussian process, random forest, and Bayesian neural network surrogates with expected improvement and confidence bound acquisition functions. In total, we evaluate 48 unique model configurations alongside a random sampling baseline for comparison. For printed silver, the Bayesian neural network with a batch size of one achieved the lowest average cumulative regret, approximately four times more efficient on average than random sampling. To balance performance and substrate space, a random forest model with expected improvement and a batch size of four was chosen as the model for validation testing. Applying this chosen configuration to copper with an additional print parameter, the model achieved a resistance within 0.15 Ω of a 1 Ω target in fewer than 30 printed lines across five validation sets. Altogether, the workflow yields a tuned and validated model that efficiently guides experiments toward the target while simultaneously learning the parameter space.

Bevel, Colton [Auburn University, AL (United State↗
DOE OSTI2021

Survey on stochastic distribution systems: A full probability density function control theory with potential applications

Complex systems seen either in general engineering practice or economics are subjected to ever increased uncertainties that are mostly represented as random variables or parameters, and the characteristics of random variables are represented by their probability density functions (PDFs). Controlling their PDFs means to shape their stochastic distributions and in general it would provide a full treatment for system analysis and operational control and optimization. This leads to the development of stochastic distribution control (SDC) systems theory in the past decades, where the original aim of the controller design is to realize a shape control of the distributions of certain random variables in their PDFs sense for some engineering processes. Indeed, once the PDFs of these random variables or parameters are used to describe their distribution characters, the control task is to obtain control signals so that the output PDFs of stochastic systems are made to follow their target PDFs. The subject of SDC was initially originated for non-Gaussian stochastic control systems design but has found a wide spectrum of applications in general systems in terms of data-driven modeling, analysis, signal processing (filtering), data mining via multivariable statistics, decision-making (optimization) for systems subjected to uncertainties and even in economics. In this context, SDC constitutes an effective primer tool for complex system analysis, control and operational optimizations. In this review paper, a detailed survey of the developments on the research of SDC systems will be made together with their wide spectrum applications and future perspectives.

42 ENGINEERING↗
DOE OSTI2022

Holevo information and ensemble theory of gravity

Holevo information is an upper bound for the accessible classical information of an ensemble of quantum states. In this work, we use Holevo information to investigate the ensemble theory interpretation of quantum gravity. We study the Holevo information in random tensor network states, where the random parameters are the random tensors at each vertex. Based on the results in random tensor network models, we propose a conjecture on the holographic bulk formula of the Holevo information in the gravity case. As concrete examples of holographic systems, we compute the Holevo information in the ensemble of thermal states and thermo-field double states in the Sachdev-Ye-Kitaev model. The results are consistent with our conjecture.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2021

Beyond the universal Dyson singularity for 1-D chains with hopping disorder

We study a simple non-interacting nearest neighbor tight-binding model in one dimension with disorder, where the hopping terms are chosen randomly. This model exhibits a well-known singularity at the band center both in the density of states and localization length. If the probability distribution of the hopping terms is well-behaved, then the singularities exhibit universal behavior, the functional form of which was first discovered by Freeman Dyson in the context of a chain of classical harmonic oscillators. We show here that this universal form can be violated in a tunable manner if the hopping elements are chosen from a divergent probability distribution. We also demonstrate a connection between a breakdown of universality in this quantum problem and an analogous scenario in the classical domain — that of random walks and diffusion with anomalous exponents.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2023

Machine learning assisted phase and size-controlled synthesis of iron oxide particles

Synthesis of iron oxides with specific phases and particle sizes is a crucial challenge in various fields, including materials science, energy storage, biomedical applications, environmental science, and earth science. However, despite significant advances in this area, much of the current palette of particle outcomes has been based on time-consuming trial-and-error exploration of synthesis conditions. The present study was designed to explore a very different approach to 1) predict the outcome of synthesis from specified reaction parameters based on using machine learning (ML) techniques, and 2) correlate sets of parameters to obtain products with desired outcomes by a newly designed recommendation algorithm. To achieve this, four ML algorithms were tested, namely random forest, logistic regression, support vector machine, and k-nearest neighbor. Among the models, random forest outperformed the others, attaining 96% and 81% accuracy when predicting the phase and size of iron oxide particles in the test dataset. Surprisingly, the permutation feature importance analysis revealed that volume, which may strongly relate to pressure, was one of the important features, along with precursor concentration, pH, temperature, and time, influencing the phase and size of iron oxide particles during synthesis. To verify the robustness of the random forest models, prediction and experimental results were compared based on 24 randomly generated methods in additive and non-additive systems not included in the datasets. The predictions of product phase and particle size from the models agreed well with the experimental results. Furthermore, a searching and ranking algorithm was developed to recommend potential synthesis parameters for obtaining iron oxide products with the desired phase and particle size from previous studies in the dataset. Furthermore, this study lays the foundation for a closed-loop approach in materials synthesis and preparation, beginning with suggesting potential reaction parameters from the dataset and predicting potential outcomes, followed by conducting experiments and analyses, and ultimately enriching the dataset.

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

Dual origin of ferropericlase inclusions within super-deep diamonds

Ferropericlase [(Mg,Fe)O] is one of the major constituents of Earth's lower mantle and the most abundant mineral inclusion in sub-lithospheric diamonds. Although a lower mantle origin for ferropericlase inclusions has often been suggested, some studies have proposed that many of these inclusions may instead form at much shallower depths, in the deep upper mantle or transition zone. No straightforward method exists to discriminate ferropericlase of lower-mantle origin without characteristic mineral associations, such as co-existing former bridgmanite. To explore ferropericlase-diamond growth relationships, we have investigated the crystallographic orientation relationships (CORs), determined by single-crystal X-ray diffraction, between 57 ferropericlase inclusions and 37 diamonds from Juina (Brazil) and Kankan (Guinea). We show that ferropericlase inclusions can develop specific (16 inclusions in 12 diamonds), rotational statistical (9 inclusions in 7 diamonds) and random (32 inclusions in 25 diamond) CORs with respect to their diamond hosts. All measured inclusions showing a specific COR were found to be Fe-rich (X FeO > 0.30). Coexistence of non-randomly and randomly oriented ferropericlase inclusions within the same diamond indicates that their CORs may be variably affected by local growth conditions. However, the occurrence of specific CORs only for Fe-rich inclusions indicates that Fe-rich ferropericlases have a distinct genesis and are syngenetic with their host diamonds. In conclusion, this result provides strong support for a dual origin for ferropericlase in Earth's mantle, with Fe-rich compositions likely indicating redox growth in the upper mantle, while more Mg-rich compositions with random COR mostly representing ambient lower mantle trapped as protogenetic inclusions.

58 GEOSCIENCES↗
DOE OSTI2020

High-Resolution Comonomer Sequencing of Blocky Brominated Syndiotactic Polystyrene Copolymers Using 13C NMR Spectroscopy and Computer Simulations

This work demonstrates the first high-resolution comonomer sequencing of Blocky brominated syndiotactic polystyrene (sPS-co-sPS-Br) copolymers based on pentad assign- ments of the quaternary carbon region of the nuclear magnetic resonance spectrum. Copolymers containing p-bromostyrene (Br-Sty) units were prepared in matched sets using postpolymerization bromination methods carried out in the heterogeneous gel state (Blocky) and homogeneous solution state (Random). Quantitative information from the quaternary carbon spectra, heteronuclear multiple bond correlation spectroscopy, electronic structure calculations, and simulated statistically random copolymers was correlated to confirm the carbon resonance assignments for all 20 possible pentad comonomer sequences. Using the experimental pentad sequence prevalences, a computer code was developed to simulate chains with microstructures typical of each sample as a means to visually represent the copolymer blockiness with quantitative precision. Based on the microstructure and distribution of run lengths in these chains, the simulations revealed that the Blocky copolymers contain a high degree of blockiness. By comparing the run lengths in the simulated chains to the average number of styrene units in a crystalline segment of sPS (found by small-angle X-ray scattering), copolymer crystallizability was predicted. For the simulated Blocky B-21% (21 mol % Br-Sty) chain, the probability of randomly selecting a styrene unit in a crystallizable block was 25.8%, while that in the simulated Random R-18% was zero, in excellent agreement with the experimental crystallization behavior measured by differential scanning calorimetry. Additionally, these predictions confirmed that the simulated chains accurately represent the ensemble of chains in their respective copolymer samples. Furthermore, each simulated Blocky chain contained one or more long sPS blocks that paralleled the measured 38-40 styrene units spanning a crystalline segment within the sPS/CCl4 gel. This finding affirmed that the long sPS segments originated from the precise lamellar structure within the heterogeneous gel morphology (i.e., block length is correlated with lamellar thickness). Overall, the ability to tailor the copolymer microstructure through control of the semicrystalline gel morphology opens the door to synthesizing ordered copolymers by postpolymerization functionalization processes with unprecedented levels of compositional control.

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

Dark matter halo mass functions and density profiles from mass and energy cascade

Abstract Halo abundance and structure play a central role for modeling structure formation and evolution. Without relying on a spherical or ellipsoidal collapse model, we analytically derive the halo mass function and cuspy halo density (inner slope of −4/3) based on the mass and energy cascade theory in dark matter flow. The hierarchical halo structure formation leads to halo or particle random walk with a position-dependent waiting time $$\tau _g$$ τ g . First, the inverse mass cascade from small to large scales leads to the halo random walk in mass space with $$\tau _g\propto m_h^{-\lambda }$$ τ g ∝ m h - λ , where $$m_h$$ m h is the halo mass and $$\lambda$$ λ is a halo geometry parameter with predicted value of 2/3. The corresponding Fokker-Planck solution for halo random walk in mass space gives rise to the halo mass function with a power-law behavior on small scale and exponential decay on large scale. This can be further improved by considering two different $$\lambda$$ λ for haloes below and above a critical mass scale $$m_h^*$$ m h ∗ , i.e. a double- $$\lambda$$ λ halo mass function. Second, a double- $$\gamma$$ γ density profile can be derived based on the particle random walk in 3D space with a position-dependent waiting time $$\tau _g \propto \Phi (r)^{-1} \propto r^{-\gamma }$$ τ g ∝ Φ ( r ) - 1 ∝ r - γ , where $$\Phi$$ Φ is the gravitational potential and r is the particle distance to halo center. Theory predicts $$\gamma =2/3$$ γ = 2 / 3 that leads to a cuspy density profile with an inner slope of −4/3, consistent with the predicted scaling laws from energy cascade. The Press-Schechter mass function and Einasto density profile are just special cases of proposed models. The small scale permanence can be identified due to the scale-independent rate of mass and energy cascade, where density profiles of different halo masses and redshifts converge to the $$-4/3$$ - 4 / 3 scaling law ( $$\rho _h \propto r^{-4/3}$$ ρ h ∝ r - 4 / 3 ) on small scales. Theory predicts the halo number density scales with halo mass as $$\propto m_h^{-1.9}$$ ∝ m h - 1.9 , while the halo mass density scales as $$\propto m_h^{4/9}$$ ∝ m h 4 / 9 . Results were compared against the Illustris simulations. This new perspective provides a theory for nearly universal halo mass functions and density profiles.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2026

Automated ICRF heating surrogate modeling via machine learning

This work introduces automated machine learning workflows that address critical bottlenecks in surrogate model development for Ion Cyclotron Range of Frequencies (ICRF) heating applications. The automated framework includes data analysis tools that transform raw datasets into actionable insights in seconds, replacing weeks of manual exploratory effort and ensuring consistent, reproducible dataset characterization. By integrating advanced hyperparameter optimization (HPO) methods including Bayesian optimization via BoTorch and Tree-structured Parzen Estimators (TPE), the framework significantly reduces model development time from weeks to hours, decreasing computational cost and required expertise, while enabling high-accuracy surrogate models. Compared to traditional hyperparameter scanning (HPS) techniques such as methodical, randomized, and grid searches, HPO methods achieve superior convergence and predictive performance, even when compared to already well-tuned reference models. On NSTX High Harmonic Fast Wave (HHFW) heating datasets, both Random Forest Regressor (RFR) and neural network surrogates demonstrate improved accuracy, achieving R 2 values beyond 0.97 and 0.98, respectively. The results show that while HPO gains are modest for robust architectures like RFR, they become essential for more sensitive models such as neural networks, highlighting the trade-offs across optimization strategies. Through automated workflows that eliminate manual hyperparameter tuning and require minimal ML expertise, this work enables widespread adoption of high-fidelity surrogate models across the fusion community for real-time plasma control, uncertainty quantification, rapid experimental scenario development, and integrated system optimization.

Sanchez-Villar, Alvaro [Princeton Plasma Physics L↗
DOE OSTI2026

Experimental quantum Bernoulli factories via Bell-basis measurements

Randomness processing in the Bernoulli factory framework provides a concrete setting in which quantum resources can outperform classical ones. We experimentally demonstrate quantum randomness processing based on Bell-basis measurements of two identical input quoins prepared on IBM superconducting hardware. Using only the measurement outcomes (and no external classical randomness source), we realize the classically inconstructible Bernoulli doubling primitive f(p)=2p, and, as intermediate outputs from the same Bell-measurement statistics, an exact fair coin f(p)=1/2 and the classically inconstructible function f(p)=4p(1−p). We benchmark the measured output biases against ideal predictions and discuss the impact of device noise. Our results establish a simple resource-efficient experimental primitive for quantum-to-classical randomness processing and support the viability of quantum Bernoulli factories for quantum-enhanced stochastic simulation and sampling tasks.

Roy, Tanay [Fermilab] (ORCID:000000019442862X)↗
DOE OSTI2021

Efficient Sampling of Complex Interdependent and Multiplex Networks

Efficient sampling of interdependent and multiplex infrastructure networks is critical for effectively applying failure and recovery algorithms in real-world settings, as well as to generate property-preserving reduced-order graph-based ensembles that address topological uncertainties. In this paper, we first explore the performance, i.e. the success in preserving graph properties, of graph sampling algorithms for interdependent and multiplex networks with synthetic and real-world graphs. We simulate sampling algorithms under different parameter settings. These settings include probabilistic graph generators, coupling patterns, and various performance metrics. Our results show that while Random Node and Random Walk sampling algorithms perform best for interdependent networks, Random Edge and Forest Fire sampling algorithms perform best for multiplex networks. Second, we propose and implement a novel similarity-based sampling algorithm for multiplex networks that samples only log(N) number of layers of an N-layer multiplex network while yielding computational savings with performance guarantees. Experimental results show that similarity sampling outperforms complete sampling of all layers while decreasing performance costs from a linear scale to a logarithmic one. Our results also indicate that similarity-based sampling outperforms complete sampling and random selection in nearly all scenarios when tested with real-world data.

Subasi, Omer↗
DOE OSTI2022

Detection of spatial clustering in the 1000 richest SDSS DR8 redMaPPer clusters with nearest neighbor distributions

ABSTRACT Distances to the k-nearest-neighbor (kNN) data points from volume-filling query points are a sensitive probe of spatial clustering. Here, we present the first application of kNN summary statistics to observational clustering measurement, using the 1000 richest redMaPPer clusters (0.1 ≤ z ≤ 0.3) from the SDSS DR8 catalog. A clustering signal is defined as a difference in the cumulative distribution functions (CDFs) of kNN distances from fixed query points to the observed clusters versus a set of unclustered random points. We find that the k = 1, 2-NN CDFs of redMaPPer deviate significantly from the randoms’ across scales of 35 to 155 Mpc, which is a robust signature of clustering. In addition to kNN, we also measure the two-point correlation function for the same set of redMaPPer clusters versus random points, which shows a noisier and less significant clustering signal within the same radial scales. Quantitatively, the χ2 distribution for both the kNN-CDFs and the two-point correlation function measured on the randoms peak at χ2 ∼ 50 (null hypothesis), whereas the kNN-CDFs (χ2 ∼ 300, p = 1.54 × 10−36) pick up a much more significant clustering signal than the two-point function (χ2 ∼ 100, p = 1.16 × 10−6) when measured on redMaPPer. Finally, the measured 3NN and 4NN CDFs deviate from the predicted k = 3, 4-NN CDFs assuming an ideal Gaussian field, indicating a non-Gaussian clustering signal for redMaPPer clusters, although its origin might not be cosmological due to observational systematics. Therefore, kNN serves as a more sensitive probe of clustering complementary to the two point correlation function, providing a novel approach for constraining cosmology and galaxy–halo connection.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2022

Entanglement perspective on the quantum approximate optimization algorithm

Many quantum algorithms seek to output a specific bitstring solving the problem of interest—or a few if the solution is degenerate. It is the case for the quantum approximate optimization algorithm (QAOA) in the limit of large circuit depth, which aims to solve quadratic unconstrained binary optimization problems. Hence, the expected final state for these algorithms is either a product state or a low-entangled superposition involving a few bitstrings. What happens in between the initial N -qubit product state | 0 〉 ⊗ N and the final one regarding entanglement? Here, we consider the QAOA algorithm for solving the paradigmatic MaxCut problem on different types of graphs. We study the entanglement growth and spread resulting from randomized and optimized QAOA circuits and find that there is a volume-law entanglement barrier between the initial and final states. We also investigate the entanglement spectrum in connection with random matrix theory. In addition, we compare the entanglement production with a quantum annealing protocol aiming to solve the same MaxCut problems. Finally, we discuss the implications of our results for the simulation of QAOA circuits with tensor network-based methods relying on low-entanglement for efficiency, such as matrix product states.

Dupont, Maxime↗
DOE OSTI2021

Efficient Estimation of Pauli Observables by Derandomization

In this work, we consider the problem of jointly estimating expectation values of many Pauli observables, a crucial subroutine in variational quantum algorithms. Starting with randomized measurements, we propose an efficient derandomization procedure that iteratively replaces random single-qubit measurements by fixed Pauli measurements; the resulting deterministic measurement procedure is guaranteed to perform at least as well as the randomized one. In particular, for estimating any L low-weight Pauli observables, a deterministic measurement on only of order log(L) copies of a quantum state suffices. In some cases, for example, when some of the Pauli observables have high weight, the derandomized procedure is substantially better than the randomized one. Specifically, numerical experiments highlight the advantages of our derandomized protocol over various previous methods for estimating the ground-state energies of small molecules.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2022

Sachdev-Ye-Kitaev models and beyond: Window into non-Fermi liquids

In this work is a review of the Sachdev-Ye-Kitaev (SYK) model of compressible quantum many-body systems without quasiparticle excitations, and its connections to various theoretical studies of non-Fermi liquids in condensed matter physics. The review is placed in the context of numerous experimental observations on correlated electron materials. Strong correlations in metals are often associated with their proximity to a Mott transition to an insulator created by the local Coulomb repulsion between the electrons. The phase diagrams of a number of models of such a local electronic correlation are explored, employing a dynamical mean-field theory in the presence of random spin exchange interactions. Numerical analyses and analytical solutions, using renormalization group methods and expansions in large spin degeneracy, lead to critical regions that display SYK physics. The models studied include the single-band Hubbard model, the t–J model, and the two-band Kondo-Heisenberg model in the presence of random spin exchange interactions. Also examined are non-Fermi liquids obtained by considering each SYK model with random four-fermion interactions to be a multiorbital atom, with the SYK atoms arranged in an infinite lattice. Connections are made to theories of sharp Fermi surfaces without any low-energy quasiparticles in the absence of spatial disorder, obtained by coupling a Fermi liquid to a gapless boson; a systematic large-N theory of such a critical Fermi surface, with SYK characteristics, is obtained by averaging over an ensemble of theories with random boson-fermion couplings. Finally, an overview of the links between the SYK model and quantum gravity is presented, and the review ends with an outlook on open questions.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2025

A Class of Sparse Johnson–Lindenstrauss Transforms and Analysis of their Extreme Singular Values

The Johnson–Lindenstrauss (JL) lemma is a powerful tool for dimensionality reduction in modern algorithm design. The lemma states that any set of high-dimensional points in a Euclidean space can be projected into lower dimensions while approximately preserving pairwise Euclidean distances. Random matrices satisfying this lemma are called JL transforms (JLTs). Inspired by existing $s$-hashing JLTs with exactly $s$ nonzero elements on each column, the present work introduces an ensemble of sparse matrices encompassing so-called $s$-hashing-like matrices whose expected number of nonzero elements on each column is $s$. The independence of the sub-Gaussian entries of these matrices and the knowledge of their exact distribution play an important role in their analyses. Using properties of independent sub-Gaussian random variables, these matrices are demonstrated to be JLTs, and their smallest nontrivial singular values and largest singular values are estimated nonasymptotically using a technique from geometric functional analysis. As the dimensions of the matrix grow to infinity, these singular values are proved to converge almost surely to fixed quantities (by using the universal Bai–Yin law) and in distribution to the Gaussian orthogonal ensemble Tracy–Widom law after proper rescalings. Understanding the behaviors of extreme singular values is important in general because they are often used to define a measure of stability of matrix algorithms. For example, JLTs were recently used in derivative-free optimization algorithmic frameworks to select random subspaces in which are constructed random models or poll directions to achieve scalability, and hence estimating their smallest singular value in particular helps determine the dimension of these subspaces.

97 MATHEMATICS AND COMPUTING↗