Search NASA⌕ Search

SEARCH · Search NASA

Results for “randomized algorithm”

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 1,135 records · Page 63

Solving structure with sparse, randomly-oriented x-ray data

Single-particle imaging experiments of biomolecules at x-ray free-electron lasers (XFELs) require processing hundreds of thousands of images that contain very few x-rays. Each low-fluence image of the diffraction pattern is produced by a single, randomly oriented particle, such as a protein. We demonstrate the feasibility of recovering structural information at these extremes using low-fluence images of a randomly oriented 2D x-ray mask. Successful reconstruction is obtained with images averaging only 2.5 photons per frame, where it seems doubtful there could be information about the state of rotation, let alone the image contrast. This is accomplished with an expectation maximization algorithm that processes the low-fluence data in aggregate, and without any prior knowledge of the object or its orientation. The versatility of the method promises, more generally, to redefine what measurement scenarios can provide useful signal.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Randomized probe imaging through deep k-learning

Randomized probe imaging (RPI) is a single-frame diffractive imaging method that uses highly randomized light to reconstruct the spatial features of a scattering object. The reconstruction process, known as phase retrieval, aims to recover a unique solution for the object without measuring the far-field phase information. Typically, reconstruction is done via time-consuming iterative algorithms. In this work, we propose a fast and efficient deep learning based method to reconstruct phase objects from RPI data. The method, which we call deep k-learning, applies the physical propagation operator to generate an approximation of the object as an input to the neural network. This way, the network no longer needs to parametrize the far-field diffraction physics, dramatically improving the results. Deep k-learning is shown to be computationally efficient and robust to Poisson noise. The advantages provided by our method may enable the analysis of far larger datasets in photon starved conditions, with important applications to the study of dynamic phenomena in physical science and biological engineering.

Guo, Zhen (ORCID:0000000213473451)↗

Uncertainty quantification in the presence of limited climate model data with discontinuities.

Uncertainty quantification in climate models is challenged by the prohibitive cost of a large number of model evaluations for sampling. Another feature that often prevents classical uncertainty analysis from being readily applicable is the bifurcative behavior in the climate data with respect to certain parameters. A typical example is the Meridional Overturning Circulation in the Atlantic Ocean. The maximum overturning stream function exhibits a discontinuity across a curve in the space of two uncertain parameters, namely climate sensitivity and CO2 forcing. In order to propagate uncertainties from model parameters to model output we use polynomial chaos (PC) expansions to represent the maximum overturning stream function in terms of the uncertain climate sensitivity and CO2 forcing parameters. Since the spectral methodology assumes a certain degree of smoothness, the presence of discontinuities suggests that separate PC expansions on each side of the discontinuity will lead to more accurate descriptions of the climate model output compared to global PC expansions. We propose a methodology that first finds a probabilistic description of the discontinuity given a number of data points. Assuming the discontinuity curve is a polynomial, the algorithm is based on Bayesian inference of its coefficients. Markov chain Monte Carlo sampling is used to obtain joint distributions for the polynomial coefficients, effectively parameterizing the distribution over all possible discontinuity curves. Next, we apply the Rosenblatt transformation to the irregular parameter domains on each side of the discontinuity. This transformation maps a space of uncertain parameters with specific probability distributions to a space of i.i.d standard random variables where orthogonal projections can be used to obtain PC coefficients. In particular, we use uniform random variables that are compatible with PC expansions based on Legendre polynomials. The Rosenblatt transformation and the corresponding PC expansions for the model output on either side of the discontinuity are applied successively for several realizations of the discontinuity curve. The climate model output and its associated uncertainty at specific design points is then computed by taking a quadrature-based integration average over PC expansions corresponding to possible realizations of the discontinuity curve.

54 ENVIRONMENTAL SCIENCES↗

Random Walks With Tweedie: A Unified View of Score-Based Diffusion Models [In the Spotlight]

We present a concise derivation for several influential score-based diffusion models that relies on only a few textbook results. Diffusion models have recently emerged as powerful tools for generating realistic, synthetic signals—particularly natural images—and often play a role in state-of-the-art algorithms for inverse problems in image processing. While these algorithms are often surprisingly simple, the theory behind them is not, and multiple complex theoretical justifications exist in the literature. Here, in this study, we provide a simple and largely self-contained theoretical justification for score-based diffusion models that is targeted towards the signal processing community. This approach leads to generic algorithmic templates for training and generating samples with diffusion models. We show that several influential diffusion models correspond to particular choices within these templates and demonstrate that alternative, more straightforward algorithmic choices can provide comparable results. This approach has the added benefit of enabling conditional sampling without any likelihood approximation.

97 MATHEMATICS AND COMPUTING↗

Sequence Hopping Algorithm For Securing Goose Messages

Embodiments of the present invention include methods and apparatuses for securing data transfer in power-system automation and smart grids. Embodiments of the present invention can be particularly helpful in securing GOOSE messages. A method of securing data transfer according to an embodiment of the present invention can include a message sequence synchronization and monitoring server (MSSMS) providing random seeds to a publisher intelligent electronic device (IED) and a subscriber IED, both having a pseudo random number generators (PRNGs), inputting the random seeds into the PRNG of the publisher IED and generating a publisher sequence hopping number, sending a message to the subscriber IED with the publisher sequence hopping number attached, and determining if the message is valid by comparing the message attached publisher sequence hopping number to a subscriber sequence hopping number generated by the subscriber PRNG.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Two-dimensional stitching interferometry for self-calibration of high-order additive systematic errors

Stitching interferometry is performed by collecting interferometric data from overlapped sub-apertures and stitching these data together to provide a full surface map. The propagation of the systematic error in the measured subset data is one of the main error sources in stitching interferometry for accurate reconstruction of the surface topography. In this work, we propose, using the redundancy of the captured subset data, two types of two-dimensional (2D) self-calibration stitching algorithms to overcome this issue by in situ estimating the repeatable high-order additive systematic errors, especially for the application of measuring X-ray mirrors. The first algorithm, called CS short for “Calibrate, and then Stitch”, calibrates the high-order terms of the reference by minimizing the de-tilted discrepancies of the overlapped subsets and then stitches the reference-subtracted subsets. The second algorithm, called SC short for “Stitch, and then Calibrate”, stitches a temporarily result and then calibrates the reference from the de-tilted discrepancies of the measured subsets and the temporarily stitched result. In the implementation of 2D scans in $x$- and y -directions, step randomization is introduced to generate nonuniformly spaced subsets which can diminish the periodic stitching errors commonly observed in evenly spaced subsets. The regularization on low-order terms enables a highly flexible option to add the curvature and twist acquired by another system. Both numerical simulations and experiments are carried out to verify the proposed method. All the results indicate that 2D high-order repeatable additive systematic errors can be retrieved from the 2D redundant overlapped data in stitching interferometry.

42 ENGINEERING↗

A Latent-Variable Formulation of the Poisson Canonical Polyadic Tensor Model: Maximum Likelihood Estimation and Fisher Information

We establish parameter inference for the Poisson canonical polyadic (PCP) tensor model through a latent-variable formulation. Our approach exploits the observation that any random PCP tensor can be derived by marginalizing an unobservable random tensor of one dimension larger. The loglikelihood of this larger dimensional tensor, referred to as the “complete” loglikelihood, is comprised of multiple rank one PCP loglikelihoods. Using this methodology, we first derive maximum likelihood estimators for the PCP model and demonstrate that several existing algorithms for fitting non-negative matrix and tensor factorizations are Expectation-Maximization algorithms. Next, we derive the observed and expected Fisher information matrices for the PCP model. The Fisher information provides us crucial insights into the well-posedness of the tensor model, such as the role that tensor rank plays in identifiability and indeterminacy. For the special case of rank one PCP models, we demonstrate that these results are greatly simplified.

97 MATHEMATICS AND COMPUTING↗

Quantifying wildfire drivers and predictability in boreal peatlands using a two-step error-correcting machine learning framework in TeFire v1.0

Abstract. Wildfires are becoming an increasing challenge to the sustainability of boreal peatland (BP) ecosystems and can alter the stability of boreal carbon storage. However, predicting the occurrence of rare and extreme BP fires proves to be challenging, and gaining a quantitative understanding of the factors, both natural and anthropogenic, inducing BP fires remains elusive. Here, we quantified the predictability of BP fires and their primary controlling factors from 1997 to 2015 using a two-step correcting machine learning (ML) framework that combines multiple ML classifiers, regression models, and an error-correcting technique. We found that (1) the adopted oversampling algorithm effectively addressed the unbalanced data and improved the recall rate by 26.88 %–48.62 % when using multiple datasets, and the error-correcting technique tackled the overestimation of fire sizes during fire seasons; (2) nonparametric models outperformed parametric models in predicting fire occurrences, and the random forest machine learning model performed the best, with the area under the receiver operating characteristic curve ranging from 0.83 to 0.93 across multiple fire datasets; and (3) four sets of factor-control simulations consistently indicated the dominant role of temperature, air dryness, and climate extreme (i.e., frost) for boreal peatland fires, overriding the effects of precipitation, wind speed, and human activities. Our findings demonstrate the efficiency and accuracy of ML techniques in predicting rare and extreme fire events and disentangle the primary factors determining BP fires, which are critical for predicting future fire risks under climate change.

54 ENVIRONMENTAL SCIENCES↗

Kinetic Monte Carlo Simulation of Hydrogen Diffusion in Tungsten

Nuclear fusion is considered as the most promising sustainable energy source. If achieved, it could provide electricity to the mankind for millions of years. During the reaction, the fusion ash is continuously removed from the magnetic gap, the divertor region, and the divertor facing component is subjected to intense plasma bombardment. It is proposed to use tungsten as the divertor facing material, because it has low physical sputtering yield and superior thermomechanical properties. However, the high mobility of hydrogen in tungsten and the high bombardment flux bring the hydrogen isotopes deep into the tungsten tile. The presence of hydrogen in tungsten tends to weaken the gram boundaries and produce surface blistering. The ejection of tungsten particulates into the plasma core will cool the reaction and cease the fusion reactions. Therefore, it is important to have a detailed understanding of the hydrogen diffusion in tungsten bulk. The KMC method is a stochastic computer simulation to predict the time evolution of a certain system. Typically, at a given time, the system will evolve through a few possible paths with known probabilities. In each step, the KMC method analyzes the entire system and randomly determines the system evolving events based on all transition rates of all possible events and advance the physical time. This process is repeated till the simulation of the entire physical time is completed. In previous work, the authors developed a kinetic Monte Carlo (KMC) algorithm and program to simulate hydrogen diffusion process on tungsten reconstructed surface. In this article, this KMC method is extended to model the hydrogen diffusion in tungsten bulk. The diffusion coefficients are calculated and fitted to the Arrhenius equation. The result matches the experiment measurement very well. KMC diffusion simulation needs the locations of the hydrogen trapping sites, diffusion paths and the corresponding diffusion energy barriers. The hydrogen interstitial sites in tungsten crystal have been thoroughly studied by density function theory (DFT) and molecular dynamics (MD). Johnson and Carter used DFT to determine the preferred location of the hydrogen interstitial sites m tungsten crystal, which are the tetrahedral sites (T-sites) in body-centered-cubic (bcc) lattice surfaces. All T-sites are located on the surfaces of a lattice cell. There are four T-sites per surface and twelve T-sites per lattice cell. The hydrogen atoms diffuse by traveling from one T-site to one of its nearest four T-site neighbors. Thus, each T-site is surrounded by two neighbors on the same surface, and one neighbor on each of the two adjacent surfaces perpendicular to the surface holding the center T-site. The diffusion barrier between two neighboring T-sites was calculated to be 0.38 eV. Knowing the diffusion path, energy barrier, and the crystal structure, the KMC simulation is readily to be performed. Based on other researchers' DFT calculations, the hydrogen stable interstitial site in tungsten bulk is determined as the tetrahedral site on the surface of the bee lattice. Each T-site has 4 neighbors and the energy barrier between two adjacent T-sites are estimated to be 0.38 eV. Based on those facts and the KMC theory, a MATLAB program is developed to model the hydrogen diffusion in tungsten bulk. In the MATLAB program, substrate temperature, hydrogen concentration, physical time to be simulated, and the number of cycles are all customizable. To compare the KMC determined diffusion coefficients with experiment results in the literature, the simulations are performed for temperature 300 K - 2500 K and low hydrogen concentration (0.1%), mimicking the experiment condition. The calculated diffusion coefficients match the reference values measured by the experiment under low hydrogen concentration condition. The results are also fitted to the Arrhenius equation. The pre-exponential factor and the average activation energy in Arrhenius equation are obtained. The good agreement between simulation and experiment proves that the developed KMC algorithm truly reflect the well-established theory of interstitial hydrogens in tungsten. The developed program could easily be used to model the diffusion process and predict the diffusion coefficients under other concentrations and temperatures. This work is part of the ongoing development of hydrogen diffusion in tungsten integrating surface diffusion (previous work), bulk diffusion (this work), and adsorption/desorption on surface (future work)

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

SU-C-BRB-03: Cross-Institutional Validation of An Ultrafast Automatic Planning Platform for Breast Irradiation

Purpose: Recently an ultrafast automatic planning system for breast irradiation using tangential beams was developed by modeling relationships between patient anatomy and achieved dose distribution. This study evaluates the performance of this system when applied to a different patient population and dose calculation algorithm. Methods: The system and its anatomy-to-dose models was developed at institution A based on 20 cases, which were planned using manual fluence painting technique and calculated WITH heterogeneity correction. Institution B uses field-in-field planning technique and dose calculation WITHOUT heterogeneity correction. 11 breast cases treated at Institution B were randomly selected for retrospective study, including left and right sides, and different breast size (irradiated volumes defined by Jaw/MLC opening range from 875cc to 3516cc). Comparisons between plans generated automatically (Auto-Plans) and those used for treatment (Clinical-Plans) included: energy choice (single/mixed), volumes receiving 95%/100%/105%/110% Rx dose (V95%/V100%/V105%/V100%) relative to irradiated volume, D1cc, and LungV20Gy. Results: In 9 out of 11 cases single/mixed energy choice made by the software agreed with Clinical-Plans. For the remaining 2 cases software recommended using mixed energy and dosimetric improvements were observed. V100% were similar (p=0.223, Wilcoxon Signed-Rank test) between Auto-Plans and Clinical-Plans (57.6±8.9% vs. 54.8±9.5%). V95% is 2.3±3.0% higher for Auto-Plans (p=0.027), indicating reduced cold areas. Hot spot volume V105% were significantly reduced in Auto-Plan by 14.4±7.2% (p=0.004). Absolute V105% was reduced from 395.6±359.9cc for Clinical-Plans to 108.7±163cc for Auto-Plans. D1cc was 107.4±2.8% for Auto-Plans, and 109.2±2.4% for Clinical-Plans (p=0.056). LungV20Gy were 13.6±4.0% for Auto-Plan vs. 14.0±4.1% for Clinical-Plans (p=0.043). All optimizations were finished within 1.5min. Conclusion: The performance of this breast auto-planning system remained stable and satisfactory when applied to a different patient population and dose calculation algorithm. The auto-planning system was able to produce clinically similar Rx dose coverage with significantly improved homogeneity inside breast tissue, in less than 1.5min.

60 APPLIED LIFE SCIENCES↗

Using machine learning to predict the correlation of spectra using SDSS magnitudes as an improvement to the Locus Algorithm

The Locus Algorithm is a new technique to improve the quality of differential photometry by optimising the choices of reference stars. At the heart of this algorithm is a routine to assess how good each potential reference star is by comparing its SDSS magnitude values to those of the target star. In this way, the difference in wavelength-dependent effects of the Earth’s atmospheric scattering between target and reference can be minimised. This paper sets out a new way to estimate the quality of each reference star using machine learning. A random subset of stars from SDSS with spectra was chosen. For each one, a suitable reference star, also with a spectrum, was chosen. The correlation between the two spectra in the SDSS r band (between 550 nm and 700 nm) was taken to be the gold-standard measure of how well they match up for differential photometry. The five SDSS magnitude values for each of these stars were used as predictors. A number of supervised machine learning models were constructed on a training set of the stars and were each evaluated on a testing set. The model using Support Vector Regression had the best performance of these models. It was then tested on a final, hold-out, validation set of stars to get an unbiased measure of its performance. With an R 2 of 0.62, the SVR model presents enhanced performance for the Locus Algorithm technique.

79 ASTRONOMY AND ASTROPHYSICS↗

SPRED: A machine learning approach for the identification of classical and non-classical secretory proteins in mammalian genomes

Eukaryotic protein secretion generally occurs via the classical secretory pathway that traverses the ER and Golgi apparatus. Secreted proteins usually contain a signal sequence with all the essential information required to target them for secretion. However, some proteins like fibroblast growth factors (FGF-1, FGF-2), interleukins (IL-1 alpha, IL-1 beta), galectins and thioredoxin are exported by an alternative pathway. This is known as leaderless or non-classical secretion and works without a signal sequence. Most computational methods for the identification of secretory proteins use the signal peptide as indicator and are therefore not able to identify substrates of non-classical secretion. In this work, we report a random forest method, SPRED, to identify secretory proteins from protein sequences irrespective of N-terminal signal peptides, thus allowing also correct classification of non-classical secretory proteins. Training was performed on a dataset containing 600 extracellular proteins and 600 cytoplasmic and/or nuclear proteins. The algorithm was tested on 180 extracellular proteins and 1380 cytoplasmic and/or nuclear proteins. We obtained 85.92% accuracy from training and 82.18% accuracy from testing. Since SPRED does not use N-terminal signals, it can detect non-classical secreted proteins by filtering those secreted proteins with an N-terminal signal by using SignalP. SPRED predicted 15 out of 19 experimentally verified non-classical secretory proteins. By scanning the entire human proteome we identified 566 protein sequences potentially undergoing non-classical secretion. The dataset and standalone version of the SPRED software is available at (http://www.inb.uni-luebeck.de/tools-demos/spred/spred).

60 APPLIED LIFE SCIENCES↗

A Comprehensive Comparison of IMRT and VMAT Plan Quality for Prostate Cancer Treatment

Purpose: We performed a comprehensive comparative study of the plan quality between volumetric-modulated arc therapy (VMAT) and intensity-modulated radiation therapy (IMRT) for the treatment of prostate cancer. Methods and Materials: Eleven patients with prostate cancer treated at our institution were randomly selected for this study. For each patient, a VMAT plan and a series of IMRT plans using an increasing number of beams (8, 12, 16, 20, and 24 beams) were examined. All plans were generated using our in-house-developed automatic inverse planning (AIP) algorithm. An existing eight-beam clinical IMRT plan, which was used to treat the patient, was used as the reference plan. For each patient, all AIP-generated plans were optimized to achieve the same level of planning target volume (PTV) coverage as the reference plan. Plan quality was evaluated by measuring mean dose to and dose-volume statistics of the organs at risk, especially the rectum, from each type of plan. Results: For the same PTV coverage, the AIP-generated VMAT plans had significantly better plan quality in terms of rectum sparing than the eight-beam clinical and AIP-generated IMRT plans (p < 0.0001). However, the differences between the IMRT and VMAT plans in all the dosimetric indices decreased as the number of beams used in IMRT increased. IMRT plan quality was similar or superior to that of VMAT when the number of beams in IMRT was increased to a certain number, which ranged from 12 to 24 for the set of patients studied. The superior VMAT plan quality resulted in approximately 30% more monitor units than the eight-beam IMRT plans, but the delivery time was still less than 3 min. Conclusions: Considering the superior plan quality as well as the delivery efficiency of VMAT compared with that of IMRT, VMAT may be the preferred modality for treating prostate cancer.

62 RADIOLOGY AND NUCLEAR MEDICINE↗

Polynomial chaos expansions on principal geodesic Grassmannian submanifolds for surrogate modeling and uncertainty quantification

In this work we introduce a manifold learning-based surrogate modeling framework for uncertainty quantification in high-dimensional stochastic systems. Our first goal is to perform data mining on the available simulation data to identify a set of low-dimensional (latent) descriptors that efficiently parameterize the response of the high-dimensional computational model. To this end, we employ Principal Geodesic Analysis on the Grassmann manifold of the response to identify a set of disjoint principal geodesic submanifolds, of possibly different dimension, that captures the variation in the data. Since operations on the Grassmann require the data to be concentrated, we propose an adaptive algorithm based on Riemannian K-means and the minimization of the sample Fréchet variance on the Grassmann manifold to identify “local” principal geodesic submanifolds that represent different system behavior across the parameter space. Polynomial chaos expansion is then used to construct a mapping between the random input parameters and the projection of the response on these local principal geodesic submanifolds. Here, the method is demonstrated on four test cases, a toy-example that involves points on a hypersphere, a Lotka-Volterra dynamical system, a continuous-flow stirred-tank chemical reactor system, and a two-dimensional Rayleigh-Bénard convection problem.

42 ENGINEERING↗

Power Grid Reliability Estimation via Adaptive Importance Sampling

Electricity production currently generates approximately 25% of greenhouse gas emissions in the USA. Thus, increasing the amount of renewable energy is a key step to carbon neutrality. However, integrating a large amount of fluctuating renewable generation is a significant challenge for power grid operating and planning. Grid reliability, i.e., an ability to meet operational constraints under power fluctuations, is probably the most important of them. In this letter, we propose computationally efficient and accurate methods to estimate the probability of line overflow, i.e., reliability constraints violation, under a known distribution of renewable energy generation. To this end, we investigate an importance sampling approach, a flexible extension of Monte-Carlo methods, which adaptively changes the sampling distribution to generate more samples near the reliability boundary. The approach allows to estimate overload probability in real-time based only on a few dozens of random samples, compared to thousands required by the plain Monte-Carlo. Our study focuses on high voltage direct current power transmission grids with linear reliability constraints on power injections and line currents. Herein, we propose a novel theoretically justified physics-informed adaptive importance sampling algorithm and compare its performance to state-of-the-art methods on multiple IEEE power grid test cases.

power system faults↗

Enhancing scalability of a matrix-free eigensolver for studying many-body localization

We propose several techniques to enhance the parallel scalability of a matrix-free eigensolver designed for studying many-body localization (MBL) of quantum spin chain models with nearest-neighbor interactions and on-site disorder. This type of problem is computationally challenging because the dimension of the associated Hamiltonian matrix grows exponentially with respect to the number of spins L, and we need to average over different realizations of the random disorder to obtain relevant statistical behavior. For each disorder realization, we need to compute eigenvalues from different regions of the spectrum and their corresponding eigenvectors. In previous work, the interior eigenstates for a single eigenvalue problem are computed via the shift-and-invert Lanczos algorithm. Due to the extremely high memory footprint of the LU factorizations, this technique is not well suited for large L’s. For example, we need thousands of compute nodes on modern high performance computing infrastructures to go beyond L = 24. The matrix-free approach does not suffer from this memory bottleneck, however, its scalability is limited by a computation and communication load imbalance. To reduce this imbalance and to significantly enhance the scalability of the matrix-free eigensolver, we reorder the matrix and leverage the consistent space runtime, CSPACER. We also show its efficiency in managing irregular communication patterns at scale compared to optimized MPI non-blocking two-sided and one-sided RMA implementation variants. This effort enables us to study MBL for spin chains with a larger number of spins. The efficiency and effectiveness of the proposed algorithm is demonstrated by computing eigenstates on a massively parallel many-core high performance computer.

METIS↗

A numerical homogenization method for heterogeneous, anisotropic elastic media based on multiscale theory

The development of reliable methods for upscaling fine scale models of elastic media has long been an important topic for rock physics and applied seismology. Several effective medium theories have been developed to provide elastic parameters for materials such as finely layered media or randomly oriented or aligned fractures. In such cases, the analytic solutions for upscaled properties can be used for accurate prediction of wave propagation. However, such theories cannot be applied directly to homogenize elastic media with more complex, arbitrary spatial heterogeneity. We therefore propose a numerical homogenization algorithm based on multiscale finite element methods for simulating elastic wave propagation in heterogeneous, anisotropic elastic media. Specifically, our method used multiscale basis functions obtained from a local linear elasticity problem with appropriately defined boundary conditions. Homogenized, effective medium parameters were then computed using these basis functions, and the approach applied a numerical discretization that is similar to the rotated staggered-grid finite difference scheme. Comparisons of the results from our method and from conventional, analytical approaches for finely layered media showed that the homogenization reliably estimated elastic parameters for this simple geometry. Additional tests examined anisotropic models with arbitrary spatial heterogeneity where the average size of the heterogeneities ranged from several centimeters to several meters, and the ratio between the dominant wavelength and the average size of the arbitrary heterogeneities ranged from 10 to 100. Comparisons to finite-difference simulations proved that the numerical homogenization was equally accurate for these complex cases.

58 GEOSCIENCES↗

Single-Shot Femtosecond X-ray Diffraction from Randomly Oriented Ellipsoidal Nanoparticles

Coherent diffractive imaging of single particles using the single-shot 'diffract and destroy' approach with an x-ray free electron laser (FEL) was recently demonstrated. A high-resolution low-noise coherent diffraction pattern, representative of the object before it turns into a plasma and explodes, results from the interaction of the FEL with the particle. Iterative phase retrieval algorithms are used to reconstruct two-dimensional projection images of the object from the recorded intensities alone. Here we describe the first single-shot diffraction data set that mimics the data proposed for obtaining 3D structure from identical particles. Ellipsoidal iron oxide nanoparticles (250 nm x 50 nm) were aerosolized and injected through an aerodynamic lens stack into a soft x-ray FEL. Particle orientation was not controlled with this injection method. We observed that, at the instant the x-ray pulse interacts with the particle, a snapshot of the particle's orientation is encoded in the diffraction pattern. The results give credence to one of the technical concepts of imaging individual nanometer and subnanometer-sized objects such as single molecules or larger clusters of molecules using hard x-ray FELs and will be used to help develop robust algorithms for determining particle orientations and 3D structure.

43 PARTICLE ACCELERATORS↗