Search NASA⌕ Search

SEARCH · Search NASA

Results for “linear programming problem”

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

Classical combinatorial optimization scaling for random Ising models on 2D heavy-hex graphs

Motivated by near term quantum computing hardware limitations, combinatorial optimization problems that can be addressed by current quantum algorithms and noisy hardware with little or no overhead are used to probe capabilities of quantum algorithms such as the quantum approximate optimization algorithm. In this study, a specific class of near term quantum computing hardware defined combinatorial optimization problems, Ising models on heavy-hex graphs both with and without geometrically local cubic terms, are examined for their classical computational hardness via empirical computation time scaling quantification. Specifically the time-to-solution (TTS) metric using the classical heuristic simulated annealing is measured for finding optimal variable assignments (ground states), as well as the time required for the optimization software Gurobi to find an optimal variable assignment. Because of the sparsity of these Ising models, the classical algorithms are able to find optimal solutions efficiently even for large instances (i.e. 100 000 spin variables). The Ising models both with and without geometrically local cubic terms exhibit average-case linear-time or weakly quadratic scaling when solved exactly using Gurobi, and the Ising models with no cubic terms show evidence of exponential-time TTS scaling when sampled using simulated annealing. These findings point to the necessity of developing and testing more complex, namely more densely connected, optimization problems in order for quantum computing to ever have a practical advantage over classical computing. Our results are another illustration that different classical algorithms can indeed have exponentially different running times, thus making the identification of the best practical classical technique important in any quantum computing vs. classical computing comparison.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Optimization of Energy Storage System Economics and Controls by Incorporating Battery Degradation Costs in REopt

The use of stationary electrochemical energy storage systems utilizing lithium-ion batteries has increased rapidly as the production scale and price for lithium-ion batteries has decreased. These energy storage systems are crucial for maintaining grid resiliency, especially for grids operating with high penetration of renewable energy generation assets or for with a variety of distributed energy generation and storage systems. One challenging factor for the development of battery energy storage systems is estimating the proper sizing, in terms of both power and energy, that minimizes total costs over the lifetime of the systems; this calculation is difficult in simple cases, where a battery is costed independently, but is extremely challenging when building loads and electrical generation by photovoltaic resources are also considered. REopt is a techoeconomic optimization tool developed by NREL to address these challenges. Previously, battery degradation has been priced by simply assuming a 10-year replacement schedule for battery systems. However, this does not account for varying degradation trends observed across real-world batteries, or allow for batteries to be operated in a degradation-aware manner that optimizes battery dispatch based on operating costs. This work incorporates a battery life model into REopt. This battery life model is simple, so that it may be solvable within the constrains of a mixed-integer linear optimization problem, but is fit to accelerated aging data recorded in the lab. To achieve the best possible accuracy for lifetime estimates given these constraints, parameters for the battery life model in REopt are estimated by fitting 20-year simulations of battery life after identifying state-space battery degradation model from accelerated aging data. Comparisons of battery life predicted in REopt and from the state-space battery degradation model to ensure validity of lifetime estimates made by REopt. Battery life and cost is optimized by controlling three decision to minimize system life cost: battery sizing, daily state-of-charge, and daily energy-throughput. The cost of battery degradation as a function of these control variables is then estimated assuming two possible maintenance strategies: replacement, where the entire battery system is replaced if cell reach an end-of-life capacity threshold; and augmentation, which establishes a fund to pay for continual purchase of new batteries to maintain the initial energy capacity of the system. These two strategies offer conservative (for replacement) and optimistic (for augmentation) bounds for total system cost. The degradation cost incurred by these strategies is then used to control battery dispatch decisions, operating the battery in a degradation-aware manner that maximizes battery lifetime while also providing energy when favorable. Because the mixed-integer linear program has perfect foresight of future energy needs, batteries with degradation costs are always operated using 'just-in-time' charging, which is unrealistic, as no energy is left in the storage system to perform other energy services or to serve as emergency back-up power. To combat this, an inequality constraint on the average annual state-of-charge is imposed, and the sensitivity of system cost to average stored energy, e.g., the cost of system resiliency, can be quantified. Analysis of results has several conclusions, for instance, oversizing of battery storage systems is not a cost burden when battery storage is an optimal solution, as any additional battery capacity can simply be utilized to avoid costs of purchasing energy from a utility.

battery↗

Approximating a linear multiplicative objective in watershed management optimization

Implementing management practices in a cost-efficient manner is critical for regional efforts to reduce the amount of pollutants entering the Chesapeake Bay. We study the problem of selecting a subset of practices that minimizes pollutant load—subject to budgetary and environmental constraints—as simulated in a widely used regulatory watershed model. Mimicking the computation of pollutant load in the regulatory model, we formulate this problem as a continuous optimization model with a linear multiplicative objective function and linear constraints. To lay the groundwork for incorporating additional stakeholder requirements in the future, especially those that would require integer variables, we present and study a continuous linear optimization model that approximates the nonlinear model. The linear model, which requires an exponential number of variables, arises naturally as an alternative model for the same underlying physical process. We examine the theoretical behavior of these optimization models and investigate restrictions of the linear model to handle its large number of variables. Through extensive computational tests on real and randomly generated instances, we demonstrate that the linear model and its restrictions provide optimal solutions close to those of the nonlinear model in practice, despite poor approximation properties in the worst case. We conclude that the linear model—together with our approach to handling its large number of variables—provides a viable framework from which to extend the optimization model to better meet the needs of the Chesapeake Bay watershed management stakeholders.

54 ENVIRONMENTAL SCIENCES↗

WE-D-BRA-01: FEATURED PRESENTATION and BEST IN PHYSICS (THERAPY): Predicting Potentially Problematic VMAT Treatment Plans Before Patient Specific QA Measurements

Purpose: Several promising IMRT QA tools have been developed in recent years to combat problems found in the lack of sensitivity in planar dose measurements analyzed using consensus gamma analysis criteria. The increased complexity and added information with such devices adds not only increased time, but new challenges in determining endpoints for pass/fail criteria. Using a large cohort of previously measured planar IMRT QA data, it may be possible to correlate potentially problematic plans with calculated plan metrics that can be done a priori, such that these tools can be used only in clinically relevant situations. Methods: 90 previously measured, clinically delivered VMAT plans were exported in DICOM RT format. Using a Matlab program, plan metrics were computed based on a previously developed set of equations (Du et al. 2014). These metrics included MU-weighted beam irregularity, which quantifies an MLC shape’s deviation from that of a circle. Machine delivery parameters such as MU delivered per degree and leaf movement in millimeters per MU were also calculated. Based on a previous analysis of 394 IMRT QA measurements, a “failing” plan was defined as one with less than 85% gamma pass rate when computed at 1% dose difference and 2 mm distance to agreement; 16 of the 90 plans were identified as failing Results: A ROC curve was generated with an AUC of 0.9409. All 16 outliers were detected with a specificity of 85.1% when using a threshold value based on a linear combination of the MU-weighted plan irregularity and the leaf speed in mm/degree (average MU delivered per degree multiplied by average leaf movement in mm per MU). Conclusion: This data supports that potentially problematic VMAT plans can possibly be predicted before measurement by assessing the MU-weighted irregularity of the MLC shapes combined with the averaged leaf speed of the MLC.

60 APPLIED LIFE SCIENCES↗

2012 Joint Research Target (JRT) Final Report

The report summarizes: [1] Diagnostic upgrades and analysis improvements that support the JRT; [2] Descriptions of new experiments and a brief summary of findings; [3] New analysis of previous experiments; [4] Plans for further data analysis and recommendations for further work; [5] Scientific publications that are derived from or contributed directly to the JRT. The report is organized as follows: Section 1: Describes inter-machine comparisons that were facilitated by the JRT focus. Similarities and differences found on the different facilities are outlined, and plans for additional analysis of data and supporting simulations are described.Section 2: Reviews diagnostic development, experiments and results from C-Mod. C-Mod dedicated 13.1 run days to the JRT divided among 10 experimental proposals. These were organized into three general thrust areas that represent distinct experimental approaches to realizing the regimes called for in the JRT description. Initial comparisons with linear and nonlinear simulation have been carried out for these experiments, and plans for an extensive campaign of analysis have been outlined. Section 3: Reviews results from DIII-D including new experiments, detailed comparisons of simulations to previously collected data and connections between the new work and past research. Four experimental days were dedicated to the JRT in 2012. These included studies of L-modes, H-modes and QH-modes. Section 4: Summarizes new analysis of data collected before the NSTX shutdown. The work focuses on the roles of low and high-k turbulence; collisionality scans and impurity particle transport.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

LOGISTIC FUNCTION PROFILE FIT: A least-squares program for fitting interface profiles to an extended logistic function

The extended logistic function provides a physically reasonable description of interfaces such as depth profiles or line scans of surface topological or compositional features. It describes these interfaces with the minimum number of parameters, namely, position, width, and asymmetry. Logistic Function Profile Fit (LFPF) is a robust, least-squares fitting program in which the nonlinear extended logistic function is linearized by a Taylor series expansion (equivalent to a Newton-Raphson approach) with no apparent introduction of bias in the analysis. The program provides reliable confidence limits for the parameters when systematic errors are minimal and provides a display of the residuals from the fit for the detection of systematic errors. The program will aid researchers in applying ASTM E1636-10, 'Standard practice for analytically describing sputter-depth-profile and linescan-profile data by an extended logistic function,' and may also prove useful in applying ISO 18516: 2006, 'Surface chemical analysis-Auger electron spectroscopy and x-ray photoelectron spectroscopy-determination of lateral resolution.' Examples are given of LFPF fits to a secondary ion mass spectrometry depth profile, an Auger surface line scan, and synthetic data generated to exhibit known systematic errors for examining the significance of such errors to the extrapolation of partial profiles.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

SEGUID v2: Extending SEGUID checksums for circular, linear, single- and double-stranded biological sequences

Background Synthetic biology involves combining different DNA fragments, each containing functional biological parts, to address specific problems. Fundamental gene-function research often requires cloning and propagating DNA fragments, such as those from the iGEM Parts Registry or Addgene, typically distributed as circular plasmids. Addgene’s repository alone offers around 150,000 plasmids. To ensure data integrity, cryptographic checksums can be calculated for the sequences. Each sequence has a unique checksum, making checksums useful for validation and quick lookups of associated annotations. For example, the SEGUID checksum uniquely identifies protein sequences with a 27-character string. Objectives The original SEGUID, while effective for protein sequences and single-stranded DNA (ssDNA), is not suitable for circular DNA since there is no natural starting position nor for double-stranded DNA (dsDNA) since two separate sequences are present. Challenges include how to uniquely represent linear dsDNA, circular ssDNA, and circular dsDNA. To meet these needs, we propose SEGUID v2, which extends the original SEGUID to handle additional types of sequences. Conclusions SEGUID v2 produces orientation and rotation invariant checksums for single-stranded, double-stranded, possibly staggered, linear, and circular DNA and RNA sequences. Customizable alphabets allow for other types of sequences. In contrast to the original SEGUID, which uses Base64, SEGUID v2 uses Base64url to encode the SHA-1 hash. This ensures SEGUID v2 checksums can be used as-is in filenames, regardless of platform, and in URLs, with minimal friction. Availability SEGUID v2 is readily available for major programming languages, distributed under the MIT license. JavaScript package seguid is available on npm, Python package seguid on PyPi, R package seguid on CRAN, and a Tcl script on GitHub. These tools, along with documentation, examples, and an online SEGUID Calculator , can be found at https://www.seguid.org .

Pereira, Humberto↗

GraphBLAST: A High-Performance Linear Algebra-based Graph Framework on the GPU

High-performance implementations of graph algorithms are challenging to implement on new parallel hardware such as GPUs, because of three challenges: (1) difficulty of coming up with graph building blocks, (2) load imbalance on parallel hardware, and (3) graph problems having low arithmetic intensity. To address these challenges, GraphBLAS is an innovative, on-going effort by the graph analytics community to propose building blocks based in sparse linear algebra, which will allow graph algorithms to be expressed in a performant, succinct, composable and portable manner. In this paper, we examine the performance challenges of a linear algebra-based approach to building graph frameworks and describe new design principles for overcoming these bottlenecks. Among the new design principles is exploiting input sparsity, which allows users to write graph algorithms without specifying push and pull direction. Exploiting output sparsity allows users to tell the backend which values of the output in a single vectorized computation they do not want computed. Load-balancing is an important feature for balancing work amongst parallel workers. We describe the important load-balancing features for handling graphs with different characteristics. The design principles described in this paper have been implemented in "GraphBLAST", the first open-source linear algebra-based graph framework on GPU targeting high-performance computing. The results show that on a single GPU, GraphBLAST has on average at least an order of magnitude speedup over previous GraphBLAS implementations SuiteSparse and GBTL, comparable performance to the fastest GPU hardwired primitives and shared-memory graph frameworks Ligra and Gunrock, and better performance than any other GPU graph framework, while offering a simpler and more concise programming model.

97 MATHEMATICS AND COMPUTING↗

Gyrokinetic Particle Simulation of Turbulent Transport in Burning Plasmas (GPS - TTBP) Final Report

The goal of this project is the development of the Gyrokinetic Toroidal Code (GTC) Framework and its applications to problems related to the physics of turbulence and turbulent transport in tokamaks,. The project involves physics studies, code development, noise effect mitigation, supporting computer science efforts, diagnostics and advanced visualizations, verification and validation. Its main scientific themes are mesoscale dynamics and non-locality effects on transport, the physics of secondary structures such as zonal flows, and strongly coherent wave-particle interaction phenomena at magnetic precession resonances. Special emphasis is placed on the implications of these themes for rho-star and current scalings and for the turbulent transport of momentum. GTC-TTBP also explores applications to electron thermal transport, particle transport; ITB formation and cross-cuts such as edge-core coupling, interaction of energetic particles with turbulence and neoclassical tearing mode trigger dynamics. Code development focuses on major initiatives in the development of full-f formulations and the capacity to simulate flux-driven transport. In addition to the full-f -formulation, the project includes the development of numerical collision models and methods for coarse graining in phase space. Verification is pursued by linear stability study comparisons with the FULL and HD7 codes and by benchmarking with the GKV, GYSELA and other gyrokinetic simulation codes. Validation of gyrokinetic models of ion and electron thermal transport is pursed by systematic stressing comparisons with fluctuation and transport data from the DIII-D and NSTX tokamaks. The physics and code development research programs are supported by complementary efforts in computer sciences, high performance computing, and data management.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Resistive wall tearing mode disruptions in DIII-D and ITER tokamaks

Disruptions are a serious problem in tokamaks, in which thermal and magnetic energy confinement is lost. This paper uses data from the DIII-D experiment, theory, and simulations to demonstrate that resistive wall tearing modes (RWTMs) produce the thermal quench (TQ) in a typical locked mode shot. Analysis of the linear RWTM dispersion relation shows the parameter dependence of the growth rate, particularly on the resistive wall time. Linear simulations of the locked mode equilibrium show that it is unstable with a resistive wall and stable with an ideally conducting wall. Nonlinear simulations demonstrate that the RWTM grows to sufficient amplitude to cause a complete thermal quench. The RWTM growth time is proportional to the thermal quench time. Here, the nonlinearly saturated RWTM magnetic perturbation amplitude agrees with experimental measurements. The onset condition is that the q = 2 rational surface is sufficiently close to the resistive wall. Collectively, this identifies the RWTM as the cause of the TQ. In ITER, RWTMs will produce long TQ times compared to present-day experiments. ITER disruptions may be significantly more benign than previously predicted.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Optimal Renewable Resource Allocation and Load Scheduling of Resilient Communities

This paper presents a methodology for enhancing community resilience through optimal renewable resource allocation and load scheduling in order to minimize unserved load and thermal discomfort. The proposed control architecture distributes the computational effort and is easier to be scaled up than traditional centralized control. The decentralized control architecture consists of two layers: The community operator layer (COL) allocates the limited amount of renewable energy resource according to the power flexibility of each building. The building agent layer (BAL) addresses the optimal load scheduling problem for each building with the allowable load determined by the COL. Both layers are formulated as a model predictive control (MPC) based optimization. Simulation scenarios are designed to compare different combinations of building weighting methods and objective functions to provide guidance for real-world deployment by community and microgrid operators. The results indicate that the impact of power flexibility is more prominent than the weighting factor to the resource allocation process. Allocation based purely on occupancy status could lead to an increase of PV curtailment. Further, it is necessary for the building agent to have multi-objective optimization to minimize unserved load ratio and maximize comfort simultaneously.

model predictive control↗

An Ultra-Precise System for Electrical Resistivity Tomography Measurements

The objective of this research was to determine the feasibility of building and operating an ERT system that will allow measurement precision that is an order of magnitude better than existing systems on the market today and in particular if this can be done without significantly greater manufacturing or operating costs than existing commercial systems. Under this proposal, we performed an estimation of measurement errors in galvanic resistivity data that arise as a consequence of the type of electrode material used to make the measurements. In our laboratory, measurement errors for both magnitude and induced polarization (IP) were estimated using the reciprocity of data from an array of electrodes as might be used for electrical resistance tomography using 14 different metals as well as one non-metal - carbon. In a second phase of this study, using archival data from two long-term ERT surveys, we examined long-term survivability of electrodes over periods of several years. The survey sites were: the Drift Scale Test at Yucca Mountain, Nevada (which was sponsored by the U. S. Department of Energy as part of the civilian radioactive waste management program), and a water infiltration test at a site adjacent to the New Mexico Institute of Mines and Technology in Socorro, New Mexico (sponsored by the Sandia/Tech vadose program). This enabled us to compare recent values with historical values and determine electrode performance over the long-term as well as the percentage of electrodes that have failed entirely. We have constructed a prototype receiver system, made modifications and revised the receiver design. The revised prototype uses a new 24 bit analog to digital converter from Linear Technologies with amplifier chips from Texas Instruments. The input impedance of the system will be increased from 107 Ohms to approximately 1010 Ohms. The input noise level of the system has been decreased to approximately 10 Nanovolts and system resolution to about 1 Nanovolt at the highest gain range of 125 to 1. The receiver also uses very high precision and high temperature stability components. The goal is to improve the accuracy to better than 0.1%. The system has more receiver channels, eight, to allow efficient data collection at lower base frequencies. We are also implementing a frequency-domain acquisition mode in addition to the time-domain acquisition mode used in the earlier systems. Initial field tests were started in the fall of 2008. We conducted tests on a number of types of cable commonly used for resistivity surveys. A series of different tests were designed to determine if the couplings were primarily resistive, capacitive, or inductive in nature and to ascertain that the response was due to the cable cross-talk and did not depend on the receiver electronics. The results show that the problem appears to be primarily capacitive in nature and does not appear to be due to problems in the receiver electronics. Thus a great deal of emphasis has been placed on finding appropriate cables as well as stable electrodes that have low contact impedance at the very low current flows observed at the receiver. One of the issues in survey design and data collection has been determining how long one must wait before using the same electrode as a transmitter and as a receiver. A series of tests was completed in the laboratory sand tank where four-electrode measurements were made using the same dipole transmitters and dipole receivers (the dipoles used adjacent electrodes). For each data series, a single set of normal measurements were collected with no reciprocals and electrodes were never reused as a receiver after being used as a transmitter. After waiting a specified length of time, the reciprocal measurements were collected using a schedule of measurements. The order of this second schedule was rearranged such that if this second set of measurements were performed without first using the normal schedule, no electrode would be used as a receiver after being used as a transmitter. For this study, we cannot conclude that increasing the wait time increased or decreased the reciprocal errors, only that there was not a dramatic change in results with different wait times. Another issue in ERT data collection is the potential for the transmitter as well as the receiver end of an ERT system to create problems with reciprocity readings. Existing ERT systems typically use a constant voltage source. For the transmitter dipole, a constant voltage source has low output impedance, whereas a constant current source has high output impedance. Therefore, we devised an experiment to determine if a constant current source transmitter might produce smaller errors than a constant voltage source. These preliminary results suggest there is little or no difference in either resistivity or chargeability reciprocal errors using a constant voltage or constant current dipole drive source.

47 OTHER INSTRUMENTATION↗

Innovative Divertor Development to Solve the Plasma Heat-Flux Problem

Large, localized plasma heat exhaust continues to be one of the critical problems for the development of tokamak fusion reactors. Excessive heat flux erodes and possibly melts plasma-facing materials, thereby dramatically shortening their lifetime and increasing the impurity contamination of the core plasma. A detailed assessment by the ITER team for their divertor has revealed substantial limitations on the operational space imposed by the divertor performance. For a fusion reactor, the problem becomes worse in that the divertor must accommodate 20% of the total fusion power (less any broadly radiated loss), while not allowing excess buildup of tritium in the walls nor excessive impurity production. This is an extremely challenging set of problems that must be solved for fusion to succeed as a power source; it deserves a substantial research investment. Material heat-flux constraints: Results from present-day tokamaks show that there are two major limitations of peak plasma heat exhaust. The first is the continuous flow of power to the divertor plates and nearby surfaces that, for present technology, is limited to 10-20 MW/m{sup 2}. The second is the transient peak heat-flux that can be tolerated in a short time, {tau}{sub m}, before substantial ablation and melting of the surface occurs; such common large transient events are Edge Localized Mode (ELMs) and disruptions. The material limits imposed by these events give a peak energy/{tau}{sub m}{sup 1/2} parameter of {approx} 40 MJ/m{sup 2}s{sup 1/2} [1]. Both the continuous and transient limits can be approached by input powers in the largest present-day devices, and future devices are expected to substantially exceed the limits unless a solution can be found. Since the early 90's LLNL has developed the analytic and computational foundation for analyzing divertor plasmas, and also suggested and studied a number of solid and liquid material concepts for improving divertor/wall performance, with the most recent being the Snowflake divertor concept [2] and generating Resonant Magnetic Perturbations by the SOL currents [3]. However, the specific approaches discussed here are part of a wider class of innovative divertor ideas that have come from the community in the last several years, and we certainly advocate the need to consider a range of options. Indeed, the most effective solution to the heat-flux problem may well contain features of various ideas. For example, there are the X-divertor (Kotschenreuther et al. [4]) that expands the magnetic flux surface in the vicinity of the near-X-point divertor plate, and the super X-divertor (Valanju et al. [5]) that guides the near-separatrix SOL flux tubes to a larger major radius to increase the surface area available for power deposition. These approaches have the common feature of manipulation of the edge magnetic geometry. Another approach is the use of liquid divertor surfaces that can increase the heat-flux capability by flowing the heated material to a cooling region and eventually out of the machine, and/or by being able to withstand a higher peak heat flux [6]. All of these areas are only emerging concepts that require substantially more analysis and definitive experimental tests, and given the need for a large improvement in this area, we advocate a substantial program to systematically assess the approaches. Because of space limitation here, we present some details of one of the concepts, namely the Snowflake divertor configuration. The Snowflake (SF) divertor [2] exploits a tokamak geometry in which the poloidal magnetic field varies quadratically with distance from the X-point null, {Delta}r. The name stems from the characteristic hexagonal, snowflake-like, shape of the multi-branched separatrix for this exact second-order null. In contrast, the standard X-point configuration has a poloidal field varying linearly with ?r. The different variations mean that a flux expansion is much larger in the vicinity of a null of a snowflake divertor, and one can try to exploit this fact for reducing the divertor heat load. A unique feature here is also that the shear in the magnetic field near the X-point is substantially larger for the SF configuration, which may favorably affect microinstabilities and ELMs. Practical realization appears straightforward; the SF can be obtained using existing poloidal field coils in various present-day devices, and in general can be produced with coils located well outside the vacuum vessel. The SF configuration increases the flux expansion near the X-point that can be exploited by some increase in the plate wetted area, longer field-line length, and larger volume for impurity radiation. Initial UEDGE simulations comparing the SF with the standard divertor for the same conditions show a reduction in the peak heat flux for the SF of {approx}1.2-1.6 when comparing cases for the same angle of the total magnetic field to the divertor plate [7].

29 ENERGY PLANNING, POLICY, AND ECONOMY↗

Electrostatic Matching of a High Current Proton Beam to a RFQ

In order to demonstrate the operation of a prototype DWA (dielectric wall accelerator), it was necessary to modify the LEBT of a commercially procured proton RFQ (Radio Frequency Quadrupole) injector linac. The relatively high output current (35 mA) of the duoplasmatron ion source at the low injection energy of 35 keV to the RFQ presented a matching problem in the beam transport due to the high space charge, the fixed transport length, and the small beam size required at the RFQ. In addition, only the use of electrostatic lenses was considered in order to minimize the size of the system. The standard AccSys design using one decel-accel einzel lens proved to be insufficient, so three new solutions were proposed, each using a pair of decelerating einzel lenses. The tool used to optimize these designs was a newly developed feature of the program IGUN. The RFQ acceptance ellipse is plotted on top of the phase space data of the transport calculation together with an ellipse with the same Twiss parameters which just encloses all the trajectories. The quality of matching is then given as the ratio of the areas of these two ellipses, making optimization easy. This paper will present the results of this optimization and the performance of the actual equipment built and tested.

43 PARTICLE ACCELERATORS↗

THERMAL DIAGNOSTICS WITH THE ATMOSPHERIC IMAGING ASSEMBLY ON BOARD THE SOLAR DYNAMICS OBSERVATORY: A VALIDATED METHOD FOR DIFFERENTIAL EMISSION MEASURE INVERSIONS

We present a new method for performing differential emission measure (DEM) inversions on narrow-band EUV images from the Atmospheric Imaging Assembly (AIA) on board the Solar Dynamics Observatory. The method yields positive definite DEM solutions by solving a linear program. This method has been validated against a diverse set of thermal models of varying complexity and realism. These include (1) idealized Gaussian DEM distributions, (2) 3D models of NOAA Active Region 11158 comprising quasi-steady loop atmospheres in a nonlinear force-free field, and (3) thermodynamic models from a fully compressible, 3D MHD simulation of active region (AR) corona formation following magnetic flux emergence. We then present results from the application of the method to AIA observations of Active Region 11158, comparing the region's thermal structure on two successive solar rotations. Additionally, we show how the DEM inversion method can be adapted to simultaneously invert AIA and Hinode X-ray Telescope data, and how supplementing AIA data with the latter improves the inversion result. The speed of the method allows for routine production of DEM maps, thus facilitating science studies that require tracking of the thermal structure of the solar corona in time and space.

79 ASTRONOMY AND ASTROPHYSICS↗

Peer-to-peer architectures for exascale computing : LDRD final report.

The goal of this research was to investigate the potential for employing dynamic, decentralized software architectures to achieve reliability in future high-performance computing platforms. These architectures, inspired by peer-to-peer networks such as botnets that already scale to millions of unreliable nodes, hold promise for enabling scientific applications to run usefully on next-generation exascale platforms ({approx} 10{sup 18} operations per second). Traditional parallel programming techniques suffer rapid deterioration of performance scaling with growing platform size, as the work of coping with increasingly frequent failures dominates over useful computation. Our studies suggest that new architectures, in which failures are treated as ubiquitous and their effects are considered as simply another controllable source of error in a scientific computation, can remove such obstacles to exascale computing for certain applications. We have developed a simulation framework, as well as a preliminary implementation in a large-scale emulation environment, for exploration of these 'fault-oblivious computing' approaches. High-performance computing (HPC) faces a fundamental problem of increasing total component failure rates due to increasing system sizes, which threaten to degrade system reliability to an unusable level by the time the exascale range is reached ({approx} 10{sup 18} operations per second, requiring of order millions of processors). As computer scientists seek a way to scale system software for next-generation exascale machines, it is worth considering peer-to-peer (P2P) architectures that are already capable of supporting 10{sup 6}-10{sup 7} unreliable nodes. Exascale platforms will require a different way of looking at systems and software because the machine will likely not be available in its entirety for a meaningful execution time. Realistic estimates of failure rates range from a few times per day to more than once per hour for these platforms. P2P architectures give us a starting point for crafting applications and system software for exascale. In the context of the Internet, P2P applications (e.g., file sharing, botnets) have already solved this problem for 10{sup 6}-10{sup 7} nodes. Usually based on a fractal distributed hash table structure, these systems have proven robust in practice to constant and unpredictable outages, failures, and even subversion. For example, a recent estimate of botnet turnover (i.e., the number of machines leaving and joining) is about 11% per week. Nonetheless, P2P networks remain effective despite these failures: The Conficker botnet has grown to {approx} 5 x 10{sup 6} peers. Unlike today's system software and applications, those for next-generation exascale machines cannot assume a static structure and, to be scalable over millions of nodes, must be decentralized. P2P architectures achieve both, and provide a promising model for 'fault-oblivious computing'. This project aimed to study the dynamics of P2P networks in the context of a design for exascale systems and applications. Having no single point of failure, the most successful P2P architectures are adaptive and self-organizing. While there has been some previous work applying P2P to message passing, little attention has been previously paid to the tightly coupled exascale domain. Typically, the per-node footprint of P2P systems is small, making them ideal for HPC use. The implementation on each peer node cooperates en masse to 'heal' disruptions rather than relying on a controlling 'master' node. Understanding this cooperative behavior from a complex systems viewpoint is essential to predicting useful environments for the inextricably unreliable exascale platforms of the future. We sought to obtain theoretical insight into the stability and large-scale behavior of candidate architectures, and to work toward leveraging Sandia's Emulytics platform to test promising candidates in a realistic (ultimately {ge} 10{sup 7} nodes) setting. Our primary example applications are drawn from linear algebra: a Jacobi relaxation solver for the heat equation, and the closely related technique of value iteration in optimization. We aimed to apply P2P concepts in designing implementations capable of surviving an unreliable machine of 10{sup 6} nodes.

99 GENERAL AND MISCELLANEOUS↗

Robust Molecular Predictive Methods for Novel Polymer Discovery and Applications

Polymeric materials are ubiquitous in modern society and they play an instrumental role in almost all industries, undoubtedly including the energy and environment sectors. Increased demand of energy and awareness to sustainability both necessitates the development of novel polymers with enhanced properties. Unfortunately, their structural and behavioral complexity render such discovery challenging and impeded. To address this problem, scientists are developing various computational modeling techniques and leveraging their power to depict the relationship between structural characteristics of polymers and their properties (such as rheological behaviors), and use such prediction to guide the design and syntheses of novel polymeric materials with enhanced performances. Unfortunately, predicting the relationships between polymer structure and composition with rheological properties via atomistic modeling is still a major challenge because of the extended time and length scales involved. Studying dynamic shear viscosity and linear viscoelasticity using molecular models requires capabilities that have been elusive, including representation of large molecular weight chains with an effective internal scale capable of describing entanglement, shear-rates that are in the s-1 scale with accurate quantitative stresses, and chemically-realistic combinations of both homogeneous and heterogeneous systems. Motivated by these unmet challenges, the overall technical objective of this DOE-STTR Phase II project is to develop robust molecular predictive methods for advanced polymer discovery and applications and especially for designing and demonstrating the “smart” polymer-based waterflooding enhanced oil recovery (EOR) process. In particular, we apply state-of-the-art molecular modeling methods developed by our academic partner, Materials Stimulation Center (MSC) at California Institute of Technology (Caltech), to facilitate and accelerate the experimental discovery processes. During the Phase I of this project, we had focused on development and demonstration of the molecular modeling methods to describe rheological properties of non-Newtonian polymer fluids, and to improve our fundamental understandings of shear-thickening mechanism and kinetics. In Phase II, we further apply the theoretical models to guide our experimental programs to improve our design of smart rheology modifier (SRM) polymers and their optimization for EOR. Specifically, we have three objectives in the Phase II study: (1) to further improve out computational modeling methods, coupling with the advanced machine learning algorithms; (2) to develop cost-effective and efficient SRM-flooding process suitable for EOR applications under typical reservoir conditions; and (3) to further explore the application of our molecular predictive models for innovative material discovery in other industrial applications. The recent development of our multiscale predictive framework allows the successful prediction of rheological properties from the chemical structure for polymers of experimentally relevant molecular weights, and provides an in-silico machine learning engine for screening novel compositions and structures with optimized non-Newtonian response, required for both shear-thinning and shear-thickening applications. Our framework provides: (1) procedures and tools for systematic coarsening from atomistic models and reverse mapping of coarse-grain models to atomistic, (2) unique ab initio methods to characterize the atomistic origin of colloidal and interfacial interactions and phenomena, (3) systematic structure and composition builders based on practical descriptors that drive rheological changes in polymer melts and diluted polymer mixtures, (4) a rheological properties engine capable of predicting viscosity in the zero-shear limit and under realistic dynamic conditions (for shear-rates commensurate with experiments) for large heterogeneous systems, (5) coarse-grain force fields with improved non-bond descriptions based on accurate quantum mechanics, (6) an in-silico screening machine learning engine that feeds from the systematic model builders to cover the descriptors search space, computes the rheological properties from converged trajectories spanning sub-milliseconds and ranks them for each structure/composition using an automated viscosity-vs-shear rate fitness function that can be tuned for shear-thickening, shear-thinning and other rheological responses.

02 PETROLEUM↗

Grid Optimization Competition on Synthetic and Industrial Power Systems

This paper summarizes a grid optimization (GO) competition effort in the United States to find the best solution strategies for up to interconnect-scale power system networks with around 32,000 buses. The optimization problem is a mixedinteger, non-convex non-linear problem, (MINLP) and includes discrete variables such as unit commitment and line switching, control settings (transformer taps and phase shifters with impedance correction tables), and bus shunts. The case study includes six actual industry grids as well as 16 realistic synthetic grids created by three different dataset teams. The winners are selected and ranked based on scoring criteria, which consider the solution quality (such as objective functions) within time limits. Nine winner teams are selected from 26 competitor teams. The results achieved by different teams are described and the performance of different algorithms on synthetic grids and actual industry grids are compared and analyzed.

mixed-integer non-linear programming↗