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

Visualization on supercomputing platform level II ASC milestone (3537-1B) results from Sandia.

This report provides documentation for the completion of the Sandia portion of the ASC Level II Visualization on the platform milestone. This ASC Level II milestone is a joint milestone between Sandia National Laboratories and Los Alamos National Laboratories. This milestone contains functionality required for performing visualization directly on a supercomputing platform, which is necessary for peta-scale visualization. Sandia's contribution concerns in-situ visualization, running a visualization in tandem with a solver. Visualization and analysis of petascale data is limited by several factors which must be addressed as ACES delivers the Cielo platform. Two primary difficulties are: (1) Performance of interactive rendering, which is most computationally intensive portion of the visualization process. For terascale platforms, commodity clusters with graphics processors(GPUs) have been used for interactive rendering. For petascale platforms, visualization and rendering may be able to run efficiently on the supercomputer platform itself. (2) I/O bandwidth, which limits how much information can be written to disk. If we simply analyze the sparse information that is saved to disk we miss the opportunity to analyze the rich information produced every timestep by the simulation. For the first issue, we are pursuing in-situ analysis, in which simulations are coupled directly with analysis libraries at runtime. This milestone will evaluate the visualization and rendering performance of current and next generation supercomputers in contrast to GPU-based visualization clusters, and evaluate the performance of common analysis libraries coupled with the simulation that analyze and write data to disk during a running simulation. This milestone will explore, evaluate and advance the maturity level of these technologies and their applicability to problems of interest to the ASC program. Scientific simulation on parallel supercomputers is traditionally performed in four sequential steps: meshing, partitioning, solver, and visualization. Not all of these components are necessarily run on the supercomputer. In particular, the meshing and visualization typically happen on smaller but more interactive computing resources. However, the previous decade has seen a growth in both the need and ability to perform scalable parallel analysis, and this gives motivation for coupling the solver and visualization.

99 GENERAL AND MISCELLANEOUS↗

Reviews and syntheses: Opportunities for robust use of peak intensities from high-resolution mass spectrometry in organic matter studies

Abstract. Earth's biogeochemical cycles are intimately tied to the biotic and abiotic processing of organic matter (OM). Spatial and temporal variations in OM chemistry are often studied using direct infusion, high-resolution Fourier transform mass spectrometry (FTMS). An increasingly common approach is to use ecological metrics (e.g., within-sample diversity) to summarize high-dimensional FTMS data, notably Fourier transform ion cyclotron resonance mass spectrometry (FT-ICR MS). However, problems can arise when FTMS peak-intensity data are used in a way that is analogous to abundances in ecological analyses (e.g., species abundance distributions). Using peak-intensity data in this way requires the assumption that intensities act as direct proxies for concentrations. Here, we show that comparisons of the same peak across samples (within-peak) may carry information regarding variations in relative concentration, but comparing different peaks (between-peak) within or between samples does not. We further developed a simulation model to study the quantitative implications of using peak intensities to compute ecological metrics (e.g., intensity-weighted mean properties and diversity) that rely on information about both within-peak and between-peak shifts in relative abundance. We found that, despite analytical limitations in linking concentration to intensity, ecological metrics often perform well in terms of providing robust qualitative inferences and sometimes quantitatively accurate estimates of diversity and mean molecular characteristics. We conclude with recommendations for the robust use of peak intensities for natural organic matter studies. A primary recommendation is the use and extension of the simulation model to provide objective guidance on the degree to which conceptual and quantitative inferences can be made for a given analysis of a given dataset. Broad use of this approach can help ensure rigorous scientific outcomes from the use of FTMS peak intensities in environmental applications.

54 ENVIRONMENTAL SCIENCES↗

Plane elastostatic analysis of V-notched plates.

Solutions are given for several plane elastostatic problems of plates having a V-notch on one edge, and subjected to a variety of boundary conditions. The effect of the magnitude of the V-notch angle and specimen geometry on stress intensity factors KI and KII are obtained for unloaded notch surfaces. There is less than one per cent difference in opening model stress intensity factor in going from a zero degree notch angle to a 30 degree notch angle. Notch opening displacements at the plate edge were measured experimentally, and the results obtained were in excellent agreement with the computed results.

Gross, B.↗

Thermoelastic analysis of solar window of a vacuum chamber

It has been noted during space simulation test programs that the chamber penetration window becomes the limiting factor as the solar intensity increases. The temperature at the center of the window normally attains a level of 550 C, while the edge temperature remains at about 35 C. The stresses produced by this thermal gradient combined with the atmospheric pressure are studied within the framework of classical theory of elasticity. The solution for the problem is obtained by solving the static uncoupled thermoelastic equations for a circular blank, subjected to nonuniform heat on one face, by introduction of two auxiliary variables. The displacements are expressed in terms of Bessel functions and parameters of interest are computed at various mesh points of the window. The maximum principal stresses thus obtained show that even with steep temperature gradient, the safety factor is acceptable.

Amba-Rao, C. L.↗

Technology Assessment of High Capacity Data Storage Systems: Can We Avoid a Data Survivability Crisis?

In a recent address at the California Science Center in Los Angeles, Vice President Al Gore articulated a Digital Earth Vision. That vision spoke to developing a multi-resolution, three-dimensional visual representation of the planet into which we can roam and zoom into vast quantities of embedded geo-referenced data. The vision was not limited to moving through space, but also allowing travel over a time-line, which can be set for days, years, centuries, or even geological epochs. A working group of Federal Agencies, developing a coordinated program to implement the Vice President's vision, developed the definition of the Digital Earth as a visual representation of our planet that enables a person to explore and interact with the vast amounts of natural and cultural geo-referenced information gathered about the Earth. One of the challenges identified by the agencies was whether the technology existed that would be available to permanently store and deliver all the digital data that enterprises might want to save for decades and centuries. Satellite digital data is growing by Moore's Law as is the growth of computer generated data. Similarly, the density of digital storage media in our information-intensive society is also increasing by a factor of four every three years. The technological bottleneck is that the bandwidth for transferring data is only growing at a factor of four every nine years. This implies that the migration of data to viable long-term storage is growing more slowly. The implication is that older data stored on increasingly obsolete media are at considerable risk if they cannot be continuously migrated to media with longer life times. Another problem occurs when the software and hardware systems for which the media were designed are no longer serviced by their manufacturers. Many instances exist where support for these systems are phased out after mergers or even in going out of business. In addition, survivability of older media can suffer from physical breakdown of components (e.g. tapes simply lose their magnetic properties after a long time in storage). As a result, a potential data survivability crisis is emerging. The scale of the crisis is comparable to that facing the Social Security System. Sometime in one or two decades, the exponential growth of data will become so great that many enterprises will not be able to migrate through their data to more permanent media during the lifetime of the media on which it resides. This will result in significant losses of data and their resultant impacts. To avoid this crisis, we need to plan and devote greater financial and intellectual resources are needed for the development and refinement of new storage media and migration technologies in order to preserve all data any organization determines worth saving permanently. This talk will explore technological solutions and suggested recommendations to address this technological data crisis.

Halem, Milton↗

Approximate Weighted Matching On Emerging Manycore and Multithreaded Architectures

Graph matching is a prototypical combinatorial problem with many applications in computer science and scientific computing, but algorithms for computing optimal matchings are challenging to parallelize. Approximate matching algorithms provide an alternate route for parallelization, and in many contexts compute near-optimal matchings for large-scale graphs. We present sharedmemory parallel implementations for computing half-approximate weighted matching on state-of-the-art multicore (Intel Nehalem and AMD Magny-Cours), manycore (Nvidia Tesla and Nvidia Fermi) and massively multithreaded (Cray XMT) platforms. We provide two implementations: the first implementation uses shared work queues, and is suited to all these platforms; the second implementation is based on dataflow principles, and exploits the architectural features of the Cray XMT. Using a carefully chosen dataset that exhibits characteristics from a wide range of real-world applications, we show scalable performance across different platforms. In particular, for one instance of the input, an R-MAT graph (RMAT-G), we show speedups of: about 32 on 48 cores of an AMD Magny-Cours; 7 on 8 cores of Intel Nehalem; 3 on Nvidia Tesla and 10 on Nvidia Fermi relative to one core of Intel Nehalem; and 60 on 128 processors of Cray XMT. We demonstrate good weak and strong scaling for graphs with up to a billion edges using up to 12, 800 threads. Given the breadth of this work, we focus on simplicity and portability of software rather than excessive fine-tuning for each platform. To the best of our knowledge, this is the first such large-scale study of the half-approximate weighted matching problem on shared-memory platforms. Driven by the critical enabling role of combinatorial algorithms such as matching in scientific computing and the emergence of informatics applications, there is a growing demand to support irregular computations on current and future computing platforms. In this context, we evaluate the capability of emerging multithreaded platforms to tolerate latency induced by irregular memory access patterns, and to support fine-grained parallelism via light-weight synchronization mechanisms. By contrasting the architectural features of these platforms against the Cray XMT, which is specifically designed to support irregular memory-intensive applications, we delineate the impact of these choices on performance.

Halappanavar, Mahantesh↗

An Evolutionary Algorithm to Personalize Stool-Based Colorectal Cancer Screening

Fecal immunochemical testing (FIT) is an established method for colorectal cancer (CRC) screening. Measured FIT-concentrations are associated with both present and future risk of CRC, and may be used for personalized screening. However, evaluation of personalized screening is computationally challenging. In this study, a broadly applicable algorithm is presented to efficiently optimize personalized screening policies that prescribe screening intervals and FIT-cutoffs, based on age and FIT-history. We present a mathematical framework for personalized screening policies and a bi-objective evolutionary algorithm that identifies policies with minimal costs and maximal health benefits. The algorithm is combined with an established microsimulation model (MISCAN-Colon), to accurately estimate the costs and benefits of generated policies, without restrictive Markov assumptions. The performance of the algorithm is demonstrated in three experiments. In Experiment 1, a relatively small benchmark problem, the optimal policies were known. The algorithm approached the maximum feasible benefits with a relative difference of 0.007%. Experiment 2 optimized both intervals and cutoffs, Experiment 3 optimized cutoffs only. Optimal policies in both experiments are unknown. Compared to policies recently evaluated for the USPSTF, personalized screening increased health benefits up to 14 and 4.3%, for Experiments 2 and 3, respectively, without adding costs. Generated policies have several features concordant with current screening recommendations. The method presented in this paper is flexible and capable of optimizing personalized screening policies evaluated with computationally-intensive but established simulation models. It can be used to inform screening policies for CRC or other diseases. For CRC, more debate is needed on what features a policy needs to exhibit to make it suitable for implementation in practice.

60 APPLIED LIFE SCIENCES↗

The Road to Useful Quantum Computers

Building a useful quantum computer is a grand science and engineering challenge, currently pursued intensely by teams around the world. In the 1980s, Richard Feynman and Yuri Manin observed independently that computers based on quantum mechanics might enable better simulations of quantum phenomena. Their vision remained an intellectual curiosity until Peter Shor published his famous quantum algorithm for integer factoring, and shortly thereafter a proof that errors in quantum computations can be corrected. Since then, quantum computing R&D has progressed rapidly, from small-scale experiments in university physics laboratories to well-funded industrial efforts and prototypes. Hype notwithstanding, quantum computers have yet to solve scientifically or practically important problems -- a target often called quantum utility. In this article, we describe the capabilities of contemporary quantum computers, compare them to the requirements of quantum utility, and illustrate how to track progress from today to utility. We highlight key science and engineering challenges on the road to quantum utility, touching on relevant aspects of our own research.

Emerging Technologies (cs.ET)↗

Factors shaping the evolution of electronic documentation systems

The main goal is to prepare the space station technical and managerial structure for likely changes in the creation, capture, transfer, and utilization of knowledge. By anticipating advances, the design of Space Station Project (SSP) information systems can be tailored to facilitate a progression of increasingly sophisticated strategies as the space station evolves. Future generations of advanced information systems will use increases in power to deliver environmentally meaningful, contextually targeted, interconnected data (knowledge). The concept of a Knowledge Base Management System is emerging when the problem is focused on how information systems can perform such a conversion of raw data. Such a system would include traditional management functions for large space databases. Added artificial intelligence features might encompass co-existing knowledge representation schemes; effective control structures for deductive, plausible, and inductive reasoning; means for knowledge acquisition, refinement, and validation; explanation facilities; and dynamic human intervention. The major areas covered include: alternative knowledge representation approaches; advanced user interface capabilities; computer-supported cooperative work; the evolution of information system hardware; standardization, compatibility, and connectivity; and organizational impacts of information intensive environments.

Dede, Christopher J.↗

Methods of Heat-Exchange Intensification in NPP Equipment

The aims and problems of research on the means for intensifying heat exchange in the equipment of nuclear power plants are examined: nuclear reactors, steam generators, turbine condensers, heat-exchangers of dry water cooling towers, intermediate separators-steam superheaters of turbines, heat-exchange apparatus of safety systems, turbo-electro-generators, oil coolers, feed-water heaters. Methods of identifying heat-exchange are analyzed: different types of finning, turbulence generators and swirlers of one- and two-phase flows, coating on heating surfaces, systems with mixed flow. Computational recommendations are made for determining the intensity of heat emission from promising types of heat-exchange surfaces: bundles of lowfinned tubes and spiral coils.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

Efficient Hamiltonian encoding algorithms for extracting quantum control mechanism as interfering pathway amplitudes in the Dyson series

Hamiltonian encoding is a methodology for revealing the mechanism behind the dynamics governing controlled quantum systems. In this paper, following Mitra and Rabitz \cite{abhra_1}, we define mechanism via pathways of eigenstates that describe the evolution of the system, where each pathway is associated with a complex-valued amplitude corresponding to a term in the Dyson series. The evolution of the system is determined by the constructive and destructive interference of these pathway amplitudes. Pathways with similar attributes can be grouped together into pathway classes. The amplitudes of pathway classes are computed by modulating the Hamiltonian matrix elements and decoding the subsequent evolution of the system rather than by direct computation of the individual terms in the Dyson series. The original implementation of Hamiltonian encoding was computationally intensive and became prohibitively expensive in large quantum systems. This paper presents two new encoding algorithms that calculate the amplitudes of pathway classes by using techniques from graph theory and algebraic topology to exploit patterns in the set of allowed transitions, greatly reducing the number of matrix elements that need to be modulated. These new algorithms provide an exponential decrease in both computation time and memory utilization with respect to the Hilbert space dimension of the system. To demonstrate the use of these techniques, they are applied to two illustrative state-to-state transition problems.

Abrams, Erez [Princeton University, Massachusetts ↗

A Stochastic Model of Space-Time Variability of Tropical Rainfall: I. Statistics of Spatial Averages

Global maps of rainfall are of great importance in connection with modeling of the earth s climate. Comparison between the maps of rainfall predicted by computer-generated climate models with observation provides a sensitive test for these models. To make such a comparison, one typically needs the total precipitation amount over a large area, which could be hundreds of kilometers in size over extended periods of time of order days or months. This presents a difficult problem since rain varies greatly from place to place as well as in time. Remote sensing methods using ground radar or satellites detect rain over a large area by essentially taking a series of snapshots at infrequent intervals and indirectly deriving the average rain intensity within a collection of pixels , usually several kilometers in size. They measure area average of rain at a particular instant. Rain gauges, on the other hand, record rain accumulation continuously in time but only over a very small area tens of centimeters across, say, the size of a dinner plate. They measure only a time average at a single location. In making use of either method one needs to fill in the gaps in the observation - either the gaps in the area covered or the gaps in time of observation. This involves using statistical models to obtain information about the rain that is missed from what is actually detected. This paper investigates such a statistical model and validates it with rain data collected over the tropical Western Pacific from ship borne radars during TOGA COARE (Tropical Oceans Global Atmosphere Coupled Ocean-Atmosphere Response Experiment). The model incorporates a number of commonly observed features of rain. While rain varies rapidly with location and time, the variability diminishes when averaged over larger areas or longer periods of time. Moreover, rain is patchy in nature - at any instant on the average only a certain fraction of the observed pixels contain rain. The fraction of area covered by rain decreases, as the size of a pixel becomes smaller. This means that within what looks like a patch of rainy area in a coarse resolution view with larger pixel size, one finds clusters of rainy and dry patches when viewed on a finer scale. The model makes definite predictions about how these and other related statistics depend on the pixel size. These predictions were found to agree well with data. In a subsequent second part of the work we plan to test the model with rain gauge data collected during the TRMM (Tropical Rainfall Measuring Mission) ground validation campaign.

Kundu, Prasun K.↗

GENERALIZATION OF THE LAST SCATTERING APPROXIMATION FOR THE SECOND SOLAR SPECTRUM MODELING: THE Ca I 4227 A LINE AS A CASE STUDY

To model the second solar spectrum (the linearly polarized spectrum of the Sun that is due to coherent scattering processes), one needs to solve the polarized radiative transfer (RT) equation. For strong resonance lines, partial frequency redistribution (PRD) effects must be accounted for, which make the problem computationally demanding. The 'last scattering approximation' (LSA) is a concept that has been introduced to make this highly complex problem more tractable. An earlier application of a simple LSA version could successfully model the wings of the strong Ca I 4227 A resonance line in Stokes Q/I (fractional linear polarization), but completely failed to reproduce the observed Q/I peak in the line core. Since the magnetic field signatures from the Hanle effect only occur in the line core, we need to generalize the existing LSA approach if it is to be useful for the diagnostics of chromospheric and turbulent magnetic fields. In this paper, we explore three different approximation levels for LSA and compare each of them with the benchmark represented by the solution of the full polarized RT, including PRD effects. The simplest approximation level is LSA-1, which uses the observed center-to-limb variation of the intensity profile to obtain the anisotropy of the radiation field at the surface, without solving any transfer equation. In contrast, the next two approximation levels use the solution of the unpolarized transfer equation to derive the anisotropy of the incident radiation field and use it as an input. In the case of LSA-2, the anisotropy at level {tau}{sub {lambda}} = {mu}, the atmospheric level from which an observed photon is most likely to originate, is used. LSA-3, on the other hand, makes use of the full depth dependence of the radiation anisotropy. The Q/I formula for LSA-3 is obtained by keeping the first term in a series expansion of the Q-source function in powers of the mean number of scattering events. Computationally, LSA-1 is 21 times faster than LSA-2, which is 5 times faster than the more general LSA-3, which itself is 8 times faster than the polarized RT approach. A comparison of the calculated Q/I spectra with the RT benchmark shows excellent agreement for LSA-3, including good modeling of the Q/I core region with its PRD effects. In contrast, both LSA-1 and LSA-2 fail to model the core region. The RT and LSA-3 approaches are then applied to model the recently observed Q/I profile of the Ca I 4227 A line in quiet regions of the Sun. Apart from a global scale factor both give a very good fit to the Q/I spectra for all the wavelengths, including the core peak and blend line depolarizations. We conclude that LSA-3 is an excellent substitute for the full polarized RT and can be used to interpret the second solar spectrum, including the Hanle effect with PRD. It also allows the techniques developed for unpolarized three-dimensional RT to be applied to the modeling of the second solar spectrum.

79 ASTRONOMY AND ASTROPHYSICS↗

Theoretical molecular studies of astrophysical interest

When work under this grant began in 1974 there was a great need for state-to-state collisional excitation rates for interstellar molecules observed by radio astronomers. These were required to interpret observed line intensities in terms of local temperatures and densities, but, owing to lack of experimental or theoretical values, estimates then being used for this purpose ranged over several orders of magnitude. A problem of particular interest was collisional excitation of formaldehyde; Townes and Cheung had suggested that the relative size of different state-to-state rates (propensity rules) was responsible for the anomalous absorption observed for this species. We believed that numerical molecular scattering techniques (in particular the close coupling or coupled channel method) could be used to obtain accurate results, and that these would be computationally feasible since only a few molecular rotational levels are populated at the low temperatures thought to prevail in the observed regions. Such calculations also require detailed knowledge of the intermolecular forces, but we thought that those could also be obtained with sufficient accuracy by theoretical (quantum chemical) techniques. Others, notably Roy Gordon at Harvard, had made progress in solving the molecular scattering equations, generally using semi-empirical intermolecular potentials. Work done under this grant generalized Gordon's scattering code, and introduced the use of theoretical interaction potentials obtained by solving the molecular Schroedinger equation. Earlier work had considered only the excitation of a diatomic molecule by collisions with an atom, and we extended the formalism to include excitation of more general molecular rotors (e.g., H2CO, NH2, and H2O) and also collisions of two rotors (e.g., H2-H2).

Flynn, George↗

Analysis of crack propagation in roller bearings using the boundary integral equation method - A mixed-mode loading problem

Crack propagation in a rotating inner raceway of a high-speed roller bearing is analyzed using the boundary integral method. The model consists of an edge plate under plane strain condition upon which varying Hertzian stress fields are superimposed. A multidomain boundary integral equation using quadratic elements was written to determine the stress intensity factors KI and KII at the crack tip for various roller positions. The multidomain formulation allows the two faces of the crack to be modeled in two different subregions, making it possible to analyze crack closure when the roller is positioned on or close to the crack line. KI and KII stress intensity factors along any direction were computed. These calculations permit determination of crack growth direction along which the average KI times the alternating KI is maximum.

Ghosn, L. J.↗

Nonlinear relativistic single-electron Thomson scattering power spectrum for incoming laser of arbitrary intensity

The classical nonlinear incoherent Thomson scattering power spectrum from a single relativistic electron with incoming laser radiation of any intensity, investigated numerically by the present authors in a previous publication, displayed both an approximate quadratic behavior in frequency and a redshift of the power spectrum for high intensity incoming radiation. The present work is devoted to justify, in a more general setup, those numerical findings. Those justifications are reinforced by extending suitably analytical approaches, as developed by other authors. Moreover, our analytical treatment exhibits differences between the Doppler-like frequencies for linear and circular polarization of the incoming radiation. Those differences depend nonlinearly on the laser intensity and on the electron initial velocity and do not appear to have been displayed by previous authors. Those Doppler-like frequencies and their differences are validated by new Monte Carlo computations beyond our previuos ones and reported here.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Dose optimization with first-order total-variation minimization for dense angularly sampled and sparse intensity modulated radiation therapy (DASSIM-RT)

Purpose: A new treatment scheme coined as dense angularly sampled and sparse intensity modulated radiation therapy (DASSIM-RT) has recently been proposed to bridge the gap between IMRT and VMAT. By increasing the angular sampling of radiation beams while eliminating dispensable segments of the incident fields, DASSIM-RT is capable of providing improved conformity in dose distributions while maintaining high delivery efficiency. The fact that DASSIM-RT utilizes a large number of incident beams represents a major computational challenge for the clinical applications of this powerful treatment scheme. The purpose of this work is to provide a practical solution to the DASSIM-RT inverse planning problem. Methods: The inverse planning problem is formulated as a fluence-map optimization problem with total-variation (TV) minimization. A newly released L1-solver, template for first-order conic solver (TFOCS), was adopted in this work. TFOCS achieves faster convergence with less memory usage as compared with conventional quadratic programming (QP) for the TV form through the effective use of conic forms, dual-variable updates, and optimal first-order approaches. As such, it is tailored to specifically address the computational challenges of large-scale optimization in DASSIM-RT inverse planning. Two clinical cases (a prostate and a head and neck case) are used to evaluate the effectiveness and efficiency of the proposed planning technique. DASSIM-RT plans with 15 and 30 beams are compared with conventional IMRT plans with 7 beams in terms of plan quality and delivery efficiency, which are quantified by conformation number (CN), the total number of segments and modulation index, respectively. For optimization efficiency, the QP-based approach was compared with the proposed algorithm for the DASSIM-RT plans with 15 beams for both cases. Results: Plan quality improves with an increasing number of incident beams, while the total number of segments is maintained to be about the same in both cases. For the prostate patient, the conformation number to the target was 0.7509, 0.7565, and 0.7611 with 80 segments for IMRT with 7 beams, and DASSIM-RT with 15 and 30 beams, respectively. For the head and neck (HN) patient with a complicated target shape, conformation numbers of the three treatment plans were 0.7554, 0.7758, and 0.7819 with 75 segments for all beam configurations. With respect to the dose sparing to the critical structures, the organs such as the femoral heads in the prostate case and the brainstem and spinal cord in the HN case were better protected with DASSIM-RT. For both cases, the delivery efficiency has been greatly improved as the beam angular sampling increases with the similar or better conformal dose distribution. Compared with conventional quadratic programming approaches, first-order TFOCS-based optimization achieves far faster convergence and smaller memory requirements in DASSIM-RT. Conclusions: The new optimization algorithm TFOCS provides a practical and timely solution to the DASSIM-RT or other inverse planning problem requiring large memory space. The new treatment scheme is shown to outperform conventional IMRT in terms of dose conformity to both the targetand the critical structures, while maintaining high delivery efficiency.

61 RADIATION PROTECTION AND DOSIMETRY↗

Minimum deltaV Burn Planning for the International Space Station Using a Hybrid Optimization Technique, Level 1

The International Space Station's (ISS) trajectory is coordinated and executed by the Trajectory Operations and Planning (TOPO) group at NASA's Johnson Space Center. TOPO group personnel routinely generate look-ahead trajectories for the ISS that incorporate translation burns needed to maintain its orbit over the next three to twelve months. The burns are modeled as in-plane, horizontal burns, and must meet operational trajectory constraints imposed by both NASA and the Russian Space Agency. In generating these trajectories, TOPO personnel must determine the number of burns to model, each burn's Time of Ignition (TIG), and magnitude (i.e. deltaV) that meet these constraints. The current process for targeting these burns is manually intensive, and does not take advantage of more modern techniques that can reduce the workload needed to find feasible burn solutions, i.e. solutions that simply meet the constraints, or provide optimal burn solutions that minimize the total DeltaV while simultaneously meeting the constraints. A two-level, hybrid optimization technique is proposed to find both feasible and globally optimal burn solutions for ISS trajectory planning. For optimal solutions, the technique breaks the optimization problem into two distinct sub-problems, one for choosing the optimal number of burns and each burn's optimal TIG, and the other for computing the minimum total deltaV burn solution that satisfies the trajectory constraints. Each of the two aforementioned levels uses a different optimization algorithm to solve one of the sub-problems, giving rise to a hybrid technique. Level 2, or the outer level, uses a genetic algorithm to select the number of burns and each burn's TIG. Level 1, or the inner level, uses the burn TIGs from Level 2 in a sequential quadratic programming (SQP) algorithm to compute a minimum total deltaV burn solution subject to the trajectory constraints. The total deltaV from Level 1 is then used as a fitness function by the genetic algorithm in Level 2 to select the number of burns and their TIGs for the next generation. In this manner, the two levels solve their respective sub-problems separately but collaboratively until a burn solution is found that globally minimizes the deltaV across the entire trajectory. Feasible solutions can also be found by simply using the SQP algorithm in Level 1 with a zero cost function. This paper discusses the formulation of the Level 1 sub-problem and the development of a prototype software tool to solve it. The Level 2 sub-problem will be discussed in a future work. Following the Level 1 formulation and solution, several look-ahead trajectory examples for the ISS are explored. In each case, the burn targeting results using the current process are compared against a feasible solution found using Level 1 in the proposed technique. Level 1 is then used to find a minimum deltaV solution given the fixed number of burns and burn TIGs. The optimal solution is compared with the previously found feasible solution to determine the deltaV (and therefore propellant) savings. The proposed technique seeks to both improve the current process for targeting ISS burns, and to add the capability to optimize ISS burns in a novel fashion. The optimal solutions found using this technique can potentially save hundreds of kilograms of propellant over the course of the ISS mission compared to feasible solutions alone. While the software tool being developed to implement this technique is specific to ISS, the concept is extensible to other long-duration, central-body orbiting missions that must perform orbit maintenance burns to meet operational trajectory constraints.

Brown, Aaron J.↗