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 253 records · Page 14

Development of random geometry capability in RMC code for explicit analysis of polytype particle/pebble - 18493

Monte Carlo method plays an important role in accurate simulation of High Temperature Gas-Cooled Reactors (HTR) and molten salt reactors, owing to its advantages of the flexible geometry modeling and the use of continuous-energy nuclear cross sections. For the innovative design of pebble bed, prism HTRs and molten salt reactors, there may be more than one kind of particles or pebbles in the system, such as the burnable poison particles, graphite pebbles or fuel pebbles with different enrichments. Different treatments have been used to deal with the double-heterogeneous geometry of these reactors. In some researches, the particle distributions in stochastic media are assumed the regular lattice, while in the others, the explicit packing methods such as Random Sequential Addition (RSA) and Discrete Element Method (DEM) are used, by generating the random coordinates of the particles/pebbles. However, traditional geometry with repeated structure has difficulties in explicit modeling polytype particle/pebble, due to the arbitrary packing fractions of different kinds of particles or pebbles. Although, packing methods such as Random Sequential Addition (RSA) and Discrete Element Method (DEM) could solve the polytype particle/pebble problems to some extent, but these methods are troublesome in geometry modeling and time consuming. In this paper, a new Random Universe Geometry method was developed and implemented in Monte Carlo code RMC, for explicit analysis of polytype particle/pebble in double heterogeneous geometry systems, such as HTRs and molten salt reactors. This method was applied to constructed mixed particles/pebbles problems and also simplified HTR-10 full core problem to test the feasibility, and the results show that the random geometry modeling can provide explicit packing fraction of different kinds of particles or pebbles. The results are also compared with that calculated by RSA method and regular structure, and agree quite well. This work would provide an effective tool for the innovative design of pebble bed, prism HTRs and molten salt reactors with polytype particles or pebbles using Monte Carlo method. (authors)

11 NUCLEAR FUEL CYCLE AND FUEL MATERIALS↗

Improving the performance of PM6 donor polymer by random ternary copolymerization of BDD and DTBT segments

Developing high-performance wide bandgap polymer donors to match the rapidly growing non-fullerene small molecule acceptors (NF-SMAs) is of great importance to further improve the photovoltaic performances of organic solar cells (OSCs). PM6 and D18 are two leading wide bandgap donor polymers, but their performances are highly sensitive to the molecular weights, which have distinct impact on the morphology and thereby the charge generation and recombination processes. Here, in this work, we reported the random ternary copolymerization of PM6 and D18 segments to develop random terpolymers with finely tuned photoelectronic properties and optimized blend morphology for high-performance OSCs. The resulting random terpolymers (PMD-5, PMD-10, PMD-15 and PMD-20) exhibited finely tuned absorptions, energy levels and blend morphology. The optimal morphology of PMD-15:L8-BO contributed to the fast exciton diffusion and dissociation, efficient charge extraction with suppressed recombination. Thus, the power conversion efficiency was improved from 17.22% of the control PM6 devices and 17.47% of the control D18 devices to 18.12% of PMD-15 based devices, which is the top performance of random terpolymers. Moreover, the PMD-15 exhibited much higher batch-to-batch reproducibility at a broad molecular weight range than that of PM6 and D18, showing promising for practical applications.

36 MATERIALS SCIENCE↗

Interconnected Nanoporous Polysulfone by the Self-Assembly of Randomly Linked Copolymer Networks and Linear Multiblocks

Porous materials have attracted considerable attention due to their versatile applications, especially in water purification. Interconnected nanoporous structures are distinguished by their high degree of porosity and resistance to clogging, as well as their insensitivity to nanostructural orientation. Previous works on randomly linked copolymer systems have shown that they can effectively produce disordered cocontinuous nanostructures, which upon removal of one component yield interconnected nanoporous materials. However, the cocontinuous nanomaterials previously developed using polystyrene (PS) and poly(d,l-lactic acid) (PLA) strands, and the resulting interconnected nanoporous PS monoliths, were far too brittle to enable practical use as membranes. Here, we study the self-assembly of randomly linked copolymer networks prepared using blocks of the engineering polymer polysulfone (PSU). A wide cocontinuous regime (spanning 40 wt %) was found for randomly end-linked copolymer networks (RECNs) constructed from PSU and PLA strands, via a combination of mechanical testing, gravimetry, small-angle X-ray scattering, and scanning electron microscopy. The PSU/PLA cocontinuous nanomaterial with symmetric composition showed 2.4 times higher Young’s modulus and ~100 times greater toughness than the corresponding PS/PLA sample. The interconnected nanoporous PSU fabricated after etching of PLA even exhibited 1.6 times greater toughness than PS/PLA prior to PLA removal. To facilitate the production of thin films of cocontinuous nanomaterials, we applied solution-processable randomly linked linear PSU/PLA multiblock polymers onto ultrafiltration membranes. Here, the interconnected nanoporous PSU thin film generated by etching PLA was found to effectively reject 50 nm diameter particles without significantly compromising permeability. This discovery presents a valuable addition to the existing techniques used to fabricate PSU membranes. In contrast to traditional methods, which are sensitive to processing conditions, produce a wide range of pore sizes, and offer limited adjustability of pore size, the current technique is anticipated to enable interconnected PSU membranes with more uniform and tailorable porosity.

36 MATERIALS SCIENCE↗

Scalable hierarchical PDE sampler for generating spatially correlated random fields using nonmatching meshes: Scalable hierarchical PDE sampler using nonmatching meshes

This work describes a domain embedding technique between two nonmatching meshes used for generating realizations of spatially correlated random fields with applications to large-scale sampling-based uncertainty quantification. The goal is to apply the multilevel Monte Carlo (MLMC) method for the quantification of output uncertainties of PDEs with random input coefficients on general and unstructured computational domains. We propose a highly scalable, hierarchical sampling method to generate realizations of a Gaussian random field on a given unstructured mesh by solving a reaction–diffusion PDE with a stochastic right-hand side. The stochastic PDE is discretized using the mixed finite element method on an embedded domain with a structured mesh, and then, the solution is projected onto the unstructured mesh. This work describes implementation details on how to efficiently transfer data from the structured and unstructured meshes at coarse levels, assuming that this can be done efficiently on the finest level. We investigate the efficiency and parallel scalability of the technique for the scalable generation of Gaussian random fields in three dimensions. An application of the MLMC method is presented for quantifying uncertainties of subsurface flow problems. Here, we demonstrate the scalability of the sampling method with nonmatching mesh embedding, coupled with a parallel forward model problem solver, for large-scale 3D MLMC simulations with up to 1.9·109 unknowns.

97 MATHEMATICS AND COMPUTING↗

Chaos, complexity, and random matrices

Chaos and complexity entail an entropic and computational obstruction to describing a system, and thus are intrinsically difficult to characterize. In this paper, we consider time evolution by Gaussian Unitary Ensemble (GUE) Hamiltonians and analytically compute out-of-time-ordered correlation functions (OTOCs) and frame potentials to quantify scrambling, Haar-randomness, and circuit complexity. While our random matrix analysis gives a qualitatively correct prediction of the late-time behavior of chaotic systems, we find unphysical behavior at early times including an O(1) scrambling time and the apparent breakdown of spatial and temporal locality. The salient feature of GUE Hamiltonians which gives us computational traction is the Haar-invariance of the ensemble, meaning that the ensemble-averaged dynamics look the same in any basis. Motivated by this property of the GUE, we introduce k-invariance as a precise definition of what it means for the dynamics of a quantum system to be described by random matrix theory. Here,we envision that the dynamical onset of approximate k-invariance will be a useful tool for capturing the transition from early-time chaos, as seen by OTOCs, to late-time chaos, as seen by random matrix theory.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

The Random Change of Coordination Number in the Blume-Capel Model

The spin-1 Blume-Capel model is investigated under the random change of coordination numbers on the Bethe lattice (BL). Various coordination numbers are taken as couples and varied randomly on the shells of the BL. The randomization is realized in the standard-random approach and the formulation is obtained in terms of exact recursion relations. The phase diagrams are obtained by calculating the places of the second- and first-order phase transitions and tricritical points.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

On Edge Exchangeable Random Graphs

We study a recent model for edge exchangeable random graphs introduced by Crane and Dempsey; in particular we study asymptotic properties of the random simple graph obtained by merging multiple edges. We study a number of examples, and show that the model can produce dense, sparse and extremely sparse random graphs. One example yields a power-law degree distribution. We give some examples where the random graph is dense and converges a.s. in the sense of graph limit theory, but also an example where a.s. every graph limit is the limit of some subsequence. Another example is sparse and yields convergence to a non-integrable generalized graphon defined on (0,∞).

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Cluster Tails for Critical Power-Law Inhomogeneous Random Graphs

Recently, the scaling limit of cluster sizes for critical inhomogeneous random graphs of rank-1 type having finite variance but infinite third moment degrees was obtained in Bhamidi et al. (Ann Probab 40:2299–2361, 2012). It was proved that when the degrees obey a power law with exponent τ∈(3,4), the sequence of clusters ordered in decreasing size and multiplied through by n{sup −(τ−2)/(τ−1)} converges as n→∞ to a sequence of decreasing non-degenerate random variables. Here, we study the tails of the limit of the rescaled largest cluster, i.e., the probability that the scaling limit of the largest cluster takes a large value u, as a function of u. This extends a related result of Pittel (J Combin Theory Ser B 82(2):237–269, 2001) for the Erdős–Rényi random graph to the setting of rank-1 inhomogeneous random graphs with infinite third moment degrees. We make use of delicate large deviations and weak convergence arguments.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Random Forests and Networks Analysis

Wilson (Proceedings of the twenty-eight annual acm symposium on the theory of computing, pp. 296–303, 1996) in the 1990s described a simple and efficient algorithm based on loop-erased random walks to sample uniform spanning trees and more generally weighted trees or forests spanning a given graph. This algorithm provides a powerful tool in analyzing structures on networks and along this line of thinking, in recent works (Avena and Gaudillière in A proof of the transfer-current theorem in absence of reversibility, in Stat. Probab. Lett. 142, 17–22 (2018); Avena and Gaudillière in J Theor Probab, 2017. https://doi.org/10.1007/s10959-017-0771-3 ; Avena et al. in Approximate and exact solutions of intertwining equations though random spanning forests, 2017. arXiv:1702.05992v1 ; Avena et al. in Intertwining wavelets or multiresolution analysis on graphs through random forests, 2017. arXiv:1707.04616 , to appear in ACHA (2018)) we focused on applications of spanning rooted forests on finite graphs. The resulting main conclusions are reviewed in this paper by collecting related theorems, algorithms, heuristics and numerical experiments. A first foundational part on determinantal structures and efficient sampling procedures is followed by four main applications: (1) a random-walk-based notion of well-distributed points in a graph, (2) a framework to describe metastable-like dynamics in finite settings by means of Markov intertwining dualities, (3) coarse graining schemes for networks and associated processes, (4) wavelets-like pyramidal algorithms for graph signals.

97 MATHEMATICS AND COMPUTING↗

Localization of disordered bosons and magnets in random fields

We study localization properties of disordered bosons and spins in random fields at zero temperature. We focus on two representatives of different symmetry classes, hard-core bosons (XY magnets) and Ising magnets in random transverse fields, and contrast their physical properties. We describe localization properties using a locator expansion on general lattices. For 1d Ising chains, we find non-analytic behavior of the localization length as a function of energy at ω=0, ξ{sup −1}(ω)=ξ{sup −1}(0)+A|ω|{sup α}, with α vanishing at criticality. This contrasts with the much smoother behavior predicted for XY magnets. We use these results to approach the ordering transition on Bethe lattices of large connectivity K, which mimic the limit of high dimensionality. In both models, in the paramagnetic phase with uniform disorder, the localization length is found to have a local maximum at ω=0. For the Ising model, we find activated scaling at the phase transition, in agreement with infinite randomness studies. In the Ising model long range order is found to arise due to a delocalization and condensation initiated at ω=0, without a closing mobility gap. We find that Ising systems establish order on much sparser (fractal) subgraphs than XY models. Possible implications of these results for finite-dimensional systems are discussed. -- Highlights: •Study of localization properties of disordered bosons and spins in random fields. •Comparison between XY magnets (hard-core bosons) and Ising magnets. •Analysis of the nature of the magnetic transition in strong quenched disorder. •Ising magnets: activated scaling, no closing mobility gap at the transition. •Ising order emerges on sparser (fractal) support than XY order.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Benford’s law and continuous dependent random variables

Many mathematical, man-made and natural systems exhibit a leading-digit bias, where a first digit (base 10) of 1 occurs not 11% of the time, as one would expect if all digits were equally likely, but rather 30%. This phenomenon is known as Benford’s Law. Analyzing which datasets adhere to Benford’s Law and how quickly Benford behavior sets in are the two most important problems in the field. Most previous work studied systems of independent random variables, and relied on the independence in their analyses. Inspired by natural processes such as particle decay, we study the dependent random variables that emerge from models of decomposition of conserved quantities. We prove that in many instances the distribution of lengths of the resulting pieces converges to Benford behavior as the number of divisions grow, and give several conjectures for other fragmentation processes. The main difficulty is that the resulting random variables are dependent. We handle this by using tools from Fourier analysis and irrationality exponents to obtain quantified convergence rates as well as introducing and developing techniques to measure and control the dependencies. The construction of these tools is one of the major motivations of this work, as our approach can be applied to many other dependent systems. As an example, we show that the n! entries in the determinant expansions of n×n matrices with entries independently drawn from nice random variables converges to Benford’s Law.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Effect of randomness on multi-frequency aeroelastic responses resolved by Unsteady Adaptive Stochastic Finite Elements

The Unsteady Adaptive Stochastic Finite Elements (UASFE) method resolves the effect of randomness in numerical simulations of single-mode aeroelastic responses with a constant accuracy in time for a constant number of samples. In this paper, the UASFE framework is extended to multi-frequency responses and continuous structures by employing a wavelet decomposition pre-processing step to decompose the sampled multi-frequency signals into single-frequency components. The effect of the randomness on the multi-frequency response is then obtained by summing the results of the UASFE interpolation at constant phase for the different frequency components. Results for multi-frequency responses and continuous structures show a three orders of magnitude reduction of computational costs compared to crude Monte Carlo simulations in a harmonically forced oscillator, a flutter panel problem, and the three-dimensional transonic AGARD 445.6 wing aeroelastic benchmark subject to random fields and random parameters with various probability distributions.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Polynomial chaos representation of spatio-temporal random fields from experimental measurements

Two numerical techniques are proposed to construct a polynomial chaos (PC) representation of an arbitrary second-order random vector. In the first approach, a PC representation is constructed by matching a target joint probability density function (pdf) based on sequential conditioning (a sequence of conditional probability relations) in conjunction with the Rosenblatt transformation. In the second approach, the PC representation is obtained by having recourse to the Rosenblatt transformation and simultaneously matching a set of target marginal pdfs and target Spearman's rank correlation coefficient (SRCC) matrix. Both techniques are applied to model an experimental spatio-temporal data set, exhibiting strong non-stationary and non-Gaussian features. The data consists of a set of oceanographic temperature records obtained from a shallow-water acoustics transmission experiment. The measurement data, observed over a finite denumerable subset of the indexing set of the random process, is treated as a collection of observed samples of a second-order random vector that can be treated as a finite-dimensional approximation of the original random field. A set of properly ordered conditional pdfs, that uniquely characterizes the target joint pdf, in the first approach and a set of target marginal pdfs and a target SRCC matrix, in the second approach, are estimated from available experimental data. Digital realizations sampled from the constructed PC representations based on both schemes capture the observed statistical characteristics of the experimental data with sufficient accuracy. The relative advantages and disadvantages of the two proposed techniques are also highlighted.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Parametric models for samples of random functions

A new class of parametric models, referred to as sample parametric models, is developed for random elements that match sample rather than the first two moments and/or other global properties of these elements. The models can be used to characterize, e.g., material properties at small scale in which case their samples represent microstructures of material specimens selected at random from a population. The samples of the proposed models are elements of finite-dimensional vector spaces spanned by samples, eigenfunctions of Karhunen–Loève (KL) representations, or modes of singular value decompositions (SVDs). The implementation of sample parametric models requires knowledge of the probability laws of target random elements. Numerical examples including stochastic processes and random fields are used to demonstrate the construction of sample parametric models, assess their accuracy, and illustrate how these models can be used to solve efficiently stochastic equations.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Single scattering estimates for the scintillation function of waves in random media

The energy density of high frequency waves propagating in highly oscillatory random media is well approximated by solutions of deterministic kinetic models. The scintillation function determines the statistical instability of the kinetic solution. This paper analyzes the single scattering term in the scintillation function. This is the term of the scintillation function that is linear in the power spectrum of the random fluctuations. We show that the structure of the scintillation function is already quite complicated in this simplified setting. It strongly depends on the singularity of the initial conditions for the wave field and on the correlation properties of the random medium. We obtain limiting expressions for the scintillation function as the correlation length of the random medium tends to zero.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Partial transpose of random quantum states: Exact formulas and meanders

We investigate the asymptotic behavior of the empirical eigenvalues distribution of the partial transpose of a random quantum state. The limiting distribution was previously investigated via Wishart random matrices indirectly (by approximating the matrix of trace 1 by the Wishart matrix of random trace) and shown to be the semicircular distribution or the free difference of two free Poisson distributions, depending on how dimensions of the concerned spaces grow. Our use of Wishart matrices gives exact combinatorial formulas for the moments of the partial transpose of the random state. We find three natural asymptotic regimes in terms of geodesics on the permutation groups. Two of them correspond to the above two cases; the third one turns out to be a new matrix model for the meander polynomials. Moreover, we prove the convergence to the semicircular distribution together with its extreme eigenvalues under weaker assumptions, and show large deviation bound for the latter.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Nonlocal operators, parabolic-type equations, and ultrametric random walks

In this article, we introduce a new type of nonlocal operators and study the Cauchy problem for certain parabolic-type pseudodifferential equations naturally associated to these operators. Some of these equations are the p-adic master equations of certain models of complex systems introduced by Avetisov, V. A. and Bikulov, A. Kh., “On the ultrametricity of the fluctuation dynamicmobility of protein molecules,” Proc. Steklov Inst. Math. 265(1), 75–81 (2009) [Tr. Mat. Inst. Steklova 265, 82–89 (2009) (Izbrannye Voprosy Matematicheskoy Fiziki i p-adicheskogo Analiza) (in Russian)]; Avetisov, V. A., Bikulov, A. Kh., and Zubarev, A. P., “First passage time distribution and the number of returns for ultrametric random walks,” J. Phys. A 42(8), 085003 (2009); Avetisov, V. A., Bikulov, A. Kh., and Osipov, V. A., “p-adic models of ultrametric diffusion in the conformational dynamics of macromolecules,” Proc. Steklov Inst. Math. 245(2), 48–57 (2004) [Tr. Mat. Inst. Steklova 245, 55–64 (2004) (Izbrannye Voprosy Matematicheskoy Fiziki i p-adicheskogo Analiza) (in Russian)]; Avetisov, V. A., Bikulov, A. Kh., and Osipov, V. A., “p-adic description of characteristic relaxation in complex systems,” J. Phys. A 36(15), 4239–4246 (2003); Avetisov, V. A., Bikulov, A. H., Kozyrev, S. V., and Osipov, V. A., “p-adic models of ultrametric diffusion constrained by hierarchical energy landscapes,” J. Phys. A 35(2), 177–189 (2002); Avetisov, V. A., Bikulov, A. Kh., and Kozyrev, S. V., “Description of logarithmic relaxation by a model of a hierarchical random walk,” Dokl. Akad. Nauk 368(2), 164–167 (1999) (in Russian). The fundamental solutions of these parabolic-type equations are transition functions of random walks on the n-dimensional vector space over the field of p-adic numbers. We study some properties of these random walks, including the first passage time.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Efficient Raman generation in a waveguide: A route to ultrafast quantum random number generation

The inherent uncertainty in quantum mechanics offers a source of true randomness which can be used to produce unbreakable cryptographic keys. We discuss the development of a high-speed random number generator based on the quantum phase fluctuations in spontaneously initiated stimulated Raman scattering (SISRS). We utilize the tight confinement and long interaction length available in a Potassium Titanyl Phosphate waveguide to generate highly efficient SISRS using nanojoule pulse energies, reducing the high pump power requirements of the previous approaches. We measure the random phase of the Stokes output using a simple interferometric setup to yield quantum random numbers at 145 Mbps.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗