Search NASA⌕ Search

SEARCH · Search NASA

Results for “randomizer”

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 37 records · Page 2
All sourcesNASA NTRSDOE OSTI
DOE OSTI2018

Corrected Mean-Field Model for Random Sequential Adsorption on Random Geometric Graphs

A notorious problem in mathematics and physics is to create a solvable model for random sequential adsorption of non-overlapping congruent spheres in the d-dimensional Euclidean space with d≥2. Spheres arrive sequentially at uniformly chosen locations in space and are accepted only when there is no overlap with previously deposited spheres. Due to spatial correlations, characterizing the fraction of accepted spheres remains largely intractable. We study this fraction by taking a novel approach that compares random sequential adsorption in Euclidean space to the nearest-neighbor blocking on a sequence of clustered random graphs. This random network model can be thought of as a corrected mean-field model for the interaction graph between the attempted spheres. Using functional limit theorems, we characterize the fraction of accepted spheres and its fluctuations.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2020

Machine Learning Methods for Connection RTT and Loss Rate Estimation Using MPI Measurements Under Random Losses

Scientific computations are expected to be increasingly distributed across wide-area networks, and Message Passing Interface (MPI) has been shown to scale to support their communications over long distances. Application-level measurements of MPI operations reflect the connection Round-Trip Time (RTT) and loss rate, and machine learning methods have been previously developed to estimate them under deterministic periodic losses. In this paper, we consider more complex, random losses with unform, Poisson and Gaussian distributions. We study five disparate machine leaning methods, with linear and non-linear, and smooth and non-smooth properties, to estimate RTT and loss rate over 10Gbps connections with 0-366ms RTT. The diversity and complexity of these estimators combined with the randomness of losses and TCP’s non-linear response together rule out the selection of a single best among them; instead, we fuse them to retain their design diversity. Overall, the results show that accurate estimates can be generated at low loss rates but become inaccurate at loss rates 10% and higher, thereby illustrating both their strengths and limitations.

Generalization Bounds↗
DOE OSTI2017

Bayesian and variational Bayesian approaches for flows in heterogeneous random media

In this paper, we study porous media flows in heterogeneous stochastic media. We propose an efficient forward simulation technique that is tailored for variational Bayesian inversion. As a starting point, the proposed forward simulation technique decomposes the solution into the sum of separable functions (with respect to randomness and the space), where each term is calculated based on a variational approach. This is similar to Proper Generalized Decomposition (PGD). Next, we apply a multiscale technique to solve for each term (as in ) and, further, decompose the random function into 1D fields. As a result, our proposed method provides an approximation hierarchy for the solution as we increase the number of terms in the expansion and, also, increase the spatial resolution of each term. We use the hierarchical solution distributions in a variational Bayesian approximation to perform uncertainty quantification in the inverse problem. We conduct a detailed numerical study to explore the performance of the proposed uncertainty quantification technique and show the theoretical posterior concentration.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2017

Basis adaptation and domain decomposition for steady-state partial differential equations with random coefficients

We present a novel approach for solving steady-state stochastic partial differential equations in high-dimensional random parameter space. The proposed approach combines spatial domain decomposition with basis adaptation for each subdomain. The basis adaptation is used to address the curse of dimensionality by constructing an accurate low-dimensional representation of the stochastic PDE solution (probability density function and/or its leading statistical moments) in each subdomain. Restricting the basis adaptation to a specific subdomain affords finding a locally accurate solution. Then, the solutions from all of the subdomains are stitched together to provide a global solution. We support our construction with numerical experiments for a steady-state diffusion equation with a random spatially dependent coefficient. Our results show that accurate global solutions can be obtained with significantly reduced computational costs.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2019

Detection of random noise and anatomy of continuous seismic waveforms in dense array data near Anza California

We develop a methodology to separate continuous seismic waveforms into random noise (RN), not random noise (NRN) produced by earthquakes, wind, traffic and other sources of ground motions, and an undetermined mixture of signals. The analysis is applied to continuous records from a dense seismic array on the San Jacinto fault zone. To detect RN signals, we cut hourly waveforms into non-overlapping 1 s time windows and apply cross-correlations to separate RN candidates from outliers. The cross-correlation coefficients between different RN candidates fall into a tight range (i.e. 0.09–0.35), while cross-correlation coefficients of RN candidates with NRN signals (e.g. seismic or air-traffic events) are lower. The amplitude spectra of RN candidates have a well-defined level, while the amplitude spectra of other signals deviate from that level. Using these properties, we examine the amplitude spectra of moving time windows and cross-correlation coefficients with RN templates in each hour. The hourly RN is quasi-stationary and the results cluster tightly in the parameter space of cross-correlation coefficients and L2 norm deviations from the mean spectra of RN candidates. Time windows with parameters in this tight cluster are identified as RN, windows that deviate significantly from the RN cluster are identified as NRN and windows with values in between are identified as mixed signals. Several iterations on each hourly data are used to update and stabilize the selection of RN templates and mean noise spectra. For the days examined, the relative fractions of RN, NRN and mixed signals in local day (night) times are about 26 (42 percent), 40 (33 percent) and 34 percent (25 percent), respectively.

Geochemistry & Geophysics↗
DOE OSTI2019

Computing three-point correlation function randoms counts without the randoms catalogue

ABSTRACT As we move towards future galaxy surveys, the three-point statistics will be increasingly leveraged to enhance the constraining power of the data on cosmological parameters. An essential part of the three-point function estimation is performing triplet counts of synthetic data points in random catalogues. Since triplet counting algorithms scale at best as $\mathcal {O}(N^2\log N)$ with the number of particles and the random catalogues are typically at least 50 times denser than the data; this tends to be by far the most time-consuming part of the measurements. Here, we present a simple method of computing the necessary triplet counts involving uniform random distributions through simple one-dimensional integrals. The method speeds up the computation of the three-point function by orders of magnitude, eliminating the need for random catalogues, with the simultaneous pair and triplet counting of the data points alone being sufficient.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2019

Saturated random packing built of arbitrary polygons under random sequential adsorption protocol

Random packings and their properties are a popular and active field of research. Numerical algorithms that can efficiently generate them are useful tools in their study. This paper focuses on random packings produced according to the random sequential adsorption (RSA) protocol. Developing the idea presented by G. Zhang, where saturated random packings built of regular polygons were studied, we create an algorithm that generates strictly saturated packings built of any polygons. Then, the algorithm was used to determine the packing fractions for arbitrary triangles. In this work, the highest mean packing density, 0.552 814 ± 0.000 063, was observed for triangles of side lengths 0.63 : 1 : 1. Additionally, microstructural properties of such packings, kinetics of their growth, as well as distributions of saturated packing fractions and the number of RSA iterations needed to reach saturation were analyzed.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗
DOE OSTI2016

Simulating Fragmentation and Fluid-Induced Fracture in Disordered Media Using Random Finite-Element Meshes

Fracture and fragmentation are extremely nonlinear multiscale processes in which microscale damage mechanisms emerge at the macroscale as new fracture surfaces. Numerous numerical methods have been developed for simulating fracture initiation, propagation, and coalescence. In this paper, we present a computational approach for modeling pervasive fracture in quasi-brittle materials based on random close-packed Voronoi tessellations. Each Voronoi cell is formulated as a polyhedral finite element containing an arbitrary number of vertices and faces. Fracture surfaces are allowed to nucleate only at the intercell faces. Cohesive softening tractions are applied to new fracture surfaces in order to model the energy dissipated during fracture growth. The randomly seeded Voronoi cells provide a regularized discrete random network for representing fracture surfaces. The potential crack paths within the random network are viewed as instances of realizable crack paths within the continuum material. Mesh convergence of fracture simulations is viewed in a weak, or distributional, sense. The explicit facet representation of fractures within this approach is advantageous for modeling contact on new fracture surfaces and fluid flow within the evolving fracture network. Finally, applications of interest include fracture and fragmentation in quasi-brittle materials and geomechanical applications such as hydraulic fracturing, engineered geothermal systems, compressed-air energy storage, and carbon sequestration.

97 MATHEMATICS AND COMPUTING↗
NASA NTRS1973

Effects of vibration and shock on the performance of gas-bearing space-power Brayton cycle turbomachinery. Part 3: Sinusoidal and random vibration data reduction and evaluation, and random vibration probability analysis

The random vibration response of a gas bearing rotor support system has been experimentally and analytically investigated in the amplitude and frequency domains. The NASA Brayton Rotating Unit (BRU), a 36,000 rpm, 10 KWe turbogenerator had previously been subjected in the laboratory to external random vibrations, and the response data recorded on magnetic tape. This data has now been experimentally analyzed for amplitude distribution and magnetic tape. This data has now been experimentally analyzed for amplitude distribution and frequency content. The results of the power spectral density analysis indicate strong vibration responses for the major rotor-bearing system components at frequencies which correspond closely to their resonant frequencies obtained under periodic vibration testing. The results of amplitude analysis indicate an increasing shift towards non-Gaussian distributions as the input level of external vibrations is raised. Analysis of axial random vibration response of the BRU was performed by using a linear three-mass model. Power spectral densities, the root-mean-square value of the thrust bearing surface contact were calculated for specified input random excitation.

Tessarzik, J. M.↗
DOE OSTI2026

Generation of random geological models using multi-randomization for machine learning

Generating high-fidelity geological models is essential for advancing machine learning (ML) methods in automated seismic interpretation. For instance, seismic images paired with corresponding fault labels are foundational for ML-based fault detection from seismic migration sections. While several open-access datasets of random geological models exist, open-source tools specifically designed to produce large volumes of such models for ML applications remain scarce. To address this gap, we present RGM (Random Geological Model), an open-source software package for efficiently generating 2D and 3D synthetic geological models tailored for ML workflows. RGM supports the creation of diverse model components, including medium property distributions (P-/S-wave velocities and density), seismic reflectivity images (i.e., synthetic migration sections), relative geological time, and discrete fault attributes such as probability, dip, strike, rake, and displacement. It also accommodates the creation of complex geological features such as salt bodies and unconformities. The model generation algorithm employs a multi-randomization strategy, yielding an effectively infinite-dimensional model space that encompasses a wide range of geological scenarios and associated seismic features. Furthermore, RGM incorporates a method to generate synthetic elastic migration images using analytical elastic reflection coefficients combined with frequency-dependent scaling. This functionality enables the creation of training datasets for ML models that leverage elastic seismic images. RGM is implemented in modern object-oriented Fortran, allowing users to flexibly control statistical parameters governing model variability. We demonstrate the capability, performance, and geological realism of the package through comprehensive 2D and 3D examples.

58 GEOSCIENCES↗
DOE OSTI2023

Wetting Behavior of A -block- (B- random -C) Copolymers with Equal Block Surface Energies on Surfaces Functionalized with B- random -C Copolymers

To form nanopatterns with self-assembled block copolymers (BCPs), it is desirable to have through-film domains that are oriented perpendicular to the substrate. The domain orientation is determined by the interfacial interactions of the BCP domains with the substrate and with the free surface. Here, we use thin films of two different sets of BCPs with A-block-(B-random-C) architecture matched with a corresponding B-random-C copolymer nanocoating on the substrate to demonstrate two distinct wetting behaviors. The two sets of A-b-(B-r-C) BCPs are made by using thiol–epoxy click chemistry to functionalize polystyrene-block-poly(glycidyl methacrylate) with trifluoroethanethiol (TFET) and either 2-mercaptopyridine (2MP) or methyl thioglycolate (MTG). For each set of BCPs, the composition ratio of the two thiols in the BCP (φ 1 ) is found that results in the two blocks of the modified BCP having equal surface energies (Δγ air = 0). The corresponding B-r-C random copolymers were synthesized and used to modify the substrate, and the composition ratio (φ 2 ) values that resulted in the two blocks of the BCP having equal interfacial energy with the substrate (Δγ sub = 0) were determined with scanning electron microscopy. The correlation between each block’s γ sub value and the interaction parameter, χ, is employed to explain the different wetting behaviors of the two sets of BCPs. For the thiol pair 2MP and TFET, the values of φ 1 and φ 2 that lead to Δγ air = 0 and Δγ sub = 0, respectively, are significantly different. A similar difference was observed between the φ 1 and φ 2 values that lead to Δγ air = 0 and Δγ sub = 0 for the BCPs made with the thiol pair MTG and TFET. In the latter case, for Δγ sub = 0 two windows of φ 2 are identified, which can be explained by the thermodynamic interactions of the specific thiol pair and the A-b-(B-r-C) architecture.

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

Disk Density Tuning of a Maximal Random Packing

We introduce an algorithmic framework for tuning the spatial density of disks in a maximal random packing, without changing the sizing function or radii of disks. Starting from any maximal random packing such as a Maximal Poisson-disk Sampling (MPS), we iteratively relocate, inject (add), or eject (remove) disks, using a set of three successively more-aggressive local operations. We may achieve a user-defined density, either more dense or more sparse, almost up to the theoretical structured limits. The tuned samples are conflict-free, retain coverage maximality, and, except in the extremes, retain the blue noise randomness properties of the input. We change the density of the packing one disk at a time, maintaining the minimum disk separation distance and the maximum domain coverage distance required of any maximal packing. These properties are local, and we can handle spatially-varying sizing functions. Using fewer points to satisfy a sizing function improves the efficiency of some applications. We apply the framework to improve the quality of meshes, removing non-obtuse angles; and to more accurately model fiber reinforced polymers for elastic and failure simulations.

97 MATHEMATICS AND COMPUTING↗
NASA NTRS1971

Concepts for a theoretical and experimental study of lifting rotor random loads and vibrations. Phase 5A: Effects of torsional blade flexibility on single blade random gust response statistics

Quasi-steady aerodynamics were assumed, as well as a torsion mode where the amplitude is proportional to the distance from the rotor center. Aerodynamic torsional moment inputs are limited to the region of reverse flow where the aerodynamic center and the section center of gravity are separated by half the blade chord. Thus negligible effects of blade torsional flexibility are obtained for rotor conditions with negligible reverse flow effects. Numerical examples refer to conditions with 1.6 rotor advance ratio. It was found that the random flapping response is only moderately affected by torsional flexibility. However large random torsional loads and deflections occur even if flapping is completely suppressed. The coupling of the actual flapping motion into the blade torsional motion produces a substantial increase in the random torsional loads or deflections.

Hohenemser, K. H.↗
NASA NTRS1972

Concepts for a theoretical and experimental study of lifting rotor random loads and vibrations. Phase 6-A: Effects of blade torsion, of blade flap bending flexibility and of rotor support flexibility on rotor stability and random response

The effects of lifting rotor blade torsion, blade flap bending flexibility and rotor support flexibility on rotor stability and random response are described. The subjects discussed are: (1) blade representation and method of analysis, (2) random gust response statistics for coupled torsion-flapping rotor blade vibrations, (3) flap bending corrections to the rigid blade analysis of lifting rotors, and (4) effects of rotor support flexibility. The response of linear periodically time varying systems to random excitation is examined.

Hohenemser, K. H.↗
NASA NTRS2009

A Comparative Study of Randomized Constraint Solvers for Random-Symbolic Testing

The complexity of constraints is a major obstacle for constraint-based software verification. Automatic constraint solvers are fundamentally incomplete: input constraints often build on some undecidable theory or some theory the solver does not support. This paper proposes and evaluates several randomized solvers to address this issue. We compare the effectiveness of a symbolic solver (CVC3), a random solver, three hybrid solvers (i.e., mix of random and symbolic), and two heuristic search solvers. We evaluate the solvers on two benchmarks: one consisting of manually generated constraints and another generated with a concolic execution of 8 subjects. In addition to fully decidable constraints, the benchmarks include constraints with non-linear integer arithmetic, integer modulo and division, bitwise arithmetic, and floating-point arithmetic. As expected symbolic solving (in particular, CVC3) subsumes the other solvers for the concolic execution of subjects that only generate decidable constraints. For the remaining subjects the solvers are complementary.

Takaki, Mitsuo↗