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 451 records · Page 25

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↗

Universality for 1d Random Band Matrices: Sigma-Model Approximation

The paper continues the development of the rigorous supersymmetric transfer matrix approach to the random band matrices started in (J Stat Phys 164:1233–1260, 2016; Commun Math Phys 351:1009–1044, 2017). We consider random Hermitian block band matrices consisting of W×W random Gaussian blocks (parametrized by j,k∈Λ=[1,n]{sup d}∩ℤ{sup d}) with a fixed entry’s variance J{sub jk}=δ{sub j,k}W{sup −1}+βΔ{sub j,k}W{sup −2}, β>0 in each block. Taking the limit W→∞ with fixed n and β, we derive the sigma-model approximation of the second correlation function similar to Efetov’s one. Then, considering the limit β,n→∞, we prove that in the dimension d=1 the behaviour of the sigma-model approximation in the bulk of the spectrum, as β≫n, is determined by the classical Wigner–Dyson statistics.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Convergence in High Probability of the Quantum Diffusion in a Random Band Matrix Model

We consider Hermitian random band matrices H in d⩾1 dimensions. The matrix elements H{sub xy}, indexed by x,y∈Λ⊂ℤ{sup d}, are independent, uniformly distributed random variable if |x−y| is less than the band width W, and zero otherwise. We update the previous results of the converge of quantum diffusion in a random band matrix model from convergence of the expectation to convergence in high probability. The result is uniformly in the size |Λ| of the matrix.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Modeling of the Flows of Admixtures in a Random Layered Strip with Probable Arrangement of Inclusions Near the Boundaries of the Body

We study the random flow of admixtures in a two-phase stochastically inhomogeneous strip with the most probable arrangement of inclusions in the vicinity of the surfaces of the body. A mathematical model is formulated for the function of diffusion flow with nonzero constant initial concentration. A random diffusion flow is represented in the form of a Neumann series. The procedure of averaging of the random mass flow over the ensemble of phase configurations with arcsine distribution function is performed. The influence of the characteristics of the medium on the distribution of mass flow is analyzed. It is shown that if the diffusion coefficient of admixtures in the inclusion is higher than for the matrix, then the increase in the characteristic thickness of the layers causes a decrease in the value of the diffusion flow, whereas the mass flow in the entire body increases with the volume fraction of the inclusions.

97 MATHEMATICS AND COMPUTING↗

Crossover ensembles of random matrices and skew-orthogonal polynomials

Highlights: > We study crossover ensembles of Jacobi family of random matrices. > We consider correlations for orthogonal-unitary and symplectic-unitary crossovers. > We use the method of skew-orthogonal polynomials and quaternion determinants. > We prove universality of spectral correlations in crossover ensembles. > We discuss applications to quantum conductance and communication theory problems. - Abstract: In a recent paper (S. Kumar, A. Pandey, Phys. Rev. E, 79, 2009, p. 026211) we considered Jacobi family (including Laguerre and Gaussian cases) of random matrix ensembles and reported exact solutions of crossover problems involving time-reversal symmetry breaking. In the present paper we give details of the work. We start with Dyson's Brownian motion description of random matrix ensembles and obtain universal hierarchic relations among the unfolded correlation functions. For arbitrary dimensions we derive the joint probability density (jpd) of eigenvalues for all transitions leading to unitary ensembles as equilibrium ensembles. We focus on the orthogonal-unitary and symplectic-unitary crossovers and give generic expressions for jpd of eigenvalues, two-point kernels and n-level correlation functions. This involves generalization of the theory of skew-orthogonal polynomials to crossover ensembles. We also consider crossovers in the circular ensembles to show the generality of our method. In the large dimensionality limit, correlations in spectra with arbitrary initial density are shown to be universal when expressed in terms of a rescaled symmetry breaking parameter. Applications of our crossover results to communication theory and quantum conductance problems are also briefly discussed.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Stochastic modeling of random roughness in shock scattering problems: theory and simulations

Random rougness is omnipresent in engineering applications and may often affect performance in unexpected way. Here, we employ synergistically stochastic simulations and second-order stochastic perturbation analysis to study supersonic flow past a wedge with random rough surface. The roughness (of length $d$) starting at the wedge apex is modeled as stochastic process (with zero mean and correlation length $A$) obtained from a new stochastic differential equation. A multi-element probabilistic collocation method (ME-PCM) based on {\em sparse grids} is employed to solve the stochastic Euler equations while a WENO scheme is used to discretize the equations in two spatial dimensions. The perturbation analysis is used to verify the stochastic simulations and to provide insight for small values of $A$, where stochastic simulations become prohibitively expensive. % We show that the random roughness enhances the lift and drag forces on the wedge beyond the rough region, and this enhancement is proportional to $(d/A)^2$. The effects become more pronounced as the Mach number increases. These results can be used in designing smart rough skins for airfoils for maxiumum lift enhancement at a minimum drag penalty.

42 ENGINEERING↗

Randomized Phase 2 Trial of S1 and Oxaliplatin-Based Chemoradiotherapy With or Without Induction Chemotherapy for Esophageal Cancer

Purpose: To assess, in a randomized, phase 2 trial, the efficacy and safety of chemoradiotherapy with or without induction chemotherapy (ICT) of S1 and oxaliplatin for esophageal cancer. Patients and Methods: Patients with stage II, III, or IVA esophageal cancer were randomly allocated to either 2 cycles of ICT (oxaliplatin 130 mg/m{sup 2} on day 1 and S1 at 40 mg/m{sup 2} twice daily on days 1-14, every 3 weeks) followed by concurrent chemoradiotherapy (CCRT) (46 Gy, 2 Gy/d with oxaliplatin 130 mg/m{sup 2} on days 1 and 21 and S1 30 mg/m{sup 2} twice daily, 5 days per week during radiation therapy) and esophagectomy (arm A), or the same CCRT followed by esophagectomy without ICT (arm B). The primary endpoint was the pathologic complete response (pCR) rate. Results: A total of 97 patients were randomized (arm A/B, 47/50), 70 of whom underwent esophagectomy (arm A/B, 34/36). The intention-to-treat pCR rate was 23.4% (95% confidence interval [CI] 11.2-35.6%) in arm A and 38% (95% CI 24.5% to 51.5%) in arm B. With a median follow-up duration of 30.3 months, the 2-year progression-free survival rate was 58.4% in arm A and 58.6% in arm B, whereas the 2-year overall survival rate was 60.7% and 63.7%, respectively. Grade 3 or 4 thrombocytopenia during CCRT was more common in arm A than in arm B (35.4% vs 4.1%). The relative dose intensity of S1 (89.5% ± 20.6% vs 98.3% ± 5.2%, P=.005) and oxaliplatin (91.4% ± 16.8% vs 99.0% ± 4.2%, P=.007) during CCRT was lower in arm A compared with arm B. Three patients in arm A, compared with none in arm B, died within 90 days after surgery. Conclusions: Combination chemotherapy of S1 and oxaliplatin is an effective chemoradiotherapy regimen to treat esophageal cancer. However, we failed to show that the addition of ICT to the regimen can improve the pCR rate.

62 RADIOLOGY AND NUCLEAR MEDICINE↗

Pseudo-random number generation for Brownian Dynamics and Dissipative Particle Dynamics simulations on GPU devices

Highlights: {yields} Molecular Dynamics codes implemented on GPUs have achieved two-order of magnitude computational accelerations. {yields} Brownian Dynamics and Dissipative Particle Dynamics simulations require a large number of random numbers per time step. {yields} We introduce a method for generating small batches of pseudorandom numbers distributed over many threads of calculations. {yields} With this method, Dissipative Particle Dynamics is implemented on a GPU device without requiring thread-to-thread communication. - Abstract: Brownian Dynamics (BD), also known as Langevin Dynamics, and Dissipative Particle Dynamics (DPD) are implicit solvent methods commonly used in models of soft matter and biomolecular systems. The interaction of the numerous solvent particles with larger particles is coarse-grained as a Langevin thermostat is applied to individual particles or to particle pairs. The Langevin thermostat requires a pseudo-random number generator (PRNG) to generate the stochastic force applied to each particle or pair of neighboring particles during each time step in the integration of Newton's equations of motion. In a Single-Instruction-Multiple-Thread (SIMT) GPU parallel computing environment, small batches of random numbers must be generated over thousands of threads and millions of kernel calls. In this communication we introduce a one-PRNG-per-kernel-call-per-thread scheme, in which a micro-stream of pseudorandom numbers is generated in each thread and kernel call. These high quality, statistically robust micro-streams require no global memory for state storage, are more computationally efficient than other PRNG schemes in memory-bound kernels, and uniquely enable the DPD simulation method without requiring communication between threads.

97 MATHEMATICS AND COMPUTING↗