Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “LIBRARIES”

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 631 records · Page 35

Methods for transforming and expression screening of filamentous fungal cells with a DNA library

The present invention relates to methods for expression screening of filamentous fungal transformants, comprising: (a) isolating single colony transformants of a DNA library introduced into E. coli; (b) preparing DNA from each of the single colony E. coli transformants; (c) introducing a sample of each of the DNA preparations of step (b) into separate suspensions of protoplasts of a filamentous fungus to obtain transformants thereof, wherein each transformant contains one or more copies of an individual polynucleotide from the DNA library; (d) growing the individual filamentous fungal transformants of step (c) on selective growth medium, thereby permitting growth of the filamentous fungal transformants, while suppressing growth of untransformed filamentous fungi; and (e) measuring activity or a property of each polypeptide encoded by the individual polynucleotides. The present invention also relates to isolated polynucleotides encoding polypeptides of interest obtained by such methods, to nucleic acid constructs, expression vectors, and recombinant host cells comprising the isolated polynucleotides, and to methods of producing the polypeptides encoded by the isolated polynucleotides.

59 BASIC BIOLOGICAL SCIENCES↗

STANLEY (Sandia Text ANaLysis Extensible librarY) Ver. 1.1

Reusable, extensible text analysis library. This library forms the basis for the automated generation of cognitive models from text for Sandia's Cognition program. It also is the basis for the suite of underlying, related applications.

BENZ, ZACHARY↗

DIATOM (Data Initialization and Modification) Library Version 7.0

DIATOM is a library that provides numerical simulation software with a computational geometry front end that can be used to build up complex problem geometries from collections of simpler shapes. The library provides a parser which allows for application-independent geometry descriptions to be embedded in simulation software input decks. Descriptions take the form of collections of primitive shapes and/or CAD input files and material properties that can be used to describe complex spatial and temporal distributions of numerical quantities (often called “database variables” or “fields”) to help define starting conditions for numerical simulations. The capability is designed to be general purpose, robust and computationally efficient. By using a combination of computational geometry and recursive divide-and-conquer approximation techniques, a wide range of primitive shapes are supported to arbitrary degrees of fidelity, controllable through user input and limited only by machine resources. Through the use of call-back functions, numerical simulation software can request the value of a field at any time or location in the problem domain. Typically, this is used only for defining initial conditions, but the capability is not limited to just that use. The most recent version of DIATOM provides the ability to import the solution field from one numerical solution as input for another.

Crawford, David A.↗

MapReduce MPI library (MR-MPI) v. 1.0

The MapReduce MPI library is a software tool for performing MapReduce operations on a distributed memory parallel computer via message passing (MPI). These are data-processing or computational operations which achieve parallelism by breaking a large task into two stages, a map and a reduce . Each of these are formulated as simple on-processor functions which the user can easily write. The library assigns independent tasks to processors and performs the parallel data movement and transformations behind the scenes.

PLIMPTON, STEVEN↗

Persistent heap Management library

PERM is a C library for persistent heap management and is intended for use with a dynamic-memory allocator (e.g. malloc, free). The PERM memory allocator replaces the standard C dynamic memory allocation functions with compatible versions that provide persistent memory to application programs. Memory allocated with the PERM allocatory will persist between program invocations after a call to a checkpoint function. This function essentially saves the state of the heap and registered global variables to a file which may reside in flash memory or other node local storage. A few other functions are also provided by the library to manage checkpoint files. Global variables in an application can be marked persistent and be included in a checkpoint by using a compiler attribute defined as PERM. The PERM checkpoint methof is not dependent on the programming model ans works with distributed memory or shared memory programs.

Source record↗

Reflectance Spectroscopy for Sample Identification: Considerations for Quantitative Library Results at Infrared Wavelengths

Reflectance spectroscopy for sample identification has advanced greatly in terms automation by removing the plaguing necessity of sample preparation; automated instruments in the laboratory, in the field and at the process line have made “point and shoot” operation readily accessible, in some instances with standoff detection. For successful identification, however, it is imperative to have reference libraries that are well calibrated not only on the wavelength axis, but on the reflectance axis as well. Ideally, with proper calibration such libraries would be portable to other systems.

calibration↗

Modernization of ORIGEN Library Creation in the SCALE Computer Code

The modernization of SCALE features has been a target for recent SCALE releases. ORIGEN, the activation and depletion code in SCALE, is one such legacy code that has been targeted for modernization. A part of these modernization efforts has been to develop capabilities within ORIGEN to directly read ENDF-formatted data files. In addition, the input format for the COUPLE library creation utility was rewritten to a format more accessible to newer SCALE users. Finally, the ability of COUPLE to create ORIGEN libraries without sublibrary data has been added.KEYWORDS: ORIGEN, depletion, SCALE, API

Hart, Shane↗

Qualification of JEFF3.1.1 library for high conversion reactor calculations using the ERASME/R experiment

With its low CO{sub 2} production, Nuclear Energy appears to be an efficient solution to the global warming due to green-house effect. However, current LWR reactors are poor uranium users and, pending the development of Fast Neutron Reactors, alternative concepts of PWR with higher conversion ratio (HCPWR) are being studied again at CEA, first studies dating from the middle 80's. In these French designs, low moderation ratio has been performed by tightening the lattice pitch, achieving a conversion ratio of 0.8-0.9 with a MOX fuel coming from PWR UOX recycling. Theses HCPWRs are characterized by a harder neutron spectrum and the calculation uncertainties on the fundamental neutronics parameters are increased by a factor 3 regarding a standard PWR lattice, due to the major contribution of the Plutonium isotopes and of the epithermal energy range to the reaction rates. In order to reduce these uncertainties, a 3-year experimental validation program called ERASME has been performed by CEA from 1984 to 1986 in the EOLE reactor. Monte Carlo analysis of the ERASME/R experiments with the Monte Carlo code TRIPOLI4 allowed the qualification of the recommended JEFF.3.1.1 library for major neutronics parameters. K{sub eff} of the MOX under-moderated lattice is over-predicted by 440 {+-} 830 pcm (2{sigma}); the conversion ratio, indicator of the good use of uranium, is also slightly over-predicted: 2 % {+-} 4 % (2{sigma}) and the same for B4C absorber rods worth and soluble boron worth, over-predicted by 2 %, both in the 2 standard deviations range. The radial fission maps of heterogeneities (water-holes, B4C and fertile rods) are well reproduced: maximal (C-E)/E dispersion is 1.3 %, maximal power peak error is 2.7 %. The void reactivity worth is the only parameter poorly calculated with an overprediction of +12.4% {+-} 1.5%. ERASME/R analysis of MOX reactivity, void effect and spectral indexes will contribute to the reevaluation of {sup 241}Am and Plutonium isotopes nuclear data for the next library JEFF3.2. (authors)

21 SPECIFIC NUCLEAR REACTORS AND ASSOCIATED PLANTS↗

Neutron/gamma coupled library generation and gamma transport calculation with KARMA 1.2

KAERI has developed a lattice transport calculation code KARMA and its multi-group cross section library generation system. Recently, the multi-group cross section library generation system has included a gamma cross section generation capability and KARMA also has been improved to include a gamma transport calculation module. This paper addresses the multi-group gamma cross section generation capability for the KARMA 1.2 code and the preliminary test results of the KARMA 1.2 gamma transport calculations. The gamma transport calculation with KARMA 1.2 gives the gamma flux, gamma smeared power, and gamma energy deposition distributions. The results of the KARMA gamma calculations were compared with those of HELIOS and they showed that KARMA 1.2 gives reasonable gamma transport calculation results. (authors)

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

Hydrologic Nuclide Transport Models in Cyder, A Geologic Disposal Software Library - 13328

Component level and system level abstraction of detailed computational geologic repository models have resulted in four rapid computational models of hydrologic radionuclide transport at varying levels of detail. Those models are described, as is their implementation in Cyder, a software library of interchangeable radionuclide transport models appropriate for representing natural and engineered barrier components of generic geology repository concepts. A proof of principle demonstration was also conducted in which these models were used to represent the natural and engineered barrier components of a repository concept in a reducing, homogenous, generic geology. This base case demonstrates integration of the Cyder open source library with the Cyclus computational fuel cycle systems analysis platform to facilitate calculation of repository performance metrics with respect to fuel cycle choices. (authors)

12 MANAGEMENT OF RADIOACTIVE AND NON-RADIOACTIVE W↗

A Conceptual World Information Library (WIL) and Land Use Information System (LUIS) - 16181

The Organization for Economic Co-operation and Development Nuclear Energy Agency initiative on the Preservation of Records, Knowledge and Memory is addressing the topic of communicating with future generations on the location, specific contents, and potential risks associated with deep geologic nuclear waste repositories. At the Waste Isolation Pilot Plant (WIPP) in the United States, the U.S. Department of Energy (DOE) has committed, prior to the facility closure, to develop a Passive Institutional Controls (PICs) program designed to last as long as practicable. A portion of this PICs program includes development of records packages, selection of data storage materials and methods, and a determination of records retention/storage locations. The approved plan for record retention at WIPP includes the storage of information including hard copies of data, figures and maps in multiple libraries and archive record centers. With this in mind, it is easy to envision reams of various paper documents in a robust physical archive record center similar to one of the museums in Washington D.C., or DOE's Legacy Management facility in Morgantown, West Virginia. While some portion of records for nuclear waste burial sites should be maintained in this fashion for near-term retrieval purposes, it is widely accepted that this is not an efficient way to communicate with future generations even 1,000 years from now. Transmitting large detailed volumes of information to the future should be captured in an electronic format; maintained on computers, translated by computers, and perhaps updated by artificial intelligence as machine and human languages change over the centuries. In addition to a physical records development and storage process for transmittal to future generations, a web-based electronic database system should be developed. A World Electronic Library (WEL) database could be funded from various nations and perhaps sanctioned by the United Nations and/or the IAEA. This WEL could contain information regarding several different subjects with the intent of being a one-stop-information-shop for future generations. This database would require updates and maintenance for as long as there is a recipient. One subset of the WEL would be a spatial database containing all the information available to any set of GPS coordinates, anywhere within the world. This Land Use Information System (LUIS) database would contain information on past and present land use, natural resources, known geology, hydrology and atmospheric conditions, potential warnings, and other pertinent information. The LUIS database is where specific electronic information, a subset of all the records data gathered for a nuclear waste repository, could reside. For not only would LUIS provide the information on a nuclear waste repository when specific GPS coordinates were entered; but a search from the LUIS on 'Nuclear Waste Repositories' could bring up information, including data on location of repositories, radionuclides, operations, D and D, maps, and regulations, plus many other details for locations throughout the world. This tool could be used by future generations for a number of land use or resource exploration decisions. So what can we do now? We can agree to the types of information that should be captured into an electronic database for nuclear waste repositories. We can agree to the levels of detail, the file names and the formats, for ease of combining information sets in the future. Perhaps we can agree to a central electronic data storage site, or sites, where this information will reside for import into a centralized electronic record system, if one is ever developed. (authors)

12 MANAGEMENT OF RADIOACTIVE AND NON-RADIOACTIVE W↗

Investigation of Portable Event-Based Monte Carlo Transport Using the NVIDIA Thrust Library

Power consumption considerations are driving future high performance computing platforms toward many-core computing architectures. Los Alamos National Laboratory's Trinity machine, available in 2016, will use both Intel Xeon Haswell processors and Intel Xeon Phi Knights Landing many integrated core (MIC) architecture coprocessors. Lawrence Livermore National Laboratory's Sierra machine, available in 2018, will use an IBM PowerPC architecture along with Nvidia graphics processing unit (GPU) architecture accelerators. These different advanced architectures make the computing landscape in upcoming years complex. Traditional approaches to Monte Carlo transport do not work efficiently on these new computing platforms. MIC architectures require vectorization to operate efficiently, and vectorization is difficult to achieve in Monte Carlo transport. GPU architectures require additional code to explicitly use the hardware, requiring significant code changes or hardware specific branches in the source code. A significant challenge for Monte Carlo transport projects is to simultaneously support within a single source code base efficient simulations for both the current generation of architectures and the different advanced computing architectures. In order to address these challenges, two important changes are typically required: a new algorithmic approach for solving Monte Carlo transport, and explicit use of hardware specific software. In this paper, we describe initial research investigations of an event-based Monte Carlo transport algorithm implemented using the Nvidia Thrust library on a GPU for a Monte Carlo test code. The event-based algorithm targets many-core architectures by increasing SIMD (single instruction multiple data) parallelism, while Thrust potentially provides portable performance by allowing one source code base to compile code targeted for both CPUs and GPUs. We described preliminary investigations of portable event-based Monte Carlo algorithms implemented using the Nvidia Thrust library in a research Monte Carlo test code. We found that an explicit CUDA implementation of an event-based Monte Carlo algorithm performed significantly more efficiently than a Thrust implementation on GPU platforms, most likely as a result of additional flexibility in access to different memory spaces on the GPU. Additionally, we showed that on GPU platforms and at large enough problem sizes the event-based implementations perform more efficiently than the serial history-based implementation running on the host CPU. While investigating this problem, we also discovered that the performance of the event-based algorithm is affected by what tallies are being used. A zonal scalar flux tally requires atomic operations that significantly impacted the performance of the code, in some cases producing slowdowns instead of speedups. We decided to remove the tally in order to focus on the effectiveness of the event-based algorithm. Future work will be required to research more effective ways of handling such tallies. Additionally, we would like to consider new ways for optimizing both the Thrust and CUDA versions, in order to see how much performance we have yet to achieve. The potential trade-off between portability and performance was demonstrated in this investigation. Thrust provides both CPU and GPU versions of the code in one code base, but it does so at a cost. We discovered approximately a factor of 2-5 performance difference between Thrust and CUDA on each GPU platform we tested. Thrust provides a tool to access the GPUs with less effort and specialization, but it does so by giving up fine grained control where extra performance can be found for this application. Future work will be required to determine whether this performance differential between Thrust and CUDA can be reduced for event-based Monte Carlo transport. (authors)

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Algorithmic Improvements for Portable Event-Based Monte Carlo Transport Using the Nvidia Thrust Library

High performance computing environments are progressively moving towards many-core computing architectures. The Los Alamos National Laboratory Trinity machine, available in late 2016, will use both Intel Xeon Haswell processors and Intel Xeon Phi Knights Landing many integrated core (MIC) coprocessors. The Lawrence Livermore National Laboratory Sierra machine, available in 2018, will use an IBM PowerPC architecture along with Nvidia graphics processing units (GPUs). Applications that must work in this supercomputing environment must continue to adapt in order to take advantage of the diverse hardware architectures that are coming. A significant consideration is not only the performance of the application on a given platform but also the portability of the application to other platforms. The algorithmic improvements presented in this paper build upon recently-reported work on event-based Monte Carlo transport in the ALPSMC code that models particle transport in one-dimensional binary stochastic media. That paper discussed the lack of available vectorization in the traditional history-based algorithm used for Monte Carlo transport and presented a data parallel event-based algorithm implemented using the Nvidia Thrust library for portability. The performance of the data parallel event-based algorithm implemented using Thrust was compared to a native CUDA implementation. The conclusions from that work were that the Thrust library abstraction technique caused too significant a loss in performance but that the event-based method was a viable option that should be further investigated. In this paper, we describe algorithmic improvements to the data parallel event-based algorithm previously presented. We made further algorithmic optimizations to the event-based CUDA implementation, most notably: data structure changes, a new conditional particle removal scheme in the event-based process, and the use of multiple GPUs. In addition to improvements to the algorithm, we re-implemented the Thrust version from the now further optimized CUDA version, giving a greater chance for success at a performant abstraction. Finally, we revisited our previous assumptions about the inability of the history-based method to achieve performance on vector style architectures such as the MICs and GPUs, with surprising and promising results. (authors)

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Improved Gamma Yield and Interaction Cross-Section Libraries of MC2-3

The MC{sup 2}-3 code developed by Argonne National Laboratory (ANL) has been widely used for multigroup cross section generation for fast reactor design and analysis. The neutron cross sections generated with MC{sup 2}-3 have been validated with various fast critical experiments. The gamma production data and interaction cross sections were also verified with the EBR-II benchmark problem. The current gamma calculation process is based on the 21-group gamma libraries generated with the NJOY code, which does not include the delayed gamma production and does not account for the self-shielding effect on the KERMA (Kinetic Energy Released in Material) factor. In order to improve gamma prediction accuracy, the gamma libraries of MC{sup 2}-3 have recently been extended from 21 to 94 groups, including delayed gamma data and kinetic energy release per reaction data. The latter is used to take into account the self-shielding effect on KERMA factors. Gamma transport calculation capabilities have also been added to MC{sup 2}-3. In this paper, we present the updated data and gamma transport capabilities along with the verification tests with ABTR and EBR-II benchmark problems. (authors)

21 SPECIFIC NUCLEAR REACTORS AND ASSOCIATED PLANTS↗

Investigation of the Impact of TSL Data Libraries and Geometry Variations on the MSRE Benchmark

The increasing demand for green, low-carbon energy solutions has amplified the focus on advanced nuclear reactor technologies. Among these, Molten Salt Reactors (MSRs) have been spotlighted because of their special features. Historically, Oak Ridge National Laboratory (ORNL) started the Molten Salt Reactor Experiment (MSRE) in 1956. Later, ORNL and the University of California, Berkeley (UCB) jointly developed the MSRE benchmark. This was then reviewed by the International Reactor Physics Experiment Evaluation Project (IRPhEP) committee and added to their 2019 handbook. In the current study, the benchmark model was recreated via the Serpent code. The calculated effective multiplication factor was 1.02087 ± 0.00019, which gives a deviation of about 2000 pcm compared to the benchmark/experimental result. At North Carolina State University (NCSU), recent evaluations were conducted on thermal scattering cross sections for molten salt FLiBe and 20% porous nuclear graphite, anticipated for incorporation in the ENDF/B-VIII.1 library. The influences of these thermal scattering law (TSL) data and geometry changes on the multiplication factor were examined using the ENDF/B-VII.1 and ENDF/B-VIII.0 libraries. Introducing the TSL data for FLiBe and 20% porous graphite resulted in an effective multiplication factor of +270 pcm compared to the reference value obtained with ENDF/B-VII.1 in this study. The adjustment of the reactor vessel dimensions resulted in decrease of -448 pcm in the calculated effective multiplication factor.

11 NUCLEAR FUEL CYCLE AND FUEL MATERIALS↗

Porting the Nonlinear Optimization Library HiOp to Accelerator-Based Hardware Architectures

While interior point method has been the centerpiece of nonlinear programming tools used in science and engineering, its reliance on linear solvers that can tackle sparse symmetric indefinite and highly ill-conditioned problems made it difficult to implement it effectively on hardware accelerators. HiOp optimization package attempts to provide an implementation of the interior point method suitable for hardware accelerators by compressing the original sparse problem to produce an underlying linear problem that is dense and of manageable size. Implementations of dense linear solvers are more mature and utilize hardware accelerators better than their sparse counterparts. There is a number of important domain problems, such as optimal power flow analysis for power grids, where the sparse problem can be effectively compressed and deploying dense linear solver within the interior point method can improve performance. Here we describe a portable implementation of HiOp optimization engine, which uses a linear solver from Magma library and runs entirely on hardware accelerators. To compress the problem, HiOp uses customized mixed dense-sparse linear algebra. All HiOp kernels are implemented using Umpire and RAJA portability libraries. We describe details of the implementation and discuss trade-offs between performance, portability and development cost.

97 MATHEMATICS AND COMPUTING↗

Advanced Cross Section Library Generation using Reduced Order Models

Deterministic neutronics calculations rely on multigroup neutron cross section libraries, which consist of databases of tabulated values, used to calculate the neutron cross sections through multivariate linear interpolation. However, interpolation of the multidimensional cross section data becomes memory inefficient and time consuming as the number of tabulations increases, significantly slowing down the neutronics calculation, especially in the case of microscopic cross section libraries where every isotope (on the order of hundreds) has its own set of specific reactions and cross sections. In order to address this challenge, this work constructs efficient and robust reduced-order models (ROMs) of the multi-group cross sections to support the Griffin simulation of high-temperature gas-cooled reactors (HTGRs). The first part of the study investigates the linearity of the multigroup cross section data across isotopes, reaction types, and energy groups on pre-generated datasets for the purpose of dimensionality reduction. Secondly, a down-selection of ROM techniques is presented on representative classical machine learning (ML) techniques, including variants of linear regression, kernel-based methods, tree-based algorithms, and artificial neural networks. The selection criteria jointly consider the memory efficiency, predictive accuracy, prediction speed, and scalability in comparison to the multidimensional interpolation. Among all the ML techniques, deep neural networks (DNNs) have proven to be the best selection with sufficient accuracy, high robustness, good memory efficiency, great scalability, and superior flexibility. DNNs have been trained for all isotopes in this work and systematic Griffin testing is ongoing to ensure the feasibility of this ROM technique for predicting cross section and reducing memory requirements without a significant sacrifice in computational performance.

42 - ENGINEERING↗