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 325 records · Page 18

High Temperature, Low Relative Humidity, Polymer-type Membranes Based on Disulfonated Poly(arylene ether) Block and Random Copolymers Optionally Incorporating Protonic Conducting Layered Water insoluble Zirconium Fillers

Our research group has been engaged in the past few years in the synthesis of biphenol based partially disulfonated poly(arylene ether sulfone) random copolymers as potential PEMs. This series of polymers are named as BPSH-xx, where BP stands for biphenol, S stands for sulfonated, H stands for acidified and xx represents the degree of disulfonation. All of these sulfonated copolymers phase separate to form nano scale hydrophilic and hydrophobic morphological domains. The hydrophilic phase containing the sulfonic acid moieties causes the copolymer to absorb water. Water confined in hydrophilic pores in concert with the sulfonic acid groups serve the critical function of proton (ion) conduction and water transport in these systems. Both Nafion and BPSH show high proton conductivity at fully hydrated conditions. However proton transport is especially limited at low hydration level for the BPSH random copolymer. It has been observed that the diffusion coefficients of both water and protons change with the water content of the pore. This change in proton and water transport mechanisms with hydration level has been attributed to the solvation of the acid groups and the amount of bound and bulk-like water within a pore. At low hydration levels most of the water is tightly associated with sulfonic groups and has a low diffusion coefficient. This tends to encourage isolated domain morphology. Thus, although there may be significant concentrations of protons, the transport is limited by the discontinuous morphological structure. Hence the challenge lies in how to modify the chemistry of the polymers to obtain significant protonic conductivity at low hydration levels. This may be possible if one can alter the chemical structure to synthesize nanophase separated ion containing block copolymers. Unlike the BPSH copolymers, where the sulfonic acid groups are randomly distributed along the chain, the multiblock copolymers will feature an ordered sequence of hydrophilic and hydrophobic segments. If, like in Nafion, connectivity is established between the hydrophilic domains in these multiblock copolymers, they will not need as much water, and hence will show much better protonic conductivity than the random copolymers (with similar degree of sulfonation, or IEC) at partially hydrated conditions. The goal of this research is to develop a material suitable for use as a polymer electrolyte membrane which by the year 2010 will meet all the performance requirements associated with fuel cell operation at high temperatures and low relative humidity, and will out-perform the present standard Nafion{reg_sign}. In particular, it is our objective to extend our previous research based on the use of thermally, oxidatively, and hydrolytically, ductile, high Tg ion containing polymers based on poly(arylene ethers) to the production of polymer electrolyte membranes which will meet all the performance requirements in addition to having an areal resistance of < 0.05 ohm-cm{sup 2} at a temperature of up to 120 C, relative humidity of 25 to 50%, and up to 2.5 atm total pressure. In many instances, our materials already out performs Nafion{reg_sign}, and it is expected that with some modification by either combining with conductive inorganic fillers and/or synthesizing as a block copolymer it will meet the performance criteria at high temperatures and low relative humidity. A key component in improving the performance of the membranes (and in particular proton conductivity) and meeting the cost requirements of $40/m{sup 2} is our development of a film casting process, which shows promise for generation of void free thin films of uniform thickness with controlled polymer alignment and configuration.

30 DIRECT ENERGY CONVERSION↗

Propagation of a Strong Shock Over a Random Bed of Spherical Particles

Propagation of a strong shock through a bed of particles results in complex wave dynamics such as a reflected shock, a transmitted shock, and highly unsteady flow inside the particle bed. In this paper we present three-dimensional numerical simulations of shock propagation in air over a random bed of particles. We assume the flow is inviscid and governed by the Euler equations of gas dynamics. Simulations are carried out by varying the volume fraction of the particle bed at a fixed shock Mach number. We compute the unsteady inviscid streamwise and transverse drag coefficients as a function of time for each particle in the random bed as a function of volume fraction. We show that (i) there are significant variations in the peak drag for the particles in the bed, (ii) the mean peak drag as a function of streamwise distance through the bed decreases with a slope that increases as the volume fraction increases, and (iii) the deviation from the mean peak drag does not correlate with local volume fraction. We also present the local Mach number and pressure contours for the different volume fractions to explain the various observed complex physical mechanisms occurring during the shock-particle interactions. Since the shock interaction with the random bed of particles leads to transmitted and reflected waves, we compute the average flow properties to characterize the strength of the transmitted and reflected shock waves and quantify the energy dissipation inside the particle bed. Finally, to better understand the complex wave dynamics in a random bed, we consider a simpler approximation of a planar shock propagating in a duct with a sudden area change. We obtain Riemann solutions to this problem, which are used to compare with fully resolved numerical simulations.

42 ENGINEERING↗

Evaluation of a Class of Simple and Effective Uncertainty Methods for Sparse Samples of Random Variables and Functions

When very few samples of a random quantity are available from a source distribution of unknown shape, it is usually not possible to accurately infer the exact distribution from which the data samples come. Under-estimation of important quantities such as response variance and failure probabilities can result. For many engineering purposes, including design and risk analysis, we attempt to avoid under-estimation with a strategy to conservatively estimate (bound) these types of quantities -- without being overly conservative -- when only a few samples of a random quantity are available from model predictions or replicate experiments. This report examines a class of related sparse-data uncertainty representation and inference approaches that are relatively simple, inexpensive, and effective. Tradeoffs between the methods' conservatism, reliability, and risk versus number of data samples (cost) are quantified with multi-attribute metrics use d to assess method performance for conservative estimation of two representative quantities: central 95% of response; and 10 -4 probability of exceeding a response threshold in a tail of the distribution. Each method's performance is characterized with 10,000 random trials on a large number of diverse and challenging distributions. The best method and number of samples to use in a given circumstance depends on the uncertainty quantity to be estimated, the PDF character, and the desired reliability of bounding the true value. On the basis of this large data base and study, a strategy is proposed for selecting the method and number of samples for attaining reasonable credibility levels in bounding these types of quantities when sparse samples of random variables or functions are available from experiments or simulations.

97 MATHEMATICS AND COMPUTING↗

Removal of Stationary Sinusoidal Noise from Random Vibration Signals

In random vibration environments, sinusoidal line noise may appear in the vibration signal and can affect analysis of the resulting data. We studied two methods which remove stationary sine tones from random noise: a matrix inversion algorithm and a chirp-z transform algorithm. In addition, we developed new methods to determine the frequency of the tonal noise. The results show that both of the removal methods can eliminate sine tones in prefabricated random vibration data when the sine-to-random ratio is at least 0.25. For smaller ratios down to 0.02 only the matrix inversion technique can remove the tones, but the metrics to evaluate its effectiveness also degrade. We also found that using fast Fourier transforms best identified the tonal noise, and determined that band-pass-filtering the signals prior to the process improved sine removal. When applied to actual vibration test data, the methods were not as effective at removing harmonic tones, which we believe to be a result of mixed-phase sinusoidal noise.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Polynomial chaos expansions for dependent random variables

Polynomial chaos expansions (PCE) are well-suited to quantifying uncertainty in models parameterized by independent random variables. The assumption of independence leads to simple strategies for building multivariate orthonormal bases and for sampling strategies to evaluate PCE coefficients. In contrast, the application of PCE to models of dependent variables is much more challenging. Three approaches can be used to construct PCE of models of dependent variables. The first approach uses mapping methods where measure transformations, such as the Nataf and Rosenblatt transformation, can be used to map dependent random variables to independent ones; however we show that this can significantly degrade performance since the Jacobian of the map must be approximated. A second strategy is the class of dominating support methods. In these approaches a PCE is built using independent random variables whose distributional support dominates the support of the true dependent joint density; we provide evidence that this approach appears to produce approximations with suboptimal accuracy. A third approach, the novel method proposed here, uses Gram-Schmidt orthogonalization (GSO) to numerically compute orthonormal polynomials for the dependent random variables. This approach has been used successfully when solving differential equations using the intrusive stochastic Galerkin method, and in this paper we use GSO to build PCE using a non-intrusive stochastic collocation method. The stochastic collocation method treats the model as a black box and builds approximations of the input-output map from a set of samples. Building PCE from samples can introduce ill-conditioning which does not plague stochastic Galerkin methods. To mitigate this ill-conditioning we generate weighted Leja sequences, which are nested sample sets, to build accurate polynomial interpolants. We show that our proposed approach, GSO with weighted Leja sequences, produces PCE which are orders of magnitude more accurate than PCE constructed using mapping or dominating support methods.

97 MATHEMATICS AND COMPUTING↗

Quantum Random Number Generator (QRNG)

The Los Alamos QRNG is a hardware-based high-performance Random Number Generator capable of generating 200 Mbit/s or more of true random numbers. The device harvests entropy from fluctuations in an optical source that arise from quantum mechanical properties of light. These quantum effects are irreducibly random; the resulting numbers are unpredictable and beyond the influence of any adversary. Qrypt, Inc., launched in 2017, has amassed multiple quantum entropy sources to create high-quality random keys at scale. The company is engaging with Los Alamos through license and a Cooperative Research and Development Agreement to facilitate the transition of QRNG technology and deploy the technology into the marketplace.

97 MATHEMATICS AND COMPUTING↗

Random Circuits in the Black Hole Interior

In this paper, we present a quantitative holographic relation between a microscopic measure of randomness and the geometric length of the wormhole in the black hole interior. To this end, we perturb an AdS black hole with Brownian semiclassical sources, implementing the continuous version of a random quantum circuit for the black hole. We use the random circuit to prepare ensembles of states of the black hole whose semiclassical duals contain Einstein-Rosen (ER) caterpillars: long cylindrical wormholes with large numbers of matter inhomogeneities, of linearly growing length with the circuit time. In this setup, we show semiclassically that the ensemble of ER caterpillars of average length $k\ell_Δ$ and matter correlation scale $\ell_Δ$ forms an approximate quantum state $k$-design of the black hole. At exponentially long circuit times, the ensemble of ER caterpillars becomes polynomial-copy indistinguishable from a collection of random states of the black hole. We comment on the implications of these results for holographic circuit complexity and for the holographic description of the black hole interior.

FOS: Physical sciences↗

Theory of the Miscibility of Fullerenes in Random Copolymer Melts

We combine polymer integral equation theory and computational chemistry methods to study the interfacial structure, effective interactions, miscibility and spatial dispersion mechanism of fullerenes dissolved in specific random AB copolymer melts characterized by strong non-covalent electron donor-acceptor interactions with the nanofiller. A statistical mechanical basis is developed for designing random copolymers to optimize fullerene dispersion at intermediate copolymer compositions. Pair correlation calculations reveal a strong sensitivity of interfacial packing near the fullerene to copolymer composition and adsorption energy mismatch. The potential of mean force between fullerenes displays rich trends, often non-monotonic with copolymer composition, reflecting a non-additive competition between direct filler attractions and polymer-mediated bridging and steric stabilization. The spinodal phase diagrams are in qualitative agreement with recent solubility limit experimental observations on three systems, and testable predictions are made for other random copolymers. The distinctive non-monotonic variation of miscibility with copolymer composition is found to be primarily a consequence of composition-dependent, spatially short-range attractions between the A and B monomers with the fullerene. A remarkably rich, polymer-specific temperature dependence of the spinodal diagram is predicted which reflects the thermal sensitivity of spatial correlations which can result in fullerene miscibility either increasing or decreasing with cooling. The calculations are contrasted with a simpler effective homopolymer model and the random structure Flory-Huggins model. The former appears to be qualitatively reasonable but can incur large quantitative errors since it misses preferential packing of monomers near nanoparticles, while the latter appears to fail qualitatively due to its neglect of all spatial correlations.

Dadmun, Mark D↗

Shaping the spectrum of random-phase radar waveforms

The various technologies presented herein relate to generation of a desired waveform profile in the form of a spectrum of apparently random noise (e.g., white noise or colored noise), but with precise spectral characteristics. Hence, a waveform profile that could be readily determined (e.g., by a spoofing system) is effectively obscured. Obscuration is achieved by dividing the waveform into a series of chips, each with an assigned frequency, wherein the sequence of chips are subsequently randomized. Randomization can be a function of the application of a key to the chip sequence. During processing of the echo pulse, a copy of the randomized transmitted pulse is recovered or regenerated against which the received echo is correlated. Hence, with the echo energy range-compressed in this manner, it is possible to generate a radar image with precise impulse response.

47 OTHER INSTRUMENTATION↗

Dynamic defense and network randomization for computer systems

The various technologies presented herein relate to determining a network attack is taking place, and further to adjust one or more network parameters such that the network becomes dynamically configured. A plurality of machine learning algorithms are configured to recognize an active attack pattern. Notification of the attack can be generated, and knowledge gained from the detected attack pattern can be utilized to improve the knowledge of the algorithms to detect a subsequent attack vector(s). Further, network settings and application communications can be dynamically randomized, wherein artificial diversity converts control systems into moving targets that help mitigate the early reconnaissance stages of an attack. An attack(s) based upon a known static address(es) of a critical infrastructure network device(s) can be mitigated by the dynamic randomization. Network parameters that can be randomized include IP addresses, application port numbers, paths data packets navigate through the network, application randomization, etc.

97 MATHEMATICS AND COMPUTING↗

Vectorization of Random Number Generation and Reproducibility of Concurrent Particle Transport Simulation

Efficient random number generation with high quality statistical properties and exact reproducibility of Monte Carlo simulations are important requirements in many areas of computational science. VecRNG is a package providing pseudo-random number generation (pRNG) in the context of a new library VecMath. This library bundles up several general-purpose mathematical utilities, data structures, and algorithms having both SIMD and SIMT (GPUs) support based on VecCore.~Several state-of-the-art RNG algorithms are implemented as kernels supporting parallel generation of random numbers in scalar, vector, and Cuda workflows. In this report, we will present design considerations, implementation details, and computing performance of parallel pRNG engines on both CPU and GPU. Reproducibility of propagating multiple particles in parallel for HEP event simulation is demonstrated, using GeantV-based examples, for both sequential and fine-grain track-level concurrent simulation wor kflows. Strategies for efficient uses of vectorized pRNG and non-overlapping streams of random number sequences in concurrent computing environments is discussed as well.

Jun, S. Y.↗

C-SAW: a framework for graph sampling and random walk on GPUs

Many applications require to learn, mine, analyze and visualize large-scale graphs. These graphs are often too large to be addressed efficiently using conventional graph processing technologies. Fortunately, recent research efforts find out graph sampling and random walk, which significantly reduce the size of original graphs, can benefit the tasks of learning, mining, analyzing and visualizing large graphs by capturing the desirable graph properties. This paper introduces C-SAW, the first framework that accelerates Sampling and Random Walk framework on GPUs. Particularly, C-SAW makes three contributions: First, our framework provides a generic API which allows users to implement a wide range of sampling and random walk algorithms with ease. Second, offloading this framework on GPU, we introduce warp-centric parallel selection, and two novel optimizations for collision migration. Third, towards supporting graphs that exceed the GPU memory capacity, we introduce efficient data transfer optimizations for out-of-memory and multi-GPU sampling, such as workload-aware scheduling and batched multi-instance sampling. Taken together, our framework constantly outperforms the state of the art projects in addition to the capability of supporting a wide range of sampling and random walk algorithms.

97 MATHEMATICS AND COMPUTING↗

Programmable pseudo-random sequence generator for use with universal lidar and its associated method of operation

A pseudo-random sequence generator for use within a universal lidar system and its corresponding method of operation. The pseudo-random sequence generator uses synchronized shift registers that are in series Binary adders are provided. The signal output of each of the shift registers is tapped and directed to the binary adders. High-speed switches are provided between the shift registers and the binary adders. The switches are programmed to connect only two of the shift registers to the binary adders for each of the pseudo-random patterns being generated. The binary adders generate an output signal that is received by the first shift register. The signal propagates through all the shift registers to the last shift register. The last shift register outputs a pseudo-random sequence.

Datta, Shubhashish↗

Structured ground states of randomly interacting bosons

Bosonic degrees of freedom and their emergence as part of complex quantum many-body dynamics, symmetries, collective behavior, clustering, and phase transitions play an important role in modern studies of quantum systems. In this paper, we present a systematic study of many-boson systems governed by random interactions. Our findings show that ground states of randomly interacting bosons are not random, being dominated by a few collective configurations containing condensates of clusters.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Component evolution in general random intersection graphs

We analyze component evolution in general random intersection graphs (RIGs) and give conditions on existence and uniqueness of the giant component. Our techniques generalize the existing methods for analysis on component evolution in RIGs. That is, we analyze survival and extinction properties of a dependent, inhomogeneous Galton-Watson branching process on general RIGs. Our analysis relies on bounding the branching processes and inherits the fundamental concepts from the study on component evolution in Erdos-Renyi graphs. The main challenge becomes from the underlying structure of RIGs, when the number of offsprings follows a binomial distribution with a different number of nodes and different rate at each step during the evolution. RIGs can be interpreted as a model for large randomly formed non-metric data sets. Besides the mathematical analysis on component evolution, which we provide in this work, we perceive RIGs as an important random structure which has already found applications in social networks, epidemic networks, blog readership, or wireless sensor networks.

97 MATHEMATICS AND COMPUTING↗

Method of Green’s Potentials for Elliptic PDEs in Domains with Random Apertures

Problems with topological uncertainties appear in many fields ranging from nano-device engineering to the design of bridges. In many of such problems, a part of the domains boundaries is subjected to random perturbations making inefficient conventional schemes that rely on discretization of the whole domain. Here, we study elliptic PDEs in domains with boundaries comprised of a deterministic part and random apertures, and apply the method of modified potentials with Green’s kernels defined on the deterministic part of the domain. This approach allows to reduce the dimension of the original differential problem by reformulating it as a boundary integral equation posed on the random apertures only. The multilevel Monte Carlo method is then applied to this modified integral equation and its optimal ϵ -2 asymptotical complexity is shown. Finally, we provide the qualitative analysis of the proposed technique and support it with numerical results.

97 MATHEMATICS AND COMPUTING↗

Occupation Time of a Randomly Accelerated Particle on the Positive Half Axis: Results for the First Five Moments

In the random acceleration process a point particle is accelerated by Gaussian white noise with zero mean. Although several fundamental statistical properties of the motion have been analyzed in detail, the statistics of occupation times is still not well understood. We consider the occupation or residence time T{sub +} on the positive x axis of a particle which is randomly accelerated on the unbounded x axis for a time t. The first two moments of T{sub +} were recently derived by Ouandji Boutcheng et al. (J Stat Mech 053213:1–10, 2016). With an alternate approach utilizing basis functions which have proved useful in other studies of randomly accelerated motion, results for the first five moments are obtained in this paper.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Review of Recent Developments in the Random-Field Ising Model

A lot of progress has been made recently in our understanding of the random-field Ising model thanks to large-scale numerical simulations. In particular, it has been shown that, contrary to previous statements: the critical exponents for different probability distributions of the random fields and for diluted antiferromagnets in a field are the same. Therefore, critical universality, which is a perturbative renormalization-group prediction, holds beyond the validity regime of perturbation theory. Most notably, dimensional reduction is restored at five dimensions, i.e., the exponents of the random-field Ising model at five dimensions and those of the pure Ising ferromagnet at three dimensions are the same.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗