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 397 records · Page 22

Random Sampling Process Leads to Overestimation of β-Diversity of Microbial Communities

The site-to-site variability in species composition, known as β-diversity, is crucial to understanding spatiotemporal patterns of species diversity and the mechanisms controlling community composition and structure. However, quantifying β-diversity in microbial ecology using sequencing-based technologies is a great challenge because of a high number of sequencing errors, bias, and poor reproducibility and quantification. Herein, based on general sampling theory, a mathematical framework is first developed for simulating the effects of random sampling processes on quantifying β-diversity when the community size is known or unknown. Also, using an analogous ball example under Poisson sampling with limited sampling efforts, the developed mathematical framework can exactly predict the low reproducibility among technically replicate samples from the same community of a certain species abundance distribution, which provides explicit evidences of random sampling processes as the main factor causing high percentages of technical variations. In addition, the predicted values under Poisson random sampling were highly consistent with the observed low percentages of operational taxonomic unit (OTU) overlap (<30% and <20% for two and three tags, respectively, based on both Jaccard and Bray-Curtis dissimilarity indexes), further supporting the hypothesis that the poor reproducibility among technical replicates is due to the artifacts associated with random sampling processes. Finally, a mathematical framework was developed for predicting sampling efforts to achieve a desired overlap among replicate samples. Our modeling simulations predict that several orders of magnitude more sequencing efforts are needed to achieve desired high technical reproducibility. These results suggest that great caution needs to be taken in quantifying and interpreting β-diversity for microbial community analysis using next-generation sequencing technologies.

59 BASIC BIOLOGICAL SCIENCES↗

A Quantum Random Number Generator Based on the 100-Mbit/s Poisson Photocount Statistics

A quantum random number generator is experimentally realized. The initial randomness source is a sequence of photocounts from quasi-single-photon radiation detected with a SiPM (Silicon Photo Multiplier) silicon avalanche detector array. The use of a SiPM provides a reliable control of the quantum nature of the Poisson photocount statistics. A special algorithm with nonexponential complexity allows one to extract from the Poisson process all the randomness contained in it, namely, a random uniform sequence of 0 and 1.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Local polynomial chaos expansion for linear differential equations with high dimensional random inputs

In this paper we present a localized polynomial chaos expansion for partial differential equations (PDE) with random inputs. In particular, we focus on time independent linear stochastic problems with high dimensional random inputs, where the traditional polynomial chaos methods, and most of the existing methods, incur prohibitively high simulation cost. Furthermore, the local polynomial chaos method employs a domain decomposition technique to approximate the stochastic solution locally. In each subdomain, a subdomain problem is solved independently and, more importantly, in a much lower dimensional random space. In a postprocesing stage, accurate samples of the original stochastic problems are obtained from the samples of the local solutions by enforcing the correct stochastic structure of the random inputs and the coupling conditions at the interfaces of the subdomains. Overall, the method is able to solve stochastic PDEs in very large dimensions by solving a collection of low dimensional local problems and can be highly efficient. In our paper we present the general mathematical framework of the methodology and use numerical examples to demonstrate the properties of the method.

97 MATHEMATICS AND COMPUTING↗

Fast estimation of the look-elsewhere effect using Gaussian random fields

Abstract We discuss the use of Gaussian random fields to estimate the look-elsewhere effect correction. We show that Gaussian random fields can be used to model the null-hypothesis significance maps from a large set of statistical problems commonly encountered in physics, such as template matching and likelihood ratio tests. Some specific examples are searches for dark matter using pixel arrays, searches for astronomical transients, and searches for fast-radio bursts. Gaussian random fields can be sampled efficiently in the frequency domain, and the excursion probability can be fitted with these samples to extend any estimation of the look-elsewhere effect to lower p values. In addition, in cases where the Gaussian random field is stationary and the parameter space is Euclidean, the look-elsewhere effect correction can be computed analytically. We demonstrate these methods using two example template matching problems. Finally, we apply these methods to estimate the trial factor of a $$4^3$$ 4 3 accelerometer array for the detection of dark matter tracks in the Windchime project. When a global significance of $$3\sigma $$ 3 σ is required, the estimated trial factor for such an accelerometer array is $$10^{14}$$ 10 14 for a one-second search, and $$10^{22}$$ 10 22 for a 1-year search.

Qin, Juehang (ORCID:0000000182288949)↗

The price of privately releasing contingency tables, and the spectra of random matrices with correlated rows

Contingency tables are the method of choice of government agencies for releasing statistical summaries of categorical data. In this paper, we consider lower bounds on how much distortion (noise) is necessary in these tables to provide privacy guarantees when the data being summarized is sensitive. We extend a line of recent work on lower bounds on noise for private data analysis [10, 13. 14, 15] to a natural and important class of functionalities. Our investigation also leads to new results on the spectra of random matrices with correlated rows. Consider a database D consisting of n rows (one per individual), each row comprising d binary attributes. For any subset of T attributes of size |T| = k, the marginal table for T has 2{sup k} entries; each entry counts how many times in the database a particular setting of these attributes occurs. Imagine an agency that wishes to release all (d/k) contingency tables for a given database. For constant k, previous work showed that distortion {tilde {Omicron}}(min{l_brace}n, (n{sup 2}d){sup 1/3}, {radical}d{sup k}{r_brace}) is sufficient for satisfying differential privacy, a rigorous definition of privacy that has received extensive recent study. Our main contributions are: (1) For {epsilon}- and ({epsilon}, {delta})-differential privacy (with {epsilon} constant and {delta} = 1/poly(n)), we give a lower bound of {tilde {Omega}}(min{l_brace}{radical}n, {radical}d{sup k}{r_brace}), which is tight for n = {tilde {Omega}}(d{sup k}). Moreover, for a natural and popular class of mechanisms based on additive noise, our bound can be strengthened to {Omega}({radical}d{sup k}), which is tight for all n. Our bounds extend even to non-constant k, losing roughly a factor of {radical}2{sup k} compared to the best known upper bounds for large n. (2) We give efficient polynomial time attacks which allow an adversary to reconstruct sensitive infonnation given insufficiently perturbed contingency table releases. For constant k, we obtain a lower bound of {tilde {Omega}}(min{l_brace}{radical}n, {radical}d{sup k}{r_brace}) that applies to a large class of privacy notions, including K-anonymity (along with its variants) and differential privacy. In contrast to our bounds for differential privacy, this bound (a) is shown only for constant k, but (b) is tight for all values of n when k is constant. (3) Our reconstruction-based attacks require a new lower bound on the least singular values of random matrices with correlated rows. For a constant k, consider a matrix M with (d/k) rows which are formed by taking all possible k-way entry-wise products of an underlying set of d random vectors. We show that even for nearly square matrices with d{sup k}/log d columns, the least singular value is {Omega}({radical}d{sup k}) with high probability - asymptotically, the same bound as one gets for a matrix with independent rows. The proof requires several new ideas for analyzing random matrices and could be of independent interest.

97 MATHEMATICS AND COMPUTING↗

Dynamic Response of an Optomechanical System to a Stationary Random Excitation in the Time Domain

Modern electro-optical instruments are typically designed with assemblies of optomechanical members that support optics such that alignment is maintained in service environments that include random vibration loads. This paper presents a nonlinear numerical analysis that calculates statistics for the peak lateral response of optics in an optomechanical sub-assembly subject to random excitation of the housing. The work is unique in that the prior art does not address peak response probability distribution for stationary random vibration in the time domain for a common lens-retainer-housing system with Coulomb damping. Analytical results are validated by using displacement response data from random vibration testing of representative prototype sub-assemblies. A comparison of predictions to experimental results yields reasonable agreement. The Type I Asymptotic form provides the cumulative distribution function for peak response probabilities. Probabilities are calculated for actual lens centration tolerances. The probability that peak response will not exceed the centration tolerance is greater than 80% for prototype configurations where the tolerance is high (on the order of 30 micrometers). Conversely, the probability is low for those where the tolerance is less than 20 micrometers. The analysis suggests a design paradigm based on the influence of lateral stiffness on the magnitude of the response.

Palmer, Jeremy A.↗

Ranger-based Iterative Random Forest

Iterative Random Forest (iRF) is an improvement upon the classic Random Forest, using weighted iterations to distill the forests. Ranger is a C++ implementation of random forest or recursive partitioning, particularly suited for high dimensional data. Ranger-Based iRF uses Ranger as a base Random Forest codebase upon which iterative and scalability aspects have been added.

Jacobson, DanielA↗

Proposal for a quantum random number generator using coherent light and a non-classical observable

The prototype quantum random number (random bit) generator (QRNG) consists of one photon at a time falling on a 50:50 beam splitter followed by random detection in one or the other output beams due to the irreducible probabilistic nature of quantum mechanics. Due to the difficulties in producing single photons on demand, in practice, pulses of weak coherent (laser) light are used. In this paper, we take a different approach, one that uses moderate coherent light. It is shown that a QRNG can be implemented by performing photon-number parity measurements. For moderate coherent light, the probabilities of obtaining even or odd parity in photon counts are 0.5 each. Photon counting with single-photon resolution can be performed through use of a cascade of beam splitters and single-photon detectors, as was done recently in a photon-number parity-based interferometry experiment involving coherent light. We highlight the point that unlike most quantum-based random number generators, our proposal does not require the use of classical de-biasing algorithms or post-processing of the generated bit sequence.

Gerry, Christopher C.↗

A Provably Accurate Randomized Sampling Algorithm for Logistic Regression

In statistics and machine learning, logistic regression is a widely-used supervised learning technique primarily employed for binary classification tasks. When the number of observations greatly exceeds the number of predictor variables, we present a simple, randomized sampling-based algorithm for logistic regression problem that guarantees high-quality approximations to both the estimated probabilities and the overall discrepancy of the model. Our analysis builds upon two simple structural conditions that boil down to randomized matrix multiplication, a fundamental and well-understood primitive of randomized numerical linear algebra. We analyze the properties of estimated probabilities of logistic regression when leverage scores are used to sample observations, and prove that accurate approximations can be achieved with a sample whose size is much smaller than the total number of observations. To further validate our theoretical findings, we conduct comprehensive empirical evaluations. Overall, our work sheds light on the potential of using randomized sampling approaches to efficiently approximate the estimated probabilities in logistic regression, offering a practical and computationally efficient solution for large-scale datasets.

Chowdhury, Agniva↗

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↗

Simulation of flight maneuver-load distributions by utilizing stationary, non-Gaussian random load histories

Random numbers were generated with the aid of a digital computer and transformed such that the probability density function of a discrete random load history composed of these random numbers had one of the following non-Gaussian distributions: Poisson, binomial, log-normal, Weibull, and exponential. The resulting random load histories were analyzed to determine their peak statistics and were compared with cumulative peak maneuver-load distributions for fighter and transport aircraft in flight.

Leybold, H. A.↗

Generation of random hypersurfaces.

A technique to generate multidimensional random hypersurfaces with given statistical properties numerically on a digital computer is discussed in this paper. The technique is based on the linear filter theory. Using this technique, two-dimensional random surfaces are generated to illustrate the procedure. Statistics of these two-dimensional random surfaces are presented. Possible applications of these random surfaces in various physical problems are discussed.

Youakim, M. Y.↗