Search NASA⌕ Search

SEARCH · Search NASA

Results for “Python implementation”

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 55 records · Page 3

Lagomorph

Existing tools for computational anatomy and image registration are not aimed at HPC environments. As such they are not easily adapted to multimode platforms and contain inefficient batch processing modes. Lagomorph addresses this by providing an easy to install and use pure python implementation of very efficient image registration and atlas building which is aimed at extreme-scale anatomical studies using modern HPC and GPU resources.

Hinkle, JacobD↗

Method of Moving Asymptotes Optimization Algorithm in Python

Python implementation of the Method of Moving Asymptotes optimization algorithm described in[Svanberg, K., The method of moving asymptotes- a new method for structural optimization. International journal for numerical methods in engineering, 1987. 24(2): p.359 (https://onlinelibrary.wiley.com/doi/abs/10.1002/nme.1620240207). Originally implemented in[GetDP](https://ieeexplore.ieee.org/stamp/stamp.jsp?arnumber=717799) [project](https://gitlab.onelab.info/getdp/getdp), although it has been deleted in their repository.

Salazar De Troya, Miguel↗

Dynamical Components Analysis (DCA) v1.0.0

Dynamical Components Analysis is a Python implementation of the method described in "Unsupervised discovery of temporal structure in noisy data with dynamical components analysis". It implements the method as well as related data analysis functions.

Livezey, Jesse↗

Dynamical Components Analysis (DCA) v1.0.0

Dynamical Components Analysis is a Python implementation of the method described in "Unsupervised discovery of temporal structure in noisy data with dynamical components analysis". It implements the method as well as related data analysis functions.

Livezey, Jesse↗

pyMSDtorch v0.1.0

pyMSDtorch is a python implementation of the MSDNet developed by Sethian and Pelt [1] for image analyses, using the pytorch framework. The availability these networks in mainstream ML packages makes it easier to attach standard expansions and other approaches to make it more flexible and user friendly.

Zwart, PetrusH↗

exodusii

SAND2022-1657 O exodusii is a Python implementation of the EXODUS finite element database model. Sandia National Laboratories is a multimission laboratory managed and operated by National Technology & Engineering Solutions of Sandia, LLC, a wholly owned subsidiary of Honeywell International Inc., for the U.S. Department of Energy’s National Nuclear Security Administration under contract DE-NA0003525.

Schoof, Larry↗

TICC Clustering Library v.1.0

SAND2024-01234O TICC is a clustering algorithm that labels a sequence of data points according to numerical properties. This library is a Python implementation of the algorithm described in "Toeplitz Inverse Covariance-Based Clustering of Multivariate Time Series Data" (Hallac et al. 2017). It includes documentation, performance improvements, examples, and test coverage. This library allows users to automatically segment a series of multivariate data points according to their covariance—that is, the way the values at each data point are changing in relation to one another. This is useful for identifying periods in which a system is behaving. For example, if a sensor is measuring a car's velocity, steering wheel angle, braking and acceleration, TICC can determine when the car was stopped, beginning/exiting a turn, slowing or accelerating at an intersection, or driving on straight or curved roads. TICC can be applied to measure multiple quantities at known times. Sandia National Laboratories is a multimission laboratory managed and operated by National Technology & Engineering Solutions of Sandia, LLC, a wholly owned subsidiary of Honeywell International Inc., for the U.S. Department of Energy’s National Nuclear Security Administration under contract DE-NA0003525

Dalbey, Keith↗

HIPPO Software

HIPPO software is a Python implementation of the HIPPO technology. The HIPPO technology provides the computational and modeling capabilities for managing electricity market operations and for designing and prototyping future markets. The current software can solve the day-ahead unit commitment problem and perform simultaneous feasibility test. It can be used to handle industry scale electricity market.

Peng, Fan↗

HPB_strengthmodel

Python-implementation of the Hunter-Preston strength model, but with generalized drag coefficient B. For details, see D. N. Blaschke, A. Hunter, and D. L. Preston, Int. J. Plast. 131 (2020) 102750. This code was used to generate most of the figures in this paper.

Blaschke, Daniel N.↗

qsp4pde v1.0

The software program is a collection of Python implementations of quantum circuits for solving linear partial differential equations using quantum signal processing. The circuits are implemented using the qiskit SDK.

Kim, Hyeongjin [Lawrence Berkeley National Laborat↗

pyFLANK, a graph neural network based null distribution inference model for F ST outlier detection

Detecting genomic regions under selection is essential for understanding how populations adapt to different environments, yet it remains challenging due to the confounding effects of demographic history and linkage disequilibrium (LD). Fixation index (F ST ) is a widely used statistic to identify genomic regions under adaptation. However, identifying genes under selection by defining F ST outliers often remains challenging, owing to confounding effects of underlying demographic history. Traditional methods assume independence among loci and rely on simple demographic models, while newer models perform much better but are computationally expensive and not easily scalable. Here, we present pyFLANK, an open-source and automated Python implementation which detects F ST outliers using a null distribution inferred from quasi-independent loci. Our tool integrates three approaches to identify loci obeying a null distribution: graph neural network (GNN) inference, linkage disequilibrium (LD)-based inference, and user-defined input. Because pyFLANK uses GNN-based inference of quasi-independent loci, it yields a more accurate null model with less need for user parameter input. In simulation experiments, pyFLANK achieved lower false positive rates than current methods while maintaining comparable detection power, indicating that its refined null model better distinguishes true adaptive loci from background variation. The GNN-based model, in particular, detected additional loci associated with phenotypic variance that were not identified by existing methods. Assessments of simulation and real data from different species demonstrate that pyFLANK achieves lower false positive rates compared with other commonly used F ST outlier detectors, while maintaining comparable detection power and excellent computational performance, providing a robust and user-friendly tool for identifying loci under divergent selection. It extends existing F ST outlier frameworks by incorporating explicit LD-aware strategies for null model calibration. The method is intended as a practical and scalable complement to existing genome scan approaches.

FST↗

Integrating guiding center motion in loop space

The purpose of this report is to demonstrate how the slow motion of loops coincides with GC dynamics and to report of Python implementation of loop space integrator.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Quantification of MagLIF Morphology using the Mallat Scattering Transformation

The morphology of the stagnated plasma resulting from Magnetized Liner Inertial Fusion (MagLIF) is measured by imaging the self-emission x-rays coming from the multi-keV plasma, and the evolution of the imploding liner is measured by radiographs. Equivalent diagnostic response can be derived from integrated rad-MHD simulations from programs such as Hydra and Gorgon. There have been only limited quantitative ways to compare the image morphology, that is the texture, of simulations and experiments. We have developed a metric of image morphology based on the Mallat Scattering Transformation (MST), a transformation that has proved to be effective at distinguishing textures, sounds, and written characters. This metric has demonstrated excellent performance in classifying ensembles of synthetic stagnation images. We use this metric to quantitatively compare simulations to experimental images, cross experimental images, and to estimate the parameters of the images with uncertainty via a linear regression of the synthetic images to the parameter used to generate them. This coordinate space has proved very adept at doing a sophisticated relative back-ground subtraction in the MST space. This was needed to compare the experimental self emission images to the rad-MHD simulation images. We have also developed theory that connects the transformation to the causal dynamics of physical systems. This has been done from the classical kinetic perspective and from the field theory perspective, where the MST is the generalized Green's function, or S-matrix of the field theory in the scale basis. From both perspectives the first order MST is the current state of the system, and the second order MST are the transition rates from one state to another. An efficient, GPU accelerated, Python implementation of the MST was developed. Future applications are discussed.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Coupling of MCNP and ABAQUS for Reactor Multiphysics (MARM) [Slides]

Summer 2021 Internship Objectives: Learn MCNP (Monte Carlo N-Particle) transport code - Unstructured Mesh & Burnup Features, and Implement Python Code for MARM framework - MARM = MCNP and Abaqus based Reactor Multiphysics. Slides provide background and details for achieving learning objectives, as well as ideas for future work in the area.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Peregrine Software Development: Report on the Code Conversion From Python to C++

This work package seeks to convert the Peregrine software tool from its original Python implementation to a production version based on the C++ language. Peregrine is a powerful research platform with a multitude of advanced data analytics and data visualization functionalities. Developed by scientists to explore multimodal and multidimensional data related to the production of components using powder bed additive manufacturing processes, the tool implements state-of-the-art algorithms to assist machine users in making build or part quality determinations. Given that Peregrine is data-intensive, the goal of this conversion is to enhance the tool’s flexibility and interactivity and reduce the number of code dependencies to facilitate its deployment as part of the ongoing technology transfer campaign. This brief document provides an overview of Peregrine’s functionalities and capabilities, along with a detailed description of the core functionalities that have been implemented to date in the new C++ version. This document serves as a development update at the end of the first year of the ongoing conversion and will be regularly updated as progress continues.

97 MATHEMATICS AND COMPUTING↗

Benchmarking Autonomous Scattering Experiments Illustrated on TAS

With the advancement of artificial intelligence and machine learning methods, autonomous approaches are recognized to have great potential for performing more efficient scattering experiments. In our view, it is crucial for such approaches to provide thorough evidence about respective performance improvements in order to increase acceptance within a scientific community. Therefore, we propose a benchmarking procedure designed as a cost-benefit analysis that is applicable to any scattering method sequentially collecting data during an experiment. For a given approach, the performance assessment is based on how much benefit, given a certain cost budget, it is able to acquire in predefined test cases. Different approaches thus get a chance for comparison and can make their advantages explicit and visible. Key components of the procedure, i.e., cost measures, benefit measures, and test cases, are made precise for the setting of three-axes spectrometry (TAS) as an illustration. Finally, we discuss neglected aspects and possible extensions for the TAS setting and comment on the procedure’s applicability to other scattering methods. A Python implementation of the procedure to simplify its utilization by interested researchers from the field is also provided.

36 MATERIALS SCIENCE↗

Constraining Genome-Scale Models to Represent the Bow Tie Structure of Metabolism for 13 C Metabolic Flux Analysis

Determination of internal metabolic fluxes is crucial for fundamental and applied biology because they map how carbon and electrons flow through metabolism to enable cell function. 13 C Metabolic Flux Analysis ( 13 C MFA) and Two-Scale 13 C Metabolic Flux Analysis (2S- 13 C MFA) are two techniques used to determine such fluxes. Both operate on the simplifying approximation that metabolic flux from peripheral metabolism into central “core” carbon metabolism is minimal, and can be omitted when modeling isotopic labeling in core metabolism. The validity of this “two-scale” or “bow tie” approximation is supported both by the ability to accurately model experimental isotopic labeling data, and by experimentally verified metabolic engineering predictions using these methods. However, the boundaries of core metabolism that satisfy this approximation can vary across species, and across cell culture conditions. Here, we present a set of algorithms that (1) systematically calculate flux bounds for any specified “core” of a genome-scale model so as to satisfy the bow tie approximation and (2) automatically identify an updated set of core reactions that can satisfy this approximation more efficiently. First, we leverage linear programming to simultaneously identify the lowest fluxes from peripheral metabolism into core metabolism compatible with the observed growth rate and extracellular metabolite exchange fluxes. Second, we use Simulated Annealing to identify an updated set of core reactions that allow for a minimum of fluxes into core metabolism to satisfy these experimental constraints. Together, these methods accelerate and automate the identification of a biologically reasonable set of core reactions for use with 13 C MFA or 2S- 13 C MFA, as well as provide for a substantially lower set of flux bounds for fluxes into the core as compared with previous methods. We provide an open source Python implementation of these algorithms at https://github.com/JBEI/limitfluxtocore.

13C metabolic flux analysis↗

The Impact of Void-finding Algorithms on Galaxy Classification

We explore how the definition of a void influences the conclusions drawn about the impact of the void environment on galactic properties using two void-finding algorithms in the Void Analysis Software Toolkit: Voronoi Voids (V 2 ), a Python implementation of ZOnes Bordering On Voidness (ZOBOV); and VoidFinder, an algorithm that grows and merges spherical void regions. Using the Sloan Digital Sky Survey Data Release 7, we find that galaxies found in VoidFinder voids tend to be bluer and fainter and to have higher (specific) star formation rates than galaxies in denser regions. Conversely, galaxies found in V 2 voids show less significant differences when compared to galaxies in denser regions, less consistent with the large-scale environmental effects on galaxy properties expected from both simulations and previous observations. These results align with previous simulation results that show V 2 -identified voids “leak” into the dense walls between voids because their boundaries extend up to the density maxima in the walls. As a result, when using ZOBOV-based void-finders, galaxies likely to be part of wall regions are instead classified as void galaxies, a misclassification that can be critical to our understanding of galaxy evolution.

cosmic web↗