Search NASA⌕ Search

SEARCH · Search NASA

Results for “random”

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 811 records · Page 45

Multi-degree of Freedom Energy Analysis for Identification of Failure Risk in Structural Components Subjected to Random Vibration and Shock Loading

When designing or analyzing a mechanical system, energy quantities provide insight into the severity of shock and vibration environments; however, the energy methods in the literature do not address localized behavior because energy quantities are usually computed for an entire structure. The main objective of this paper is to show how to compute the energy in the components of a mechanical system. The motivation for this work is that most systems fail functionally due to component failure, not because the primary structure was overloaded, and the ability to easily compute the spatial distribution of energy helps identify failure sensitive components. The quantity of interest is input energy. That input energy can be decoupled modally is well known. What is less appreciated is that input energy can be computed at the component level exactly, using the component effective modal mass. We show the steady state input energy can be decomposed both spatially and modally and computed using input power spectra. A numerical example illustrates the spatial and modal decomposition of input energy and its utility in identifying components at risk of damage in random vibration and shock environments. Our work shows that the modal properties of the structure and the spectral content of the input must be considered together to assess damage risk. Because input energy includes absorbed energy as well as relative kinetic energy and dissipated energy, it is the recommended energy quantity for assessing the severity for both random vibration and shock environments on a structure.

42 ENGINEERING↗

SU-F-BRD-09: A Random Walk Model Algorithm for Proton Dose Calculation

Purpose: To develop a random walk model algorithm for calculating proton dose with balanced computation burden and accuracy. Methods: Random walk (RW) model is sometimes referred to as a density Monte Carlo (MC) simulation. In MC proton dose calculation, the use of Gaussian angular distribution of protons due to multiple Coulomb scatter (MCS) is convenient, but in RW the use of Gaussian angular distribution requires an extremely large computation and memory. Thus, our RW model adopts spatial distribution from the angular one to accelerate the computation and to decrease the memory usage. From the physics and comparison with the MC simulations, we have determined and analytically expressed those critical variables affecting the dose accuracy in our RW model. Results: Besides those variables such as MCS, stopping power, energy spectrum after energy absorption etc., which have been extensively discussed in literature, the following variables were found to be critical in our RW model: (1) inverse squared law that can significantly reduce the computation burden and memory, (2) non-Gaussian spatial distribution after MCS, and (3) the mean direction of scatters at each voxel. In comparison to MC results, taken as reference, for a water phantom irradiated by mono-energetic proton beams from 75 MeV to 221.28 MeV, the gamma test pass rate was 100% for the 2%/2mm/10% criterion. For a highly heterogeneous phantom consisting of water embedded by a 10 cm cortical bone and a 10 cm lung in the Bragg peak region of the proton beam, the gamma test pass rate was greater than 98% for the 3%/3mm/10% criterion. Conclusion: We have determined key variables in our RW model for proton dose calculation. Compared with commercial pencil beam algorithms, our RW model much improves the dose accuracy in heterogeneous regions, and is about 10 times faster than MC simulations.

60 APPLIED LIFE SCIENCES↗

Mediastinal lymph node detection and station mapping on chest CT using spatial priors and random forest

Purpose: To develop an automated system for mediastinal lymph node detection and station mapping for chest CT. Methods: The contextual organs, trachea, lungs, and spine are first automatically identified to locate the region of interest (ROI) (mediastinum). The authors employ shape features derived from Hessian analysis, local object scale, and circular transformation that are computed per voxel in the ROI. Eight more anatomical structures are simultaneously segmented by multiatlas label fusion. Spatial priors are defined as the relative multidimensional distance vectors corresponding to each structure. Intensity, shape, and spatial prior features are integrated and parsed by a random forest classifier for lymph node detection. The detected candidates are then segmented by the following curve evolution process. Texture features are computed on the segmented lymph nodes and a support vector machine committee is used for final classification. For lymph node station labeling, based on the segmentation results of the above anatomical structures, the textual definitions of mediastinal lymph node map according to the International Association for the Study of Lung Cancer are converted into patient-specific color-coded CT image, where the lymph node station can be automatically assigned for each detected node. Results: The chest CT volumes from 70 patients with 316 enlarged mediastinal lymph nodes are used for validation. For lymph node detection, their system achieves 88% sensitivity at eight false positives per patient. For lymph node station labeling, 84.5% of lymph nodes are correctly assigned to their stations. Conclusions: Multiple-channel shape, intensity, and spatial prior features aggregated by a random forest classifier improve mediastinal lymph node detection on chest CT. Using the location information of segmented anatomic structures from the multiatlas formulation enables accurate identification of lymph node stations.

60 APPLIED LIFE SCIENCES↗

PlasmidHostFinder: Prediction of Plasmid Hosts Using Random Forest

Plasmids play a major role facilitating the spread of antimicrobial resistance between bacteria. Understanding the host range and dissemination trajectories of plasmids is critical for surveillance and prevention of antimicrobial resistance. Identification of plasmid host ranges could be improved using automated pattern detection methods compared to homology-based methods due to the diversity and genetic plasticity of plasmids. In this study, we developed a method for predicting the host range of plasmids using machine learning—specifically, random forests. We trained the models with 8,519 plasmids from 359 different bacterial species per taxonomic level; the models achieved Matthews correlation coefficients of 0.662 and 0.867 at the species and order levels, respectively. Our results suggest that despite the diverse nature and genetic plasticity of plasmids, our random forest model can accurately distinguish between plasmid hosts. This tool is available online through the Center for Genomic Epidemiology (https://cge.cbs.dtu.dk/services/PlasmidHostFinder/).

59 BASIC BIOLOGICAL SCIENCES↗

Equations for the distributions of functionals of a random-walk trajectory in an inhomogeneous medium

Based on the random-trap model and using the mean-field approximation, we derive an equation that allows the distribution of a functional of the trajectory of a particle making random walks over inhomogeneous-lattice site to be calculated. The derived equation is a generalization of the Feynman-Kac equation to an inhomogeneous medium. We also derive a backward equation in which not the final position of the particle but its position at the initial time is used as an independent variable. As an example of applying the derived equations, we consider the one-dimensional problem of calculating the first-passage time distribution. We show that the average first-passage times for homogeneous and inhomogeneous media with identical diffusion coefficients coincide, but the variance of the distribution for an inhomogeneous medium can be many times larger than that for a homogeneous one.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Subcritical Small-Scale Dynamo in a Helical Random Flow

The possibility of the growth of a small-scale dynamo in a random flow with a weak mirror asymmetry under subcritical generation conditions is investigated. We show that the appearance of an asymmetry in a flow with nonzero helicity leads to the generation of small-scale periodic perturbations. These perturbations, in turn, support active field generation on small scales. We describe the properties of this support, the generation rate, and the characteristic scales dependent on the velocity of the random flow and the degree of its helicity. Transferring the problem to the spectral domain, we demonstrate the formation of a two-component small- and large-scale spectrum that consists of a peak localized on large scales and power laws at large and small k. The possibility of directly checking the spectral properties being described in subcritical laboratory MHD conditions is specially noted.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Exactly constructing model of quantum mechanics with random environment

Dissipation and decoherence, interaction with the random media, continuous measurements and many other complicated problems of open quantum systems are a result of interaction of quantum system with the random environment. These problems mathematically are described in terms of complex probabilistic processes (CPP). Note that CPP satisfies the stochastic differential equation (SDE) of Langevin-Schroedinger(L-Sch)type, and is defined on the extended space R{sup 1} - R{sub {l_brace}{gamma}{r_brace}}, where R{sup 1} and R{sub {l_brace}{gamma}{r_brace}} are the Euclidean and the functional spaces, correspondingly. For simplicity, the model of 1D quantum harmonic oscillator (QHO) with the stochastic environment is considered. On the basis of orthogonal CPP, the method of stochastic density matrix (SDM) is developed. By S DM method, the thermodynamical potentials, such as the nonequilibrium entropy and the energy of the 'ground state' are constructed in a closed form. The expressions for uncertain relations and Wigner function depending on interaction's constant between 1D QHO and the environment are obtained.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

The melting phenomenon in random-walk model of DNA

The melting phenomenon in a double-stranded homopolypeptide is considered. The relative distance between the corresponding monomers of two polymer chains is modeled by the two-dimensional random walk on the square lattice. Returns of the random walk to the origin describe the formation of hydrogen bonds between complementary units. To take into account the two competing interactions of monomers inside the chains, we obtain a completely denatured state at finite temperature T{sub c}.

60 APPLIED LIFE SCIENCES↗

Phonons, Diffusons, and the Boson Peak in Two-Dimensional Lattices with Random Bonds

Within the model of stable random matrices possessing translational invariance, a two-dimensional (on a square lattice) disordered oscillatory system with random strongly fluctuating bonds is considered. By a numerical analysis of the dynamic structure factor S(q, ω), it is shown that vibrations with frequencies below the Ioffe-Regel frequency ω{sub IR} are ordinary phonons with a linear dispersion law ω(q) ∝ q and a reciprocal lifetime δ~ q{sup 3}. Vibrations with frequencies above ω{sub IR}, although being delocalized, cannot be described by plane waves with a definite dispersion law ω(q). They are characterized by a diffusion structure factor with a reciprocal lifetime δ ~ q{sup 2}, which is typical of a diffusion process. In the literature, they are often referred to as diffusons. It is shown that, as in the three-dimensional model, the boson peak at the frequency ωb in the reduced density of vibrational states g(ω)/ω is on the order of the frequency ω{sub IR}. It is located in the transition region between phonons and diffusons and is proportional to the Young’s modulus of the lattice, ω{sub b}≃E.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

A Multilevel, Hierarchical Sampling Technique for Spatially Correlated Random Fields

In this paper, we propose an alternative method to generate samples of a spatially correlated random field with applications to large-scale problems for forward propagation of uncertainty. A classical approach for generating these samples is the Karhunen--Loève (KL) decomposition. However, the KL expansion requires solving a dense eigenvalue problem and is therefore computationally infeasible for large-scale problems. Sampling methods based on stochastic partial differential equations provide a highly scalable way to sample Gaussian fields, but the resulting parametrization is mesh dependent. We propose a multilevel decomposition of the stochastic field to allow for scalable, hierarchical sampling based on solving a mixed finite element formulation of a stochastic reaction-diffusion equation with a random, white noise source function. Lastly, numerical experiments are presented to demonstrate the scalability of the sampling method as well as numerical results of multilevel Monte Carlo simulations for a subsurface porous media flow application using the proposed sampling method.

97 MATHEMATICS AND COMPUTING↗

Hypergraph Random Walks, Laplacians, and Clustering

We propose a flexible framework for clustering hypergraph-structured data based on recently proposed random walks utilizing edge-dependent vertex weights. When incorporating edge-dependent vertex weights (EDVW), a weight is associated with each vertex-hyperedge pair, yielding a weighted incidence matrix of the hypergraph. Such weightings have been utilized in term-document representations of text data sets. We explain how random walks with EDVW serve to construct different hypergraph Laplacian matrices, and then develop a suite of clustering methods that use these incidence matrices and Laplacians for hypergraph clustering. Using 20Newsgroup, U.S. patent, Reuters' Corpus Volume 1, and genetics data sets, we compare the performance of these clustering algorithms experimentally against a variety of existing hypergraph clustering methods. We show that the proposed methods produce higher-quality clusters.

hypergraphs, clustering, laplacian, random walk, M↗

Single-frame far-field diffractive imaging with randomized illumination

Contains a transmission ptychography dataset collected from a chrome on glass Siemens star under optical illumination. The probe is generated by a randomized zone plate under illumination from a spatially filtered green laser. A single diffraction pattern was removed from the dataset and reported in a separate cxi file. In addition, a single exposure collected after manually defocusing the probe is reported. The ptychography dataset is used for calibration of the probe function, and the remaining diffraction patterns can be reconstructed via randomized probe imaging.

Ptychography, Randomized Probe Imaging↗

Single-frame far-field diffractive imaging with randomized illumination

Contains two transmission ptychography datasets, one collected from a Siemens star, and the second from an Fe/Gd multilayer. Both samples are under illumination from the same randomized zone plate. Each dataset has a single diffraction pattern removed, and these patterns are reported in a separate cxi file. Either ptychography dataset can be used for calibration of the probe function, and the remaining diffraction patterns can be reconstructed via randomized probe imaging.

BESSY II↗

Randomized methods to characterize large-scale vortical flow networks

We demonstrate the effective use of randomized methods for linear algebra to perform network-based analysis of complex vortical flows. Network theoretic approaches can reveal the connectivity structures among a set of vortical elements and analyze their collective dynamics. These approaches have recently been generalized to analyze high-dimensional turbulent flows, for which network computations can become prohibitively expensive. In this work, we propose efficient methods to approximate network quantities, such as the leading eigendecomposition of the adjacency matrix, using randomized methods. Specifically, we use the Nyström method to approximate the leading eigenvalues and eigenvectors, achieving significant computational savings and reduced memory requirements. The effectiveness of the proposed technique is demonstrated on two high-dimensional flow fields: two-dimensional flow past an airfoil and two-dimensional turbulence. We find that quasi-uniform column sampling outperforms uniform column sampling, while both feature the same computational complexity.

97 MATHEMATICS AND COMPUTING↗

"Spectrally gapped" random walks on networks: a Mean First Passage Time formula

We derive an approximate but explicit formula for the Mean First Passage Time of a random walker between a source and a target node of a directed and weighted network. The formula does not require any matrix inversion, and it takes as only input the transition probabilities into the target node. It is derived from the calculation of the average resolvent of a deformed ensemble of random sub-stochastic matrices H=\langle H\rangle +\delta H H = ⟨ H ⟩ + δ H , with \langle H\rangle ⟨ H ⟩ rank- 1 1 and non-negative. The accuracy of the formula depends on the spectral gap of the reduced transition matrix, and it is tested numerically on several instances of (weighted) networks away from the high sparsity regime, with an excellent agreement.

97 MATHEMATICS AND COMPUTING↗

Photoionization of Atomic Systems Using the Random-Phase Approximation Including Relativistic Interactions

Approximation methods are unavoidable in solving a many-electron problem. One of the most successful approximations is the random-phase approximation (RPA). Miron Amusia showed that it can be used successfully to describe atomic photoionization processes of many-electron atomic systems. In this article, the historical reasons behind the term “random-phase approximation” are revisited. A brief introduction to the relativistic RPA (RRPA) developed by Walter Johnson and colleagues is provided and some of its illustrative applications are presented.

74 ATOMIC AND MOLECULAR PHYSICS↗

Random Test Run Length and Effectiveness

A poorly understood but important factor in many applications of random testing is the selection of a maximum length for test runs. Given a limited time for testing, it is seldom clear whether executing a small number of long runs or a large number of short runs maximizes utility. It is generally expected that longer runs are more likely to expose failures -- which is certainly true with respect to runs shorter than the shortest failing trace. However, longer runs produce longer failing traces, requiring more effort from humans in debugging or more resources for automated minimization. In testing with feedback, increasing ranges for parameters may also cause the probability of failure to decrease in longer runs. We show that the choice of test length dramatically impacts the effectiveness of random testing, and that the patterns observed in simple models and predicted by analysis are useful in understanding effects observed.

software testing↗