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 109 records · Page 6

Stress-Induced Orientation of Cocontinuous Nanostructures within Randomly End-Linked Copolymer Networks

Randomly end-linked copolymer networks (RECNs) provide a robust route to self-assembled cocontinuous nanostructures. Here, we study the orientation of cocontinuous polystyrene/poly(D,L-lactide) (PS/PLA) RECNs induced by uniaxial stretching above the glass transition temperatures of the components. Small-angle X-ray scattering (SAXS) reveals that the domains initially undergo nonaffine stretching at low strain (ε < 0.4), followed by domain rotation at larger strains, yielding a “soft elastic” response and providing a high degree of orientation. Transmission electron microscopy (TEM) tomography confirms that stretching leads to topological changes in the nanostructure, corresponding to reorganization of domain interfaces. The combination of orientation at the molecular and nanostructural levels provides substantial improvements in yield strength, toughness, and stiffness. In addition to possibilities for improving mechanical properties, cocontinuous nanostructures with controlled levels of orientation have potential in a variety of contexts including directional ion transport and energy absorption.

42 ENGINEERING↗

Coherent diffractive imaging using randomly coded masks

We experimentally demonstrate an extension to coherent diffractive imaging that encodes additional information through the use of a series of randomly coded masks, removing the need for typical object-domain constraints while guaranteeing a unique solution to the phase retrieval problem. Phase retrieval is performed using a numerical convex relaxation routine known as “PhaseCut,” an iterative algorithm known for its stability and for its ability to find the global solution, which can be found efficiently and which is robust to noise. The experiment is performed using a laser diode at 532.2 nm, enabling rapid prototyping for future X-ray synchrotron and even free electron laser experiments.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Accurate atomic quantum defects from particle–particle random phase approximation

The accuracy of calculations of atomic Rydberg excitations cannot be judged by the usual measures, such as mean unsigned errors of many transitions. We show how to use quantum defect (QD) theory to (a) separate errors due to approximate ionisation potentials, (b) extract smooth QDs to compare with experiment, and (c) quantify those defects with a few characteristic parameters. The particle–particle random phase approximation (pp-RPA) produces excellent Rydberg transitions that are an order of magnitude more accurate than those of time-dependent density functional theory with standard approximations. Here, we even extract reasonably accurate defects from the lithium Rydberg series, despite the reference being open-shell. Our methodology can be applied to any Rydberg series of excitations with four transitions or more to extract the underlying threshold energy and characteristic QD parameters. Our pp-RPA results set a demanding challenge for other excitation methods to match.

74 ATOMIC AND MOLECULAR PHYSICS↗

Is random access memory random?

Most software is contructed on the assumption that the programs and data are stored in random access memory (RAM). Physical limitations on the relative speeds of processor and memory elements lead to a variety of memory organizations that match processor addressing rate with memory service rate. These include interleaved and cached memory. A very high fraction of a processor's address requests can be satified from the cache without reference to the main memory. The cache requests information from main memory in blocks that can be transferred at the full memory speed. Programmers who organize algorithms for locality can realize the highest performance from these computers.

Denning, P. J.↗

On Random Partitions Induced by Random Maps

The partition lattice of the set [n] with respect to refinement is studied. Any map ϕ: [n] → [n], is associated with a partition of [n] by taking preimages of the elements. Assume that t partitions p{sub 1}, p{sub 2}, . . . , p{sub t} are chosen independently according to the uniform measure on the set of mappings [n] → [n]. It is shown that the probability for the coarsest refinement of all the partitions pi to be the finest partition {{1}, . . . , {n}} tends to 1 for any t ≥ 3 and to e{sup −1/2} for t = 2. It is also proved that the probability for the finest coarsening of the partitions pi to be the one-block partition tends to 1 as t(n) − log n→∞ and tends to 0 as t(n) − log n→−∞. The size of the maximal block of the finest coarsening of all the pi for a fixed t is also studied.

97 MATHEMATICS AND COMPUTING↗