Search NASA⌕ Search

SEARCH · Search NASA

Results for “code sharing”

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 73 records · Page 4

Residential Energy Efficiency and the Three Rs: Resistance, Resilience, and Recovery

The Building America Solution Center focuses primarily on providing best practices information on energy efficiency, indoor air quality, and water efficiency. While gathering information to address building practices that can improve disaster resistance, resilience, and recovery, it became apparent that there is a significant amount of overlap in areas of home construction related to energy efficiency and in areas related to resiliency. This paper will explore three areas where mutual goals and/or experience may be beneficial to both camps in meeting objectives related to efficient, resistant, resilient, and recoverable homes. The first is the common basis in building science that each industry must draw on to design and build adequate houses. This portion of the paper will include a discussion of photovoltaics. The second is the shared experiences each industry faces in market transformation and achieving changes in building codes. We will explore lessons that these industries may share around economic criteria, incentives, and prescriptive measures in code. And finally, this paper will address the role that insurance companies play in achieving changes in building practices related to energy efficiency and disaster planning.

residential, energy efficiency, disaster resistanc↗

Wasatch: An architecture-proof multiphysics development environment using a Domain Specific Language and graph theory

To address the coding and software challenges of modern hybrid architectures, we propose an approach to multiphysics code development for high-performance computing. This approach is based on using a Domain Specific Language (DSL) in tandem with a directed acyclic graph (DAG) representation of the problem to be solved that allows runtime algorithm generation. When coupled with a large-scale parallel framework, the result is a portable development framework capable of executing on hybrid platforms and handling the challenges of multiphysics applications. In addition, we share our experience developing a code in such an environment – an effort that spans an interdisciplinary team of engineers and computer scientists.

97 MATHEMATICS AND COMPUTING↗

Precision studies of observables in $p p \rightarrow W \rightarrow l\nu _l$ and $ pp \rightarrow \gamma ,Z \rightarrow l^+ l^-$ processes at the LHC

This report was prepared in the context of the LPCC "Electroweak Precision Measurements at the LHC WG" and summarizes the activity of a subgroup dedicated to the systematic comparison of public Monte Carlo codes, which describe the Drell-Yan processes at hadron colliders, in particular at the CERN Large Hadron Collider (LHC). This work represents an important step towards the definition of an accurate simulation framework necessary for very high-precision measurements of electroweak (EW) observables such as the $W$ boson mass and the weak mixing angle. All the codes considered in this report share at least next-to-leading-order (NLO) accuracy in the prediction of the total cross sections in an expansion either in the strong or in the EW coupling constant. The NLO fixed-order predictions have been scrutinized at the technical level, using exactly the same inputs, setup and perturbative accuracy, in order to quantify the level of agreement of different implementations of the same calculation. A dedicated comparison, again at the technical level, of three codes that reach next-to-next-to-leading-order (NNLO) accuracy in quantum chromodynamics (QCD) for the total cross section has also been performed. These fixed-order results are a well-defined reference that allows a classification of the impact of higher-order sets of radiative corrections. Several examples of higher-order effects due to the strong or the EW interaction are discussed in this common framework. Also the combination of QCD and EW corrections is discussed, together with the ambiguities that affect the final result, due to the choice of a specific combination recipe.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

An improved dataset for predicting mammal infecting viruses from genetic sequence information

There have been several attempts to develop machine learning (ML) models to identify human infecting viruses from their genomic sequences, with varying degrees of success. Direct comparison between models is problematic, because these models are typically trained and evaluated on different datasets with alternative data splitting schemes, features, and model performance metrics. In this paper we present a standardized dataset of mammal infecting and non-infecting viral pathogens, refined from the previous work of Mollentze et al. to include the latest literature evidence, roughly doubling the number of curated host-virus records available to the community, and new host target labels, primate and mammal. The new host labels were included for several reasons, including previous reports that classification performance is better at broader taxonomic ranks and the idea that there may be more data for primate infection that might serve as a suitable proxy for zoonotic potential and avoidance of false positives for human infection due to absence of evidence. On this dataset, we report the performance of eight machine learning models for predicting mammal-infecting viruses from their genomic sequences. We find that randomly assigning cases in our improved dataset to training/testing sets, when compared to the original assignments into training/testing in Mollentze et al., increases the overall average ROC AUC of prediction of human infection from 0.663 ± 0.070 to 0.784 ± 0.013, consistent with the reduction in phylogenetic distance between train and test sets (relative entropy change from 3.00 to 0.08). The broadest host category of mammal infection can be predicted most reliably at 0.850 ± 0.020. We share our improved dataset and code to enable standardized comparisons of machine learning methods to predict human host infections. Overall, we have presented preliminary evidence that classification of virus host infection is more tractable at higher taxonomic ranks, that unsurprisingly reducing the phylogenetic distance between training and test sets can improve predictive performance, that peptide kmer features appear to be harmful to out of sample model performance, and we are left with the question of whether models for virus host prediction can reasonably be expected to perform well in out of sample scenarios given the likelihood that viruses do not share a common ancestor. Consistent with this concern, when the data is resampled such that there is no overlap between viral families in training and test sets (relative entropy > 24), models perform no better than random chance at prediction of human infection regardless of whether kmers are included (ROC AUC 0.50 ± 0.08) or not (ROC AUC 0.50 ± 0.04).

59 BASIC BIOLOGICAL SCIENCES↗

Computational Performance [Slides]

How do we want to consider computational performance? For instance, it tends to fall “between the cracks” of our communities. How have we considered it in the past? How do we avoid code-to-code comparisons, e.g. keep it internal but share lessons learned or ways to measure performance? How do we handle different types of codes, e.g. single-physics, multi-physics? How to consider this considering our plans to port to new machines?

97 MATHEMATICS AND COMPUTING↗

Do Programmers Prefer Predictable Expressions in Code?

Source code is a form of human communication, albeit one where the information shared between the programmers reading and writing the code is constrained by the requirement that the code executes correctly. Programming languages are more syntactically constrained than natural languages, but they are also very expressive, allowing a great many different ways to express even very simple computations. Still, code written by developers is highly predictable, and many programming tools have taken advantage of this phenomenon, relying on language model surprisal as a guiding mechanism. Additionally, while surprisal has been validated as a measure of cognitive load in natural language, its relation to human cognitive processes in code is still poorly understood. In this paper, we explore the relationship between surprisal and programmer preference at a small granularity—do programmers prefer more predictable expressions in code? Using meaning-preserving transformations, we produce equivalent alternatives to developer-written code expressions and run a corpus study on Java and Python projects. In general, language models rate the code expressions developers choose to write as more predictable than these transformed alternatives. Then, we perform two human subject studies asking participants to choose between two equivalent snippets of Java code with different surprisal scores (one original and transformed). We find that programmers do prefer more predictable variants, and that stronger language models like the transformer align more often and more consistently with these preferences.

97 MATHEMATICS AND COMPUTING↗

Snowmass Computational Frontier: Topical Group Report on Experimental Algorithm Parallelization

The substantial increase in data volume and complexity expected from future experiments will require significant investment to prepare experimental algorithms. These algorithms include physics object reconstruction, calibrations, and processing of observational data. In addition, the changing computing architecture landscape, which will be primarily composed of heterogeneous resources, will continue to pose major challenges with regard to algorithmic migration. Portable tools need to be developed that can be shared among the frontiers (e.g., for code execution on different platforms) and opportunities, such as forums or cross-experimental working groups, need to be provided where experiences and lessons learned can be shared between experiments and frontiers. At the same time, individual experiments also need to invest considerable resources to develop algorithms unique to their needs (e.g., for facilities dedicated to the experiment), and ensure that their specific algorithms will be able to efficiently exploit external heterogeneous computing facilities. Common software tools represent a cost-effective solution, providing ready-to-use software solutions as well as a platform for R&D work. These are particularly important for small experiments which typically do not have dedicated resources needed to face the challenges imposed by the evolving computing technologies. Workforce development is a key concern across frontiers and experiments, and additional support is needed to provide career opportunities for researchers working in the field of experimental algorithm development. Finally, cross-discipline collaborations going beyond high-energy physics are a key ingredient to address the challenges ahead and more support for such collaborations needs to be created. This report targets future experiments, observations and experimental algorithm development for the next 10-15 years.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Residual entanglement of accelerated fermions is useful

The non-vanishing residual entanglement, between the fermionic modes in the infinite acceleration limit, does not violate CHSH inequality, therefore it is not non-local. In this paper, we study the usefulness of the residual fermionic entanglement in single mode approximation and beyond single mode approximation. It is shown that there are some cases where the CHSH inequality is not violated by the residual entanglement, but the state is useful for quantum teleportation. Conditions for the violation of the CHSH inequality in terms of the “presence probability” of the particle in different Rindler regions are given for the state to be useful for teleportation and superdense coding. - Highlights: • Werner state is shared between an inertial observer and a uniformly accelerated one. • Single mode and beyond single mode approximation are considered. • Usefulness of residual entanglement in the infinite acceleration limit is studied. • The CHSH inequality and the quantum teleportation are used as a criterion. • Useful states for quantum information processing are found in the infinite acceleration.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Reproducibility in materials informatics: lessons from ‘A general-purpose machine learning framework for predicting properties of inorganic materials’

The integration of machine learning techniques in materials discovery has become prominent in materials science research and has been accompanied by an increasing trend towards open data and open-source tools to propel the field. Despite the increasing usefulness and capabilities of these tools, developers neglecting to follow reproducible practices presents a significant barrier for other researchers looking to use or build upon their work. In this study, we investigate the challenges encountered while attempting to reproduce a section of the results presented in “A general-purpose machine learning framework for predicting properties of inorganic materials.” Our analysis identifies four major categories of challenges: (1) reporting software dependencies, (2) recording and sharing version logs, (3) sequential code organization, and (4) clarifying code references within the manuscript. The result is a proposed set of tangible action items for those aiming to make material informatics tools accessible to, and useful for the community.

36 MATERIALS SCIENCE↗

SU-F-P-10: A Web-Based Radiation Safety Relational Database Module for Regulatory Compliance

Purpose: Maintaining compliance with Radioactive Materials Licenses is inherently a time-consuming task requiring focus and attention to detail. Staff tasked with these responsibilities, such as the Radiation Safety Officer and associated personnel must retain disparate records for eventual placement into one or more annual reports. Entering results and records in a relational database using a web browser as the interface, and storing that data in a cloud-based storage site, removes procedural barriers. The data becomes more adaptable for mining and sharing. Methods: Web-based code was written utilizing the web framework Django, written in Python. Additionally, the application utilizes JavaScript for front-end interaction, SQL, HTML and CSS. Quality assurance code testing is performed in a sequential style, and new code is only added after the successful testing of the previous goals. Separate sections of the module include data entry and analysis for audits, surveys, quality management, and continuous quality improvement. Data elements can be adapted for quarterly and annual reporting, and for immediate notification of user determined alarm settings. Results: Current advances are focusing on user interface issues, and determining the simplest manner by which to teach the user to build query forms. One solution has been to prepare library documents that a user can select or edit in place of creation a new document. Forms are being developed based upon Nuclear Regulatory Commission federal code, and will be expanded to include State Regulations. Conclusion: Establishing a secure website to act as the portal for data entry, storage and manipulation can lead to added efficiencies for a Radiation Safety Program. Access to multiple databases can lead to mining for big data programs, and for determining safety issues before they occur. Overcoming web programming challenges, a category that includes mathematical handling, is providing challenges that are being overcome.

61 RADIATION PROTECTION AND DOSIMETRY↗

SOX2-driven enhancer landscape defines the transcriptional architecture of retinogenesis

Retinal neurogenesis is mediated by the coordinated activities of a complex gene regulatory network (GRN) of transcription factors (TFs) in multipotent retinal progenitor cells (RPCs). How this GRN mechanistically guides neural competence remains poorly understood. In this study, we present integrated transcriptional, genetic and genomic analyses to uncover the regulatory mechanisms of SOX2, a key factor in establishing neural identity in RPCs. We show that SOX2 is preferentially enriched in the RPC-specific enhancer landscape associated with essential regulators of retinogenesis. Disruption of SOX2 expression impairs retinogenesis, marked by a selective loss of enhancer activity near genes essential for RPC proliferation and lineage specification. We identified the RPC transcription factor VSX2 as a binding partner for SOX2 and, together, SOX2 and VSX2 co-target a core, retina-specific chromatin repertoire characterized by enhanced TF binding and robust chromatin accessibility. This cooperative binding establishes a shared SOX2-VSX2 transcriptional code that promotes the expression of crucial regulators of neurogenesis while repressing the acquisition of alternative lineage cell fate. Our data illuminate fundamental biological insights on how transcription factors act in concert to drive chromatin-based genetic programs underlying retinal neural identity.

Chromatin↗

Level-2 Milestone 5588: Deliver Strategic Plan and Initial Scalability Assessment by Advanced Architecture and Portability Specialists Team

This report documents the fact that the work in creating a strategic plan and beginning customer engagements has been completed. The description of milestone is: The newly formed advanced architecture and portability specialists (AAPS) team will develop a strategic plan to meet the goals of 1) sharing knowledge and experience with code teams to ensure that ASC codes run well on new architectures, and 2) supplying skilled computational scientists to put the strategy into practice. The plan will be delivered to ASC management in the first quarter. By the fourth quarter, the team will identify their first customers within PEM and IC, perform an initial assessment and scalability and performance bottleneck for next-generation architectures, and embed AAPS team members with customer code teams to assist with initial portability development within standalone kernels or proxy applications.

97 MATHEMATICS AND COMPUTING↗

Comparison of Auxenochlorella protothecoides and Chlorella spp. Chloroplast Genomes: Evidence for Endosymbiosis and Horizontal Virus-like Gene Transfer

Resequencing of the chloroplast genome (cpDNA) of Auxenochlorella protothecoides UTEX 25 was completed (GenBank Accession no. KC631634.1), revealing a genome size of 84,576 base pairs and 30.8% GC content, consistent with features reported for the previously sequenced A. protothecoides 0710, (GenBank Accession no. KC843975). The A. protothecoides UTEX 25 cpDNA encoded 78 predicted open reading frames, 32 tRNAs, and 4 rRNAs, making it smaller and more compact than the cpDNA genome of C. variabilis (124,579 bp) and C. vulgaris (150,613 bp). By comparison, the compact genome size of A. protothecoides was attributable primarily to a lower intergenic sequence content. The cpDNA coding regions of all known Chlorella species were found to be organized in conserved colinear blocks, with some rearrangements. The Auxenochlorella and Chlorella species genome structure and composition were similar, and of particular interest were genes influencing photosynthetic efficiency, i.e., chlorophyll synthesis and photosystem subunit I and II genes, consistent with other biofuel species of interest. Phylogenetic analysis revealed that Prototheca cutis is the closest known A. protothecoides relative, followed by members of the genus Chlorella. The cpDNA of A. protothecoides encodes 37 genes that are highly homologous to representative cyanobacteria species, including rrn16, rrn23, and psbA, corroborating a well-recognized symbiosis. Several putative coding regions were identified that shared high nucleotide sequence identity with virus-like sequences, suggestive of horizontal gene transfer. Despite these predictions, no corresponding transcripts were obtained by RT-PCR amplification, indicating they are unlikely to be expressed in the extant lineage.

59 BASIC BIOLOGICAL SCIENCES↗

Implementation of Krylov acceleration method for 3D S{sub N} transport code AETIUS with unstructured tetrahedral mesh - 25557

We have been developing an in-house deterministic neutron and gamma transport solver, AETIUS (An Easy modeling Transport code using Unstructured tetrahedral mesh, Shared memory parallel). To achieve fast results, BiCGStab (one of the Krylov acceleration methods) was implemented as a within-group iteration solver. In this paper, two test problems (simple double cube problem and helical tube in the outer cube problem) were used to verify the acceleration performance. The number of iterations and the calculation time were demonstrated and compared with the source iteration. (authors)

61 RADIATION PROTECTION AND DOSIMETRY↗

Current Status of Problem 2 in the HTGR T/H Benchmark

Problem 2 of the HTGR T/H Benchmark is for modeling the depressurized conduction cooldown (DCC) transient. This presentation shares the status of code-to-code and code-to-date comparisons (Exercises 1 and 2) of Problem 2 with results from several participants. A key factor in the discrepancy between results and data in Exercise 2 is the assumed power distribution that is used to model PG-29. This talk highlights both the similarities and differences in solutions and discusses areas where further investigation is merited.

22 - GENERAL STUDIES OF NUCLEAR REACTORS↗

Modernization efforts for the R -Matrix code SAMMY [Abstract]

The R-Matrix code SAMMY is a widely used nuclear data evaluation code focused on the resolved range, which includes corrections for experimental effects. The code is still mostly written in Fortran 77, and uses a memory management system suitable for the time of its initial writing (1984). A modernization effort is under way to bring the code in-line with modern software development practices. A continuous-integration testing framework was added, automating the large existing set of test cases. It is run on every commit. The memory management was updated to current standard practices suitable for modern software analysis tools. The code can be obtained from https://code.ornl.gov/RNSD/SAMMY. The resonance parameters and covariance information are now stored in C++ objects shared by SAMMY and AMPX, the processing code that generates nuclear data libraries for SCALE. This allows for easier maintenance and access to the resonance parameters inside and outside of SAMMY. This feature is already used by accessing and changing parameters in memory in the Bayesian Monte Carlo Evaluation Framework for Cross Sections Nuclear Data and Integral Benchmark Experiments project, Further plans include the switch to the ENDF reading and writing routines in AMPX, as these routines are more robust, easier to maintain, and support more features. Of note here is support for the new GNDS format. Previously it wasn’t easy to share the full covariance matrix for evaluations containing more than one isotope due to limitations on the ENDF format; this is now supported in GNDS. The data are currently available in a binary SAMMY format and can be exported to GNDS to make them more widely available and sharable. The next step will be to use the same resonance processing code at 0K in AMPX and SAMMY as one of the available Reich-Moore R-Matrix formalism. The first step toward this goal is to isolate the reconstruction into a module that takes resonance parameters as its input and does not depend on SAMMY global parameters. This goal has been achieved and it should now be possible to more easily change the resonance formalism and add enhancements as the Phenomenological R-Matrix parameterization of direct, doorway, and compound nuclear reactions discussed elsewhere on this conference. This concerted modernization and enhancement effort provides multiple advantages to the nuclear data community. It will allow parameter optimization using enhanced formalisms, including experimental effects, that better match complex experimental data. Then those evaluated parameters can immediately be passed off to AMPX to be reconstructed with the exact same cross section model and be put into a data library for subsequent testing using SCALE and the Valid Benchmark suite or other suitable benchmark suites.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Multi-node and Multi-core Performance Studies of a Monte Carlo code RMC

Over the past 15 years the architecture of high-performance computing systems has become increasingly heterogeneous with individual computing cores being subdivided into nodes and even auxiliary co-processing units such as graphics processing units or the Intel many integrated core co-processors. In fact, future computer platforms is moving toward a larger number of nodes and cores with lower memory available per node. Today, several production Monte Carlo codes use some types of hybrid parallelism strategy that makes use of shared-memory parallelism within a computing node and message-passing parallelism between nodes, which enables the codes to utilize available computing resources as much as possible, both among and within computing nodes on a cluster. The so-called hybrid parallelization is also possible with Reactor Monte Carlo Code RMC by activating both MPI and OpenMP parallel algorithms together. On HPC' which typically consists of several or several-ten thousand nodes equipping 16-32 computing intra-cores per node, simulation of RMC can be carried out in the hybrid parallelization with the MPI inter-node parallelization and the OpenMP intra-node parallelization. RMC has adopted a hybrid message-passing and shared-memory approach to parallelism, which enables the code to utilize available computing resources, both among and within computing nodes on a cluster. Shared-memory parallelism is especially valuable for large-model simulations because it enables multiple compute cores within a node to share common model information such as the geometry description, material, cross section and tally data, thus reducing the memory usage per processor. The calculation on the Tianhe-2 supercomputer took 6144 cores, resulting in a rate of 173,314,000 neutrons/minute for BEAVRS benchmark. While pin-wise full core H-M benchmark burnup calculations with millions of depletion regions was selected using MPI/OpenMP parallelism, the speed of 6,144 cores reach 1,843,200 burnable regions per minute. Keeping up with the continuing trend for increases in the number of computing resources within modern HPC systems is a significant challenge for teams that develop and maintain high-performance MC radiation transport solvers. order to address this challenge, RMC has adopted a hybrid message-passing and shared-memory approach to parallelism, which enables the code to utilize available computing resources, both among and within computing nodes on a cluster. Shared-memory parallelism is especially valuable for large-model simulations because it enables multiple compute cores within a node to share common model information such as the geometry description, material and composition definitions, and cross section data, thus reducing the memory usage per processor. The parallel performance has been studied by using two complex and representative benchmarks, H-M and BEAVRS benchmark. All simulations were run on Intel Xeon E5-2692 12 core, 2.2 GHz processors at MilkyWay-2 Super Computer with up to 12,288 available computing cores. While employing MPI parallelism, excellent parallel efficiency is achieved even above 12,000 processors and RMC reaches the parallel efficiency of 96% on 12,288 cores for the pin-by-pin computation of the BEAVRS benchmark. While BEAVRS criticality benchmark was selected using MPI/OpenMP parallelism, the speed of 6,144 cores reach 173,314,000 particles per minute. While pin-wise full core H-M benchmark burnup calculations with millions of depletion regions was selected using MPI/OpenMP parallelism, the speed of 6,144 cores reach 1,843,200 burnable regions per minute. Results from these studies demonstrate that RMC, using the hybrid parallel model described in this paper, is able to handle pin-wise full core burnup calculations with millions of depletion regions and scales well through thousands of processors. (authors)

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Compact, low power, high resolution ADC per pixel for large area pixel detectors

A compact ADC circuit can include one or more comparators, and a serial DAC (Digital-to-Analog) circuit that provides a signal to the comparator (or comparators). In addition, the ADC circuit can include a serial DAC redistribution sequencer that can provide a plurality of signals as input to the serial DAC circuit and is subject to a redistribution cycle and which receives as input a signal from a data multiplexer whose input connects electronically to an output of the comparator. The circuit can further include an ADC code register that provides an ADC output that connects electronically to the output of the comparator and the input to the data multiplexer. Shared logic circuitry for sharing common logic between pixels can be included, wherein the shared logic circuitry connects electronically to the data multiplexer and the ADC code register, wherein the shared logic circuitry promotes area and power savings for the pixel detector circuit.

Zimmerman, Tom↗