A Compilation of Internship Reports - 2016
This was prepared for the Office of Educational Programs, Brookhaven National Laboratory, Office of Educational Programs.
SEARCH · Search NASA
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.
This was prepared for the Office of Educational Programs, Brookhaven National Laboratory, Office of Educational Programs.
The National Household Travel Survey (NHTS) ran from April 19, 2016, through April 25, 2017. It collected data on the demographic and socioeconomic composition of households, as well as detailed information on travel behavior nationwide. State transportation departments and metropolitan planning agencies had the opportunity to purchase extra household samples as part of the NHTS add-on program. These additional samples, along with national samples collected in the add-on areas, are compiled for use in transportation planning, forecasting, and research. The Indian Nations Council of Governments participated in the NHTS add-on program and received a total of 1,049 household samples in Oklahoma. (The total number of household samples nationwide is 129,112.)
It is a fascinating phenomenon in nuclear physics that states with a pronounced few-body structure can emerge from the complex dynamics of many nucleons. Such halo or cluster states often appear near the boundaries of nuclear stability. As such, they are an important part of the experimental program beginning at the Facility for Rare Isotope Beams (FRIB). A concerted effort of theory and experiment is necessary both to analyze experiments involving effective few-body states, as well as to constrain and refine theories of the nuclear force in light of new data from these experiments. Here, as a contribution to exactly this effort, this paper compiles a collection of “perspectives” that emerged out of the Topical Program “Few-body cluster structures in exotic nuclei and their role in FRIB experiments” that was held at FRIB in August 2022 and brought together theorists and experimentalists working on this topic.
Template metaprogramming is gaining popularity as a high-level solution for achieving performance portability on heterogeneous computing resources. Kokkos is a representative approach that offers programmers high-level abstractions for generic programming while most of the device-specific code generation and optimizations are delegated to the compiler through template specializations. For this, Kokkos provides a set of device-specific code specializations in multiple back ends, such as CUDA and HIP. Unlike CUDA or HIP, OpenACC is a high-level and directive-based programming model. This descriptive model allows developers to insert hints (pragmas) into their code that help the compiler to parallelize the code. The compiler is responsible for the transformation of the code, which is completely transparent to the programmer. This paper presents an OpenACC back end for Kokkos: KokkACC. As an alternative to Kokkos’s existing device-specific back ends, KokkACC is a multi-architecture back end providing a high-productivity programming environment enabled by OpenACC’s high-level and descriptive programming model. Moreover, we have observed competitive performance; in some cases, KokkACC is faster (up to 9×) than NVIDIA’s CUDA back end and much faster than OpenMP’s GPU offloading back end. This work also includes implementation details and a detailed performance study conducted with a set of mini-benchmarks (AXPY and DOT product) and three mini-apps (LULESH, miniFE and SNAP, a LAMMPS proxy mini-app).
The National Household Travel Survey (NHTS) ran from April 19, 2016, through April 25, 2017. It collected data on the demographic and socioeconomic composition of households, as well as detailed information on travel behavior nationwide. State transportation departments and metropolitan planning agencies had the opportunity to purchase extra household samples as part of the NHTS add-on program. These additional samples, along with national samples collected in the add-on areas, are compiled for use in transportation planning, forecasting, and research. The Des Moines Area Metropolitan Planning Organization participated in the NHTS add-on program and received a total of 1,293 household samples in Iowa. (The total number of household samples nationwide is 129,112.)
This data upload includes a compilation of experiments for quantifying uranium adsorption onto quartz. The provided .csv file has been compiled from the literature in a findable, accessible, interoperable, reusable (FAIR) data format. This was accomplished using the Lawrence Livermore National Laboratory Surface Complexation Database Converter (SCDC) code written in the R programming language (free licensing available at https://ipo.llnl.gov/technologies/software/llnl-surface-complexation-database-converter-scdc). This constitutes all current data compiled on uranium-quartz interactions in the L-SCIE (LLNL Surface Complexation/Ion Exchange) database (as of 02/28/2022). This data was used to develop surface complexation models that fit the global community dataset (https://doi.org/10.1021/acs.est.1c07109). The FAIR-formatted dataset also enables the implementation of alternative machine-learning approaches that can be explored in the future.
This report is prepared for the Office of Educational Programs, Brookhaven National Laboratory and the Office of Educational Programs.
This report was prepared for the Office of Educational Programs, Brookhaven National Laboratory, Office of Educational Programs.
This report was prepared for the Office of Educational Programs Brookhaven National Laboratory Office of Educational Programs.
A suite of non-proprietary C-like procedures (code) that compile and run within the commercial Igor Pro data analysis program (wavemetrics.com) have been developed for the data file loading, plotting and analysis of Angle-Resolved Photoemission Spectroscopy (ARPES) data. The data file loading procedures are more specific to ARPES data acquisition and file formats at Advanced Light Source (ALS) beamlines, while plotting and analysis procedures are more generic to processing of 1D, 2D and higher dimensional dataset arrays with some specific tools tailored to the ARPES technique.
Play fairway analysis (PFA) is a methodology that can improve success rates for geothermal exploration drilling, thus reducing the costs of geothermal projects while facilitating development in new areas. It was originally developed for the oil and gas industry, but has been adapted for discovering geothermal resources over the last decade. The geothermal PFA methodology involves systematically screening a set geographic area for promising qualities typically related to the presence of heat, permeability, and fluid. Successful application of PFA can identify hidden hydrothermal systems. From 2014 to 2021 the U.S. Department of Energy (DOE) Geothermal Technologies Office (GTO) supported the development of PFA for geothermal resources through awards to 11 research teams across the country. The goal of these projects was to advance and adapt PFA for geothermal exploration to produce regional-scale maps that reduce exploration uncertainty. This report is an outcome of the NREL-led PFA Retrospective project, which compiled, synthesized, analyzed the results of GTO's geothermal PFA program. Ultimately, we find that these projects greatly advanced approaches to geothermal exploration and resulted in extensive new data and new discoveries of unrecognized geothermal systems. We used the results to distill best practices in this report and to provide guidance for future applications of geothermal PFA.
This report summarizes the Preliminary Enhanced Low-Activity Waste Glass Formulation Algorithm (GFA), its background information, and the calculations it performs. The Preliminary Enhanced Low-Activity Waste GFA is a tool developed in MATLAB to formulate glass for a given waste composition while attempting to maximize waste loading. It is intended for use at the Waste Treatment and Immobilization Plant, where nuclear waste will be vitrified into glass. The formulated glass is required to satisfy several processing and product quality constraints. In addition, calculations must account for associated uncertainties in constraint prediction and measurement. The GFA adheres to Pacific Northwest National Laboratory nuclear quality assurance procedures and has been validated and verified. In this second revision to the report, two constraints: the lithium and zirconia target constraints were amended to Table 3.1 and programmed into the algorithm. Additionally, three sections were added. Section 3.2.1 includes the Enhanced LAW Correlation Rules, an addition to the glass optimality criteria. Section 4.0 discusses a stepped process approach taken to ensure the algorithm can adequately react to differences between its recommended output and the actual measurements and transfers made during plant operation, and calculation of specific radionuclide concentrations. Section 5.2 describes changes to the user interaction with the algorithm program including the addition of a graphical user interface and compilation of the software.
Background: Analysis of Lexis diagrams (population-based cancer incidence and mortality rates indexed by age group and calendar period) requires specialized statistical methods. However, existing methods have limitations that can now be overcome using new approaches. Methods: We assembled a “toolbox” of novel methods to identify trends and patterns by age group, calendar period, and birth cohort. We evaluated operating characteristics across 152 cancer incidence Lexis diagrams compiled from United States (US) Surveillance, Epidemiology and End Results Program data for 21 leading cancers in men and women in four race and ethnicity groups (the “cancer incidence panel”). Results: Nonparametric singular values adaptive kernel filtration (SIFT) decreased the estimated root mean squared error by 90% across the cancer incidence panel. A novel method for semi-parametric age-period-cohort analysis (SAGE) provided optimally smoothed estimates of age-period-cohort (APC) estimable functions and stabilized estimates of lack-of-fit (LOF). SAGE identified statistically significant birth cohort effects across the entire cancer panel; LOF had little impact. As illustrated for colon cancer, newly developed methods for comparative age-period-cohort analysis can elucidate cancer heterogeneity that would otherwise be difficult or impossible to discern using standard methods. Conclusions: Cancer surveillance researchers can now identify fine-scale temporal signals with unprecedented accuracy and elucidate cancer heterogeneity with unprecedented specificity. Birth cohort effects are ubiquitous modulators of cancer incidence in the US. The novel methods described here can advance cancer surveillance research.
Dynamically field-programmable qubit arrays (DPQA) have recently emerged as a promising platform for quantum information processing. In DPQA, atomic qubits are selectively loaded into arrays of optical traps that can be reconfigured during the computation itself. Leveraging qubit transport and parallel, entangling quantum operations, different pairs of qubits, even those initially far away, can be entangled at different stages of the quantum program execution. Such reconfigurability and non-local connectivity present new challenges for compilation, especially in the layout synthesis step which places and routes the qubits and schedules the gates. In this paper, we consider a DPQA architecture that contains multiple arrays and supports 2D array movements, representing cutting-edge experimental platforms. Within this architecture, we discretize the state space and formulate layout synthesis as a satisfiability modulo theories problem, which can be solved by existing solvers optimally in terms of circuit depth. For a set of benchmark circuits generated by random graphs with complex connectivities, our compiler OLSQ-DPQA reduces the number of two-qubit entangling gates on small problem instances by 1.7x compared to optimal compilation results on a fixed planar architecture. To further improve scalability and practicality of the method, we introduce a greedy heuristic inspired by the iterative peeling approach in classical integrated circuit routing. Using a hybrid approach that combined the greedy and optimal methods, we demonstrate that our DPQA-based compiled circuits feature reduced scaling overhead compared to a grid fixed architecture, resulting in 5.1X less two-qubit gates for 90 qubit quantum circuits. These methods enable programmable, complex quantum circuits with neutral atom quantum computers, as well as informing both future compilers and future hardware choices.
Accelerated computing in HPC such as with GPU, plays a central role in HPC nowadays. However, in some complicated applications with partially different performance behavior is hard to solve with a single type of accelerator where GPU is not the perfect solution in these cases. We are developing a framework and transpiler allowing the users to program the codes with a single notation of OpenACC to be compiled for multi-hybrid accelerators, named MHOAT (Multi-Hybrid OpenACC Translator) for HPC applications. MHOAT parses the original code with directives to identify the target accelerating devices, currently supporting NVIDIA GPU and Intel FPGA, dispatching these specific partial codes to background compilers such as NVIDIA HPC SDK for GPU and OpenARC research compiler for FPGA, then assembles binaries for the final object with FPGA bitstream file. In this paper, we present the concept, design, implementation, and performance evaluation of a practical astrophysics simulation code where we successfully enhanced the performance up to 10 times faster than the GPU-only solution.
MUPPET is a tool for OpenMP programs that identifies program modifications, called mutations, aimed at improving program performance. Existing performance optimization techniques, including profiling-based and auto-tuning techniques, fail to indicate program modifications at the source level thus preventing their portability across compilers. MUPPET aims to help HPC developers reason about performance defects and missed opportunities to improve performance at the source code level.
Artificial intelligence and machine learning (AI/ML) are becoming important tools for scientific modeling and simulation as in several other fields such as image analysis and natural language processing. ML techniques can leverage the computing power available in modern systems and reduce the human effort needed to configure experiments, interpret and visualize results, draw conclusions from huge quantities of raw data, and build surrogates for physics based models. Domain scientists in fields like fluid dynamics, microelectronics and chemistry can automate many of their most difficult and repetitive tasks or improve the design times by use of the faster ML-surrogates. However, modern ML and traditional scientific highperformance computing (HPC) tend to use completely different software ecosystems. While ML frameworks like PyTorch and TensorFlow provide Python APIs, most HPC applications and libraries are written in C++. Direct interoperability between the two languages is possible but is tedious and error-prone. In this work, we show that a compiler-based approach can bridge the gap between ML frameworks and scientific software with less developer effort and better efficiency. We use the MLIR (multi-level intermediate representation) ecosystem to compile a pre-trained convolutional neural network (CNN) in PyTorch to freestanding C++ source code in the Kokkos programming model. Kokkos is a programming model widely used in HPC to write portable, shared-memory parallel code that can natively target a variety of CPU and GPU architectures. Our compiler-generated source code can be directly integrated into any Kokkosbased application with no dependencies on Python or cross-language interfaces.
Near-term intermediate scale quantum (NISQ) computers are likely to have very restricted hardware resources, where precisely controllable qubits are expensive, error-prone, and scarce. Programmers of such computers must therefore balance trade-offs among a large number of (potentially heterogeneous) factors specific to the targeted application and quantum hardware. To assist them, we propose Meta Quantum Circuits with Constraints (MQCC), a meta-programming framework for quantum programs. Programmers express their application as a succinct collection of normal quantum circuits stitched together by a set of (manually or automatically) added meta-level choice variables, whose values are constrained according to a programmable set of quantitative optimization criteria. MQCC’s compiler generates the appropriate constraints and solves them via an SMT solver, producing an optimized, runnable program. We showcase a few MQCC’s applications for its generality including an automatic generation of efficient error syndrome extraction schemes for fault-tolerant quantum error correction with heterogeneous qubits and an approach to writing approximate quantum Fourier transformation and quantum phase estimation that smoothly trades off accuracy and resource use. We also illustrate that MQCC can easily encode prior one-off NISQ application designs-–multi-programming (MP), crosstalk mitigation (CM)—as well as a combination of their optimization goals (i.e., a combined MP-CM).