Search NASA⌕ Search

SEARCH · Search NASA

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

Combining Random Mutagenesis and Metabolic Engineering for Enhanced Tryptophan Production in Synechocystis sp. Strain PCC 6803

Tryptophan (Trp) is an essential aromatic amino acid that has value as an animal feed supplement, as the amount found in plant-based sources is insufficient. An alternative to production by engineered microbial fermentation is to have tryptophan biosynthesized by a photosynthetic microorganism that could replace or supplement both the plant and industrially used microbes. We selected Synechocystis sp. strain PCC 6803, a model cyanobacterium, as the host and studied metabolic engineering and random mutagenesis approaches. Previous work on engineering heterotrophic microbes for improved Trp titers has targeted allosteric feedback regulation in enzymes 3-deoxy-d-arabinoheptulosonate 7-phosphate synthase (DAHPS) and anthranilate synthase (AS) as major bottlenecks in the shikimate pathway. In this work, the genes encoding feedback-resistant enzymes from Escherichia coli, aroG fbr and trpE fbr , were overexpressed in the host wild-type (WT) strain. Separately, the WT strain was subjected to random mutagenesis and selection using an amino acid analog to isolate tryptophan-overproducing strains. The randomly mutagenized strains were sequenced in order to identify the mutations that resulted in the desirable phenotypes. Interestingly, the tryptophan overproducers had mutations in the gene encoding chorismate mutase (CM), which catalyzes the conversion of chorismate to prephenate. The best tryptophan overproducer from random mutagenesis was selected as a host for metabolic engineering where aroG fbr and trpE fbr were overexpressed. The best strain developed produced 212 ± 23 mg/liter of tryptophan after 10 days of photoautotrophic growth under 3% (vol/vol) CO2. We demonstrated that a combination of random mutagenesis and metabolic engineering was superior to either individual approach.

59 BASIC BIOLOGICAL SCIENCES↗

Scalable Extended Dynamic Mode Decomposition Using Random Kernel Approximation

The Koopman operator is a linear, infinite-dimensional operator that governs the dynamics of system observables; extended dynamic mode decomposition (EDMD) is a data-driven method for approximating the Koopman operator using functions (features) of the system state snapshots. This paper investigates an approach to EDMD in which the features used provide random approximations to a particular kernel function. The objective of this is computational economy for large data sets: EDMD is generally ill-suited for problems with large state dimension, and its dual kernel formulation (KDMD) is well-suited for such problems only if the number of data snapshots is relatively small. We discuss two specific methods for generating features: random Fourier features and the Nÿstrom method. The first method is a data-independent method for translation-invariant kernels only and involves random sampling in feature space; the second method is a data-dependent empirical method that may be used for any kernel and involves random sampling of data. We first discuss how these ideas may be applied in an EDMD context, as well as a means for adaptively adding random Fourier features. As a result, we demonstrate these methods on two example problems and conclude with an analysis of the relative benefits and drawbacks of each method.

59 BASIC BIOLOGICAL SCIENCES↗

A Domain Decomposition Model Reduction Method for Linear Convection-Diffusion Equations with Random Coefficients

We developed a domain decomposition model reduction method for linear steady- state convection-diffusion equations with random coefficients. Of particular interest to this effort are the diffusion equation with random diffusivity and the convection-dominated transport equation with random velocity. We investigated two types of random fields, i.e., colored noises and discrete white noises, both of which can lead to high-dimensional parametric dependence in practice. The motivation is to exploit domain decomposition to reduce the parametric dimension of local problems in subdomains, such that an entire parametric map can be approximated with a small number of expensive partial differential equation (PDE) simulations. The new method combines domain decomposition with model reduction and sparse polynomial approximation, so as to simultaneously handle the high dimensionality and irregular behavior of the PDEs under consideration. Here, the advantages of our method lie in three aspects: (i) online-offline decomposition, i.e., the online cost is independent of the size of the triangle mesh; (ii) sparse approximation of operators involving nonaffine high-dimensional random fields; (iii) an effective strategy to capture irregular behaviors, e.g., sharp transitions of the PDE solutions. Two numerical examples are provided to demonstrate the advantageous performance of our method.

97 MATHEMATICS AND COMPUTING↗

Quantum Random Number Generator (QRNG)

The Los Alamos Quantum Random Number Generator (QRNG) is a hardware-based, high-performance Random Number Generator capable of generating 200 Mbit/s or more of true random numbers. Like flipping a coin, it is very much random and essential for information security like encrypting data on the internet, checking email, or purchasing something from an online vendor. The device harvests entropy from fluctuations in an optical source that arise from quantum mechanical properties of light. Qrypt, Inc., a company launched in 2017, began making strategic investments and developing partnerships to advance cutting-edge quantum hardware solutions. One of those key investments was licensing QRNG from Los Alamos and subsequently collaborating with advanced quantum materials and technology researcher Dr. Raymond Newell to create high-quality random keys at scale.

97 MATHEMATICS AND COMPUTING↗

Randomized measurement protocols for lattice gauge theories

Randomized measurement protocols, including classical shadows, entanglement tomography, and randomized benchmarking are powerful techniques to estimate observables, perform state tomography, or extract the entanglement properties of quantum states. While unraveling the intricate structure of quantum states is generally difficult and resource-intensive, quantum systems in nature are often tightly constrained by symmetries. Furthermore, this can be leveraged by the symmetry-conscious randomized measurement schemes we propose, yielding clear advantages over symmetry-blind randomization such as reducing measurement costs, enabling symmetry-based error mitigation in experiments, allowing differentiated measurement of (lattice) gauge theory entanglement structure, and, potentially, the verification of topologically ordered states in existing and near-term experiments. Crucially, unlike symmetry-blind randomized measurement protocols, these latter tasks can be performed without relearning symmetries via full reconstruction of the density matrix.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Quantum random number generator

A quantum random number generator (QRNG) and a photon generator for a QRNG are provided. The photon generator may be operated in a spontaneous mode below a lasing threshold to emit photons. Photons emitted from the photon generator may have at least one random characteristic, which may be monitored by the QRNG to generate a random number. In one embodiment, the photon generator may include a photon emitter and an amplifier coupled to the photon emitter. The amplifier may enable the photon generator to be used in the QRNG without introducing significant bias in the random number and may enable multiplexing of multiple random numbers. The amplifier may also desensitize the photon generator to fluctuations in power supplied thereto while operating in the spontaneous mode. In one embodiment, the photon emitter and amplifier may be a tapered diode amplifier.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Efficient reversible uniform and non-uniform random number generation in UNU.RAN

Reversible random number generations are useful in large-scale fault-tolerant parallel computations and parallel discrete event simulations that are based on reversible computation. The Universal Non-Uniform Random Number Generator (UNU.RAN) is one of the popular random number generators used in the simulation community, but the generators are forward-only in nature. In this paper, we develop new reverse algorithm for the default uniform random number generator algorithm of UNU.RAN and also a few nonuniform random generators that use the Transform Density Reduction (TDR) method. We verify the correctness of reversals of our algorithms and also provide performance results to demonstrate reverse computing runtime adds little overheads relative to its forward counterpart.

Yoginath, Srikanth↗

Devices and methods for increasing the speed and efficiency at which a computer is capable of modeling a plurality of random walkers using a density method

A method for increasing a speed or energy efficiency at which a computer is capable of modeling a plurality of random walkers. The method includes defining a virtual space in which a plurality of virtual random walkers will move among different locations in the virtual space, wherein the virtual space comprises a plurality of vertices and wherein the different locations are ones of the plurality of vertices. A corresponding set of neurons in a spiking neural network is assigned to a corresponding vertex such that there is a correspondence between sets of neurons and the plurality of vertices, wherein a spiking neural network comprising a plurality of sets of spiking neurons is established. A virtual random walk of the plurality of virtual random walkers is executed using the spiking neural network, wherein executing includes tracking how many virtual random walkers are at each vertex at a given time increment.

Aimone, James Bradley↗

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↗

Stochastic Integrals and Evolution Equations with Gaussian Random Fields

The paper studies stochastic integration with respect to Gaussian processes and fields. It is more convenient to work with a field than a process: by definition, a field is a collection of stochastic integrals for a class of deterministic integrands. The problem is then to extend the definition to random integrands. An orthogonal decomposition of the chaos space of the random field, combined with the Wick product, leads to the Ito-Skorokhod integral, and provides an efficient tool to study the integral, both analytically and numerically. For a Gaussian process, a natural definition of the integral follows from a canonical correspondence between random processes and a special class of random fields. Also considered are the corresponding linear stochastic evolution equations.

97 MATHEMATICS AND COMPUTING↗

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↗