Search NASA⌕ Search

SEARCH · Search NASA

Results for “compute intensive problems”

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 523 records · Page 29

Efficient Multigrid Reduction-in-Time for Method-of-Lines Discretizations of Linear Advection

Parallel-in-time methods for partial differential equations (PDEs) have been the subject of intense development over recent decades, particularly for diffusion-dominated problems. It has been widely reported in the literature, however, that many of these methods perform quite poorly for advection-dominated problems. In this report we analyze the particular iterative parallel-in-time algorithm of multigrid reduction-in-time (MGRIT) for discretizations of constant-wave-speed linear advection problems. We focus on common method-of-lines discretizations that employ upwind finite differences in space and Runge-Kutta methods in time. Using a convergence framework we developed in previous work, we prove for a subclass of these discretizations that, if using the standard approach of rediscretizing the fine-grid problem on the coarse grid, robust MGRIT convergence with respect to CFL number and coarsening factor is not possible. This poor convergence and non-robustness is caused, at least in part, by an inadequate coarse-grid correction for smooth Fourier modes in space-time known as characteristic components. We propose an alternative coarse-grid operator that provides a better correction of these modes. This coarse-grid operator is related to previous work and uses a semi-Lagrangian discretization combined with an implicitly treated truncation error correction. Theory and numerical experiments show the proposed coarse-grid operator yields fast MGRIT convergence for many of the method-of-lines discretizations considered, including for both implicit and explicit discretizations of high order. Parallel results demonstrate speed-up over sequential time-stepping.

97 MATHEMATICS AND COMPUTING↗

Automated Quantitative Analysis of Extended Irradiation Defects - Dislocations, Voids and Precipitates in Neutron Irradiated HT-9 Steel

Structural alloys that make up the core components of nuclear reactors are exposed to radiation that can substantially alter the microstructure and mechanical properties of the material. Irradiation can cause the formation of extended defects including dislocation line and loops, voids and various types of precipitates. To understand the irradiation effects, it is critical to characterize these defects individually and collectively to quantify how they evolve throughout irradiation stages. Transmission electron microscopy (TEM) is a standard tool for providing extensive size, number density and spatial distribution of extended irradiation defects, however, manual measurement of defect size and number density requires time-intensive effort to analyze enough defects that provide a statistically meaningful result and are prone to errors of subjectivity. In this work, we developed a set of MATLAB algorithms offering robust and automated identification and quantification of extended irradiation defects like dislocation lines, voids and precipitates commonly observed in neutron irradiated cladding alloys [1]. Using a neutron-irradiated HT-9 martensitic alloy irradiated at 412°C to 111.8 dpa, we demonstrate the capability of these algorithms for quantitative defect analysis. Figure 1 presents defect images of the HT-9 using an advanced diffraction contrast imaging scanning transmission electron microscopy (DCI STEM) that suppresses bend contours and provides better defect contrast compared to conventional TEM [2]. The first step of defect analysis is defect identification, a process that can be digitally achieved by contrast thresholding (for simple defect contrast) and by machine learning computer vision for defect semantic segmentation [3]. Here, labeled binary defect images (Figures 2a and 2c) were used. For dislocation density quantification, we employed an optimized circular-grid intersection method first introduced by Dr. John Steeds [4]. This method is shown in Figures 2a and 2b, where the number of intersections of dislocation lines with circular traces was measured. This produces an unbiased sampling of dislocation lines, regardless of their orientation. This process was optimized with automated digital intersection number and grid length registration. Interestingly, it was found that a relatively large number of circles in a set circular gird is was needed to produce an invariant result (Figure 2b), with a low systematic measurement error. This demonstrates the main advantage of computer-based defect analysis, in performing repetitive operations quickly with a reduced systematic error. For the quantitative analysis of voids and precipitates a challenge encountered with automated defect analysis is feature overlap, particularly when the density of voids/precipitates is high. To mitigate this problem, as shown in Figure 2d, we modified the popular circular Hough transformation and treated ‘circular shape’ as the particle descriptor for voids/precipitates, efficiently resolving the overlapping particles. In summary, this automated digital quantification together with machine learning enabled defect identification [3] opens new opportunities for standardizing the characterization workflow for quantitative analysis of extended irradiation defects.

Sainju, Rajat↗

Transient superconductivity at nano- and meso-scales

High-T c superconductivity is surpassed by few, if any, other unsolved problems in contemporary physics in terms of its richness, complexity, impact on other fields, and potential technological importance in energy applications. Recent discoveries reveal that the highest transition temperatures emerge under extraordinary experimental conditions such as the strong perturbation of a single atomic layer material by the underlying substrate, application of ~200 GPa pressure or ~MV/cm static electric fields, or irradiation by intense femtosecond optical fields. Research in superconductivity under extreme experimental conditions is challenging and requires the development of novel experimental methods and new theoretical tools suitable to tackle the problem. Our team has approached the challenges of transient superconductivity under intense optical fields by rethinking the types of experimental observables that are best suited to elucidate the physics of light-induced effects. This exercise has identified the need for: i) ultra-fast spatio-temporal probes enabling access to plasmonic properties and also nano-scale inhomogeneities that are ubiquitous in unconventional superconductors; ii) meso-scale structures and hybrid meta-surfaces imperative for strong enhancement of optical fields and iii) theoretical approaches suitable to explain and predict the response of superconductors under ultra-fast photo-excitation. Co-PIs have already made major advances with developing capabilities i)-iii). Therefore, our team is poised to make significant progress in transient superconductivity by exploring novel spatio-temporal effects that currently remain unattainable. Co-investigators will search for light-induced superconductivity in the high-T c cuprates to build upon spectacular recent results still lacking independent confirmations. Novel data acquisition methods combined with nano-plasmonic imaging will allow our team to test the hypothesis of photo-induced superconducting pairing. Spatio-temporal experiments will provide insights into the interplay between superconductivity and competing orders in the cuprates. Co-PIs will also investigate strong light-matter interaction and superconductivity in FeSe monolayers. Finally, we will study spatio-temporal electrodynamics of planar Josephson junctions. This latter direction will allow our team to thoroughly characterize one of the most fundamental examples of inhomogeneity in all of unconventional superconductivity. The proposed experiments in combination with theoretical analysis will provide information that is difficult to obtain using alternative methods. Basov and Averitt will carry out pump-probe spectroscopy and nano-imaging experiments. Averitt and Hone will design and fabricate state-of-the-art meta-surfaces. Theoretical and computational studies of ultrafast transient phenomena will be carried out by Millis and Fogler. Modeling of time-resolved nano-optical effects will be done by Fogler. The bulk of the requested budget will be used to support graduate students at Columbia & UCSD that will be co-supervised by co-PIs. The proposed program is transformative, since it will enable an entire suite of experiments previously either impossible or technically implausible. It will deliver critically important insights not only into mechanisms of unconventional superconductivity but also to many other correlated quantum materials.

36 MATERIALS SCIENCE↗

Dark energy from large-scale structure lensing information

Wide area large-scale structure (LSS) surveys are planning to map a substantial fraction of the visible Universe to quantify dark energy through baryon acoustic oscillations. At increasing redshift, for example, that probed by proposed 21-cm intensity mapping surveys, gravitational lensing potentially limits the fidelity (Hui et al., 2007) because it distorts the apparent matter distribution. In this paper we show that these distortions can be reconstructed, and actually used to map the distribution of intervening dark matter. The lensing information for sources at z=1-3 allows accurate reconstruction of the gravitational potential on large scales, l < or approx. 100, which is well matched for integrated Sachs-Wolfe effect measurements of dark energy and its sound speed, and a strong constraint for modified gravity models of dark energy. We built an optimal quadratic lensing estimator for non-Gaussian sources, which is necessary for LSS. The phenomenon of 'information saturation' (Rimes and Hamilton, 2005) saturates reconstruction at mildly nonlinear scales, where the linear source power spectrum {Delta}{sup 2{approx}}0.2-0.5, depending on power spectrum slope. Naive Gaussian estimators with nonlinear cutoff can be tuned to reproduce the optimal non-Gaussian errors within a factor of 2. We compute the effective number densities of independent lensing sources for LSS lensing, and find that they increase rapidly with redshifts. For LSS/21-cm sources at z{approx}2-4, the lensing reconstruction is limited by cosmic variance at l < or approx. 100.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Data Locality Enhancement of Dynamic Simulations for Exascale Computing (Final Report)

The development of modern processors exhibits two trends that complicate the optimizations of modern software. The first is the increasing sensitivity of processors' throughput to irregularities in computation. With more processors produced through a massive integration of simple cores, future systems will increasingly favor regular data-level parallel computations, but deviate from the needs of applications with complex patterns. Some evidences are already shown on Graphic Processing Units (GPU): Irregular data accesses (e.g., indirect references A[D[i]]) and conditional branches are limiting many GPU applications' performance at a level an order of magnitude lower than the peak of GPU. The second hardware trend is the growing gap between memory bandwidth and the aggregate speed—that is, the sum of all cores' computing power—of a Chip Multiprocessor (CMP). Despite the capped growth of the peak CPU speed, the aggregate speed of a CMP keeps increasing as more cores get into a single chip. It is expected that by 2018, node concurrency in an exascale system will increase by hundreds of times, whereas, memory bandwidth will expand by only 10 to 20 times. Consequently, data movement and storage is expected to consume more than 70% of the total system power. Bridging this gap is difficult; the complexities of modern CMP memory hierarchy make it even harder: Data cache becomes shared among computing units, and the sharing is often non-uniform—whether two computing units share a cache depends on their proximity and the level of the cache. On the recent IBM Power7 architecture, for instance, four hardware contexts (or SMT threads) in a core share the entire memory hierarchy, all cores in one chip share an on-chip L3 cache, and cores across chips share L3 and main memory through off-chip connections. These two trends complicate the translation of computing power into performance, especially for a program with either intensive data accesses or complex patterns in data accesses or control flow paths. Unfortunately, both attributes present and will persist in a class of important applications. For instance, many scientific simulations deal with a large volume of data. And meanwhile, as most real-world processes are non-uniform and evolving (e.g., the evolution of a galaxy or the process of a drug injection), both the computations and data accesses of these programs tend to be irregular and dynamically changing. Currently, the lack of support to these applications on modern CMP severely limits their performance. On GPU, as our recent study shows and other studies echo, performance enhancement of a factor of integers is possible when memory accesses or control flows are streamlined for a set of GPU applications. On multicore CPU, our studies show that traditional locality enhancement, for being oblivious to the new features of multicore memory hierarchy, may even cause large slowdown to data-intensive dynamic applications. The severity of the issues is expected to worsen as the two hardware trends continue. Some recent studies try to match software with the trends, but in a limited scope or manner. For irregularities on GPU, most studies focus on irregularities analyzable through static analysis (e.g., data accesses in regular loops). Dynamic irregularities are harder to address because the needed analysis and transformations typically have to happen at run time. Some other research resorts to hardware extensions, an actual adoption of which is unclear for the entailed space cost and complexity. For data locality, recent years have seen some exploitations of the new memory hierarchy on multicore for performance, but most of them are on process or thread scheduling, rather than program transformations. Our recent study reveals that program-level transformations may magnify the scheduling benefits by a factor of seven, concluding that program-level transformation should play a central role for data locality enhancement on modern CMP. But research in this direction has been sparse, and most have focused on data layout or cache performance modeling, rather than program transformations to match with the new memory hierarchy features. Overall, it is still an open question how to bridge the gap between dynamic computations and the two prominent properties of modern processors. The goal of this project is to develop a set of techniques and software tools to enhance the matching between memory accesses in dynamic simulations and the prominent features of modern and future CMP, alleviating the memory performance issues for petascale and exascale computing. This report summarizes the discoveries and products produced throughout this project. It includes free launch, a new software approach to overcoming the shortcomings of both methods; coherence-free multiview, an approach that allows multiple views of a single data object to co-exist on GPU memory during a GPU kernel execution; algorithmic optimizations to data analytics problems, especially those that involve lots of distance calculations. Supporting dynamic parallelism is important for GPU to benefit a broad range of applications. There are currently two fundamental ways for programs to exploit dynamic parallelism on GPU: a software-based approach with software-managed worklists, and a hardware-based approach through dynamic subkernel launches. Neither is satisfactory. The former is complicated to program and is often subject to some load imbalance; the latter suffers large runtime overhead. In this work, we propose free launch, a new software approach to overcoming the shortcomings of both methods. It allows programmers to use subkernel launches to express dynamic parallelism. It employs a novel compiler-based code transformation named subkernel launch removal to replace the subkernel launches with the reuse of parent threads. Coupled with an adaptive task assignment mechanism, the transformation reassigns the tasks in the subkernels to the parent threads with a good load balance. The technique requires no hardware extensions, immediately deployable on existing GPUs. It keeps the programming convenience of the subkernel launch-based approach while avoiding its large runtime overhead. Meanwhile, its superior load balancing makes it outperform manual worklist-based techniques by 3X on average. The work was published at the 48th Annual IEEE/ACM International Symposium on Microarchitecture (Micro'2015). A Graphic Processing Unit (GPU) system is typically equipped with many types of memory (e.g., global, constant, texture, shared, cache). Data placement determines what data are placed on which type of memory, essential for GPU memory performance. Prior optimizations of data placement always require a single view of a data object on memory, which limits the optimization effectiveness. In this work, we propose coherence-free multiview, an approach that allows multiple views of a single data object to co-exist on GPU memory during a GPU kernel execution. We demonstrate that under certain conditions, the multiple views can remain incoherent while facilitating enhanced data placement. We present a theorem and some compiler support to ensure the soundness of the usage of coherence-free multiview. We further develop reference-discerning data placement, a new way to enhance data placements on GPU. It enables more flexible data placements by using coherence-free multiview to leverage the slack in coherence requirement of some GPU programs. Experiments on three types of GPU systems show that, with less than 200KB space cost, the new data placement technique can provide a 1.6X average (up to 4.27X) speedup. In addition, we have examined algorithmic optimizations to data analytics problems, especially those that involve lots of distance calculations. Computing distances among data points is an essential part of many important algorithms in data analytics, graph analysis, and other domains. In each of these domains, developers have spent significant manual effort optimizing algorithms, often through novel applications of the triangle equality, in order to minimize the number of distance computations in the algorithms. In this work, we observe that many algorithms across these domains can be generalized as an instance of a generic distance-related abstraction. Based on this abstraction, we derive seven principles for correctly applying the triangular inequality to optimize distance-related algorithms. Guided by the findings, we develop Triangular OPtimizer (TOP), the first software framework that is able to automatically produce optimized algorithms that either matches or outperforms manually designed algorithms for solving distance-related problems. TOP achieves up to 237x speedups and 2.5X on average. The work has been published at the 32nd International Conference on Machine Learning (ICML'15) and the 41st International Conference on Very Large Data Bases (VLDB'15).

42 ENGINEERING↗

2020 Budget Request for the DOE Computational Science Graduate Fellowship (CSGF) Grant

The Department of Energy Computational Science Graduate Fellowship (DOE CSGF) is essential for addressing the increasingly complex national workforce demands stemming from the growth of computational science and engineering challenges. Computational science and engineering (CSE) takes a multidisciplinary approach that utilizes scientific computing to tackle practical problems and provide technical tools across the spectrum of scientific discovery. The DOE CSGF specifically highlights high-performance computing (HPC) as a critical enabling technology in CSE, driving advancements in science and engineering that are vital to both the DOE and the broader economy. Over the past half-century, HPC has been an essential tool for DOE’s success. During this period, important missions, such as nuclear stockpile stewardship, have turned to HPC as an essential technology. Entire science disciplines have been transformed through the augmentation of scientific observation via HPC. At government laboratories, academic institutions, and in industry, DOE CSGF alumni are helping push traditional HPC boundaries while contributing to discoveries in high-energy physics, quantum information systems, fusion-reactor design, machine learning, additive manufacturing, nano materials for next-generation batteries and transistors, and advanced nuclear reactor modeling. In addition, HPC is used to address national health needs that will eventually point to cures both by helping cancer researchers manage and analyze huge troves of data, by simulating biological mechanisms, and by accelerating drug development. A 2023 report from the ASCAC Subcommittee on American Competitiveness and Innovation to the ASCR office, “Can the United States Maintain Its Leadership in High-Performance Computing?” says of the Program, “The CSGF program provides a barometer for disciplines that will be of interest to future DOE computing. Computational biology, machine learning, and quantum computing are among the subjects that began to swell in the ranks of CSGF applicants before the labs were hiring as high a percentage of employees in these categories.” The explosion of scientific and technological data has heightened the demand for advanced high-performance computing (HPC) to transform these data into meaningful scientific insights. As access to vast amounts of data increases, the fields of Machine Learning and Artificial Intelligence are experiencing a resurgence, enhancing the established practices of computational modeling and simulation. In its September 2020 subcommittee report on "AI/ML, Data Intensive Science, and High-Performance Computing," the DOE Advanced Scientific Computing Advisory Committee (ASCAC) specifically called for a fellowship program to train computational and data scientists to address exascale and data-intensive computing challenges. This integration of empirical and theoretical modeling will increasingly guide federal policymakers in making decisions that impact American society and future generations. It demands a workforce of highly skilled and intellectually agile computational scientists capable of navigating the rapid advancements in scientific computing within the DOE National Laboratory research environment. The DOE CSGF program has consistently addressed this critical need.

97 MATHEMATICS AND COMPUTING↗

Computational Systems Biology

Computational systems biology is the term that we use to describe computational methods to identify, infer, model, and store relationships between the molecules, pathways, and cells (“systems”) involved in a living organism. Based on this definition, the field of computational systems biology has been in existence for some time. However, the recent confluence of high throughput methodology for biological data gathering, genome-scale sequencing and computational processing power has driven a reinvention and expansion of this field. The expansions include not only modeling of small metabolic{Ishii, 2004 #1129; Ekins, 2006 #1601; Lafaye, 2005 #1744} and signaling systems{Stevenson-Paulik, 2006 #1742; Lafaye, 2005 #1744} but also modeling of the relationships between biological components in very large systems, incluyding whole cells and organisms {Ideker, 2001 #1124; Pe'er, 2001 #1172; Pilpel, 2001 #393; Ideker, 2002 #327; Kelley, 2003 #1117; Shannon, 2003 #1116; Ideker, 2004 #1111}{Schadt, 2003 #475; Schadt, 2006 #1661}{McDermott, 2002 #878; McDermott, 2005 #1271}. Generally these models provide a general overview of one or more aspects of these systems and leave the determination of details to experimentalists focused on smaller subsystems. The promise of such approaches is that they will elucidate patterns, relationships and general features that are not evident from examining specific components or subsystems. These predictions are either interesting in and of themselves (for example, the identification of an evolutionary pattern), or are interesting and valuable to researchers working on a particular problem (for example highlight a previously unknown functional pathway). Two events have occurred to bring about the field computational systems biology to the forefront. One is the advent of high throughput methods that have generated large amounts of information about particular systems in the form of genetic studies, gene expression analyses (both protein and mRNA) and metabolomics. With such tools, research to consider systems as a whole are being conceived, planned and implemented experimentally on an ever more frequent and wider scale. The other is the growth of computational processing power and tools. Methods to analyze large data sets of this kind are often computationally demanding and, as is the case in other areas, the field has benefited from continuing improvements in computational hardware and methods. The field of computational biology is very much like a telescope with two sequential lenses: one lens represents the biological data and the other represents a computational and/or mathematical model of the data. Both lenses must be properly coordinated to yield an image that reflects biological reality. This means that the design parameters for both lenses must be designed in concert to create a system that yields a model of the organism that provides both predictive and mechanistic information. The chapters in this book describe the construction of subcomponents of such a system. Computational systems biology is a rapidly evolving field and no single group of investigators has yet developed a compete system that integrates both data generation and data analysis in such a way so as to allow full and accurate modeling of any single biological organism. However, the field is rapidly moving in that direction. The chapters in this book represent a snapshot of the current methods being developed and used in the area of computational systems biology. Each method or database described within represents one or more steps on the path to a complete description of a biological system. How these tools will evolve and ultimately be integrated is an area of intense research and interest. We hope that readers of this book will be motivated by the chapters within and become involved in this exciting area of research.

59 BASIC BIOLOGICAL SCIENCES↗

Change-point Detection and Image Segmentation for Time Series of Astrophysical Images

Many astrophysical phenomena are time-varying, in the sense that their intensity, energy spectrum, and/or the spatial distribution of the emission suddenly change. This paper develops a method for modeling a time series of images. Under the assumption that the arrival times of the photons follow a Poisson process, the data are binned into 4D grids of voxels (time, energy band, and x-y coordinates), and viewed as a time series of non-homogeneous Poisson images. The method assumes that at each time point, the corresponding multiband image stack is an unknown 3D piecewise constant function including Poisson noise. It also assumes that all image stacks between any two adjacent change points (in time domain) share the same unknown piecewise constant function. The proposed method is designed to estimate the number and the locations of all of the change points (in time domain), as well as all of the unknown piecewise constant functions between any pairs of the change points. The method applies the minimum description length principle to perform this task. A practical algorithm is also developed to solve the corresponding complicated optimization problem. Simulation experiments and applications to real data sets show that the proposed method enjoys very promising empirical properties. Applications to two real data sets, the XMM observation of a flaring star and an emerging solar coronal loop, illustrate the usage of the proposed method and the scientific insight gained from it.

79 ASTRONOMY AND ASTROPHYSICS↗

Sensitive and Specific Peak Detection for SELDI-TOF Mass Spectrometry Using a Wavelet/Neural-Network Based Approach

SELDI-TOF mass spectrometer’s compact size and automated, high throughput design have been attractive to clinical researchers, and the platform has seen steady-use in biomarker studies. Despite new algorithms and preprocessing pipelines that have been developed to address reproducibility issues, visual inspection of the results of SELDI spectra preprocessing by the best algorithms still shows miscalled peaks and systematic sources of error. This suggests that there continues to be problems with SELDI preprocessing. In this work, we study the preprocessing of SELDI in detail and introduce improvements. While many algorithms, including the vendor supplied software, can identify peak clusters of specific mass (or m/z) in groups of spectra with high specificity and low false discover rate (FDR), the algorithms tend to underperform estimating the exact prevalence and intensity of peaks in those clusters. Thus group differences that at first appear very strong are shown, after careful and laborious hand inspection of the spectra, to be less than significant. Here we introduce a wavelet/neural network based algorithm which mimics what a team of expert, human users would call for peaks in each of several hundred spectra in a typical SELDI clinical study. The wavelet denoising part of the algorithm optimally smoothes the signal in each spectrum according to an improved suite of signal processing algorithms previously reported (the LibSELDI toolbox under development). The neural network part of the algorithm combines those results with the raw signal and a training dataset of expertly called peaks, to call peaks in a test set of spectra with approximately 95% accuracy. The new method was applied to data collected from a study of cervical mucus for the early detection of cervical cancer in HPV infected women. The method shows promise in addressing the ongoing SELDI reproducibility issues.

59 BASIC BIOLOGICAL SCIENCES↗

Relativistic Tennis with Photons: Frequency Up-Shifting, Light Intensification and Ion Acceleration with Flying Mirrors

We formulate the Flying Mirror Concept for relativistic interaction of ultra-intense electromagnetic waves with plasmas, present its theoretical description and the results of computer simulations and laboratory experiments. In collisionless plasmas, the relativistic flying mirrors are thin and dense electron or electron-ion layers accelerated by the high intensity electromagnetic waves up to velocity close to the speed of light in vacuum; in nonlinear-media and in nonlinear vacuum they are the ionization fronts and the refraction index modulations induced by a strong electromagnetic wave. The reflection of the electromagnetic wave at the relativistic mirror results in its energy and frequency change due to the double Doppler effect. In the co-propagating configuration, in the radiation pressure dominant regime, the energy of the electromagnetic wave is transferred to the ion energy providing a highly efficient acceleration mechanism. In the counter-propagation configuration the frequency of the reflected wave is multiplied by the factor proportional to the gamma-factor squared. If the relativistic mirror performs an oscillatory motion as in the case of the electron motion at the plasma-vacuum interface, the reflected light spectrum is enriched with high order harmonics.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

An overlapping Domain Decomposition preconditioning method for monolithic solution of shear bands

Metals subjected to high strain rate impact often exhibit a sudden and profound drop in the material’s load bearing capability, a ductile failure phenomenon known as shear banding. Shear bands, characterized as material instabilities, are driven by shear heating and described as narrow regions that have sustained intense plastic deformation and high temperature rise. This coupled thermo-mechanical localization problem can be formulated as a nonlinear system with two balance equations, momentum and energy, and two constitutive laws for elasticity and plasticity. Here in our formulation, mixed finite elements are used to discretize the equations in space and an implicit finite difference scheme is used to advance the system in time, where at every time step, a Newton type method is used to solve the system monolithically. To that end, a block Jacobian matrix is formed analytically using Gâteaux derivatives. The resulting Jacobian is sparse, nonsymmetric and its sparsity pattern and eigenvalue content vary with the different stages of shear bands formation, consequently posing a significant challenge to iterative solvers. To address this issue, an overlapping Domain Decomposition preconditioner that takes into account the physics of shear bands and the domain in which it forms, is proposed. The key idea is to resolve the shear band domain accurately while only solving the remaining domain approximately, with selective updates when necessary. The preconditioner is formed on the basis of an additive Schwartz method that is applied to a Schur complement partition of the system. The proposed preconditioner is implemented in parallel and tested on three different benchmark problems as compared against off-the-shelf solvers. We study the effect of h- and k-refinement that are obtained from Isogeometric discretizations of the system, the overlapping strategy and its parallel performance. Excellent performance is demonstrated in serial and parallel on all benchmark examples.

42 ENGINEERING↗

Effects of electron recirculation on a hard x-ray source observed during the interaction of a high intensity laser pulse with thin Au targets

The interaction of a high intensity laser pulse on the preplasma of a high-Z solid target produced by the pulse's pedestal generates high-energy electrons. These electrons subsequently penetrate inside the solid target and produce bremsstrahlung photons, generating an x-ray source which can be used for photonuclear studies or to radiograph high area density objects. The source characteristics are compared for targets with thin (20 μm) and thick (100 μm) Au foils on the Omega EP laser at Laboratory for Laser Energetics. Simulations using the particle-in-cell code CALDER show that for a 20 μm thickness Au target, electrons perform multiple round-trips in the target under the effect of the laser ponderomotive potential and the target electrostatic potential. These relativistic electrons have random transverse displacements, with respect to the target normal, attributed to electrostatic fluctuation fields. As a result, the x-ray spot size is increased by a factor 2 for thin target compared to thick targets, in agreement with experimental results. In addition, the computed doses agree with the measured ones provided that electron recirculation in the thin target is taken into account. A dose increase by a factor 1.7 is then computed by allowing for recirculation. In the 100 μm target case, on the other hand, this effect is found to be negligible.

07 ISOTOPE AND RADIATION SOURCES↗

Time varying, multivariate volume data reduction

Large-scale supercomputing is revolutionizing the way science is conducted. A growing challenge, however, is understanding the massive quantities of data produced by large-scale simulations. The data, typically time-varying, multivariate, and volumetric, can occupy from hundreds of gigabytes to several terabytes of storage space. Transferring and processing volume data of such sizes is prohibitively expensive and resource intensive. Although it may not be possible to entirely alleviate these problems, data compression should be considered as part of a viable solution, especially when the primary means of data analysis is volume rendering. In this paper we present our study of multivariate compression, which exploits correlations among related variables, for volume rendering. Two configurations for multidimensional compression based on vector quantization are examined. We emphasize quality reconstruction and interactive rendering, which leads us to a solution using graphics hardware to perform on-the-fly decompression during rendering. In this paper we present a solution which addresses the need for data reduction in large supercomputing environments where data resulting from simulations occupies tremendous amounts of storage. Our solution employs a lossy encoding scheme to acrueve data reduction with several options in terms of rate-distortion behavior. We focus on encoding of multiple variables together, with optional compression in space and time. The compressed volumes can be rendered directly with commodity graphics cards at interactive frame rates and rendering quality similar to that of static volume renderers. Compression results using a multivariate time-varying data set indicate that encoding multiple variables results in acceptable performance in the case of spatial and temporal encoding as compared to independent compression of variables. The relative performance of spatial vs. temporal compression is data dependent, although temporal compression has the advantage of offering smooth animations, while spatial compression can handle volumes of larger dimensions.

97 MATHEMATICS AND COMPUTING↗

On the use of computed radiography plates for quality assurance of intensity modulated radiation therapy dose distributions

Purpose: As traditional film is phased out in most radiotherapy centers, computed radiography (CR) systems are increasingly being purchased as a replacement. CR plates can be used for patient imaging, but may also be used for a variety of quality assurance (QA) purposes and can be calibrated in terms of dose. This study looks at their suitability for verification of intensity modulated radiation therapy (IMRT) dose distributions. Methods: A CR plate was calibrated in terms of the relative dose and the stability of response over 1 year was studied. The effect of exposing the CR plate to ambient light and of using different time delays before scanning was quantified. The CR plate was used to verify the relative dose distributions for ten IMRT patients and the results were compared to those obtained using a two dimensional (2D) diode array. Results: Exposing the CR plate to 10 s of ambient light between irradiation (174 cGy) and scanning erased approximately 80% of the signal. Changes in delay time between irradiation and scanning also affected the measurement results. The signal on the plate was found to decay at a rate of approximately 3.6 cGy/min in the first 10 min after irradiation. The use of a CR plate for IMRT patient-specific QA resulted in a significantly lower distance to agreement (DTA) and gamma pass rate than when using a 2D diode array for the measurement. This was primarily due to the over-response of the CR phosphor to low energy scattered radiation. For the IMRT QA using the CR plate, the average gamma pass rate was 97.3%. For the same IMRT QA using a diode array, the average gamma pass rate was 99.7%. The gamma criteria used were 4% dose difference and 4 mm DTA for head and neck treatments and 3% dose difference and 3 mm DTA for prostate treatments. The gamma index tolerance was 1. The lowest 10% of the dose distribution was excluded from all gamma and DTA analyses. Conclusions: Although the authors showed that CR plates can be used for patient specific IMRT QA, the practical problems such as the over-response to low energy scatter and signal fading with light exposure and time mean that alternative detectors such as radiochromic film or diode arrays will be a more sensible choice for most radiotherapy departments.

60 APPLIED LIFE SCIENCES↗

Matter wave switching in Bose-Einstein condensates via intensity redistribution soliton interactions

Using time dependent nonlinear (s-wave scattering length) coupling between the components of a weakly interacting two component Bose-Einstein condensate (BEC), we show the possibility of matter wave switching (fraction of atoms transfer) between the components via shape changing/intensity redistribution (matter redistribution) soliton interactions. We investigate the exact bright-bright N-soliton solution of an effective one-dimensional (1D) two component BEC by suitably tailoring the trap potential, atomic scattering length, and atom gain or loss. In particular, we show that the effective 1D coupled Gross-Pitaevskii equations with time dependent parameters can be transformed into the well known completely integrable Manakov model described by coupled nonlinear Schroedinger equations by effecting a change of variables of the coordinates and the wave functions under certain conditions related to the time dependent parameters. We obtain the one-soliton solution and demonstrate the shape changing/matter redistribution interactions of two and three-soliton solutions for the time-independent expulsive harmonic trap potential, periodically modulated harmonic trap potential, and kinklike modulated harmonic trap potential. The standard elastic collision of solitons occur only for a specific choice of soliton parameters.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

iCycle: Integrated, multicriterial beam angle, and profile optimization for generation of coplanar and noncoplanar IMRT plans

Purpose: To introduce iCycle, a novel algorithm for integrated, multicriterial optimization of beam angles, and intensity modulated radiotherapy (IMRT) profiles. Methods: A multicriterial plan optimization with iCycle is based on a prescription called wish-list, containing hard constraints and objectives with ascribed priorities. Priorities are ordinal parameters used for relative importance ranking of the objectives. The higher an objective priority is, the higher the probability that the corresponding objective will be met. Beam directions are selected from an input set of candidate directions. Input sets can be restricted, e.g., to allow only generation of coplanar plans, or to avoid collisions between patient/couch and the gantry in a noncoplanar setup. Obtaining clinically feasible calculation times was an important design criterium for development of iCycle. This could be realized by sequentially adding beams to the treatment plan in an iterative procedure. Each iteration loop starts with selection of the optimal direction to be added. Then, a Pareto-optimal IMRT plan is generated for the (fixed) beam setup that includes all so far selected directions, using a previously published algorithm for multicriterial optimization of fluence profiles for a fixed beam arrangement Breedveld et al.[Phys. Med. Biol. 54, 7199-7209 (2009)]. To select the next direction, each not yet selected candidate direction is temporarily added to the plan and an optimization problem, derived from the Lagrangian obtained from the just performed optimization for establishing the Pareto-optimal plan, is solved. For each patient, a single one-beam, two-beam, three-beam, etc. Pareto-optimal plan is generated until addition of beams does no longer result in significant plan quality improvement. Plan generation with iCycle is fully automated. Results: Performance and characteristics of iCycle are demonstrated by generating plans for a maxillary sinus case, a cervical cancer patient, and a liver patient treated with SBRT. Plans generated with beam angle optimization did better meet the clinical goals than equiangular or manually selected configurations. For the maxillary sinus and liver cases, significant improvements for noncoplanar setups were seen. The cervix case showed that also in IMRT with coplanar setups, beam angle optimization with iCycle may improve plan quality. Computation times for coplanar plans were around 1-2 h and for noncoplanar plans 4-7 h, depending on the number of beams and the complexity of the site. Conclusions: Integrated beam angle and profile optimization with iCycle may result in significant improvements in treatment plan quality. Due to automation, the plan generation workload is minimal. Clinical application has started.

62 RADIOLOGY AND NUCLEAR MEDICINE↗

Introduction of a novel ultrahigh sensitivity collimator for brain SPECT imaging

Purpose: Noise levels of brain SPECT images are highest in central regions, due to preferential attenuation of photons emitted from deep structures. To address this problem, the authors have designed a novel collimator for brain SPECT imaging that yields greatly increased sensitivity near the center of the brain without loss of resolution. This hybrid collimator consisted of ultrashort cone-beam holes in the central regions and slant-holes in the periphery (USCB). We evaluated this collimator for quantitative brain imaging tasks. Methods: Owing to the uniqueness of the USCB collimation, the hole pattern required substantial variations in collimator parameters. To utilize the lead-casting technique, the authors designed two supporting plates to position about 37 000 hexagonal, slightly tapered pins. The holes in the supporting plates were modeled to yield the desired focal length, hole length, and septal thickness. To determine the properties of the manufactured collimator and to compute the system matrix, the authors prepared an array of point sources that covered the entire detector area. Each point source contained 32 μCi of Tc-99m at the first scan time. The array was imaged for 5 min at each of the 64 shifted locations to yield a 2-mm sampling distance, and hole parameters were calculated. The sensitivity was also measured using a point source placed along the central ray at several distances from the collimator face. High-count projection data from a five-compartment brain phantom were acquired with the three collimators on a dual-head SPECT/CT system. The authors calculated Cramer-Rao bounds on the precision of estimates of striatal and background activity concentration. In order to assess the new collimation system to detect changes in striatal activity, the authors evaluated the precision of measuring a 5% decrease in right putamen activity. The authors also reconstructed images of projection data obtained by summing data from the individual phantom compartments. Results: The sensitivity of the novel cone-beam collimator varied with distance from the detector face; it was higher than that of the fan-beam collimator by factors ranging from 2.7 to 162. Examination of the projections of the point sources revealed that only a few holes were distorted or partially blocked, indicating that the intensive manual fabrication process was very successful. Better reconstructed phantom images were obtained from the USCB+FAN collimator pair than from either LEHR or FAN collimation. For the left caudate, located near the center of the brain, the detected counts were 9.8 (8.3) times higher for UCSB compared with LEHR (FAN), averaged over 60 views. The task-specific SNR for detecting a 5% decrease in putamen uptake was 7.4 for USCB and 3.2 for LEHR. Conclusions: The authors have designed and manufactured a novel collimator for brain SPECT imaging. The sensitivity is much higher than that of a fan-beam collimator. Because of differences between the manufactured collimator and its design, reconstruction of the data requires a measured system matrix. The authors have demonstrated the potential of USCB collimation for improved precision in estimating striatal uptake. The novel collimator may be useful for early detection of Parkinson’s disease, and for monitoring therapy response and disease progression.

60 APPLIED LIFE SCIENCES↗

A method for volumetric imaging in radiotherapy using single x-ray projection

Purpose: It is an intriguing problem to generate an instantaneous volumetric image based on the corresponding x-ray projection. The purpose of this study is to develop a new method to achieve this goal via a sparse learning approach. Methods: To extract motion information hidden in projection images, the authors partitioned a projection image into small rectangular patches. The authors utilized a sparse learning method to automatically select patches that have a high correlation with principal component analysis (PCA) coefficients of a lung motion model. A model that maps the patch intensity to the PCA coefficients was built along with the patch selection process. Based on this model, a measured projection can be used to predict the PCA coefficients, which are then further used to generate a motion vector field and hence a volumetric image. The authors have also proposed an intensity baseline correction method based on the partitioned projection, in which the first and the second moments of pixel intensities at a patch in a simulated projection image are matched with those in a measured one via a linear transformation. The proposed method has been validated in both simulated data and real phantom data. Results: The algorithm is able to identify patches that contain relevant motion information such as the diaphragm region. It is found that an intensity baseline correction step is important to remove the systematic error in the motion prediction. For the simulation case, the sparse learning model reduced the prediction error for the first PCA coefficient to 5%, compared to the 10% error when sparse learning was not used, and the 95th percentile error for the predicted motion vector was reduced from 2.40 to 0.92 mm. In the phantom case with a regular tumor motion, the predicted tumor trajectory was successfully reconstructed with a 0.82 mm error for tumor center localization compared to a 1.66 mm error without using the sparse learning method. When the tumor motion was driven by a real patient breathing signal with irregular periods and amplitudes, the average tumor center error was 0.6 mm. The algorithm robustness with respect to sparsity level, patch size, and presence or absence of diaphragm, as well as computation time, has also been studied. Conclusions: The authors have developed a new method that automatically identifies motion information from an x-ray projection, based on which a volumetric image is generated.

60 APPLIED LIFE SCIENCES↗