Search NASA⌕ Search

SEARCH · Search NASA

Results for “Analytic hierarchy process”

Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 109 records · Page 6

Three-state harmonic models for photoinduced charge transfer

A widely used strategy for simulating the charge transfer between donor and acceptor electronic states in an all-atom anharmonic condensedphase system is based on invoking linear response theory to describe the system in terms of an effective spin-boson model Hamiltonian. Extending this strategy to photoinduced charge transfer processes requires also taking into consideration the ground electronic state in addition to the excited donor and acceptor electronic states. In this paper, we revisit the problem of describing such nonequilibrium processes in terms of an effective three-state harmonic model. We do so within the framework of nonequilibrium Fermi’s golden rule (NE-FGR) in the context of photoinduced charge transfer in the carotenoid–porphyrin–C 60 (CPC 60 ) molecular triad dissolved in explicit tetrahydrofuran (THF). To this end, we consider different ways for obtaining a three-state harmonic model from the equilibrium autocorrelation functions of the donor–acceptor, donor–ground, and acceptor–ground energy gaps, as obtained from all-atom molecular dynamics simulations of the CPC 60 /THF system. The quantum-mechanically exact time-dependent NE-FGR rate coefficients for two different charge transfer processes in two different triad conformations are then calculated using the effective three-state model Hamiltonians as well as a hierarchy of more approximate expressions that lead to the instantaneous Marcus theory limit. Our results show that the photoinduced charge transfer in CPC 60 /THF can be described accurately by the effective harmonic three-state models and that nuclear quantum effects are small in this system.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Seasonal differences in trace element concentrations and distribution in Spartina alterniflora root tissue

This study uses nanometer-scale synchrotron X-ray nanofluorescence to investigate season differences in concentrations and distributions of major (Ca, K, S and P) and trace elements (As, Cr, Cu, Fe and Zn) in the root system of Spartina alterniflora collected from Jamaica Bay, New York, in April and September 2015. The root samples were cross-sectioned at a thickness of 10 μm. Selected areas in the root epidermis and endodermis were mapped with a sampling resolution of 100 and 200 nm, varying with the mapping areas. The results indicate that trace element concentrations in the epidermis and endodermis vary among the elements measured, possibly because of their different chemical properties or their ability to act as micronutrients for the plants. Elemental concentrations (As, Ca, Cr, Cu, Fe, K, P, S and Zn) within each individual root sample and between the root samples collected during two different seasons are both significantly different (p < 0.01). Furthermore, this study indicates that the nonessential elements (As and Cr) are significantly correlated (p < 0.01) with Fe, with high concentrations in the root epidermis, while others are not, implying that Fe may be a barrier to nonessential element transport in the root system. Hierarchy cluster analysis shows two distinct groups, one including As, Cr and Fe and the other the rest of the elements measured. Factor analysis also indicates that the processes and mechanisms controlling element transport in the root system can be different between the nutrient and nonessential elements.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

FlexIO: I/O Middleware for Location-Flexible Scientific Data Analytics

Increasingly severe I/O bottlenecks on High-End Computing machines are prompting scientists to process simulation output data online while simulations are running and before storing data on disk. There are several options to place data analytics along the I/O path: on compute nodes, on separate nodes dedicated to analytics, or after data is stored on persistent storage. Since different placements have different impact on performance and cost, there is a consequent need for flexibility in the location of data analytics. The FlexIO middleware described in this paper makes it easy for scientists to obtain such flexibility, by offering simple abstractions and diverse data movement methods to couple simulation with analytics. Various placement policies can be built on top of FlexIO to exploit the trade-offs in performing analytics at different levels of the I/O hierarchy. Experimental results demonstrate that FlexIO can support a variety of simulation and analytics workloads at large scale through flexible placement options, efficient data movement, and dynamic deployment of data manipulation functionalities.

Computer Science↗

R-parity violating decays of Bino neutralino LSPs at the LHC

The R-parity violating decays of Bino neutralino LSPs are analyzed within the context of the B - L MSSM “heterotic standard model”. These LSPs correspond to statistically determined initial soft supersymmetry breaking parameters which, when evolved using the renormalization group equations, lead to an effective theory satisfying all phenomenological requirements; including the observed electroweak vector boson masses and the Higgs mass. The explicit RPV decay channels of these LSPs into standard model particles, the analytic and numerical decay rates and the associated branching ratios are presented. The analysis of these quantities breaks into two separate calculations; first, for Bino neutralino LSPs with mass larger than MW± and, second, when the Bino neutralino mass is smaller than the electroweak scale. The RPV decay processes in both of these regions is analyzed in detail. The decay lengths of these RPV interactions are discussed. It is shown that for heavy Bino neutralino LSPs the vast majority of these decays are “prompt”, although a small, but calculable, number correspond to “displaced” decays of various lengths. The situation is reversed for light Bino LSPs, only a small number of which can RPV decay promptly. The relation of these results to the neutrino hierarchy–either normal or inverted–is discussed in detail.

79 ASTRONOMY AND ASTROPHYSICS↗

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↗

Materials data analytics for 9% Cr family steel

A materials data analytics (MDA) methodology was developed in this study to evaluate publicly available information on 9% Cr family steel and to handle nonlinear relationships and the sparsity in materials data for this alloy class. The overarching goal is to accelerate the design process as well as to reduce the time and expense associated with qualification testing of new alloys for fossil energy applications. Data entries in the analyzed data set for 82 iron–base alloy compositions, several processing parameters, and results of tensile mechanical tests selected for this study were arranged in 34 columns by 915 rows. While detailed microstructural information was not available, it is assumed that the compositional space for the 9 to 12% Cr steels is limited such that all data entries have a tempered martensitic microstructure during service. Establishing a hierarchy of first–order trends in the publicly available data requires the MDA to filter out the biases. Complexity of the phase transformations and microstructure evolution in the multicomponent alloys (using 21 chemical elements) with major influence on mechanical properties, leads to inefficiency in direct application of unbiased linear regression across the entire data space. To address the nonlinearity, analyses of tensile data were performed in composition–based clusters. Clusters corresponding to moderately frequent patterns and maximized information gain were further refined by using p–norm distance measures, matching the alloy classification groups adopted by industry. Lastly, the evolutionary method of propagating an ensemble of competing cluster–based models proved to be a viable option in dealing with scarce, multidimensional data.

36 MATERIALS SCIENCE↗

NASA System Safety Handbook: System Safety Framework and Concepts for Implementation - Volume 1

System safety assessment is defined in NPR 8715.3C, NASA General Safety Program Requirements as a disciplined, systematic approach to the analysis of risks resulting from hazards that can affect humans, the environment, and mission assets. Achievement of the highest practicable degree of system safety is one of NASA's highest priorities. Traditionally, system safety assessment at NASA and elsewhere has focused on the application of a set of safety analysis tools to identify safety risks and formulate effective controls.1 Familiar tools used for this purpose include various forms of hazard analyses, failure modes and effects analyses, and probabilistic safety assessment (commonly also referred to as probabilistic risk assessment (PRA)). In the past, it has been assumed that to show that a system is safe, it is sufficient to provide assurance that the process for identifying the hazards has been as comprehensive as possible and that each identified hazard has one or more associated controls. The NASA Aerospace Safety Advisory Panel (ASAP) has made several statements in its annual reports supporting a more holistic approach. In 2006, it recommended that "... a comprehensive risk assessment, communication and acceptance process be implemented to ensure that overall launch risk is considered in an integrated and consistent manner." In 2009, it advocated for "... a process for using a risk-informed design approach to produce a design that is optimally and sufficiently safe." As a rationale for the latter advocacy, it stated that "... the ASAP applauds switching to a performance-based approach because it emphasizes early risk identification to guide designs, thus enabling creative design approaches that might be more efficient, safer, or both." For purposes of this preface, it is worth mentioning three areas where the handbook emphasizes a more holistic type of thinking. First, the handbook takes the position that it is important to not just focus on risk on an individual basis but to consider measures of aggregate safety risk and to ensure wherever possible that there be quantitative measures for evaluating how effective the controls are in reducing these aggregate risks. The term aggregate risk, when used in this handbook, refers to the accumulation of risks from individual scenarios that lead to a shortfall in safety performance at a high level: e.g., an excessively high probability of loss of crew, loss of mission, planetary contamination, etc. Without aggregated quantitative measures such as these, it is not reasonable to expect that safety has been optimized with respect to other technical and programmatic objectives. At the same time, it is fully recognized that not all sources of risk are amenable to precise quantitative analysis and that the use of qualitative approaches and bounding estimates may be appropriate for those risk sources. Second, the handbook stresses the necessity of developing confidence that the controls derived for the purpose of achieving system safety not only handle risks that have been identified and properly characterized but also provide a general, more holistic means for protecting against unidentified or uncharacterized risks. For example, while it is not possible to be assured that all credible causes of risk have been identified, there are defenses that can provide protection against broad categories of risks and thereby increase the chances that individual causes are contained. Third, the handbook strives at all times to treat uncertainties as an integral aspect of risk and as a part of making decisions. The term "uncertainty" here does not refer to an actuarial type of data analysis, but rather to a characterization of our state of knowledge regarding results from logical and physical models that approximate reality. Uncertainty analysis finds how the output parameters of the models are related to plausible variations in the input parameters and in the modeling assumptions. The evaluation of unrtainties represents a method of probabilistic thinking wherein the analyst and decision makers recognize possible outcomes other than the outcome perceived to be "most likely." Without this type of analysis, it is not possible to determine the worth of an analysis product as a basis for making decisions related to safety and mission success. In line with these considerations the handbook does not take a hazard-analysis-centric approach to system safety. Hazard analysis remains a useful tool to facilitate brainstorming but does not substitute for a more holistic approach geared to a comprehensive identification and understanding of individual risk issues and their contributions to aggregate safety risks. The handbook strives to emphasize the importance of identifying the most critical scenarios that contribute to the risk of not meeting the agreed-upon safety objectives and requirements using all appropriate tools (including but not limited to hazard analysis). Thereafter, emphasis shifts to identifying the risk drivers that cause these scenarios to be critical and ensuring that there are controls directed toward preventing or mitigating the risk drivers. To address these and other areas, the handbook advocates a proactive, analytic-deliberative, risk-informed approach to system safety, enabling the integration of system safety activities with systems engineering and risk management processes. It emphasizes how one can systematically provide the necessary evidence to substantiate the claim that a system is safe to within an acceptable risk tolerance, and that safety has been achieved in a cost-effective manner. The methodology discussed in this handbook is part of a systems engineering process and is intended to be integral to the system safety practices being conducted by the NASA safety and mission assurance and systems engineering organizations. The handbook posits that to conclude that a system is adequately safe, it is necessary to consider a set of safety claims that derive from the safety objectives of the organization. The safety claims are developed from a hierarchy of safety objectives and are therefore hierarchical themselves. Assurance that all the claims are true within acceptable risk tolerance limits implies that all of the safety objectives have been satisfied, and therefore that the system is safe. The acceptable risk tolerance limits are provided by the authority who must make the decision whether or not to proceed to the next step in the life cycle. These tolerances are therefore referred to as the decision maker's risk tolerances. In general, the safety claims address two fundamental facets of safety: 1) whether required safety thresholds or goals have been achieved, and 2) whether the safety risk is as low as possible within reasonable impacts on cost, schedule, and performance. The latter facet includes consideration of controls that are collective in nature (i.e., apply generically to broad categories of risks) and thereby provide protection against unidentified or uncharacterized risks.

Dezfuli, Homayoon↗

Complexity in scalable computing.

The rich history of scalable computing research owes much to a rapid rise in computing platform scale in terms of size and speed. As platforms evolve, so must algorithms and the software expressions of those algorithms. Unbridled growth in scale inevitably leads to complexity. This special issue grapples with two facets of this complexity: scalable execution and scalable development. The former results from efficient programming of novel hardware with increasing numbers of processing units (e.g., cores, processors, threads or processes). The latter results from efficient development of robust, flexible software with increasing numbers of programming units (e.g., procedures, classes, components or developers). The progression in the above two parenthetical lists goes from the lowest levels of abstraction (hardware) to the highest (people). This issue's theme encompasses this entire spectrum. The lead author of each article resides in the Scalable Computing Research and Development Department at Sandia National Laboratories in Livermore, CA. Their co-authors hail from other parts of Sandia, other national laboratories and academia. Their research sponsors include several programs within the Department of Energy's Office of Advanced Scientific Computing Research and its National Nuclear Security Administration, along with Sandia's Laboratory Directed Research and Development program and the Office of Naval Research. The breadth of interests of these authors and their customers reflects in the breadth of applications this issue covers. This article demonstrates how to obtain scalable execution on the increasingly dominant high-performance computing platform: a Linux cluster with multicore chips. The authors describe how deep memory hierarchies necessitate reducing communication overhead by using threads to exploit shared register and cache memory. On a matrix-matrix multiplication problem, they achieve up to 96% parallel efficiency with a three-part strategy: intra-node multithreading, non-blocking inter-node message passing, and a dedicated communications thread to facilitate concurrent communications and computations. On a quantum chemistry problem, they spawn multiple computation threads and communication threads on each node and use one-sided communications between nodes to minimize wait times. They reduce software complexity by evolving a multi-threaded factory pattern in C++ from a working, message-passing program in C.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Parallel Multivariate Spatio-Temporal Clustering of Large Ecological Datasets on Hybrid Supercomputers

A proliferation of data from vast networks of remote sensing platforms (satellites, unmanned aircraft systems (UAS), airborne etc.), observational facilities (meteorological, eddy covariance etc.), state-of-the-art sensors, and simulation models offer unprecedented opportunities for scientific discovery. Unsupervised classification is a widely applied data mining approach to derive insights from such data. However, classification of very large data sets is a complex computational problem that requires efficient numerical algorithms and implementations on high performance computing (HPC) platforms. Additionally, increasing power, space, cooling and efficiency requirements has led to the deployment of hybrid supercomputing platforms with complex architectures and memory hierarchies like the Titan system at Oak Ridge National Laboratory. The advent of such accelerated computing architectures offers new challenges and opportunities for big data analytics in general and specifically, large scale cluster analysis in our case. Although there is an existing body of work on parallel cluster analysis, those approaches do not fully meet the needs imposed by the nature and size of our large data sets. Moreover, they had scaling limitations and were mostly limited to traditional distributed memory computing platforms. We present a parallel Multivariate Spatio-Temporal Clustering (MSTC) technique based on k-means cluster analysis that can target hybrid supercomputers like Titan. We developed a hybrid MPI, CUDA and OpenACC implementation that can utilize both CPU and GPU resources on computational nodes. We describe performance results on Titan that demonstrate the scalability and efficacy of our approach in processing large ecological data sets.

Sreepathi, Sarat↗

General Effect of van der Waals Interactions on the Stability of Alkoxy Intermediates on Metal Surfaces

The critical role of noncovalent van der Waals (vdW) interactions in determining the relative thermodynamic stability of alkoxy intermediates has been demonstrated for the Cu(110) surface using a combination of experiment and theory. The results may be significant for the selectivity control of copper-based reactions of alcohols. Previous examination of this effect on Au(110) was also extended to include higher molecular weight alcohols; on Cu(110) and Au(110) the hierarchy for the strength of binding of the alkoxys was found to be the same within experimental accuracy, with alkoxy species of greater chain length being more stable. The equilibrium constants governing the competition of alcohol pairs for binding sites of the alkoxys are also similar on the two surfaces. These results reveal the generality of such vdW effects. In conclusion, this work expands the understanding of the role of vdW interactions on the binding efficacy of key reactive intermediates on metal surfaces, a key factor in the rational design of complex and selective catalytic processes.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Performance Models for the Spike Banded Linear System Solver

With availability of large-scale parallel platforms comprised of tens-of-thousands of processors and beyond, there is significant impetus for the development of scalable parallel sparse linear system solvers and preconditioners. An integral part of this design process is the development of performance models capable of predicting performance and providing accurate cost models for the solvers and preconditioners. There has been some work in the past on characterizing performance of the iterative solvers themselves. In this paper, we investigate the problem of characterizing performance and scalability of banded preconditioners. Recent work has demonstrated the superior convergence properties and robustness of banded preconditioners, compared to state-of-the-art ILU family of preconditioners as well as algebraic multigrid preconditioners. Furthermore, when used in conjunction with efficient banded solvers, banded preconditioners are capable of significantly faster time-to-solution. Our banded solver, the Truncated Spike algorithm is specifically designed for parallel performance and tolerance to deep memory hierarchies. Its regular structure is also highly amenable to accurate performance characterization. Using these characteristics, we derive the following results in this paper: (i) we develop parallel formulations of the Truncated Spike solver, (ii) we develop a highly accurate pseudo-analytical parallel performance model for our solver, (iii) we show excellent predication capabilities of our model – based on which we argue the high scalability of our solver. Our pseudo-analytical performance model is based on analytical performance characterization of each phase of our solver. These analytical models are then parameterized using actual runtime information on target platforms. An important consequence of our performance models is that they reveal underlying performance bottlenecks in both serial and parallel formulations. All of our results are validated on diverse heterogeneous multiclusters – platforms for which performance prediction is particularly challenging. Finally, we provide predict the scalability of the Spike algorithm using up to 65,536 cores with our model. In this paper we extend the results presented in the Ninth International Symposium on Parallel and Distributed Computing.

Manguoglu, Murat↗

Accelerating Nuclear Facility Mission Completion Through an Improved Chemical Hazard Control Strategy - 20460

Code of Federal Regulation (CFR) 10 CFR 830, Nuclear Safety Management [1], explicitly identifies hazardous materials in addition to radioactive materials when establishing the scope of materials that must be evaluated in Hazard Category (HC) 1, 2, and 3 nuclear facilities. This inclusion has led to a near decade-long progression of more and more rigorous application of chemical hazard controls in these facilities. The progressive addition of more rigorous chemical hazard controls has occurred across the Department of Energy (DOE) Complex, having been driven by contractors and regulators alike. However, chemical hazards in other DOE facilities have been, and continue to be, controlled using traditional industrial safety centered strategies. Thus, identical chemical hazards are controlled using dramatically different approaches based solely on the facility type. Not only are the controls different, the analysis and derivation rigor and requirements are also significantly different. In particular, chemical control derivation and application in non-nuclear facilities are much less onerous than the comprehensive hazard analysis process used in nuclear facilities, even in circumstances in which chemicals are not initiators to, or do not exacerbate a nuclear event. While the derivation and control approaches used in these two types of facilities are disparate, the safety results are similarly effective based on a review of reported chemical events from 2014 through 2018. While both approaches achieve comparable safety outcomes, the approach used in nuclear facilities results in significantly greater preparation costs and implementation costs. Furthermore, the problem with the differing approach is not relegated to the control preparation and implementation burden. The operational impact of potentially unnecessary controls slows mission completion without a corresponding increase in safety, not to mention the dilution of the importance of Technical Safety Requirements. The proposed solution must first include a critical and thorough examination of DOE Complex and top-tier chemical industry chemical hazard control practices, coupled with a similar examination of the driving facility regulatory requirements. Results from the examination can then be used to fuel a bold departure from current chemical control practices in Hazard Category 1, 2, and 3 nuclear facilities. Development of an improved and consistent chemical hazard control process would follow, one that continues to ensure safety while accelerating mission completion and significantly reducing the burden associated with chemical hazard control development and implementation. The improved process must establish a hierarchy where radiological hazards are addressed using safety class and safety significant controls and chemical hazards are addressed using overarching safety management programs (with limited unique exceptions). The improved Hazard Category 1,2, and 3 nuclear facility chemical hazard control strategy, while compliant with 10 CFR 830 [1], would be founded on the requirements in 10 CFR 851, Worker Safety and Health Program [2], and the complementary DOE O 151.1D, Comprehensive Emergency Management System [3]. In this way, the Hazard Category 1, 2, and 3 nuclear facility chemical hazard control strategy would, wherever appropriate, be the same process used at other DOE Complex facilities. Ultimately, the improved process will maintain safety and significantly reduce costs and life cycle risk through faster mission completion. (authors)

12 MANAGEMENT OF RADIOACTIVE AND NON-RADIOACTIVE W↗

Bridging Current Indirect and Future Direct Estimates of Convective Mass Flux Toward Quantifying the Role of Convective Cores on Anvil Area Time Tendencies

Anvil cloud spatial extent is strongly driven by convective mass flux. However, the lack of convective mass flux observations precludes global analyses of the functional relationship between anvil cloud area growth tendencies and convective areal coverage and vertical mass flux. Partly informed by analyses of a hierarchy of WRF mesoscale convective system (MCS) simulations, in this presentation, we discuss new work on estimating convective mass flux by way of an approach that casts the problem of quantifying convective mass flux into terms related to diabatic heating vertical structure, convective area and tropospheric stability. We demonstrate the usefulness of this approach at the MCS spatial scale via development of a simple, robust model that analytically connects system-scale convective mass flux and anvil cloud area growth rates. We show that the model predicts anvil area size changes in agreement with those observed in a global convective system tracking database (TOOCAN). An additional advantage of this approach for estimating convective mass flux is that it bridges future satellite mission plans for directly observing convective mass flux (e.g., AOS) with longer-record observations made by TRMM, GPM and satellite sounder mission data (the latter used for estimating stability) that, when combined, can be used for inferring convective mass fluxes at the MCS spatial scale spanning slowly changing, diverse environments. An evaluation and bridging of both direct and indirect approaches supports convective process analyses varying over longer time periods in this “era of convection.”

convective mass flux↗

Bridging current indirect and future direct estimates of convective mass flux toward quantifying the role of convective cores on anvil area time tendencies

Anvil cloud spatial extent is strongly driven by convective mass flux. However, the lack of convective mass flux observations precludes global analyses of the functional relationship between anvil cloud area growth tendencies and convective areal coverage and vertical mass flux. Partly informed by analyses of a hierarchy of WRF mesoscale convective system (MCS) simulations, in this presentation, we discuss new work on estimating convective mass flux by way of an approach that casts the problem of quantifying convective mass flux into terms related to diabatic heating vertical structure, convective area and tropospheric stability. We demonstrate the usefulness of this approach at the MCS spatial scale via development of a simple, robust model that analytically connects system-scale convective mass flux and anvil cloud area growth rates. We show that the model predicts anvil area size changes in agreement with those observed in a global convective system tracking database (TOOCAN). An additional advantage of this approach for estimating convective mass flux is that it bridges future satellite mission plans for directly observing convective mass flux (e.g., AOS) with longer-record observations made by TRMM, GPM and satellite sounder mission data (the latter used for estimating stability) that, when combined, can be used for inferring convective mass fluxes at the MCS spatial scale spanning slowly changing, diverse environments. An evaluation and bridging of both direct and indirect approaches supports convective process analyses varying over longer time periods in this “era of convection.”

convective mass flux↗

Properties of Feshbach and “shape”-resonances in ozone and their role in recombination reactions and anomalous isotope effects

Computational modelling of recombination reactions that form ozone require the inclusion of several quantum mechanical effects such as symmetry, zero-point energy, scattering resonances and tunneling. Major elements of theory for rigorous description of this process are reviewed, with emphasis on interpreting the famous anomalous isotope effect due to substitutions of 18 O. In this work, three reaction pathways, for the formation of symmetric and asymmetric isotopologues of ozone, are introduced and a hierarchy of theory levels is outlined. Lower levels of theory are used to account for the effects of symmetry, isotope mass, rotational excitations and vibrational zero-point energy differences. They happen to be equivalent to statistical descriptions of the process and do not show anomalous isotope effects. Properties of scattering resonances should be included at the next level of theory, and may finally explain the isotope effect. Shape resonances, trapped behind the centrifugal barrier and populated by tunneling, can be studied by neglecting couplings between the diabatic ro-vibrational states of the system. Inclusion of these couplings enables the formation of Feshbach resonances. Accurate calculations using hyper-spherical coordinates are performed to obtain resonance energies, lifetimes and wavefunctions. Differences between the shape resonances and Feshbach resonances are emphasized.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Editorial: Lignocellulose valorization: Fractionation, conversion and applications

Lignocellulosic biomass is the most abundant form of renewable feedstock on the Earth. Chemicals, energies, and materials derived from lignocellulosic biomass are renewable and sustainable, and have the potential to replace fossil feedstocks. Biorefinery, a process to fractionate lignocellulose into the three major components, is considered the most pivotal step for bioenergy, biomaterials and biochemicals. However, due to the complex hierarchy and chemical structures, only limited lignocellulose is valorized into value-added products, and most of them are burnt or just discarded. Therefore, there is a need to investigate the heterogeneous structure of lignocellulose, improve its efficient fractionation into cellulose, hemicelluloses and lignin, and develop the technology that can convert the lignocellulose into high-value chemical products and high-performance functional materials in a sustainable and promising configuration. In short, the ultimate goal of biomass utilization is that the production of biofuels and biomaterials in industrial applications must be cost-, and performance-competitive with petroleum-derived equivalents.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Parameterized Micro-benchmarking: An Auto-tuning Approach for Complex Applications

Auto-tuning has emerged as an important practical method for creating highly optimized implementations of key computational kernels and applications. However, the growing complexity of architectures and applications is creating new challenges for auto-tuning. Complex applications can involve a prohibitively large search space that precludes empirical auto-tuning. Similarly, architectures are becoming increasingly complicated, making it hard to model performance. In this paper, we focus on the challenge to auto-tuning presented by applications with a large number of kernels and kernel instantiations. While these kernels may share a somewhat similar pattern, they differ considerably in problem sizes and the exact computation performed. We propose and evaluate a new approach to auto-tuning which we refer to as parameterized micro-benchmarking. It is an alternative to the two existing classes of approaches to auto-tuning: analytical model-based and empirical search-based. Particularly, we argue that the former may not be able to capture all the architectural features that impact performance, whereas the latter might be too expensive for an application that has several different kernels. In our approach, different expressions in the application, different possible implementations of each expression, and the key architectural features, are used to derive a simple micro-benchmark and a small parameter space. This allows us to learn the most significant features of the architecture that can impact the choice of implementation for each kernel. We have evaluated our approach in the context of GPU implementations of tensor contraction expressions encountered in excited state calculations in quantum chemistry. We have focused on two aspects of GPUs that affect tensor contraction execution: memory access patterns and kernel consolidation. Using our parameterized micro-benchmarking approach, we obtain a speedup of up to 2 over the version that used default optimizations, but no auto-tuning. We demonstrate that observations made from microbenchmarks match the behavior seen from real expressions. In the process, we make important observations about the memory hierarchy of two of the most recent NVIDIA GPUs, which can be used in other optimization frameworks as well.

auto-tuning↗

libwfa: Wavefunction analysis tools for excited and open‐shell electronic states

Abstract An open‐source software library for wavefunction analysis, libwfa, provides a comprehensive and flexible toolbox for post‐processing excited‐state calculations, featuring a hierarchy of interconnected visual and quantitative analysis methods. These tools afford compact graphical representations of various excited‐state processes, provide detailed insight into electronic structure, and are suitable for automated processing of large data sets. The analysis is based on reduced quantities, such as state and transition density matrices (DMs), and allows one to distill simple molecular orbital pictures of physical phenomena from intricate correlated wavefunctions. The implemented descriptors provide a rigorous link between many‐body wavefunctions and intuitive physical and chemical models, for example, exciton binding, double excitations, orbital relaxation, and polyradical character. A broad range of quantum‐chemical methods is interfaced with libwfa via a uniform interface layer in the form of DMs. This contribution reviews the structure of libwfa and highlights its capabilities by several representative use cases. This article is categorized under: Software > Quantum Chemistry Theoretical and Physical Chemistry > Spectroscopy

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗